Next Article in Journal
A Novel Complex-Coefficient In-Band Interference Suppression Algorithm for Cognitive Ultra-Wide Band Wireless Sensors Networks
Previous Article in Journal
Automatic Detection of Driver Fatigue Using Driving Operation Information for Transportation Safety
Article Menu
Issue 6 (June) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(6), 1208; doi:10.3390/s17061208

A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors

1
School of Computer Science, Hangzhou Dianzi University, Hangzhou 310018, China
2
School of Science, Hangzhou Dianzi University, Hangzhou 310018, China
3
College of Economics, Hangzhou Dianzi University, Hangzhou 310018, China
*
Author to whom correspondence should be addressed.
Academic Editor: Mohamed F. Younis
Received: 7 April 2017 / Revised: 10 May 2017 / Accepted: 19 May 2017 / Published: 25 May 2017
(This article belongs to the Section Sensor Networks)
View Full-Text   |   Download PDF [1159 KB, uploaded 25 May 2017]   |  

Abstract

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 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
Keywords: WSN; target coverage; connectivity; probabilistic sensor WSN; target coverage; connectivity; probabilistic sensor
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Shan, A.; Xu, X.; Cheng, Z.; Wang, W. A Max-Flow Based Algorithm for Connected Target Coverage with Probabilistic Sensors. Sensors 2017, 17, 1208.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top