基于PDA+LDPC迭代接收机的分布式协作通信策略

针对同步DS-CDMA协作通信系统,本文考虑在转发节点端和基站端使用随机数据联合检测算法(probabilistic data association algorithm,PDA)与LDPC码译码器级联的迭代接收机PDA+LDPC,基于该迭代接收机结构,给出了一种分布式协作通信策略,研究表明,该策略较集中式协作伙伴选择策略和传统的DAF协作通信策略可取得更好的系统性能.     

一种基于混合智能算法的协作中继选择新方法

针对多用户多中继场景下协作通信系统的中继选择问题,提出了一种基于混合智能算法的协作中继选择新方法。不同于现有的为每个源节点分配一个中继节点的中继选择方法,新方法建立了为每个源节点分配一个或多个中继节点的优化模型,以最大化多用户多中继协作系统的最小接收信噪比为优化目标,采用结合了模拟退火与遗传算法的混合智能算法来搜寻中继选择问题的最优解。仿真结果表明,所提方法可显著提高目的端的接收信噪比,且算法具有较强的全局搜索和快速寻优能力。     

Fair resource sharing for cooperative relay networks using nash bargaining solutions

This letter considers the problem of resource sharing between two selfish nodes in cooperative relay networks. In our system, each node can act as a source as well as a potential relay, and both nodes are willing to achieve an optimal signalto- noise ratio (SNR) increase by adjusting their power levels for cooperative relaying. We formulate this problem as a two-person bargaining game, and use the Nash bargaining solution (NBS) to achieve a win-win strategy for both nodes. Simulation results indicate the NBS resource sharing is fair in that the degree of cooperation of a node only depends on how much contribution its partner can make to its SNR increase.     

MF中继选择系统的物理层安全性能

针对合谋窃听场景下单天线多中继修改转发（MF）协作无线系统的安全性能较差问题,提出一种合谋窃听场景下联合源节点发送天线选择（TAS）和多中继选择的MF协作物理层安全系统,考虑最优的最大化主信道信噪比（SNR）和次优的最大化源节点-中继节点链路 SNR 两种中继选择方案,推导其安全中断概率（SOP）和遍历安全容量（ESC）的解析表达式。最优或次优中继选择的MF安全中继系统的SOP和ESC的数值计算结果与仿真结果相吻合,验证了上述理论分析的正确性;同时也表明源节点发射天线数和中继节点数越多、窃听节点数越少,最优或次优中继选择的MF安全中继系统的物理层安全性能越好。     

能量收集多跳D2D无线传感网络中的中继选择算法

针对无线功率传输技术的能量收集效率有限造成信噪比下降进而引发通信中断率增加的问题,在能量收集多跳D2D(Device to Device)无线传感网络中,提出一种基于改进K-means聚类的中继选择方法。首先,推导得到能量收集下的信噪比因子,使其作为K-means聚类特征。然后,利用最小欧氏距离原则得到距离聚类中心最近的实际节点的位置。最后,根据距离重排序得到中继节点,形成从源节点到目的节点的通信链路。仿真实验结果表明,相比最短路径算法和随机中继协作方案,所提出的改进算法链路信噪比更大,能够减小通信中断率,具有更好的中继性能。     

SNR based secure communication via untrusted amplify-and-forward relay nodes using artificial noise

A two-phase beamforming solution for secure communication using untrusted relay nodes is presented. To thwart eavesdropping attempts of participant relay nodes, we deliberately introduce artificial noise in the source message. We observe that for certain scenarios, the source node prefers to allocate its full power to the message signal and, therefore, in the absence of artificial noise, such transmissions will be vulnerable to eavesdropping. Therefore, we provide a signal-to-noise ratio (SNR) based framework for secure communication. We intend to bring down the SNR at each of the untrusted relay nodes below a certain predefined threshold; whereas, using beamforming, we want to boost the SNR at the destination. With this motive, we evaluate the optimal scaling vector for the beamforming phase, which not only nullifies the artificial noise transmitted initially, but also maximizes the SNR at the destination. We discuss both the total and individual power constraint scenarios and provide an analytical optimal solution and an iterative algorithm, respectively.     

基于接收信噪比和网络寿命的最优中继选择

为了增大网络寿命,降低误符号率,优化无直传链路协作通信系统的性能,本文提出基于接收信噪比和网络寿命的最优中继选择算法。由于网络寿命的问题无法直接求解,将其转化为中继节点剩余能量与目的节点达到接收信噪比门限时发射功率的比值。首先计算各个中继在目的节点的接收信噪比,将大于信噪比门限加入候选中继,然后依次计算候选中继的联合优化函数值并排序,值最大者即为最优中继。理论推导了系统误符号率的上下界,仿真表明理论值与仿真值较为吻合,验证了系统在保证较低误符号率的基础上延长了网络寿命。     

Performance analysis of the unicasting mode in multi‐relay systems

