Greedy routing with guaranteed delivery using Ricci flows

Greedy forwarding with geographical locations in a wireless sensor network may fail at a local minimum. In this paper we propose to use conformal mapping to compute a new embedding of the sensor nodes in the plane such that greedy forwarding with the virtual coordinates guarantees delivery. In parti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2009 International Conference on Information Processing in Sensor Networks S. 121 - 132
Hauptverfasser: Sarkar, Rik, Yin, Xiaotian, Gao, Jie, Luo, Feng, Gu, Xianfeng David
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Washington, DC, USA IEEE Computer Society 13.04.2009
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
Accuracy
Applied computing > Physical sciences and engineering > Mathematics and statistics
Approximation algorithms
Batteries
Computing methodologies > Modeling and simulation > Simulation evaluation
Conformal Mapping
Greedy Forwarding
Mathematics of computing > Discrete mathematics
Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms
Monitoring
Networks > Network protocols > Network layer protocols > Routing protocols
Networks > Network types
Ricci Flow
Road transportation
Routing
Scheduling algorithm
Sensor Networks
Sensor phenomena and characterization
Telecommunication traffic
Wireless sensor networks
ISBN:1424451086, 9781424451081
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Greedy forwarding with geographical locations in a wireless sensor network may fail at a local minimum. In this paper we propose to use conformal mapping to compute a new embedding of the sensor nodes in the plane such that greedy forwarding with the virtual coordinates guarantees delivery. In particular, we extract a planar triangulation of the sensor network with non-triangular faces as holes, by either using the nodes' location or using a landmark-based scheme without node location. The conformal map is computed with Ricci flow such that all the non-triangular faces are mapped to perfect circles. Thus greedy forwarding will never get stuck at an intermediate node. The computation of the conformal map and the virtual coordinates is performed at a preprocessing phase and can be implemented by local gossip-style computation. The method applies to both unit disk graph models and quasi-unit disk graph models. Simulation results are presented for these scenarios.
ISBN:1424451086
9781424451081
DOI:10.5555/1602165.1602178