Abstract
Holes in wireless sensor networks are the geographical region without enough available sensor nodes. When a hole exists in the wireless sensor network, it often causes traditional routing algorithms to fail. In most of the previous works, the routing hole problem was addressed by using the static detour path to route data packets along the boundaries of holes. As a result, the energy of sensor nodes on the static path depletes quickly, and the hole size enlarges. In this paper, we propose a scheme for bypassing holes in wireless sensor networks by exploiting energy-aware multiple paths. Our approach not only takes into account the shorter path to bypass the hole, but also eases the loading of the sensor nodes on the boundaries of holes. Simulation results show that the proposed scheme can achieve short detour paths, low energy consumption and network load balancing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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)
Zhao, F., Guibas, L.: Wireless Sensor Networks, an Information Processing Approach. Elsevier, Amsterdam (2004)
Karl, H., Willig, A.: Protocols and Architectures for Wireless Sensor Networks. Wiley, Chichester (2005)
Bulusu, N., Heidemann, J., Estrin, D.: GPS-less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine 7(5), 28–34 (2000)
Carus, A., Urpi, A., Chessa, S., De, S.: GPS-free coordinate assignment and routing in wireless sensor networks. In: Proc. 24th Annu. Joint Conf. IEEE Comput. Commun. Soc (INFOCOM 2005), pp. 150–160 (2005)
Li, J., Jannotti, J., De Couto, D., Karger, D., Morris, R.: A scalable location service for geographic ad-hoc routing. In: Proceedings of Mobicom, pp. 243–254 (2000)
Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proc. of Mobicom, pp. 96–108 (2003)
Fonseca, R., Ratnasamy, S., Culler, D., Shenker, S., Stoica, I.: Beacon vector routing: Scalable point-to-point in wireless sensornets. In: Intel Research, IRB-TR 2004, vol. 12 (2004)
Ahmed, N., Kanhere, S.S., Jha, S.: The holes problem in wireless sensor networks: a survey. ACM SIGMOBILE Mobile Computing and Communications 9(2), 4–18 (2005)
Khan, I.F., Javed, M.Y.: A Survey on Routing Protocols and Challenge of Holes in Wireless Sensor Networks. Advanced Computer Theory and Engineering, 161–165 (2008)
Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: Proc. of the 6th Annual ACM/IEEE Int’l Conf. on Mobile Computing and Networking, pp. 243–254 (2000)
Fang, Q., Gao, J., Guibas, L.J.: Locating and Bypassing Routing Holes in Sensor Networks. In: Proc. of IEEE INFOCOM 2004, vol. 4, pp. 2458–2468 (March 2004)
Yu, F., Choi, Y., Park, S., Lee, E., Tian, Y., Kim, S.: An Edge Nodes Energy Efficient Hole Modeling in Wireless Sensor Networks. In: Proc. IEEE Global Telecommunications Conference (GLOBECOM), pp. 4724–4728 (2007)
Graham, R.L.: An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. Information Processing Letters 1, 132–133 (1972)
The CMU Monarch Project, The CMU Monarch Project’s Wireless and Mobility extensions to NS, http://www.isi.edu/nsnam/ns/ (accessed September 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, ST., Shih, JS. (2011). Multi-path Construction for Bypassing Holes in Wireless Sensor Networks. In: Snasel, V., Platos, J., El-Qawasmeh, E. (eds) Digital Information Processing and Communications. ICDIPC 2011. Communications in Computer and Information Science, vol 189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22410-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-22410-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22409-6
Online ISBN: 978-3-642-22410-2
eBook Packages: Computer ScienceComputer Science (R0)