Sciweavers

58 search results - page 8 / 12
» Compressing Historical Information in Sensor Networks
Sort
View
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
PERCOM
2010
ACM
13 years 6 months ago
Connectivity monitoring in wireless sensor networks
Connectivity monitoring is useful in practical deployment of wireless sensor network. In order to understand the behavior and performance bottleneck, knowledge of the network conn...
Mingze Zhang, Mun Choon Chan, Akkihebbal L. Ananda
ICNP
2009
IEEE
13 years 5 months ago
Memory Efficient Protocols for Detecting Node Replication Attacks in Wireless Sensor Networks
Sensor networks deployed in hostile areas are subject to node replication attacks, in which an adversary compromises a few sensors, extracts the security keys, and clones them in a...
Ming Zhang, Vishal Khanapure, Shigang Chen, Xuelia...
DMSN
2006
ACM
14 years 1 months ago
Intelligent system monitoring on large clusters
Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon,...
Jimeng Sun, Evan Hoke, John D. Strunk, Gregory R. ...
INFOCOM
2008
IEEE
14 years 2 months ago
Snoogle: A Search Engine for the Physical World
—Hardware advances will allow us to embed small devices into everyday objects such as toasters and coffee mugs, thus naturally form a wireless object network that connects the ob...
Haodong Wang, Chiu Chiang Tan, Qun Li