认知中继网络的多中继选择方法

将中继协作技术用于认知无线电网络可有效对抗信道衰落,提高频谱利用率,然而如何选择中继协助源节点传输信息是一个亟待解决的问题。该文根据多中继协作时目的节点信噪比的一阶偏导数特征,定义了中继协作效率,设计了基于协作效率的迭代中继选择方案。考虑到认知中继网络的非集中式结构,该文将虚拟计时器引入中继节点,提出了基于迭代中继选择方案的分布式算法,通过各中继基于协作效率的虚拟倒计时及信息交互实现了分布式迭代中继选择。复杂度分析和数值仿真结果表明,该算法复杂度较低,且性能接近最优解。     

中继网络信道分配与中继选择机制

It has been demonstrated that either Channel Allocation (CA) or Relay Selection (RS) can improve the performance in relaying networks separately. However, there is little work concerning their combination in multi-cell uplink scenarios. In this paper, we investigate the issue which considers the CA and RS to optimize the system transmission rate in an uplink scenario, while maintaining the re-source distribution fairness among users. This is first formulated as an optimization problem for a linear cellular system, where the same frequency channels can be reused in different cells. Based on the link and co-channel inter-ference conditions, two low-complexity CA and RS schemes are then proposed with dif-ferent decomposition sequences. Finally, nu-merical results are conducted to verify the effectiveness of the proposed CA and RS methods. Simulations results show that the proposed methods can yield significant im-provements in system performance in terms of average sum rate.     

能量收集全双工中继网络中的中继策略研究

本文针对双跳全双工多中继系统,研究了在中继节点能量受限情况下的中继选择方案。在该文中,中继工作方式为放大转发（Amplify-and-Forward, AF）,且中继通过收集源节点提供的能量来对源节点信息进行转发。整个通信过程分为两阶段,能量收集阶段与信息传输阶段,即采用的是时域分割方案。为了获得较好的性能与复杂度折中,本文分别研究了三种不同的中继选择策略,即最佳中继选择方案和两种次优中继选择方案。针对所提的三种方案,推导分析了其系统中断概率的理论值和下边界,以及系统的有效吞吐量。最后,利用蒙特卡洛仿真验证了理论分析的正确性,且仿真结果表明最佳中继选择方案的性能优于两种次优的中继选择方案,但其实现的复杂度高。      

认知合作中继网络中的最优中继选择策略

认知合作中继通信可以有效提升无线通信网络的性能和频谱效率。在中继节点较多的情况下,最优中继选择是一个有待解决的问题,它是中继探测成本与合作通信的分集增益之间的一个折中。基于有限情形的最优停时理论给出了最优中继选择策略,进一步得到一个纯SNR（signal-to-noise ratio,信噪比）阈值结构的策略。数字仿真结果验证了其有效性,在待探测中继较多和每个中继探测成本较高情况下,该最优中继选择策略以最少的探测次数获得最大的收益增益。     

无线中继网络中的物理层网络编码

针对无线中继网络中物理层网络编码技术的应用,分析验证了其所带来可观的吞吐量性能提升。总结了当前物理层网络编码技术的相关研究方向,归纳了通信理论研究、信息理论研究和网络理论研究三个方面。介绍了物理层网络编码的关键技术,对物理层网络编码技术在实际信道条件下的性能分析及改进、采用高阶调制时的检测模糊及改进、基于嵌套格码的计算-转发策略和结合缓冲中继协议设计进行了深入探讨。以期放宽物理层网络编码对信道模型的限制,拓展其适用条件,同时在保障通信过程可靠性的前提下充分发挥该技术对通信有效性的提升,从而推进物理层网络编码技术在实际无线中继通信系统中的应用。     

LTE-Advanced异构中继网络研究

文中提出一种LTE-Advanced异构中继网络架构,并设计合理的中继接入/退出机制,确保用户通过中继传输获得通信质量的改善;提出了中继传输用户的切换机制,有效避免切换过程中用户数据在回程链路上重复转发的问题,大大减少了中继切换过程中的网络延时;最后,结合Full Buffer业务模型对该中继系统用Opnet进行仿真分析,证明在加入中继并合理设置中继接入控制阈值后有助于充分发挥中继系统的作用,使系统性能得到极大改善。     

多用户对双向中继网络的中继和用户选择策略

通过对多用户对多个可选中继组成的双向中继网络进行权重二部图建模,并利用信道状态信息合理设计权重,从而将以最大化系统总速率为目标的中继和用户对选择策略问题等效为权重二部图的最大权匹配问题。利用图论最大权匹配算法（匈牙利算法）,提出了最大权匹配选择策略。并进一步同时基于最大权匹配算法和用户对公平性,提出了最大权匹配轮询策略和基于数据序列因子的最大权匹配策略。仿真结果证明,3种策略均提升了系统性能。     

