Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach

In geographic (or geometric) routing, messages are expected to route 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 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 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 Greedily Routable Region (GRR). A full characterization of GRR is given concerning its geometric properties and routing capability. We then...

• Type: Journal
• Year: 2010
• Where: MOBIHOC
• Authors: Anne-Marie Kermarrec, Guang Tan
• Keywords: Computer Networks, Local Minima, MOBIHOC 2010, Non-local State, Routing