Author(s)

Fethi Jarray

.

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.

Discrete Tomography, Sensor Scheduling, Combinatorial Optimization

F. Jarray, "Complexity Results for Wireless Sensor Network Scheduling," Wireless Sensor Network, Vol. 2 No. 5, 2010, pp. 343-346. doi: 10.4236/wsn.2010.24045.