基于图形理论的Ad Hoc网络容量研究

Study on the Capacity of Ad Hoc Networks Based on the Graph Theory

网络容量是评估无线AdHoc网络性能的重要参数。本文的目的是研究如何使AdHoc网络容量达到最大。文章从一个全新的角度考虑AdHoc网络的建模,核心思想是AdHoc网络节点间的传输具有有限资源(包括带宽、功率等),在同等条件下若能使网络传输消耗资源最小,则网络容量达到最大。建立了资源消耗的线性规划方程,利用图论的方法对问题求解并对算法进行改进,得到相应的路由策略。由仿真试验说明修改后的算法更加高效。

The network capacity is a very important parameter to evaluate the performance of Ad Hoe networks. In this paper, we consider how to obtain the maximum network capacity in Ad Hoe network. We establish the Ad Hoe network model from the novel point of view, whose main idea is that the network capacity can achieve the maximum when the network resources （including bandwidth, power and so on） which are limited during nodes in the network communicate with each other are used up minimally on the same condition, and set up the equation that makes the network resources consumed minimally according to the above idea. The network capacity is resolved by the graph theory and the routing policy is found. At the same time, the algorithm is improved and oroved to be more efficient through the simulation.