Networking and Communication Engineering

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Evaluation of Traditional SPAs with AODV Routing Protocol for MANETs


Affiliations
1 Department of ECE, FEAT, Annamalai University, India
     

   Subscribe/Renew Journal


In recent emerging research need topic of Mobile Ad-hoc Networks (MANET) is one of dominating in society for natural issues in world.MANET to face many critical problems in society day by day, in this aspect the most dominating issue is link breakage, packet dropping, energy and retransmission. In this paper i plane to serve society in first step of my research reduce packet droppingwith minimum energy.  This technical research work discussed On-demand routing protocol (AODV) technic with many set of topologies and three set of nodes using two different shortest path algorithms (SPA) namely, Bellman Ford andDijkstra’s algorithm.Primary goal of this work to reduce packet dropping and increases remaining energy using five steps (i) flooding route request to all the active nodes, (ii) test all node ID from our network group, (iii) find minimum weighted of route, (iv) calculate utilization energy of finding route (v) communication start from source to destination.  Analysisvarious parameters such as,Packet Delivery Ratio, Routing Overhead, End-to-End Delay andThroughput through one of the most popular user friendly software Network Simulator 2 (NS2).  Finallyit’s clear that all results of SPA using protocols better than the traditional routingprotocols.


Keywords

MANET, Routing Protocols, SPA’s, NS2, PDR, RO, Delay, Energy, Throughput, Speed, Packet Loss.
User
Subscription Login to verify subscription
Notifications
Font Size

  • P. Narvaez, et al (2000) “New dynamic algorithms for shortest path tree computation,” IEEE, Vol. 8, No. 6, pp. 734–746.

  • Xiao, et al (2004) “Dynamic update of shortest path tree in OSPF”, in Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 18–23.

  • JieGao and Li Zhang (2004) “Load balanced short path routing in wireless networks”, IEEE.

  • Alvin C. Valera, et al (2005) “Improving protocol robustness in ad-hoc networks through cooperative packet caching and shortest multipath routing”, IEEE, Vol. 4, No. 5, pp. 443-457

  • AnandPatwardhan and Iorga, (2005) “Secure routing and Intrusion Detection in Ad-hoc networks”, in Proc. 3rd Int. Conf. Pervasive Computer Communication, pp.191–199.

  • Demetrescu and G. F. Italiano (2006) “Experimental analysis of dynamic all pairs shortest path algorithms”, ACM, Vol. 2, No. 4, pp. 578–601.

  • S. Taoka, et al (2007) “Performance comparison of algorithms for the dynamic shortest path problem”, IEICE, Vol. 90, No. 4, pp. 847–856.

  • Jack Tsai and Tim Moors (2007) “A review of multipath routing protocols from wireless ad-hoc to mesh networks” IEEE, Vol. 12, No. 3, pp. 367-372.

  • Fuhaozhang, et al (2007) “Improve on dijkstra shortest path algorithm for huge data”, IEEE, Vol. 7, No. 2, pp. 313-316.

  • Yangcheng Huang, et al (2008) “Route dynamics for shortest path first routing in mobile ad-hoc networks”, IEEE, Vol. 12, No. 4, pp. 87-93.

  • Shengxiang Yang, et al (2010) “A genetic algorithm with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad-hoc networks”, IEEE, Vol. 40, No. 1, pp. 52-63.

  • Yanfang Deng and Hengqing Tong (2010) “Dynamic shortest path algorithm in stochastic traffic networks using PSO based on fluid neural network”, JILSA, Vol. 3, pp. 11-16.

  • ParulTomar, and Suri, (2010) “A Comparative Study for Secure Routing in MANET”, IJCA, Vol.4, No.5, pp. 298-307.

  • AishwaryaSagar and MeenuChawla, (2010) “Detection of Packet Dropping Attack Using Improved Acknowledgement Based Scheme in MANET”, IJCSI, Vol.7, No. 4, pp.

  • Thamizhmaran, K. et al. (2012) “Authentication and Intrusion Detection in MANET”, IJART, Vol. 3, No. 3, pp.15-21.

  • Naveen Kumar Gupta (2013) “Trust and shortest path selection based routing protocol for MANET”, IJCA, Vol. 76, No. 12, pp. 20-23.

  • KanikaPasrija, et al (2013) “Shortest path routing over mobile ad-hoc networks”, IJARCSSE, Vol. 3, No. 9. pp. 467-471.

  • Rameshkumar, and Damodaram (2013) “Efficient secure AODV using hybrid shortest path routing to improve the performance for grid computing”, IJES, Vol. 2, No. 3, pp. 1-7.

  • Ragb O. M. Saleh, et al (2013) “Impact of route selection metrics on the performance of DSR protocol for MANETs”, IJCSI, Vol. 10, No. 2(3), pp. 123-130.

  • Selvakumar and Seetha (2014) “Improving the network Lifetime of MANETs through CSP routing algorithm”, IJCSET, Vol. 5, No. 4, pp. 404-409.

  • Prabu, K. and Subramani, A. (2014) “Energy efficient routing in MANET through edge node selection using ESPR algorithm”, Int. J. Mobile Network Design and Innovation, Vol. 5, No. 3, pp. 166–175.


Abstract Views: 163

PDF Views: 4




  • Evaluation of Traditional SPAs with AODV Routing Protocol for MANETs

Abstract Views: 163  |  PDF Views: 4

Authors

K. Thamizhmaran
Department of ECE, FEAT, Annamalai University, India

Abstract


In recent emerging research need topic of Mobile Ad-hoc Networks (MANET) is one of dominating in society for natural issues in world.MANET to face many critical problems in society day by day, in this aspect the most dominating issue is link breakage, packet dropping, energy and retransmission. In this paper i plane to serve society in first step of my research reduce packet droppingwith minimum energy.  This technical research work discussed On-demand routing protocol (AODV) technic with many set of topologies and three set of nodes using two different shortest path algorithms (SPA) namely, Bellman Ford andDijkstra’s algorithm.Primary goal of this work to reduce packet dropping and increases remaining energy using five steps (i) flooding route request to all the active nodes, (ii) test all node ID from our network group, (iii) find minimum weighted of route, (iv) calculate utilization energy of finding route (v) communication start from source to destination.  Analysisvarious parameters such as,Packet Delivery Ratio, Routing Overhead, End-to-End Delay andThroughput through one of the most popular user friendly software Network Simulator 2 (NS2).  Finallyit’s clear that all results of SPA using protocols better than the traditional routingprotocols.


Keywords


MANET, Routing Protocols, SPA’s, NS2, PDR, RO, Delay, Energy, Throughput, Speed, Packet Loss.

References