Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2009 International Conference on Information Processing in Sensor Networks |
| Place of Publication | Washington, DC, USA |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 121-132 |
| Number of pages | 12 |
| ISBN (Electronic) | 978-1-60558-371-6 |
| ISBN (Print) | 978-1-4244-5108-1 |
| Publication status | Published - 2009 |