Sciweavers

441 search results - page 60 / 89
» Approximate Coverage in Wireless Sensor Networks
Sort
View
INFOSCALE
2009
ACM
15 years 8 months ago
CAWA: Continuous Approximate Where-About Queries
With the current proliferation of wireless networks and mobile device technologies, the management of moving object databases to facilitate queries over these domains has been exte...
Alexander J. Aved, Kien A. Hua, Antoniya Petkova
141
Voted
ICDCS
2006
IEEE
15 years 9 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
SAC
2010
ACM
15 years 10 months ago
A wavelet-based sampling algorithm for wireless sensor networks applications
This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications. The Coiï...
André L. L. de Aquino, Ricardo A. R. Olivei...
TOSN
2010
106views more  TOSN 2010»
15 years 1 months ago
On boundary recognition without location information in wireless sensor networks
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
Olga Saukh, Robert Sauter, Matthias Gauger, Pedro ...
VTC
2008
IEEE
224views Communications» more  VTC 2008»
15 years 9 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang