1687 search results - page 170 / 338 » On the complexity of scheduling in wireless networks |
173
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
148
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider a high density of sensors randomly placed in a geographical area for event monitoring. The monitoring regions of the sensors may have significant overlap, and a subset...
179
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
152
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
172
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Despite much research in the area of wireless sensor networks in recent years, the programming of sensor nodes is still time-consuming and tedious. A new paradigm which seems to b...