Cooperation Achieves Optimal Multicast Capacity-Delay Scaling in MANET

• Published in: IEEE transactions on communications Vol. 60; no. 10; pp. 3023 - 3031
• Main Authors: Wang, Xinbing, Peng, Qiuyu, Li, Yingzhe
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.10.2012; Institute of Electrical and Electronics Engineers
• Subjects: Applied sciences; Capacity; cooperation; Delay; Equipments and installations; Exact sciences and technology; MANET; Markov processes; Mobile ad hoc networks; Mobile radiocommunication systems; multicast; Radiocommunications; Receivers; Redundancy; Relays; Systems, networks and services of telecommunications; Telecommunications; Telecommunications and information theory; Transmission and modulation (techniques and equipments); Unicast; Mobile radiocommunication; Mobile ad hoc network; Relay; Redundancy; Wireless telecommunication; Cell network; Data broadcast; Information dissemination; Multicast; MANET; Capacity; Delay time; cooperation
• ISSN: 0090-6778
• DOI: 10.1109/TCOMM.2012.081512.110535

In this paper, we focus on capacity-delay tradeoffs for multicast traffic pattern. Under the assumption that n nodes move in a unit square according to an i.i.d. mobility model, with each serving as a source that sends identical packets to k destinations, we propose four schemes of which the achievable capacity λ and delay D are analyzed: (1) 2-hop noncooperative non-redundancy scheme, (2) 2-hop noncooperative redundancy scheme, (3) 2-hop cooperative non-redundancy scheme, (4) 2-hop cooperative redundancy scheme. Compared with non-cooperative scheme with capacity delay tradeoff λ = O( E[D]/nk log k) first developed in [5], cooperation among destination nodes achieves optimal capacity delay tradeoff λ = O(E[D]/n log k) in cell partitioned network. With intelligent cooperation, each destination acts equivalently as relay and helps other destinations get more opportunities of receiving packets with capacity sacrificed to a addition, our redundancy schemes also allow delay under Θ(√n) log k factor compared with unicast in [3] under the same delay. In achievable, which is the minimum delay under the schemes of [3],[5].