协作网络中基于中继选择的协作波束赋形算法

针对多中继网络中所有中继节点都参与协作的协作波束赋形方法,提出了一种基于选择的协作波束赋形算法。该方法将最小化系统中断概率作为目标,得到一个次优的中继节点选择门限,小于门限的中继节点被逐一剔除,从而保证了网络中的资源只分配给有用的中继节点,获得了分集增益。该选择方法需搜索次数和中继节点的个数相等,因此大幅降低了选择过程的复杂度。蒙特卡洛仿真表明,选择波束赋形算法可有效提高系统中断概率性能和网络能量效率。     

协作通信中的自适应分级调制与功率分配

基于分级调制的中继协作技术可以很好地利用无线信道的广播特性和中继节点的位置优势来对抗信道衰落.本文提出一种自适应的协作方法,这种方法根据中继的相对位置,选择最优的分级调制星座图以及源与中继之间的功率分配比例,以使目的节点接收的数据误码率最小.仿真结果表明优化星座图和优化源与目的节点之间的功率分配比例都可以获得可观的性能提升.当中继位于源与目的节点的中点附近时,在消耗相同能量带宽资源的条件下,这种最优化的协作方法比非协作系统有3-4dB的性能增益.     

基于译码——转发的多中继协作节点选择方法

由于协作通信技术能够抵抗信道衰落的影响,提供分集增益,成为目前研究热点之一。针对传统多中继译码转发协作通信中,所有潜在中继均参与协作从而导致系统的低资源利用率问题,提出了一种基于信道容量增益的中继节点选择策略。仿真结果表明,该策略只需选择一半的中继节点数就能获得和最优中继选择方法非常相近的系统性能,同时降低了系统的功率损耗和实现复杂度。     

基于空时码的协作节点功率分配策略

为了优化协作通信系统的性能,文中提出了一种基于空时编码、以最大化系统互信息量为目标的各节点最优功率分配算法。通过采用凸优化的算法,功率在源节点和中继节点间得到了合理的分配。采用了更接近实际衰落环境的Nakagami模型。理论分析和仿真表明,所提算法能显著提高系统性能和功率效率,因而可以有效地用于协作通信中。     

改进蛙跳算法的多中继协作系统最优功率分配

协作通信与直接通信相比能够显著地提高系统性能,功率分配是协作通信中的一个关键问题。为了获得合理的协作中继通信系统功率分配方案,提出一种基于改进蛙跳算法的多中继节点功率分配方法。首先对功率分配问题进行分析,将其转换为一个非线性优化问题,然后将青蛙表示为源节点,中继节点的功率,以平均信噪比作为青蛙的食物,并通过青蛙的信息交流和协作找到最优的功率分配方案,最后采用仿真对比实验对本文算法性能进行测试。仿真结果表明,相对于其它功率分配方法,改进蛙跳算法有效地提高了系统的信道容量,降低了中断概率,以较低的复杂度提高了系统的性能。     

无线协作网络中基于数据传输需求的分布式功率控制

在未来无线通信网络中,协作通信的性能依赖于通信资源的有效分配,比如中继选择和功率控制等.在本文中,我们建议了一个分布式买者和卖者博弈理论框架,以满足用户链路质量需求为基础,解决多用户协作通信中最优化中继选择和功率控制.本文联合考虑了源节点和中继节点的功率分配,进而优化源节点和中继节点的收益.这里提出的方法不仅有助于源节点找到相对位置较好的中继节点以及在源和中继之间进行最优化功率分配从而最小化源节点的支付,而且有助于相互竞争的中继节点提供优化的价格以最大化它们各自的收益.此外,这里的优化价格可以仅由局部信道状态信息和其他节点的能量价格决定.如果获得的中继节点总数增加,全网的能量消耗会更低.     

基于认知无线电系统的协作中继分布式功率分配算法

