论文标题
无线功率合作通信网络中的继电器选择,调度和功率控制
Relay Selection, Scheduling and Power Control in Wireless Powered Cooperative Communication Networks
论文作者
论文摘要
继电器节点用于通过帮助信息节点和接入点之间的能量和信息传输来改善能源收集网络的吞吐量,延迟和可靠性性能。先前关于射频能量收集网络的研究仅限于单源单/多继电器网络。在本文中,制定了多个源多个继电器网络的新型关节继电器选择,调度和功率控制问题,目的是最大程度地减少无线功率和信息传输的总持续时间。公式的问题是非凸层混合构成非线性编程问题,被证明是NP-HARD。我们首先为给定继电器选择的调度和功率控制制定子问题。我们提出了一种基于对功率传输时间分配的双层优化的有效最佳算法。然后,对于最佳继电器选择,我们提出了基于最佳的指数时间分支和结合(BB)算法,其中节点与问题特定的下限和上限进行修剪。我们还提供了两种基于BB的启发式方法,以限制从BB节点产生的分支数量以及基于继电器标准的较低复杂性启发式算法。证明所提出的算法的性能胜过传统收获的表现,然后使用同在的方法,在各种网络设置中最高$ 88 \%$ $降低时间表。
Relay nodes are used to improve the throughput, delay and reliability performance of energy harvesting networks by assisting both energy and information transfer between information nodes and access point. Previous studies on radio frequency energy harvesting networks are limited to single source single/multiple relay networks. In this paper, a novel joint relay selection, scheduling and power control problem for multiple source multiple relay network is formulated with the objective of minimizing the total duration of wireless power and information transfer. The formulated problem is non-convex mixed-integer non-linear programming problem, and proven to be NP-hard. We first formulate a sub-problem on scheduling and power control for a given relay selection. We propose an efficient optimal algorithm based on a bi-level optimization over power transfer time allocation. Then, for optimal relay selection, we present optimal exponential-time Branch-and-Bound (BB) based algorithm where the nodes are pruned with problem specific lower and upper bounds. We also provide two BB-based heuristic approaches limiting the number of branches generated from a BB-node, and a relay criterion based lower complexity heuristic algorithm. The performance of the proposed algorithms are demonstrated to outperform conventional harvest-then-cooperate approaches with up to $88\%$ lower schedule length for various network settings.