Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Multicast Scaling Properties in Massively Dense Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Delay and resource analysis in MANETs in presence of throwboxes
Performance Evaluation
Rendered path: range-free localization in anisotropic sensor networks with holes
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Relays, base stations, and meshes: enhancing mobile networks with infrastructure
Proceedings of the 14th ACM international conference on Mobile computing and networking
MotionCast: on the capacity and delay tradeoffs
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Multicast capacity of wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the super-critical regime
IEEE/ACM Transactions on Networking (TON)
Capacity scaling in ad hoc networks with heterogeneous mobile nodes: the subcritical regime
IEEE/ACM Transactions on Networking (TON)
Restricted mobility improves delay-throughput tradeoffs in mobile ad hoc networks
IEEE Transactions on Information Theory
Multicast capacity of wireless ad hoc networks under Gaussian channel model
IEEE/ACM Transactions on Networking (TON)
The multicast capacity of large multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
Capacity and delay tradeoffs for ad hoc mobile networks
IEEE Transactions on Information Theory
Optimal Delay–Throughput Tradeoffs in Mobile Ad Hoc Networks
IEEE Transactions on Information Theory
Multicast capacity-delay tradeoff with network coding in MANETs
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Systematic construction and verification methodology for LDPC codes
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Throughput and delay scaling laws for mobile overlaid wireless networks
Journal of Network and Computer Applications
Exploiting constructive interference for scalable flooding in wireless networks
IEEE/ACM Transactions on Networking (TON)
Asymptotic Analysis on Secrecy Capacity in Large-Scale Wireless Networks
IEEE/ACM Transactions on Networking (TON)
Delay and capacity in MANETs under random walk mobility model
Wireless Networks
Hi-index | 0.00 |
In this paper, we define multicast for an ad hoc network through nodes' mobility as MotionCast and study the delay and capacity tradeoffs for it. Assuming nodes move according to an independently and identically distributed (i.i.d.) pattern and each desires to send packets to k distinctive destinations, we compare the delay and capacity in two transmission protocols: one uses 2-hop relay algorithm without redundancy; the other adopts the scheme of redundant packets transmissions to improve delay while at the expense of the capacity. In addition, we obtain the maximum capacity and the minimum delay under certain constraints. We find that the per-node delay and capacity for the 2-hop algorithm without redundancy are Θ(1/k) and Θ(n log k), respectively; for the 2-hop algorithm with redundancy, they are Ω(1/k√n log k) and Θ(√n log k), respectively. The capacity of the 2-hop relay algorithm without redundancy is better than the multicast capacity of static networks developed by Li [IEEE/ACM Trans. Netw., vol. 17, no. 3, pp. 950-961, Jun. 2009] as long as k is strictly less than n in an order sense, while when k = Θ(n), mobility does not increase capacity anymore. The ratio between delay and capacity satisfies delay/rate ≥ O(nk log k) for these two protocols, which are both smaller than that of directly extending the fundamental tradeoff for unicast established by Neely and Modiano [IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1917-1937, Jun. 2005] to multicast, i.e., delay/rate ≥ O(nk2). More importantly, we have proved that the fundamental delay-capacity tradeoff ratio for multicast is delay/rate ≥ O(n log k), which would guide us to design better routing schemes for multicast.