Capacity and Delay Tradeoffs of MotionCast with Base Stations
Luoyi Fu, Sen Yang, Xinbing Wang, Xiaoying Gan · 2011
In this paper, we study the multicast capacity-delay tradeoff of a wireless network consisting of mobile wireless nodes and base stations. m = nbbase stations are regularly placed in a square region and n is the number of mobile nodes in the network. We assume that mobile nodes move according to an independent and identical distributed (i.i.d.) pattern and each desires to send packets to k = nddistinctive destinations. Under this basic network model, we study capacity, delay tradeoff in two transmission protocols: 2-hop relay algorithm with and without redundancy. We derive that the upper bound of per-node capacity of 2-hop relay algorithm without redundancy is O(n-min{1, 1 - b + d})and its corresponding delay is Θ(nmin{1, 1 - b + d}/2). The lower bound of delay of this protocol is Θ(n1-b), with a smaller capacity O(nb-2). For 2-hop relay algorithm with redundancy, the largest capacity and its corresponding delay are O(n-min{1, 1 - b + d}) and Θ(nmin{1, 1 - b + d}/2). The smallest delay and its corresponding capacity are Θ(n1 - b/2) and O(nb - 3/2). When d >; 1/2 or b >; min{1+d/3, 1 - d}, adding base stations will improve the tradeoff mentioned in [7].