采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

带有广义反馈的多址接入中继信道的可达速率区域的研究

多址接入中继信道是含有多个接入节点、1个中继节点和1个目的接收节点的无线多用户信道,同时考虑接入节点之间能够接收彼此含噪的广义反馈信息,此种模型存在于接入节点之间协作通信能力较差的多跳无线网络和无线传感器网络。论文给出了带有此种广义反馈的离散无记忆多址接入中继信道的可达速率区域,并将这一结果推广到高斯信道。提出一个新的编码方案,主要基于速率划分和译码前传策略,并通过采用分组Markov叠加编码建立各接入源节点之间以及源节点和中继节点之间的协作通信,在可达性证明中还采用规则编码和反向译码策略。结果表明,在离散无记忆信道环境下可达速率区域相比较以往结果更具一般性,在高斯信道环境下可达速率区域被扩展。     

乘法运算的模拟网络编码中继方法

当前无线网络编码中继采用异或运算和叠加运算实现,该文提出一种基于乘法运算的网络编码中继方案。该方案中继节点对接收到的两个源节点信号直接相乘,然后放大转发,从而实现网络编码。与异或运算的网络编码相比,该方案采用模拟技术实现,降低了中继节点网络编码的复杂度;同时该方案将接收信号与本地信号相乘实现网络译码,译码算法比叠加运算的方案简单。理论分析表明该方案的分集增益与未经网络编码的中继系统相同;仿真结果表明,该方案与现有的网络编码中继协作方案性能相当。     

Network Coding for Overhead Reduction in Delay Tolerant Networks

Employing Network Coding (NC) in routing protocols for Delay Tolerant Networks (DTNs) is a challenging issue during the last years due to its potential beneficial effect on improving relevant critical metrics. This paper proposes an effective NC scheme intended for sparse DTNs comprising nodes of limited storage capacity. The scheme employs a memory management algorithm that makes optimal use of the limited storage capacity and focuses on unicast sessions where source and intermediate nodes combine only packets belonging to the same generation and destined for the same destination node. Upon having received a sufficient number of linearly independent packets resulting in a matrix of full rank, the destination nodes can apply network decoding to retrieve the information intended for them. The proposed scheme is fully distributed since the network nodes make decisions based on information collected solely from their own buffers. Combined either with Epidemic or probabilistic routing protocols, the scheme manages to drastically reduce the overhead created per source packet.     

基于自适应随机线性网络编码的优先级调度方案

该文针对无线多播网络中基于随机线性网络编码(RLNC)调度方案计算复杂度高,且网络传输性能易受反馈信息影响等问题,提出一种基于自适应RLNC的优先级调度方案(PSARLNC)。该方案结合视频流的特征采用适应多播的RLNC,相较于传统RLNC计算复杂度降低。经过初始传输后,在后续数据恢复阶段,综合考虑数据包剩余传输时隙,选取目的节点增益最大传输方式,最大化数据传输。同时,各中继节点根据接收情况,构建各自解码概率值,并以此为依据确定调度优先级并完成转发,自适应调整各节点传输,有效减少对反馈信息的依赖。仿真结果表明该方案与完全反馈方案性能十分接近,且在减小计算复杂度和降低对反馈信息依赖同时保证了较好的性能。     

基于部分中继选择的能量收集双跳网络信息年龄优化

针对传统中继协作网络传感器节点能量受限导致信息传输延迟较高的问题,将短包通信（SPC）和能量收集技术相结合,构建了一种双跳中继无线传感器网络模型。网络中源节点和中继均需从专用能量基站收集射频信号能量以保证信息的持续传输,中继采用半双工解码转发协议将源节点发送的状态更新信息以短包形式传递到目的节点,利用中继选择策略与最大比合并技术提出了基于时效性的最早部分中继选择方案。考虑该网络信息的新鲜度,首先,分析了SPC传输性能,推导了中继和目的节点处的平均包错误率。其次,利用顺序统计量描述了源节点到中继端数据包的重传次数,基于更新过程理论推导了网络的平均信息年龄（AoI）表达式,并采用梯度下降方法优化了影响网络平均AoI的部分参数。最后,仿真分析结果表明,优化中继数量和数据包长度可以有效提高网络信息新鲜度,同时,通过对比优化部分参数得到的最优值与贪婪方法得到的最小化平均AoI理论值,可以验证部分中继协作方案在双跳状态更新网络中的可行性。      

