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

利用物理层能力:具有局部视图的干扰网络中的分布式调度

Leveraging Physical Layer Capabilites: Distributed Scheduling in Interference Networks with Local Views

Pedro E. Santacruz, Vaneet Aggarwal, Ashutosh Sabharwal

摘要:

在大多数无线网络中,节点仅具有关于网络状态的有限的本地信息,其包括连通性和信道状态信息。由于网络的局部信息有限,每个节点的知识不匹配;因此,它们必须做出分布式决策。在本文中,我们提出了以下问题-如果每个节点只有一个小的邻域的网络状态信息,节点应该如何以及何时选择发送?虽然链路调度回答了上述问题的点到点物理层的干扰避免范例的设计,我们寻找答案的情况下,干扰可以被先进的物理层设计,如网络信息论的结果所建议的。为了在这个具有挑战性的问题上取得进展,我们提出了一个建设性的分布式算法,实现速率高于链路调度的基础上避免干扰,特别是如果每个节点知道一个以上的跳的网络状态信息。我们比较我们的新的积极的算法,我们在[1]中提出的保守算法。这两种算法都调度子网络,使得每个子网络可以采用高级干扰拥抱编码方案来实现更高的速率。我们的创新在于子网络的识别、选择和调度,特别是当子网络大于单个链路时。

英文摘要:

In most wireless networks, nodes have only limited local information about the state of the network, which includes connectivity and channel state information. With limited local information about the network, each node's knowledge is mismatched; therefore, they must make distributed decisions. In this paper, we pose the following question - if every node has network state information only about a small neighborhood, how and when should nodes choose to transmit? While link scheduling answers the above question for point-to-point physical layers which are designed for an interference-avoidance paradigm, we look for answers in cases when interference can be embraced by advanced PHY layer design, as suggested by results in network information theory. To make progress on this challenging problem, we propose a constructive distributed algorithm that achieves rates higher than link scheduling based on interference avoidance, especially if each node knows more than one hop of network state information. We compare our new aggressive algorithm to a conservative algorithm we have presented in [1]. Both algorithms schedule sub-networks such that each sub-network can employ advanced interference-embracing coding schemes to achieve higher rates. Our innovation is in the identification, selection and scheduling of sub-networks, especially when sub-networks are larger than a single link.

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

↑