Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks
Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks
复制标题
DOI：
10.1007/s10776-016-0304-5
复制
发表时间：
2016-03
影响因子：
2.5
通讯作者：
Hui Xia;Ruihua Zhang;Jia Yu;Zhen-Kuan Pan
中科院分区：
文献类型：
--
作者：
Hui Xia;Ruihua Zhang;Jia Yu;Zhen-Kuan Pan
分簇和多跳路由算法极大地延长了无线传感器网络（WSNs）的生命周期。然而，它们也导致了能量空穴和网络划分问题。为了均衡多个簇头之间的负载，节省簇间路由的能耗，提出了一种基于非均匀分簇理论和连通图理论的无线传感器网络节能路由算法。新算法在簇头选举和簇路由两个方面进行了优化和创新。在簇头选举中，我们考虑到基于投票的措施和传感器节点的传输功率时，这些节点划分成不同的不平等的集群。然后，我们介绍了连通图理论的簇间数据通信的集群路由。最后，由基站和所有簇头构成连通图。仿真结果表明，该算法均衡了传感器节点间的能量消耗，缓解了能量空洞问题的影响，提高了链路质量，数据传输的可靠性和效率得到了大幅度提高，网络生存时间显著延长。
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.