Analysis of Reactive Routing Protocols for Mobile Ad Hoc Networks in Markov Models

WANG Han-xing; HU Xi; FANG Jian-chao; JIA Wei-jia

Article Contents

Article Navigation > Applied Mathematics and Mechanics > 2007 > 28(1): 114-126

WANG Han-xing, HU Xi, FANG Jian-chao, JIA Wei-jia. Analysis of Reactive Routing Protocols for Mobile Ad Hoc Networks in Markov Models[J]. Applied Mathematics and Mechanics, 2007, 28(1): 114-126.

Citation:

WANG Han-xing, HU Xi, FANG Jian-chao, JIA Wei-jia. Analysis of Reactive Routing Protocols for Mobile Ad Hoc Networks in Markov Models[J]. Applied Mathematics and Mechanics, 2007, 28(1): 114-126.

Citation:

WANG Han-xing, HU Xi, FANG Jian-chao, JIA Wei-jia. Analysis of Reactive Routing Protocols for Mobile Ad Hoc Networks in Markov Models[J]. Applied Mathematics and Mechanics, 2007, 28(1): 114-126.

PDF( 501 KB)

Analysis of Reactive Routing Protocols for Mobile Ad Hoc Networks in Markov Models

1.
Department of Mathematics and Statistics, Shanghai Lixin University of Commerce, Shanghai 201620, P. R. China;

Received Date: 2005-12-05
Rev Recd Date: 2006-10-16
Publish Date: 2007-01-15

Abstract

Abstract

Mobile ad hoc networks (MANETs) have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. A MANET is modeled so that the length of each link in the network is considered as a birth-death process and the space is reused n times in the flooding process, which is named as an n-SRBDM model. The performance of the network is analyzed 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 limit0, the probability that a request packet finds a S-time-valid route or a symmetrical-valid route, and the average time needed t o 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. Two models with spatial reuse and without spatial reuse are compared by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.
- MANETs,
- Markov Model,
- Routing protocol,
- performance analysis

FullText(HTML)

References(14)

References

[1]	朱洪波,傅海洋,吴志忠,等.无线接入网[M].北京:人民邮电出版社,2000,80-102.
[2]	Royer E M, Toh C K.A review of current routing protocols for ad hoc mobile wireless networks[J].IEEE Personal Communications,1999,6(2):46-55. doi: 10.1109/98.760423
[3]	Johnson D B. Routing in ad hoc networks of mobile hosts[A]. Proceeding of the IEEE Workshop on Mobile Computing Systems and Applications[C].1994,158-163[2006-01-26].
[4]	Johnson D B,Maltz D A. Dynamic Source Routing in ad Hoc Wireless Networks[M].Chapter 5, Mobile Computing.Tomasz Imielinski and Hank Korth:Kluwer Academic Publisher，1996，153-181.
[5]	Johnson D B, Maltz D A, Hu Y C. The dynamic source routing protocol for mobile ad hoc networks(DSR)[S]. IETF MANET working group INTERNET-DRAFT,Feb,2002.
[6]	Perkins C E, Royer E M. Ad hoc on-demand distance vector routing (AODV)[A].Proc and IEEE Workshop on Mobile Computing Systems and Applications[C].New Orleans: L A Feb,1999,90-100[2006-01-26].
[7]	Broch J,Maltz D A,Johnson D B,et al.A performance of multi-hop wireless ad hoc network routing protocols[A].Proceeding of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking(Mobicom'98)[C].Dallas, Texas, USA:Oct，1998，25-30.
[8]	Perkins C E, Royer E M, Das S R,et al.Performance comparison of two on-demand routing protocols for ad hoc networks[J].IEEE Personal Communications,2001,8(1):16-28. doi: 10.1109/98.904895
[9]	Jacquet P, Laouiti A.Analysis of mobile ad hoc network routing protocols in random graph mobiles[R]. Rapport de Recherche no 3835.Institut National de Recherche en Informatique et en Automatique,1999.
[10]	Dube R,Rais C D,Wang K Y,et al.Signal stability-based adaptive routing(SSA) for ad hoc mobile networks[J].IEEE Personal Communications,1997,4(1):36-45. doi: 10.1109/98.575990
[11]	Su W,Lee S J, Gerla M.Mobility prediction in wireless networks[A].IEEE MILCOM 2000[C].Los Angeles, CA,2000[2006-01-26]. www.kpl.hp.cora/personal/sung-Ju-Lee/abstracts/papers/milcom 2000,pdf.
[12]	Asmussen S.Applied probability and Queues[M].New York:Wiley,1987.
[13]	Wang Z K, Yang X Q.Birth and Death processes and Markov Chains[M]. New York:Springer-Verlag, Beijing:Science Press,1992.
[14]	Kelly F P.Reversibility and Stochastic Networks[M].New Yokr:Wiley,1979.