Optimal Receiver Placement for K -barrier Coverage in Passive Bistatic Radar Sensor Networks
| Autor: | Xianjun Deng, Xianggong Hong, Laurence T. Yang, Lingzhi Yi, Jiaoyan Chen |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Correctness
Relation (database) Computer Networks and Communications Computer science Heuristic (computer science) 010401 analytical chemistry Real-time computing Transmitter 020206 networking & telecommunications 02 engineering and technology 01 natural sciences 0104 chemical sciences Bistatic radar 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) Focus (optics) Wireless sensor network |
| Zdroj: | ACM Transactions on Internet Technology. 20:1-23 |
| ISSN: | 1557-6051 1533-5399 |
| DOI: | 10.1145/3377402 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|