Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Implementation of Node Transition Probability based Routing Algorithm for MANET and Performance Analysis using Different Mobility Models

  • Published : 2003.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

Keywords

References

  1. Charles E. Perkins, Introduction to Ad hoc Networking, Addision Wesley,Dec2001
  2. C. E. Perkins and E. M. Royer, 'Ad hoc on demand distance vector routing,' in Proc. IEEE WMCSA'99, New Orleans, LA, Feb. 1999, pp. 90-100
  3. C. E. Perkins and P. Bhagwat, 'Highly dynamic destination- sequenceddistance vector routing (DSDV) for mobile computers,' in Proc. ACMSIGC0MM'94, London, UK, Sept. 1994, pp. 234-244
  4. J. Broch, D. B. Johnson, and D. A. Maltz, 'The dynamic source routingprotocol for mobile ad hoc networks,' Internet Draft, draft-ietf-manet-dsr-OO.txt, Mar. 1998, Work in Progress
  5. R. Dube et al., 'Signal stability-based adaptive routing (SSA) for ad hocmobile networks,' IEEE Pers. Commun.,pp. 36-45, Feb. 1997
  6. C.-K. Toh, 'Associativity-based routing for ad-hoc mobile networks,'Wireless Pers. Commun. J., special issue on Mobile Networking and Computing Systems, Kluwer Academic Publishers, vol. 4, no. 2, PP. 103-139,Mar. 1997 https://doi.org/10.1023/A:1008812928561
  7. S. Agarwal et al., 'Route-lifetime assessment based routing (RABR) Protocol for mobile ad hoc networks,' in Proc. IEEE ICC'2000, New Orleans,USA
  8. E. M. Royer and C.-K. Toh, 'A review of current protocols for ad hocmobile wireless networks,' IEEE Pers. Commun., vol. 6, no. 2, PP. 46-55,Apr. 1999 https://doi.org/10.1109/98.760423
  9. S. Radha and S. Shanmugavel, 'Node transition probability based unicastrouting algorithm or mobile ad-hoc networks,' in Proc. IEEE Int. Conf.Wireless Lan and Home Networks, Singapore 2001
  10. S. Radha and S. Shanmugavel, 'Node transition probability based routing,' in Proc. 12th IEEE LANMAN'2002, Stockhlom, Sweden, Aug. 11-14,2002
  11. Glomosim User Manual, http://pcl.cs.ucla.edu/projects/glomosim
  12. R. Bagrodia et al., PARSEC: A parallel simulation environment for complex systems (IEEE 0CT1998)
  13. R. A. Meyer and R. Bagrodia, PARSEC User Manual Release 1.1.http://pcl.cs.ucla.edu/, lan. 1999
  14. T, S. Rappaport, Wireless Communications: Principles and Practice, Prentice Hall, Upper Saddle River, NJ, Oct. 1995
  15. T. S. Rappaport, S. Y, Seidel, and K. Takamizawa, 'Statistical channelimpulse response models for factory and open plan building radio communication system design,' IEEE Trans. Commun., vol. C0M-39, no. 5,pp. 794-807, May 1991
  16. T. Camp, V. Davies, and J. Boleng, 'Mobility Models for Ad Hoc Network Simulations," June 6, 2001
  17. G. Pei, Scalable Routing Strategies for Large Ad Hoc Wireless Networks,Ph.D. Thesis, UCLA, 2000
  18. S. R. Das, C. E. Perkins, and E. M. Royer, 'Performance comparison oftwo on-demand routing protocols for ad hoc networks,' in Proc. IEEEINF0C0M'2000, Tel Aviv, Israel, Mar. 2000, PP. 3-12