协作通信与直接通信相比能够显著地提高系统性能。协作通信中的一个关键问题是管理中继节点及有效地进行功率分配。尤其对于频谱共享的认知无线电(Cognitive Radio,CR)系统,协作方案的设计不仅要最大限度地提高认知网络协作的功率效率,而且需要最小化对主系统的干扰。该文针对认知无线电系统的协作通信问题,在多个中继节点与源节点协同通信的场景下,提出了一种基于放大转发(Amplify and Forward,AF)模式下的功率分配及联合优化算法,在保证主系统传输性能不受影响的前提下,提高认知系统的传输速率。仿真结果表明该文提出的自适应协作传输方案,和直接传输及等功率传输方案相比获得了进一步的性能增益,中断概率显著下降。     

一种多源协作网络的分布式功率分配与中继选择算法

该文针对多源-多中继放大转发协作通信网络,以最小化系统总功率为目标,在保证系统满足一定中断概率的前提下,提出了一种分布式功率分配与中继选择算法.算法由源节点自主选择为其转发信息的中继节点,并引入定时器,通过竞争方式避免了分布式所导致的中继选择冲突.中继收到来自源节点的信号后,只需根据转发门限自主判断是否进行转发,从而完成传输.仿真结果表明该分布式算法能够有效降低传输所需要的总发射功率.并且与集中式控制所获得的最优中继选择与功率分配算法相比性能相近,但所提分布式算法显著降低了系统的控制开销.     

非对称信道下协作通信系统中断概率的研究

首先建立了非对称信道下协作系统的数学模型,考虑了源节点到目的节点的直通链路,利用特征函数法推导出协作系统的平均中断概率公式,通过仿真验证了该中断概率公式的精确性,理论和仿真都表明协作系统的中断概率和中继节点的个数、位置分布以及协作系统的功率分配因子有着密切关系,并且考虑源到目的节点的直通链路相对于不考虑直通链路的情况具有更高的性能增益;然后又在此公式基础卜就协作系统中继节点的位置分布对最优功率分配因子的影响进行了仿真分析,并指出协作系统的最优功率分配因子受制于中继节点的位置分布情况.     

全双工中继协作下的认知MIMO系统吞吐量最大化研究

本文研究了全双工中继协作下的认知MIMO系统的平均吞吐量最大化问题。与传统的中继协作认知无线电系统不同的是,该系统模型中的双工中继节点既能协助认知用户源节点进行多天线频谱感知以提高频谱检测性能,也能解码转发认知用户源节点的发送信号以获得更大的系统吞吐量。为使系统平均吞吐量最大,首先,本文以认知用户能获得的最大平均频谱空洞被发现的概率为目标,对系统的帧结构进行优化以获得最佳的感知时间,接着对多个发送天线进行优化以选择出最佳的发送天线,并推导出了在总的发送功率和对主用户干扰受限条件下的认知用户源节点和双工中继节点的最佳功率分配方案。最后的仿真结果表明本文提出的系统模型和优化方案相比传统的双工等功率分配方案以及单工功率分配方案能够获得更大的系统平均吞吐量。      

Optimal Cooperative Spectrum Sensing Under Faded and Bandwidth Limited Control Channels

Most of the cooperative spectrum sensing related research assumes system models with perfect control channel (i.e. with unlimited channel bandwidth and no channel errors). However, the assumption is not realistic and can lead to incorrect conclusions regarding the performance analysis of the cooperative spectrum sensing detection capabilities. This paper proposes a novel cooperative spectrum sensing framework that mitigates the imperfect control channel features, like the limited control channel bandwidth and error proneness, and achieves the detection performances of cooperative spectrum sensing under ideal control channel. It utilizes node clustering and multi-antenna spatial multiplexing (i.e. beamforming) and provides a generic framework that can be exploited by any cooperative spectrum sensing and fusion technique. The performance analysis shows that the proposed framework alleviates the control channel bandwidth limitation and significantly decreases the control channel error rate. The performance evaluation results also show that the proposed framework achieves the upper bound detection performances, i.e. achieves the same detection performances as the conventional cooperative spectrum sensing with ideal control channel.     

Development of coded-cooperation based multi-relay system for cognitive radio using mathematical modeling and its performance analysis

