Abstract
In general, wireless sensor network works by a small battery-powered, or limited energy. Once the wireless sensor network is deployed, the energy of small sensor nodes can not be replaced. So, to improve energy efficiency and extend the survival time of the whole network is a crucial issue. This paper presents a new type of energy balancing algorithm for wireless sensor networks. The BCDCP-M algorithm draws on the main idea of the BCDCP routing protocol. When the base station divides the network, the new algorithm makes the number of cluster heads equal to the optimal number of cluster heads as far as possible. On cluster head election, not only the average energy of the sensor network, but also the remaining energy of the individual node must be taken into account. In data transmission, we use the multi-hop method to select the optimal path. The simulation results show that the survival time of the network in the new BCDCP-M algorithm is 19% longer than BCDCP.
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(8), 102–114 (2002)
Younis, O., Fahmy, S.: Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach. In: INFOCOM 2004. 23th Annual Joint Conference of the IEEE Computer and Communications Societies, West Lafayette (2004)
Kandris, D., Tsioumas, P., Tzes, A., Nikolakopulos, G., Vergados, D.D.: Power conservation through energy efficient routing in wireless sensor networks. Sensors 9, 7320–7342 (2009)
Saini, P., Sharma, A.K.: E-DEEC-enhanced distributed energy efficient clustering scheme for heterogeneous WSN. In: 2010 1st International Conference on Parallel, Distributed and Grid Computing (PDGC 2010), pp. 205–210 (2010)
Tang, L., Liu, S.: Improvement on LEACH Routing Algorithm for Wireless Sensor Networks. In: 2011 International Conference on Internet Computing and Information Services, pp. 199–202 (2011)
Lindsey, S., Raghavendra, C.S.: PEGASIS:Power-Efficient Gathering in Sensor Information Systems. In: Proceedings of the IEEE Aerospace Conference, pp. 1125–1130 (2002)
Heinzelman, W.B., Chandrakasan, A.P., Balakrishnan, H.: An application-Specific protocol architecture for wireless microsensor networks. IEEE Transaction on Wireless Communications 1(4), 660–670 (2002)
Muruganathan, S.D., Ma, D.C.F., Bhasin, R.I., Fapojuwo, A.O.: A centralized energy-efficient routing protocol for wireless sensor networks. IEEE Communications Magazine 43(3), S8–S13 (2005)
Shen, H.: Finding the k most vital edges with respect to minimum spanning tree. In: Proceeding of the IEEE 1997 National Aerospace and Electronics Conference, NAECON 1997, vol. 1(1), pp. 255–262 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, X., Lou, X., Peng, T., Xu, J., Zhou, Q., Wu, D. (2012). A New Balancing Type of Wireless Sensor Network Routing Algorithm. In: Lei, J., Wang, F.L., Deng, H., Miao, D. (eds) Artificial Intelligence and Computational Intelligence. AICI 2012. Lecture Notes in Computer Science(), vol 7530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33478-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33478-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33477-1
Online ISBN: 978-3-642-33478-8
eBook Packages: Computer ScienceComputer Science (R0)