research-article

Optimal Receiver Placement for K-barrier Coverage in Passive Bistatic Radar Sensor Networks

Authors:

Laurence T. Yang,

Xianggong Hong,

Lingzhi YiAuthors Info & Claims

ACM Transactions on Internet Technology (TOIT), Volume 20, Issue 3

Article No.: 24, Pages 1 - 23

https://doi.org/10.1145/3377402

Published: 26 August 2020 Publication History

Abstract

The improvement of coverage quality in the construction of multiple-barrier coverage is a critical problem in a wireless sensor network. In this article, we investigate the K-barrier coverage construction problem in passive bistatic radar sensor networks. In contrast to traditional bistatic radar networks, the transmitters in a passive bistatic radar network are predeployed and noncooperative. To construct K barriers, we need to deploy receivers that couple with predeployed transmitters to build continuous barriers. In this work, we focus on the minimum number of receivers problem of constructing K-barrier coverage, where the minimum number of receivers is based on the predeployed transmitters. To handle this problem, we first investigate the optimal placement of receivers between adjacent transmitters for a sub-barrier formation and then determine the optimal placement of receivers for the one-barrier construction. For multiple-barrier coverage construction, we introduce a weighted transmitter graph (WTG) to describe the relation among different transmitters, where the weight in the graph is the minimum number of receivers needed for these two transmitters for a sub-barrier formation. Based on WTG, the minimum receivers problem changes to a problem of how to find K-disjoint paths with the minimum total weight in the graph. For large-scale networks, we also propose two efficient heuristic algorithms to solve the corresponding problem. Finally, we conduct extensive experiments to validate the correctness and the efficiency of the proposed algorithms.

References

[1]

Xianjun Deng, Laurence T. Yang, Lingzhi Yi, Minghua Wang, and Zhiliang Zhu. 2018. Detecting confident information coverage hole in industrial Internet of Things: An energy-efficient perspective. IEEE Commun. Mag. 56, 9 (2018), 68--73.

[2]

Bang Wang. 2011. Coverage problems in sensor networks: A survey. Comput. Surv. 43, 4 (2011), 1--56.

Digital Library

[3]

Bang Wang, Xianjun Deng, Wenyu Liu, Laurence T. Yang, and Han Chieh Chao. 2013. Confident information coverage in sensor networks for field reconstruction. IEEE Wirel. Commun. 20, 6 (2013), 74--81.

[4]

Xianjun Deng, Bang Wang, Wenyu Liu, and Laurence T. Yang. 2015. Sensor scheduling for multi-modal confident information coverage in sensor networks. IEEE Trans. Parallel Distrib. Syst. 26, 3 (2015), 902--913.

Digital Library

[5]

Lingzhi Yi, Xianjun Deng, Zenghui Zou, Dexin Ding, and Laurence T. Yang. 2018. Confident information coverage hole detection in sensor networks for uranium tailing monitoring. Elsev. J. Parallel Distrib. Comput. 118, 1 (2018), 57--66.

Digital Library

[6]

Lingzhi Yi, Xianjun Deng, Minghua Wang, Dexin Ding, and Yan Wang. 2017. Localized confident information coverage hole detection in Internet of Things for radioactive pollution monitoring. IEEE Access 5, 1 (2017), 18665--18674.

[7]

Xianjun Deng, Zujun Tang, Laurence T. Yang, Man Lin, and Bang Wang. 2018. Confident information coverage hole healing in hybrid industrial wireless sensor networks. IEEE Trans. Industr. Inform. 14, 5 (2018), 2220--2229.

[8]

Chien-I Weng, Chih-Yung Chang, Chih-Yao Hsiao, Chao-Tsun Chang, and Haibao Chen. 2018. On-supporting energy balanced k-barrier coverage in wireless sensor networks. IEEE Access 6 (2018), 13261--13274.

[9]

Donghyun Kim, Wei Wang, Junggab Son, Weili Wu, Wonjun Lee, and Alade O. Tokuta. 2017. Maximum lifetime combined barrier-coverage of weak static sensors and strong mobile sensors. IEEE Trans. Mobile Comput. 16, 7 (2017), 1956--1966.

Digital Library

[10]

