WSN13-3: Path Shortening for Delivery Rate Enhancement in Geographical Routing via Channel Listening

Geographical routing protocols are promising in wireless sensor networks because of their ability to discover a sub-optimal route without the help of a global state. Existing geographical routing protocols can guarantee packet delivery if the network topology after planarization remains connected. However, face routing used in non-flooding geographical routing algorithms usually results in a large number of hops, which not only reduces network efficiency, but may also decrease delivery rate when packets are subject to the constraint of time to live (TTL). In this paper, we present a path shortening algorithm that reduces the number of hops of geographical routing by exploiting the channel listening capability of wireless nodes. We investigate the impact of the algorithm on the delivery rate under the constraint of TTL. Simulation results show that in average the path shortening algorithm can reduce as much as 80% hops on the routes obtained by existing geographical protocols such as GPSR and GOAFR+ in a critical network density region, and the improvement of packet delivery rate is up to 50% with a maximum of three retransmissions without increasing TTL.

[1]  Fabian Kuhn,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[2]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[3]  Dimitrios Koutsonikolas,et al.  On optimal TTL sequence-based route discovery in MANETs , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

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

[5]  Ben Leong,et al.  Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

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

[7]  Prasant Mohapatra,et al.  SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks , 2003, MobiHoc '03.

[8]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[9]  Mingyan Liu,et al.  Optimal controlled flooding search in a large wireless network , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[10]  Mingyan Liu,et al.  Revisiting the TTL-based controlled flooding search: optimality and randomization , 2004, MobiCom '04.

[11]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[12]  Ramesh Govindan,et al.  Interaction of retransmission, blacklisting, and routing metrics for reliability in sensor network routing , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[13]  Seungjoon Lee,et al.  Efficient geographic routing in multihop wireless networks , 2005, MobiHoc '05.

[14]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[15]  Ahmed Helmy,et al.  Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks , 2004, SenSys '04.

[16]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .