A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors
Coverage is a fundamental issue in the research field of wireless sensor networks (WSNs). Connected target coverage discusses the sensor placement to guarantee the needs of both coverage and connectivity. Existing works largely leverage on the Boolean disk model, which is only a coarse approximation...
Main Authors: | Anxing Shan, Xianghua Xu, Zongmao Cheng, Wensheng Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-05-01
|
Series: | Sensors |
Subjects: | |
Online Access: | http://www.mdpi.com/1424-8220/17/6/1208 |
Similar Items
-
Target Coverage in Wireless Sensor Networks with Probabilistic Sensors
by: Anxing Shan, et al.
Published: (2016-08-01) -
The Optimal Deployment, Coverage, and Connectivity Problems in Wireless Sensor Networks: Revisited
by: Jamal N. Al-Karaki, et al.
Published: (2017-01-01) -
Sensor Node Activation Using Bat Algorithm for Connected Target Coverage in WSNs
by: Jaemin Kim, et al.
Published: (2020-07-01) -
Study on Connected Target Coverage Algorithm for Wireless Sensor Network
by: Danyang Qin, et al.
Published: (2018-01-01) -
Deployment Techniques in Wireless Sensor Networks, Coverage and Connectivity: A Survey
by: Mohammed Farsi, et al.
Published: (2019-01-01)