The generalized k-coverage under probabilistic sensing model in sensor networks

Hung Lung Wang*, Wei Ho Chung

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

The usage of wireless sensor networks (WSNs) to monitor a region is an important functionality in defense and security applications. In these applications, a fundamental issue is to determine the minimum degree of coverage in the concerned region. The past researches focus on the binary disk sensing model, where sensors are assumed to be accurate in detecting targets within their sensing ranges. In this paper, we investigate the coverage problem under a more realistic model, the probabilistic sensing model, in which the probability of detection by a sensor decays with the distances. We generalize the coverage problem to the probabilistic sensing model and propose an algorithm to calculate the minimum degree of coverage. The accuracy of the proposed algorithm is verified via simulations.

Original languageEnglish
Title of host publication2012 IEEE Wireless Communications and Networking Conference, WCNC 2012
Pages1737-1742
Number of pages6
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 IEEE Wireless Communications and Networking Conference, WCNC 2012 - Paris, France
Duration: 2012 Apr 12012 Apr 4

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

Conference2012 IEEE Wireless Communications and Networking Conference, WCNC 2012
Country/TerritoryFrance
CityParis
Period2012/04/012012/04/04

Keywords

  • Generalized k-Coverage
  • Probabilistic Sensing Model
  • Wireless Sensor Network

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'The generalized k-coverage under probabilistic sensing model in sensor networks'. Together they form a unique fingerprint.

Cite this