基于跨层机制的最佳协作中继选择及其系统实现

为了获得最佳的协作中继用户,通过推导协作中继传输系统的误符号率,提出了基于放大重传和解码重传下最佳协作中继的选择准则,并结合跨层协作的思想给出了基于MAC层来实现最佳协作中继选择的分布式协议.与此同时,提出了协作分集系统的物理层传输方案,分析了瑞利衰落信道环境下所提方案的系统性能,得到了系统误比特率的闭式解.此外,针对协作中继选择准则和协作分集传输方案的误码性能进行了系统仿真和性能比较,结果表明,所提出的协作中继选择准则明显优于传统中继选择准则,且协作传输方案可以获得明显的分集增益,系统平均误比特率显著下降.     

基于功率分配能量采集的全双工放大转发中继系统

针对三节点放大转发中继系统,研究了基于功率分配能量采集的全双工中继传输方案。在中继配置大规模天线的情况下,提出了三种天线选择方法,并通过合理的假设分别推导了三种天线选择方法的速率的近似闭合表达式,并设计了天线选择模式切换方案。基于三种不同的天线选择方法,该文分析了基于功率分配采集协议中的最优功率分配因子以及不同方案的算法复杂度。最后,通过蒙特卡洛仿真证明了闭合表达式的准确性,并基于发射功率和信道增益分析了三种方案的优缺点。其中在大发射功率的情况下,方案一的性能最优;在小发射功率的情况下,方案二的性能最优;在中等发射功率的情况下,折中的方案三的性能最优。      

协作分集系统中基于注水算法的功率分配方案研究

为了提高协作分集系统的信道容量,该文在多中继节点协作背景下提出了基于注水算法的中继节点功率分配方案。首先,对空时矩阵的列序号提出了一种新的映射方案,该方案能够提升中继节点发射信号间的正交性。对于采用线性正交解码算法的GABBA码,列序号重新排布后能够降低误码率。然后,通过对接收信噪比与中继节点发射功率的分析,针对信道容量最大化问题提出了一种应用注水算法的两步求解方案。该文对瑞利平坦慢衰落信道下采用GABBA码的协作分集系统进行仿真,仿真结果表明,与中继节点发射功率均分方案相比,该文提出的功率分配方案能够提升系统抗误码性能,达到满分集增益NtNr。该文提出的方案在不同的仿真条件下对信道容量均有提升,并且信道容量与min{NtNr}log2M成正比。     

跨小区多跳中继协作通信的无线通信能效优化 *

针对蜂窝网中某一基站处于体眠状态时引起各用户的通信中断问题,提出利用中继协作通信实现跨小区多跳通信的迭代中继选择算法.该算法是在有多个中继节点可为目的节点提供协作中继时,将源节点到目的节点的数据传输分为3个连续时隙,选择满足目的节点信噪比最大化的中继,以协作效率为依据删除协作效率最小的中继节点,从而逐次优化中继选择结果.仿真结果表明,该算法在跨小区多跳的通信过程中,能选择出协作效率最高的中继节点,减少协作中继的数量,可以减少中继对能源不必要的消耗,改善小区内中继协作效率,在多跳的过程中节省源节点的发射功率,从而达到能效优化的目的.     

混合转发协作通信的功率分配方案

为了最大限度地利用移动终端的发射功率,提出了基于中断概率限制的混合转发协作通信功率分配方案。根据目的节点和中继节点的译码情况,选择合适的协作转发方式,充分利用了放大转发(AF)和译码转发(DF)方式的优点。在满足中断概率限制的条件下,采用图形和数值分析的方法,得到了源节点和中继节点的最优功率分配。仿真分析表明,在相同的中断概率限制下,采用的功率分配方案比等功率分配方案消耗的总功率少约2.8 dBm。     

放大转发中继器降低发射功率的选择策略研究

