arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.2173cs.ITmath.IT
收藏

一维凸蜂窝网络正交接入的最优性

Optimality of Orthogonal Access for One-dimensional Convex Cellular Networks

Hamed Maleki, Syed A. Jafar

摘要:

它示出了一个贪婪的正交接入方案实现的总和自由度的所有一维(沿直线放置的所有节点)凸蜂窝网络(其中细胞是凸区域)时,除了网络拓扑结构的知识,没有信道的知识是可用的发射机。一般来说,正交访问的最优性既不适用于二维凸细胞网络,也不适用于一维非凸细胞网络,从而揭示了一个基本的限制,只有当一维和凸属性同时执行时才存在,这在研究细胞网络的规范信息理论模型中很常见。结果还建立了相应类别的索引编码问题的能力。

英文摘要:

It is shown that a greedy orthogonal access scheme achieves the sum degrees of freedom of all one-dimensional (all nodes placed along a straight line) convex cellular networks (where cells are convex regions) when no channel knowledge is available at the transmitters except the knowledge of the network topology. In general, optimality of orthogonal access holds neither for two-dimensional convex cellular networks nor for one-dimensional non-convex cellular networks, thus revealing a fundamental limitation that exists only when both one-dimensional and convex properties are simultaneously enforced, as is common in canonical information theoretic models for studying cellular networks. The result also establishes the capacity of the corresponding class of index coding problems.

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

↑