Sciweavers

147 search results - page 11 / 30
» Dependable k-coverage algorithms for sensor networks
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
TROB
2008
128views more  TROB 2008»
13 years 6 months ago
Convergence-Preserving Switching for Topology-Dependent Decentralized Systems
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
Brian Shucker, Todd D. Murphey, John K. Bennett
COMCOM
2007
100views more  COMCOM 2007»
13 years 6 months ago
Sensor replacement using mobile robots
Sensor replacement is important for sensor networks to provide continuous sensing services. Upon sensor node failures, holes (uncovered areas) may appear in the sensing coverage. ...
Yongguo Mei, Changjiu Xian, Saumitra M. Das, Y. Ch...
MSN
2007
Springer
125views Sensor Networks» more  MSN 2007»
14 years 25 days ago
Ensuring Area Coverage in Hybrid Wireless Sensor Networks
Success of Wireless Sensor Networks largely depends whether the deployed network can provide desired coverage with acceptable network lifetime. This paper proposes a distributed pr...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
COMCOM
2006
147views more  COMCOM 2006»
13 years 6 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das