Trust in mobile Ad Hoc Networks

Securing a Wireless Ad Hoc Network is a major concern for researchers. Due to varied characteristics of Ad Hoc Networks, they are vulnerable to internal as well as external attacks. Many solutions have been proposed and currently being improved upon in this area. Most of these solutions involve encryption; secure routing, key management etc. Each of them is designed to operate in a particular situation, which may fail to work successfully in other scenarios. The present work in this paper offers an alternate to improve the trustworthiness of the neighbourhood and secure the routing procedure. It helps in computing the trust in neighbours and selecting the most secure route from the available ones for the data transfer. It also helps detecting the compromised node and virtually it removing from the network.

[1]  Songwu Lu,et al.  SCAN: self-organized network-layer security in mobile ad hoc networks , 2006, IEEE Journal on Selected Areas in Communications.

[2]  Hannu Kari,et al.  Distributing incomplete trust in wireless ad hoc networks , 2003, IEEE SoutheastCon, 2003. Proceedings..

[3]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[4]  Diego Gambetta.  Can We Trust Trust , 2000 .

[5]  Chris McDonald,et al.  Establishing Trust In Pure Ad-hoc Networks , 2004, ACSC.

[6]  Djamel Djenouri,et al.  A survey of security issues in mobile ad hoc and sensor networks , 2005, IEEE Communications Surveys & Tutorials.

[7]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.