C. Commander, P. Pardalos, V. Ryabchenko and S. Uryasev, “The Wireless Network Jamming Problem,” Journal of Combinatorial Optimization, 2007, pp. 481-498.
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.