Analysis of reactive routing protocols for mobile ad hoc networks in Markov models
- 81 Downloads
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 birth-death process and the space is reused for n times in the flooding process, which is named as an n-spatial 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.
Key wordsMobile ad hoc network Markov model routing protocol performance analysis
Chinese Library ClassificationO211.62
2000 Mathematics Subject Classification60J27
Unable to display preview. Download preview PDF.
- Zhu Hongbo, Fu Haiyang, Wu Zhizhong, et al. Wireless access network[M]. Beijing: People’s Post and Telecommunications Publishing Company, 2000, 80–102 (in Chinese).Google Scholar
- Johnson D B. Routing in ad hoc networks of mobile hosts[C]. In: Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications, Santa Cruz, California, USA, 1994, 158–163.Google Scholar
- Johnson D B, Maltz D A. Dynamic source routing in ad hoc wireless networks, chapter 5, mobile computing[M]. Kluwer Academic Publisher, 1996, 153–181.Google Scholar
- 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[2002-12-01]. http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-07.tex.
- Perkins C E, Royer E M. Ad hoc on-demand distance vector routing (AODV)[C]. In: Proceeding and the IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, Feb.1999, 90–100.Google Scholar
- Broch J, Maltz D A, Johnson D B, Hu Y C, Jetcheva J. A performance of multi-hop wireless ad hoc network routing protocols[C]. In: Proceeding of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom’ 98), Dallas, Texas, USA, Oct.1998, 25–30.Google Scholar
- Perkins C E, Royer E M, Das S R, Marina M K. Performance comparison of two on-demand routing protocols for ad hoc networks[J]. IEEE Personal Communications, 2001:16–28.Google Scholar
- 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.Google Scholar
- Su W, Lee S J, Gerla M. Mobility prediction in wireless networks[C]. In: IEEE MILCOM 2000, Los Angeles, CA, 2000.Google Scholar
- Asmussen S. Applied probability and queues[M]. Chichester: Wiley, 1987.Google Scholar
- Wang Z K, Yang X Q. Birth and death processes and Markov chains[M]. New York: Springer-Verlag; Beijing: Science Press, 1992.Google Scholar
- Kelly F P. Reversibility and stochastic networks[M]. Chichester: Wiley, 1979.Google Scholar