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

Shaikh, Riaz Ahmed ORCID: https://orcid.org/0000-0001-6666-0253 and Thayananthan, Vijey (2015) Hop-by-hop trust evaluation algorithm for identity anonymous sensor networks. IETE Journal of Research, 61 (2). pp. 154-159. ISSN 0377-2063

Full text not available from this repository. (Request a copy)


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.

Item Type: Article
Additional Information: Funding Information: This work was supported by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under grant no. (611-384-D1435). The authors, therefore, gratefully acknowledge the DSR technical and financial support. Publisher Copyright: © 2015 by the IETE.
Uncontrolled Keywords: anonymity,data quality,location verification,routing,sensor networks,time verification,trust evaluation,theoretical computer science,computer science applications,electrical and electronic engineering ,/dk/atira/pure/subjectarea/asjc/2600/2614
Faculty \ School: Faculty of Science > School of Computing Sciences
UEA Research Groups: Faculty of Science > Research Groups > Cyber Security Privacy and Trust Laboratory
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 16 Aug 2022 15:31
Last Modified: 07 May 2023 06:30
URI: https://ueaeprints.uea.ac.uk/id/eprint/87331
DOI: 10.1080/03772063.2014.988759

Actions (login required)

View Item View Item