Sciweavers

200 search results - page 21 / 40
» Worst-case lifetime computation of a wireless sensor network...
Sort
View
DCOSS
2006
Springer
14 years 12 days ago
GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
Lujun Jia, Guevara Noubir, Rajmohan Rajaraman, Rav...
TSP
2010
13 years 3 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian
IPPS
2006
IEEE
14 years 2 months ago
Formal modeling and analysis of wireless sensor network algorithms in Real-Time Maude
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
Peter Csaba Ölveczky, Stian Thorvaldsen
DCOSS
2008
Springer
13 years 10 months ago
An In-Field-Maintenance Framework for Wireless Sensor Networks
This paper introduces a framework for in-field-maintenance services for wireless sensor networks. The motivation of this work is driven by an observation that many applications usi...
Qiuhua Cao, John A. Stankovic
MOBIHOC
2002
ACM
14 years 8 months ago
Topology management for sensor networks: exploiting latency and density
In wireless sensor networks, energy efficiency is crucial to achieve satisfactory network lifetime. In order to reduce the energy consumption of a node significantly, its radio ne...
Curt Schurgers, Vlasios Tsiatsis, Saurabh Ganeriwa...