Maximal lifetime scheduling in sensor surveillance networks

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

研究成果: Conference contribution同行評審

105 引文 斯高帕斯(Scopus)


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.

主出版物標題Proceedings - IEEE INFOCOM 2005. The Conference on Computer Communications - 24th Annual Joint Conference of the IEEE Computer and Communications Societies
編輯K. Makki, E. Knightly
出版狀態Published - 7 十月 2005
事件IEEE INFOCOM 2005 - Miami, FL, United States
持續時間: 13 三月 200517 三月 2005


名字Proceedings - IEEE INFOCOM


ConferenceIEEE INFOCOM 2005
國家United States
城市Miami, FL

指紋 深入研究「Maximal lifetime scheduling in sensor surveillance networks」主題。共同形成了獨特的指紋。