Minimum Incremental k-Coverage in Ad-Hoc Sensor Network

Abstract:

Article Preview

The deployment is one of the stage while creating a wireless sensor network. A deployment may not reach some requirements for sustained and reliable operations, even though some redundant sensors are deployed. Improving the deployment by adding some sensors is an efficient way, which is treated as the incremental deployment problem. A problem named Minimum Incremental k-Coverage in a two-dimensional continuous space is formulated. Some definitions and theorems of coverage and adding target positions are derived. A heuristic approach to this problem is proposed and its performance is evaluated through extensive simulation-based experiments.

Info:

Periodical:

Advanced Materials Research (Volumes 271-273)

Edited by:

Junqiao Xiong

Pages:

377-382

DOI:

10.4028/www.scientific.net/AMR.271-273.377

Citation:

S. Wei and W. Z. Ni, "Minimum Incremental k-Coverage in Ad-Hoc Sensor Network", Advanced Materials Research, Vols. 271-273, pp. 377-382, 2011

Online since:

July 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.