基于最少跳数的路径寻优算法设计与实现  

Design and Implementation of Routing Based on Minimum Hops

作　　者：张胜[1] 杨郑龙[1] 曹凯英 

机构地区：[1]南昌航空大学,南昌330063

出　　处：《南昌航空大学学报（自然科学版）》2013年第4期11-17,共7页Journal of Nanchang Hangkong University(Natural Sciences)

基　　金：国家自然科学基金(61162002);江西省教育厅科技项目(GJJ12428);南昌航空大学2012年研究生创新基金(YC2012028)

摘　　要：根据无线传感器网络中硬件节点射频功率一定,减少通信次数就可降低节点能耗这一特点,提出一种基于最少跳数的路径寻优算法,该算法可自主找到从Sink节点到目标节点间跳数最少的通信路径,为网络查询或基于事件的消息快速响应提供最优路由。与经典的路由算法相比,消息传输的跳数最少,减少了节点通信次数,有效降低通信能耗。在由TelosB节点构建的实际网络中的运行结果表明,该算法实现方便、占用资源少、运行高效,能较好适应网络拓扑变化。Based on the RF power of the node is finite, reducing the number of communication can reduce energy consumption of the node. We proposed an algorithm based on minimum hop path named ROMH. The routing path is easy to be found actively from sink node to target node with minimum hops, and optimal routing for query tasks on WSN or event-based real-time message response can be provided. Compared to the classic routing algorithms, ROMH has the least hops to reduce the number of communications, so it can cuts down energy consumption of communications observably. We test the routing algorithm in an actual network constructed by the TelosB nodes. The experiment result shows that ROMH is easy to implement, costs fewer resources, runs efficiently, and adapts to the changes of network topology well.

关 键 词：无线传感器网络 最少跳数 路由 

分 类 号：TP212[自动化与计算机技术—检测技术与自动化装置]