1626 search results - page 164 / 326 » Connections in Networks: A Hybrid Approach |
201
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
194
click to vote
ICDCS
2008
IEEE
16 years 27 days ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
192
click to vote
INFOCOM
2005
IEEE
16 years 1 days ago
2005
IEEE
Abstract— Wireless access networks scale by replicating base stations geographically and then allowing mobile clients to seamlessly “hand off” from one station to the next as...
177
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
158
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...