Hop-by-hop trust evaluation algorithm for identity anonymous sensor networks

Most of the existing trust models that are proposed for wireless sensor networks are based on the assumption that the sensor nodes have unique identities. Evaluating trust in an identity anonymous resource constraint environment is an open research problem. In this work, we propose a first novel hop-by-hop trust evaluation algorithm (H-TEA) that operates in the identity anonymous wireless sensor network environment. Simulation results show that the H-TEA scheme reduces communication overhead and energy consumption of sensor nodes at the cost of increased delay in the network. That makes it suitable to use for non-time-critical applications.