Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks |
| |
Authors: | Hui Xia Rui-hua Zhang Jia Yu Zhen-kuan Pan |
| |
Affiliation: | 1.College of Computer Science and Technology,Qingdao University,Qingdao,People’s Republic of China;2.Shandong Provincial Key Laboratory of Software Engineering,Shandong University,Ji’nan,People’s Republic of China;3.Postdoctoral Research Station of System Science, College of Automation and Electrical Engineering,Qingdao University,Qingdao,People’s Republic of China |
| |
Abstract: | Clustering and multi-hop routing algorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|