arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.4035cs.ITcs.NImath.IT
收藏

无线MIMO交换

Wireless MIMO Switching

Fanggang Wang, Soung Chang Liew

摘要:

在一般的切换问题中,切换模式由从一组输入到一组输出的一对一映射组成(即,置换)。我们提出并研究了一种无线交换框架,其中多天线中继负责交换流量之间的一组$N$站。我们将这样的中继称为MIMO开关。通过波束成形和线性检测,MIMO开关控制哪些站连接到哪些站。每个波束成形矩阵实现站之间的置换模式。我们将对应的置换矩阵称为开关矩阵。通过调度一组不同的开关矩阵,可以建立站之间的完全连接。在本文中,我们专注于“公平交换”,其中等量的流量将提供所有$N(N-1)$有序对站。特别是,我们研究如何系统的吞吐量可以最大化。通常,对于大的$N$,可能的开关矩阵的数量(即,排列)是巨大的,使得调度问题在组合上具有挑战性。我们表明,对于N=4和5,只有一个子集的$N-1$开关矩阵需要考虑在调度问题,以实现良好的吞吐量。我们推测,对于大的$N$也是如此。这个猜想,如果有效的话,意味着在实际应用中,公平切换调度不是一个棘手的问题。

英文摘要:

In a generic switching problem, a switching pattern consists of a one-to-one mapping from a set of inputs to a set of outputs (i.e., a permutation). We propose and investigate a wireless switching framework in which a multi-antenna relay is responsible for switching traffic among a set of $N$ stations. We refer to such a relay as a MIMO switch. With beamforming and linear detection, the MIMO switch controls which stations are connected to which stations. Each beamforming matrix realizes a permutation pattern among the stations. We refer to the corresponding permutation matrix as a switch matrix. By scheduling a set of different switch matrices, full connectivity among the stations can be established. In this paper, we focus on "fair switching" in which equal amounts of traffic are to be delivered for all $N(N-1)$ ordered pairs of stations. In particular, we investigate how the system throughput can be maximized. In general, for large $N$ the number of possible switch matrices (i.e., permutations) is huge, making the scheduling problem combinatorially challenging. We show that for N=4 and 5, only a subset of $N-1$ switch matrices need to be considered in the scheduling problem to achieve good throughput. We conjecture that this will be the case for large $N$ as well. This conjecture, if valid, implies that for practical purposes, fair-switching scheduling is not an intractable problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