全双工小蜂窝中基于最大流算法的用户匹配策略

User Matching with Maximum Flow Algorithm for Full-Duplex Small Cells

在全双工基站使能的新型小蜂窝中,考虑用户间同频干扰对服务质量的影响,提出了一种最大化满意用户对数的上下行用户匹配策略,用于服务质量敏感的各类新型通信业务.首先依据用户的速率需求和其可达的实际传输速率,构造包含所有潜在满意上下行用户对的匹配可行图;再将可行图转化为单位容量网络,并证明单位容量网络的最大流数目即为最大满意用户对数目,最终由最大流路径推导出最优匹配策略.仿真结果表明,所提策略可获得超出最大和速率策略两倍的满意用户对数,且仅具有多项式级的复杂度.

Considering the impact of the inter-user interference on the quality of service(QoS)in fullduplex-enabled small cells,an uplink-downlink user matching strategy was proposed with the goal of maximizing the number of satisfied user pairs.The strategy is applicable to some newborn QoS-sensitive services.Firstly,based on the desired rate and the achievable rate of each user,a feasible graph was established to show all the possible satisfied user pairs.Then,the feasible graph was transformed into a unitcapacity network.The max-flow number of the unit-capacity network was proved to be the maximum number of satisfied user pairs,and the optimal matching strategy can be derived from the max-flow route.Finally,simulations demonstrated that the proposed strategy trebled the number of satisfied user pairs as the max-sum-rate strategy while maintaining polynomial complexity.