基于路径收集的Ad-hoc网络路由协议的研究

计算机科学 ›› 2013, Vol. 40 ›› Issue (10): 98-103.

基于路径收集的Ad-hoc网络路由协议的研究

黄廷辉,陆向远,崔更申,杨旻

桂林电子科技大学计算机科学与工程学院桂林541004;桂林电子科技大学计算机科学与工程学院桂林541004;桂林电子科技大学计算机科学与工程学院桂林541004;桂林电子科技大学计算机科学与工程学院桂林541004

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家自然科学基金项目(61063040),广西可信软件重点实验室(桂林电子科技大学)开发课题资助

Research of Routing Protocol Based on Path Accumulation for Ad-hoc Networks

HUANG Ting-hui,LU Xiang-yuan,CUI Geng-shen and YANG Min

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 针对Ad-hoc网络中由于节点移动导致的链路断裂和RREQ(Route Request)分组泛洪的问题,提出了基于路径收集的路由协议。采用路径收集机制和链路不相交的多路径算法,提高节点获取路由的能力,增加节点的平均有效路由数量,提高RREQ分组被应答的可能性,从而限制RREQ的广播范围和转发次数；依据路径维持时间的概率密度呈指数分布的特点,设计优先使用最新路径、兼顾路径长度的路由选择策略,以在概率上延长通信路径的维持时间。NS2的仿真结果表明,与AODV、AOMDV以及AODV_PA协议相比,提出的协议提高了分组投递率,并显著地减少了路由开销和通信时延。

关键词: Ad-hoc网络,路径收集,路径维持概率,多路径,链路不相交,下游节点,路径变换

Abstract: Aiming at the problem of link breakage caused by node movement and RREQ(Route Request )packets’ flooding,a routing protocol based on path accumulation was proposed．With the path-accumulation mechanism and link-disjoined multi-path algorithm,the proposed protocol enhances the node’s ability to obtain rout and increases the avera-ge number of valid route resided in a node．Consequently,a RREQ would be response more likely and the RREQs’ broadcast range and the forwarding number are restricted．Based on the path maintain time probability density’s characteristics of exponential distribution,the proposed protocol chooses a routing strategy,which preferentially uses the la-test path and take the length of the path into account,to extend the communication path maintenance time in statistic sense．NS2simulation shows that,compared with AODV,AOMDV and AODV_PA,the proposed protocol has higher packet delivery ratio,lower routing overhead and end-to-end delay of packet.

Key words: Ad-hoc networks,Path accumulation,Path maintain time,Multi-path,Link-disjoined,Down-stream node,Path switching

黄廷辉,陆向远,崔更申,杨旻. 基于路径收集的Ad-hoc网络路由协议的研究[J]. 计算机科学, 2013, 40(10): 98-103. https://doi.org/

HUANG Ting-hui,LU Xiang-yuan,CUI Geng-shen and YANG Min. Research of Routing Protocol Based on Path Accumulation for Ad-hoc Networks[J]. Computer Science, 2013, 40(10): 98-103. https://doi.org/

参考文献

[1] 臧婉瑜,于勐,谢立,等．按需式Ad-hoc移动网络路由协议的研究进展[J]．计算机学报,2002,25(10):1009-1017 (下转第113页)(上接第103页)
[2] 张鹏,崔勇．移动自组织网络路由选择算法研究进展[J]．计算机科学,2010,37(1):10-38
[3] Royer E M,Chai-Keong T．A Review of Current Routing Protocols Ad-hoc Mobile Wireless Networks[J]．IEEE Personal Communications,1999,6(2):46-55
[4] Raju J,Garcia-Luna-Aceves J J．A Comparison of On-Demandand Table Driven Routing for Ad-Hoc Wireless Networks[C]∥Proc of IEEE Int Conf On Communications．Piscataway,NJ:IEEE,2000:1702-1706
[5] Rahman K K U,Zaman Rafi U,Venugopal R A．Performance Comparison of On-Demand and Table Driven Ad-hoc Routing Protocols using NCTUns[C]∥Proc of 10th Int Conf On Computer Modeling and Simulation．Piscataway,NJ:IEEE,2008:336-341
[6] Tseng Y-C,Ni S-Y,Chen Y-S,et al．The Broadcast Storm Problem in a Mobile Ad-hoc Network[J]．Wireless Networks,2002,8(2/3):153-167
[7] Dai F,Wu J．An Extended Localized Algorithm for ConnectedDominating Set Formation in Ad-hoc Wireless Networks[J]．IEEE Transactions on Parallel and Distributed Systems,2004,15(10):908-920
[8] Xie Rong,Qi De-yu,Li Yong-jun,et al．A novel distributedMCDS approximation algorithm for wireless sensor networks[J]．Wireless Communications and Moblie Computing,2009,9(3):427-437
[9] Garey M R,Johnson D S．Computers and Intractability:a guide to the theory of NP-Completeness[M]．New York,USA:Freeman,1990
[10] Dube R,Rais C D,Wang K Y,et al．Signal stability-based adoptive routing(SSA)for Ad-hoc mobile networks[J]．IEEE Personal Communication,1997,4(1):36-45
[11] Toh C K．Associativity-Based Routing for Ad-Hoc Mobile Networks[J]．Wireless Personal Communications,1997,4(2):103-139
[12] 吴大鹏,武穆清,甄岩,等．面向链路稳定性的MANET 路径建立机制[J]．电子与信息学报,2009,31(9):2226-2231
[13] 胡曦,汪晋宽,王翠荣．MANETs稳定性路由的移动自适应策略研究[J]．计算机学报,2011,34(1):96-104
[14] Perkins C E,Royer E M．Ad-hoc on-demand distance vector(AODV)routing[C]∥Proc of IEEE 2nd Workshop on Mobile Computing Systems and Applications．Piscataway,NJ:IEEE,1999:90-100
[15] Marina M K,Das S R．On-demand multipath distance vectorrouting in Ad-hoc networks[C]∥Proc of IEEE 9th Int Conf on Network Protocols．Piscataway,NJ:IEEE,2001:14-23
[16] Broch J,Jetcheva J,Johnson D B．The Effects of On-Demand Be-havior in Routing Protocols for Multihop Wireless Ad-hoc Networks[J]．IEEE Journal on Selected Areas in Communications,1999,17(8):1439-1453
[17] Bai F,Sadagopan N,Krishnamachari B,et al．Modeling Path Duration Distributions in MANETs and Their Impact on Reactive Routing Protocols[J]．IEEE Journal on Selected Areas in Communications,2004,22(7):1357-1373
[18] Han Y,La R J,Makowski A M,et al．Distribution of path dura-tions in mobile Ad-hoc networks－－Palm’s theorem to the rescue[J]．Computer Network,2006,50(12):1887-1900
[19] La R J,Han Y．Distribution of Path Durations in Mobile Ad-hoc Networks and Path Selection[J]．IEEE/ACM Transactions on Networking,2007,15(5):993-1006
[20] Perkins C E,Belding-Royer E M．AODV-PA:AODV with path accumulation[C]∥Proc of IEEE Int Conf on Communications．Piscataway,NJ:IEEE,2003:527-531
[21] Johnson D B,Maltz D A,Hu Y C．The dynamic source routing protocol for mobile Ad-hoc networks(DSR)[EB/OL]．2012-11-14,http://www.ietf.org/rfc/rfc4728.txt

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed