Sciweavers

42 search results - page 8 / 9
» Probabilistic Analysis of Hierarchical Cluster Protocols for...
Sort
View
TMC
2008
210views more  TMC 2008»
13 years 4 months ago
Adaptive Cluster-Based Data Collection in Sensor Networks with Direct Sink Access
Recently wireless sensor networks featuring direct sink access have been studied as an efficient architecture to gather and process data for numerous applications. In this paper, w...
Mahdi Lotfinezhad, Ben Liang, Elvino S. Sousa
ADHOCNOW
2008
Springer
13 years 11 months ago
Query Dissemination with Predictable Reachability and Energy Usage in Sensor Networks
Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and deve...
Zinaida Benenson, Markus Bestehorn, Erik Buchmann,...
COMCOM
2007
95views more  COMCOM 2007»
13 years 5 months ago
Key management for long-lived sensor networks in hostile environments
Large-scale wireless sensor networks (WSNs) are highly vulnerable to attacks because they consist of numerous resource-constrained devices and communicate via wireless links. Thes...
Michael Chorzempa, Jung Min Park, Mohamed Eltoweis...
ICNP
2003
IEEE
13 years 10 months ago
Data Dissemination with Ring-Based Index for Wireless Sensor Networks
In current sensor networks, sensor nodes are capable of not only measuring real world phenomena, but also storing, processing and transferring these measurements. Many data dissem...
Wensheng Zhang, Guohong Cao, Thomas F. La Porta
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 9 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve