期刊文献+

Average flooding distance for MANETs in random graph models with spatial reuse

Average flooding distance for MANETs in random graph models with spatial reuse
下载PDF
导出
摘要 The flooding distance is an important parameter in the design and evaluation of a routing protocol, which is related not only to the delay time in the route discovery, but also to the stability and reliability of the route. In this paper, the average flooding distance (AFD) for a mobile ad hoc network (MANET) in a random graph model was given based on the dynamic source routing (DSR) protocol. The influence of spatial reuse on the AFD was also studied. Compared with that in the model without the spatial reuse, the AFD in the model with the spatial reuse has much smaller value, when the connetivity probability between nodes in the network is small and when the number of reused times is large. This means that the route discovery with the spatial reuse is much more effective. The flooding distance is an important parameter in the design and evaluation of a routing protocol, which is related not only to the delay time in the route discovery, but also to the stability and reliability of the route. In this paper, the average flooding distance (AFD) for a mobile ad hoc network (MANET) in a random graph model was given based on the dynamic source routing (DSR) protocol. The influence of spatial reuse on the AFD was also studied. Compared with that in the model without the spatial reuse, the AFD in the model with the spatial reuse has much smaller value, when the connetivity probability between nodes in the network is small and when the number of reused times is large. This means that the route discovery with the spatial reuse is much more effective.
出处 《Journal of Shanghai University(English Edition)》 CAS 2007年第4期336-339,共4页 上海大学学报(英文版)
基金 supported by the National Natural Science Foundation of China(Grant No.60572126)
关键词 mobile ad hoc network (MANET) dynamic source routing (DSR) random graph mobile ad hoc network (MANET), dynamic source routing (DSR), random graph
  • 相关文献

参考文献10

  • 1Ko Y B,,SHANKARKUMAR V,VAIDYAN H.Medium ac- cess control protocols using directional antennas in ad hoc networks[].Proceedings of the IEEE INFOCOM.2000
  • 2CHOUDHURRY R R,,YANG X,RAMANATHAN R,VAIDYA N.Using directional antennas for medium ac- cess control in ad hoc networks[].ACM In- ternational Conference on Mobile Computing and Net- working.2002
  • 3PERKINS C E,ROVER E M,DAN S R.Ip Flooding in Ad Hoc Networks[].INTERNET DRAFT.2001
  • 4PARUCHURI V S,,DURRESI A,DASH D S,JAIN R.Optimal flooding protocol for routing in ad-hoc net- works[].Proceeding of the IEEE WCNC.2003
  • 5NI S Y,TSENG Y C,CHEN Y S,SHEI J P.The broad- cast storm problem in a mobile ad hoc network[].Proceedings of the Fifth Annual ACM/IEEE Interna- tional Conference on Mobile Computing and Network- ing.1999
  • 6YI Y J,,GERLA M,KON T J.Efficient flooding in ad hoc networks using on-demand (passive) cluster formation[].Proceedings of the rd ACM International Sym- posium on Mobile Ad Hoc Networking and Computing MobiHoc.2002
  • 7PERKINS C E,,ROYER E M.Ad-hoc on-demand dis- tance vector routing (AODV)[].Proceedings of the nd IEEE Workshop on Mobile Computing Systems and Applications.1999
  • 8JOHNSON D B,MALTZ D A.Dynamic source routing in ad hoc wireless networks[].Mobile Computing.1996
  • 9PARK V D,,CORSON M S.A highly adaptive dis- tributed routing algorithm for mobile wireless networks[].The IEEE Conference on Computer Communica- tions.1997
  • 10PERKINS C E,,BHAGWAT P.Highly dynamic destina- tion-sequenced distance-vector (DSDV) routing for mobile computers[].Proceedings of the ACM SIGCOMM‘ Conference on Communications Archi- tecturesProtocols and Applications.1994

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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