Minimum-hot-spot query trees for wireless sensor networks

Authors:
Georgios Chatzimilioudis;Demetrios Zeinalipour-Yazti;Dimitrios Gunopulos
Affiliations:
University of California, Riverside, CA;University of Cyprus, Nicosia, Cyprus;University of Athens, Greece
Venue:
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Year:
2010

Citing 26
Cited 3

On a scheduling problem where a job can be executed only by a limited number of processors

Computers and Operations Research
Scheduling unit-time jobs on processors with different capabilities

Computers and Operations Research
The &bgr;-assignment problem in general graphs

Computers and Operations Research
PAMAS—power aware multi-access protocol with signalling for ad hoc networks

ACM SIGCOMM Computer Communication Review
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Computer Networking: A Top-Down Approach Featuring the Internet

Computer Networking: A Top-Down Approach Featuring the Internet
Data Gathering Algorithms in Sensor Networks Using Energy Metrics

IEEE Transactions on Parallel and Distributed Systems
Discrete event simulations with J-Sim

PPPJ '02/IRE '02 Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
TCP-probing: towards an error control schema with energy and throughput performance gains

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Habitat monitoring with sensor networks

Communications of the ACM - Wireless sensor networks
Medium access control with coordinated adaptive sleeping for wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Hardware design experiences in ZebraNet

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
TinyDB: an acquisitional query processing system for sensor networks

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Health monitoring of civil infrastructures using wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Microhash: an efficient index structure for fash-based sensor devices

FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Flush: a reliable bulk transport protocol for multihop wireless networks

Proceedings of the 5th international conference on Embedded networked sensor systems
The Rise of People-Centric Sensing

IEEE Internet Computing
Energy efficiency in wireless sensor networks using sleep mode TDMA scheduling

Ad Hoc Networks
Assignment Problems

Assignment Problems
MINT Views: Materialized In-Network Top-k Views in Sensor Networks

MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks

MDM '09 Proceedings of the 2009 Tenth International Conference on Mobile Data Management: Systems, Services and Middleware
On computing compression trees for data collection in wireless sensor networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Tree structure based data gathering for maximum lifetime in wireless sensor networks

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Probability based dynamic load-balancing tree algorithm for wireless sensor networks

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing

Extending query languages for in-network query processing

Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access
A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement

Journal of Computer and System Sciences
DECOR: Distributed construction of load balanced routing trees for many to one sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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-optimally balanced communication tree with minimum overhead. The balancing of the node degrees results in the minimization of packet collisions during query execution, that would otherwise require numerous retransmissions and reduce the lifetime of the network. We compare our simple distributed algorithm against previous work and a centralized solution and show that for most network layouts it outperforms competition and achieves tree balance very close to the centralized algorithm. It also has the smallest energy overhead possible to construct the tree, increasing the lifetime of the network even more.