Data Integrity Protocol for Sensor Networks

Arjan Durresi, Vamsi Paruchuri, Rajgopal Kannan and S.S. Iyengar

International Journal of Distributed Sensor Networks, 2005, vol. 1, issue 2, 205-214

Abstract: In this paper, we present a novel lightweight protocol for data integrity in wireless sensor networks. Our protocol is based on a leapfrog strategy in which each cluster head verifies if its previous node has preserved the integrity of the packet using the secret key it shares with two hop uptree nodes. The proposed protocol is simple. The analysis and simulation results show that the protocol needs very few header bits, as low as three bits, thus resulting in negligible bandwidth overhead; the protocol poses very low computational overhead, it needs to compute just a hash as compared to multiple complex operations required by any cryptographic implementation for verifying authenticity.

Keywords: Data integrity; security; sensor networks (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1080/15501320590966459 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:1:y:2005:i:2:p:205-214

DOI: 10.1080/15501320590966459

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().