Energy and bandwidth-efficient key distribution in wireless Ad Hoc networks: A cross-layer approach

Javier Salido, Loukas Lazos, Radha Poovendran

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


We address the problem of resource-efficient access control for group communications in wireless ad hoc networks. Restricting the access to group data can be reduced to the problem of securely distributing cryptographic keys to group members, known as the key distribution problem (KDP). We examine the KDP under four metrics: (a) member key storage, (b) group controller (GC) transmissions, (c) multicast group (MG) update messages, and (d) average update energy. For each metric, we formulate an optimization problem and show that the KDP has unique solutions for metrics (a) and (b), while is NP-complete for (c) and (d). We propose a cross-layer heuristic algorithm called VP3 that bounds member key storage, and GC transmissions, while significantly reducing the energy and bandwidth consumption of the network. We define the notion of path divergence as a measure of bandwidth efficiency of multicasting, and establish an analytical worst-case bound for it. Finally, we propose On-line VP3, which dynamically updates the key assignment structure according to the dynamics of the communication group in a resource-efficient way.

Original languageEnglish (US)
Pages (from-to)1527-1540
Number of pages14
JournalIEEE/ACM Transactions on Networking
Issue number6
StatePublished - Dec 2007


  • Access control
  • Ad hoc
  • Ad hoc networks
  • Energy conservation
  • Key distribution
  • Key management
  • Multicast communication
  • Secure group communication
  • Security

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Energy and bandwidth-efficient key distribution in wireless Ad Hoc networks: A cross-layer approach'. Together they form a unique fingerprint.

Cite this