J. Jeong, S. Sharafkandi and D. H. C. Du, “Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks,” Proceedings of the 2006 Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks, New York, 2006, pp. 55-64.

has been cited by the following article:

• TITLE: Complexity Results for Wireless Sensor Network Scheduling

  AUTHORS: Fethi Jarray

  KEYWORDS: Discrete Tomography, Sensor Scheduling, Combinatorial Optimization

  JOURNAL NAME: Wireless Sensor Network, Vol.2 No.5, May 27, 2010

  ABSTRACT: We study the problem of scheduling multi sensors to visit and observe a group of sites at discrete time points over a planning horizon of given length. We show that scheduling under a given number of visits for each site and in each period is an NP-complete problem by providing equivalence with a problem in discrete tomography. We also give a polynomial time algorithm to schedule the sensors under a given number of visits in each period.