Abstract

Mobile Adhoc Networks enforces certain level of challenges for the researchers since they operate without a fixed infrastructure. Moreover the constant movement of nodes gives additional challenges while implementing any type of solutions. Similarly enforcing secure mode of routing in mobile adhoc networks creates lot of hurdles for the implementers. This paper addresses these issues, by computing the trust of each node and updating the trust tables of the respective nodes and the cluster head. This paper focus in designing a trusted secure mechanism for routing. The objective of this work is to calculate the trust of nodes using various trust methods. Later the calculated trust is updated with the trust table of the cluster head by forming a web of trust. This will enable a secure channel of communication among the adhoc nodes. After incorporating the newly computed trust, the routing performance of well known routing protocol say AODV, is evaluated for various routing parameters and it is compared with the performance of Trusted AODV(TODV).

Highlights

  • Adhoc Networks are decentralized networks that bye-passes the centralized router

  • When a node wants to route a packet to the destination, the routing protocol‟s functioning is highly challenging[1]. Inorder to handle these challenges, researchers strive to find lot of solutions. One such solution to handle the mobility of nodes is that, they tried to build some hierarchy among nodes, by forming clusters

  • Based on the performance exhibited by the protocols after the evaluation of routing parameters, it is concluded that the performance of Trusted AODV (TAODV) shows good results over conventional AODV

Read more

Summary

Introduction

Adhoc Networks are decentralized networks that bye-passes the centralized router. Unlike the wired counterpart, this network does not depend on the existing infrastructure for their operations. As the word „adhoc‟ means „for this purpose‟, this network finds its application where fixed networks cannot be configured Since this network, functions in a decentralized manner, here, each node acts as a router while forwarding a packet to the destination. Functions in a decentralized manner, here, each node acts as a router while forwarding a packet to the destination This networks operates as a multihop network. When a node wants to route a packet to the destination, the routing protocol‟s functioning is highly challenging[1]. Inorder to handle these challenges, researchers strive to find lot of solutions.

Objectives
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.