Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Queueing networks with discrete time scale: explicit expressions for the steady state behavior of discrete time stochastic networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
Route Reservation in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Understanding congestion control in multi-hop wireless mesh networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
A Methodology to Predicate Human-Being's Movement Based on Movement Group
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Network capacity of wireless ad hoc networks with delay constraint
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
| Hi-index | 0.00 |
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 iid mobility model, we compute the exact network capacity and the exact end-to-end queuing delay when no redundancy is used.The capacity achieving algorithm is a modified version of the Grossglauser-Tse 2-hop relay algorithm and provides O(N) delay (where N is the number of users). We then show that redundancy cannot increase capacity, but can significantly improve delay.The following necessary tradeoff is established: delay/rate 驴 O(N).Two protocols which use redundancy and operate near the boundary of this curve are developed, with delays of O(\sqrt {\text{N}}) and O(log(N)), respectively. Networks with non-iid mobility are also considered and shown through simulation to closely match the performance of iid systems in the O(\sqrt {\text{N}}) delay regime.