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

Abstract

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.