Dempstershafer Theory and Encounter Based Trust Routing in Mobile Ad Hoc Network
S.G. Rameshkumar
S.G. Rameshkumar is working as Assistant Professor in the Department of Electrical Engineering at FEAT, Annamalai University, Chidambaram. Tamilnadu, India. 

Manuscript received on January 01, 2020. | Revised Manuscript received on January 20, 2020. | Manuscript published on January 30, 2020. | PP: 2945-2947 | Volume-8 Issue-5, January 2020. | Retrieval Number: E3113018520/2020©BEIESP | DOI: 10.35940/ijrte.E3113.018520

Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: 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 Dempster Shafer 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 Dempster Shafer theory. Simulation results demonstrate that DETR detecting untrustable nodes in the network.
Keywords: Dempster Shafer theory, Direct Trust, Encounter Rate, Indirect Trust, MANET.
Scope of the Article: Security, Trust and Privacy.