Constrained relay node placement in wireless sensor networks

Formulation and approximations

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

Research output: Contribution to journalArticle

126 Citations (Scopus)

Abstract

One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stations. 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 or survivability requirements. Previous studies have concentrated on the unconstrained version of the problem in the sense that relay nodes can be placed anywhere. In practice, there may be some physical constraints on the placement of relay nodes. To address this issue, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a set of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with a base station through a bidirectional path. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with two base stations (or the only base station in case there is only one base station) through two node-disjoint bidirectional paths. For each of the two problems, we discuss its computational complexity and present a framework of polynomial time O(1)-approximation algorithms with small approximation ratios. Extensive numerical results show that our approximation algorithms can produce solutions very close to optimal solutions.

Original languageEnglish (US)
Article number5340573
Pages (from-to)434-447
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume18
Issue number2
DOIs
StatePublished - Apr 2010

Fingerprint

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

Keywords

  • Approximation algorithms
  • Connectivity and survivability
  • Relay node placement
  • Wireless sensor networks (WSNs)

ASJC Scopus subject areas

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

Cite this

Constrained relay node placement in wireless sensor networks : Formulation and approximations. / Misra, Satyajayant; Hong, Seung Don; Xue, Guoliang; Tang, Jian.

In: IEEE/ACM Transactions on Networking, Vol. 18, No. 2, 5340573, 04.2010, p. 434-447.

Research output: Contribution to journalArticle

Misra, Satyajayant ; Hong, Seung Don ; Xue, Guoliang ; Tang, Jian. / Constrained relay node placement in wireless sensor networks : Formulation and approximations. In: IEEE/ACM Transactions on Networking. 2010 ; Vol. 18, No. 2. pp. 434-447.
@article{85ced4e7d9b84b8290e4dd6cbc534a50,
title = "Constrained relay node placement in wireless sensor networks: Formulation and approximations",
abstract = "One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stations. 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 or survivability requirements. Previous studies have concentrated on the unconstrained version of the problem in the sense that relay nodes can be placed anywhere. In practice, there may be some physical constraints on the placement of relay nodes. To address this issue, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a set of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with a base station through a bidirectional path. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with two base stations (or the only base station in case there is only one base station) through two node-disjoint bidirectional paths. For each of the two problems, we discuss its computational complexity and present a framework of polynomial time O(1)-approximation algorithms with small approximation ratios. Extensive numerical results show that our approximation algorithms can produce solutions very close to optimal solutions.",
keywords = "Approximation algorithms, Connectivity and survivability, Relay node placement, Wireless sensor networks (WSNs)",
author = "Satyajayant Misra and Hong, {Seung Don} and Guoliang Xue and Jian Tang",
year = "2010",
month = "4",
doi = "10.1109/TNET.2009.2033273",
language = "English (US)",
volume = "18",
pages = "434--447",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Constrained relay node placement in wireless sensor networks

T2 - Formulation and approximations

AU - Misra, Satyajayant

AU - Hong, Seung Don

AU - Xue, Guoliang

AU - Tang, Jian

PY - 2010/4

Y1 - 2010/4

N2 - One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stations. 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 or survivability requirements. Previous studies have concentrated on the unconstrained version of the problem in the sense that relay nodes can be placed anywhere. In practice, there may be some physical constraints on the placement of relay nodes. To address this issue, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a set of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with a base station through a bidirectional path. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with two base stations (or the only base station in case there is only one base station) through two node-disjoint bidirectional paths. For each of the two problems, we discuss its computational complexity and present a framework of polynomial time O(1)-approximation algorithms with small approximation ratios. Extensive numerical results show that our approximation algorithms can produce solutions very close to optimal solutions.

AB - One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stations. 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 or survivability requirements. Previous studies have concentrated on the unconstrained version of the problem in the sense that relay nodes can be placed anywhere. In practice, there may be some physical constraints on the placement of relay nodes. To address this issue, we study constrained versions of the relay node placement problem, where relay nodes can only be placed at a set of candidate locations. In the connected relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with a base station through a bidirectional path. In the survivable relay node placement problem, we want to place a minimum number of relay nodes to ensure that each sensor node is connected with two base stations (or the only base station in case there is only one base station) through two node-disjoint bidirectional paths. For each of the two problems, we discuss its computational complexity and present a framework of polynomial time O(1)-approximation algorithms with small approximation ratios. Extensive numerical results show that our approximation algorithms can produce solutions very close to optimal solutions.

KW - Approximation algorithms

KW - Connectivity and survivability

KW - Relay node placement

KW - Wireless sensor networks (WSNs)

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

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

U2 - 10.1109/TNET.2009.2033273

DO - 10.1109/TNET.2009.2033273

M3 - Article

VL - 18

SP - 434

EP - 447

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 2

M1 - 5340573

ER -