標題: | Maximizing lifetime of sensor surveillance systems |
作者: | Liu, Hai Jia, Xiaohua Wan, Peng-Jun Yi, Chih-Wei Makki, S. Kami Pissinou, Niki 資訊工程學系 Department of Computer Science |
公開日期: | 1-Apr-2007 |
摘要: | This paper addresses the maximal lifetime scheduling problem in sensor surveillance systems. Given a set of sensors and targets in an area, a sensor can watch only one target at a time, our task is to schedule sensors to watch targets and forward the sensed data to the base station, such that the lifetime of the surveillance system is maximized, where the lifetime is the duration that all targets are watched and all active sensors are connected to the base station. 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 the linear programming technique; 2) decomposing the workload matrix into a sequence of schedule matrices that can achieve the maximal lifetime; and 3) determining the sensor surveillance trees based on the above obtained schedule matrices, which specify the active sensors and the routes to pass sensed data to the base station. This is the first time in the literature that the problem of maximizing lifetime of sensor surveillance systems has been formulated and the optimal solution has been found. |
URI: | http://dx.doi.org/10.1109/TNET.2007.892883 http://hdl.handle.net/11536/10983 |
ISSN: | 1063-6692 |
DOI: | 10.1109/TNET.2007.892883 |
期刊: | IEEE-ACM TRANSACTIONS ON NETWORKING |
Volume: | 15 |
Issue: | 2 |
起始頁: | 334 |
結束頁: | 345 |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.