%A WU Biao, CUI Chen, YU Jian and YI Ren-jie %T Multi-hop Routing Algorithm for Wireless Sensor Networks Based on Uneven Clustering %0 Journal Article %D 2017 %J Computer Science %R 10.11896/j.issn.1002-137X.2017.02.024 %P 157-162 %V 44 %N 2 %U {https://www.jsjkx.com/CN/abstract/article_961.shtml} %8 2018-11-13 %X Aiming to solve the highly efficient networking problem of wireless sensor networks(WSN)under a complex and irregular scenario,a multi-hop routing algorithm based on uneven clustering(MRAUC) was proposed for wireless sensor networks.Firstly,according to the characteristics that irregular shape of the scenario and the sink node are far away from the detection area,the algorithm approximates the detection area into anannular sector of which the sink node is located in the heart.Based on the annular sector scenario,the uneven clustering is established for wireless sensor networks.The detection area is divided into annular sectors with equal segmentation,then the cluster head number and the best proportion of each annular senctor are determined by the minimum energy consumption of the first annular senctor.Through adaptively transmitting power of cluster head,the uneven clustering is realized.At the same time,the best relaying cluster head is determined by the MTE principle,which effectively overcome the routing relaying problem between cluster heads.The simulation results show that compared with the traditional algorithm,the new algorithm has significant advantages in balancing energy consumption between nodes and prolonging the network life cycle.As a result,it is more suitable for engineering practice.