| 注册
首页|期刊导航|数据采集与处理|基于分层聚类和干扰对齐的MIMO链路调度算法

基于分层聚类和干扰对齐的MIMO链路调度算法

熊最 王可人 金虎 钱锋

数据采集与处理2017,Vol.32Issue(1):134-140,7.
数据采集与处理2017,Vol.32Issue(1):134-140,7.DOI:10.16337/j.1004-9037.2017.01.016

基于分层聚类和干扰对齐的MIMO链路调度算法

Novel MIMO Link Scheduling Algorithm Based on Hierarchical Clustering and Interference Alignment

熊最 1王可人 1金虎 1钱锋1

作者信息

  • 1. 电子工程学院通信系,合肥,230037
  • 折叠

摘要

Abstract

The signaling overheads of interference alignment (IA) obtaining global channel state information increase with the number of links.Grouping the links into clusters,within which the interference are processed by IA,becomes an effective method to reduce the overheads.Considering the fact of high computational complexity in the process of link partition,an alternative link partition algorithm based on minimum signal-to-interference-ratio (MinSIR) is proposed.Furthermore,when all the clusters simultaneously transmit in a single timeslot,the signal-to interference-plus-noise-ratio (SINR) at the receivers of several links was insufficient for successful transmission.To solve such a problem,the link scheduling problem was substituted by a novel cluster-based scheduling algorithm using hierarchical clustering.The theoretical analysis and simulation results show that the proposed link partition algorithm obviously reduced the computational complexity,and obtained superiors system throughput.Meanwhile,the clusterbased scheduling algorithm effectively improved the SINR at the receivers of links,which potentially supported the system decision of scheduling scheme for specified performance demand.

关键词

链路调度/干扰对齐/MIMO网络/分层聚类

Key words

MIMO network/interference alignment/MIMO network/hierarchical clustering

分类

信息技术与安全科学

引用本文复制引用

熊最,王可人,金虎,钱锋..基于分层聚类和干扰对齐的MIMO链路调度算法[J].数据采集与处理,2017,32(1):134-140,7.

数据采集与处理

OA北大核心CSCDCSTPCD

1004-9037

访问量0
|
下载量0
段落导航相关论文