Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
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
Efficient and robust protocols for local detection and propagation in smart dust networks
Mobile Networks and Applications
On Demand Role Assignment for Event-Detection in Sensor Networks
ISCC '06 Proceedings of the 11th IEEE Symposium on Computers and Communications
Energy balanced data propagation in wireless sensor networks
Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
ASAP: An Adaptive Sampling Approach to Data Collection in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
A reactive role assignment for data routing in event-based wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A reliable and data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
A lightweight skeleton construction algorithm for self-organizing sensor networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A scalable and dynamic data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Highly Dynamic Routing Protocol for data aggregation in sensor networks
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
The design space of wireless sensor networks
IEEE Wireless Communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Node clustering in wireless sensor networks: recent developments and deployment challenges
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Large scale dense wireless sensor networks (WSNs) will be increasingly deployed in different classes of applications for accurate monitoring. Due to this high density of nodes, it is very likely that both spatially correlated information and redundant data can be detected by several nearby nodes, which can be exploited to save energy. In this work we consider the problem of constructing a spatial correlation aware dynamic and scalable routing structure for data collection and aggregation in WSNs. Although there are some solutions for data aggregation in WSNs, most of them build their structures based on the order of event occurrence. This can lead to both low quality routing trees and a lack of load balancing support, since the same tree is used throughout the network lifetime. To tackle these challenges we propose a novel algorithm called dYnamic and scalablE tree Aware of Spatial correlaTion (YEAST). Results show that the routing tree built by YEAST provides the best aggregation quality compared with other evaluated algorithms. With YEAST an event can be sensed with 97% accuracy, and 75% of the nodes' residual energy can be saved within the phenomena area when compared with the classical approach for data collection.