A new balancing type of wireless sensor network routing algorithm

Authors:
Xiaochen Li;Xizhong Lou;Ting Peng;Jia Xu;Qian Zhou;Daorong Wu
Affiliations:
College of Information Engineering, China Jiliang University, Hangzhou, China;College of Information Engineering, China Jiliang University, Hangzhou, China;College of Information Engineering, China Jiliang University, Hangzhou, China;College of Information Engineering, China Jiliang University, Hangzhou, China;College of Information Engineering, China Jiliang University, Hangzhou, China;College of Information Engineering, China Jiliang University, Hangzhou, China
Venue:
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Year:
2012

Citing 4
Cited 0

Improvement on LEACH Routing Algorithm for Wireless Sensor Networks

ICICIS '11 Proceedings of the 2011 International Conference on Internet Computing and Information Services
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications
A survey on sensor networks

IEEE Communications Magazine
A centralized energy-efficient routing protocol for wireless sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

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.