179 search results - page 14 / 36 » Distributed Graph Layout for Sensor Networks |
105
click to vote
ADHOCNETS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left...
CORR
2010
Springer
14 years 10 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...
108
click to vote
DCOSS
2007
Springer
15 years 3 months ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...
101
click to vote
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
107
click to vote
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...