Sciweavers

2190 search results - page 59 / 438
» Distributed algorithms for dynamic coverage in sensor networ...
Sort
View
IPSN
2004
Springer
14 years 1 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...
ATAL
2001
Springer
14 years 6 days ago
Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
COMSWARE
2007
IEEE
14 years 2 months ago
Analysis of Dynamic Sensor Networks: Power Law Then What?
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...
Eric Fleury, Jean-Loup Guillaume, Céline Ro...