GeoCast—geographic addressing and routing
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Flooding-based geocasting protocols for mobile ad hoc networks
Mobile Networks and Applications
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Anycasting-based protocol for geocast service in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geomulticast: architectures and protocols for mobile ad hoc wireless networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
An adaptive mesh-based protocol for geocast routing
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Voronoi diagram and convex hull based geocasting and routing in wireless networks
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
On the effect of localization errors on geographic face routing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
International Journal of Autonomous and Adaptive Communications Systems
A real-time routing protocol with load distribution in wireless sensor networks
Computer Communications
Task allocation for networked autonomous underwater vehicles in critical missions
IEEE Journal on Selected Areas in Communications
Probabilistic real-time routing protocol for mobile ad-hoc networks based on IEEE 802.11b
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Hi-index | 0.24 |
Geocasting is the delivery of packets to nodes within a certain geographic area. For many applications in wireless ad hoc and sensor 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 Geographic-Forwarding-Geocast (GFG) has close-to-minimum overhead in dense networks and that the second protocol Geographic-Forwarding-Perimeter-Geocast (GFPG) provides guaranteed delivery without global flooding or global network information even at low densities and with the existence of region gaps or obstacles. An adaptive 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 other 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. We hope for our protocols to become building block mechanisms for dependable sensor network architectures that require robust efficient geocast services.