TAG

swMATH20627MaRDI QIDQ32445FDOQ32445

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=844142

Cited In (53)

• DHC: distributed, hierarchical clustering in sensor networks
• Energy efficient monitoring in sensor networks
• A note on efficient aggregate queries in sensor networks
• Sketching asynchronous data streams over sliding windows
• A state-based model of sensor protocols
• Accurate and precise aggregation counting
• Enforcing availability in failure-aware communicating systems
• From distributed coordination to field calculus and aggregate computing
• Title not available (Why is that?)
• An analytical study of central and in-network data processing for wireless sensor networks
• Adaptive processing of historical spatial range queries in peer-to-peer sensor networks
• Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
• Efficient data reporting in intelligent transportation systems
• Spatially-decaying aggregation over a network
• LiMoSense: live monitoring in dynamic sensor networks
• Scale-free aggregation in sensor networks
• Fault-tolerant aggregation: flow-updating meets mass-distribution
• The price of validity in dynamic networks
• Accuracy vs. Lifetime: Linear sketches for aggregate queries in sensor networks
• Computation in networks of passively mobile finite-state sensors
• Streaming techniques and data aggregation in networks of tiny artefacts
• Type-specialized staged programming with process separation
• SimJava
• Chord
• TinyECC
• Flask
• ns-2
• Pastry
• ANF
• SDEF
• Towards energy-efficient storage placement in large scale sensor networks
• Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
• J-Sim
• SCEL
• Scribble
• Helena
• DEECO
• contigclust
• Chor
• Data-stream-based global event monitoring using pairwise interactions
• Geometric algorithms for sensor networks
• Towards a queueing-based framework for in-network function computation
• Energy efficient randomised communication in unknown AdHoc networks
• The cost of fault tolerance in multi-party communication complexity
• Secure and highly-available aggregation queries in large-scale sensor networks via set sampling
• Practical fault-tolerant data aggregation
• Adaptive holistic scheduling for query processing in sensor networks
• Efficient skyline query processing in wireless sensor networks
• Managing cohort movement of mobile sensors via GPS-free and compass-free node localization
• Summarizing numeric spatial data streams by trend cluster discovery
• Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
• Protelis
• Aggregate query processing in the presence of duplicates in wireless sensor networks

This page was built for software: TAG