A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
—In this paper, we are interested in minimizing the delay and maximizing the lifetime of event-driven wireless sensor networks, for which events occur infrequently. In such syste...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...