A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors
AbstractCoverage 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 to the practical sensing model. In this paper, we focus on the connected target coverage issue based on the probabilistic sensing model, which can characterize the quality of coverage more accurately. In the probabilistic sensing model, sensors are only be able to detect a target with certain probability. We study the collaborative detection probability of target under multiple sensors. Armed with the analysis of collaborative detection probability, we further formulate the minimum ϵ-connected target coverage problem, aiming to minimize the number of sensors satisfying the requirements of both coverage and connectivity. We map it into a flow graph and present an approximation algorithm called the minimum vertices maximum flow algorithm (MVMFA) with provable time complex and approximation ratios. To evaluate our design, we analyze the performance of MVMFA theoretically and also conduct extensive simulation studies to demonstrate the effectiveness of our proposed algorithm. View Full-Text
Share & Cite This Article
Shan, A.; Xu, X.; Cheng, Z.; Wang, W. A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors. Sensors 2017, 17, 1208.
Shan A, Xu X, Cheng Z, Wang W. A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors. Sensors. 2017; 17(6):1208.Chicago/Turabian Style
Shan, Anxing; Xu, Xianghua; Cheng, Zongmao; Wang, Wensheng. 2017. "A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors." Sensors 17, no. 6: 1208.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.