Graph embeddings for low-stretch greedy routing
The simplest greedy geometric routing forwards packets to make most progress in terms of geometric distance within reach. Its notable advantages are low complexity, and the use of local information only. However, two problems of greedy routing are that delivery is not always guaranteed, and that the...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2144/14117 |