{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T08:51:54Z","timestamp":1771231914239,"version":"3.50.1"},"reference-count":32,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2010,3,15]],"date-time":"2010-03-15T00:00:00Z","timestamp":1268611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Deployment quality and cost are two conflicting aspects in wireless sensor networks. Random deployment, where the monitored field is covered by randomly and uniformly deployed sensor nodes, is an appropriate approach for large-scale network applications. However, their successful applications depend considerably on the deployment quality that uses the minimum number of sensors to achieve a desired coverage. Currently, the number of sensors required to meet the desired coverage is based on asymptotic analysis, which cannot meet deployment quality due to coverage overestimation in real applications. In this paper, we first investigate the coverage overestimation and address the challenge of designing coverage-guaranteed deployment strategies. To overcome this problem, we propose two deployment strategies, namely, the Expected-area Coverage Deployment (ECD) and BOundary Assistant Deployment (BOAD). The deployment quality of the two strategies is analyzed mathematically. Under the analysis, a lower bound on the number of deployed sensor nodes is given to satisfy the desired deployment quality. We justify the correctness of our analysis through rigorous proof, and validate the effectiveness of the two strategies through extensive simulation experiments. The simulation results show that both strategies alleviate the coverage overestimation significantly. In addition, we also evaluate two proposed strategies in the context of target detection application. The comparison results demonstrate that if the target appears at the boundary of monitored region in a given random deployment, the average intrusion distance of BOAD is considerably shorter than that of ECD with the same desired deployment quality. In contrast, ECD has better performance in terms of the average intrusion distance when the invasion of intruder is from the inside of monitored region.<\/jats:p>","DOI":"10.3390\/s100302064","type":"journal-article","created":{"date-parts":[[2010,3,15]],"date-time":"2010-03-15T12:15:15Z","timestamp":1268655315000},"page":"2064-2087","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Coverage-Guaranteed Sensor Node Deployment Strategies for Wireless Sensor Networks"],"prefix":"10.3390","volume":"10","author":[{"given":"Gaojuan","family":"Fan","sequence":"first","affiliation":[{"name":"College of Computer, Nanjing University of Post and Telecommunications, 210003, Nanjing, China"}]},{"given":"Ruchuan","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Computer, Nanjing University of Post and Telecommunications, 210003, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4392-3599","authenticated-orcid":false,"given":"Haiping","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Computer, Nanjing University of Post and Telecommunications, 210003, Nanjing, China"}]},{"given":"Lijuan","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Computer, Nanjing University of Post and Telecommunications, 210003, Nanjing, China"}]},{"given":"Chao","family":"Sha","sequence":"additional","affiliation":[{"name":"College of Computer, Nanjing University of Post and Telecommunications, 210003, Nanjing, China"}]}],"member":"1968","published-online":{"date-parts":[[2010,3,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1109\/TSMCA.2008.2003968","article-title":"Sensor placement for fault diagnosis","volume":"38","author":"Krysander","year":"2008","journal-title":"IEEE Trans. Syst. Man Cybern. A Syst. Humans"},{"key":"ref_2","unstructured":"Shih, F.Y., Wu, Y.T., and Chen, J.L. (2005, January April). A smart sensor network for object detection, classification and recognition. Newark, NJ, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Lazos, L., and Poovendran, R. (2006, January April). Coverage in heterogeneous sensor networks. Boston, MA, USA.","DOI":"10.21236\/ADA458986"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.comcom.2005.05.021","article-title":"How many sensors for an acceptable breach detection probability?","volume":"29","author":"Onur","year":"2006","journal-title":"Comput. Commun"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2658","DOI":"10.1109\/TIT.2005.862092","article-title":"Coverage by randomly deployed wireless sensor networks","volume":"52","author":"Wan","year":"2006","journal-title":"IEEE Trans. Inf. Theo"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Meguerdichian, S., Koushanfar, F., Potkonjak, M., and Srivastava, M.B. (2001, January April). Coverage problems in wireless ad-hoc sensor networks. Anchorage, AK, USA.","DOI":"10.1145\/381677.381691"},{"key":"ref_7","unstructured":"Zou, Y., and Krishnendu, C. (3,, January March). Sensor deployment and target localization based on virtual forces. San Franciso, CA, USA."},{"key":"ref_8","unstructured":"Hoffmann, F., Kaufmann, M., and Kriegel, K. (1991, January October). The Art Gallery theorem for polygons with holes. San Juan, Puerto Rico."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Shakkottai, S., Srikant, R., and Shroff, N. (3,, January March). Unreliable sensor grids: coverage, connectivity and diameter. San Franciso, CA, USA.","DOI":"10.1016\/j.adhoc.2004.02.001"},{"key":"ref_10","unstructured":"Hall, P. (1988). Introduction to the Theory of Coverage Processes, John Wiley & Sons Inc."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Liu, B., Brass, P., Dousse, O., Nain, P., and Towsley, D. (2005, January May). Mobility improves coverage of sensor networks. Urbana-Champaign, IL, USA.","DOI":"10.1145\/1062689.1062728"},{"key":"ref_12","unstructured":"Liu, B., and Towsley, D. (2004, January October). A study of the coverage of large-scale sensor networks. Piscataway, NJ, USA."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/TVT.2007.905624","article-title":"Sensing Coverage for Randomly Distributed wireless sensor networks in shadowed environments","volume":"57","author":"Tsai","year":"2008","journal-title":"IEEE Trans. Veh. Technol"},{"key":"ref_14","unstructured":"Ghosh, A. (2004, January November). Estimating Coverage Holes and Enhancing Coverage in Mixed Sensor Networks. Washington, DC, USA."},{"key":"ref_15","unstructured":"Adlakha, S., and Srivastava, M. (2003, January March). Critical density thresholds for coverage in wireless sensor networks. New Orleans, LA, USA."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Balister, P., and Kumar, S. (2009, January April). Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors. Rio de Janeiro, Brazil.","DOI":"10.1109\/INFCOM.2009.5062254"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1109\/TPDS.2006.77","article-title":"Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks","volume":"17","author":"Liu","year":"2006","journal-title":"IEEE Trans. Parallel Distrib. Syst"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Jiang, J., Li, F., Wen, J., W, G.F., and Zhang, H.Y. (2009, January August). Random scheduling for wireless sensor networks. Chengdu, Sichuan, China.","DOI":"10.1109\/ISPA.2009.50"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"978","DOI":"10.1109\/TC.2005.123","article-title":"A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks","volume":"54","author":"Zou","year":"2005","journal-title":"IEEE Trans. Comput"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wang, X.R., Xing, G.L., Zhang, Y.F., Lu, C.Y., Pless, R., and Gill, C. (2003, January November). Integrated coverage and connectivity configuration in wireless sensor networks. Los Angeles, CA, USA.","DOI":"10.1145\/958491.958496"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/TMC.2008.19","article-title":"Intrusion detection in homogeneous and heterogeneous wireless sensor networks","volume":"7","author":"Wang","year":"2008","journal-title":"IEEE Trans. Mobile Comput"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhang, H.H., and Hou, J. (2004, January May). On deriving the upper bound of a-lifetime for large sensor networks. Roppongi Hills, Tokyo, Japan.","DOI":"10.1145\/989459.989475"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/j.adhoc.2007.05.003","article-title":"Strategies and techniques for node placement in wireless sensor networks: a survey","volume":"6","author":"Younis","year":"2008","journal-title":"Ad Hoc Netw"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2792","DOI":"10.3390\/s8042792","article-title":"Relocating Sensor Nodes to Maximize Cumulative connected coverage in wireless sensor networks","volume":"8","author":"Coskun","year":"2008","journal-title":"Sensors"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Takahara, G., Xu, K., and Hassanein, H. (2007, January March). How resilient is grid-based WSN coverage to deployment errors?. Hong Kong.","DOI":"10.1109\/WCNC.2007.532"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Yan, T., He, T., and Stankovic, J.A. (2003, January November). Differentiated surveillance for sensor networks. Los Angeles, CA, USA.","DOI":"10.1145\/958491.958498"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"3467","DOI":"10.1016\/j.comcom.2006.01.033","article-title":"Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks","volume":"29","author":"Choi","year":"2006","journal-title":"Comput. Commun"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/11502593_22","article-title":"Analysis of target detection performance for wireless sensor networks","volume":"3560","author":"Cao","year":"2005","journal-title":"Lect. Note. Comput. Sci"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ling, Q., and Tian, Z. (2007, January November). Minimum node degree and k-connectivity of a wireless multihop network in bounded area. Washington, DC, USA.","DOI":"10.1109\/GLOCOM.2007.249"},{"key":"ref_30","unstructured":"Santalo, L. (1976). Integral Geometry and Geometric Probability, Addison-Wesley Publishing Company."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MNET.2007.4395110","article-title":"Surveillance wireless sensor networks: deployment quality analysis","volume":"21","author":"Onur","year":"2007","journal-title":"IEEE Netw"},{"key":"ref_32","unstructured":"Yu, C., and Yen, L. Available online: http:\/\/www.csie.chu.edu.tw\/tech\/tech_file\/tech143630.pdf (accessed on 22 August 2009)."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/10\/3\/2064\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:01:46Z","timestamp":1760220106000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/10\/3\/2064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,15]]},"references-count":32,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2010,3]]}},"alternative-id":["s100302064"],"URL":"https:\/\/doi.org\/10.3390\/s100302064","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,15]]}}}