147 search results - page 19 / 30 » Dependable k-coverage algorithms for sensor networks |
175
click to vote
SENSYS
2009
ACM
16 years 1 months ago
2009
ACM
Wireless sensor networks have been proposed for many location-dependent applications. In such applications, the requirement of low system cost prohibits many range-based methods f...
199
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
199
click to vote
SP
2005
IEEE
16 years 1 days ago
2005
IEEE
The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze...
193
click to vote
INFOCOM
2005
IEEE
16 years 1 days 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...
147
click to vote
OPODIS
2003
15 years 7 months ago
2003
Dependable properties such as self-stabilization are crucial requirements in sensor networks. One way to achieve these properties is to utilize the vast literature on distributed ...