arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0710.3777cs.ITcs.DMmath.ITmath.PR
收藏

无线中继网络的确定性方法

A Deterministic Approach to Wireless Relay Networks

A. S. Avestimehr, S. N. Diggavi, D. N. C. Tse

摘要:

我们提出了一个确定性的信道模型,捕捉多用户无线通信的几个关键特征。我们考虑一个模型的无线网络与节点连接的这种确定性的信道,并提出了一个确切的表征端到端的能力时,有一个单一的源和一个单一的目的地和任意数量的中继节点。这个结果是有线网络的最大流最小割定理的自然推广。最后,为了说明确定性模型和高斯模型之间的联系,我们看两个例子:单中继信道和钻石网络。我们表明,在这两个例子中的每一个,在相应的确定性模型中的能力实现方案自然地建议在高斯模型中的方案,该方案分别在1位和2位内从割集上界,对于所有的信道增益值。这是两部分论文的第一部分;续集[1]将集中于证明一类确定性网络的最大流最小割定理,我们的模型是其中的一个特例。

英文摘要:

We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact characterization of the end-to-end capacity when there is a single source and a single destination and an arbitrary number of relay nodes. This result is a natural generalization of the max-flow min-cut theorem for wireline networks. Finally to demonstrate the connections between deterministic model and Gaussian model, we look at two examples: the single-relay channel and the diamond network. We show that in each of these two examples, the capacity-achieving scheme in the corresponding deterministic model naturally suggests a scheme in the Gaussian model that is within 1 bit and 2 bit respectively from cut-set upper bound, for all values of the channel gains. This is the first part of a two-part paper; the sequel [1] will focus on the proof of the max-flow min-cut theorem of a class of deterministic networks of which our model is a special case.

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

↑