Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
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
Continuous queries over data streams
ACM SIGMOD Record
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Issues in data stream management
ACM SIGMOD Record
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
A secure hierarchical model for sensor network
ACM SIGMOD Record
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
HIPaG: An energy-efficient in-network join for distributed condition tables in sensor networks
Journal of Systems and Software
Towards in-network data prediction in wireless sensor networks
Proceedings of the 2010 ACM Symposium on Applied Computing
Proceedings of the 2010 ACM Symposium on Applied Computing
SNEE: a query processor for wireless sensor networks
Distributed and Parallel Databases
Energy-efficient query management scheme for a wireless sensor database system
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Processing continuous top-k data collection queries in lifetime-constrained wireless sensor networks
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A framework for processing complex queries in wireless sensor networks
ACM SIGAPP Applied Computing Review
Compression in wireless sensor networks: A survey and comparative evaluation
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
A wireless sensor network (WSN) is composed of tens or hundreds of spatially distributed autonomous nodes, called sensors. Sensors are devices used to collect data from the environment related to the detection or measurement of physical phenomena. In fact, a WSN consists of groups of sensors where each group is responsible for providing information about one or more physical phenomena (e.g., group for collecting temperature data). Sensors are limited in power, computational capacity, and memory. Therefore, a query engine and query operators for processing queries in WSNs should be able to handle resource limitations such as memory and battery life. Adaptability has been explored as an alternative approach when dealing with these conditions. Adaptive query operators (algorithms) can adjust their behavior in response to specific events that take place during data processing. In this paper, we propose an adaptive in-network aggregation operator for query processing in sensor nodes of a WSN, called ADAGA (ADaptive AGgregation Algorithm for sensor networks). The ADAGA adapts its behavior according to memory and energy usage by dynamically adjusting data-collection and data-sending time intervals. ADAGA can correctly aggregate data in WSNs with packet replication. Moreover, ADAGA is able to predict non-performed detection values by analyzing collected values. Thus, ADAGA is able to produce results as close as possible to real results (obtained when no resource constraint is faced). The results obtained through experiments prove the efficiency of ADAGA.