Greedy routing with guaranteed delivery using ricci flows

Rik Sarkar Xiaotian Yin Jie Gao Feng Luo Xianfeng David Gu

Numerical Analysis and Scientific Computing mathscidoc:1912.43777

121-132, 2009.4
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
No keywords uploaded!
[ Download ] [ 2019-12-24 20:57:31 uploaded by Feng_Luo ] [ 77 downloads ] [ 0 comments ]
@inproceedings{rik2009greedy,
  title={Greedy routing with guaranteed delivery using ricci flows},
  author={Rik Sarkar, Xiaotian Yin, Jie Gao, Feng Luo, and Xianfeng David Gu},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191224205731948863341},
  pages={121-132},
  year={2009},
}
Rik Sarkar, Xiaotian Yin, Jie Gao, Feng Luo, and Xianfeng David Gu. Greedy routing with guaranteed delivery using ricci flows. 2009. pp.121-132. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191224205731948863341.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved