无线电网络中的广播传输:路由与网络编码
Broadcast Throughput in Radio Networks: Routing vs. Network Coding
摘要:
网络中的广播吞吐量被定义为当时间趋于无穷大时,每单位时间从给定源到所有其他节点可以发送的消息的平均数量。经典的广播算法将消息视为原子令牌,通过中间结点存储转发消息,将消息从源节点路由到接收节点。相比之下,最近的网络编码方法促使中间结点将消息混合并编码在一起。事实证明,某些有线网络具有渐进的网络编码间隙,即与路由相比,使用网络编码时它们具有渐进更高的广播吞吐量。无线网络是否存在这样的差距一直是一个悬而未决的问题。我们通过研究无线网络模型的广播吞吐量来解决这个问题,该模型已经成为研究无线通信的标准数学模型。我们发现,有一个家庭的无线电网络具有紧密的$Θ(\log \log n)$网络编码间隙,即网络中,通过路由消息可实现的渐近吞吐量是一个$Θ(\log \log n)$因子小于最佳网络编码算法。我们还提供了新的严格的上限和下限,表明在所有网络的$n$节点的渐近最坏情况下的广播吞吐量是$Θ(1 / \log n)$消息,每轮路由和网络编码。
英文摘要:
The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as atomic tokens and route them from the source to the receivers by making intermediate nodes store and forward messages. The more recent network coding approach, in contrast, prompts intermediate nodes to mix and code together messages. It has been shown that certain wired networks have an asymptotic network coding gap, that is, they have asymptotically higher broadcast throughput when using network coding compared to routing. Whether such a gap exists for wireless networks has been an open question of great interest. We approach this question by studying the broadcast throughput of the radio network model which has been a standard mathematical model to study wireless communication. We show that there is a family of radio networks with a tight $Θ(\log \log n)$ network coding gap, that is, networks in which the asymptotic throughput achievable via routing messages is a $Θ(\log \log n)$ factor smaller than that of the optimal network coding algorithm. We also provide new tight upper and lower bounds that show that the asymptotic worst-case broadcast throughput over all networks with $n$ nodes is $Θ(1 / \log n)$ messages-per-round for both routing and network coding.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。