.png){kind=icon}
.png){kind=icon}
Return
Relay node placement under budget constraint
.png){kind=icon}
PRE
AI
DOI：10.1016/j.pmcj.2018.12.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Maximal connectedness
Disconnectivity
NP-complete
Approximation algorithms
Inapproximability
Journal
IF:
3.5
Papers:
1.5K
Citations:
2.2K