Multi-path unequal clustering protocol based on ant colony algorithm in wireless sensor networks

作     者：Wang, Weijing Tong, Guoxiang 

作者机构：Univ Shanghai Sci & Technol Sch Opt Elect & Comp Engn Shanghai Key Lab Modern Opt Syst Shanghai 200093 Peoples R China 

出 版 物：《IET NETWORKS》 (IET Netw.)

年 卷 期：2020年第9卷第2期

页      面：56-63页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Key Research and Development Program Projects [2018YFB1700902] 

主　　题：protocols wireless sensor networks routing protocols probability LEACH-GA LEACH-EA protocol network life cycle total network data transmission cluster head number network utilisation rate multipath unequal clustering protocol ant colony algorithm wireless sensor networks low power consumption LEACH algorithm cluster head node transmission energy residual energy factor influence factor node distance cluster head election threshold energy loss single-hop transmission optimal transmission path 

摘      要：For the requirement of low power consumption in wireless sensor networks, from the point of view of prolonging the life cycle of the whole network and improving the utilisation rate of the network, this study proposes a LEACH-EA protocol based on LEACH algorithm. In order to increase the probability of being elected as a cluster head node so that more nodes in the network can share the transmission energy equally, the residual energy factor and the influence factor of node distance are added to the cluster head election threshold. Considering the energy loss of single-hop transmission and the limitation of single-hop transmission on the maximum transmission distance of equipment, the ant colony algorithm is used to find the optimal transmission path for nodes iteratively. Finally, by comparing with LEACH, MODLEACH, LEACH-GA, simulation experiments show that LEACH-EA protocol has significantly improved in network life cycle, total network data transmission and cluster head number. The network utilisation rate of LEACH-EA is 431.3, 135.7 and 38.6% higher than the other three algorithms, respectively.