Download now Free registration required
Previous work on delay-throughput trade-offs in mobile ad hoc networks have mostly been done under the assumption that nodes are homogeneous and uniformly visit the network area. In this paper, the authors have shown that this condition can be largely suboptimal. Restricted mobility, which is usually found in practice, can be exploited by intelligent scheduling-routing schemes which make use of the geographical information about the location most visited by a node. In particular, they have introduced a new class of scheduling routing schemes which significantly outperform all previously proposed schemes for a wide range of restricted mobility patterns.
- Format: PDF
- Size: 273.2 KB