A Trusted Model Using Improved-AODV in MANETS with Packet Loss Reduction Mechanism

A Trusted Model Using Improved-AODV in MANETS with Packet Loss Reduction Mechanism

Mohammad SirajuddinCh Rupa Ande Prasad

Deparment of CSE, JNTU Kakinada, Kakinada 533003, Andhra Pradesh, India

Dept. of CSE, VRSEC, Vijayawada 520007, Andhra Pradesh, India

Dept. of C.S, VSU (Vikarama Simhapuri University), Nellore 524001, Andhra Pradesh, India

Corresponding Author Email: 
sirajcse6@gmail.com
Page: 
15-22
|
DOI: 
https://doi.org/10.18280/ama_b.610104
Received: 
27 February 2018
| |
Accepted: 
15 March 2018
| | Citation

OPEN ACCESS

Abstract: 

A MANET is a self-configured network which do not need any special infrastructure, as the nodes are versatile, topology of network changes frequently that prompts connection failures. Because of its special characteristics like dynamic topology, hop-by-hop communications and easy and quick setup, MANET faced lots of challenges allegorically routing, security and clustering. The security challenges arise due to MANET’s self configuration and self-maintenance capabilities. In this paper Ad hoc On Demand Distance Vector algorithm is discussed which is helpful for routing and a new Improved-Ad hoc On Demand Distance Vector Routing algorithm is proposed which establishes routing based on trust on the nodes in MANET.AODV is responsive passage revelation convention where a mobile node of MANET gets associated with gateway. I-AODV is used for identifying node routing behavior and recognizing the route failures, for example, data droppings, black hole and worm hole assaults in MANET.I-AODV also uses the Intrusion Detection framework on trust based routing. Each send or received message takes specific measure of energy from the node. So node's collective energy level based on bit by bit will get reduced each time while it sends or receivesdata packets. Along these lines node will stop to be present and packets originating from the source will be dropped since one of the node on the present route is never again working. These packet loss occasions are watched and limited in this paper. In this manuscript after completing routing using I-AODV protocol with trust dependency Multi-Ack scheme is used for packet loss reduction. The proposed method utilizing the NS2 simulator test system. The consequences of this work is precisely assessing and executing routing convention in a specially appointed condition with efficient routing and reducing packet loss ratio.

Keywords: 

MANET, trust, malicious node, AODV, I-AODV, packet loss reduction

1. Introduction
2. Related Work
3. Proposed Work
4. Implementation of Trust Based Routing
5. Packet Loss Reduction Using Multi-Ack Scheme
6. Execution Analysis
7. Conclusion
  References

[1] Wu B, Wu J, Dong YH. (2008). An efficient group key management scheme for mobile ad hoc network. International Journal and Networks 4(2).

[2] Chan ACF. (2004). Distributed symmetric key management for mobile ad hoc networks. IEEE.

[3] Aziz B, Nourdine E, Mohamed E. (2008). A recent survey on key management schemes in MANET”ICTTA’ 08: 1-6.

[4] Anderson R, Hao W, Perring A. (2004). Key Infection: Smart trust for smart dust. 12th IEEE International Conference on Network Protocol ICNP. 

[5] Valle G, Cerdenas R. (2005). Overview the key Management in Ad Hoc Networks. ISSADS, 397–406.

[6] Luo H, Lu S. (2004). URSA: Ubiquitous and robust access control for mobile ad hoc networks. IEEE / ACM Transactions on Networking 12: 1049-1063.

[7] Nichols R, Lekkas P. (2002). Wireless Security-Models, Threats, and Solutions, McGraw Hill, Chapter 7.

[8] Lou W, Fang Y. (2003). A survey of wireless security in mobile Ad Hoc networks: Challenges and available solutions. Ad Hoc Wireless Networks, edited by X. Chen, X. Huang and D. Du.Kluwer Academic Publishers, 319-364. 

[9] Murthy C, Manoj B. (2005). Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall PTR. 

[10] Saloma A. (1996). Public-Key Cryptography, Springer-Verlag. 

[11] Tanenbaum A. (2003). Computer Networks, PH PTR.

[12] Burnett S, Paine S. (2001). RSA Security’s Official Guide to Cryptography, RSA Press.

[13] Tanenbaum A. (2002). Network Security, Chapter 8, Computer Networks. Prentice Hall PTR, 4thEdition. 

[14] Menezes A, Oorschot P, Vanstone S. (1996). Handbook of Applied Cryptography, CRC Press.

[15] Wu B, Wu J, Dong YH (2008). An efficient group key management scheme for mobile ad hoc network. International Journal and Networks.

[16] Jin HC. Design and Analysis of QoS-Aware Key Management and Intrusion Detection Protocols for Secure Mobile Group Communications in Wireless Networks. Thesis submitted to the Faculty of the Virginia Polytechnic Institute and State University. 

[17] Wilson JW, Chen IR. (2005). Performance characteristics of location-based group membership and data consistency algorithms in mobile ad hoc networks. International Journal of Wireless and Mobile Computing 1(8).

[18] Wei W, Zakhor A. (2004). Conectivity for multiple multicast trees schemes in ad hoc networks. International Workshop on Wireless Ad Hoc Networks (IWWAN 2004), Oulu, Finland, 270–274.