Desperate Coverage Problem in Mission-Driven Camera Sensor Networks

Recently, camera sensor network is attracting huge amount of attention due to the growing popularity of multimedia applications. This paper investigates a new scheduling problem in camera sensor network whose goal is to cover a set of targets as efficiently as possible during a given mission period....

Full description

Bibliographic Details
Main Authors: Yi Hong, Junghyun Kim, Donghyun Kim, Deying Li, Alade O. Tokuta
Format: Article
Language:English
Published: Hindawi - SAGE Publishing 2014-04-01
Series:International Journal of Distributed Sensor Networks
Online Access:https://doi.org/10.1155/2014/109785
_version_ 1797721870861074432
author Yi Hong
Junghyun Kim
Donghyun Kim
Deying Li
Alade O. Tokuta
author_facet Yi Hong
Junghyun Kim
Donghyun Kim
Deying Li
Alade O. Tokuta
author_sort Yi Hong
collection DOAJ
description Recently, camera sensor network is attracting huge amount of attention due to the growing popularity of multimedia applications. This paper investigates a new scheduling problem in camera sensor network whose goal is to cover a set of targets as efficiently as possible during a given mission period. In particular, we consider a desperate situation in which we may not have enough camera sensors to cover all of the targets of interest during the mission. The goal of our problem of interest is to schedule the sensors such that (a) the number of the most important targets which are fully covered during the mission period is maximized, and (b) the overall target-temporal coverage which is defined as the gross sum of the weight of each target multiplied by the time period when the target is covered is maximized. We formally introduce the desperate coverage problem in mission-driven camera sensor networks (DCP-MCSN) and propose a new heuristic algorithm for this NP-hard problem. To evaluate the performance of the proposed algorithm, we compare it with a theoretical upper bound. Our simulation result shows that our algorithm performs very close to the upper bound and outperforms the existing alternative.
first_indexed 2024-03-12T09:40:19Z
format Article
id doaj.art-ae6b92e3b51a482a83bf0ee97603a61a
institution Directory Open Access Journal
issn 1550-1477
language English
last_indexed 2024-03-12T09:40:19Z
publishDate 2014-04-01
publisher Hindawi - SAGE Publishing
record_format Article
series International Journal of Distributed Sensor Networks
spelling doaj.art-ae6b92e3b51a482a83bf0ee97603a61a2023-09-02T13:20:35ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772014-04-011010.1155/2014/109785109785Desperate Coverage Problem in Mission-Driven Camera Sensor NetworksYi Hong0Junghyun Kim1Donghyun Kim2Deying Li3Alade O. Tokuta4 Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE and School of Information, Renmin University of China, Beijing 100872, China Department of Mathematics and Physics, North Carolina Central University, Durham, NC 27707, USA Department of Mathematics and Physics, North Carolina Central University, Durham, NC 27707, USA Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE and School of Information, Renmin University of China, Beijing 100872, China Department of Mathematics and Physics, North Carolina Central University, Durham, NC 27707, USARecently, camera sensor network is attracting huge amount of attention due to the growing popularity of multimedia applications. This paper investigates a new scheduling problem in camera sensor network whose goal is to cover a set of targets as efficiently as possible during a given mission period. In particular, we consider a desperate situation in which we may not have enough camera sensors to cover all of the targets of interest during the mission. The goal of our problem of interest is to schedule the sensors such that (a) the number of the most important targets which are fully covered during the mission period is maximized, and (b) the overall target-temporal coverage which is defined as the gross sum of the weight of each target multiplied by the time period when the target is covered is maximized. We formally introduce the desperate coverage problem in mission-driven camera sensor networks (DCP-MCSN) and propose a new heuristic algorithm for this NP-hard problem. To evaluate the performance of the proposed algorithm, we compare it with a theoretical upper bound. Our simulation result shows that our algorithm performs very close to the upper bound and outperforms the existing alternative.https://doi.org/10.1155/2014/109785
spellingShingle Yi Hong
Junghyun Kim
Donghyun Kim
Deying Li
Alade O. Tokuta
Desperate Coverage Problem in Mission-Driven Camera Sensor Networks
International Journal of Distributed Sensor Networks
title Desperate Coverage Problem in Mission-Driven Camera Sensor Networks
title_full Desperate Coverage Problem in Mission-Driven Camera Sensor Networks
title_fullStr Desperate Coverage Problem in Mission-Driven Camera Sensor Networks
title_full_unstemmed Desperate Coverage Problem in Mission-Driven Camera Sensor Networks
title_short Desperate Coverage Problem in Mission-Driven Camera Sensor Networks
title_sort desperate coverage problem in mission driven camera sensor networks
url https://doi.org/10.1155/2014/109785
work_keys_str_mv AT yihong desperatecoverageprobleminmissiondrivencamerasensornetworks
AT junghyunkim desperatecoverageprobleminmissiondrivencamerasensornetworks
AT donghyunkim desperatecoverageprobleminmissiondrivencamerasensornetworks
AT deyingli desperatecoverageprobleminmissiondrivencamerasensornetworks
AT aladeotokuta desperatecoverageprobleminmissiondrivencamerasensornetworks