Efficient anonymity schemes for clustered wireless sensor networks

Satyajayant Misra, Guoliang Xue

Research output: Contribution to journalArticlepeer-review

64 Scopus citations


In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS), uses a range of pseudonyms as identifiers for a node to ensure concealment of its true identifier (ID). After deployment, neighbouring nodes share their individual pseudonyms and use them for anonymous communication. The second scheme Cryptographic Anonymity Scheme (CAS), uses a Keyed Cryptographic one way Hash Function (KCHF) for ID concealment. In CAS, neighbouring nodes securely share the information used by the KCHF to generate pseudonyms. Even when many nodes in a neighbourhood are compromised and are colluding, our schemes guarantee complete anonymity to non-compromised nodes during their mutual communication. Our schemes have reasonably low memory and computation costs. They can be embedded into any wireless sensor setwork routing protocol to ensure anonymity and privacy during node discovery, routing and data delivery.

Original languageEnglish (US)
Pages (from-to)50-63
Number of pages14
JournalInternational Journal of Sensor Networks
Issue number1-2
StatePublished - 2006


  • Anonymity
  • Authentication
  • Clustering
  • Confidentiality
  • Privacy
  • Pseudonym
  • Wireless Sensor Networks (WSNs)

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Efficient anonymity schemes for clustered wireless sensor networks'. Together they form a unique fingerprint.

Cite this