2732 search results - page 92 / 547 » Fast and Distributed Computation of Schedules in Wireless Ne... |
182
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
150
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
184
click to vote
DCOSS
2006
Springer
15 years 9 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...