Efficient and Optimally Secure In-Network Aggregation in Wireless Sensor Networks

Abstract

Abstract. In many wireless sensor network applications, the data collection sink (base station) needs to find the aggregated statistics of the network. Readings from sensor nodes are aggregated at intermediate nodes to reduce the communication cost. However, the previous optimally secure in-network aggregation protocols against multiple corrupted nodes require two round-trip communications between each node and the base station, including the result-checking phase whose congestion is O(log n) where n is the total number of sensor nodes. In this paper 1 , we propose an efficient and optimally secure sensor network aggregation protocol against multiple corrupted nodes by a weak adversary. Our protocol achieves one round-trip communication to satisfy optimal security without the result-checking phase, by conducting aggregation along with the verification, based on the idea of TESLA technique. Furthermore, we show that the congestion is constant. This means that our protocol suits large-scale wireless sensor networks.

Efficient and Secure Aggregation of Sensor Data against Multiple Corrupted Nodes

“…This can be accomplished using an arbitrary hash chain traversal algorithm. For our protocol we use the algorithm presented in [27], which requires the computation of 1 2 log 2 links in eahch round and needs to store log 2 links and seeds.…”

Error Prone Transmission System to Resist Data Loss in a Wireless Sensor Network

“…Hamming code can detect only single-bit [7]. However, among the current error control techniques, no one can detect more than eight bit errors in WSN environment (Miyaji et al (2011) [8], Liu et al (2013) [9] and Asaduzzaman et al (2015) [10]). As data overhead for tiny devices in WSN is one of the biggest challenges.…”