MotionCast: on the capacity and delay tradeoffs

In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay 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 capacity and delay 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 capacity and delay for 2-hop algorithm without redundancy are (1/k) and (n log k), respectively; and for 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 in [3] as long a...

• Type: Conference
• Year: 2009
• Where: MOBIHOC
• Authors: Chenhui Hu, Xinbing Wang, Feng Wu
• Keywords: MOBIHOC 2009, Wireless Networks