This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target
December 2006 (vol. 17 no. 12)
pp. 1526-1536

Abstract—This paper addresses the maximal lifetime scheduling for sensor surveillance systems with K sensors to 1 target. Given a set of sensors and targets in an Euclidean plane, a sensor can watch only one target at a time and a target should be watched by k, k \geq 1, sensors at any time. Our task is to schedule sensors to watch targets and pass data to the base station, such that the lifetime of the surveillance system is maximized, where the lifetime is the duration up to the time when there exists one target that cannot be watched by k sensors or data cannot be forwarded to the base station due to the depletion of energy of the sensor nodes. 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, 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 this scheduling problem of sensor surveillance systems has been formulated and the optimal solution has been found. We illustrate our optimal method by a numeric example and experiments in the end.

[1] M.L. Sichitiu, “Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2004.
[2] Y. Yu, B. Krishnamachari, and V.K. Prasanna, “Energy-Latency Tradeoffs for Data Gathering in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2004.
[3] D. Tian and N.D. Georganas, “A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications, pp. 32-41, 2002.
[4] C.-Y. Chong and S.P. Kumar, “Sensor Networks: Evolution, Opportunities, and Challenges,” Proc. IEEE, pp. 1247-1256, vol. 91, no. 8, Aug. 2003.
[5] R. Gould, Graph Theory. The Benjamin/Cummings Publishing Company, Inc., pp. 198-199, 1988.
[6] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, “TAG: A Tiny AGgregation Service for Ad-Hoc Sensor Networks,” Operating Systems Design and Implementation, Dec. 2002.
[7] R. Diestel, Graph Theory, second ed. Springer, pp. 31-33, 2000.
[8] J. Carle and D. Simplot-Ryl, “Energy-Efficient Area Monitoring for Sensor Networks,” Computer, vol. 37, no. 2, pp. 40-46, Feb. 2004.
[9] L.B. Ruiz et al., “Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach,” Proc. 28th IEEE Conf. Local Computer Networks (LCN '03), pp. 423-429, Oct. 2003.
[10] C.-F. Hsin and M. Liu, “A Distributed Monitoring Mechanism for Wireless Sensor Networks,” Proc. Int'l Conf. Mobile Computing and Networking Proc. ACM Workshop Wireless Security, pp. 57-66, 2002.
[11] Y. Zhao, R. Govindan, and D. Estrin, “Residual Energy Scans for Monitoring Wireless Sensor Networks,” Proc. IEEE Wireless Comm. and Networking Conf., pp. 356-362, 2002.
[12] M. Bhardwaj, T. Garnett, and A. Chandrakasan, “Upper Bounds on the Lifetime of Sensor Networks,” Proc. IEEE Int'l Conf. Comm., pp. 785-790, 2001.
[13] A. Mainwaring, J. Polastre, R. Szewczyk, D. Culler, and J. Anderson, “Wireless Sensor Networks for Habitat Monitoring,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications, pp. 88-97, Sept. 2002.
[14] Q. Li and D. Rus, “Global Clock Synchronization in Sensor Networks,” Proc. IEEE INFOCOM, 2004.
[15] T. Yan, T. He, and J.A. Stankovic, “Differentiated Surveillance for Sensor Networks,” Proc. First Int'l Conf. Embedded Networked Sensor Systems, pp. 51-62, 2003.
[16] T. He et al., “Energy-Efficient Surveillance System Using Wireless Sensor Networks,” Proc. MobiSyS, June 2004.
[17] K. Römer, “Time Synchronization in Ad Hoc Networks,” Proc. ACM MobiHoc, 2001.
[18] R.A. Brualdi and H.J. Ryser, Combinatorial Matrix Theory. Cambridge Univ. Press, pp. 9-10, 1991.
[19] D.B. West, Introduction to Graph Theory, pp. 109-111. Prentice Hall, Inc., 1996.
[20] S. Axler, F.W. Gehring, and K.A. Ribet, Graph Theory, second ed. Springer, 2000.
[21] X. Cheng, G. Xue, and D. Chen, “TPS: A Time-Based Positioning Scheme for Outdoor Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2004.
[22] A. Savvides, C.-C. Han, and M. Srivastava, “Dynamic Fine-grained Localization in Ad-Hoc Networks of Sensors,” Proc. MobiCom '01, pp. 166-179, July 2001.
[23] Z. Zhou, S.R. Das, and H. Gupta, “Connected K-Coverage Problem in Sensor Networks,” Proc. Int'l Conf. Computer Comm. and Networks (ICCCN '04), pp. 373-378, 2004.
[24] X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill, “Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks,” Proc. ACM SenSys, 2003.

Index Terms:
Energy efficiency, lifetime, scheduling, sensor network, surveillance system.
Citation:
Hai Liu, Pengjun Wan, Xiaohua Jia, "Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 12, pp. 1526-1536, Dec. 2006, doi:10.1109/TPDS.2006.175
Usage of this product signifies your acceptance of the Terms of Use.