AODV路由发现过程中基于动态概率的优化研究
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Optimization research for AODV route discovery based on dynamic probability
  • 作者:孙悦 ; 魏艳艳
  • 英文作者:SUN Yue;WEI Yanyan;Shaanxi College of Communication Technology;
  • 关键词:洪泛 ; 网络资源 ; 动态概率 ; 路由发现 ; 路由请求包
  • 英文关键词:flooding;;network resource;;dynamic probability;;route discovery;;route request packet
  • 中文刊名:GYZD
  • 英文刊名:Industrial Instrumentation & Automation
  • 机构:陕西交通职业技术学院;
  • 出版日期:2017-08-15
  • 出版单位:工业仪表与自动化装置
  • 年:2017
  • 期:No.256
  • 基金:陕西省青年基金“异构网络中的分层并发传输技术研究”(61501285)
  • 语种:中文;
  • 页:GYZD201704008
  • 页数:6
  • CN:04
  • ISSN:61-1121/TH
  • 分类号:37-41+70
摘要
AODV中,洪泛效率低且会引起冗余消息的转播,导致过度使用有限的网络资源从而减少网络生存期。该文提出一种改进协议,基于动态概率的广播技术来减少洪泛问题。为实现路由发现中高效广播,基于节点剩余能量强度和阈值随机延迟动态地产生重播概率。该方法在AODV协议上展开分析,通过修改AODV的路由请求包来收集节点能量信息。采用ns2仿真器,通过发送广播包和端对端延迟分析了改进协议的性能。仿真结果表明,冗余传输率大大降低,且延长了网络的生存期。
        In AODV,flooding is inefficient and results in redundant message relays,which in turn over use limited network resources to reduce the lifetime of the network. In this paper,dynamic probability based broadcasting technique for routing protocol is proposed to trim down flooding problem. It uses nodes remaining energy strength and threshold random delay to generate rebroadcast probability dynamically for the efficient broadcasting in route discovery. This protocol is analyzed over AODV protocol by modifying the route request packet of AODV to gather energy information of nodes. The performance of modified protocol is analyzed over broadcast packets sent and end-to-end delay using ns2 simulator. Simulation results show that redundant transmissions are reduced greatly and extend the lifetime of the network.
引文
[1]仇雷杰,黄刘生,徐宏力.无线传感网中延迟受限的生命周期最大的数据收集算法[J].小型微型计算机系统,2015,33(6):1213-1217.
    [2]K Obraczka,K Viswanath,G Tsudik.Flooding for reliable multicast in multi-hop ad hoc networks[J].Journal of Wireless Network,2001,7(6):627-634.
    [3]S Y Ni,Y C Tseng,Y S Chen,et al.The broadcast storm problem in a mobile ad hoc network[C]//New York:Proceedings of the 1999 Fifth Annual ACM/IEEE International Conferen ce on Mobile Computing and Networking,IEEE Computer Society,1999:151-162.
    [4]Y Tseng,S Ni,E Shih.Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network[J].IEEE Trans.Computers,2003,52(5):545-557.
    [5]B Williams,T Camp.Comparison of broadcasting techni-ques for mobile ad hoc networks[C].Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing,2002:194-205.
    [6]Qi Zhang,Dharma P Agrawal.Dynamic probabilistic broadcasting in MANETs[J].Journal of Parallel and Distributed Computing,2005,65(2):220-233.
    [7]Benoit Garbinato,Adrian Holzer,Franois Vessaz.Context-aware broadcasting approaches in mobile ad hoc networks[J].Computer Networks,International Journal of Computer and Telecommunications Networking,2010,54(7):1210-1228.
    [8]Qing Huang,Yong Bai,Lan Chen.Efficient lightweight broadcasting protocols for multihop adhoc networks[C]//The 17th Annual IEEE International Symposium on Personal,Indoor and Mobile Radio Communications,2006:1-5.
    [9]W Peng,X Lu,Poster.On the reduction of broadcast redundancy in mobile ad hoc networks[C]//Boston:Proceedings of the First ACM International Symposium on Mobile Ad hoc Networking and Computing,2000:129-130.
    [10]Q Huang,Q Bai,L Chen.Effcient Lightweight Broadcasting Protocols for Multihop Ad hoc Networks[C].IEEE International Symposium on Personal,Indoor and Mobile Radio Communications,2006:200-2004.
    [11]J Wu,H Li.A dominating-set-based routing scheme in ad hoc wireless networks[J].Wireless Networks Telecomm.systems Journal(special issue),2001(3):63-84.
    [12]Stefan Pleisch,Mahesh Balakrishnan,Ken Birman.Robbert van Renesse,MISTRAL:Efficient flooding in mobile ad-hoc networks[C].Florence Italy:7th ACM International Symposium on Mobile Ad Hoc Networking&Computing,2006:1-12.
    [13]J Spencer.Ten Lectures on the Probabilistic Method[C].Conference Board of the Mathematical Sciences,Regional Conference Series,AMS and MAA,1987.
    [14]Dariusz Kowalski,Andrzej Pelc.Broadcasting in undirected ad hoc radio networks[C].Boston,MA,USA:Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing,2003:73-82.
    [15]Yassein M B,Khaoua MO.Improving route discovery in on-demand routing protocols using local topology information in MANETs[C].New York:Proceedings of the ACM international workshop on Performance monitoring,measurement,and evaluation of heterogeneous wireless and wired networks,2006:95-99.
    [16]Toshio KOIDE,Hitosi WATANABE.A Versatile Broadcasting Algorithm on Multi-Hop Wireless Networks:WDD Algorithm[J].IEICET rans.Commun.2004,E87-A(6):1599-1611.
    [17]Jie Wu,Fei Dai.Efficient Broadcasting with Guaranteed Coverage in Mobile Ad Hoc Networks[C].IEEE Transactions on Mobile Computing,2005:1-35.
    [18]Abdalla M Hanashi,Aamir Siddiq ue,Irfan Awan,et al.Performance evaluation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks[C].Journal:Simulation Modelling Practice and Theory,2009:364-375.
    [19]李彦,陈卓.一种面向路由负荷的自适应均衡Ad hoc路由协议[J].计算机应用研究,2012,29(7):2635-2637.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700