GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Reliable Hierarchical Data Storage in Sensor Networks
SSDBM '07 Proceedings of the 19th International Conference on Scientific and Statistical Database Management
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
Historical data storage for large scale sensor networks
Proceedings of the 5th French-Speaking Conference on Mobility and Ubiquity Computing
A Distributed Clustering Algorithm for Voronoi Cell-Based Large Scale Wireless Sensor Network
CMC '10 Proceedings of the 2010 International Conference on Communications and Mobile Computing - Volume 03
| Hi-index | 0.00 |
A balance storage nodes assignment problem is proposed for wireless sensor networks in order to save history data as much as possible when the network cannot connect to the sink node(s). Its aim is to assign storage nodes as evenly as possible to each source node, while it can minimize the storage path cost of the whole network. This problem can be reduced into a classic assignment problem by adding "dummy" source nodes, which is not easy to solve through the existing centric algorithms in sensor networks. Then two algorithms (Random Greedy Algorithm and Voronoi Graph Based Algorithm) are proposed in order to solve this problem. These two algorithms can be implemented distributed for the wireless sensor networks. The simulation implements and compares the performance of these two algorithms. The result shows that the Voronoi Graph Based Algorithm can satisfy the load balance storage for all source nodes and achieve approximate minimal storage path cost of the whole network.