Skip to Main content Skip to Navigation
Journal articles

Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach.

Abstract : In geographic (or geometric) routing, messages are by default routed in a greedy manner: The current node always forwards a message to its neighbor node that is closest to the destination. Despite its simplicity and general efficiency, this strategy alone does not guarantee delivery due to the existence of local minima (or dead ends). Overcoming local minima requires nodes to maintain extra nonlocal state or to use auxiliary mechanisms. We study how to facilitate greedy forwarding by using a minimum amount of such nonlocal states in topologically complex networks. Specifically, we investigate the problem of decomposing a given network into a minimum number of greedily routable components (GRCs), where greedy routing is guaranteed to work. We approach it by considering an approximate version of the problem in a continuous domain, with a central concept called the greedily routable region (GRR). A full characterization of GRR is given concerning its geometric properties and routing capability. We then develop simple approximate algorithms for the problem. These results lead to a practical routing protocol that has a routing stretch below 7 in a continuous domain, and close to 1 in several realistic network settings.
Document type :
Journal articles
Complete list of metadata
Contributor : Anne-Marie Kermarrec Connect in order to contact the contributor
Submitted on : Wednesday, December 12, 2012 - 1:35:56 PM
Last modification on : Tuesday, March 22, 2022 - 1:39:55 PM

Links full text



Guang Tan, Anne-Marie Kermarrec. Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach.. IEEE/ACM Transactions on Networking, IEEE/ACM, 2012, 20 (3), pp.864-877. ⟨10.1109/TNET.2011.2167758⟩. ⟨hal-00764124⟩



Record views