Maximal lifetime scheduling in sensor surveillance networks

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.

[1]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[2]  Richard A. Brualdi,et al.  Combinatorial matrix theory , 1991 .

[3]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  Qun Li,et al.  Global Clock Synchronization in Sensor Networks , 2006, IEEE Trans. Computers.

[6]  Anantha Chandrakasan,et al.  Upper bounds on the lifetime of sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[7]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[8]  Deborah Estrin,et al.  Residual energy scan for monitoring sensor networks , 2002, 2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609).

[9]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[10]  D. West.  Introduction to Graph Theory , 1995 .

[11]  Kay Römer.  Time synchronization in ad hoc networks , 2001, MobiHoc '01.

[12]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

[13]  S. Eisenman,et al.  Sensor Networks , 2002 .

[14]  Tian He,et al.  Differentiated surveillance for sensor networks , 2003, SenSys '03.

[15]  Deborah Estrin,et al.  Residual Energy Scans for Monitoring Wireless Sensor Networks , 2002 .

[16]  Mingyan Liu,et al.  A distributed monitoring mechanism for wireless sensor networks , 2002, WiSE '02.

[17]  Antonio Alfredo Ferreira Loureiro,et al.  Scheduling nodes in wireless sensor networks: a Voronoi approach , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..