By Topic

A scheduling algorithm for connected target coverage under probabilistic coverage model

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Chan-Myung Kim ; Lab. of Intell. Networks, Korea Univ. of Technol. & Educ., Cheonan, South Korea ; Yong-hwan Kim ; In-Seok Kang ; Kang-whan Lee
more authors

Connected Target Coverage (CTC) problem [8], covering given targets fully with the deployed sensors and also guaranteeing connectivity to a sink node, is a challenging scheduling problem. In this paper, unlike the existing heuristic algorithms, we adopt the probabilistic coverage model to solve the problem and develop a heuristic algorithm called CWGC-PM (Communication Weighted Greedy Cover-Probabilistic Model) to extend the network lifetime while such coverage and connectivity constraints are satisfied. Simulation results are presented to evaluate the performance of the proposed algorithm and they show that the probabilistic coverage model can capture the diverse sensing characteristics of sensor nodes in the real world.

Published in:

Information Networking (ICOIN), 2012 International Conference on

Date of Conference:

1-3 Feb. 2012