期刊文献+

基于网关信息素更新的MANET接入Internet开销控制方法 被引量:4

Overhead Reducing Method for MANET Accessing Internet Based on Gateway Pheromone Update
在线阅读 下载PDF
导出
摘要 寻找可用网关是MANET接入Internet过程中产生开销最大的一个环节.为了有效控制接入过程中的路由开销,根据蚂蚁寻径与移动节点寻找网关的相似性,提出了一种基于网关信息素更新的接入网络开销控制算法.该算法模仿蚁群算法中信息素更新方式,运用路由应答报文中携带的信息对网关信息素进行更新.节点在寻路时根据路径上的信息素浓度、链路带宽和时延等参数计算转发概率并进行转发.通过运用NS2.29对该算法进行仿真,结果表明该算法虽然平均端到端时延略有增加,但是有效地减少了归一化路由开销,并提高了分组投递率,验证了算法的有效性. Looking for usable gateway is a process,which brings the biggest overhead,in MANET accessing Internet.For controlling the routing overhead effectively,an accessing network overhead control algorithm,which based on gateway pheromone,is proposed in this paper according to the similar between ant searching path and mobile node searching gateway.By simulating the pheromone′s update process in ant colony algorithm,this algorithm uses information carried in RREP to update gateway pheromone.According to the pheromone density on the link,link bandwidth and delay,the node computes transmission probability and transmits the RREQ.This algorithm is simulated by NS2.29.The test result indicates that though it increases average delay appreciably,it reduces normalized routing overhead effectively and increases packet delivery radio.The validity of algorithm is validated.
作者 李昕 李喆
出处 《电子学报》 EI CAS CSCD 北大核心 2010年第4期870-874,881,共6页 Acta Electronica Sinica
关键词 开销控制 MANET接入 网关发现 网关信息素 overhead control mobile ad hoc networks(MANET) accessing gateway discovery gateway pheromone
  • 相关文献

参考文献11

二级参考文献49

共引文献51

同被引文献74

  • 1薛小平,刘名扬,林铌忠,张越好.TSLV:Time-Slice-Based Location Verification for VANET[J].China Communications,2011,8(5):130-143. 被引量:3
  • 2WILLKE T L,TIENTRAKOOL P, MAXEMCHUK N F. A survey of in- ter-vehicle communication protocols and their applications [ J] ; II::EE Communications Surveys & Tutorials,2009,11 (2) ;3-20,.
  • 3LEE J H, ERNST T, CHILMAKURTI N. Performance analysis of PMIPv6-based network mobility for inteUigent transportation systems [ J]. IEEE Trans on Vehicular Technology,2012,61 (1) :74-85.
  • 4PARNO B, PERRIG A. Challenges in securing vehicular networks [ C]//Proe of the 4th Workshop on Hot Topics in letworks.'2005.
  • 5NI S Y ,TSENG Y C, C HEN Y S, et al. The broadcast storm problem in a mobile Ad hoc network [ C]//lhvc of the 5th Annual ACM/ IEEE International Conference on Mobile Computing and Networ- kings. New York:ACM Press,1999:lSl-162.
  • 6PERKINS C E,BELDING.ROYERE,DAS S. RFC 3561 ,Ad hoc on- demand distance vector ( AODV ) muting [ S/OL ]. [ 2003- 07 ]. ht- tp ://www. ieff. 0rg/ffc/ffc3561. txt.
  • 7JOHNSON D B, MALTZ D A, HU Y C. The dynamic sottwe routing protocol for mobile Ad hoc networks [ R ]. [ S 1. ] : IETF MANET Working Group,2007.
  • 8PERKINS C E, BHAGWAT P. Highly dynamic destination-sequenced distance-vector routing(DSDV) for mobile computers[J]. ACM SIG- COMM Computer Communication Review, 1994,24 (4) : 234- 244.
  • 9BISWA$ S, TATCHIKOU R, DION F. Vehicle-to-vehicle wireless communication protocols for enhancing highway traffic safety [J ]. IEEE Communications Magazine,2006;44( l ) :74.82.
  • 10MURTHY S,GARCIA-LUNA-ACEVES J J. An eifieient muting proto- col for wireless networks [ J ]. Mobile Network and Applications, 1996,1 (2) 183-197.

引证文献4

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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