๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Location-centric storage and query in wireless sensor networks

โœ Scribed by Kai Xing; Xiuzhen Cheng; Jiang Li; Min Song

Publisher
Springer
Year
2009
Tongue
English
Weight
809 KB
Volume
16
Category
Article
ISSN
1022-0038

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Location-unaware coverage in wireless se
Location-unaware coverage in wireless sensor networks
โœ Ossama Younis; Marwan Krunz; Srinivasan Ramasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1018 KB

In scenarios where sensors are placed randomly, redundant deployment is essential for ensuring adequate field coverage. This redundancy needs to be efficiently exploited by periodically selecting a subset of nodes (referred to as a ''cover'') that actively monitor the field, and putting the remainin

Materialized In-Network View for spatial
Materialized In-Network View for spatial aggregation queries in wireless sensor network
โœ Ken C.K. Lee; Baihua Zheng; Wang-Chien Lee; Julian Winter ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 558 KB

Wireless sensor networks composed of battery-powered sensor nodes are invaluable instruments for remote environment sensing. For sensor network applications, sensed readings are often collected in the form of aggregated data from a portion of a sensor network as requested by spatial aggregation quer

LOHD: Location-Oblivious Hybrid data Dif
LOHD: Location-Oblivious Hybrid data Diffusion in wireless sensor networks
โœ Xu Cheng; Feng Wang; Jiangchuan Liu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 333 KB

Data-centric design has been widely adopted in wireless sensor networks thanks to its efficiency, as PUSH and PULL are two common data dissemination algorithms for such networks. The two algorithms work well with only a few sources or a few sinks, respectively. However, when there are many sources a