Sciweavers

82 search results - page 16 / 17
» Resilient Coding Algorithms for Sensor Network Data Persiste...
Sort
View
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
CASES
2006
ACM
13 years 11 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
INFOSCALE
2006
ACM
13 years 11 months ago
Simulating non-scanning worms on peer-to-peer networks
Millions of Internet users are using large-scale peerto-peer (P2P) networks to share content files today. Many other mission-critical applications, such as Internet telephony and...
Guanling Chen, Robert S. Gray
SENSYS
2003
ACM
13 years 10 months 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
SASO
2007
IEEE
13 years 11 months ago
e-SAFE: An Extensible, Secure and Fault Tolerant Storage System
With the rapidly falling price of hardware, and increasingly available bandwidth, the storage technology is seeing a paradigm shift from centralized and managed mode to distribute...
Sandip Agarwala, Arnab Paul, Umakishore Ramachandr...