关键词: 无线Mesh网络, 拓扑结构, 最小费用最大流, 最优peer选择, 分块策略

Abstract: This paper establishes an optimal downloading model for heterogeneous wireless mesh networks，and based on the model, the optimal algorithm is proposed in terms of the performance to minimize downloading time and costs of downloading nodes. This paper presents a variable topology different from the traditional tree-graph mixture of overlay network, in order to improve the algorithm’s adaptability and scalability. On this basis, the fastest downloading algorithm is proposed based on minimum cost network flow theory. The algorithm includes the selection strategy of optimal peer nodes and the file’s partition strategy. Simulation results justify the validity of the algorithm. Compared with other algorithms, the algorithm can obtain a minimum downloading time, and at the same time, the node’s downloading cost tends to the optimal solution.

Key words: wireless Mesh network, topological structure, minimum cost maximum flow, optimal peer selection, partition strategy