Improving Delay in Ad-Hoc Mobile Networks Via Redundant Packet Transfers
Michael J. Neely, Eytan Modiano · 2003
Abstract — We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad-hoc network. To reduce delays in the network, each user sends redundant packet information along multiple paths to the destination. Such redundancy improves delay at the cost of increasing network congestion. Assuming the network has a cell partitioned structure and users move according to a simplified iid mobility model, we compute the exact network capacity and delay when no redundancy is used. The capacity achieving algorithm is a modified version of the Grossglauser-Tse 2-hop relay algorithm and provides ¢¡¤£¦¥ delay (where £ is the number of users). We then show that redundancy cannot increase capacity, but can significantly improve delay. A lower bound on delay of is computed for any algorithm (with or without redundancy) which restricts packets to 2-hop paths. A scheduling protocol which uses redundancy is presented and shown to achieve this delay bound when data rates of all sessions are reduced to ¢¡¨©��� § £¦ ¥. I.