Mobile-Agent的空洞避免路由算法  

Hole Avoiding Routing Algorithm with Mobile-Agent

作　　者：杨云[1,2] 顾沈君[1] 徐文春[1] 田浩澄[1] 韩龙生[1] 

机构地区：[1]扬州大学信息工程学院,江苏扬州225009 [2]南京理工大学计算机应用博士后流动站,南京210004

出　　处：《计算机科学与探索》2012年第9期844-851,共8页Journal of Frontiers of Computer Science and Technology

基　　金：国家自然科学基金No.61070210;江苏省普通高校研究生科研创新计划资助项目No.CXLX11_1009~~

摘　　要：为了解决空洞恢复路由算法在能耗、路由开销及可扩展性等方面的问题,提出了使用移动代理(mobile-agent,MA)进行网间处理来避免"路由空洞"的算法(hole avoiding routing algorithm with mobile-agent,HAMA)。HAMA将网络中的节点分为"空洞相关节点"或"空洞无关节点",通过采用MA方式,对"空洞相关节点"进行路由处理,为其找到一个最优下一跳节点,最终成功建立到Sink节点的路由,从而达到避免"路由空洞"的目的。HAMA使节点提前意识到"路由空洞"的存在,尽可能绕开路由空洞,从而降低网络能耗,均衡网络负载。与经典空洞路由算法GPSR(greedy perimeter stateless routing)相比,HAMA能够成功避免"路由空洞",即使遇到"空洞相关节点",也能较为成功地启用各种恢复机制绕过空洞,具有低成本、高性能的特点。To solve problems such as energy consumption, routing efficiency and scalability in routing recovery algorithms, this paper proposes a hole avoiding routing algorithm with mobile-agent （HAMA）. For the purpose of avoiding routing hole, HAMA divides the routing nodes into ＂hole relevant nodes＂ or ＂hole irrelevant nodes＂, deals with hole relevant nodes by routing algorithm with mobile-agent to find their optimal next node, and finally sets up a routing path to the Sink. The HAMA nodes are aware of the existence of ＂routing hole＂ in advance as much as possible to bypass the routing hole. The proposed algorithm is superior to other hole avoiding algorithms in reducing energy consumption and balancing network load. Compared with classic hole routing algorithm GPSR （greedy perimeter stateless routing）, HAMA with low cost and high performance characteristics, can avoid hole successfully, and even has recovery mechanism when encountering hole relevant node.

关 键 词：无线传感器网络 移动代理 地理路由 负载均衡 

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