Loch, Adrian ; Frey, Hannes ; Hollick, Matthias (2013)
Curve-based Planar Graph Routing with Guaranteed Delivery in Multihop Wireless Networks.
In: Pervasive and Mobile Computing
doi: 10.1016/j.pmcj.2013.03.004
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
Localized geographic routing schemes operating on planar graphs promise scalability for use within large multihop wireless networks. However, none of the existing schemes is flexible enough to adapt the sequence of faces visited by the constructed path. Thus, real-world constraints may severely impact the network performance. To address this problem, we extend planar graph routing to allow the algorithm to forward packets along a sequence of faces intersected by any arbitrary curve. We analytically prove that this extended scheme is loop free and allows for guaranteed delivery. Furthermore, we investigate schemes for choosing curves dealing with imperfections in the network.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2013 |
| Autor(en): | Loch, Adrian ; Frey, Hannes ; Hollick, Matthias |
| Art des Eintrags: | Bibliographie |
| Titel: | Curve-based Planar Graph Routing with Guaranteed Delivery in Multihop Wireless Networks |
| Sprache: | Deutsch |
| Publikationsjahr: | März 2013 |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Pervasive and Mobile Computing |
| DOI: | 10.1016/j.pmcj.2013.03.004 |
| Kurzbeschreibung (Abstract): | Localized geographic routing schemes operating on planar graphs promise scalability for use within large multihop wireless networks. However, none of the existing schemes is flexible enough to adapt the sequence of faces visited by the constructed path. Thus, real-world constraints may severely impact the network performance. To address this problem, we extend planar graph routing to allow the algorithm to forward packets along a sequence of faces intersected by any arbitrary curve. We analytically prove that this extended scheme is loop free and allows for guaranteed delivery. Furthermore, we investigate schemes for choosing curves dealing with imperfections in the network. |
| ID-Nummer: | TUD-CS-2013-0151 |
| 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