VP3: Using vertex path and power proximity for energy efficient key distribution

Loukas Lazos, Javier Salido, Radha Poovendran

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We study the problem of energy-efficient key distribution for securing multicast communications in wireless ad hoc networks. Recently, we 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. We also showed that heuristics are needed to reduce the computational complexity. In this paper we show that further reduction in energy expenditure is achieved by assigning common keys to nodes the receive messages from a sender via a common path. We 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. We also present simulation results to illustrate the improvements achieved by VP3.

Original languageEnglish (US)
Title of host publicationIEEE Vehicular Technology Conference
Pages1228-1232
Number of pages5
Volume60
Edition2
StatePublished - 2004
Externally publishedYes
Event2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security - Los Angeles, CA, United States
Duration: Sep 26 2004Sep 29 2004

Other

Other2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security
CountryUnited States
CityLos Angeles, CA
Period9/26/049/29/04

Fingerprint

Hamming distance
Network layers
Wireless ad hoc networks
Electric power distribution
Computational complexity
Energy conservation
Communication
Energy Metabolism

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Lazos, L., Salido, J., & Poovendran, R. (2004). VP3: Using vertex path and power proximity for energy efficient key distribution. In IEEE Vehicular Technology Conference (2 ed., Vol. 60, pp. 1228-1232)

VP3 : Using vertex path and power proximity for energy efficient key distribution. / Lazos, Loukas; Salido, Javier; Poovendran, Radha.

IEEE Vehicular Technology Conference. Vol. 60 2. ed. 2004. p. 1228-1232.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lazos, L, Salido, J & Poovendran, R 2004, VP3: Using vertex path and power proximity for energy efficient key distribution. in IEEE Vehicular Technology Conference. 2 edn, vol. 60, pp. 1228-1232, 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security, Los Angeles, CA, United States, 9/26/04.
Lazos L, Salido J, Poovendran R. VP3: Using vertex path and power proximity for energy efficient key distribution. In IEEE Vehicular Technology Conference. 2 ed. Vol. 60. 2004. p. 1228-1232
Lazos, Loukas ; Salido, Javier ; Poovendran, Radha. / VP3 : Using vertex path and power proximity for energy efficient key distribution. IEEE Vehicular Technology Conference. Vol. 60 2. ed. 2004. pp. 1228-1232
@inproceedings{41ff7d6fa63a49cf92b3cb6bc54672e9,
title = "VP3: Using vertex path and power proximity for energy efficient key distribution",
abstract = "We study the problem of energy-efficient key distribution for securing multicast communications in wireless ad hoc networks. Recently, we 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. We also showed that heuristics are needed to reduce the computational complexity. In this paper we show that further reduction in energy expenditure is achieved by assigning common keys to nodes the receive messages from a sender via a common path. We 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. We also present simulation results to illustrate the improvements achieved by VP3.",
author = "Loukas Lazos and Javier Salido and Radha Poovendran",
year = "2004",
language = "English (US)",
volume = "60",
pages = "1228--1232",
booktitle = "IEEE Vehicular Technology Conference",
edition = "2",

}

TY - GEN

T1 - VP3

T2 - Using vertex path and power proximity for energy efficient key distribution

AU - Lazos, Loukas

AU - Salido, Javier

AU - Poovendran, Radha

PY - 2004

Y1 - 2004

N2 - We study the problem of energy-efficient key distribution for securing multicast communications in wireless ad hoc networks. Recently, we 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. We also showed that heuristics are needed to reduce the computational complexity. In this paper we show that further reduction in energy expenditure is achieved by assigning common keys to nodes the receive messages from a sender via a common path. We 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. We also present simulation results to illustrate the improvements achieved by VP3.

AB - We study the problem of energy-efficient key distribution for securing multicast communications in wireless ad hoc networks. Recently, we 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. We also showed that heuristics are needed to reduce the computational complexity. In this paper we show that further reduction in energy expenditure is achieved by assigning common keys to nodes the receive messages from a sender via a common path. We 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. We also present simulation results to illustrate the improvements achieved by VP3.

UR - http://www.scopus.com/inward/record.url?scp=17144418536&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17144418536&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:17144418536

VL - 60

SP - 1228

EP - 1232

BT - IEEE Vehicular Technology Conference

ER -