Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements

Satyajayant Misra, Seung Don Hong, Guoliang Xue, Jian Tang

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

95 Citations (Scopus)

Abstract

The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectivity and survivability requirements. In this paper, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a subset of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure the connectivity of the sensor nodes and the base stations. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure the biconnectivity of the sensor nodes and the base stations. For each of the two problems, we discuss its computational complexity, and present a framework of polynomial time script O sign (1)-approximation algorithms with small approximation ratios.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages879-887
Number of pages9
DOIs
StatePublished - 2008
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: Apr 13 2008Apr 18 2008

Other

OtherINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
CountryUnited States
CityPhoenix, AZ
Period4/13/084/18/08

Fingerprint

Sensor nodes
Base stations
Wireless sensor networks
Approximation algorithms
Computational complexity
Polynomials

Keywords

  • Relay node placement
  • Wireless sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements. / Misra, Satyajayant; Hong, Seung Don; Xue, Guoliang; Tang, Jian.

Proceedings - IEEE INFOCOM. 2008. p. 879-887 4509660.

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

Misra, S, Hong, SD, Xue, G & Tang, J 2008, Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements. in Proceedings - IEEE INFOCOM., 4509660, pp. 879-887, INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications, Phoenix, AZ, United States, 4/13/08. https://doi.org/10.1109/INFOCOM.2007.65
Misra, Satyajayant ; Hong, Seung Don ; Xue, Guoliang ; Tang, Jian. / Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements. Proceedings - IEEE INFOCOM. 2008. pp. 879-887
@inproceedings{8b9db0fc381c42ebb56e7f61167ec4bf,
title = "Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements",
abstract = "The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectivity and survivability requirements. In this paper, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a subset of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure the connectivity of the sensor nodes and the base stations. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure the biconnectivity of the sensor nodes and the base stations. For each of the two problems, we discuss its computational complexity, and present a framework of polynomial time script O sign (1)-approximation algorithms with small approximation ratios.",
keywords = "Relay node placement, Wireless sensor networks",
author = "Satyajayant Misra and Hong, {Seung Don} and Guoliang Xue and Jian Tang",
year = "2008",
doi = "10.1109/INFOCOM.2007.65",
language = "English (US)",
isbn = "9781424420261",
pages = "879--887",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements

AU - Misra, Satyajayant

AU - Hong, Seung Don

AU - Xue, Guoliang

AU - Tang, Jian

PY - 2008

Y1 - 2008

N2 - The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectivity and survivability requirements. In this paper, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a subset of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure the connectivity of the sensor nodes and the base stations. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure the biconnectivity of the sensor nodes and the base stations. For each of the two problems, we discuss its computational complexity, and present a framework of polynomial time script O sign (1)-approximation algorithms with small approximation ratios.

AB - The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectivity and survivability requirements. In this paper, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a subset of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure the connectivity of the sensor nodes and the base stations. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure the biconnectivity of the sensor nodes and the base stations. For each of the two problems, we discuss its computational complexity, and present a framework of polynomial time script O sign (1)-approximation algorithms with small approximation ratios.

KW - Relay node placement

KW - Wireless sensor networks

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

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

U2 - 10.1109/INFOCOM.2007.65

DO - 10.1109/INFOCOM.2007.65

M3 - Conference contribution

SN - 9781424420261

SP - 879

EP - 887

BT - Proceedings - IEEE INFOCOM

ER -