Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks

Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of requi...

Full description

Saved in:
Bibliographic Details
Published in:IEEE systems journal 2021-06, Vol.15 (2), p.2241-2244
Main Authors: Si, Pengju, Wang, Shuaishuai, Shu, Lei, Ning, Rui, Fu, Zhumu
Format: Article
Language:English
Subjects:
Algorithms
Coverage
Minimization
Sensor phenomena and characterization
Silicon
Surveillance
target barrier
Wireless networks
Wireless sensor networks
wireless sensor networks (WSNs)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c295t-c5bff982c12652a0bac8f9f21dc5d27d94a36ac25801d1e5585cd3d9efd2c0c33
cites cdi_FETCH-LOGICAL-c295t-c5bff982c12652a0bac8f9f21dc5d27d94a36ac25801d1e5585cd3d9efd2c0c33
container_end_page 2244
container_issue 2
container_start_page 2241
container_title IEEE systems journal
container_volume 15
creator Si, Pengju
Wang, Shuaishuai
Shu, Lei
Ning, Rui
Fu, Zhumu
description Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of required sensors for a given region. The algorithm first constructs a target-barrier circle for each target. Then, it utilizes the merged properties of target-barrier circles to derive the shortest length of target barriers. Our extensive experiments demonstrate that the proposed algorithm can construct target-barrier coverage effectively with minor deployment costs.
doi_str_mv 10.1109/JSYST.2020.2990395
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_proquest_journals_2539353762</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9095370</ieee_id><sourcerecordid>2539353762</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-c5bff982c12652a0bac8f9f21dc5d27d94a36ac25801d1e5585cd3d9efd2c0c33</originalsourceid><addsrcrecordid>eNo9kMlOwzAQQC0EEqXwA3CxxDnFHtdNfISyC1GkFCFOluuMq5Q0DnYK6t-TLuI0I828WR4h55wNOGfq6jn_zKcDYMAGoBQTSh6QHlciTRSI4eE2hyTj2fCYnMS4YExmMlU9kk-atlyait5iU_n1EuuWOh_o1IQ5tsmNCaHEQMf-B4OZI30LflbhMtKyph9lwApjpDnWsWNesf314SuekiNnqohn-9gn7_d30_Fj8jJ5eBpfvyQWlGwTK2fOqQwsh5EEw2bGZk454IWVBaSFGhoxMhZkxnjBUXYX20IUCl0Bllkh-uRyN7cJ_nuFsdULvwp1t1KDFEpIkY6g64Jdlw0-xoBON6H7OKw1Z3ojT2_l6Y08vZfXQRc7qETEf0CxrpQy8Qdtpmxw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2539353762</pqid></control><display><type>article</type><title>Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks</title><source>IEEE Xplore (Online service)</source><creator>Si, Pengju ; Wang, Shuaishuai ; Shu, Lei ; Ning, Rui ; Fu, Zhumu</creator><creatorcontrib>Si, Pengju ; Wang, Shuaishuai ; Shu, Lei ; Ning, Rui ; Fu, Zhumu</creatorcontrib><description>Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of required sensors for a given region. The algorithm first constructs a target-barrier circle for each target. Then, it utilizes the merged properties of target-barrier circles to derive the shortest length of target barriers. Our extensive experiments demonstrate that the proposed algorithm can construct target-barrier coverage effectively with minor deployment costs.</description><identifier>ISSN: 1932-8184</identifier><identifier>EISSN: 1937-9234</identifier><identifier>DOI: 10.1109/JSYST.2020.2990395</identifier><identifier>CODEN: ISJEB2</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Coverage ; Minimization ; Sensor phenomena and characterization ; Silicon ; Surveillance ; target barrier ; Wireless networks ; Wireless sensor networks ; wireless sensor networks (WSNs)</subject><ispartof>IEEE systems journal, 2021-06, Vol.15 (2), p.2241-2244</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-c5bff982c12652a0bac8f9f21dc5d27d94a36ac25801d1e5585cd3d9efd2c0c33</citedby><cites>FETCH-LOGICAL-c295t-c5bff982c12652a0bac8f9f21dc5d27d94a36ac25801d1e5585cd3d9efd2c0c33</cites><orcidid>0000-0002-1957-216X ; 0000-0002-6700-9347 ; 0000-0002-2573-3062</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9095370$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27903,27904,54774</link.rule.ids></links><search><creatorcontrib>Si, Pengju</creatorcontrib><creatorcontrib>Wang, Shuaishuai</creatorcontrib><creatorcontrib>Shu, Lei</creatorcontrib><creatorcontrib>Ning, Rui</creatorcontrib><creatorcontrib>Fu, Zhumu</creatorcontrib><title>Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks</title><title>IEEE systems journal</title><addtitle>JSYST</addtitle><description>Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of required sensors for a given region. The algorithm first constructs a target-barrier circle for each target. Then, it utilizes the merged properties of target-barrier circles to derive the shortest length of target barriers. Our extensive experiments demonstrate that the proposed algorithm can construct target-barrier coverage effectively with minor deployment costs.</description><subject>Algorithms</subject><subject>Coverage</subject><subject>Minimization</subject><subject>Sensor phenomena and characterization</subject><subject>Silicon</subject><subject>Surveillance</subject><subject>target barrier</subject><subject>Wireless networks</subject><subject>Wireless sensor networks</subject><subject>wireless sensor networks (WSNs)</subject><issn>1932-8184</issn><issn>1937-9234</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNo9kMlOwzAQQC0EEqXwA3CxxDnFHtdNfISyC1GkFCFOluuMq5Q0DnYK6t-TLuI0I828WR4h55wNOGfq6jn_zKcDYMAGoBQTSh6QHlciTRSI4eE2hyTj2fCYnMS4YExmMlU9kk-atlyait5iU_n1EuuWOh_o1IQ5tsmNCaHEQMf-B4OZI30LflbhMtKyph9lwApjpDnWsWNesf314SuekiNnqohn-9gn7_d30_Fj8jJ5eBpfvyQWlGwTK2fOqQwsh5EEw2bGZk454IWVBaSFGhoxMhZkxnjBUXYX20IUCl0Bllkh-uRyN7cJ_nuFsdULvwp1t1KDFEpIkY6g64Jdlw0-xoBON6H7OKw1Z3ojT2_l6Y08vZfXQRc7qETEf0CxrpQy8Qdtpmxw</recordid><startdate>202106</startdate><enddate>202106</enddate><creator>Si, Pengju</creator><creator>Wang, Shuaishuai</creator><creator>Shu, Lei</creator><creator>Ning, Rui</creator><creator>Fu, Zhumu</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-1957-216X</orcidid><orcidid>https://orcid.org/0000-0002-6700-9347</orcidid><orcidid>https://orcid.org/0000-0002-2573-3062</orcidid></search><sort><creationdate>202106</creationdate><title>Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks</title><author>Si, Pengju ; Wang, Shuaishuai ; Shu, Lei ; Ning, Rui ; Fu, Zhumu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-c5bff982c12652a0bac8f9f21dc5d27d94a36ac25801d1e5585cd3d9efd2c0c33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Coverage</topic><topic>Minimization</topic><topic>Sensor phenomena and characterization</topic><topic>Silicon</topic><topic>Surveillance</topic><topic>target barrier</topic><topic>Wireless networks</topic><topic>Wireless sensor networks</topic><topic>wireless sensor networks (WSNs)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Si, Pengju</creatorcontrib><creatorcontrib>Wang, Shuaishuai</creatorcontrib><creatorcontrib>Shu, Lei</creatorcontrib><creatorcontrib>Ning, Rui</creatorcontrib><creatorcontrib>Fu, Zhumu</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><jtitle>IEEE systems journal</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Si, Pengju</au><au>Wang, Shuaishuai</au><au>Shu, Lei</au><au>Ning, Rui</au><au>Fu, Zhumu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks</atitle><jtitle>IEEE systems journal</jtitle><stitle>JSYST</stitle><date>2021-06</date><risdate>2021</risdate><volume>15</volume><issue>2</issue><spage>2241</spage><epage>2244</epage><pages>2241-2244</pages><issn>1932-8184</issn><eissn>1937-9234</eissn><coden>ISJEB2</coden><abstract>Target-barrier coverage problems are a new emerging issue in wireless sensor networks. However, it is a challenge to achieve target barriers for randomly distributed targets in the surveillance region. In this paper, we propose a deterministic deployment algorithm to find the minimum number of required sensors for a given region. The algorithm first constructs a target-barrier circle for each target. Then, it utilizes the merged properties of target-barrier circles to derive the shortest length of target barriers. Our extensive experiments demonstrate that the proposed algorithm can construct target-barrier coverage effectively with minor deployment costs.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSYST.2020.2990395</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0002-1957-216X</orcidid><orcidid>https://orcid.org/0000-0002-6700-9347</orcidid><orcidid>https://orcid.org/0000-0002-2573-3062</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1932-8184
ispartof IEEE systems journal, 2021-06, Vol.15 (2), p.2241-2244
issn 1932-8184
1937-9234
language eng
recordid cdi_proquest_journals_2539353762
source IEEE Xplore (Online service)
subjects Algorithms
Coverage
Minimization
Sensor phenomena and characterization
Silicon
Surveillance
target barrier
Wireless networks
Wireless sensor networks
wireless sensor networks (WSNs)
title Optimal Deployment for Target-Barrier Coverage Problems in Wireless Sensor Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T03%3A21%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20Deployment%20for%20Target-Barrier%20Coverage%20Problems%20in%20Wireless%20Sensor%20Networks&rft.jtitle=IEEE%20systems%20journal&rft.au=Si,%20Pengju&rft.date=2021-06&rft.volume=15&rft.issue=2&rft.spage=2241&rft.epage=2244&rft.pages=2241-2244&rft.issn=1932-8184&rft.eissn=1937-9234&rft.coden=ISJEB2&rft_id=info:doi/10.1109/JSYST.2020.2990395&rft_dat=%3Cproquest_ieee_%3E2539353762%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c295t-c5bff982c12652a0bac8f9f21dc5d27d94a36ac25801d1e5585cd3d9efd2c0c33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2539353762&rft_id=info:pmid/&rft_ieee_id=9095370&rfr_iscdi=true