The unicasting mode is a natural choice in multi‐relay systems to utilize the spatial potential of source and destination nodes. In the unicasting phase, the source node transmits different data streams to several relay nodes with the downlink multi‐user precoding; in the multi‐accessing phase, relay nodes transmit the received data streams to the destination node simultaneously. In this paper, the received signal‐to‐noise‐ratio (SNR) at the destination node of the unicasting mode is analyzed and derived, which can be calculated with two SNRs related to the two phases as an approximate harmonic mean function. Then, an approximate method for calculating the system ergodic capacity is presented. The inner products between singular vectors are approximately replaced by their expectations and distribution functions of singular values are derived. The numerical and simulation results demonstrate the efficiency of the analysis and the approximate method. Copyright © 2010 John Wiley & Sons, Ltd.     

MIMO-AF协作中继网络中发送预编码器的优化

本文首先利用中继节点和目标节点在第一时隙中的接收信噪比之和最大准则,推导出优化问题并解得优化的预编码器矢量。然后又利用目标节点最大比合并后的接收信号信噪比最大准则,推导出性能更佳的预编码器优化问题,但由于表达式复杂不能得到闭式解。为此本文提出了两种次优解决方法,分别是梯度下降迭代法和近似求解法。仿真结果表明,提出的两种准则优化预编码器方法都能有效改进系统性能,且因后者更能直接反映接收端情况,效果更好。两种次优的解优化方法能够获得几乎相同的系统性能,但梯度下降法采用迭代运算,计算量比较大,而近似求解法在性能不损失的情况下大大降低了计算复杂度。      

非正交选择译码转发协同

为了提高两跳中继网络的传输速率和协同分集增益,该文提出一种非正交的选择译码转发策略传输数据。单节点协同时,协同节点仅在正确译码时采用和发送节点非正交的时序转发;在多节点协同时,采用一种节点选择算法选择译码正确且信道条件最佳的节点用于非正交转发。这种协同策略可获得和非正交放大转发相同的分集复用折衷性能,但其实现更简单,且在低信噪比时中断性能更好。     

Performance analysis of multiple‐input multiple‐output relay networks based impulse radio ultra‐wideband

In this paper, we study the performance of time hopping pulse position modulation for impulse radio ultra‐wideband. We consider relay network applying decode‐and‐forward protocol. The channels between nodes adopt the IEEE 802.15.4a norms. The bit error rate performance is analyzed considering the effect of interference. Our results show significant improvement due to the diversity gain provided by the relay nodes. However, the performance is limited when multiple access interference (MAI) is present. To combat the MAI effect and further improve the detection reliability, we propose to use antenna selection at the relay. The relay receiver is assumed to be equipped with multiple antennas, and only the best antenna is selected. This is shown to improve the performance in the presence of MAI and improve the diversity gain.Copyright © 2013 John Wiley & Sons, Ltd.     

Interference and Sink Capacity of Wireless CDMA Sensor Networks with Layered Architecture

We evaluate the sink capacity of wireless code division multiple access (CDMA) sensor networks with layered architecture. We introduce a model of interference at a sink considering two kinds of interference: multiple access interference (MAI) and node interference (NI). We also investigate the activity of sensor nodes around the sink in relation to gathering data under a layered architecture. Based on the interference model and the activity of sensor nodes around the sink, we derive the failure probability of the transmission from a source node located one hop away from the sink using Gaussian approximation. Under the requirement of 1% failure probability of transmission, we determine the sink capacity, which is defined as the maximum number of concurrent sensor nodes located one hop away from the sink. We demonstrate that as the node activity of the MAI decreases, the variation of the sink capacity due to the node activity of the NI becomes more significant. The analysis results are verified through computer simulations.     

Joint Optimization of Source Power Allocation and Relay Beamforming in Multiuser Cooperative Wireless Networks

Relay beamforming techniques have been shown to significantly enhance the sum capacity of a multiuser cooperative wireless network through the optimization of the relay weights, where concurrent communications of multiple source-destination pairs are achieved via spatial multiplexing. Further optimization of the transmit power allocation over the source nodes is expected to improve the network throughput as well. In this paper, we maximize the sum capacity of a multiuser cooperative wireless network through the joint optimization of power allocation among source nodes and relay beamforming weights across the relay nodes. We consider a two-hop cooperative wireless network, consisting of single-antenna nodes, in which multiple concurrent links are relayed by a number of cooperative nodes. When a large number of relay nodes are available, the channels of different source-destination pairs can be orthogonalized, yielding enhanced sum network capacity. Such cooperative advantage is particularly significant in high signal-to-noise ratio (SNR) regime, in which the capacity follows a logarithm law with the SNR, whereas exploiting spatial multiplexing of multiple links yields capacity increment linear to the number of users. However, the capacity performance is compromised when the input SNR is low and/or when the number of relay nodes is limited. Joint optimization of source power allocation and relay beamforming is important when the input SNR and/or the number of relay nodes are moderate or the wireless channels experience different channel variances. In these cases, joint optimization of source power and distributed beamforming weights achieves significant capacity increment over both source selection and equal source power spatial multiplexing schemes. With consideration of the needs to deliver data from each source node, we further examine the optimization of global sum capacity in the presence of individual capacity requirements by maximizing sum capacity of the network subject to a minimum capacity constraint over each individual user.     

