Sciweavers

311 search results - page 45 / 63
» Approximating Barrier Resilience in Wireless Sensor Networks
Sort
View
ICC
2007
IEEE
14 years 2 months ago
PERD: Polynomial-based Event Region Detection in Wireless Sensor Networks
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
Torsha Banerjee, Demin Wang, Bin Xie, Dharma P. Ag...
BROADNETS
2004
IEEE
13 years 11 months ago
Design and Analysis of a Fast Local Clustering Service for Wireless Sensor Networks
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
Murat Demirbas, Anish Arora, Vineet Mittal, Vinod ...
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
14 years 9 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
PERCOM
2007
ACM
14 years 7 months ago
Securing distributed data storage and retrieval in sensor networks
Sensor networks have been an attractive platform for pervasive computing and communication. Due to the lack of physical protection, however, sensor networks are vulnerable to atta...
Nalin Subramanian, Chanjun Yang, Wensheng Zhang
JCO
2008
134views more  JCO 2008»
13 years 7 months ago
On minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...