This paper considers multihop wireless networks that are used for multicast traffic i.e., networks in which subsets of users are interested in identical information such as a video clipping. We calculate an upper bound on the achievable throughput per multicast flow as a function of the number of sources, number of destinations per source, number of interfaces per node, and the number of channels available. Then we propose a methodology that achieves the upper bound in an order sense under certain circumstances. We study the impact of the ratio of the number of channels to number of interfaces per node on the multicast capacity region of wireless networks.

This paper addresses the issues of declustering temporal index and access structures for a single processor multiple independent disk architecture. The temporal index is the Monotonic B/sup +/-Tree which uses the time index temporal access structure. We devise a new algorithm, called multi-level round robin, for assigning tree nodes to multiple disks. The multi-level round robin declustering technique takes advantage of the append-only nature of temporal databases to achieve uniform load distribution, decrease response time, and increase the fanout of the tree by eliminating the need to store disk numbers within the tree nodes. We propose two declustering techniques for the time index access structures; one considers only time proximity while declustering, whereas the other considers both time proximity and data size. We investigate their performance over different types of temporal queries and show that various temporal queries have conflicting allocation criteria for the time index buckets. In addition, we devise two disk partition techniques for the time index buckets. The mutually exclusive technique partitions the disks into disjoint groups, whereas the shared disk technique allows the different types of buckets to share all disks.>