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

Anne-Marie Kermarrec (1) , Guang Tan (1)

1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems

In geographic (or geometric) routing, messages are expected to route in a {\em 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 non-local state or to use auxiliary mechanisms. We study how to facilitate greedy forwarding by using a minimum amount of such non-local state in topologically complex networks. Specifically, we investigate the problem of decomposing a given network into a minimum number of {\em Greedily Routable Components} (GRC), where greedy routing is guaranteed to work. We approach it by considering an approximate version in a continuous domain, with a central concept called the {\em 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.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Réseaux et télécommunications [cs.NI]

Anne-Marie Kermarrec, Guang Tan. Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach. ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Sep 2010, Chicago, United States. ⟨inria-00493387⟩