Author(s)

Shaik Sahil Babu, Arnab Raha, Mrinal Kanti Naskar

.

The traditional cryptographic security techniques are not sufficient for secure routing of message from source to destination in Wireless Sensor Networks (WSNs), because it requires sophisticated software, hardware, large memory, high processing speed and communication bandwidth. It is not economic and feasible because, depending on the application, WSN nodes are high-volume in number (hence, limited resources at each node), deployment area may be hazardous, unattended and/or hostile and sometimes dangerous. As WSNs are characterized by severely constrained resources and requirement to operate in an ad-hoc manner, security functionality implementation to protect nodes from adversary forces and secure routing of message from source node to base station has become a challenging task. In this paper, we present a direct trust dependent link state routing using route trusts which protects WSNs against routing attacks by eliminating the un-trusted nodes before making routes and finding best trustworthy route among them. We compare our work with the most prevalent routing protocols and show its benefits over them.

Wireless Sensor Network (WSN), Geometric Mean (GM), Direct Trust, Indirect Trust, Route Trust (RT), Base Station (BS), Benevolent Node, Malicious Node, Homogeneous Nodes, Packet Latency, Packet Transmission Rate, MATLAB

S. Babu, A. Raha and M. Naskar, "A Direct Trust dependent Link State Routing Protocol Using Route Trusts for WSNs (DTLSRP)," Wireless Sensor Network, Vol. 3 No. 4, 2011, pp. 125-134. doi: 10.4236/wsn.2011.34015.