Coded cooperation is a cooperative relaying technique which is bandwidth efficient and can provide better connectivity when used with cognitive radio. Earlier cognitive radio is implemented with cooperative schemes like decode and forward, amplify and forward, compress and forward, etc., which gives moderate spectrum efficiency and diversity with reduced fading problem of wireless communication. But these techniques are not bandwidth efficient so need huge bandwidth for transmission. In this paper, we have developed a mathematical model of new coded-cooperation based multi-relay system for cognitive radio and its outage probability is analytically derived for underlay mode. The performance analysis of proposed system is carried out in terms of interference temperature constraint, channel gain, number of relays through outage probability for single and multilink relays at the primary node for Rayleigh channel. The proposed system shows that the cognitive radio with coded cooperation outperforms the already existing techniques in terms of diversity, bandwidth, spectrum utilization efficiency and improve the communication quality. In addition, the theoretical analysis of the outage probability is validated by asymptotic analysis.     

Data Replication in Cooperative Mobile Ad-Hoc Networks

The mobile computing environment provides many benefits such as ubiquitous access to computing but includes constraints on resources such as available bandwidth and battery life. Replication is a widely recognized method for balancing the demands of storage space with bandwidth and battery life. We propose a novel scheme that seeks to strategically balance these constrained resources through a cooperative game-theory approach for replication in a mobile environment. Our replication strategy relies on the cooperation of the nodes within the network to make replica caching decisions which are spatiotemporally local-optimal for the network from an energy and bandwidth conservation standpoint. In cooperative altruistic data replication, each node calculates the net global benefit, for caching a replica of the requested data, as the result data is returned from the responding node to the requesting node, where it determines the spatiotemporally local-optimal node for replicating the data item. Performance results from our research indicate that our scheme, CADR, improves the query response time by 25 and 45 %, mean hop count is improved by 26 and 46 %, query error is reduced by 30 and 48 %, while energy utilization is reduced 30 and 57 % when compared with both another game theoretic replication approach and standard cooperative caching respectively.     

Cooperative Communications in Resource-Constrained Wireless Networks

Cooperative communications have been proposed to exploit the spatial diversity gains inherent in multiuser wireless systems without the need of multiple antennas at each node. This is achieved by having the users relay each others messages and thus forming multiple transmission paths to the destination. In resource constrained networks, such as wireless sensor networks, the advantages of cooperation can be further exploited by optimally allocating the energy and bandwidth resources among users based on the available channel state information (CSI) at each node. In the first part of this article, we provide a tutorial survey on various power allocation strategies for cooperative networks based on different cooperation strategies, optimizing criteria, and CSI assumptions. In the second part, we identify the similarities between cooperative networks and several sensor network applications that utilize collaboration among distributed sensors to achieve the system goal. These applications include decentralized detection/estimation and data gathering. The techniques developed in cooperative communications can be used to solve many sensor network problems     

Throughput maximization of ad-hoc wireless networks using adaptive cooperative diversity and truncated ARQ

We propose a cross-layer design which combines truncated ARQ at the link layer and cooperative diversity at the physical layer. In this scheme, both the source node and the relay nodes utilize an orthogonal space-time block code for packet retransmission. In contrast to previous cooperative diversity protocols, here cooperative diversity is invoked only if the destination node receives an erroneous packet from the source node. In addition, the relay nodes are not fixed and are selected according to the channel conditions using CRC. It will be shown that this combination of adaptive cooperative diversity and truncated ARQ can greatly improve the system throughput compared to the conventional truncated ARQ scheme and fixed cooperative diversity protocols. We further maximize the throughput by optimizing the packet length and modulation level and will show that substantial gains can be achieved by this joint optimization. Since both the packet length and modulation level are usually discrete in practice, a computationally efficient algorithm is further proposed to obtain the discrete optimal packet length and modulation level.     

基于灾难预测多区域故障的虚拟光网络生存性映射

