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

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.

[1]  Andrew V. Goldberg,et al.  Routing in Networks with Low Doubling Dimension , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[2]  James Newsome,et al.  GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.

[3]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[4]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[5]  Jie Gao,et al.  Shape Segmentation and Applications in Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[7]  Cyril Gavoille,et al.  Routing in distributed networks: overview and open problems , 2001, SIGA.

[8]  H. Alt,et al.  Visibility graphs and obstacle-avoiding shortest paths , 1988, ZOR Methods Model. Oper. Res..

[9]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[10]  Yunhao Liu,et al.  Rendered path: range-free localization in anisotropic sensor networks with holes , 2010, TNET.

[11]  Anne-Marie Kermarrec,et al.  Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing , 2009, IEEE INFOCOM 2009.

[12]  Robert Tappan Morris,et al.  Greedy Virtual Coordinates for Geographic Routing , 2007, 2007 IEEE International Conference on Network Protocols.

[13]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[14]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[17]  Roger Wattenhofer,et al.  Greedy Routing with Bounded Stretch , 2009, IEEE INFOCOM 2009.

[18]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[19]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[20]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[21]  Jie Gao,et al.  MAP: Medial axis based geometric routing in sensor networks , 2007, Wirel. Networks.

[22]  Anne-Marie Kermarrec,et al.  Visibility-Graph-Based Shortest-Path Geographic Routing in Sensor Networks , 2009, IEEE INFOCOM 2009.

[23]  Nancy M. Amato,et al.  Approximate convex decomposition of polygons , 2004, SCG '04.

[24]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[25]  Ming-Jer Tsai,et al.  Axis-Based Virtual Coordinate Assignment Protocol and Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[26]  Yuval Shavitt,et al.  Minimizing Recovery State in Geographic Ad Hoc Routing , 2009, IEEE Transactions on Mobile Computing.

[27]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[28]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[29]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[30]  Jie Gao,et al.  Boundary recognition in sensor networks by topological methods , 2006, MobiCom '06.

[31]  Jie Wu,et al.  SMART: a scan-based movement-assisted sensor deployment method in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[32]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[33]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[34]  Lili Qiu,et al.  S4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks , 2007, NSDI.

[35]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.