Multisource, Multidestination, Multirelay Wireless Networks

Networks with multiple source-destination pairs, involving possibly multicast, and where there are multiple nodes that can serve as potential relay nodes, are considered. A multisource, multirelay coding scheme is developed. In this scheme, each source's information is sent to its destination nodes via a multirelay route, with the multiple multirelay routes operating concurrently even when they intersect with each other, in the same spirit as code-division multiple access (CDMA). It is found that in the generalization to multiple sources, backward decoding achieves higher rates than sliding-window decoding. The routing structure where a joint backward decoding can be performed is characterized. The achievable rate region is found to combine aspects of both multiple relay and multiple access. Potential applications of this coding scheme to sensor networks are discussed. In particular, the exact capacity for the data downloading problem in sensor networks, where there are multiple sensor sources and one sink or collector node, is established for certain geometries when there is phase fading that is unknown to the transmitter.     

A bandwidth‐efficient cooperative relaying scheme with hard interference cancellation and iterative decoding

This paper considers a coded cooperative relaying scheme in which all successfully decoded signals from multiple sources are simultaneously forwarded by a multi‐antenna relay to a common multi‐antenna destination to increase bandwidth efficiency. Iterative decoding with hard interference cancellation is used at destination to recover user information. By using orthogonal transmission from sources to avoid their mutual interference, the multi‐antenna relay offers receive space diversity that greatly enhances the decoding performance at the relay. This makes the source‐relay transmission more robust, less sensitive to the source‐relay link SNR, and hence increases the contribution of the relay in cooperative transmission. Simulation results show that the proposed scheme significantly outperforms direct transmission under the same transmit power and bandwidth efficiency. Copyright © 2009 John Wiley & Sons, Ltd.     

物理层网络编码分组的机会中继

为提升物理层网络编码方案的抗衰落性能,该文提出了一种基于物理层网络编码的机会中继方案(Opportunistic Relaying based-on Physical-layer Network Coding,PNC-OR),该方案利用物理层网络编码的基本思想、有效提升网络吞吐的同时,通过中继节点的分布式选择,也能够使系统获得多用户分集增益,提高了系统的抗衰落性能。针对双向无线中继信道中端到端信息交换的情形,推导了准静态衰落环境下PNC-OR中多个目的节点接收信息的和容量。数值结果显示：和机会中继、传统网络编码两种方案相比,PNC-OR具有更高的频谱效率,并且随着中继节点的增多,频谱效率也越高。     

Optimal simultaneous wireless information and energy transfer in OFDMA decode-and-forward relay networks

In this paper, we consider simultaneous wireless information and energy transfer in an orthogonal-frequency-division-multiple-access decode-and-forward relay network, in which an energy-constrained relay node harvests energy from a source node and uses the harvested energy to forward information to multiple destination nodes. Our objective is to maximize the end-to-end sum rate by resource allocation, subject to transmit power constraint at the source and energy-harvesting (EH) constraint at the relay. A non-convex and mixed-integer programming (MIP) problem is formulated to optimize time-switching (TS) ratios of EH and information decoding at the relay, TS ratio of information transmission from relay to destinations, subcarrier allocation as well as power allocation (PA) over all subcarriers at source and relay. We propose to decouple this problem into a convex problem and an MIP problem in fractional form. To solve the MIP problem, we transform it into an equivalent optimization problem in subtractive form which has a tractable solution. As a result, we propose a novel scheme to achieve jointly optimal TS ratios, subcarrier allocation and PA. Simulation results verify the optimality of our proposed resource allocation scheme.     

基于分层调制的物理层网络编码研究

在实际的移动通信环境中,信道的状态复杂多变,该文针对双向中继信道的非对称性,提出采用分层调制方式的物理层网络编码方案。首先构建源节点、中继节点均采用分层(2/4-PSK)调制的双向中继通信系统模型;其次给出了中继节点的物理层网络编码解调及映射规则,推导出加性高斯白噪声下中继误比特率及端到端误比特率理论计算公式;最后仿真验证了理论分析结果。与采用传统QPSK调制技术的物理层网络编码相比,该方案利用分层调制的技术优势,确保较优信道的高速率传输,也兼顾了较差信道的传输可靠性。     

基于预编码的双路径中继系统信号传输方案研究

