期刊文献+

一种基于仿生学的MANET拥塞节点自适应回避路由协议 被引量:2

A Bio-Inspired Adaptive MANET Routing to Circumvent Congestion Nodes
下载PDF
导出
摘要 针对MANET中出现的因节点拥塞而导致路由不稳定、频繁重路由等问题,本文借鉴大肠杆菌培育过程中对营养液浓度变化的新陈代谢自适应调节行为和其数学描述模型ARAS,提出了一种新的拥塞节点自适应回避的MANET路由协议ATAR,其主要思路是:将节点缓存队列信息(可反映该节点拥塞程度)和目的端反馈包跳数信息(可反映该节点到目的端的路径长短)归一化处理后定义为节点的适应值,并将其映射为菌体的成长速率;再在随机性上修正了原始描述模型ARAS,并用其分别计算该节点的所有邻节点若被当作它到目的端路由的下一跳节点时,它们各自对该路由性能的改善度,然后选择其中改善度最大的邻节点作为其下一跳节点,以自适应避开拥塞的邻节点,同时选择较短路径.仿真结果比较显示:ATAR突发大时延发生概率明显较小,具有更低的数据包平均端到端延迟,数据分组投递率也得到提高,体现出ATAR拥塞避免的策略优势较大,并且还观察到ATAR负载均衡程度也优于AODV,瓶颈节点承担的负载差异较AODV小54%. Traditional Ad Hoc network routing protocols are mainly based on the condition "Shortest Path",and possibly form many congestion nodes to cause routing instability and re-routing.To this point,this paper proposed a new bio-inspired adaptive routing protocol(ATAR) based on a mathematic model ARAS which is originally a model for its host Escherichia coli cells to adapt to changes in the availability of a nutrient.In this paper,queue buffer of routing node and hop count of feedback are defined as a new metric,fitness,which represents the comprehensive factor of congestion level and the length of routing path.We map the fitness of neighbors of routing node to the cell volume growth speed in the improved ARAS model,and calculate the state values of neighbors with the model.Then,the routing node selects the next hop according to the maximum.Using this method,we can adaptive to choose a leisurely node as the next hop with shorter path.
出处 《电子学报》 EI CAS CSCD 北大核心 2012年第4期710-716,共7页 Acta Electronica Sinica
基金 国家973重点基础研究发展计划(No.2007CB310706,No.2012CB315905) 国家自然科学基金(No.60873263,No.60932005,No.61172048,No.61100184,No.60972070) 重庆市教委科学技术研究项目(No.KJ100514) 四川省青年基金(No.09ZQ026-032) 教育部新世纪优秀人才计划基金(No.NCET-09-0268)
关键词 仿生学 自适应 拥塞丢包 路由协议 大肠杆菌 bio-inspired adaptive congestion routing protocol Escherichia coli
  • 相关文献

参考文献10

  • 1Michael Meisel, et al. A taxonomy of biologically inspired re- search in computer networking[ J ]. Computer Networks, 2010, 54(6) :901 - 916.
  • 2Falko Dressier, Ozgur B Akan. A survey on bio-inspired net- working[ J]. Computer Networks, 2010,:54(6) :881 - 900.
  • 3李娟,饶妮妮,廖瑞华,王炜华.基于改进粒子群算法的Ad Hoc网络移动模型研究[J].电子学报,2010,38(1):222-227. 被引量:8
  • 4Kashiwagi A, Urabe I, Kaneko K, Yomo T. Adaptive response of a gene network to environmental changes by fitness-induced atwactor selection[J]. PLos ONE,2006,1 (1) :e49.
  • 5Leibnitz K, Wakamiya N, Murata M. SeN-adaptive ad-hoc/sen- sor network rou6ng with attractor selection[ A ]. Proceedings of IEEE Global Telecommunications Conference[ C]. San Francis- co: GLOBECOM,2006.1 - 5.
  • 6Leibnitz K, Wakamiya N, Murata M. A bio-inspired robust muting protocol for mobile ad hoc networks [ A ]. Proceedings of 16th International Conference on Computer Communications and Networks[ C]. Honolulu, ICCCN, 2008.321 - 326. RFC 3561 ,Ad hoc on-demand distance vector (AODV) rout- ing[ S ].
  • 7RFC 3561 ,Ad hoc on-demand distance vector (AODV) rout- ing[S].
  • 8张鹤颖,刘宝宏,窦文华.一种基于速率和队列长度的主动队列管理机制[J].电子学报,2003,31(11):1743-1746. 被引量:4
  • 9Borgia E, Delmaslro F. Effects of unstable links on aodv perfor- mance in real testbeds[ J]. EURASIP Journal on Wireless Com- munication and Networking,2007, vo12007:1 - 14.
  • 10张禄林,李承恕.MANET路由选择协议的比较分析研究[J].电子学报,2000,28(11):88-92. 被引量:24

二级参考文献23

  • 1付国江,王少梅,刘舒燕,李宁.改进的速度变异粒子群算法[J].计算机工程与应用,2006,42(13):48-50. 被引量:15
  • 2T Camp, J Boleng, V Davies. A survey of mobility models for ad hoc network research [J]. Wireless Communications and Mobile Computing: Special Issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2002,2 (5) :483 - 502.
  • 3D Johnson, D Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks[M]. Boston: Kluwer Academic Publishers, 1996. 153- 181.
  • 4Alparslan D N, Sohraby K. A generalized random mobility model for wireless ad hoc networks and its analysis: one-dimensional case[J]. IEEE Transaction on Networking, 2007,15 (3) :602 - 615.
  • 5Alparslan D N, Sohraby K. Two-Dimensional modeling and analysis of generalized random mobility models for wireless ad hoc networks[ J ]. IEEE Transaction on Networking, 2007, 15 (3) :616 - 629.
  • 6E M Royer,P M M Smith, L E Moser. An analysis of the optimum node density for ad hoc mobile networks[ A]. In Proceedings of the IEEE International Conference on Communications [ C]. Helsinki: IEEE Press,2001.857 - 861.
  • 7V Tolety. Load reduction in ad hoc networks using mobile servers[ D]. Colorado: Colorado School of Mines, 1999.
  • 8V Davies. Evaluating mobility models within an ad hoc network [D]. Colorado: Colorado School of Mines,2000.
  • 9X Hong, M Gerla, G Pei, C Chiang. A group mobility model for ad hoc wireless networks[A]. In Proceedings of the ACM International Workshop in Modeling and Simulation of Wireless and Mobile Systems[C]. Seattle: ACM Press, 1999.53 - 60.
  • 10J M Ng, Y Zhang. A mobility model with group partitioning for wireless ad hoc networks[ A]. The International Conference on Information Technology and Applications [ C ]. Sydney: IEEE Press, 2005.289 - 294.

共引文献33

同被引文献8

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部