计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2015年
6期
102-109
,共8页
孙有为%王金海%樊慧慧%张惠麒
孫有為%王金海%樊慧慧%張惠麒
손유위%왕금해%번혜혜%장혜기
移动sink节点%节能%路由算法%无线传感器网络%加权和%移动中继节点
移動sink節點%節能%路由算法%無線傳感器網絡%加權和%移動中繼節點
이동sink절점%절능%로유산법%무선전감기망락%가권화%이동중계절점
mobile sink node%energy-efficient%routing algorithm%Wireless Sensor Network ( WSN )%weighted sum%mobile relay node
为解决无线传感器网络( WSN)的“热点”问题,避免因网络局部突发事件造成网络过早失效,提出一种带移动节点的WSN节能路由算法。该算法基于网格思想,根据节点的剩余能量以及节点到簇重心坐标距离的加权和来选举簇头,通过可控移动策略调度sink节点接收簇头所收集的数据,节省网络能耗。同时引入能量不受限的中继节点,调度该节点服务于信息传输大的区域,延长网络生存时间。通过仿真实验分析sink节点的移动速度以及加权系数对算法性能的影响,结果表明,该算法在网络的生存时间、总能耗和sink节点接收数据量3个方面均优于TTDD和MSEERP算法。当sink节点的移动速度为5 m/s、加权系数为0.6时,算法性能最佳。
為解決無線傳感器網絡( WSN)的“熱點”問題,避免因網絡跼部突髮事件造成網絡過早失效,提齣一種帶移動節點的WSN節能路由算法。該算法基于網格思想,根據節點的剩餘能量以及節點到簇重心坐標距離的加權和來選舉簇頭,通過可控移動策略調度sink節點接收簇頭所收集的數據,節省網絡能耗。同時引入能量不受限的中繼節點,調度該節點服務于信息傳輸大的區域,延長網絡生存時間。通過倣真實驗分析sink節點的移動速度以及加權繫數對算法性能的影響,結果錶明,該算法在網絡的生存時間、總能耗和sink節點接收數據量3箇方麵均優于TTDD和MSEERP算法。噹sink節點的移動速度為5 m/s、加權繫數為0.6時,算法性能最佳。
위해결무선전감기망락( WSN)적“열점”문제,피면인망락국부돌발사건조성망락과조실효,제출일충대이동절점적WSN절능로유산법。해산법기우망격사상,근거절점적잉여능량이급절점도족중심좌표거리적가권화래선거족두,통과가공이동책략조도sink절점접수족두소수집적수거,절성망락능모。동시인입능량불수한적중계절점,조도해절점복무우신식전수대적구역,연장망락생존시간。통과방진실험분석sink절점적이동속도이급가권계수대산법성능적영향,결과표명,해산법재망락적생존시간、총능모화sink절점접수수거량3개방면균우우TTDD화MSEERP산법。당sink절점적이동속도위5 m/s、가권계수위0.6시,산법성능최가。
In order to solve ‘hot ’ issue in Wireless Sensor Network ( WSN ) and to avoid the network premature invalidation caused by local emergency,an energy-efficient routing algorithm with mobile node for WSN is proposed in this paper. To save energy consumption,the network is divided into several square virtual grids in this algorithm,a cluster head is selected by weighted sum of the residual energy of node and the distance of the node to the areal coordinate,and the sink node receives data from the cluster head by controllable moving scheduling strategy. Moreover, to extend the network lifetime,unlimited energy mobile relay is introduced,and is in the service of information transmitting large area. Influence of two parameters,the movement speed of the sink node and the weighting coefficient,on the performance of the proposed algorithm is detailed analyzed by simulation. The results show that the lifetime of the network, the total energy consumption and the total amount of data the sink node receives of the proposed algorithm are better than MSEERP and TTDD algorithm. When the movement speed of the sink node is equal to 5 m/s,the weighting coefficient is 0. 6,and the performance of the proposed algorithm is best.