Abstract
ABSTRACTMost 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
