Distributed flooding-based storage algorithms for large-scale wireless sensor networks

Authors:
Salah A. Aly;Moustafa Youssef;Hager S. Darwish;Mahmoud Zidan
Affiliations:
Faculty of Computers & Information, Cairo University, Giza, EG;Wireless Intelligent Networks Center, Nile University, Smart Village, EG;Faculty of Computers & Information, Cairo University, Giza, EG;Faculty of Computers & Information, Ain Shams University, Cairo, EG
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 5
Cited 1

LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Sensor Networks

Sensor Networks
Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Growth codes: maximizing sensor network data persistence

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks

IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks

Distributed data collection and storage algorithms for collaborative learning vision sensor devices with applications to pilgrimage

International Journal of Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose distributed storage algorithms for large-scale wireless sensor networks. Assume a wireless sensor network with n nodes that have limited power, memory, and bandwidth. Each node is capable of both sensing and storing data. Such sensor nodes might disappear from the network due to failures or battery depletion. Hence it is desired to design efficient schemes to collect data from these n nodes. We propose two distributed storage algorithms (DSA's) that utilize network flooding to solve this problem. In the first algorithm, DSA-I, we assume that the total number of sensors is known to each sensor in the network. We show that this algorithm is efficient in terms of the encoding and decoding operations. Furthermore, every node utilizes network flooding to disseminate its data throughout the network using a mixing time of approximately O(n). In the second algorithm, DSA-II, we assume that the total number of nodes is not known to every sensor; hence dissemination of the data does not depend on n. The encoding operations in this case take O(Cµ2), where µ is the mean degree of the network graph and C is a system parameter. We evaluate the performance of the proposed algorithms through analysis and simulation. We show that the performance of the proposed algorithms matches the derived theoretical results.