Realtime dynamic clustering for interference and traffic adaptation in wireless TDD system

Mingliang Tao, Qimei Cui, Xiaofeng Tao, Haihong Xiao
{"title":"Realtime dynamic clustering for interference and traffic adaptation in wireless TDD system","authors":"Mingliang Tao, Qimei Cui, Xiaofeng Tao, Haihong Xiao","doi":"10.1109/CIPLS.2014.7007171","DOIUrl":null,"url":null,"abstract":"The dynamic time-division duplex (TDD) system is a recently proposed technology that can accommodate downlink (DL)/uplink (UL) traffic asymmetry and sufficiently utilize the spectrum resource. Its feature of sufficiency and flexibility will also induce a more sophisticated interference environment, which is known as interference mitigation and traffic adaptation (IMTA) problem. Clustering is a new idea which has been widely accepted to solve IMTA problem. However, most previous works just took large-scale path loss or coupling loss as criteria of the clustering schemes, thus the throughput performance would be limited by the varying traffic requirements among different small cells within one cluster. In this paper, a realtime dynamic cluster-based IMTA scheme is proposed and evaluated with dense deployment of small cells (SCs). Firstly, a new clustering criterion named Differentiating Metric (DM) is defined. Based on the defined DM value, a DM matrix is formed and further presented by a clustering graph. In the clustering graph, the dynamic clustering strategy is mapped to a MAX N-CUT problem, which is addressed in polynomial time by a proposed heuristic clustering algorithm. Furthermore, the system level simulation results demonstrate a promising improvement on uplink traffic throughput (UTP) in our proposed scheme compared with traditional clustering schemes.","PeriodicalId":325296,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIPLS.2014.7007171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The dynamic time-division duplex (TDD) system is a recently proposed technology that can accommodate downlink (DL)/uplink (UL) traffic asymmetry and sufficiently utilize the spectrum resource. Its feature of sufficiency and flexibility will also induce a more sophisticated interference environment, which is known as interference mitigation and traffic adaptation (IMTA) problem. Clustering is a new idea which has been widely accepted to solve IMTA problem. However, most previous works just took large-scale path loss or coupling loss as criteria of the clustering schemes, thus the throughput performance would be limited by the varying traffic requirements among different small cells within one cluster. In this paper, a realtime dynamic cluster-based IMTA scheme is proposed and evaluated with dense deployment of small cells (SCs). Firstly, a new clustering criterion named Differentiating Metric (DM) is defined. Based on the defined DM value, a DM matrix is formed and further presented by a clustering graph. In the clustering graph, the dynamic clustering strategy is mapped to a MAX N-CUT problem, which is addressed in polynomial time by a proposed heuristic clustering algorithm. Furthermore, the system level simulation results demonstrate a promising improvement on uplink traffic throughput (UTP) in our proposed scheme compared with traditional clustering schemes.
无线TDD系统中实时动态聚类的干扰和业务适应
动态时分双工(TDD)系统是近年来提出的一种能够适应下行链路(DL)/上行链路(UL)业务不对称并充分利用频谱资源的技术。其充分性和灵活性的特点也会导致更复杂的干扰环境,即干扰缓解和交通适应(IMTA)问题。聚类是一种被广泛接受的解决IMTA问题的新思路。然而,以往的研究大多将大规模的路径损耗或耦合损耗作为聚类方案的标准,从而使吞吐量性能受到集群内不同小单元之间不同的流量需求的限制。本文提出了一种基于实时动态集群的IMTA方案,并利用小单元的密集部署对其进行了评估。首先,定义了一种新的聚类准则——微分度量(DM)。根据定义的DM值,形成DM矩阵,并用聚类图进一步表示DM矩阵。在聚类图中,将动态聚类策略映射为一个MAX N-CUT问题,提出的启发式聚类算法在多项式时间内解决该问题。此外,系统级仿真结果表明,与传统的集群方案相比,我们提出的方案在上行流量吞吐量(UTP)方面有很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信