文章针对传统多中继放大转发协作通信网络中所有潜在中继均参与协作,导致系统所需发射功率增加的问题,提出了一种中继节点选择策略。该策略以最小化系统中断概率为目标,引入了中继节点的选择门限,并据此逐一令低于门限的中继节点不参与协作,将其资源重新分配给其他节点,从而降低系统整体所需发射功率。中继节点选择策略运算开销小,且选择门限只与中继节点数、平均信道增益以及当前系统信噪比有关,可在传输开始前确定而无需实时更新,从而节省了系统开销。仿真实验表明,在相同的信噪比条件下,该策略在满足一定的中断概率条件下,可以有效降低发射功率。     

基于D2D通信系统中的一种跨层中继选择算法

在D2D通信系统与蜂窝网络共存的场景下,引入中继节点可有效提高D2D链路的吞吐量和D2D用户对蜂窝用户的干扰。文中基于译码转发模式,结合跨层协作通信的思想,提出了一种基于物理层和数据链路层的跨层中继选择算法。该算法结合物理层的信道状态信息和数据链路层的队列状态信息,两个参数进行最优中继节点的选择。并最终通过仿真验证表明,基于跨层中继选择算法可提高通信系统的吞吐量,同时降低了通信系统的平均时延和数据包错误率。     

空时编码协作中的中继选择与功率分配联合方案

提出了一种空时编码协作中的中继选择与功率分配联合方案,称为DD(Destination Decision)方案.该方案由目的终端根据协作终端的信道状态信息进行中继选择与功率分配,并决定各中继发送STBC编码矩阵的哪一列,从而避免了通过中继之间的信息交互进行中继选择的冲突.理论分析和仿真结果表明,此方案在保证分集阶数和误码率性能的同时,提高了系统容量.     

基于萤火虫算法的多中继功率分配

为了充分实现中继协作,降低多中继协作通信系统功率分配优化问题的计算复杂度,提出了基于萤火虫算法的多中继功率分配方案。在一定的总功率和节点功率约束下,以最大化平均信噪比为优化目标函数,建立了多中继协作系统的功率分配最优化模型。选取该目标函数作为萤火虫的适应度函数,用向量表示萤火虫的状态,该向量的维数为待分配源节点和中继节点的个数,通过萤火虫聚集得到种群中最好的萤火虫,即可获得渐进最优功率分配。仿真结果表明,与平均功率分配相比,基于萤火虫算法的功率分配方案能降低2.44%~6.17%的比特差错率,提高了系统性能。     

分布式环境中协作分集的移动中继动态选择和切换策略研究

在协作无线通信系统中,中继节点的移动会大大降低系统的性能,目前该方面的结果很少。本文探讨分布式环境中协作分集的移动中继选择算法,在放大转发（AF）协作通信模式下,给出了基于信道统计状态信息的功率分配和中继的动态选择策略。针对单中继情况提出了中继切换方案,针对多中继情况提出了动态剔除、补充中继的方案,并导出了分集增益及系统容量的计算公式。通过模拟仿真分析,该方案能有效的降低中断概率,提高系统分集增益,扩大系统容量,实现良好的整体性能。      

A MAC/Routing cross-layer approach to geographic forwarding in wireless sensor networks

Geographic forwarding is an emerging paradigm for communications between nodes in sensor networks. No exchange of location information is required, and nodes only have to know their own coordinates and those of the destination. Due to the device’s limited processing and storage capabilities, a simplified protocol architecture should be designed so as to make communications in these networks efficient and simple at the same time. Moreover, sensor nodes are battery supplied and, thus, protocol design should be aimed at reducing energy consumption in order to increase network lifetime. In this perspective, one sensor feature recently regarded as of key importance, is the ability to tune the transmission power. This allows the communication range to be varied according to node density and connectivity constraints. In this paper we propose an integrated cross-layer protocol, called MACRO, which integrates MAC and routing layer functionalities in order to support geographic forwarding in wireless sensor networks. In MACRO, a competition is triggered to select the best next relay node while forwarding information to the destination. The competition is based on the evaluation of a weighted progress factor representing the progress towards the destination per unit of transmission power. An analytical paradigm facilitating the most appropriate choice of the next relay is proposed. The proposed solution is assessed through both analysis and ns-2 simulations. Performance results show the advantages of the proposed solution when compared to other geographic forwarding protocols which do not exploit cross-layer features.     

基于博弈的协作路由算法

协作虚拟多输入多输出（VMIMO）传输是一种有效的无线传输性能优化技术。将物理层协作VMIMO技术和网络层路由选择技术相结合,设计跨层VMIMO路由选择方案可以利用VMIMO的分集增益,显著地降低网络传输能耗。如何设计VMIMO协作路由协议抵抗无线网络的自私节点和欺骗行为,保证高数据转发率和低传输能耗成为路由设计中的重大挑战。为了提高自私网络的VMIMO路由性能,提出了一种基于重复路由博弈的VMIMO协作路由算法。该算法将网络划分成多个Group、Group间使用VMIMO传输数据。将Group间路由选择过程建模为重复路由博弈过程。为了提高数据转发的成功率,提出适用度函数评估节点参与数据分组转发的信誉。以此为基础,提出基于适用度的路由选择子算法和路由转发子算法。理论证明所提重复路由博弈可达到帕累托最优。仿真实验结果表明本算法可以促进自私节点相互合作,可获得较高的数据转发率,较好地减少数据传输时延以及能量消耗。     

多跳CC-HARQ中继网络的频谱有效性跨层设计

在瑞利衰落信道中,为改善采用Chase合并混合自动重传请求( CC-HARQ)协议的多跳中继网络的频谱效率性能,考虑发送帧长和发送功率的跨层优化,研究了提升其频谱效率的跨层优化策略。不同于传统的中断概率分析,通过利用对数域线性阈值的平均误帧率估计方法,给出了多跳CC-HARQ协议频谱效率的精确表达式,在发送功率固定时设计了最优发送帧长策略,在发送帧长固定时设计了最优发送功率分配方案,进一步提出了跨层的联合优化方案。仿真结果验证了所设计优化方案在理论上的正确性和有效性,同时在仿真中可以观察到采用跨层的优化策略后,多跳 CC-HARQ中继网络的频谱效率获得了显著的提升,其中跨层的联合优化方案比传统的固定帧长等功率策略在频谱效率上提升了0.014 b/s·Hz-1。     

A cross-layer strategy for cooperative diversity in wireless sensor networks

We investigate the problem of how to minimize the energy consumption in multi-hop Wireless Sensor Network (WSN), under the constraint of end-to-end reliability Quality of Seervice (QoS) requirement. Based on the investigation, we jointly consider the routing, relay selection and power allocation algorithm, and present a novel distributed cross-layer strategy using opportunistic relaying scheme for cooperative communication. The results show that under the same QoS requirement, the proposed cross-layer strategy performs better than other cross-layer cooperative communication algorithms in energy efficiency. We also investigated the impact of several parameters on the energy efficiency of the cooperative communication in WSNs, thus can be used to provide guidelines to decide when and how to apply cooperation for a given setup.     

Cross-layer resource allocation over wireless relay networks for quality of service provisioning

The authors propose a physical-datalink cross-layer resource allocation scheme over wireless relay networks for quality-of-service (QoS) guarantees. By integrating information theory with the concept of effective capacity, the proposed scheme aims at maximizing the relay network throughput subject to a given delay QoS constraint. This delay constraint is characterized by the so-called QoS exponent thetas, which is the only requested information exchanged between the physical layer and the datalink layer in our cross-layer design based scheme. Over both amplify-and-forwards (AF) and decode-and-forward (DF) relay networks; the authors develop the associated dynamic resource allocation algorithms for wireless multimedia communications. Over DF relay network, the authors also study a fixed power allocation scheme to provide QoS guarantees. The simulations and numerical results verify that our proposed cross-layer resource allocation can efficiently support diverse QoS requirements over wireless relay networks. Both AF and DF relays show significant superiorities over direct transmissions when the delay QoS constraints are stringent. On the other hand, the results demonstrate the importance of deploying the dynamic resource allocation for stringent delay QoS guarantees.     

