基于加权公平性的Ad Hoc网络带宽分配

Bandwidth allocation of Ad Hoc networks based on weighted fairness

本文基于已有的带宽管理机制,采用加权公平对竞争的流进行带宽分配。通过该方案,不仅实现了对流的准入控制,以保证每条流的最低信道时间需求,同时,也能动态地调节流所分配的信道时间。另外,该方案也适用于多跳的情况。本文在相同的控制机制下,对最大最小公平性与加权公平这两种分配方案达到的吞吐量和公平系数进行了比较,通过实例说明,在考虑到用户基本需求的同时,提高了网络的吞吐量,实现了效益与公平性的均衡。

It uses the existent mechanism of bandwidth management to allocate the bandwidth for completed flows by weighted fairness. We not only provide admission control to satisfy their minimum channel time requirements, but also adjust their channel time dynamically. In addition, our scheme can be used in multi-hop wireless networks. We compare throughput and fairness index between max-rain fairness and weighted fairness in the same mechanism. The example shows that we can reach more network benefits while considering the users right and the tradeoff in efficiency and fairness.