%0 Journal Article
%A HU Shu-kai
%A YANG Tao
%A ZHOU Mo-miao
%A ZHAO Fei-fei
%T User Matching with Maximum Flow Algorithm for Full-Duplex Small Cells
%D 2020
%R 10.13190/j.jbupt.2020-173
%J Journal of Beijing University of Posts and Telecommunications
%P 82-87
%V 43
%N 6
%X 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.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2020-173