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....
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Geographical routing
Article included in this offer
"Networks and Telecommunications"
(
170 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
Bibliography
Text references
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!