.png){kind=icon}
返回
A practical scheme for wireless network operation
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2007.892448.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many problems in wireline networks, it is known that achieving capacity on each link or subnetwork is optimal for the entire network operation. In this paper, we present examples of wireless networks in which decoding and achieving capacity on certain links or subnetworks gives us lower rates than other simple schemes, like forwarding. This implies that the separation of channel and network coding that holds for,many classes of wireline networks does not, in general, hold for wireless networks. Next, we consider Gaussian and erasure wireless networks where nodes are permitted only two possible operations: nodes can either decode what they receive (and then re-encode and transmit the message) or simply forward it. We present a simple greedy algorithm that returns the optimal scheme from the exponential-sized set of possible schemes. This algorithm will go over each node at most once to determine its operation, and hence, is very efficient. We also present a decentralized algorithm whose performance can approach the optimum arbitrarily closely in an iterative fashion.
Keyword:
forward/decode scheme
separation principle
wireless networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
Distributed teleoperation and collaborative environment for robotics E-learning and cooperation
PREAI
分享收藏分享收藏Recommendations For A Revised Nomenclature Of Thyroid Autoantigens And Autoantibodies.png)
Autoimmunity
AutoimmunityIF0
PREAI
分享收藏
查看更多内容