Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Journal of Beijing University of Posts and Telecommunications ›› 2020, Vol. 43 ›› Issue (6): 82-87.doi: 10.13190/j.jbupt.2020-173

• PAPERS • Previous Articles     Next Articles

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

ZHAO Fei-fei1, ZHOU Mo-miao2, HU Shu-kai1, YANG Tao1   

  1. 1. The 38 th Research Institute of China Electronics Technology Group Corporation, Hefei 230088, China;
    2. Anhui Province Key Laboratory of Industry Safety and Emergency Technology, Hefei University of Technology, Hefei 230601, China
  • Received:2020-09-07 Online:2020-12-28 Published:2020-11-30

Abstract: Considering the impact of the inter-user interference on the quality of service (QoS) in full-duplex-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 unit-capacity 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.

Key words: full-duplex, quality of service, user matching, max-flow

CLC Number: