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
AN - SCOPUS:85059347244
SN - 1574-1192
VL - 53
SP - 1
EP - 12
JO - Pervasive and Mobile Computing
JF - Pervasive and Mobile Computing
ER -