放大转发中继网络中的一种中继选择方案

提出了一种放大转发网络中的中继选择方案,假设目的节点配置多个天线,源节点和所有中继节点都配置单个天线,方案选择一组中继同时在相同的频带上放大转发接收到的源节点信息以最大化接收信噪比。与只择一个最优中继的方案相比,方案在保持满分集阶数的情况下获得了更高的中断容量和更优的误符号率性能。与只选择一个最优中继的方案相比,在0.000 01的误符号率水平上,少需要发射功率1.6 dB。     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

A turbo-like symbol by symbol decoder for randomly distributed space-time coding in amplify-and-forward relay networks

In this letter, a simple distributed Space-Time coding scheme is introduced by allocating random interleavers to each relay node in amplify-and-forward (AF) network. By using multiuser definition each rely node provides an interference to the detected signal, a turbo-like symbol by symbol decoder is also introduced. The complexity involved grows only linearly with the number of relay nodes. Simulation results show an acceptable improvement to previous works in the high SNR region.     

Distributed Adaptive Power Allocation for Wireless Relay Networks

In this paper, we consider a 2-hop wireless diversity relay network. We explore transmit power allocation among the source and relays to maximize the received signal to noise ratio (SNR) at the destination. We consider two relay protocols, "amplify and forward" (AAF) and "decode and forward" (DAF) and design the respective power allocations for both uneeded and coded systems. For a 2-hop relay system with one relay node, we derive a closed-form power allocation solution and, based on it, we propose a relay activation condition. If and only if the fading channel coefficients satisfy this condition, the relay transmits the signals to the destination; otherwise, the relay will stay in the idle state. For a system with more than one relay node, general closed-form power allocation solutions based on an exact SNR expression are difficult to derive; we hence, calculate a SNR upper bound and derive a sub-optimum power allocation solution based on this bound. The simulation results show that for a 2-hop diversity relay channel with one relay node the proposed adaptive power allocation (APA) scheme yields about 1- 2 dB SNR gains compared to the equal power allocation. This SNR gain increases monotonically as the number of relays increases     

Effect of multiple antennas at the source on outage probability for amplify-and-forward relaying systems

The amplify-and-forward (AF) relaying system considered here consists of a source node with M transmit antennas, and relay and destination nodes with a single antenna each. The closed-form expressions for the outage probabilities for maximum-ratio-transmission (MRT) at the source are presented for some specific values of M. Numerical results show that increasing M from 1 to 2 can achieve roughly a 3dB SNR gain, guaranteeing the same outage probability. However, we discover that for M ≥ 3, the additional gain compared to M = 2 decreases quickly as the SNR increases. Therefore, increasing M above 3 does not achieve significantly greater gain over M = 2 at high SNR.     

Beyond the VCG mechanism: truthful reverse auctions for relay selection with high data rates,high base station utility and low interference in D2D networks

Device-to-device communication allows a cellular user (relay node) to relay data between the base station (BS) and another cellular user (destination node). We address the problem of designing reverse auctions to assign a relay node to each destination node, when there are multiple potential relay nodes and multiple destination nodes, in the scenarios where the transmission powers of the relay nodes are: (1) fixed, (2) selected to achieve the data rates desired by destination nodes, and (3) selected so as to approximately maximize the BS’s utility. We show that auctions based on the widely used Vickrey–Clarke–Groves (VCG) mechanism have several limitations in scenarios (1) and (2); also, in scenario (3), the VCG mechanism is not applicable. Hence, we propose novel reverse auctions for relay selection in each of the above three scenarios. We prove that all the proposed reverse auctions can be truthfully implemented as well as satisfy the individual rationality property. Using numerical computations, we show that in scenarios (1) and (2), our proposed auctions significantly outperform the auctions based on the VCG mechanism in terms of the data rates achieved by destination nodes, utility of the BS and/or the interference cost incurred to the BS.

     

基于负荷平衡的混合式中继选择新算法

现有的中继选择算法通常带来中继负荷失衡问题,可能导致中继节点资源的非公平利用。为解决这个问题,首先对中继负荷失衡问题进行了分析,接着使用链路信噪比和中继节点负荷作为模糊控制的输入参量,提出了负荷平衡中继选择(LBRS)算法;其次,针对LBRS算法中存在的低信噪比区域误比特率偏高的问题,进一步提出了LBRS的改进算法,即基于负荷平衡的混合式中继选择(HRS)算法。仿真结果表明,与典型的最优中继选择(BRS)算法比较,HRS算法在平衡中继节点负荷上具有非常显著的优势,在误比特率性能上稍逊,总的来说是一种性能优异的中继选择算法。