基于流的AD Hoc网络接入公平性分析与研究  

Analysis and Research of MAC Fairness in Ad Hoc Network Based on Flow

作　　者：曾海文[1] 周满元[2] 唐勇[2] 

机构地区：[1]广西国际商务职业技术学院信息工程系,南宁530007 [2]桂林电子科技大学,广西桂林541004

出　　处：《计算机工程》2011年第2期85-87,共3页Computer Engineering

基　　金：国家博士后基金资助项目(20080440813)

摘　　要：在Ad Hoc网络中,系统的不公平性会严重影响服务质量。针对该问题,提出一种以流为单位、用WFQ机制进行本地信息调度、采用交换节点信息调节退避时间的协调算法——FBFA。该算法计算节点每条流的服务指数,与邻节点进行交换,结合节点本身的信息和邻居节点的信息确定退避时间,提高系统的公平性。实验结果表明,FBFA算法兼顾了系统的局部公平性、全局公平性和吞吐量,系统公平性指数提高10%～20%。In Ad Hoc network, the unfairness of the system will affect the quality of service seriously. This paper presents a mechanism using flow unit and Weighted Fairness Queuing（WFQ） for scheduling local information, and the coordination algorithm that the exchange of node information to adjust the backoff time——Fairness Base Flow Algorithm（FBFA）. The algorithm calculates every flow＇s services index for each node, and exchanges with the neighbor nodes, combining with the node＇s own information and neighbor node information to determine the backoff time to improve the system fairness. Because FBFA algorithm takes into account the system＇s local and global fairness and throughput, experimental results show that system＇s fairness index has 10%-20% increases.

关 键 词：ADHOC网络 FBFA算法 公平性 仿真 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]