Sciweavers

385 search results - page 42 / 77
» Contour Approximation in Sensor Networks
Sort
View
AI
2011
Springer
14 years 4 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
CCR
2006
117views more  CCR 2006»
14 years 9 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
WIOPT
2006
IEEE
15 years 3 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
NETWORKING
2007
14 years 11 months ago
Location-Unaware Sensing Range Assignment in Sensor Networks
We study field-monitoring applications in which sensors are deployed in large numbers and the sensing process is expensive. In such applications, nodes should use the minimum poss...
Ossama Younis, Srinivasan Ramasubramanian, Marwan ...
SASO
2008
IEEE
15 years 4 months ago
Self-Adaptive Dissemination of Data in Dynamic Sensor Networks
The distribution of data in large dynamic wireless sensor networks presents a difficult problem due to node mobility, link failures, and traffic congestion. In this paper, we pr...
David Dorsey, Bjorn Jay Carandang, Moshe Kam, Chri...