TY - JOUR
T1 - Incorporating Trust and Reputation in the DSR Protocol for Dependable Routing
AU - Pirzada, Asad
AU - Datta, Amitava
AU - Mcdonald, Chris
PY - 2006
Y1 - 2006
N2 - An ad hoc network is formed when two or more wireless nodes agree to forward packets on behalf of each other. As the wireless range of such nodes is severely limited, the nodes mutually cooperate with their neighbours in order to extend the overall communication range of the network. Dynamic source routing (DSR) is one of the commonly used protocols used in establishing ad hoc networks. The network keeps on functioning smoothly when each node executes the routing protocol in the correct manner. However, along with benevolent nodes, there may always be some malicious and selfish nodes present in the network that try to disrupt, distort or disturb the network traffic. In this paper, we propose a novel and pragmatic scheme for establishing and sustaining trustworthy routes in the network. Each node maintains trust levels for its immediate neighbours based upon their current actions. Nodes also share these trust levels (reputations) to get ancillary information about other nodes in the network. To minimise control packet overhead, we have integrated the trust sharing mechanism with the DSR route discovery process in a unique manner that augments the protocol's performance in the presence of malicious nodes. (c) 2005 Elsevier B.V. All rights reserved.
AB - An ad hoc network is formed when two or more wireless nodes agree to forward packets on behalf of each other. As the wireless range of such nodes is severely limited, the nodes mutually cooperate with their neighbours in order to extend the overall communication range of the network. Dynamic source routing (DSR) is one of the commonly used protocols used in establishing ad hoc networks. The network keeps on functioning smoothly when each node executes the routing protocol in the correct manner. However, along with benevolent nodes, there may always be some malicious and selfish nodes present in the network that try to disrupt, distort or disturb the network traffic. In this paper, we propose a novel and pragmatic scheme for establishing and sustaining trustworthy routes in the network. Each node maintains trust levels for its immediate neighbours based upon their current actions. Nodes also share these trust levels (reputations) to get ancillary information about other nodes in the network. To minimise control packet overhead, we have integrated the trust sharing mechanism with the DSR route discovery process in a unique manner that augments the protocol's performance in the presence of malicious nodes. (c) 2005 Elsevier B.V. All rights reserved.
U2 - 10.1016/j.comcom.2005.10.032
DO - 10.1016/j.comcom.2005.10.032
M3 - Article
SN - 0140-3664
VL - 29
SP - 2806
EP - 2821
JO - Computer Communications
JF - Computer Communications
IS - 15
ER -