Relay node placement in large scale wireless sensor networks

Jian Tang, Bin Hao, Arunabha Sen

Research output: Contribution to journalArticle

271 Citations (Scopus)

Abstract

Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose. This is a cluster-based network model composed of relay and sensor nodes. Relay nodes are placed in the playing field to serve as cluster heads and to form a connected network topology for information dissemination at the higher tier. The relay nodes are capable of aggregating data packets from the sensor nodes in their clusters and transmitting them to the sink node via wireless multi-hop paths. In this paper, we study the relay node placement problem in large scale wireless sensor networks. Our objective is to place the fewest number of relay nodes in the playing field of a sensor network such that (1) each sensor node can communicate with at least one relay node and (2) the network of relay nodes is connected. However, placement strategies realizing goals (1) and (2) do not provide any fault-tolerance as the network may lose functionality after failure of some of the relay nodes. In order to incorporate fault-tolerance in such a network, we ensure that every sensor node is able to communicate with at least two relay nodes and the induced network topology is 2-connected. This strategy will ensure survivability of the network in the event of single fault, in lieu of higher relay node placement cost. We formulate the relay node placement in wireless sensor networks as two optimization problems: (i) Connected Relay Node Single Cover (CRNSC) problem and (ii) 2-Connected Relay Node Double Cover (2CRNDC) problem. We present two polynomial time approximation algorithms to solve the CRNSC problem. We prove that the ratio of the number of relay nodes needed by the approximation algorithm to the number of relay nodes needed by the optimal algorithm is bounded by 8 for the first algorithm and 4.5 for the second. In addition, for the 2CRNDC problem we provide two approximation algorithms with performance bounds 6 and 4.5, respectively.

Original languageEnglish (US)
Pages (from-to)490-501
Number of pages12
JournalComputer Communications
Volume29
Issue number4
DOIs
StatePublished - Feb 20 2006

Fingerprint

Sensor nodes
Wireless sensor networks
Approximation algorithms
Fault tolerance
Topology
Information dissemination
Sensor networks
Scalability
Polynomials
Costs

Keywords

  • Fault-tolerance
  • Relay node placement
  • Wireless sensor network

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Relay node placement in large scale wireless sensor networks. / Tang, Jian; Hao, Bin; Sen, Arunabha.

In: Computer Communications, Vol. 29, No. 4, 20.02.2006, p. 490-501.

Research output: Contribution to journalArticle

