基于公平性的无线Mesh网络信道分配策略研究

发布时间：2018-04-16 15:17

本文选题：无线Mesh网络 + 排队论　；参考：《广西大学》2014年硕士论文

【摘要】：目前,无线Mesh网络已经成为了下一代无线网络中一种非常具有应用前景的新型无线组网技术,它可以为用户提供灵活的自适应无线互联网接入,因此很多新兴的网络运营商都在利用各种无线接入技术构建自己的Mesh网络平台。但是,随着无线Mesh网络技术的不断发展,我们将面对很多方面的挑战,比如信道分配、路由算法、网关部署等亟待解决的问题。本文根据无线Mesh网络的特点,以保证无线Mesh网络中不同业务占用信道资源的公平性,避免高优先级业务过度占用信道资源为目标,采用非强占有限优先权的M/M/n/m模型进行建模,然后在此基础上提出有限优先权的信道分配算法,从而保证网络中不同业务之间的信道资源的占用率。本文的研究工作主要有以下几个方面： (1)根据无线Mesh网络的多跳性特征,简单的M/M/1排队论模型不足以描述Mesh网络的性能。本文提出了面向无线Mesh网络的非强占有限优先权M/M/n/m排队论模型,通过区别不同业务的流量,兼顾考虑了不同优先级业务的公平性,以解决高优先级业务长期霸占网络资源而低优先级业务迟迟得不到服务的问题。通过设置合理的参数,利用Matlab进行仿真实验,验证本文提出模型的正确性。实验结果表明,本文提出的模型可以使两种业务都能实现合理的资源分配,保证了公平性。 (2)基于802.11e EDCA协议,提出一种基于公平性的信道分配算法。该算法把信道占用时间比作为判断业务优先级的标准,根据当前网络的状态,动态地调整每个优先级业务的优先级和信道占用情况；通过适当限制高优先级业务对信道资源的占用,确保在网络负载较大时,低优先级业务也拥有一定的信道资源占用率。 (3)对提出的基于公平性的的信道分配算法在实验平台上进行验证,并对得到的结果进行分析。理论数据和实验数据表明,本文构建的模型是正确合理的,提出的信道分配算法是有效的,算法在保证了吞吐量不变得情况下,提高了不同业务之间的公平性。论文的研究工作与成果,为无线Mesh网络中如何保障不同优先级业务的公平性、有限优先权的信道分配等方面提供了新的研究思路和方法,研究成果具有科学意义和学术价值。
[Abstract]:At present, wireless Mesh network has become a new wireless networking technology with great application prospect in the next generation wireless network. It can provide flexible adaptive wireless Internet access for users.Therefore, many new network operators are using a variety of wireless access technology to build their own Mesh network platform.However, with the continuous development of wireless Mesh network technology, we will face many challenges, such as channel allocation, routing algorithm, gateway deployment and other issues to be solved.According to the characteristics of wireless Mesh networks, this paper aims at ensuring the fairness of different traffic occupying channel resources in wireless Mesh networks and avoiding the excessive occupation of channel resources by high-priority services. The M/M/n/m model with non-preemptive limited priority is used to model the model.Then a channel allocation algorithm with limited priority is proposed to ensure the utilization of channel resources between different traffic in the network.The research work of this paper mainly includes the following aspects:1) according to the multi-hop characteristics of wireless Mesh networks, the simple M/M/1 queuing theory model is not sufficient to describe the performance of Mesh networks.In this paper, a non-preemptive finite priority M/M/n/m queuing model for wireless Mesh networks is proposed. By differentiating the traffic of different traffic, the fairness of different priority services is considered.In order to solve the problem of long-term occupation of network resources by high-priority services and delay of low-priority services.By setting reasonable parameters and using Matlab to carry out simulation experiments, the correctness of the proposed model is verified.Experimental results show that the proposed model can achieve reasonable resource allocation for both services and ensure fairness.Based on 802.11e EDCA protocol, a channel assignment algorithm based on fairness is proposed.In this algorithm, the channel occupancy ratio is regarded as the criterion for judging the priority of traffic, and the priority and channel occupancy of each priority service are dynamically adjusted according to the status of the current network.By appropriately limiting the occupation of channel resources by high-priority services, it is ensured that when the network load is high, the low-priority services also have certain channel resource occupancy.3) the proposed fairness based channel allocation algorithm is verified on the experimental platform, and the results obtained are analyzed.The theoretical data and experimental data show that the proposed model is correct and reasonable, and the proposed channel allocation algorithm is effective.The research work and results of this paper provide new research ideas and methods for how to ensure the fairness of different priority services and channel allocation of limited priority in wireless Mesh networks. The research results have scientific significance and academic value.
【学位授予单位】：广西大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5

【参考文献】