Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Extracting places from traces of locations
ACM SIGMOBILE Mobile Computing and Communications Review
Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Capacity of a wireless ad hoc network with infrastructure
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Delay and capacity trade-offs in mobile ad hoc networks: a global perspective
IEEE/ACM Transactions on Networking (TON)
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Delay-throughput performance in mobile ad-hoc networks with heterogeneous nodes
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Capacity and delay of hybrid wireless broadband access networks
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Capacity Scaling in Mobile Wireless Ad Hoc Network with Infrastructure Support
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks
IEEE Transactions on Information Theory
Throughput scaling in wireless networks with restricted mobility
IEEE Transactions on Wireless Communications
Asymptotic Bounds of Information Dissemination in Power-Constrained Wireless Networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Throughput and Delay in Random Wireless Networks With Restricted Mobility
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We study multicast capacity for a large-scale spatial inhomogeneous mobile network consisting of n ad hoc nodes. Under our mobility model, the stationary spatial distribution of a node is non-uniform; each node spends most of the time in a certain region, and rarely (or never) visits out of such region. To characterize the inhomogeneity of the mobility model, we define an activity exponent @c and two clustering parameters (m(n),r(n)), where @c@?[0,1] measures the strength of node mobility, m(n) denotes the number of clusters, r(n) denotes the radius of the cluster. We classify the mobility into two cases according to the strength of mobility of each node, called strong and weak mobility, respectively. Two corresponding scheduling schemes and routing policies combined with the Manhattan multicast tree method are proposed. Suppose there are n"s=@Q(n) multicast sessions. Each source has n"d destinations which are selected randomly and independently. We show that under strong mobility case, the per-node multicast capacity is @Q1n"d@q(n) with @q(n)=n^1^-^@c^2; under weak mobility case, when n"d=Om(n)logm(n), the multicast throughput is @W1n"dm(n)n^2logm(n); when n"d=@Wm(n)logm(n), the multicast throughput is @W1n. Particularly, as a special case, i.e., by letting n"d=1, our results unify the previous unicast capacity bounds.