Abstract
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, but not a neighbor of the destination. Accordingly, the packets from the source cannot be delivered to the destination. Jiang et al. recently proposed a SLGF approach to address this problem. However, SLGF still has long routing paths, since it uses the right-hand rule. In this paper, we describe Predictive Geographic greedy Forwarding, PGF. PGF uses information on the hole to build the virtual convex polygon, predict the routing path and choose the shorter path. PGF reduces the length and the number of hops of routing paths. Computer simulation shows our PGF scheme can reduce the average number of hops of routing paths by about 32% compared to Geographic greedy Forwarding, GF, and about 15% compared to SLGF.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communications Magazine 40, 102–114 (2002)
Bose, P., Morin, P., Stojmenovic, I.: Routing with guaranteed delivery in ad hoc wireless networks. In: Proc. The 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 48–55 (1999)
Fang, Q., Gao, J., Guibas, L.: Locating and bypassing routing holes in sensor networks. In: Proc. The 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2004), pp. 2458–2468 (2004)
Frey, H., Stojmenovic, I.: On delivery guarantees of face and comined greedy-face routing in ad hoc and sensor networks. In: Proc. The 12th Annual ACM/IEEE International Conference on Mobile Computing and Networking (ACM/IEEE MOBICOM 2006), pp. 390–401 (2006)
Jiang, Z., Ma, J., Lou, W., Wu, J.: An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks. In: Proc. The 27th Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE INFOCOM 2008), pp. 825–833 (2008)
Karp, B., Kung, H.: GPSR: Greedy perimeter stateless routing for wireless sensor networks. In: Proc. The 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (ACM/IEEE MOBICOM 2000), pp. 243–254 (2000)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proc. The 4th ACM International Sysmposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc 2003) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ha, M.T., Sakthivel, P., Choo, H. (2009). Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding. In: Hong, C.S., Tonouchi, T., Ma, Y., Chao, CS. (eds) Management Enabling the Future Internet for Changing Business and New Computing Services. APNOMS 2009. Lecture Notes in Computer Science, vol 5787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04492-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-04492-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04491-5
Online ISBN: 978-3-642-04492-2
eBook Packages: Computer ScienceComputer Science (R0)