Zhao Zhang, Weili Wu, Jing Yuan, and Ding-Zhu Du. 2018. Breach-free sleep-wakeup scheduling for barrier coverage with heterogeneous wireless sensors. IEEE/ACM Trans. Netw. 26, 5 (2018), 2404--2413.

Digital Library

[11]

Xianjun Deng, Yalan Jiang, Laurence T. Yang, Man Lin, Lingzhi Yi, and Minghua Wang. 2019. Data fusion based coverage optimization in heterogeneous sensor networks: A survey. Inform. Fus. 52 (2019), 90--105.

[12]

Xiao Zhang, Yu Zhou, Qingfu Zhang, Victor C. S. Lee, and Minming Li. 2017. Problem specific MOEA/D for barrier coverage with wireless sensors. IEEE Trans. Cyber. 47, 11 (2017), 3854--3865.

[13]

Chenxi Qiu, Haiying Shen, and Kang Chen. 2018. An energy-efficient and distributed cooperation mechanism for k-coverage hole detection and healing in WSNs. IEEE Trans. Mobile Comput. 17, 8 (2018), 1247--1259.

[14]

Zhibo Wang, Jilong Liao, Qing Cao, Hairong Qi, and Zhi Wang. 2014. Achieving k-barrier coverage in hybrid directional sensor networks. IEEE Trans. Mobile Comput. 13, 7 (2014), 1443--1455.

[15]

Jiaoyan Chen, Bang Wang, Wenyu Liu, Laurence T. Yang, and Xianjun Deng. 2017. Rotating directional sensors to mend barrier gaps in a line-based deployed directional sensor network. IEEE Syst. J. 11, 2 (2017), 1027--1038.

[16]

M. Skolnik. 2002. Introduction to Radar Systems. McGraw-Hill.

[17]

N. Willis. 2005. Bistatic Radar. SciTech Publishing.

[18]

C. J. Baker and H. D. Griffiths. 2006. Bistatic and multistatic radar sensors for homeland security. Adv. Sens. Secur. Applic. 2 (2006), 1--22.

[19]

H. D. Griffiths and C. J. Baker. 2005. Passive coherent location radar systems. Part 1: Performance prediction. IEEE Proc. Radar, Sonar Navig. 152, 3 (2005), 153--159.

[20]

Zhongyu Li, Fabrizio Santi, Debora Pastina, and Pierfrancesco Lombardo. 2017. Passive radar array with low-power satellite illuminators based on fractional Fourier transform. IEEE Sens. J. 17, 24 (2017), 8378--8394.

[21]

P. E. Howland, D. Maksimiuk, and G. Reitsma. 2005. FM radio based bistatic radar. IEEE Proc. Radar, Sonar Navig. 152, 3 (2005), 107--115.

[22]

Xianjun Deng, Minliang Xu, Laurence T. Yang, Man Lin, Lingzhi Yi, and Minghua Wang. 2019. Energy balanced dispatch of mobile edge nodes for confident information coverage hole repairing in IoT. IEEE Internet Things J. 6, 3 (2019), 4782--4790.

[23]

Shibo He, Xiaowen Gong, Junshan Zhang, Jiming Chen, and Youxian Sun. 2014. Curve-based deployment for barrier coverage in wireless sensor networks. IEEE Trans. Wirel. Commun. 13, 2 (2014), 724--735.

[24]

Zuoming Yu, Fan Yang, Jin Teng, Adam C. Champion, and Dong Xuan. 2015. Local face-view barrier coverage in camera sensor networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM’15). 684--692.

[25]

Linghe Kong, Siyu Lin, Weiliang Xie, Xiaoyu Qiao, Xi Jin, Peng Zeng, Wanli Ren, and Xiao-Yang Liu. 2016. Adaptive barrier coverage using software defined sensor networks. IEEE Sens. J. 16, 20 (2016), 7364--7372.

[26]

Simone Silvestri and Ken Goss. 2017. MobiBar: An autonomous deployment algorithm for barrier coverage with mobile sensors. Elsev. Ad Hoc Netw. 54 (2017), 111--129.

Digital Library

[27]

Chien-Fu Cheng and Chen-Wei Wang. 2018. The target-barrier coverage problem in wireless sensor networks. IEEE Trans. Mobile Comput. 17, 5 (2018), 1216--1232.