能量收集双向中继网络的中继选择和功率分配

结合能量收集技术,研究了放大转发双向中继网络的系统性能。基于双向中继系统中的两个端到端信噪比平衡准则,推导出了单中继选择情况下信源最优的功率分配方案和中继最优的能量收集比例。仿真结果证明所提方法能够实现最好的系统性能。通过比较发现,能量收集双向中继网络比传统双向中继网络能够实现更高的传输速率。     

协同通信网络中继选择策略研究

本文以协同通信网络中继选择策略为研究对象，通过对协同通信及其中继选择技术基础、单源以及多源多中继网络自适应中继选择策略的分析，试图探索出相对完善的协同通信网络中继选择策略，推动协同通信网络中继系统的理论研究发展。     

Performance benefits of uplink packet relay protocols for cellular-like systems: quantitative analysis

Relaying can replace one transmission over a long distance with several transmissions over shorter distances, and the total transmission power of mobile stations thus can be lower in the case of relaying. As such, the relaying concept and protocols in a cellular environment have been much discussed in the literature recently. We mathematically analyze the idea of uplink relaying schemes, using a simple model that represents their essential functions. In order to simplify our performance analysis, we assume that the originator of a packet sets the maximum number of hops to the base station to be 2. Our results indicate that the performance benefits of relaying are significant     

机会全双工/双向中继策略

传统双向中继（Two-way relaying,TWR）策略在信道和数据速率非对称性条件下性能较差。本文提出一种机会全双工/双向中继策略,提高无线中继系统在信道和数据速率非对称条件下的中断概率性能。以最优中断概率为准则,将机会全双工/双向中继策略建模为传输时间分配问题,给出了机会全双工/双向中继策略最优时间资源和中继功率分配方案。仿真结果表明,与传统的全双工中继（Full-duplex relaying,FDR）和双向中继（TWR）比较,所提策略能够获得更好的中断概率性能。      

Hybrid Digital-Analog Relaying for Cooperative Transmission Over Slow Fading Channels

Hybrid digital-analog coding schemes have been proposed in source-channel coding to increase the robustness toward channel mismatch, in the absence of transmitter channel state information (CSIT). Recognizing that the same kind of robustness is needed at the relay in a three-node relay network, we propose several novel relaying protocols based on hybrid digital-analog transmission. We compare the performance of the new schemes with traditional digital-only (decode-and-forward or compress-and-forward) or analog-only (amplify-and-forward) relaying, as well as to performance bounds corresponding to genie-aided compress-and-forward relaying. Our new protocols achieve significant gains in terms of achievable expected rates, and they are able to close in on the performance bounds. In particular, we conclude that the best overall performance is obtained by an adaptive combination of decode-and-forward and hybrid digital-analog relaying.      

On the error performance of network-coded error-prone DF-relaying in multiple access relay channel

This paper deals with bit error performance analysis of network-coded (NC) multiple access relay channels that operate in the decode and forward mode with error-prone relaying under quasi-static Rayleigh fading channels. It shows that the combination of channel coding and NC relaying can be regarded as a distributed coding scheme (DCS) if the error propagation problem is adequately addressed. For this purpose, methods based on NC soft information relaying (NC-SIR) and NC hard information relaying (NC-HIR) are investigated. In the framework of NC-SIR, the recently proposed Rayleigh-Gaussian log-likelihood-ratio-based Model is used for modelling the soft estimated symbols at the output of the relay soft encoder. The resulting scheme is referred to as NC-SIR-DCS. On the other hand, two NC-HIR-based schemes are studied and analyzed. The first employs automatic repeat request (ARQ) protocols between the relay node and each source node to ensure error-free propagation and is referred to as NC-ARQ-DCS, while the second performs a limiter function at the destination during iterative decoding as introduced in Thobaben (1) distributed and is referred to as NC-LFD-DCS. The SNR of the one-hop link, the equivalent to the sources-relay-destination links, is estimated in the case of NC-SIR-DCS and is lower bounded in the case of NC-LFD-DCS, while in the case of NC-ARQ-DCS, the average SNR cost per information bit due to the ARQ protocol is estimated. These processes allow tractable analysis of the bit error rate performances of the presented network-coded DCSs. Simulation results are carried out to assess the accuracy of the proposed bounds for different relay positions between source nodes and destination.     

Adaptive Path Selection Scheme with Combining for Multiple Relaying Cooperative Communications Networks

In future communications, cooperative communications with relay networks will be one of the most effective schemes to enlarge the coverage area and to boost the data rate. In the recent research results, the path selection, power allocation, and relay protocols on relay networks are the most important factors to improve the system performance. However, the channel quality of the direct transmission path and the relaying path has an influential effect on the performance of relay networks. Therefore, in this paper, we propose a best relaying path selection (BRPS) scheme to obtain the path diversity to improve the system capacity and data rate for cooperative networks (CNs). Simulation results show that the more the relay nodes are selected, the lower the bit error rate (BER) is. The proposed BRPS scheme obtains a high concession between both BER and system capacity for CNs.     

