Abstract

In wireless sensor networks, relay node placement has been proposed to improve energy efficiency. In this paper, we study two-tiered constrained relay node placement problems, where the relay nodes can be placed only at some prespecified candidate locations. To meet the connectivity requirement, we study the connected single-cover problem where each sensor node is covered by a base station or a relay node (to which the sensor node can transmit data), and the relay nodes form a connected network with the base stations. To meet the survivability requirement, we study the 2-connected double-cover problem where each sensor node is covered by two base stations or relay nodes, and the relay nodes form a 2-connected network with the base stations. We study these problems under the assumption that R ≥ 2r < 0, where R and r are the communication ranges of the relay nodes and the sensor nodes, respectively. We investigate the corresponding computational complexities, and propose novel polynomial time approximation algorithms for these problems. Specifically, for the connected single-cover problem, our algorithms have O(1)-approximation ratios. For the 2-connected double-cover problem, our algorithms have O (1)-approximation ratios for practical settings and O (n)-approximation ratios for arbitrary settings. Experimental results show that the number of relay nodes used by our algorithms is no more than twice of that used in an optimal solution.

Original languageEnglish (US)
Article number5887341
Pages (from-to)1399-1411
Number of pages13
JournalIEEE Transactions on Mobile Computing
Volume11
Issue number8
DOIs
StatePublished - Aug 2012

Fingerprint

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

Keywords

  • connectivity and survivability
  • Relay node placement
  • wireless sensor networks

ASJC Scopus subject areas

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

Cite this

Two-tiered constrained relay node placement in wireless sensor networks : Computational complexity and efficient approximations. / Yang, Dejun; Misra, Satyajayant; Fang, Xi; Xue, Guoliang; Zhang, Junshan.

In: IEEE Transactions on Mobile Computing, Vol. 11, No. 8, 5887341, 08.2012, p. 1399-1411.

Research output: Contribution to journalArticle

@article{39d62c07f2ef4c778b00c5dfed9b4483,
title = "Two-tiered constrained relay node placement in wireless sensor networks: Computational complexity and efficient approximations",
abstract = "In wireless sensor networks, relay node placement has been proposed to improve energy efficiency. In this paper, we study two-tiered constrained relay node placement problems, where the relay nodes can be placed only at some prespecified candidate locations. To meet the connectivity requirement, we study the connected single-cover problem where each sensor node is covered by a base station or a relay node (to which the sensor node can transmit data), and the relay nodes form a connected network with the base stations. To meet the survivability requirement, we study the 2-connected double-cover problem where each sensor node is covered by two base stations or relay nodes, and the relay nodes form a 2-connected network with the base stations. We study these problems under the assumption that R ≥ 2r < 0, where R and r are the communication ranges of the relay nodes and the sensor nodes, respectively. We investigate the corresponding computational complexities, and propose novel polynomial time approximation algorithms for these problems. Specifically, for the connected single-cover problem, our algorithms have O(1)-approximation ratios. For the 2-connected double-cover problem, our algorithms have O (1)-approximation ratios for practical settings and O (n)-approximation ratios for arbitrary settings. Experimental results show that the number of relay nodes used by our algorithms is no more than twice of that used in an optimal solution.",
keywords = "connectivity and survivability, Relay node placement, wireless sensor networks",
author = "Dejun Yang and Satyajayant Misra and Xi Fang and Guoliang Xue and Junshan Zhang",
year = "2012",
month = "8",
doi = "10.1109/TMC.2011.126",
language = "English (US)",
volume = "11",
pages = "1399--1411",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Two-tiered constrained relay node placement in wireless sensor networks

T2 - Computational complexity and efficient approximations

AU - Yang, Dejun

AU - Misra, Satyajayant

AU - Fang, Xi

AU - Xue, Guoliang

AU - Zhang, Junshan

PY - 2012/8

Y1 - 2012/8

N2 - In wireless sensor networks, relay node placement has been proposed to improve energy efficiency. In this paper, we study two-tiered constrained relay node placement problems, where the relay nodes can be placed only at some prespecified candidate locations. To meet the connectivity requirement, we study the connected single-cover problem where each sensor node is covered by a base station or a relay node (to which the sensor node can transmit data), and the relay nodes form a connected network with the base stations. To meet the survivability requirement, we study the 2-connected double-cover problem where each sensor node is covered by two base stations or relay nodes, and the relay nodes form a 2-connected network with the base stations. We study these problems under the assumption that R ≥ 2r < 0, where R and r are the communication ranges of the relay nodes and the sensor nodes, respectively. We investigate the corresponding computational complexities, and propose novel polynomial time approximation algorithms for these problems. Specifically, for the connected single-cover problem, our algorithms have O(1)-approximation ratios. For the 2-connected double-cover problem, our algorithms have O (1)-approximation ratios for practical settings and O (n)-approximation ratios for arbitrary settings. Experimental results show that the number of relay nodes used by our algorithms is no more than twice of that used in an optimal solution.

AB - In wireless sensor networks, relay node placement has been proposed to improve energy efficiency. In this paper, we study two-tiered constrained relay node placement problems, where the relay nodes can be placed only at some prespecified candidate locations. To meet the connectivity requirement, we study the connected single-cover problem where each sensor node is covered by a base station or a relay node (to which the sensor node can transmit data), and the relay nodes form a connected network with the base stations. To meet the survivability requirement, we study the 2-connected double-cover problem where each sensor node is covered by two base stations or relay nodes, and the relay nodes form a 2-connected network with the base stations. We study these problems under the assumption that R ≥ 2r < 0, where R and r are the communication ranges of the relay nodes and the sensor nodes, respectively. We investigate the corresponding computational complexities, and propose novel polynomial time approximation algorithms for these problems. Specifically, for the connected single-cover problem, our algorithms have O(1)-approximation ratios. For the 2-connected double-cover problem, our algorithms have O (1)-approximation ratios for practical settings and O (n)-approximation ratios for arbitrary settings. Experimental results show that the number of relay nodes used by our algorithms is no more than twice of that used in an optimal solution.

KW - connectivity and survivability

KW - Relay node placement

KW - wireless sensor networks

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

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

U2 - 10.1109/TMC.2011.126

DO - 10.1109/TMC.2011.126

M3 - Article

AN - SCOPUS:84863455619

VL - 11

SP - 1399

EP - 1411

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 8

M1 - 5887341

ER -