Tang, Jian ; Hao, Bin ; Sen, Arunabha. / Relay node placement in large scale wireless sensor networks. In: Computer Communications. 2006 ; Vol. 29, No. 4. pp. 490-501.
@article{8739ba21860b4d888df7b472ffb60ab8,
title = "Relay node placement in large scale wireless sensor networks",
abstract = "Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose. This is a cluster-based network model composed of relay and sensor nodes. Relay nodes are placed in the playing field to serve as cluster heads and to form a connected network topology for information dissemination at the higher tier. The relay nodes are capable of aggregating data packets from the sensor nodes in their clusters and transmitting them to the sink node via wireless multi-hop paths. In this paper, we study the relay node placement problem in large scale wireless sensor networks. Our objective is to place the fewest number of relay nodes in the playing field of a sensor network such that (1) each sensor node can communicate with at least one relay node and (2) the network of relay nodes is connected. However, placement strategies realizing goals (1) and (2) do not provide any fault-tolerance as the network may lose functionality after failure of some of the relay nodes. In order to incorporate fault-tolerance in such a network, we ensure that every sensor node is able to communicate with at least two relay nodes and the induced network topology is 2-connected. This strategy will ensure survivability of the network in the event of single fault, in lieu of higher relay node placement cost. We formulate the relay node placement in wireless sensor networks as two optimization problems: (i) Connected Relay Node Single Cover (CRNSC) problem and (ii) 2-Connected Relay Node Double Cover (2CRNDC) problem. We present two polynomial time approximation algorithms to solve the CRNSC problem. We prove that the ratio of the number of relay nodes needed by the approximation algorithm to the number of relay nodes needed by the optimal algorithm is bounded by 8 for the first algorithm and 4.5 for the second. In addition, for the 2CRNDC problem we provide two approximation algorithms with performance bounds 6 and 4.5, respectively.",
keywords = "Fault-tolerance, Relay node placement, Wireless sensor network",
author = "Jian Tang and Bin Hao and Arunabha Sen",
year = "2006",
month = "2",
day = "20",
doi = "10.1016/j.comcom.2004.12.032",
language = "English (US)",
volume = "29",
pages = "490--501",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Relay node placement in large scale wireless sensor networks

AU - Tang, Jian

AU - Hao, Bin

AU - Sen, Arunabha

PY - 2006/2/20

Y1 - 2006/2/20

N2 - Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose. This is a cluster-based network model composed of relay and sensor nodes. Relay nodes are placed in the playing field to serve as cluster heads and to form a connected network topology for information dissemination at the higher tier. The relay nodes are capable of aggregating data packets from the sensor nodes in their clusters and transmitting them to the sink node via wireless multi-hop paths. In this paper, we study the relay node placement problem in large scale wireless sensor networks. Our objective is to place the fewest number of relay nodes in the playing field of a sensor network such that (1) each sensor node can communicate with at least one relay node and (2) the network of relay nodes is connected. However, placement strategies realizing goals (1) and (2) do not provide any fault-tolerance as the network may lose functionality after failure of some of the relay nodes. In order to incorporate fault-tolerance in such a network, we ensure that every sensor node is able to communicate with at least two relay nodes and the induced network topology is 2-connected. This strategy will ensure survivability of the network in the event of single fault, in lieu of higher relay node placement cost. We formulate the relay node placement in wireless sensor networks as two optimization problems: (i) Connected Relay Node Single Cover (CRNSC) problem and (ii) 2-Connected Relay Node Double Cover (2CRNDC) problem. We present two polynomial time approximation algorithms to solve the CRNSC problem. We prove that the ratio of the number of relay nodes needed by the approximation algorithm to the number of relay nodes needed by the optimal algorithm is bounded by 8 for the first algorithm and 4.5 for the second. In addition, for the 2CRNDC problem we provide two approximation algorithms with performance bounds 6 and 4.5, respectively.

AB - Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose. This is a cluster-based network model composed of relay and sensor nodes. Relay nodes are placed in the playing field to serve as cluster heads and to form a connected network topology for information dissemination at the higher tier. The relay nodes are capable of aggregating data packets from the sensor nodes in their clusters and transmitting them to the sink node via wireless multi-hop paths. In this paper, we study the relay node placement problem in large scale wireless sensor networks. Our objective is to place the fewest number of relay nodes in the playing field of a sensor network such that (1) each sensor node can communicate with at least one relay node and (2) the network of relay nodes is connected. However, placement strategies realizing goals (1) and (2) do not provide any fault-tolerance as the network may lose functionality after failure of some of the relay nodes. In order to incorporate fault-tolerance in such a network, we ensure that every sensor node is able to communicate with at least two relay nodes and the induced network topology is 2-connected. This strategy will ensure survivability of the network in the event of single fault, in lieu of higher relay node placement cost. We formulate the relay node placement in wireless sensor networks as two optimization problems: (i) Connected Relay Node Single Cover (CRNSC) problem and (ii) 2-Connected Relay Node Double Cover (2CRNDC) problem. We present two polynomial time approximation algorithms to solve the CRNSC problem. We prove that the ratio of the number of relay nodes needed by the approximation algorithm to the number of relay nodes needed by the optimal algorithm is bounded by 8 for the first algorithm and 4.5 for the second. In addition, for the 2CRNDC problem we provide two approximation algorithms with performance bounds 6 and 4.5, respectively.

KW - Fault-tolerance

KW - Relay node placement

KW - Wireless sensor network

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

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

U2 - 10.1016/j.comcom.2004.12.032

DO - 10.1016/j.comcom.2004.12.032

M3 - Article

AN - SCOPUS:32644439091

VL - 29

SP - 490

EP - 501

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 4

ER -