Sciweavers

Share
BROADNETS
2004
IEEE

Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks

9 years 2 months ago
Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
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 packets along multiple paths to the destination. Assuming the network has a cell partitioned structure and users move according to a simplified independent and identically distributed (i.i.d.) mobility model, we compute the exact network capacity and the exact end-to-end queueing delay when no redundancy is used. The capacity-achieving algorithm is a modified version of the Grossglauser
Michael J. Neely, Eytan Modiano
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where BROADNETS
Authors Michael J. Neely, Eytan Modiano
Comments (0)
books