Sciweavers

Share
381 search results - page 1 / 77
» Minimum-hot-spot query trees for wireless sensor networks
Sort
View
ICC
2007
IEEE
180views Communications» more  ICC 2007»
9 years 2 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
IS
2011
8 years 3 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
MOBIDE
2010
ACM
8 years 8 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
MDM
2009
Springer
149views Communications» more  MDM 2009»
9 years 2 months ago
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
Panayiotis Andreou, A. Pamboris, Demetrios Zeinali...
ICDCN
2009
Springer
9 years 25 days ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
books