针对转发放大(Amplify-and-Forward, AF)模式下的双路径中继网络,为了降低训练序列设计相互约束关系的复杂度,并提升系统误码性能,本文提出了一种基于预编码的信号传输方案。新方案采用一对相互正交的预编码矩阵,分别在两个中继处对信号进行预编码,在目的点右乘相应的解码矩阵将两路叠加信号分离。新方案能够将两路信号完全分离从而使原本需要考虑三处训练序列设计的问题转化为两处,简化了训练序列设计复杂度。由于预编码方案能够在目的点压缩噪声功率,并且避免两路中继信号的互相干扰,单路径误码性能和双路径分集合并误码性能都得到提升。仿真结果验证了新方案的有效性。      

半双工译码转发中继信道下的空间耦合RA码设计

针对半双工译码转发中继信道,提出了一种可逼近三节点中继信道容量限的空间耦合RA码的设计方法。针对二进制删除信道,源节点分别向中继节点和目的节点发送空间耦合RA码,中继节点先正确恢复出源节点发送的空间耦合RA,然后再次编码产生额外的校验比特并转发给目的节点;目的节点结合中继节点发送的额外校验比特和源节点发送的空间耦合RA码进行译码,正确恢复出源节点的信息。为了评估所设计的空间耦合RA码在三节点中继信道下的渐近性能,推导了密度进化算法用于计算阈值。阈值分析结果表明,所提出的空间耦合RA码能够同时逼近源到中继链路和源到目的链路的容量限。同时,基于半双工二进制删除中继信道,仿真了所设计的空间耦合RA码的误码性能,结果表明,其误码性能与所推导的密度进化算法计算的阈值结果一致,呈现出逼近于容量限的优异性能,且优于采用空间耦合低密度奇偶校验(Low Density Parity Check,LDPC)码的性能。     

Minimum Error Probability Cooperative Relay Design

In wireless networks, user cooperation has been proposed to mitigate the effect of multipath fading channels. Recognizing the connection between cooperative relay with finite alphabet sources and the distributed detection problem, we design relay signaling via channel aware distributed detection theory. Focusing on a wireless relay network composed of a single source-destination pair with L relay nodes, we derive the necessary conditions for optimal relay signaling that minimizes the error probability at the destination node. The derived conditions are person-by-person optimal: each local relay rule is optimized by assuming fixed relay rules at all other relay nodes and fixed decoding rule at the destination node. An iterative algorithm is proposed for finding a set of relay signaling approaches that are simultaneously person-by-person optimal. Numerical examples indicate that the proposed scheme provides performance improvement over the two existing cooperative relay strategies, namely amplify-forward and decode-forward     

中继协作无线网络中不完美反馈下基于网络编码的重传方案

无线广播网络传输过程中,目的节点反馈信息丢失或部分丢失导致发送节点不能了解目的节点的真实接收状态.为提高不完美反馈下无线网络的重传效率,本文提出中继协作无线网络中不完美反馈下基于网络编码的重传方案.本方案基于部分可观察马尔科夫决策过程对不完美反馈下的重传过程进行建模.发送节点根据系统观测状态和最大置信度更新系统估计状态,根据数据包发送顺序,优先选择最早丢失且能够恢复最多丢包的编码包重传.目的节点缓存不可解编码包以提升编解码机会.重传过程中源节点关注目的节点请求包需求,相同情况优先选择传输可靠性较高的中继节点,以提升传输有效性.仿真结果表明,在不完美反馈下相对于传统方案,本方案可有效提高重传效率.     

A Novel Adaptive and Cooperative Scheme to Save Energy for Wireless Sensor Network

