Efficient geocasting with perfect delivery in wireless networks

Geocasting is the delivery of packets to nodes within a certain geographic area. For many applications in wireless networks, geocasting is an important and frequent communication service. The challenging problem in geocasting is distributing the packets to all the nodes within the geocast region with high probability but with low overhead. According to our study we notice a clear tradeoff between the proportion of nodes in the geocast region that receive the packet and the overhead incurred by the geocast packet especially at low densities and irregular distributions. We present two novel protocols for geocasting that achieve high delivery rate and low overhead by utilizing the local location information of nodes to combine geographic routing mechanisms with region flooding. We show that the first protocol (GFG) has close-to-minimum overhead in dense networks and that the second protocol (GFPG) provides guaranteed delivery without global flooding or global network information even at low densities and with the existence of region gaps. A practical version of the second protocol (GFPG) has the desirable property of perfect delivery at all densities and close-to-minimum overhead at high densities. We evaluate our mechanisms and compare them using simulation to the currently proposed geocasting mechanisms. The results show the significant improvement in delivery rate (up to 63% higher delivery percentage in low density networks) and reduction in overhead (up to 80% reduction) achieved by our mechanisms.

[1]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[2]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

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

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

[5]  Ahmed Helmy,et al.  On the effect of location inaccuracy on geographic face routing in wireless networks , 2003, MOCO.

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

[7]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[8]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[9]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[10]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[11]  Nitin H. Vaidya,et al.  Flooding-Based Geocasting Protocols for Mobile Ad Hoc Networks , 2002, Mob. Networks Appl..

[12]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[13]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[14]  Nitin H. Vaidya,et al.  Anycasting-based protocol for geocast service in mobile ad hoc networks , 2003, Comput. Networks.