无线Mesh网中一种基于效用最大化的资源分配方案  

A RESOURCE ALLOCATION SCHEME BASED ON UTILITY MAXIMISATION IN WIRELESS MESH NETWORKS

作　　者：谢慧萍 

机构地区：[1]惠州卫生职业技术学院信息与网络中心,广东惠州516025

出　　处：《计算机应用与软件》2015年第1期327-333,共7页Computer Applications and Software

基　　金：广东省教育部产学研重点项目(2011A090200068);广东省自然科学基金项目(9151009001000043)

摘　　要：许多新一代应用程序(比如视频流)往往为了给终端用户提供高质量服务而对最小数据速率提出要求。针对多跳无线Mesh网络,提出一种干扰和最小速率要求约束下的网络流量效用最大化解决方案。为实现效用最大化,对以下参数进行调节:1)各节点的发射功率;2)为不同通信链路分配的信道。以考虑链路间干扰和干扰的交叉分解技术为基础,算法的输出包括明确各时隙激活哪些链路的安排计划,及这些激活链路相关参数。如果所有网络流量的最低速率要求无法满足,则智能拒绝部分流量,并对剩余流量重新计算资源分配计划。另外,还提出一种访问控制机制,以确保能在满足当前网络流量速率要求的情况下,接纳新的网络流量。仿真实验结果表明,与已有的资源分配算法相比,该算法在不同网络拓扑结构下的性能表现更优。Many next generation applications （such as video flows） usually ask minimum data rate in order to provide high quality of services for end-users. In this paper, we present a solution of traffic flows utility maximisation with the constraints of both the interference and minimum rate requirement in light of the multi-hop wireless Mesh networks. The parameters tuned for maximising the utility are （i） the transmitting powers of individual nodes and （ii） the channels assigned to different communication links. Our algorithm is based on taking both the inter-flow interference and the cross-decomposition technique of interference into account. The output of the algorithm includes an arrangement schedule that dictates what links are to be activated in each slot and the parameters associated with each of these links. If the minimum rate constraint cannot be satisfied for all of the network flows, the algorithm will intelligently reject partial flows and re-compute a resource allocation schedule for remaining flows. In addition, we also design an admission control mechanism that determines the new flows can be admitted without violating the rate requirement of existing flows in the network. Simulation experimental results show that, the performance of the proposed scheme is better than the existing resource allocation scheme under different network topologies.

关 键 词：无线MESH网络 资源分配 效用最大化 交叉分解 访问控制 

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