Random Distribution for Data Survival in Unattended Wireless Sensor Networks

In Unattended Wireless Sensor Networks, data are stored locally and wait for a sink to offload. Since there is no real time communication between the sensors and the sink, a powerful mobile adversary can corrupt the collected data between the sink visits. In this paper, we propose simple and effective algorithms to limit data corruption in homogeneous unattended wireless sensor networks, without implementing cryptography. The key feature of our algorithms is to randomly distribute the data. We evaluate their performance using numerical simulation. The proposed algorithms successfully defeat the adversary objectives even when it has enough energy and time to corrupt all the nodes in the entire network.