1687 search results - page 214 / 338 » On the complexity of scheduling in wireless networks |
159
click to vote
LCN
2005
IEEE
16 years 17 hour ago
2005
IEEE
Generally, current network management technologies follow two approaches: ITU-T’s recommendations for Telecommunication Management Network (TMN) and IETF’s Simple Network Mana...
191
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
222
click to vote
JSAC
2010
15 years 1 months ago
2010
The capabilities of sensor networking devices are increasing at a rapid pace. It is therefore not impractical to assume that future sensing operations will involve real time (inela...
182
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Many embedded control systems comprise several control loops that are closed over a network of computation nodes. In such systems, complex timing behavior and communication lead t...
160
click to vote
CLUSTER
2008
IEEE
16 years 27 days ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...