1783 search results - page 239 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
135
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— We study transmission schemes for lifetime maximization in wireless sensor networks. Specifically we consider the network where all the sensors observe uncorrelated si...
138
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
126
Voted
ESA
2001
Springer
15 years 7 months ago
2001
Springer
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
135
click to vote
WINET
2010
15 years 1 months ago
2010
Abstract. Fault-tolerant communication and energy efficiency are important requirements for future-generation wireless ad hoc networks, which are increasingly being considered also...
136
click to vote
GLOBECOM
2009
IEEE
15 years 23 days ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...