147 search results - page 27 / 30 » Dependable k-coverage algorithms for sensor networks |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
INFOCOM
2000
IEEE
14 years 8 days ago
2000
IEEE
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
GIS
2008
ACM
13 years 9 months ago
2008
ACM
In this paper we study in-network query processing in disconnected mobile environments, where both ad-hoc communication and infrastructure communication are available. Depending o...
DC
2008
13 years 8 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...