移动自组网中基于位置信息的路径优化路由算法  

Position-based path optimization routing algorithm in MANET

作　　者：钱钊[1,2] 刘宏伟[1] 左德承[1] 杨孝宗[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001 [2]哈尔滨理工大学计算机学院,黑龙江哈尔滨150080

出　　处：《哈尔滨工程大学学报》2013年第3期345-349,共5页Journal of Harbin Engineering University

基　　金：国家自然科学基金资助项目(61003047)

摘　　要：针对移动自组织网络中基于位置信息的路由算法在空洞存在时仅能生成非优化路径的问题,提出了利用空洞广播来构造优化路径的算法.在利用空洞检测技术收集网络中空洞的边界节点集信息后,将空洞信息进行广播.为减小网络开销,仅将边界节点集的凸包进行广播,并将广播限制在计算出的广播域内.当传输数据包到达广播区域内后,节点匹配目标位置与空洞边界节点集凸包的关系,并以此构造出通过空洞的优化路径.仿真结果表明该算法在存在空洞网络中通过构造优化路径,相对于GOAFR+算法最多降低25ms的传输时延.最后,对该算法在实际应用中的适用条件进行了分析.该算法适用于网络拓扑变化率较低,数据传输率较高的网络.For the non-optimal path problems in location-based routing algorithm when hole exists in mobile ad hoc networks,an algorithm is presented focusing on constructing optimal path based on hole broadcast method.The hole detection technologies are used to collect border nodes of holes in the network,then to broadcast the hole information through the network.In order to reduce network overhead,only convex hull of boundary nodes set in a calculated broadcast region is broadcasted and the broadcast is restricted within the calculated broadcast region.When any packet reaches the broadcast region,the relationship between the target location and convex hull of boundary nodes set is matched,and thus an optimal path through the hole is constructed.Simulation results indicate that benefited from the optimal path in network with holes,communication delay decreases 25ms at most compared with the GOAFR＋ algorithm.Finally,the applicable condition for practical application of the algorithm is analyzed.

关 键 词：移动自组网 路由算法 路径优化 空洞 

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