69 search results - page 4 / 14 » Guaranteeing Practical Convergence in Algorithms for Sensor ... |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit. The general setting is typically encountered in sens...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We propose a distributed algorithm to detect “cuts” in sensor networks, i.e., the failure of a set of nodes that separates the networks into two or more components. The alg...
GLOBECOM
2007
IEEE
14 years 1 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...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...