Open Access Open Access  Restricted Access Subscription or Fee Access

Performance Analysis and Enhancement of Distance Based Routing Protocol in MANET

V. Gowri, M. Punithalatha, R. Gowri Shankar

Abstract


A mobile ad hoc network (MANET) is a collection of wireless mobile nodes communicating with each other using multi-hop wireless networks. One of the main challenges of MANET is the design of robust routing algorithms that adapt to the frequent and randomly changing network topology. This feature leads to frequent path failures and route reconstructions, which causes an increase in the routing control overhead. A variety of routing protocols have been proposed and several of them have been extensively simulated or implemented as well. Existing distance based routing protocols like Ad-hoc On-demand Multipath Distance Vector (AOMDV) routing protocol, which is a multipath routing protocol, Destination sequence distance vector (DSDV) routing protocol, Distance Routing Effect Algorithm For Mobility (DREAM), Secure Efficient Distance Vector Routing For Mobile Wireless Ad Hoc Networks (SEAD), and Polarized Gossip Protocol (PGP) are analyzed and concluded that PGP performs well compared to other protocol mentioned above. In proposed work the position-based routing features combined into on-demand routing protocols and proposes a distance based routing protocol (EDRP) in the absence of positioning service to improve the route discovery.

Keywords


Routing Protocols, AOMDV, Dream, DSDV, EDRP, PGP, SEAD.

Full Text:

PDF

References


R. Jainetal “Comparative study of 3 mobile ad hoc network routing protocols under different traffic source “ IEEE International conference on communication system and network technology.2011

Matthew Britton and Andrew Coyle “Performance Analysis of the B.A.T.M.A.N. Wireless Ad-Hoc Network Routing Protocol with Mobility and Directional Antennas © 2011 The University of Adelaide.

M.K.Marina and S.R.Das, “On-Demand multipath distance vector routing in ad hoc networks” in: Proceedings of the 9th IEEE International Conference on Network Protocols (ICNP), 2001.

S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, “A distance routing effect algorithm for mobility (DREAM),” in Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom), 1998, pp.76–84.

C. E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” SIGCOMM Conference on Communications Architectures, Protocols and Applications, Aug. 1994, pp. 234-244.

R. Beraldis, “The polarized gossip protocol for path discovery in MANETs,” Ad Hoc Netw., vol. 6, no. 1, pp. 79–91, Jan. 2008. [16] T. K. Sarkar, Z. Ji, K. Kim, A. Medouri, and M. Salazar-Palma, “A survey of various propagation models for mobile communication,” IEEE Antennas Propag. Mag., vol. 45, no. 3, pp. 51–82, Jun. 2003.

R. Dube, C. D. Rais, K. Y. Wang, and S. K. Tipathi, “Signal stability based adaptive routing (SSA) for ad-hoc mobile networks,” IEEE Pers. Commun., vol. 4, no. 1, pp. 36–45, Feb. 1997.

X. M. Zhang, F. F. Zou, E. B. Wang, and D. K. Sung, “Exploring the dynamic nature of mobile nodes for predicting route lifetime in mobile ad hoc networks,” IEEE Trans. Veh. Technol., vol. 59, no. 3, pp. 1567–1572, Mar. 2010.

B. Ghosh, “Random distances within a rectangle and between two rectangles,” Bull. Calcutta Math. Soc., vol. 43, pp. 17–24, 1951.

C. Bettstetter, H. Hartenstein, and X. Perez-Costa, “Stochastic properties of the random waypoint mobility model,” Wireless Netw., vol. 10, no. 5, pp. 555–567, Sep. 2004.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.