[28]

Chien Fu Cheng and Kuo Tang Tsai. 2012. Distributed barrier coverage in wireless visual sensor networks with β-QoM. IEEE Sens. J. 12, 6 (2012), 1726--1735.

[29]

Jun He and Hongchi Shi. 2010. Finding barriers with minimum number of sensors in wireless sensor networks. In Proceedings of the IEEE International Conference on Communications (ICC’10). 1--5.

[30]

Jun He and Hongchi Shi. 2010. A distributed algorithm for finding maximum barrier coverage in wireless sensor networks. In Proceedings of the IEEE Global Telecommunications Conference (Globecom’10). 1--5.

[31]

Huan Ma, Meng Yang, Deying Li, Yi Hong, and Wenping Chen. 2012. Minimum camera barrier coverage in wireless camera sensor networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM’12). 217--225.

[32]

Ruiqi Wang, Shibo He, Jiming Chen, Zhiguo Shi, and Fen Hou. 2015. Energy-efficient barrier coverage in bistatic radar sensor networks. In Proceedings of the IEEE International Conference on Communications (ICC’15). 6743--6748.

[33]

Jiaoyan Chen, Bang Wang, and Wenyu Liu. 2017. Energy-efficient barrier coverage in bistatic radar sensor networks. In Proceedings of the IEEE International Conference on Mobile Ad-hoc and Sensor Networks (MSN’17). 391--401.

[34]

Xiaowen Gong, Junshan Zhang, Douglas Cochran, and Kai Xing. 2016. Optimal placement for barrier coverage in bistatic radar sensor networks. IEEE Trans. Netw. 24, 1 (2016), 259--271.

Digital Library

[35]

Jiaoyan Chen, Bang Wang, and Wenyu Liu. 2015. Constructing perimeter barrier coverage with bistatic radar sensors. Elsev. J. Netw. Comput. Applic. 57 (Nov. 2015), 129--141.

Digital Library

[36]

Bang Wang, Jiaoyan Chen, Wenyu Liu, and Laurence T. Yang. 2016. Minimum cost placement of bistatic radar sensors for belt barrier coverage. IEEE Trans. Comput. 65, 2 (2016), 577--588.

Digital Library

[37]

Ramesh Bhandari. 1999. Survivable Networks Algorithms for Diverse Routing. Kluwer Academic Publishers.

Cited By

Chen CYang GLi ZXiao FChen QLi J(2024)Privacy-Preserving Multi-Party Cross-Chain Transaction ProtocolsCryptography10.3390/cryptography80100068:1(6)Online publication date: 4-Feb-2024
https://doi.org/10.3390/cryptography8010006
Hu XFeng HXia PTyson GWu LZhou YWang H(2024)Piecing Together the Jigsaw Puzzle of Transactions on Heterogeneous Blockchain NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/37004248:3(1-27)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1145/3700424
Chen XWang THuang KShao Z(2024)TPGraph: A Highly-scalable Time-partitioned Graph Model for Tracing BlockchainProceedings of the 17th ACM International Systems and Storage Conference10.1145/3688351.3689161(25-38)Online publication date: 16-Sep-2024
https://dl.acm.org/doi/10.1145/3688351.3689161
Show More Cited By

Index Terms

Optimal Receiver Placement for K-barrier Coverage in Passive Bistatic Radar Sensor Networks
1. Networks
  1. Network types
    1. Cyber-physical networks
      1. Sensor networks

Recommendations

Energy efficient k-barrier coverage in limited mobile wireless sensor networks

Energy cost and reliability are two main concerns in barrier coverage for wireless sensor networks. In this paper, we take the energy cost and reliability as objectives respectively to study two problems of k-barrier coverage: the minimum energy cost k-...
Interference-Free k-barrier Coverage in Wireless Sensor Networks
Combinatorial Optimization and Applications
Abstract
Barrier coverage is a hot issue in wireless sensor networks. Most literatures study barrier coverage under one-hop wireless sensor networks. In this paper, we consider more practical environment: multi-hop wireless sensor networks. We study the ...
The k-Barrier Coverage Mechanism in Wireless Mobile Sensor Networks
MoMM '14: Proceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia

The k-Barrier Coverage is known as the problem of detecting the intruders by at least k sensors when the intruders moving along the crossing paths from one boundary to another. This paper proposes a barrier coverage mechanism for Wireless Mobile Sensor ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Internet Technology

ACM Transactions on Internet Technology Volume 20, Issue 3

SI: Evolution of IoT Networking Architectures papers

August 2020

259 pages

ISSN:1533-5399

EISSN:1557-6051

DOI:10.1145/3408328

Editor:
Ling Liu
Georgia Institute of Technology, USA

Issue’s Table of Contents

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 August 2020

Online AM: 07 May 2020

Accepted: 01 December 2019

Revised: 01 November 2019

Received: 01 June 2019

Published in TOIT Volume 20, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

China Scholarship Council
Natural Sciences and Engineering Research Council of Canada
Research Foundation of Education Bureau of Hunan Province
National Natural Science Foundation of China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
168
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)0

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Chen CYang GLi ZXiao FChen QLi J(2024)Privacy-Preserving Multi-Party Cross-Chain Transaction ProtocolsCryptography10.3390/cryptography80100068:1(6)Online publication date: 4-Feb-2024
https://doi.org/10.3390/cryptography8010006
Hu XFeng HXia PTyson GWu LZhou YWang H(2024)Piecing Together the Jigsaw Puzzle of Transactions on Heterogeneous Blockchain NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/37004248:3(1-27)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1145/3700424
Chen XWang THuang KShao Z(2024)TPGraph: A Highly-scalable Time-partitioned Graph Model for Tracing BlockchainProceedings of the 17th ACM International Systems and Storage Conference10.1145/3688351.3689161(25-38)Online publication date: 16-Sep-2024
https://dl.acm.org/doi/10.1145/3688351.3689161
Wu SLi ZZhou HLuo XLi JWang HChristakis MPradel M(2024)Following the “Thread”: Toward Finding Manipulatable Bottlenecks in Blockchain ClientsProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3680372(1440-1452)Online publication date: 11-Sep-2024
https://dl.acm.org/doi/10.1145/3650212.3680372
Huang YWu XWang QQian ZChen XTang MZheng ZBaysal OLinares-Vasquez MMoran KSteinmacher I(2024)The Sword of Damocles: Upgradeable Smart Contract in EthereumProceedings of the 32nd IEEE/ACM International Conference on Program Comprehension10.1145/3643916.3644426(333-345)Online publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1145/3643916.3644426
Ding ZShi JLi QCao JSerra ESpezzano F(2024)Effective Illicit Account Detection on Large Cryptocurrency MultiGraphsProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679707(457-466)Online publication date: 21-Oct-2024
https://dl.acm.org/doi/10.1145/3627673.3679707
Luo FLuo RChen TQiao AHe ZSong SJiang YLi SRoychoudhury APaiva AAbreu RStorey M(2024)SCVHunter: Smart Contract Vulnerability Detection Based on Heterogeneous Graph Attention NetworkProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639213(1-13)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639213
Wu SLi ZYan LChen WJiang MWang CLuo XZhou HRoychoudhury APaiva AAbreu RStorey M(2024)Are We There Yet? Unraveling the State-of-the-Art Smart Contract FuzzersProceedings of the IEEE/ACM 46th International Conference on Software Engineering10.1145/3597503.3639152(1-13)Online publication date: 20-May-2024
https://dl.acm.org/doi/10.1145/3597503.3639152
Li PSong MXing MXiao ZDing QGuan SLong JChua TNgo CKa-Wei Lee RKumar RLauw H(2024)SPRING: Improving the Throughput of Sharding Blockchain via Deep Reinforcement Learning Based State PlacementProceedings of the ACM Web Conference 202410.1145/3589334.3645386(2836-2846)Online publication date: 13-May-2024
https://dl.acm.org/doi/10.1145/3589334.3645386
Boualem ADe Runz CAyaida MKholidy H(2024)Probabilistic intrusion detection based on an optimal strong K-barrier strategy in WSNsPeer-to-Peer Networking and Applications10.1007/s12083-024-01634-w17:3(1190-1207)Online publication date: 12-Feb-2024
https://doi.org/10.1007/s12083-024-01634-w
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View Issue’s Table of Contents