基于环形搜索的WSN簇间最优路由选择  

Optimal Routing Between Clusters Based on Circular Search Method in WSN

作　　者：余翔[1] 刘磊[1] 吴堃[1] 

机构地区：[1]重庆邮电大学通信与信息工程学院,重庆400065

出　　处：《电信科学》2015年第2期103-107,112,共6页Telecommunications Science

摘　　要：为了解决LEACH协议中由单跳路由算法造成的节点能量消耗不均衡的问题,首先,计算分析得出簇间多跳的最优跳数,得到簇头节点到基站的一条理想路径;然后,提出一种环形搜索方法去寻找与理想路径最接近的最优路径;最后,提出了簇头到基站的多跳路由算法。仿真实验结果表明,簇头到基站的多跳路由算法较LEACH协议在均衡节点能量消耗和延长网络生命时间方面的性能有明显的提高。In order to solve the problem of the nodes＇ energy consumption balance caused by single hop routing algorithm in LEACH protocol. By calculation and analysis of the optimal number of hops of inter cluster multi-hops, the cluster head node got an ideal path to the base station. A ring search method was proposed to find the optimal path close to the ideal path. Then, a multi-hops routing algorithm from the cluster head to the base station was obtained. The experimental results show that the performance of the multi-hops routing algorithm from the cluster head to the base station compared with LEACH protocol is higher in the balance of nodes＇ energy consumption and prolong the network lifetime.

关 键 词：LEACH协议 网络生命时间 环形搜索 最优跳数 

分 类 号：TP393.092[自动化与计算机技术—计算机应用技术]