New performance-driven FPGA routing algorithms
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The cougar approach to in-network query processing in sensor networks
ACM SIGMOD Record
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An adaptive energy-efficient MAC protocol for wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Gradient-based routing in sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Effect of overhearing transmissions on energy efficiency in dense sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
A Location-Based Routing Method for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Journal of Parallel and Distributed Computing
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Telos: enabling ultra-low power wireless research
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
X-MAC: a short preamble MAC protocol for duty-cycled wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Structure-Free Data Aggregation in Sensor Networks
IEEE Transactions on Mobile Computing
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
RETRACTED: Impacts of sensor node distributions on coverage in sensor networks
Journal of Parallel and Distributed Computing
Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
International Journal of Sensor Networks
Hi-index | 0.00 |
Data aggregation reduces energy consumption by reducing the number of message transmissions in sensor networks. Effective aggregation requires that event messages be routed along common paths. While existing routing protocols provide many ways to construct the aggregation tree, this opportunistic style of aggregation is usually not optimal. The Minimal Steiner Tree (MST) maximises the possible degree of aggregation, but finding such a tree requires global knowledge of the network, which is not practical in sensor networks. In this paper, we propose the Adaptive Aggregation Tree (AAT) to dynamically transform the structure of the routing tree to improve the efficiency of data aggregation. It adapts to changes in the set of source nodes automatically, and approaches the cost savings of MST without explicit maintenance of an infrastructure. The evaluation results show that AAT reduces the communication energy consumption by 23%, compared to shortest-path tree, and by 31%, compared to GPSR.