Open AccessDempstershafer Theory and Encounter Based Trust Routing in Mobile Ad Hoc Network
Author(s) -
Sanjay Kumar
Publication year - 2020
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.e3113.018520
Subject(s) - mobile ad hoc network , node (physics) , computer science , computer network , wireless ad hoc network , routing (electronic design automation) , trust management (information system) , routing protocol , computer security , distributed computing , engineering , telecommunications , structural engineering , network packet , wireless
Mobile Ad hoc Network (MANET) is a particularly disputed network because of its particular features, for example, active topography, decentralization, as well as neighbor depend routing. In MANET, any mobile nodes can connect or disappear arbitrarily; thus, mobile nodes cannot awake which node is it joined with, and this creates resources been dealt between unknown nodes that can be trusted or not. As a result, without any trustworthiness makes the main susceptibility in security concerned aspects of the MANET. In this situation, trust value employs a vital function in all network performance. This paper introduces DempsterShafer theory and Encounter based Trust Routing (DETR) in a MANET. In this scheme, the direct trust and indirect trust is used to compute the mobile node trust. The node cooperation and encounter rate parameters measure the node direct trust in the network. The node indirect trust is computed based on the neighbour node opinion using DempsterShafer theory. Simulation results demonstrate that DETR detecting untrustable nodes in the network.