Budget constrained relay node placement problem for maximal 'connectedness'

Anisha Mazumder, Chenyang Zhou, Arun Das, Arunabha Sen

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

1 Citation (Scopus)

Abstract

The relay node placement problem in the wireless sensor network have been studied extensively in the last few years. The goal of most of these problems is to place the fewest number of relay nodes in the deployment area so that the network formed by the sensors nodes and the relay nodes is connected. Most of these studies are conducted for the unconstrained budget scenario, in the sense that there is an underlying assumption that no matter however many relay nodes are needed to make the network connected, they can be procured and deployed. However, in a fixed budget scenario, the expenses involved in procuring the minimum number of relay nodes to make the network connected may exceed the budget. Although in this scenario, one has to give up the idea of having a network connecting all the sensor nodes, one would still like to have a network with high level of 'connectedness'. In the paper we introduce two metrics for measuring 'connectedness' of a disconnected graph and study the problem whose goal is to design a network with maximal 'connectedness', subject to a fixed budget constraint. We show that both versions of the problem are NP-complete and provide heuristics for their solution. We show that the problem is non-trivial even when the number of sensor nodes is as few as three. We evaluate the performance of heuristics through simulation.

Original languageEnglish (US)
Title of host publicationMILCOM 2016 - 2016 IEEE Military Communications Conference
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages849-854
Number of pages6
ISBN (Electronic)9781509037810
DOIs
StatePublished - Dec 22 2016
Event35th IEEE Military Communications Conference, MILCOM 2016 - Baltimore, United States
Duration: Nov 1 2016Nov 3 2016

Other

Other35th IEEE Military Communications Conference, MILCOM 2016
CountryUnited States
CityBaltimore
Period11/1/1611/3/16

Fingerprint

Sensor nodes
Wireless sensor networks
Computational complexity

Keywords

  • Approximation algorithms
  • Measurement
  • Protocols
  • Relays
  • Sensors
  • Steiner trees
  • Wireless sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Mazumder, A., Zhou, C., Das, A., & Sen, A. (2016). Budget constrained relay node placement problem for maximal 'connectedness'. In MILCOM 2016 - 2016 IEEE Military Communications Conference (pp. 849-854). [7795435] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/MILCOM.2016.7795435

Budget constrained relay node placement problem for maximal 'connectedness'. / Mazumder, Anisha; Zhou, Chenyang; Das, Arun; Sen, Arunabha.

MILCOM 2016 - 2016 IEEE Military Communications Conference. Institute of Electrical and Electronics Engineers Inc., 2016. p. 849-854 7795435.

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

