Not logged in.
Quick Search - Contribution
Contribution Details
| Type | Conference or Workshop Paper |
| Scope | Learning and pedagogical Research |
| Published in Proceedings | Yes |
| Title | Efficient Greedy Geographical Non-Planar Routing with Reactive Deflection |
| Organization Unit |
|
| Authors |
|
| Presentation Type | paper |
| Item Subtype | Original Work |
| Refereed | Yes |
| Status | Published in final form |
| Language |
|
| Page Range | 1 - 5 |
| Event Title | ICC 2009 - 2009 IEEE International Conference on Communications |
| Event Type | conference |
| Event Location | Dresden |
| Event Start Date | July 14 - 2009 |
| Event End Date | July 18 - 2009 |
| Place of Publication | Piscataway, New Jersey, US |
| Publisher | IEEE |
| Abstract Text | We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible greedy routing scheme that can be adapted to any variant of geographical routing and works for any connectivity graph, not necessarily Unit Disk Graphs. The idea is to reactively detect voids, backtrack packets, and propagate information on blocked sectors to reduce packet loss. We also propose an extrapolating algorithm to reduce the latency of void discovery and to limit route stretch. Performance evaluation via simulation shows that our modified greedy routing avoids most of packet losses. |
| Digital Object Identifier | 10.1109/ICC.2009.5198972 |
| Other Identification Number | merlin-id:18083 |
| PDF File |
Download from ZORA
|
| Export |
BibTeX
EP3 XML (ZORA)
|