Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
A Balance Storage Nodes Assignment for Wireless Sensor Networks
verfasst von : Zhigang Li, Geming Xia, Weiwei Chen, Qing Li
Erschienen in: Wireless Algorithms, Systems, and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.