基于非均匀分簇和信息熵的无线传感网络路由算法

A Routing Algorithm for Wsns Based on Uneven Clustering and Entropy Theory

针对无线传感网络分簇算法中能量分布不均衡导致的"热区"问题,提出一种基于非均匀分簇和信息熵的路由算法。在簇头选举和竞争半径计算过程中综合考虑节点能量、节点密度和节点距基站距离,均衡簇头能耗以延长生存时间。采用簇间单跳多跳混合通信的路由规则,减少簇间通信能耗。对节点信息熵进行数据融合,引入融合权重系数减小数据融合的不确定性,提高数据融合效率。仿真结果表明,与LEACH、EEUC和EBUCA相比,该算法能够有效均衡网络能耗,延长网络生命周期。

An energy efficient routing algorithm is the major concern in wireless sensor networks（WSNs）,especial-ly the hot spot,because of unbalanced energy consumption. Based on uneven clustering and entropy theory,a kindof improved routing algorithm is proposed for solving that problem. In the process of cluster head election and com-petition radius calculation,node energy,density and distance to BS are considered to effectively balance energy con-sumption and prolong the life cycle of cluster head nodes. Meanwhile the hybrid rules of single-hop and multi-hoprouting is adopted to reduce the energy consumption among clusters. Introducing fusion weight coefficient,informa-tion entropy mechanism is used for reducing the uncertainty and improving the efficiency of data fusion. Simulationresults show that compared with LEACH,EEUC and EBUCA,the new algorithm can balance energy consumptionand prolong the life cycle of wireless sensor networks.