Position-based routing in ad hoc networks
Indexed incrossref
Abstract
The availability of small, inexpensive low-power GPS receivers and techniques for finding relative coordinates based on signal strengths, and the need for the design of power-efficient and scalable networks provided justification for applying position-based routing methods in ad hoc networks. A number of such algorithms were developed previously. This tutorial will concentrate on schemes that are loop-free, localized, and follow a single-path strategy, which are desirable characteristics for scalable routing protocols. Routing protocols have two modes: greedy mode (when the forwarding node is able to advance the message toward the destination) and recovery mode (applied until return to greedy mode is…
Citation impact
650
total citations
- FWCI
- 21.48
- Percentile
- 100%
- References
- 17
Citations per year
Authors
1Topics & keywords
Topics
Keywords
- Computer science
- Computer network
- Link-state routing protocol
- Distributed computing
- Routing protocol
- Static routing
- Destination-Sequenced Distance Vector routing
- Dynamic Source Routing
No related works found for this paper.