Ad Hoc网络中的区域划分和资源分配问题的研究

Regional Division and Distribution of Resources about Ad Hoc Network

针对Ad Hoc网络中的区域划分和资源分配问题,在充分保证不出现通信盲区前提下,分别就有湖泊和无湖泊两种情况建立最优化模型,利用计算机搜索求解得到较为满意的结果;对于网络的抗毁性主要从图论的连通性方面入手,利用最大流量最小割集定理,分别对各划分方式的抗毁性进行讨论,得到Ad Hoc网络的抗毁性较强;通过建立最小最大模型,得到较为节能的区域划分方式及信道安排.

Refer to Ad Hoc Network＇s regional division and the allocation of resources, based on the premise that aims to ensure there is no blind communication area, optimal model are established respectively when there is a lake and no lake, then more satisfactory results are searched by computer. We start mainly with the connectivity of graph theory to study the network＇s invulnerability, and use maximum flow minimum cut sets theorem on each division to discuss invulnerability. Afterwards, the conclusion that the Ad Hoc network invulnerability has been strong is obtained. Finally, through the minimum and maximum model, more energy regional division ways and channel arrangements are obtained.