Abstract
Due to the increasing need of health monitoring at home or in senior center, we study the optimal relay node placement problem for wireless sensor networks with data collection and localization requirements. The problem can be modeled as finding a minimum connected k-dominating set. We consider realistic indoor wireless environment and explicitly take into account the effect of obstacles to the radio coverage, instead of using idealistic disc model. We prove the problem is NP-hard and propose an efficient greedy method called optimal relay placement algorithm (ORPA) to derive the best network setup. Results show that by using the proposed method, the number of relays required can be significantly reduced in comparison to two baseline algorithms. The method presented would be also relevant to other systems of similar network connectivity and relay deployment criteria.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bai X, Yun Z, Xuan D, Jia W, Zhao W (2010) Pattern mutation in wireless sensor deployment. In: IEEE INFOCOM, pp 1–9 (2010)
Chen CS, Li Y, Song YQ (2008) An exploration of geographic routing with \(k\)-hop based searching in wireless sensor networks. In: International conference on communications and networking in China, pp 376–381
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
Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman and Company, New York
Hung K, Lee C, Choy SO (2015) Ubiquitous health monitoring: Integration of wearable sensors, novel sensing techniques, and body sensor networks. In: Mobile health pp 319–342
Lloyd E, Xue G (2007) Relay node placement in wireless sensor networks. IEEE Trans Comput 56(1):134–138
Misra S, Hong S, Xue G, Tang J (2010) Constrained relay node placement in wireless sensor networks: formulation and approximations. IEEE/ACM Trans Netw 18(2):434–447
Suryadevara NK, Mukhopadhyay SC (2012) Wireless sensor network based home monitoring system for wellness determination of elderly. IEEE Sens J 12(6):1965–1972
Xue C, Zhu Y, Ni L, Li M, Li B (2012) Optimal relay placement for indoor sensor networks. In: IEEE DCOSS, pp 209–215
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 Mobile Comput 11(8)
Acknowledgments
This work is supported in part by ANR project IDEFIX under grant number ANR-13-INFR-0006, China NSF under grant No. 61003264, and Zhejiang Provincial NSF under grant No. LY13F020028. A part of the work was carried out at LINCS (www.lincs.fr).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Chen, C.S., Zhang, J., Chi, K. (2016). Optimal Relay Placement for WSN-Based Home Health Monitoring System. In: Liang, Q., Mu, J., Wang, W., Zhang, B. (eds) Proceedings of the 2015 International Conference on Communications, Signal Processing, and Systems. Lecture Notes in Electrical Engineering, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49831-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-49831-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49829-3
Online ISBN: 978-3-662-49831-6
eBook Packages: EngineeringEngineering (R0)