Geographic Routing with Minimal Local Geometry


Geographic routing based on virtual coordinates has been studied extensively, especially in environments expensive localization techniques are infeasible. Even though, the construction of virtual coordinate system is theoretically understood, their practical deployment is questionable due to computational requirements. An alternative approach is to use raw range measures from a special set of nodes called "anchors" as virtual coordinates, which only preserve partial geographic knowledge. In this paper we follow a similar approach, but focus on answering the question "what are the minimal geometric primitives required to perform geometric routing?". We take the first step towards answering this question, based on a node centric local geometric view of localized nodes. We define local geometric primitives and show that geographic face routing can be performed with those primitives.

DOI: 10.1109/ICPADS.2012.148

8 Figures and Tables

Cite this paper

@article{Samarasinghe2012GeographicRW, title={Geographic Routing with Minimal Local Geometry}, author={Kasun Samarasinghe and Pierre Leone}, journal={2012 IEEE 18th International Conference on Parallel and Distributed Systems}, year={2012}, pages={901-906} }