Name
Abstract | ||
|---|---|---|
Scalability of routing algorithms is a critical issue in large multihop wireless networks. In this sense, approaches like localized geographic routing are very promising. Existing schemes base routing path construction on faces defined by the planar graph of the network. Once running on a particular planar graph, none of the existing schemes is flexible enough to adapt the sequence of faces visited by the constructed path. To address this problem, we extend planar graph routing with one further degree of freedom: control over the sequence of visited faces. Basically, our face routing extension now follows a sequence of faces intersected by any curve we can freely adjust. We motivate our work by discussing application scenarios that benefit from our scheme and suggest basic mechanisms for choosing appropriate curves. We further present preliminary results from an implementation of our curve-based routing scheme. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/MASS.2011.127 | Mobile Adhoc and Sensor Systems |
Keywords | Field | DocType |
radio networks,routing protocols,telecommunication network reliability,curve-based planar graph routing,face routing extension,localized geographic routing,multihop wireless network,network protocol,routing algorithm scalability,Algorithms,localized routing,network protocols,routing algorithms,wireless multihop networks | Link-state routing protocol,Multipath routing,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Destination-Sequenced Distance Vector routing,Computer network,Wireless Routing Protocol,Geographic routing,Distributed computing | Conference |
ISSN | ISBN | Citations |
2155-6806 | 978-1-4577-1345-3 | 1 |
PageRank | References | Authors |
0.36 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hannes Frey | 1 | 1 | 0.36 |
| Matthias Hollick | 2 | 750 | 97.29 |
| Adrian Loch | 3 | 83 | 14.54 |