Theoretical Analysis of Trust-based Routing Schemes for Wireless Sensor Networks

WSNs comprises of densely deployed tiny sensor devices deployed in sensitive applications. The security systems designed does not consider the constraints of sensor nodes. Trust of the network depends on packet forwarding behavior of the neighbor. The communication overhead depends on the number of packets transmitted for trust computation. The memory consumption depends on the size of the trust tables used for trust computation. In this paper, we have presented the communication overhead and memory consumption of the existing trust based routing schemes.