Frey, Hannes ; Hollick, Matthias ; Loch, Adrian (2011)
Curve-based Planar Graph Routing in Multihop Wireless Networks.
doi: 10.1109/MASS.2011.127
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (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.
| Typ des Eintrags: | Konferenzveröffentlichung |
|---|---|
| Erschienen: | 2011 |
| Autor(en): | Frey, Hannes ; Hollick, Matthias ; Loch, Adrian |
| Art des Eintrags: | Bibliographie |
| Titel: | Curve-based Planar Graph Routing in Multihop Wireless Networks |
| Sprache: | Deutsch |
| Publikationsjahr: | Oktober 2011 |
| Buchtitel: | 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS) |
| DOI: | 10.1109/MASS.2011.127 |
| Kurzbeschreibung (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. |
| Freie Schlagworte: | Secure Things |
| ID-Nummer: | TUD-CS-2011-2885 |
| Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Sichere Mobile Netze LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt |
| Hinterlegungsdatum: | 31 Dez 2016 11:08 |
| Letzte Änderung: | 10 Jun 2021 06:12 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum