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

doi:10.13190/j.jbupt.2020-173

北京邮电大学学报 ›› 2020, Vol. 43 ›› Issue (6): 82-87.doi: 10.13190/j.jbupt.2020-173

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

赵飞飞¹, 周墨淼², 胡树楷¹, 杨涛¹

1. 中国电子科技集团公司第38研究所, 合肥 230088;
2. 合肥工业大学工业安全与应急技术安徽省重点实验室, 合肥 230601

收稿日期:2020-09-07 出版日期:2020-12-28 发布日期:2020-11-30
通讯作者: 周墨淼(1991-),男,讲师,硕士生导师,E-mail:mmzhou@hfut.edu.cn. E-mail:mmzhou@hfut.edu.cn
作者简介:赵飞飞(1990-),女,工程师.
基金资助:
国家自然科学基金项目（62001152）；安徽省自然科学基金项目（2008085QF321）；中央高校基本科研业务费专项资金项目（JZ2020HGQA0184，PA2020GDSK0082）

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

ZHAO Fei-fei¹, ZHOU Mo-miao², HU Shu-kai¹, YANG Tao¹

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

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

关键词: 全双工, 服务质量, 用户匹配, 最大流

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

中图分类号:

TN915.02

赵飞飞, 周墨淼, 胡树楷, 杨涛. 全双工小蜂窝中基于最大流算法的用户匹配策略[J]. 北京邮电大学学报, 2020, 43(6): 82-87.

ZHAO Fei-fei, ZHOU Mo-miao, HU Shu-kai, YANG Tao. User Matching with Maximum Flow Algorithm for Full-Duplex Small Cells[J]. Journal of Beijing University of Posts and Telecommunications, 2020, 43(6): 82-87.

参考文献

[1] Narbudowicz A, Ruvio G, Ammann M J, et al. Passive self-interference suppression for single-channel full-duplex operation[J]. IEEE Wireless Communications, 2018, 25(5):64-69.
[2] Li R, Chen Y, Li G Y, et al. Full-duplex cellular networks[J]. IEEE Communications Magazine, 2017, 55(4):184-191.
[3] Silva J M, Fodor G, Fischione C, et al. Spectral efficient and fair user pairing for full-duplex communication in cellular networks[J]. IEEE Transactions on Wireless Communications, 2016, 15(11):7578-7593.
[4] Choi H, Noh W. Outage analysis of user pairing algorithm for full-duplex cellular networks[J]. Wireless Communications and Mobile Computing, 2019:1-12.
[5] Chen L, Zhong C, Lin H, et al. Joint user pairing and power allocation design for heavy loaded full-duplex small cell systems[J]. IEEE Transactions on Vehicular Technology, 2018, 67(9):8989-8993.
[6] 侯蓉晖, 郭素霞. 车联网场景中时延受限内容传输方案[J]. 北京邮电大学学报, 2017, 40(3):85-90. Hou Ronghui, Guo Suxia. Latency-constrained content dissemination scheme in vehicular networks[J]. Journal of Beijing University of Posts and Telecommunications, 2017, 40(3):85-90.
[7] West D B. Introduction to graph theory[M]. Upper Saddle River:Prentice Hall, 2001:135-139.
[8] Even S, Tarjan R E. Network flow and testing graph connectivity[J]. SIAM Journal on Computing, 1975, 4(4):507-518.
[9] Aquilina P, Cirik A C, Ratnarajah T, et al. Weighted sum rate maximization in full-duplex multi-user multi-cell MIMO networks[J]. IEEE Transactions on Communications, 2017, 65(4):1590-1608.
[10] 3GPP Standard TS 34.108. Common test environments for user equipment; conformance testing (release 15), V15.1.0[S].[S.l.]:3GPP, 2019.
[11] Rao X, Lau V K N. Distributed compressive CSIT estimation and feedback for FDD multi-user massive MIMO systems[J]. IEEE Transactions on Signal Processing, 2014, 62(12):3261-3271.

[1]	周理辉肖霖吴法辉杨鼎成王雅鹏. 无人机全双工双向中继的资源及轨迹优化设计[J]. 北京邮电大学学报, 2023, 46(1): 77-83.
[2]	杨灿, 罗涛, 刘颖, 李泽旭, 徐永庆. 面向QoS需求的分簇自组织网络路由算法[J]. 北京邮电大学学报, 2022, 45(1): 1-6.
[3]	陈佩佩, 李陶深, 葛志辉, 方兴. 全双工能量受限中继网络的安全波束成形设计[J]. 北京邮电大学学报, 2020, 43(2): 59-65,79.
[4]	雷维嘉, 李环. 全双工系统中基于神经网络的自干扰消除方案[J]. 北京邮电大学学报, 2020, 43(1): 61-67.
[5]	李强, 鲁昌龙, 曹斌, 张钦宇. 基于网络切片的高频谱效率无线资源管理[J]. 北京邮电大学学报, 2019, 42(4): 50-56.
[6]	唐伦, 赵培培, 赵国繁, 陈前斌. 基于QoS保障的服务功能链动态部署算法[J]. 北京邮电大学学报, 2018, 41(6): 90-96.
[7]	唐瑞春, 方丽华, 庞敏, 许晓伟, 丁香乾. QoS预测机制的个性化云媒体服务选择[J]. 北京邮电大学学报, 2016, 39(6): 42-46.
[8]	徐思雅, 张国翊, 郭少勇, 邱雪松, 孟洛明. 一种认知无线电的智能电网通信业务数据分组调度机制[J]. 北京邮电大学学报, 2015, 38(s1): 15-19.
[9]	谢显中, 王闯, 张森林, 葛振涛. 基于干扰对齐的多用户全双工通信中干扰消除方法[J]. 北京邮电大学学报, 2015, 38(6): 87-92.
[10]	马华, 胡志刚. 客户端上下文感知的Web服务QoS预测方法[J]. 北京邮电大学学报, 2015, 38(4): 91-98.
[11]	师向群, 褚庆昕. 认知无线电具有时延约束的干扰功率分析[J]. 北京邮电大学学报, 2015, 38(3): 130-134.
[12]	汪扬, 曾鹏, 张延宇, Ashish Umre. 智能电网设备层WIA-PA无线网络的维护语义度量[J]. 北京邮电大学学报, 2015, 38(2): 27-32.
[13]	唐伦, 刘益富, 刘青海, 陈前斌. 一种改进IEEE 802.11 DCF的建模与分析[J]. 北京邮电大学学报, 2014, 37(5): 96-99.
[14]	陈雷, 王洪玉. 应用分层编码保障组播系统QoS的高效资源分配[J]. 北京邮电大学学报, 2014, 37(4): 64-68.
[15]	张茂森, 邱智亮, 高雅. 电路与分组混合交换网络及调度机制[J]. 北京邮电大学学报, 2014, 37(1): 62-65,89.

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

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

RichHTML

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价