生存性虚拟光网络映射是提高光网络应对灾难故障的重要技术保障措施。为解决灾难性多区域故障导致弹性光网络的带宽容量损失问题,该文提出基于灾难预测故障模型的蚁群优化虚拟光网络映射 (DFM-ACO-VNM)算法。在该算法中,设计基于光节点资源和相邻链路的全局潜在故障概率的光节点排序映射准则,并设计启发式信息公式实现多区域故障下最小带宽容量损失的虚拟节点和虚拟链路协同映射。仿真结果表明,该文所提算法在多区域故障时能降低带宽容量损失,减少带宽阻塞率和提高频谱利用率。     

“双码”架构下的云存储多节点修复协作编码

针对云存储中现有多节点失效修复模型的不足,给出了一种可以对多个系统节点或冗余节点同时修复的多节点协作的精确修复码,证明了其存在性,并且将此修复码与具有健康节点协作的MDS双码架构模型相结合,以达到对多节点修复的同时,降低修复带宽、修复链路数和单个中间节点需要处理的数据量。通过数值仿真结果表明,本模型与修复方案在以上3个方面具有较大改进,尤其削弱了修复时中间节点的负荷,且随着云存储中节点数量的增多,本方案的优势更加明显。     

Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding

This paper studies the recovery from multiple node failures in distributed storage systems. We design a mutually cooperative recovery (MCR) mechanism for multiple node failures. Via a cut-based analysis of the information flow graph, we obtain a lower bound of maintenance bandwidth based on MCR. For MCR, we also propose a transmission scheme and design a linear network coding scheme based on (η, κ) strong-MDS code, which is a generalization of (η, κ) MDS code. We prove that the maintenance bandwidth based on our transmission and coding schemes matches the lower bound, so the lower bound is tight and the transmission scheme and coding scheme for MCR are optimal. We also give numerical comparisons of MCR with other redundancy recovery mechanisms in storage cost and maintenance bandwidth to show the advantage of MCR.     

Joint optimization of relay strategies and resource allocations in cooperative cellular networks

This paper considers a wireless cooperative cellular data network with a base station and many subscribers in which the subscribers have the ability to relay information for each other to improve the overall network performance. For a wireless network operating in a frequency-selective slow-fading environment, the choices of relay node, relay strategy, and the allocation of power and bandwidth for each user are important design parameters. The design challenge is compounded further by the need to take user traffic demands into consideration. This paper proposes a centralized utility maximization framework for such a network. We show that for a cellular system employing orthogonal frequency-division multiple-access (OFDMA), the optimization of physical-layer transmission strategies can be done efficiently by introducing a set of pricing variables as weighting factors. The proposed solution incorporates both user traffic demands and the physical channel realizations in a cross-layer design that not only allocates power and bandwidth optimally for each user, but also selects the best relay node and best relay strategy (i.e. decode-and-forward vs. amplify-and-forward) for each source-destination pair     

异步协同系统频选信道下基于线性预处理的DSTC结构设计

在协同中继系统中,应用分布式空时码(Distributed Space Time Coding, DSTC),可以在有效提高系统效率的同时获得全协同分集。但是,各中继节点的异步传输和节点间的多径衰落会破坏空时码字的结构,使之不能获得全分集。本文针对两中继的异步协同系统,提出了一种频率选择性信道下的基于线性预处理的DSTC传输结构。在此传输结构中,源节点对发送数据块进行预处理后发送给中继节点,中继节点对接收信号进行简单的共轭重排等处理,使得在目的节点形成DSTC的结构。其中,为抵抗异步传输和多径衰落引入的符号间干扰(Inter-symbol Interference, ISI),在源节点处和中继节点处均加入循环前缀(Cyclic Prefix, CP)。于是目的节点对接收到的信号进行DFT处理后,可以运用ML算法对数据信息进行检测。理论分析和仿真表明,当存在定时误差和节点间为频率选择性信道时,目的节点运用ML检测算法该传输结构可获得全空间分集和全多径分集。然后,本文考虑了信道各径延迟为整数倍符号周期的情况,并且证明了该传输结构的分集增益只与节点间信道的有效信道长度有关。