Cross-layer optimization of wireless networks using nonlinear column generation

We consider the problem of finding the jointly optimal end-to-end communication rates, routing, power allocation and transmission scheduling for wireless networks. In particular, we focus on finding the resource allocation that achieves fair end-to-end communication rates. Using realistic models of several rate and power adaption schemes, we show how this cross-layer optimization problem can be formulated as a nonlinear mathematical program. We develop a specialized solution method, based on a nonlinear column generation technique, and prove that it converges to the globally optimal solution. We present computational results from a large set of networks and discuss the insight that can be gained about the influence of power control, spatial reuse, routing strategies and variable transmission rates on network performance.     

Optimization scheme with pre-processing for cooperative relay multicast networks in cellular system

For cooperative relay multicast networks, the general cross-layer optimization approaches converge to the global optimal value slowly because of the large quantity of relay terminals. However, the mobility of relay terminals requires quick converging optimization strategies to refresh the relay links frequently. Based on the capacity analysis of multiple relay channels, an improved cross-layer optimization scheme is proposed to resolve this problem, in which the bound of the relay selecting region is determined as a pre-processing. Utilizing the primal-dual algorithm, a cross-layer framework with pre-processing optimizes both the relay terminal selection and power allocation with quick convergence. The simulation results prove the effectiveness of the proposed algorithm.     

Wireless information and power transfer using single and multiple path relays

A relay‐based wireless communication model can relay information along with the power bidirectionally using the amplify‐and‐forward scheme. This paper studies such model extensively. Three information and power relaying protocols, that is, time‐based switching relaying, power‐based splitting relaying, and hybrid time switching‐based and power splitting‐based relaying (HTPSR) are used to carry forward bidirectional information and power transfer. First, a solo relay model is studied, for which, we derived a throughput expression for end‐to‐end information transfer, and this is done for all the three relaying protocols. The paper indicates that the system throughput depends upon the time switching and the power splitting ratio. Further, to make the system more reliable and robust, multiple relays are used in the path. Various relay selection schemes are used for path selection in each transmission, thereby yielding different throughput performances. The results show that an optimal throughput is obtained for a given relay location at an optimal set of values of splitting and switching ratio. Moreover, the HTPSR outperforms both the power splitting and time switching protocol in system throughput performance for a single as well as a multiple‐relay model. Whereas, in relay selection schemes, the best SNR selection scheme outperforms in all the schemes used. The simulated results confirm that the system throughput is an active function of relay placement.     

Cross-layer optimization for 3-D video transmission over cooperative relay systems

The rate budget constraint and the available instantaneous signal-to-noise ratio of the best relay selection in cooperative systems can dramatically impact the system performance and complexity of video applications, since they determine the video distortion. By taking into account these constrained factors, we first outline the signal model and formulate the system optimization problem. Next, we propose a new approach to cross-layer optimization for 3-D video transmission over cooperative relay systems. We propose procedures for estimation of the end-to-end instantaneous signal-to-noise ratio using an estimate of the available instantaneous signal-to-noise ratios between the source–destination, and source–relay–destination before starting to send the video signal to the best relay and destination. A novel approach using Lagrange multipliers is developed to solve the optimum bit allocation problem. Based on the rate budget constraint and the estimated the end-to-end instantaneous signal-to-noise ratio, the proposed joint source–channel coding (JSCC) algorithm simultaneously assigns source code rates for the application layer, the number of high and low priority packets for the network layer, and channel code rates for the physical layer based on criteria that maximize the quality of video, whilst minimizing the complexity of the system. Finally, we investigate the impact of the estimated the end-to-end instantaneous signal-to-noise ratio on the video system performance and complexity. Experimental results show that the proposed JSCC algorithm outperforms existing algorithms in terms of peak signal-to-noise ratio. Moreover, the proposed JSCC algorithm is found to be computationally more efficient since it can minimize the overall video distortion in a few iterations.