Relay Node Placement Under Budget Constraint

The relay node placement problem in the wireless sensor network domain has been studied extensively over the past few years. The objective 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 sensor and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the network connected, may exceed the budget. Although, in this case, one must give up the idea of having of a connected network but one would still like to design a network with a high level of connectedness, or a low level of disconnectedness. In this paper, we introduce the notion of disconnectivity, 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" or "minimal disconnectedness", subject to a fixed budget constraint. We show that all problems in this family are NP-Complete and present an approximation algorithm with a performance bound of 1/10 for the problem that maximizes the size of the largest connected components, and inapproximability results for the problem that maximizes the size of the smallest connected component and the problem that minimizes the number of connected components. In addition, we present future direction of our research on this topic.

[1]  Guoliang Xue.  Relay node placement in wireless sensor networks , 2011, RWS 2011.

[2]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[3]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations , 2010, IEEE/ACM Transactions on Networking.

[4]  Peng Li,et al.  BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks , 2014, Sensors.

[5]  Samir Khuller,et al.  Improved approximation algorithms for uniform connectivity problems , 1995, STOC '95.

[6]  Satyajayant Misra,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Lusheng Wang,et al.  Relay sensor placement in wireless sensor networks , 2008, Wirel. Networks.

[8]  Lachlan L. H. Andrew,et al.  Connectivity, Coverage and Placement in Wireless Sensor Networks , 2009, Sensors.

[9]  Erik D. Demaine,et al.  Deploying Sensor Networks With Guaranteed Fault Tolerance , 2010, IEEE/ACM Transactions on Networking.

[10]  Arunabha Sen,et al.  Budget constrained relay node placement problem for maximal “connectedness” , 2016, MILCOM 2016 - 2016 IEEE Military Communications Conference.

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Xiaofeng Han,et al.  Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks , 2010, IEEE Trans. Mob. Comput..

[13]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[14]  Jau-Yang Chang,et al.  A cluster-based relay station deployment scheme for multi-hop relay networks , 2015, Journal of Communications and Networks.

[15]  Mohamed F. Younis,et al.  Relay node placement in structurally damaged wireless sensor networks via triangular steiner tree approximation , 2011, Comput. Commun..

[16]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

[17]  Samir Khuller,et al.  Relay placement for fault tolerance in wireless networks in higher dimensions , 2011, Comput. Geom..

[18]  Jianping Pan,et al.  Topology control for wireless sensor networks , 2003, MobiCom '03.

[19]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[20]  C. Guestrin,et al.  Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[21]  Christian Artigues,et al.  Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design , 2019, Comput. Optim. Appl..

[22]  Hsiao-Chen Lu,et al.  Joint Base Station and Relay Station Placement for IEEE 802.16j Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[23]  Naveen Garg,et al.  Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.