VP3: Using Vertex Path and Power Proximity for Energy Efficient Key Distribution

Abstract

This paper investigates the problem of energy-efficient key distribution for securing multicast communications in wireless ad hoc networks. Recently, the authors showed that a cross-layer design approach for key distribution, incorporating network layer (routing) as well as physical layer (energy) parameters, leads to energy savings. They also showed that heuristics are needed to reduce computational complexity. In this paper, the authors show that further reduction in energy expenditure is achieved by assigning common keys to nodes that receive messages from a sender via a common path. They develop a computationally viable heuristic called VP3 that uses codewords to represent paths and groups nodes based on the length of the common path, derived by the Hamming distance between codewords. They also present simulation results to illustrate the improvements achieved by VP3.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2004
Accession Number
ADA459886

Entities

People

  • Javier Salido
  • Loukas Lazos
  • Radha Poovendran

Organizations

  • University of Washington

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Ad Hoc Networks
  • Algorithms
  • Computational Complexity
  • Computer Network Security
  • Cryptography
  • Efficiency
  • Energy Conservation
  • Energy Consumption
  • Energy Efficiency
  • Information Operations
  • Mesh Networks
  • Military Research
  • Network Topology
  • Networks
  • Organizational Structure
  • Simulations

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Computer Programming and Software Development.
  • Operations Research