物理层网络编码机会中继及中断性能分析

该文研究了频率非选择性瑞利衰落信道中的物理层网络编码系统容量问题。基于放大转发机制提出了一种基于最大最小互信息准则的机会中继策略。在瑞利衰落信道环境下,从双向通信的角度,通过理论分析得出其中断概率解析式,同时推导了理想物理层网络编码和传统直接传输系统的中断概率解析式。通过理论分析,发现在某些节点发射功率条件下,系统中断概率将完全取决于单向链路。在此基础上完成了数值仿真实验,结果表明所提策略的中断性能与理想物理层网络编码和传统直接传输相比有了显著的提高。     

Performance analysis of cooperative spectrum sharing using non‐orthogonal multiple access

This paper presents a cooperative spectrum sharing protocol using non‐orthogonal multiple access in cognitive radio networks. A 2‐phase protocol comprising of a primary transmitter‐receiver pair and a secondary transmitter‐receiver pair is considered. In the proposed protocol, 3 data symbols can be transmitted during the 2 phases; this is unlike the traditional decode‐and‐forward relaying where 1 data symbol can be transmitted and the conventional superposition coding–based overlay spectrum sharing and the cooperative relaying system using non‐orthogonal multiple access where 2 data symbols can be transmitted, under a single‐relay scenario. We have investigated performance of our proposed protocol in terms of ergodic sum capacity and outage probability along with analytical derivations over independent Rayleigh fading channels. We also compared our proposed protocol with the traditional decode‐and‐forward relaying, conventional superposition coding–based overlay spectrum sharing, and the cooperative relaying system using non‐orthogonal multiple access schemes to demonstrate efficacy of the proposed protocol. The simulation and analytical results are presented to confirm efficiency of the proposed spectrum sharing protocol.     

Modeling iCAR via Multi-Dimensional Markov Chains

iCAR is a new wireless system architecture based on the integration of cellular and modern ad hoc relaying technologies. It addresses the congestion problem due to limited channel access in a cellular system and provides interoperability for heterogeneous networks. The iCAR system can efficiently balance traffic loads and share channel resource between cells by using ad hoc relaying stations (ARS) to relay traffic from one cell to another dynamically. Analyzing the performance of iCAR is nontrivial as the classic Erlang-B formula no longer applies when relaying is used. In this paper, we build multi-dimensional Markov chains to analyze the performance of the iCAR system in terms of the call blocking probability. In particular, we develop an approximate model as well as an accurate model. While it can be time-consuming and tedious to obtain the solutions of the accurate model, the approximate model yields analytical results that are close to the simulation results we obtained previously. Our results show that with a limited number of ARSs, the call blocking probability in a congested cell as well as the overall system can be reduced.     

Time and power scheduling in an ad hoc network with bidirectional relaying and network coding

Network coding (NC) is a technique that allows intermediate nodes to combine the received packets from multiple links and forwarded to subsequent nodes. Compared with pure relaying, using NC in a wireless network, one can potentially improve the network throughput, but it increases the complexity of resource allocations as the quality of one transmission is often affected by the transmission conditions of multiple links. In this paper, we consider an ad hoc network, where all the links have bidirectional communications, and a relay node forwards traffic between the source and the destination nodes using NC. All transmissions share the same frequency channel, and simultaneous transmissions cause interference to each other. We consider both digital NC and analog NC strategies, referred to as DNC and ANC, respectively, and schedule transmission time and power of the nodes in order to maximize the overall network throughput. For DNC, an optimum scheduling is formulated and solved by assuming that a central controller is available to collect all the link gain information and make the scheduling decisions. Distributed scheduling schemes are proposed for networks using DNC and ANC. Our results indicate that the proposed scheduling scheme for DNC achieves higher throughput than pure relaying, and the scheduling scheme for ANC can achieve higher throughput than both DNC and pure relaying under certain conditions. Copyright © 2013 John Wiley & Sons, Ltd.     

Performance analysis of amplify-and-forward relaying with hybrid-ARQ in Rayleigh fading channels

Hybrid automatic repeat request (HARQ) is a well-known technique for improving system throughput and link performance of wireless communication systems, including cooperative communication systems. The amplify-and-forward (AF) relaying method is one of the most attractive cooperative diversity schemes because of its low complexity. In this article, the end-to-end performance in terms of block error rate (BLER) and normalized throughput of AF relaying with HARQ transmission under the Rayleigh fading channel is analyzed. Numerical results validate the proposed analysis and demonstrate the gain of HARQ schemes in AF relaying systems. This analytical method can be extended to the systems with other HARQ protocols and other cooperative relaying schemes.