Maximal lifetime scheduling in sensor surveillance networks

Hai Liu, Pengjun Wan, Tsì-Uí İk, Xiaohua Jia, Sam Makki, Niki Pissinou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

105 Scopus citations


This paper addresses the maximal lifetime scheduling problem in sensor surveillance networks. Given a set of sensors and targets in a Euclidean plane, a sensor can watch only one target at a time, our task is to schedule sensors to watch targets, such that the lifetime of the surveillance system is maximized, where the lifetime is the duration that all targets are watched. We propose an optimal solution to find the target watching schedule for sensors that achieves the maximal lifetime. Our solution consists of three steps: 1) computing the maximal lifetime of the surveillance system and a workload matrix by using linear programming techniques; 2) decomposing the workload matrix into a sequence of schedule matrices that can achieve the maximal lifetime; 3) obtaining a target watching timetable for each sensor based on the schedule matrices. Simulations have been conducted to study the complexity of our proposed method and to compare with the performance of a greedy method.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
EditorsK. Makki, E. Knightly
Number of pages10
StatePublished - 7 Oct 2005
EventIEEE INFOCOM 2005 - Miami, FL, United States
Duration: 13 Mar 200517 Mar 2005

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X


ConferenceIEEE INFOCOM 2005
CountryUnited States
CityMiami, FL


  • Energy efficiency
  • Lifetime
  • Scheduling
  • Sensor network
  • Surveillance system

Fingerprint Dive into the research topics of 'Maximal lifetime scheduling in sensor surveillance networks'. Together they form a unique fingerprint.

Cite this