Abstract
Sensor deployment is an important issue to provide QoS guarantees in the wireless sensor network. Recently, CRITICAL- SQUARE-GRID COVERAGE problem, which is the problem of constructing the minimum size wireless sensor network with full coverage of critical square grids in the sensor field, has been presented and addressed by many researchers. However, this problem does not take the relay nodes into consideration, where the relay nodes may exist in the sensing field and can provide data transmission. In this paper, our problem is to construct a minimum size homogeneous wireless sensor network to fully cover critical square grids when the relay nodes exist in the sensing field. A modified algorithm is proposed by considering the existence of relay nodes. The simulation results show that our method has better performance than others.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akshay, N., Kumar, M.P., Harish, B., Dhanorkar, S.: An efficient approach for sensor deployments in wireless sensor network. In: International Conference on Emerging Trends in Robotics and Communication Technologies, pp. 350–355 (2010)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1-3), 165–177 (1990)
Du, J., Li, Y., Liu, H., Sha, K.: On sweep coverage with minimum mobile sensors. In: IEEE 16th International Conference on Parallel and Distributed Systems, pp. 283–290 (2010)
Heo, N., Varshney, P.K.: Energy-efficient deployment of intelligent mobile sensor networks. IEEE Trans. Systems, Man, and Cybernetics-Part A: Systems and Humans 35(1), 78–92 (2005)
Ke, W.C., Liu, B.H., Tsai, M.J.: The critical-square-grid coverage problem in wireless sensor networks is NP-Complete. Computer Networks 55(9), 2209–2220 (2011)
Ke, W.C., Liu, B.H., Tsai, M.J.: Efficient algorithm for constructing minimum size wireless sensor networks to fully cover critical square grids. IEEE Trans. Wireless Communications 10(4), 1154–1164 (2011)
Klein, P.N., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. J. Algorithms 19(1), 104–115 (1995)
Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of ACM MobiCom, Cologne, Germany (2005)
Lei, Y., Zhang, Y., Zhao, Y.: The research of coverage problems in wireless sensor network. In: International Conference on Wireless Networks and Information Systems, pp. 31–34 (2009)
Mittal, R., Bhatia, M.P.S.: Wireless sensor networks for monitoring the environmental activities. In: IEEE International Conference on Computational Intelligence and Computing Research, pp. 1–5 (2010)
Silvestri, S.: Mobibar: Barrier coverage with mobile sensors. In: IEEE Global Telecommunications Conference, pp. 1–6 (2011)
Yun, Z., Bai, X., Xuan, D., Lai, T.H., Jia, W.: Optimal deployment patterns for full coverage and k-connectivity (k ≤ 6) wireless sensor networks. ACM/IEEE Transactions on Networking 18(3), 934–947 (2010)
Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc & Sensor Wireless Networks 1(1-2), 89–124 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, BH., Lin, YX., Wang, WS., Lien, CY. (2014). A Modified Method for Constructing Minimum Size Homogeneous Wireless Sensor Networks with Relay Nodes to Fully Cover Critical Square Grids. In: Pan, JS., Krömer, P., Snášel, V. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 238. Springer, Cham. https://doi.org/10.1007/978-3-319-01796-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-01796-9_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01795-2
Online ISBN: 978-3-319-01796-9
eBook Packages: EngineeringEngineering (R0)