Abstract
The increasing usage of wireless sensor networks in human life is an indication of the high importance of this technology. Holes in wireless sensor networks are non-operating areas that can happen for a variety of reasons, like natural obstacles and disasters. Detection and packet routing in the presence of holes have always been the main challenges of facing this technology. As a result, most of the research on wireless sensor networks has been concerned with the problem of routing through bypassing routing holes. Considering the fact that the hole detection method for transmitting data in wireless sensor networks has a considerable impact on the energy consumption of the network, this paper attempts to provide a solution in the field of routing with the aim of increasing the network lifetime. In this method, considering networks with a dynamic hole, a distributed algorithm is proposed that can quickly determine and update the hole boundary. According to the hole, the packets are guided along an escape path around the hole which can improve and extend network lifetime. Results of experimental simulation are compared with the well-known and successful routing methods in the wireless sensor networks. This comparison shows that the proposed method reduces the dead nodes by at least 11% and 8% considering the effect of the time and the number of the nodes, in turn. Furthermore, the network lifetime has been improved by 2.71% based on the effect of the time and 1.47% based on the number of the nodes.
Similar content being viewed by others
Notes
1Greedy Perimeter Stateless Routing for Wireless Sensor Networks with Holes
2Efficient Load Balanced Routing Scheme for Wireless Sensor Networks with Holes…
References
Jones, J., & Atiquzzaman, M. (2007). Transport protocols for wireless sensor networks: State-of-the-art and future directions. International Journal of Distributed Sensor Networks,3(1), 119–133.
Mavromoustakis, C. X., & Karatza, H. D. (2010). Real-time performance evaluation of asynchronous time division traffic-aware and delay-tolerant scheme in ad hoc sensor networks. International Journal of Communication Systems,23(2), 167–186.
Khan, W. Z., et al. (2016). A cost analysis framework for claimer reporter witness based clone detection schemes in WSNs. Journal of Network and Computer Applications,63, 68–85.
Rashid, B., & Rehmani, M. H. (2016). Applications of wireless sensor networks for urban areas: A survey. Journal of Network and Computer Applications,60, 192–219.
Ahmed, N., Kanhere, S. S., & Jha, S. (2005). The holes problem in wireless sensor networks: a survey. ACM Sigmobile Mobile Computing And Communications Review,9(2), 4–18.
Nguyen, K.-V., et al. (2017). An energy efficient and load balanced distributed routing scheme for wireless sensor networks with holes. Journal of Systems and Software,123, 92–105.
Trong, N. D., et al. (2015). A distributed protocol for detecting and updating hole boundary in wireless sensor networks. In Proceedings of the sixth international symposium on information and communication technology. ACM.
Kuhn, F., et al. (2003). Geometric ad-hoc routing: Of theory and practice. In Proceedings of the twenty-second annual symposium on principles of distributed computing. ACM
Wang, Y., Gao, J., & Mitchell, J. S. (2006). Boundary recognition in sensor networks by topological methods. In Proceedings of the 12th annual international conference on mobile computing and networking. ACM
Karp, B., & Kung, H.-T. (2000). GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on mobile computing and networking. ACM.
Bose, P., et al. (2001). Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks,7(6), 609–616.
Kuhn, F., Wattenhofer, R., Zollinger, A. (2002). Asymptotically optimal geometric mobile ad-hoc routing. In Proceedings of the 6th international workshop on discrete algorithms and methods for mobile computing and communications. ACM.
Kuhn, F., Wattenhofer, R., & Zollinger, A. (2003). Worst-case optimal and average-case efficient geometric ad-hoc routing. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking & computing. ACM.
Subramanian, S., Shakkottai, S., & Gupta, P. (2007). On optimal geographic routing in wireless networks with holes and non-uniform traffic. In INFOCOM 2007. 26th IEEE international conference on computer communications. IEEE.
Yu, F., et al. (2008). Efficient hole detour scheme for geographic routing in wireless sensor networks. In Vehicular technology conference. VTC Spring. IEEE.
Tian, Y., et al. (2008). Energy-efficient data dissemination protocol for detouring routing holes in wireless sensor networks. In IEEE international conference on communications, 2008. ICC’08. IEEE.
Trajcevski, G., et al. (2011). Bypassing holes in sensor networks: load-balance versus latency. In Global telecommunications conference (GLOBECOM 2011). IEEE.
Zhang, F. L. B., & Zheng, J. (2011). Geographic hole-bypassing forwarding protocol for wireless sensor networks. IET Communications,5(6), 737–744.
Choi, M., & Choo, H. (2011). Bypassing hole scheme using observer packets for geographic routing in WSNs. In International conference on information networking (ICOIN). 2011. IEEE.
Chang, G.-Y., et al. (2014). A hole avoiding routing protocol in wireless sensor networks. In Internet of Things (iThings), 2014 IEEE International conference on, and green computing and communications (GreenCom), IEEE and cyber, physical and social computing (CPSCom). IEEE.
Le, N. P., Hieu, N. T., & Van, N. K. (2012). ELBAR: efficient load balanced routing scheme for wireless sensor networks with holes. In Proceedings of the third symposium on information and communication technology. ACM.
Pantazis, N. A., Nikolidakis, S. A., & Vergados, D. D. (2013). Energy-efficient routing protocols in wireless sensor networks: A survey. IEEE Communications Surveys & Tutorials,15(2), 551–591.
Yu, F., Pan, S., & Hu, G. (2015). Hole plastic scheme for geographic routing in wireless sensor networks. In IEEE international conference on communications (ICC), 2015. IEEE.
Liu, X. (2016). A novel transmission range adjustment strategy for energy hole avoiding in wireless sensor networks. Journal of Network and Computer Applications,67, 43–52.
Xue, Y., et al. (2014). An efficient energy hole alleviating algorithm for wireless sensor networks. IEEE Transactions on Consumer Electronics,60(3), 347–355.
Sahoo, P. K., & Liao, W.-C. (2015). HORA: A distributed coverage hole repair algorithm for wireless sensor networks. IEEE Transactions on Mobile Computing,14(7), 1397–1410.
Jan, N., et al. (2017). A balanced energy-consuming and hole-alleviating algorithm for wireless sensor networks. IEEE Access,5, 6134–6150.
Fang, Q., Gao, J., & Guibas, L. J. (2006). Locating and bypassing holes in sensor networks. Mobile networks and Applications,11(2), 187–200.
Le, N. P., et al. (2011). Efficient approximation of routing holes in wireless sensor networks. In Proceedings of the second symposium on information and communication technology. ACM.
Dietrich, I., & Dressler, F. (2009). On the lifetime of wireless sensor networks. ACM Transactions on Sensor Networks (TOSN),5(1), 5.
Chen, T.-Y., et al. (2012). EEGRA: Energy efficient geographic routing algorithms for wireless sensor network. In 2012 12th international symposium on pervasive systems, algorithms and networks. IEEE.
Lima, M. M., Oliveira, H. A., & Pazzi, R. W. (2018). A novel RSSI-based algorithm for detect and bypass routing holes in wireless sensor networks. In 2018 IEEE symposium on computers and communications (ISCC). IEEE.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Hadikhani, P., Eslaminejad, M., Yari, M. et al. An energy-aware and load balanced distributed geographic routing algorithm for wireless sensor networks with dynamic hole. Wireless Netw 26, 507–519 (2020). https://doi.org/10.1007/s11276-019-02157-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11276-019-02157-6