期刊文献+

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models
下载PDF
导出
摘要 Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model (n-SRBDM). We analyze the performance of the network under the dynamic source routing protocol (DSR) which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing. Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model (n-SRBDM). We analyze the performance of the network under the dynamic source routing protocol (DSR) which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.
出处 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2007年第1期127-139,共13页 应用数学和力学(英文版)
基金 Project supported by the National Natural Science Foundation of China (Nos.10471088 and 60572126)the Science Foundation of Shanghai Municipal Commission of Education (No.06ZZ84)
关键词 Mobile ad hoc network Markov model routing protocol performance analysis Mobile ad hoc network, Markov model, routing protocol, performance analysis
  • 相关文献

参考文献10

  • 1Wang Z K,Yang X Q.Birth and death processes and Markov chains[]..1992
  • 2Perkins C E,Royer E M.Ad hoc on-demand distance vector routing (AODV)[].Proceeding and the IEEE Workshop on Mobile Computing Systems and Applications.1999
  • 3Dube R,Rais C D,Wang K Y,Tripathi S.Signal stability-based adaptive routing(SSA) for ad hoc mobile networks[].IEEE Personal Communications.1997
  • 4Johnson D B,Maltz D A,Hu Y C.The dynamic source routing protocol for mobile ad hoc networks(DSR)[].IETF MANET Working Group Internet-Draft.2002
  • 5Perkins C E,Royer E M,Das S R,Marina M K.Performance comparison of two on-demand routing protocols for ad hoc networks[].IEEE Personal Communications.2001
  • 6Kelly F P.Reversibility and stochastic networks[]..1979
  • 7Broch J,Maltz D A,Johnson D B,Hu Y C,Jetcheva J.A performance of multi-hop wireless ad hoc network routing protocols[].Proceeding of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom‘).1998
  • 8Su W,Lee S J,Gerla M.Mobility prediction in wireless networks[].IEEE MILCOM.2000
  • 9Asmussen S.Applied probability and queues[]..1987
  • 10Royer E M,Toh C K.A review of current routing protocols for ad hoc mobile wireless net works[].IEEE Personal Communications.1999

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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