229 search results - page 24 / 46 » A Distributed Greedy Algorithm for Connected Sensor Cover in... |
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
DCOSS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
ADHOCNOW
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...