Bounds to Fair Rate Allocation and Communication Strategies in Source/Relay Wireless Networks
Bounds to Fair Rate Allocation and Communication Strategies in Source/Relay Wireless Networks
复制标题
DOI：
10.1109/twc.2013.113013.130481
复制
发表时间：
2014
影响因子：
10.4
通讯作者：
A. Nordio;C. Chiasserini;A. Tarable
中科院分区：
文献类型：
--
作者：
A. Nordio;C. Chiasserini;A. Tarable
我们分析了在网络中节点工作在半双工模式的合作中继策略的可达到的数据速率。节点必须以一定的速率将其数据传送到网关，并且可能具有有限的能量能力，如在能量收集通信网络的情况下。所请求的数据速率和可用的能量能力两者可以从节点到节点而变化。在这样的约束下，我们采取信息理论的方法，并推导出割集的上限，可实现的速率。此外，我们设计了两种不同的沟通策略，每种策略针对不同的目标。前者保证了公平的速率分配给网络节点，但它忽略了他们的能量约束。后者通过满足每个节点的平均功耗要求和提供数据速率分配的公平性来考虑能量约束。我们展示了上述通信策略的性能，突出了它们的有效性，并对系统行为提供了有用的见解。
We analyze the achievable data rate of cooperative relaying strategies in networks where nodes operate in half-duplex mode. Nodes have to deliver their data to a gateway, at a certain rate, and may have limited energy capabilities, as in the case of energy-harvesting communication networks. Both the requested data rate and the available energy capabilities may vary from node to node. Under such constraints, we take an information-theoretic approach and derive cut-set upper bounds to the achievable rate. Furthermore, we devise two kinds of communication strategies, each aiming at a different objective. The former ensures a fair rate allocation to the network nodes, but it neglects their energy constraints. The latter does consider energy constraints by meeting the requirements on the average power consumption at each node and by providing fairness in the data rate allocation. We show the performance of the aforementioned communication strategies, highlighting their effectiveness and providing useful insights on the system behavior.