arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1202.0119cs.ITcs.NImath.IT
收藏

异构网络中的并行调度:分布式算法与系统容量

Opportunistic Scheduling in Heterogeneous Networks: Distributed Algorithms and System Capacity

Joseph Kampeas, Asaf Cohen, Omer Gurewitz

摘要:

在这项工作中,我们设计和分析新的分布式调度算法的多用户MIMO系统。特别是,我们认为,不需要发送信道状态信息的中央处理单元的算法,也不需要用户之间的通信本身,然而,我们证明他们的性能非常接近的中央控制系统,这是能够调度最强的用户在每个时隙。我们的分析是基于一个新的应用程序的点过程近似。这种新的技术使我们能够检查非均匀的情况下,如非均匀分布的用户,或处理各种QoS的考虑,并给出精确的表达式,这些计划下的系统的容量,解决问题的解析迄今已被打开。可能的应用包括但不限于诸如3GPP LTE的现代4G网络或随机接入协议。

英文摘要:

In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they require communication between the users themselves, yet, we prove their performance closely approximates that of a centrally-controlled system, which is able to schedule the strongest user in each time-slot. Our analysis is based on a novel application of the Point-Process approximation. This novel technique allows us to examine non-homogeneous cases, such as non-identically distributed users, or handling various QoS considerations, and give exact expressions for the capacity of the system under these schemes, solving analytically problems which to date had been open. Possible application include, but are not limited to, modern 4G networks such as 3GPP LTE, or random access protocols.

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

↑