点击次数：

发表时间：2022-10-10

发表刊物：大连理工大学学报

所属单位：软件学院

期号：1

页面范围：41-49

ISSN号：1000-8608

摘要：In Ad Hoc network, nodes compete channels to communicate. It is likely to cause fairness problems if the selection strategy of collision window value is unreasonable. With the analyses of the implementation mechanisms of existing typical fairness algorithms, a concept of channel occupancy rate is raised. Based on this concept, an adaptive fairness algorithm for Ad Hoc network is proposed. The network correspondence is classified into four types according to the history of correspondence and the relationship between the current channel occupancy rate and the ideal channel occupancy rate. In each type, the collision window value of node is set dynamically based on the current network load. Simulation results show that the proposed algorithm performs well under various load conditions. It can significantly improve fairness of channel access among nodes as well as throughput, so it is better than BEB, MILD, MIMD and NAVB algorithms. ? 2016, Editorial Office of Journal of Dalian University of Technology. All right reserved.

备注：新增回溯数据