TU Darmstadt / ULB / TUbiblio

Curve-based Planar Graph Routing in Multihop Wireless Networks

Frey, Hannes and Hollick, Matthias and Loch, Adrian (2011):
Curve-based Planar Graph Routing in Multihop Wireless Networks.
In: 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), DOI: 10.1109/MASS.2011.127,
[Conference or Workshop Item]

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.

Item Type: Conference or Workshop Item
Erschienen: 2011
Creators: Frey, Hannes and Hollick, Matthias and Loch, Adrian
Title: Curve-based Planar Graph Routing in Multihop Wireless Networks
Language: German
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.

Title of Book: 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS)
Uncontrolled Keywords: Secure Things
Divisions: 20 Department of Computer Science > Sichere Mobile Netze
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
LOEWE > LOEWE-Zentren
20 Department of Computer Science
LOEWE
Date Deposited: 31 Dec 2016 11:08
DOI: 10.1109/MASS.2011.127
Identification Number: TUD-CS-2011-2885
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item