Energy Balanced Routing Protocol for Wireless Sensor Networks
In recent years, there has been a growing interest in wireless sensor networks. Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. Clustering has been proven energy efficient in sensor networks (3.5.6). The clustering algorithm is a kind of key to reduce energy consumption. Hierarchical clustering algorithms are very important in increasing the networks life time. Each clustering algorithm is composed of two phases: create the cluster head and data transmission. It is important to choose the cluster head in this algorithm. In this paper, we study the impact of nodes in terms of their energy in wireless sensor networks that are hierarchically clustered. This paper introduces a new metric, energy cost, devised to consider a balance of sensors remaining energies, as well as energy efficiency. This metric gives rise to the design of the energy balanced routing protocol (EBRP) algorithm devised to balance the energy consumption in wireless sensors network and consequently prolong the lifetime of the networks. The algorithm minimizes the clustering overhead compared to Low-energy adaptive clustering hierarchy (LEACH)|1,8,12J, and provides lower variation in the number of cluster head roles overtime. Finally, the simulation results demonstrate that our proposed energy balanced cluster head election routing protocol approach is more effective in prolonging the network lifetime compared with LEACH.1
Wireless sensor network data aggregation lifetime energy balanced cluster head election
Wushuang Gao Qiansheng Fang Xiaolong Wang
Anhui Key Laboratory of Intelligent Building,Anhui University of Architecture,Hefei China
国际会议
太原
英文
23-26
2011-02-26（万方平台首次上网日期，不代表论文的发表时间）