Abstract
Motivated by the needs of health monitoring at home (or a senior center) using a sensor network system, we study the problem of how to place the relay nodes so that the data collection and localization requirements of the monitoring system can be satisfied. By exploiting the inherent nature of the problem, we model it as finding a minimum connected k-dominating (k ≥ 3) set. Instead of using an idealistic disk radio model, we explicitly take into account the obstacles’ effect on the radio propagation in an indoor environment. We prove that the problem is NP-hard and propose an efficient greedy algorithm ORPA (Optimal Relay Placement Algorithm) to compute in polynomial time the best locations to place the relays. Results of extensive simulations have shown that by using our proposed algorithm ORPA, the number of relays required can be substantially reduced in comparison to the random placement and two-stage placement strategies. We also study the impact of the transmission power and the grid size on the algorithm and system performance. The result and method presented in the paper is useful to today’s indoor deployment of practical WSN-based monitoring system and to ensure network connectivity with minimal relay nodes.
Similar content being viewed by others
Notes
The connectivity requirement is defined as the percentage of relays that are connected.
References
Suryadevara NK, Mukhopadhyay SC (2012) Wireless sensor network based home monitoring system for wellness determination of elderly. IEEE Sensors J 12(6):1965–1972
Hung K, Lee C, Choy S-O (2015) Ubiquitous health monitoring: integration of wearable sensors, novel sensing techniques, and body sensor networks. In: Adibi S (eds) Mobile Health. Springer series in bio-/neuroinformatics, vol 5. Springer, Cham, pp.319–242
Yang D, Misra S, Fang X, Xue G, Zhang J (2012) Two-tiered constrained relay node placement in wireless sensor networks: computational complexity and efficient approximations. IEEE Trans Mob Comput 11 (8):1399–1411
Bagaa M, Chelli A, Djenouri D, Taleb T, Balasingham I, Kansanen K (2017) Optimal placement of relay nodes over limited positions in wireless sensor networks. IEEE Trans Wirel Commun 16(4):2205–2219
Misra S, Hong S, Xue G, Tang J (2010) Constrained relay node placement in wireless sensor networks: formulation and approximations. IEEE/ACM Trans Networking 18(2):434–447
Hao B, Tang H, Xue G (2004) Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation. In: IEEE workshop on high performance switching and routing (HPSR), pp 246–250
Liu H, Wan P-J, Jia X (2005) Fault-tolerant relay node placement in wireless sensor networks. In: Computing and combinatorics, ser. Lecture notes in computer science, vol 3595, pp 230–239
Lloyd E, Xue G (2007) Relay node placement in wireless sensor networks. IEEE Trans Comput 56(1):134–138
Srinivas A, Zussman G, Modiano E (2009) Construction and maintenance of wireless mobile backbone networks. IEEE/ACM Trans Networking 17(1):239–252
Ma C, Liang W, Zheng M, Sharif H (2016) A connectivity-aware approximation algorithm for relay node placement in wireless sensor networks. IEEE Sensors J 16(2):515–528
Zhang H, Hou J (2005) Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc and Sensor Wireless Networks 1(1-2):89–124
Bai X, Xuan D, Yun Z, Lai T, Jia W (2008) Complete optimal deployment patterns for full-coverage and k-connectivity (k6) wireless sensor networks. In: ACM MobiHoc, pp 401–410
Bai X, Yun Z, Xuan D, Jia W, Zhao W (2010) Pattern mutation in wireless sensor deployment. In: IEEE INFOCOM, pp 1–9
Roselin J, Latha P, Benitta S (2017) Maximizing the wireless sensor networks lifetime through energy efficient connected coverage. Ad Hoc Netw 62:1–10
Shang W, Wan P, Yao F, Hu X (2007) Algorithms for minimum m-connected k-tuple dominating set problem. Theor Comput Sci 381(1):241–247
Wu Y, Wang F, Thai MT, Li Y (2007) Constructing k-connected m-dominating sets in wireless sensor networks. In: IEEE military communications conference (MILCOM), pp 1–7
Shang W, Yao F, Wan P, Hu X (2008) On minimum m-connected k-dominating set problem in unit disc graphs. J Comb Optim 16(2):99–106
Wu Y, Li Y (2008) Construction algorithms for k-connected m-dominating sets in wireless sensor networks. In: The 9th ACM international symposium on mobile Ad hoc networking and computing, pp 83–90
Wang Z, Cao Q, Qi H, Chen H, Wang Q (2017) Cost-effective barrier coverage formation in heterogeneous wireless sensor networks. Ad Hoc Netw 64:65–79
Wang Z, Chen H, Cao Q, Qi H, Wang Z, Wang Q (2017) Achieving location error tolerant barrier coverage for wireless sensor networks. Comput Netw 112:314–328
Xue C, Zhu Y, Ni L, Li M, Li B (2012) Optimal relay placement for indoor sensor networks. In: IEEE DCOSS, pp 209–215
Calinescu G, Grimmer B, Misra S, Tongngam S, Xue G, Zhang W (2016) Improved approximation algorithms for single-tiered relay placement. J Comb Optim 31(3):1280–1297
Lin G, Xue G (1999) Steiner tree problem with minimum number of steiner points and bounded edge-length. Inf Process Lett 69(2): 53–57
Chen D, Du D, Hu X, Lin G, Wang L, Xue G (2000) Approximations for steiner trees with minimum number of steiner points. J Glob Optim 18:17–33
Cheng X, Du D, Wang L, Xu B (2008) Relay sensor placement in wireless sensor networks. Wirel Netw 14(3):347–355
Senel F, Younis M (2016) Novel relay node placement algorithms for establishing connected topologies. J Netw Comput Appl 70:114–130
Shakkottai S, Srikant R, Shroff N (2003) Unreliable sensor grids: coverage, connectivity and diameter. In: IEEE INFOCOM 2003, vol 2, pp 1073–1083
Zhou Z, Das S, Gupta H (2004) Connected k-coverage problem in sensor networks. In: 13th international conference on computer communications and networks (ICCCN), pp 373–378
Gupta H, Zhou Z, Das S, Gu Q (2006) Connected sensor cover: self-organization of sensor networks for efficient query execution. IEEE/ACM Trans Networking 14(1):55–67
Zamalloa M, Krishnamachari B (2007) An analysis of unreliability and asymmetry in low-power wireless links. ACM Trans on Sensor Networks 3(2):1–34
Chipara O, Hackmann G, Lu C, Smart W, Roman G (2010) Practical modeling and prediction of radio coverage of indoor sensor networks. In: ACM/IEEE IPSN, pp 339–349
Li Y, Song Y-Q, Schott R, Wang Z, Sun Y (2008) Impact of link unreliability and asymmetry on the quality of connectivity in large-scale sensor networks. Sensors 8(10):6674–6691
Al-Turjman FM, Hassanein HS, Ibnkahla MA (2013) Efficient deployment of wireless sensor networks targeting environment monitoring applications. Comput Commun 36(2):135– 148
IEEE Std 802.15.4 (2006) Part 15.4: wireless medium access (MAC) and physical layer (PHY) specifications for low-rate wireless personal area networks (WPANs). [Online]. Available: https://standards.ieee.org/findstds/standard/802.15.4-2006.html (accessed on Feb 8, 2018)
Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman and Company, New York
Telosb datasheet. [Online]. Available: http://www.willow.co.uk/TelosB_Datasheet.pdf (accessed on Feb 8, 2018)
Gnawali O, Fonseca R, Jamieson K, Kazandjieva M, Moss D, Levis P (2013) CTP: an efficient, robust, and reliable collection tree protocol for wireless sensor networks. ACM Trans on Sensor Networks 10(1):1–50
Acknowledgements
This work was supported in part by Natural Science Foundation of China under grant Nos. 61772472, 61472367 and 61473109 Natural Science Foundation of Zhejiang Province under grant No.LY17F020020, and French ANR project IDEFIX under grant No. ANR-13-INFR-0006, a part the work was carried out at LINCS (www.lincs.fr).
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is part of the Topical Collection: Special Issue on Network Coverage
Guest Editors: Shibo He, Dong-Hoon Shin, and Yuanchao Shu
Rights and permissions
About this article
Cite this article
Li, Y., Chen, C.S., Chi, K. et al. Two-tiered relay node placement for WSN-based home health monitoring system. Peer-to-Peer Netw. Appl. 12, 589–603 (2019). https://doi.org/10.1007/s12083-018-0638-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-018-0638-0