Mazumder, A, Zhou, C, Das, A & Sen, A 2016, Budget constrained relay node placement problem for maximal 'connectedness'. in MILCOM 2016 - 2016 IEEE Military Communications Conference., 7795435, Institute of Electrical and Electronics Engineers Inc., pp. 849-854, 35th IEEE Military Communications Conference, MILCOM 2016, Baltimore, United States, 11/1/16. https://doi.org/10.1109/MILCOM.2016.7795435
Mazumder A, Zhou C, Das A, Sen A. Budget constrained relay node placement problem for maximal 'connectedness'. In MILCOM 2016 - 2016 IEEE Military Communications Conference. Institute of Electrical and Electronics Engineers Inc. 2016. p. 849-854. 7795435 https://doi.org/10.1109/MILCOM.2016.7795435
Mazumder, Anisha ; Zhou, Chenyang ; Das, Arun ; Sen, Arunabha. / Budget constrained relay node placement problem for maximal 'connectedness'. MILCOM 2016 - 2016 IEEE Military Communications Conference. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 849-854
@inproceedings{8cfef907f35040cbac7d0a7fe9653937,
title = "Budget constrained relay node placement problem for maximal 'connectedness'",
abstract = "The relay node placement problem in the wireless sensor network have been studied extensively in the last few years. The goal of most of these problems is to place the fewest number of relay nodes in the deployment area so that the network formed by the sensors nodes and the relay nodes is connected. Most of these studies are conducted for the unconstrained budget scenario, in the sense that there is an underlying assumption that no matter however many relay nodes are needed to make the network connected, they can be procured and deployed. However, in a fixed budget scenario, the expenses involved in procuring the minimum number of relay nodes to make the network connected may exceed the budget. Although in this scenario, one has to give up the idea of having a network connecting all the sensor nodes, one would still like to have a network with high level of 'connectedness'. In the paper we introduce two metrics for measuring 'connectedness' of a disconnected graph and study the problem whose goal is to design a network with maximal 'connectedness', subject to a fixed budget constraint. We show that both versions of the problem are NP-complete and provide heuristics for their solution. We show that the problem is non-trivial even when the number of sensor nodes is as few as three. We evaluate the performance of heuristics through simulation.",
keywords = "Approximation algorithms, Measurement, Protocols, Relays, Sensors, Steiner trees, Wireless sensor networks",
author = "Anisha Mazumder and Chenyang Zhou and Arun Das and Arunabha Sen",
year = "2016",
month = "12",
day = "22",
doi = "10.1109/MILCOM.2016.7795435",
language = "English (US)",
pages = "849--854",
booktitle = "MILCOM 2016 - 2016 IEEE Military Communications Conference",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Budget constrained relay node placement problem for maximal 'connectedness'

AU - Mazumder, Anisha

AU - Zhou, Chenyang

AU - Das, Arun

AU - Sen, Arunabha

PY - 2016/12/22

Y1 - 2016/12/22

N2 - The relay node placement problem in the wireless sensor network have been studied extensively in the last few years. The goal of most of these problems is to place the fewest number of relay nodes in the deployment area so that the network formed by the sensors nodes and the relay nodes is connected. Most of these studies are conducted for the unconstrained budget scenario, in the sense that there is an underlying assumption that no matter however many relay nodes are needed to make the network connected, they can be procured and deployed. However, in a fixed budget scenario, the expenses involved in procuring the minimum number of relay nodes to make the network connected may exceed the budget. Although in this scenario, one has to give up the idea of having a network connecting all the sensor nodes, one would still like to have a network with high level of 'connectedness'. In the paper we introduce two metrics for measuring 'connectedness' of a disconnected graph and study the problem whose goal is to design a network with maximal 'connectedness', subject to a fixed budget constraint. We show that both versions of the problem are NP-complete and provide heuristics for their solution. We show that the problem is non-trivial even when the number of sensor nodes is as few as three. We evaluate the performance of heuristics through simulation.

AB - The relay node placement problem in the wireless sensor network have been studied extensively in the last few years. The goal of most of these problems is to place the fewest number of relay nodes in the deployment area so that the network formed by the sensors nodes and the relay nodes is connected. Most of these studies are conducted for the unconstrained budget scenario, in the sense that there is an underlying assumption that no matter however many relay nodes are needed to make the network connected, they can be procured and deployed. However, in a fixed budget scenario, the expenses involved in procuring the minimum number of relay nodes to make the network connected may exceed the budget. Although in this scenario, one has to give up the idea of having a network connecting all the sensor nodes, one would still like to have a network with high level of 'connectedness'. In the paper we introduce two metrics for measuring 'connectedness' of a disconnected graph and study the problem whose goal is to design a network with maximal 'connectedness', subject to a fixed budget constraint. We show that both versions of the problem are NP-complete and provide heuristics for their solution. We show that the problem is non-trivial even when the number of sensor nodes is as few as three. We evaluate the performance of heuristics through simulation.

KW - Approximation algorithms

KW - Measurement

KW - Protocols

KW - Relays

KW - Sensors

KW - Steiner trees

KW - Wireless sensor networks

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

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

U2 - 10.1109/MILCOM.2016.7795435

DO - 10.1109/MILCOM.2016.7795435

M3 - Conference contribution

AN - SCOPUS:85011876397

SP - 849

EP - 854

BT - MILCOM 2016 - 2016 IEEE Military Communications Conference

PB - Institute of Electrical and Electronics Engineers Inc.

ER -