Desperate Coverage Problem in Mission-Driven Camera Sensor Networks

Yi Hong,Alade O Tokuta,Junghyun Kim,Deying Li,Donghyun Kim

doi:10.1155/2014/109785

Abstract

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.

Highlights

Thanks to the growing popularity of multimedia applications of wireless sensor networks, camera sensor networks, which are wireless networks of camera sensors, are getting more attention very recently
Our simulation result shows that our algorithm outperforms the target-temporal-maximization-only algorithm in camera sensor network in [5] in terms of the number of the most important targets which are fully covered during the whole mission period
It is expected that the number n of available camera sensor nodes, whose battery lifetime is significantly lower than the mission lifetime L, is greater than the number of m of targets, and we set m as 20, 30, . . ., 70

Summary

Introduction

Thanks to the growing popularity of multimedia applications of wireless sensor networks, camera sensor networks, which are wireless networks of camera sensors, are getting more attention very recently. A shelf inside the warehouse without any item is clearly a less-important target To deal with this situation, we suggest providing full coverage to as many higher priority targets as possible during the mission period while the spatial-temporal coverage over the rest of targets can be maximized. Dependent on NetworkScheduler, the k value is increased or decreased and the whole process is repeated until we finalize k and obtain a schedule which allows the camera sensors to fully cover the most k important targets and the target-temporal coverage is maximized. Our simulation result shows that our algorithm outperforms the target-temporal-maximization-only algorithm in camera sensor network in [5] in terms of the number of the most important targets which are fully covered during the whole mission period.

Related Work

Preliminaries

Formal Definition of DCP-MCSN

Simulation Results and Analysis

Conclusion