Relay node placement under budget constraint

Chenyang Zhou, Anisha Mazumder, Arun Das, Kaustav Basu, Navid Matin-Moghaddam, Saharnaz Mehrani, Arunabha Sen

Research output: Contribution to journalArticle

Abstract

The relay node placement problem in the wireless sensor network domain has been studied extensively. But under a fixed budget, it may be impossible to procure the minimum number of relay nodes needed to design a connected network of sensor and relay nodes. Nevertheless, one would still like to design a network with high level of connectedness, or low disconnectedness. In this paper, we introduce the notion of a measure of the “connectedness” of a disconnected graph. We study a family of problems whose goal is to design a network with “maximal connectedness” subject to a fixed budget constraint.

Original languageEnglish (US)
Pages (from-to)1-12
Number of pages12
JournalPervasive and Mobile Computing
Volume53
DOIs
StatePublished - Feb 1 2019

Fingerprint

Budget Constraint
Connectedness
Relay
Placement
Vertex of a graph
Wireless Sensor Networks
Wireless sensor networks
Sensor
Sensors
Graph in graph theory
Design

Keywords

  • Approximation algorithms
  • Disconnectivity
  • Inapproximability
  • Maximal connectedness
  • NP-complete

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Applied Mathematics

Cite this

Zhou, C., Mazumder, A., Das, A., Basu, K., Matin-Moghaddam, N., Mehrani, S., & Sen, A. (2019). Relay node placement under budget constraint. Pervasive and Mobile Computing, 53, 1-12. https://doi.org/10.1016/j.pmcj.2018.12.001

Relay node placement under budget constraint. / Zhou, Chenyang; Mazumder, Anisha; Das, Arun; Basu, Kaustav; Matin-Moghaddam, Navid; Mehrani, Saharnaz; Sen, Arunabha.

In: Pervasive and Mobile Computing, Vol. 53, 01.02.2019, p. 1-12.

Research output: Contribution to journalArticle

Zhou, C, Mazumder, A, Das, A, Basu, K, Matin-Moghaddam, N, Mehrani, S & Sen, A 2019, 'Relay node placement under budget constraint', Pervasive and Mobile Computing, vol. 53, pp. 1-12. https://doi.org/10.1016/j.pmcj.2018.12.001
Zhou C, Mazumder A, Das A, Basu K, Matin-Moghaddam N, Mehrani S et al. Relay node placement under budget constraint. Pervasive and Mobile Computing. 2019 Feb 1;53:1-12. https://doi.org/10.1016/j.pmcj.2018.12.001
Zhou, Chenyang ; Mazumder, Anisha ; Das, Arun ; Basu, Kaustav ; Matin-Moghaddam, Navid ; Mehrani, Saharnaz ; Sen, Arunabha. / Relay node placement under budget constraint. In: Pervasive and Mobile Computing. 2019 ; Vol. 53. pp. 1-12.
@article{9b86f388c3cd4933838efbb3d6922722,
title = "Relay node placement under budget constraint",
abstract = "The relay node placement problem in the wireless sensor network domain has been studied extensively. But under a fixed budget, it may be impossible to procure the minimum number of relay nodes needed to design a connected network of sensor and relay nodes. Nevertheless, one would still like to design a network with high level of connectedness, or low disconnectedness. In this paper, we introduce the notion of a measure of the “connectedness” of a disconnected graph. We study a family of problems whose goal is to design a network with “maximal connectedness” subject to a fixed budget constraint.",
keywords = "Approximation algorithms, Disconnectivity, Inapproximability, Maximal connectedness, NP-complete",
author = "Chenyang Zhou and Anisha Mazumder and Arun Das and Kaustav Basu and Navid Matin-Moghaddam and Saharnaz Mehrani and Arunabha Sen",
year = "2019",
month = "2",
day = "1",
doi = "10.1016/j.pmcj.2018.12.001",
language = "English (US)",
volume = "53",
pages = "1--12",
journal = "Pervasive and Mobile Computing",
issn = "1574-1192",
publisher = "Elsevier",

}

TY - JOUR

T1 - Relay node placement under budget constraint

AU - Zhou, Chenyang

AU - Mazumder, Anisha

AU - Das, Arun

AU - Basu, Kaustav

AU - Matin-Moghaddam, Navid

AU - Mehrani, Saharnaz

AU - Sen, Arunabha

PY - 2019/2/1

Y1 - 2019/2/1

N2 - The relay node placement problem in the wireless sensor network domain has been studied extensively. But under a fixed budget, it may be impossible to procure the minimum number of relay nodes needed to design a connected network of sensor and relay nodes. Nevertheless, one would still like to design a network with high level of connectedness, or low disconnectedness. In this paper, we introduce the notion of a measure of the “connectedness” of a disconnected graph. We study a family of problems whose goal is to design a network with “maximal connectedness” subject to a fixed budget constraint.

AB - The relay node placement problem in the wireless sensor network domain has been studied extensively. But under a fixed budget, it may be impossible to procure the minimum number of relay nodes needed to design a connected network of sensor and relay nodes. Nevertheless, one would still like to design a network with high level of connectedness, or low disconnectedness. In this paper, we introduce the notion of a measure of the “connectedness” of a disconnected graph. We study a family of problems whose goal is to design a network with “maximal connectedness” subject to a fixed budget constraint.

KW - Approximation algorithms

KW - Disconnectivity

KW - Inapproximability

KW - Maximal connectedness

KW - NP-complete

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

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

U2 - 10.1016/j.pmcj.2018.12.001

DO - 10.1016/j.pmcj.2018.12.001

M3 - Article

VL - 53

SP - 1

EP - 12

JO - Pervasive and Mobile Computing

JF - Pervasive and Mobile Computing

SN - 1574-1192

ER -