A Distributed Data Collection Algorithm for Wireless Sensor Networks with Persistent Storage Nodes

TL;DR

This paper introduces a distributed data collection algorithm for wireless sensor networks that uses uniformly distributed storage nodes, enabling accurate data retrieval without relying on network topology or geographic info.

Contribution

The proposed algorithm is topology-independent and leverages storage nodes for reliable data collection, demonstrated through analytical and simulation results.

Findings

High probability of accurate data collection from small storage node sets

Topology independence enhances robustness and scalability

Simulation confirms effectiveness across various network configurations

Abstract

A distributed data collection algorithm to accurately store and forward information obtained by wireless sensor networks is proposed. The proposed algorithm does not depend on the sensor network topology, routing tables, or geographic locations of sensor nodes, but rather makes use of uniformly distributed storage nodes. Analytical and simulation results for this algorithm show that, with high probability, the data disseminated by the sensor nodes can be precisely collected by querying any small set of storage nodes.