In this paper, we evaluate the performance of a novel cooperative adaptive relaying scheme called ISDF (Incremental Selective Decode and Forward). We compare the energy efficiency of this underlying scheme with direct transmission (DT), Fixed and adaptive relaying schemes in Wireless Sensor Network (WSN). The system is constrained by a minimum value of Signal-to- Noise Ratio (SNR) and the end-to-end throughput. We consider a three-node cooperative system. The relay is equidistant to the source and destination, and then we study different positions of the latter. The destination receives two copies of the message: one from the source and the other from the relay. Then it combines them by using maximal ratio combining (MRC). The proposed scheme differs from other schemes by the combination of the selective decode and forward scheme with the incremental scheme which requires the presence of a feed-back from the destination. The analysis reveals that the proposed ISDF provides good energy efficiency compared to DT and other cooperative schemes. It also shows that DF cooperative scheme (decode and forward , either with feedback or no, is outperformed by AF (amplify and forward) scheme especially when the relay is placed near the destination.

     

大规模MIMO中继系统中多用户物理层安全传输方案

研究大规模多输入多输出中继网络中的多用户物理层安全传输方案.系统模型中假设窃听节点与源节点和中继节点间都有直接链路,窃听节点可以接收到源节点和中继发送的信号.在不能获得窃听者信道状态信息的情况下,大规模MIMO中继采用简单的最大比合并/最大比发射信号处理方案,并配合中继零空间人工噪声和目的端的协作干扰实现多用户的信息安全传输.对保密速率及其在中继天线数无限增长时的渐近值进行了理论分析,并进行仿真.仿真结果显示系统的保密和速率随中继天线数的增长而增长,最终趋于理论渐近上界值.仿真结果也表明即使窃听节点具有多用户间干扰消除能力,并能同时拦截源节点和中继发送的信号,采用本文的方案仍然能获得可观保密速率.     

Performance of Transmit Antenna Selection and Maximal-Ratio Combining in Dual Hop Amplify-and-Forward Relay Network over Nakagami-m Fading Channels

In this paper, we study end-to-end performance of transmit antenna selection (TAS) and maximal ratio combining (MRC) in dual hop amplify-and-forward relay network in flat and asymmetric Nakagami-m fading channels. In the network, source and destination communicate by the help of single relay and source-destination link is not available. Source and destination are equipped with multiple antennas, and relay is equipped with single antenna. TAS and MRC are used for transmission at the source and reception at the destination, respectively. The relay simply amplifies and forwards the signal sent by the source to the destination by using channel state information (CSI) based gain or fixed gain. By considering relay location, for CSI based and fixed relay gains, we derive closed-form cumulative distribution function, moments and moment generating function of end-to-end signal-to-noise ratio, and closed-form symbol error probability expression. Moreover, asymptotical outage probability and symbol error probability expressions are also derived for both CSI based and fixed gains to obtain diversity order of the network. Analytical results are validated by the Monte Carlo simulations. Results show that diversity order is minimum of products of fading parameter and number of antennas at the end in each hop. In addition, for optimum performance the relay must be closer to the source when the diversity order of the first hop is smaller than or equal to that of the second hop.     

Capacity Approaching Turbo Coding For Half-Duplex Relaying

In this paper, we develop capacity approaching turbo coding schemes for half-duplex relay systems as an extension of our previous work on coding for full-duplex relays. We consider the use of specific signal constellations (e.g., binary phase-shift keying) in transmission, develop practical coding schemes to be used at the source and the relay nodes, and describe a suitable information combining technique at the destination node. Unlike the full-duplex relay systems, the destination node does not perform joint decoding of multiple consecutive blocks; instead, it works with one frame at a time. Furthermore, for the half-duplex relaying scheme, the optimization of the length of the listening period for the relay node is an issue. By utilizing the information theoretical tools, we perform this optimization, and use it in our development of capacity approaching coding/decoding schemes. Specifically, when the fraction of time turns out to be less than the transmission rate, the relay node is unable to decode all the information bits transmitted, and a partial decoding approach has to be used. Through a comprehensive set of examples, we observe that the proposed scheme is promising to approach the corresponding information theoretical limits (bounds). In particular, for all the cases studied, we have obtained bit error rates of $10^{-5}$ or lower within 1–1.5 dB (in most cases, around within 1.2 dB) of the constrained capacity under a variety of channel conditions. Extensions of the proposed scheme to coded modulation and to multiple-input multiple-output systems are also described.      

Nested cooperative encoding protocol for wireless networks with high energy efficiency

Recently, distributed space-time code designs with high cooperative diversity for wireless communication networks, such as ad hoc and sensor networks, have received much attention. Amplify forward and decoding forward are widely used protocols for the cooperative diversity in the wireless communication networks. In both protocols, the information received by relay terminals are "forwarded" to destination or next relay terminals. Since the signals transmitted by relay terminals and those transmitted from the source terminal are correlated, there is information redundancy. To improve the energy efficiency of cooperative networks, we propose an encoding protocol, which is referred to as a nested cooperative encoding protocol. In our proposed protocol, the received signal at each relay terminal is divided into several sub-signals with the nest lattice structure of source information. Each of the sub-signals contains only a partial information with a smaller size of constellation compared to the original information sent by the source terminal. Do a new encoding or modulation by using these sub-signals before transmitting at relay terminals. It is shown that the proposed new protocols can achieve both high cooperative diversity and high energy efficiency.