Sciweavers

130 search results - page 20 / 26
» Dissemination of compressed historical information in sensor...
Sort
View
SENSYS
2003
ACM
14 years 27 days ago
Model-based compression in wireless ad hoc networks
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
WWW
2007
ACM
14 years 8 months ago
Towards environment generated media: object-participation-type weblog in home sensor network
The environment generated media (EGM) are defined here as being generated from a massive amount of and/or incomprehensible environmental data by compressing them into averages or ...
Takuya Maekawa, Yutaka Yanagisawa, Takeshi Okadome
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 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
IJSNET
2008
126views more  IJSNET 2008»
13 years 7 months ago
Reliable and energy-efficient routing protocol in dense wireless sensor networks
Delivering sensed data to the sink reliably in sensor networks calls for a scalable, energy-efficient, and error-resilient routing solution. In this paper, a reliable energy-effic...
Min Chen, Taekyoung Kwon, Shiwen Mao, Yong Yuan, V...
SENSYS
2003
ACM
14 years 27 days ago
CODA: congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is l...
Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbe...