An energy-aware routing protocol for wireless sensor network based on genetic algorithm
- 315 Downloads
Energy saving and effective utilization are an essential issue for wireless sensor network. Most previous cluster based routing protocols only care the relationship of cluster heads and sensor nodes but ignore the huge difference costs between them. In this paper, we present a routing protocol based on genetic algorithm for a middle layer oriented network in which the network consists of several stations that are responsible for receiving data and forwarding the data to the sink. The amount of stations should be not too many and not too few. Both cases will cause either too much construction cost or extra transmission energy consumption. We implement five methods to compare the performance and test the stability of our presented methods. Experimental results demonstrate that our proposed scheme reduces the amount of stations by 36.8 and 20% compared with FF and HL in 100-node network. Furthermore, three methods are introduced to improve our proposed scheme for effective cope with the expansion of network scale problem.
KeywordsWireless sensor network Genetic algorithm Energy-aware routing protocol
Mathematics Subject Classification00-01 99-00
This work is partially supported by the Fujian Provincial Natural Science Foundation, China, under Grant No. 2017J01730; and partially supported by the Key Project of Fujian Education Department Funds (JA15323), Shenzhen Innovation and Entrepreneurship Project with the Project Number: GRCK20160826105935160.
- 4.Chang, F.-C., & Huang, H.-C. (2016). A survey on intelligent sensor network and its applications. J. Netw. Intell, 1(1), 1–15.Google Scholar
- 6.Tuna, G., Gungor, V. C., Gulez, K., Hancke, G., & Gungor, V. (2013). Energy harvesting techniques for industrial wireless sensor networks. In G. P. Hancke & V. C. Gungor (Eds.), Industrial wireless sensor networks: Applications, protocols, standards, and products (pp. 119–136). New York: CRC Press.Google Scholar
- 8.Nguyen, T.-T., Dao, T.-K., Horng, M.-F., & Shieh, C.-S. (2016). An energy-based cluster head selection algorithm to support long-lifetime in wireless sensor networks. J. Netw. Intell, 1(1), 23–37.Google Scholar
- 9.Goyal, D., & Tripathy, M. R. (2012). Routing protocols in wireless sensor networks: A survey. In 2012 second international conference on advanced computing and communication technologies (pp. 474–480). IEEE.Google Scholar
- 11.Vazirani, V. V. (2013). Approximation algorithms. Berlin: Springer.Google Scholar
- 14.Akkaya, K., & Younis, M. (2003). An energy-aware QoS routing protocol for wireless sensor networks. In Distributed computing systems workshops, 2003. Proceedings 23rd international conference on IEEE (pp. 710–715). http://csdl.computer.org/comp/proceedings/icdcsw/2003/1921/00/19210710abs.htm.
- 15.Anker, T., Bickson, D., Dolev, D., & Hod, B. (2008). Efficient clustering for improving network performance in wireless sensor networks. In R. Verdone (Ed.), Wireless sensor networks, Vol. 4913 of Lecture Notes in Computer Science (pp. 221–236). Springer. doi: 10.1007/978-3-540-77690-1_14.
- 16.Banerjee, S., & Khuller, S. (2001). A clustering scheme for hierarchical control in multi-hop wireless networks. In INFOCOM (pp. 1028–1037). www.ieee-infocom.org/2001/paper/676.ps.
- 17.W, H., Ni, M.-M., & Zhong, Z.-D. (2010). A novel energy efficient clustering algorithm for dynamic wireless sensor network. Journal of Internet Technology, 11(1), 103–107.Google Scholar
- 19.Ge, R., Ester, M., Gao, B. J., Hu, Z., Bhattacharya, B., & Ben-Moshe, B. (2008). Joint cluster analysis of attribute data and relationship data: The connected k-center problem, algorithms and applications. ACM Transactions on Knowledge Discovery from Data (TKDD), 2(2), 7. doi: 10.1145/1376815.1376816.CrossRefGoogle Scholar
- 21.Yu, Y., Govindan, R., & Estrin, D. (2001). Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks.Google Scholar
- 22.Ramesh, K., & Somasundaram, D. K. A comparative study of clusterhead selection algorithms in wireless sensor networks. ArXiv preprint arXiv:1205.1673.
- 23.Feldmann, A. E. (2015). Fixed parameter approximations for k-center problems in low highway dimension graphs. In International colloquium on automata, languages, and programming, Vol. 9135 of Lecture Notes in Computer Science, Springer (pp. 588–600). Springer. doi: 10.1007/978-3-662-47666-6_47.
- 27.Harel, D., & Koren, Y. (2002). Graph drawing by high-dimensional embedding. In S. G. Kobourov, & M. T. Goodrich (Eds.), International symposium on graph drawing, Vol. 2528 of Lecture Notes in Computer Science, Springer (pp. 207–219). Springer. http://link.springer.de/link/service/series/0558/bibs/2528/25280207.htm.
- 31.Back, T. (1993). Optimal mutation rates in genetic search. In S. Forrest (Ed.), Proceedings of the 5th international conference on genetic algorithms (pp. 2–8). Morgan Kaufmann.Google Scholar
- 33.Thi-Kien Dao, T.-S. P., & Nguyen, T.-T. (2015). A compact articial bee colony optimization for topology control scheme in wireless sensor networks. Journal of Information Hiding and Multimedia Signal Processing, 6(2), 297–310.Google Scholar
- 34.T, Y.-C., & Huang, C.-F. (2005). A survey of solutions for the coverage problems in wireless sensor networks. Journal of Internet Technology, 6(1), 1–8.Google Scholar
- 35.Levy, P. S., & Lemeshow, S. (2013). Sampling of populations: Methods and applications. New York: Wiley.Google Scholar
- 36.Csikszentmihalyi, M., & Larson, R. (2014). Validity and reliability of the experience-sampling method. In Flow and the foundations of positive psychology (pp. 35–54). Springer.Google Scholar