5. Geographical routing
The idea behind geographic routing protocols is to use geographic information to route packets. To simplify the presentation, we'll assume that all nodes know their position, and that these nodes also know the position of all other nodes in the network. With these assumptions, it's easy to imagine that a node can easily choose from among its neighbors a relay to route a packet whose final destination it knows, and therefore also its position. It's very simple to envisage selection criteria among these neighbors; let's give a few examples from among the most classic heuristics.
A particularly simple heuristic is the one that chooses the neighbor who is closest to the final recipient's position. Another similar, albeit different, heuristic is the one that chooses the neighbor that makes the most progress towards the final recipient....
The Ultimate Scientific and Technical Reference
This article is included in
Networks and Telecommunications
This offer includes:
Knowledge Base
Updated and enriched with articles validated by our scientific committees
Services
A set of exclusive tools to complement the resources
Practical Path
Operational and didactic, to guarantee the acquisition of transversal skills
Doc & Quiz
Interactive articles with quizzes, for constructive reading
Geographical routing
Other technical problems encountered in ad hoc networks
Bibliography
Text references
The Ultimate Scientific and Technical Reference
