Sciweavers

121 search results - page 20 / 25
» Routing Explicit Side Information for Data Compression in Wi...
Sort
View
SASN
2006
ACM
15 years 9 months ago
Attack-resilient hierarchical data aggregation in sensor networks
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...
Sankardas Roy, Sanjeev Setia, Sushil Jajodia
IWNAS
2006
IEEE
15 years 9 months ago
Hint-based Routing in WSNs using Scope Decay Bloom Filters
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...
Xiuqi Li, Jie Wu, Jun (Jim) Xu
INFOCOM
2012
IEEE
13 years 5 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
ACMSE
2010
ACM
15 years 1 months ago
Dissemination and presentation of high resolution air pollution data from mobile sensor nodes
This paper presents the framework of a mobile air quality monitoring network, with an in-depth discussion of several new innovative techniques for web-based visualization. These t...
Will Hedgecock, Péter Völgyesi, &Aacut...
177
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 7 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