Privacy preserving gate counting with collaborative bluetooth scanners
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
Packet-level attestation (PLA): A framework for in-network sensor data reliability
ACM Transactions on Sensor Networks (TOSN)
On effective sampling techniques in host-based intrusion detection in tactical MANET
International Journal of Security and Networks
Robust and dynamic data aggregation in wireless sensor networks: A cross-layer approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Sensor networks have received considerable attention in recent years, and are often employed in the applications where data are difficult or expensive to collect. In these applications, in addition to individual sensor readings, statistical aggregates such as Min and Count over the readings of a group of sensor nodes are often needed. To conserve resources for sensor nodes, in-network strategies are adopted to process the aggregates. One primitive in-network aggregation strategy is the tree-based aggregation, where the aggregates are computed from leaves to the root of a spanning tree over a sensor network. However, a shortcoming with the tree-based aggregation is that it is not robust against communication failures, which are common in sensor networks. One of the solutions to overcome this shortcoming is to enable multipath routing, by which each node broadcasts its reading or a partial aggregate to multiple neighbors. However, multipath routing-based aggregation typically suffers from the problem of overcounting sensor readings. In this study, we propose two schemes based on the linear counting technique to deal with the overcounting problem. These two schemes process aggregates by statically and dynamically, respectively, allocating space for the use of the linear counting technique. Both schemes provide the same accuracy guarantee but involve different communication costs. Through extensive experiments with real-world and synthetic data, we demonstrate the efficiency and effectiveness of using these two schemes as solutions for processing aggregates in a sensor network. The experiments also show that the scheme that dynamically allocates the space often outperforms the other one in terms of energy conservation since it requires less space to satisfy an accuracy constraint.