Sciweavers

44 search results - page 9 / 9
» A probabilistic voting-based filtering scheme in wireless se...
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
MOBICOM
2004
ACM
13 years 11 months ago
Localization for mobile sensor networks
Many sensor network applications require location awareness, but it is often too expensive to include a GPS receiver in a sensor network node. Hence, localization schemes for sens...
Lingxuan Hu, David Evans
TMC
2010
138views more  TMC 2010»
13 years 3 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
WICON
2008
13 years 6 months ago
Risk-aware beacon scheduling for tree-based ZigBee/IEEE 802.15.4 wireless networks
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...
Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami