Sciweavers

657 search results - page 86 / 132
» Polynomial Time Algorithms for Minimum Energy Scheduling
Sort
View
IMCSIT
2010
14 years 9 months ago
Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
Krzysztof Krzywdzinski
INFOCOM
2011
IEEE
14 years 3 months ago
Multiple task scheduling for low-duty-cycled wireless sensor networks
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
Shuguang Xiong, Jianzhong Li, Mo Li, Jiliang Wang,...
INFOCOM
2012
IEEE
13 years 2 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
RTSS
2000
IEEE
15 years 3 months ago
Efficient Scheduling of Sporadic, Aperiodic, and Periodic Tasks with Complex Constraints
Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
Damir Isovic, Gerhard Fohler
ALGOSENSORS
2009
Springer
15 years 6 months ago
Near-Optimal Radio Use for Wireless Network Synchronization
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky