基于中断概率的多跳混合协作地理路由算法

为了减小无线传感器网络中路由的路径长度,该文提出基于中断概率的多跳混合协作地理路由(MHCGR)算法。首先对不同协作机制的链路进行分析,理论分析表明,在一定中断概率要求下,采用译码放大转发混合协作机制可以进一步扩大传输距离,并推导了每跳协作链路的理想最大协作传输距离和理想中继的位置。在无信标地理路由(BLGR)算法的基础上,MHCGR算法结合节点位置信息为每跳选择最佳的中继节点和转发节点,建立从源节点到目的节点的多跳协作路由。仿真表明,与ENBGCR算法和基于DF协作机制的MPCR算法两种协作地理路由算法相比,MHCGR算法可明显减少路由的跳数,改善路由的整体发射功率。     

无线网络中基于位置的能量高效协作路由算法

为了降低无线网络中路由的整体发射功率,该文提出了一种基于位置的能量高效协作路由(LBCR)算法。首先分析了协作链路在一定中断概率要求下的发射功率性能,理论分析表明,合适的协作节点可以降低协作链路的发射功率。在自适应转发分群路由(AFCR)算法的基础上,LBCR算法利用节点位置信息为每跳选择合适的中继节点,然后结合多跳协作策略,建立从源节点到目的节点的协作路由。仿真结果表明,与无协作的AFCR算法和基于一跳协作的MPCR算法相比,LBCR算法可以明显改善路由的整体发射功率。     

基于协作通信系统的中继选择方案的研究

本文研究基于两跳的协作通信系统中的中继选择问题.为了降低中断概率,传统中继选择方案往往需要引入更多的中继节点参与协作传输,导致系统平均吞吐量下降.为解决上述问题,本文提出了一种新的自适应中继选择方案(ARSS),此方案可以结合两跳的链路信道状况,自适应地选择中继节点及其转发协议.仿真结果表明,与其他中继选择方案相比,本...     

一种利用跨层优化策略选择中继的协作路由算法

该文提出了一种新的中继选择的协作路由算法,该算法利用网络的路由包获得信道的信息,通过分布式计算从候选中继集合中选择出一个最佳中继转发数据。在分层的无线网络中,中继选择的实现包括了时间同步和跨层优化等。仿真结果表明,相对于DSDV协议,该文所提出的算法有效地提高了数据包的递交率并有效地降低了网络的时延。     

AF协同通信系统最优多跳中继位置

协作中继能够提供分集增益以提高链路成功发送分组的概率,除传输功率外,中继位置也是影响端到端性能的一个重要参数。为了降低多个协作节点对系统容量的影响,多跳中继是当前协作中继发展的一种新趋势。通过中断概率,得出了吞吐量的理论近似表达式,并进一步研究多跳中继位置对吞吐量的影响。仿真结果表明,多跳中继处于源节点和目的节点的中点...     

储能-发送模式的单天线两跳中继系统保密速率的优化

该文研究节点具有能量收集能力的两跳中继系统的物理层安全传输方案。考虑窃听节点与源和中继节点间都有直接链路的情况。每个数据传输时隙分为能量收集和数据传输两个阶段,各节点用收集的能量发送信号。中继采用放大转发方式,目的节点发送人工噪声进行协作干扰,保护在两跳传输中传输的保密信息。以最大化保密速率为目标,采用迭代算法优化能量吸收和数据传输两阶段的时间分配比例系数和协作干扰功率分配因子。仿真结果表明优化算法准确,优化后的协作干扰方案能显著提高系统的保密传输速率。由于考虑了窃听节点在两跳传输中都能接收到信号的可能性,文中方案更贴近实际,并解决了一个复杂的优化问题。     

多跳协同中继网络下物理层安全传输方案

针对多跳中继传输系统的信息安全传输问题,提出了一种基于全双工模式下多节点协作干扰(FD-MCJ)的物理层安全传输方案。该方案利用通信网络中的中继节点发送干扰信号恶化窃听节点的接收性能,同时中继节点根据信道状态信息(Channel State Information, CSI)自适应的选择两种情况下的安全传输方案。本文首先利用泊松点过程对窃听节点位置进行安全建模;然后,根据CSI可用程度,给出不同的安全传输具体方案,在考虑系统的跳数、天线间自干扰以及发射功率和干扰功率等因素下,推导FD-MCJ方案下系统保密中断概率的闭式解;最后,数值分析和蒙特卡洛仿真表明,理论推导的正确性以及多跳中继系统中采用全双工多节点协作干扰方案能够有效提升系统安全性能。      

AF双向中继网络中一种新的中继选择算法

通过高信噪比条件下AF双向中继网络总速率的近似表达,给出了链路增益乘积和系统总速率之间的关系式。基于此关系式提出一种最大化链路增益乘积中继选择算法(Maximum Relay Selection,MRS),在中继处引入门限,将链路质量超过门限的中继选出建立可靠候选集。在建立的可靠候选集中以两跳链路增益乘积最大化为标准,实现最佳中继选择。通过仿真将该中继选择算法与现有AF双向中继网络3种不同中继选择算法进行性能比较。仿真结果表明,该中继选择算法能在同时保证AF双向中继网络两跳链路质量的前提下,提高系统的总速率。     

双向协作OFDM系统中基于能量定价的功率分配与中继选择算法

该文研究双向两跳协作多中继正交频分复用(OFDM)系统的网络寿命优化问题。由于网络寿命最大化的问题无法直接求解,该文提出一种基于对各节点能量定价的次优算法,即将各子载波的功率分配,中继及源节点选择进行分步优化。首先利用拉格朗日法求解两个方向上的源与各中继节点配对时的最优功率分配,使得网络在满足一定吞吐量和发送功率限制的前提下,消耗能量总价值最小;然后在所有可能的配对中选择每个方向最优的中继节点;最后选择损耗能量价值较小的数据流方向。分别考虑了源与目的节点间有无直接链路两种场景,在有直接链路场景下分析了最大比值合并(MRC)和选择合并(SC)两种分集方式对功率优化的影响。仿真结果表明,该文提出算法的网络寿命比已有算法有显著提高。     

直达链路下的全双工能量采集中继系统的吞吐量分析

针对三节点传输系统,研究了基于时间切换能量采集的全双工放大转发协作中继方案。考虑源和目的地之间存在直达链路,全双工中继节点采用天线选择技术以最小化中继自干扰,目的节点采用最大比合并技术以最大化目的地接收信噪比。在延迟受限传输模式下,推出了自干扰信道增益为常数时系统吞吐量近似闭合表达式。运用最佳目的地选择策略和自适应中继选择策略讨论了系统吞吐量性能。如图4所示,在源发送功率为30 dB时,就系统吞吐量而言,本文算法比其他两种算法分别提高了0.22 bits/s/Hz和0.68 bits/s/Hz。数值分析和蒙特卡洛仿真表明,增加中继个数,增加目的地个数或者增大能量采集效率均能够提升系统吞吐量性能。      

A cross-layer protocol for exploiting cooperative diversity in multi-hop wireless ad hoc networks

Cooperative communication has emerged to reap the benefits of spatial diversity. To fully exploit cooperative diversity, we propose a medium access control and routing enabled cross-layer cooperative transmission (MACR-CCT) protocol for improving the performance in multi-hop wireless ad hoc networks (MWAN). Different from previous cooperative protocols that determine a receiver in one hop according to a non-cooperative routing protocol first and then select a cooperative relay, MACR-CCT selects the cooperative relay together with the receiver in one hop to exploit fully cooperative diversity, so that the receiver is selected for higher cooperative gain and closer distance to destination, and the relay is selected to achieve the better throughput performance while considering transmission error. Furthermore, considering that there are multiple source–destination pairs in MWAN, MACR-CCT takes interference mitigation into account to further improve network throughput when selecting the cooperative relay. Besides, we propose a theoretical model to analyze the throughput performance. Finally, we take advantage of simulation results to validate the effectiveness of our analytical model and show that our proposed MACR-CCT protocol can significantly outperform existing packet transmission mechanisms in terms of throughput and delay under the multi-hop multi-flow network scenario.     

MIMO多中继辅助通信中基于最优功率分配的路由选择算法

考虑多个多天线中继站辅助的通信网,各中继站工作于放大转发(AF)模式,本文针对两跳半双工中继信道,提出一种基于最优功率分配的多天线路由选择算法。在总功率约束条件下,首先实现基站与中继间的最优功率分配,然后基于多天线中继模式,选出接收信噪比最大的一个中继进行传输。当功率完全分配给基站时,由于未使用中继传输,等价于选择一跳路由。与不进行中继选择的全工作模式相比,该算法不仅能达到满分集度,而且具有更好的中断概率性能和更大的系统容量。仿真结果表明,本文方法以较小的计算复杂度,使系统获得了较大的性能增益,并对于存在路径损耗的实用场景,该算法的性能优势仍然存在。      

A Novel Distributed Scheduling Algorithm for Downlink Relay Networks

To extend network coverage and to possibly increase data packet throughput, the future wireless cellular networks could adopt relay nodes for multi-hop data transmission. This letter proposes a novel distributed scheduling algorithm for downlink relay networks. Soft-information indicating the probability of activating each network link is exchanged iteratively among neighboring network nodes to determine an efficient schedule. To ensure collision-free simultaneous data transmissions, collision-avoiding local constraint rules are enforced at each network node. To increase resource utility, the soft-information is weighted according to the urgency of data transmission across each link, which also helps maintain throughput fairness among network users.     

Energy-balanced cooperative routing in multihop wireless networks

Cooperative communication (CC) allows multiple nodes to simultaneously transmit the same packet to the receiver so that the combined signal at the receiver can be correctly decoded. Since the CC can reduce the transmission power and extend the transmission coverage, it has been considered in minimum energy routing protocols to reduce the total energy consumption. However, previous research on cooperative routing only focuses on minimizing the total energy consumption from the source node to the destination node, which may lead to the unbalanced energy distribution among nodes. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among nodes. By introducing a new routing scheme which carefully selects cooperative relay nodes and assigns their transmission power, our cooperative routing method can balance the remaining energy among neighboring nodes to maximize the lifetime of the network. Simulation results demonstrate that the proposed cooperative routing algorithm significantly balances the energy distribution and prolongs the lifetime of the network.     

Improving physical layer security via cooperative diversity in energy‐constrained cognitive radio networks with multiple eavesdroppers

In this paper, a scheme that exploits cooperative diversity of multiple relays to provide physical layer security against an eavesdropping attack is concerned. Relay‐based cognitive radio network (CRN) faces issues multiple issues other than the same as faced by conventional wireless communications. If the nodes in a CRN are able to harvest energy and then spend less energy than the total energy available, we can ensure a perpetual lifetime for the network. In this paper, an energy‐constrained CRN is considered where relay nodes are able to harvest energy. A cooperative diversity‐based relay and subchannel‐selection algorithm is proposed, which selects a relay and a subchannel to achieve the maximum secrecy rate while keeping the energy consumed under a certain limit. A transmission power factor is also selected by the algorithm, which ensures long‐term operation of the network. The power allocation problem at the selected relay and at the source also satisfies the maximum‐interference constraint with the primary user (PU). The proposed scheme is compared with a variant of the proposed scheme where the relays are assumed to have an infinite battery capacity (so maximum transmission power is available in every time slot) and is compared with a scheme that uses jamming for physical layer security. The simulation results show that the infinite battery‐capacity scheme outperforms the jamming‐based physical layer security scheme, thus validating that cooperative diversity‐based schemes are suitable to use when channel conditions are better employed, instead of jamming for physical layer security.     

Parallel relay‐assisted three‐phase MIMO space division multiple access transmission for multi‐hop throughput improvement

Multi‐hop communications equipped with parallel relay nodes is an emerging network scenario visible in environments with high node density. Conventional interference‐free medium access control (MAC) has little capability in utilizing such parallel relays because it essentially prohibits the existence of co‐channel interference and limits the feasibility of concurrent communications. This paper aims at presenting a cooperative multi‐input multi‐output (MIMO) space division multiple access (SDMA) design that uses each hop's parallel relay nodes to improve multi‐hop throughput performance. Specifically, we use MIMO and SDMA to enable concurrent transmissions (from multiple Tx nodes to single/multiple Rx nodes) and suppress simultaneous links' co‐channel interference. As a joint physical layer (MAC/PHY) solution, our design has multiple MAC modules including load balancing that uniformly splits traffic packets at parallel relay nodes and multi‐hop scheduling taking co‐channel interference into consideration. Meanwhile, our PHY layer modules include distributive channel sounding that exchanges channel information in a decentralized manner and link adaptation module estimating instantaneous link rate per time frame. Simulation results validate that compared with interference‐free MAC or existing Mitigating Interference using Multiple Antennas (MIMA‐MAC), our proposed design can improve end‐to‐end throughput by around 30% to 50%. In addition, we further discuss its application on extended multi‐hop topology. Copyright © 2012 John Wiley & Sons, Ltd.     

Joint power allocation and relay selection for decode-and-forward cooperative relay in secure communication

In this paper, we investigate the cooperative strategy with total power constraint in decode-and-forward (DF) relaying scenario, in the presence of an eavesdropper. Due to the difference of channel for each source-relay link, not all relay nodes have constructive impacts on the achievable secrecy rate. Besides, the final achieved secrecy rate depends on both source-relay and relay-destination links in DF relaying scenario. Therefore, the principal question here is how to select cooperative strategy among relays with proper power allocation to maximize the secrecy rate. Three strategies are considered in this paper. First, we investigate the cooperative jamming (CJ) strategy, where one relay with achieved target transmission rate is selected as a conventional relay forwarding signal, and remaining relays generate artificial noise via CJ strategy to disrupt the eavesdropper. Two CJ schemes with closed-form solutions, optimal cooperative jamming (OCJ) and null space cooperative jamming (NSCJ), are proposed. With these solutions, the corresponding power allocation is formulated as a geometric programming (GP) problem and solved efficiently by convex programming technique. Then, to exploit the cooperative diversity, we investigate the cooperative relaying (CR) strategy. An iterative algorithm using semi-definite programming (SDP) and GP together with bisection search method is proposed to optimize the cooperative relaying weight and power allocated to the source and relays. Furthermore, to exploit the advantages of both CR and CJ, we propose an adaptive strategy to enhance the security. Simulation results demonstrate that the efficiency of the proposed cooperative strategies in terms of secrecy rate.