Homomorphic Hashing Verification for Wireless Sensor Networks Rateless Codes Over-the-Air Programming

The homomorphic hash algorithm(HHA)is introduced to help on-the-fly verify the vireless sensor network(WSN)over-the-air programming(OAP)data based on rateless codes.The receiver calculates the hash value of a group of data by homomorphic hash function,and then it compares the hash value with the receiving message digest.Because the feedback channel is deliberately removed during the distribution process,the rateless codes are often vulnerable when they face security issues such as packets contamination or attack.This method prevents contaminating or attack on rateless codes and reduces the potential risks of decoding failure.Compared with the SHA1 and MD5,HHA,which has a much shorter message digest,will deliver more data.The simulation results show that to transmit and verify the same amount of OAP data,HHA method sends 17.9% to 23.1%fewer packets than MD5 and SHA1 under different packet loss rates.

A Joint Activity and Data Detection Scheme for Asynchronous Grant-Free Rateless Multiple Access

This paper considers the frameasynchronous grant-free rateless multiple access(FAGF-RMA)scenario,where users can initiate access at any symbol time,using shared channel resources to transmit data to the base station.Rateless coding is introduced to enhance the reliability of the system.Previous literature has shown that FA-GFRMA can achieve lower access delay than framesynchronous grant-free rateless multiple access(FSGF-RMA),with extreme reliability enabled by rateless coding.To support FA-GF-RMA in more practical scenarios,a joint activity and data detection(JADD)scheme is proposed.Exploiting the feature of sporadic traffic,approximate message passing(AMP)is exploited for transmission signal matrix estimation.Then,to determine the packet start points,a maximum posterior probability(MAP)estimation problem is solved based on the recovered transmitted signals,leveraging the intrinsic power pattern in the codeword.An iterative power-pattern-aided AMP algorithm is devised to enhance the estimation performance of AMP.Simulation results verify that the proposed solution achieves a delay performance that is comparable to the performance limit of FA-GF-RMA.

Efficient unequal error protection for online fountain codes

In this paper,an efficient unequal error protection(UEP)scheme for online fountain codes is proposed.In the buildup phase,the traversing-selection strategy is proposed to select the most important symbols(MIS).Then,in the completion phase,the weighted-selection strategy is applied to provide low overhead.The performance of the proposed scheme is analyzed and compared with the existing UEP online fountain scheme.Simulation results show that in terms of MIS and the least important symbols(LIS),when the bit error ratio is 10-4,the proposed scheme can achieve 85%and 31.58%overhead reduction,respectively.

Performance analysis of complexity reduction BP decoding of rateless codes by deleting low reliable symbols

This paper investigates the performance of the method used to reduce the decoding complexity of rateless codes through the deletion of the received symbols with low reliability. In the decoder, the received symbols whose absolute value of logarithm likelihood ratio （LLR） is lower than the threshold are removed, together with their corresponding edges, and thus not involved in the decoding process. The relationship between the deletion probability and the likelihood ratio deletion threshold is derived. The average mutual information per received symbol is analyzed in the case of deletion. The required number of symbols for the decoder to keep the same performance as regular decoding decreases since the average mutual information per symbol increases with the deletion, thus reducing the decoding complexity. This paper analyzes the reduction of decoding computations and the consequent transmission efficiency loss from the perspective of mutual information. The simulation results of decoding performance are consistent with those of the theoretical analysis, which show that the method can effectively reduce the decoding complexity at the cost of a slight loss of transmission efficiency.

Serial decoding of rateless code over noisy channels

Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rateless decoder usually works in a parallel manner which needs to initiate a new belief propagation (BP) decoding procedure upon each newly received collection of coded packets,thereby resulting in prohibitive decoding complexity in practice.In this paper,we present a novel serial decoding algorithm,i.e.,the serial storage belief propagation (SS BP) algorithm,for rateless codes over noisy channels.Specifically,upon receiving a new group of coded packets,the decoder initiates a new attempt to decode all the packets received so far,using the results of the previous attempt as initial input.Moreover,in each iteration of the new attempt,the decoder serially propagates the messages group by group from the most recent one to the earliest one.In this way,the newly updated messages can be propagated faster,expediting the recovery of information packets.In addition,the proposed serial decoding algorithm has significantly lower complexity than the existing parallel decoding algorithms.Simulation results validate its effectiveness in AWGN,Rayleigh,and Rician fading channels.

低占空比无线传感网中使用无速率码的高效机会路由算法

低占空比无线传感网中的高效传输是一个研究的焦点。机会路由作为无线传感网中一种高效的传输算法,仍然存在着缺陷。对只有单邻居的弱连通节点,机会路由算法无法处理。即使在多邻居情况下,由于邻居醒来顺序的随机性机会路由也会尝试在低质量的链路上传输。对此提出一种使用无速率码的高效机会路由算法(Efficient Opportunistic Routing with Rateless Code,EORRC)。利用无速率码,EORRC可以在低质量链路传输时提高传输成功率,并能处理弱连通情景,从而降低时延与能耗。仿真实验证明了EORRC拥有更低的时延与能耗。

Rate Adaptation for Decoding-and-Forward Relay Channel by Random Projections Codes

This paper investigates rate adaptation schemes for decoding-and-forward (DF) relay system based on random projections codes (RPC). We consider a classic three node relay system model, where relay node performs on half-duplex mode. Then, we give out receiving diversity relay scheme and coding diversity relay scheme, and present their jointly decoding methods. Furthermore, we discuss the performance of the two schemes with different power allocation coefficients. Simulations show that our relay schemes can achieve different gain with the help of relay node. And, we should allocate power to source node to just guarantee relay node can decode successfully, and allocate remain power to relay node as far as possible. In this way, this DF relay system not only achieves diversity gain, but also achieves higher and smooth spectrum efficiency.

EFFICIENT DESIGN OF ANTI-JAMMING RATELESS CODING IN COGNITIVE OFDM

Efficient anti-jamming rateless coding based on cognitive Orthogonal Frequency Division Multiplexing (OFDM) modulation in Cognitive Radio Network (CRN) is mainly discussed. Rateless coding with small redundancy and low complexity is presented, and the optimal design methods of building rateless codes are also proposed. In CRN, anti-jamming rateless coding could recover the lost packets in parallel channels of cognitive OFDM, thus it protects Secondary Users (SUs) from the in-terference by Primary Users (PUs) efficiently. Frame Error Rate (FER) and throughput performance of SU employing anti-jamming rateless coding are analyzed in detail. Performance comparison between rateless coding and piecewise coding are also presented. It is shown that, anti-jamming rateless coding provides low FER and Word Error Rate (WER) performance with uniform sub-channel selection. Meanwhile, it is also verified that, in higher jamming rate and longer code redundancy scenario, rateless coding method could achieve better FER and throughput performance than another anti-jamming coding schemes.

Multiple Access Rateless Network Coding for Machine-to-Machine Communications

In this paper, we propose a novel multiple access rateless network coding scheme for machine-to-machine （M 2M） communications. The presented scheme is capable of increasing transmission efficiency by reducing occupied time slots yet with high decoding suc-cess rates. Unlike existing state-of-the-art distributed rateless coding schemes, the proposed rateless network coding can dynami-cally recode by using simple yet effective XOR operations, which is suitable for M2M erasure networks. Simulation results and analysis demonstrate that the proposed scheme outperforms the existing distributed rateless network coding schemes in the scenar-io of M2M multicast network with heterogeneous erasure features.

基于Raptor10码的自由空间光通信系统设计

大气湍流是自由空间光通信系统的主要限制因素,会造成光束的强度闪烁和相位起伏。为了应对大气湍流及背景光对无线激光通信的影响,设计并实现了一套无线激光通信系统。该系统采用数字喷泉码Raptor10码来提高通信系统的可靠性及抗干扰能力。此外还使用了巴克码作为帧头以及脉冲位置调制(PPM)方式,并以现场可编程门阵列(FPGA)为核心完成了数据的编码、调制、帧同步、解调及译码。其发射光源为波长532 nm激光,探测器采用Silicon Sensor公司的单点APD。最后在2 km的自由空间对整个无线激光通信系统进行测试,测试结果稳定可靠。

无线网络抗干扰攻击的自适应无速率通信

针对干扰攻击干扰信号解码、降低通信性能的问题,提出一种具备抗干扰攻击能力的自适应无速率通信机制。它将原始报文拆分为多个编码分片并分别传输,从而降低干扰攻击的影响并充分利用非连续的可用间隙。通过自适应调整分片的长度,在干扰攻击频繁时减少长度以获得更好的鲁棒性,在攻击概率较低时增大长度以提高效率。实验结果表明,当干扰攻击严重时,与直接通信相比,新机制的吞吐量平均提高50%以上,稳定性提高一个数量级。因此,自适应无速率通信可有效抵御干扰攻击并获得较高的通信效率。

基于抛物线映射的混沌LT编码算法

该文提出一种基于抛物线映射和混沌置乱方法的LT编码算法。首先用混沌初始值作为密钥,采用抛物线映射产生混沌序列并转换为类均匀分布序列,再通过位置置乱算法生成LT码的度分布和度邻接数据序列,较传统的重要抽样方法具有更高的灵敏度,保留了理论分布的结构。实验结果表明,该算法具有实现结构简单、分组头部开销小、保密性好及高于传统重要抽样方法的性能。

高阶QAM调制下基于对数似然比门限的自适应解调方案

现有的自适应解调方案中采用的调制星座阶数最高仅限于16,且方案分析和设计中没有考虑信道编码的译码环节。该文研究适用于高阶QAM调制的自适应解调算法,并结合无率纠错码提出一种收端速率自适应方案。收端将符号中每个比特的对数似然比绝对值与设定的解调门限值比较,大于该解调门限值的比特解调,否则删除。无率码译码码字长度固定,通过调整解调门限达到误码性能要求。在解调比特的平均互信息分析的基础上,给出不同信噪比下达到期望的译码误码性能要求的解调门限值及解调比例的计算方法。以256-QAM星座和Raptor码为例给出方案设计实例并进行仿真,仿真结果验证了理论分析的正确性和方案的有效性。

一种基于LT码的不等错误保护方法

针对在各种恶劣的信道环境中优先保证码流中相对重要数据的正确传输问题,提出了一种改进的基于LT码的不等错误保护(UEP)方案。首先在分析了目前基于LT码的UEP方案中因数据简单舍入操作可能带来性能恶化问题的基础上,提出了将度分布修正系数修改为优先级和输出节点度数的函数并且在计算重要数据节点的度数时采用按概率上下取整操作的改进方案,克服了目前方案中存在的性能恶化问题;然后推导了其在BEC信道中采用最大似然概率(ML)译码时UEP性能的理论上下界;最后对其在多进制删除信道中采用置信传播(BP)算法译码时的UEP性能进行了仿真实验。理论分析和仿真实验的结果都显示,与目前方案相比,该改进方案具有较好的UEP性能,同时增强了设计的灵活性。

非规则RA码无码率特性分析

介绍了非规则重复累积(repeat-accumulate,RA)码的构成原理,引入了编码线图进行RA码的图模型表示。详细分析了编码中的两种交织策略,并证明了其等价性。通过分析非规则RA码的奇偶校验位的生成过程,证明了非规则RA码的无码率特性。给出了不同码率情况下的系统非规则RA码在二元删除信道性能曲线。通过与LT码的比较,表明非规则RA码是逼近容量限的错误平层性能较低的无码率码。对系统非规则RA码的错误平层进行分析,并给出了降低错误平层的编码修正方法。

译码迭代次数约束下累积无率码的优化设计

以最大化码率为目标设计的无率编码通常能够实现逼近容量的性能,但是这种编码在译码时需要进行非常多次(理论上是无穷多次)的迭代才能达到预期的误比特率性能。基于外部信息转移图的渐近收敛分析,提出一种在有限译码迭代次数约束下的非系统累积无率码编码度分布的优化设计方法,给出此优化问题的数学模型。通过求解该优化问题可得到满足要求的编码度分布函数。仿真结果表明,与以最大化码率为目标设计的编码相比,在有限的译码迭代次数下,所提出的方法设计的编码能获得更好的纠错性能,且译码迭代次数越小,性能优势越明显。

多跳分集系统中一种新的基于无比率编码的跨层方案

研究了多跳分集系统中由于链路的不可靠传输直接应用实用网络编码存在差错的扩散和传播问题。提出了一种新的基于无比率编码的跨层方案,该方案利用无比率编码的纠错能力及实用网络编码码字随机特性,控制了输入链路的差错扩散和传播。结果表明,在满足每条链路误包率一定的情况下,该方案获得了较好的差错性能。进一步分析了为了使每条链路达到给定的误包率,无比率编码在不同信噪比下的冗余。

基于短码长的喷泉码度分布设计

度分布对喷泉码的构造具有至关重要的作用,它直接决定喷泉码的编译码性能。对采用鲁棒弧波度分布、截短度分布、固定度分布这三类常用度分布的喷泉码,进行性能分析和仿真,结果表明:译出同等数量码字时,喷泉码的译码开销随着码长的增加而降低;当输入码长K较大时,采用鲁棒弧波度分布的喷泉码的译码开销最小,而码长K较小时,采用截短度分布的喷泉码所需的译码开销最小。考虑到实际应用中有效性和可靠性,构造了一种用于短码长的优化度分布。仿真结果表明,在相同译码开销情况下,优化度分布的译码成功概率相比于传统的截短度分布提高了一个数量级以上。

基于无率纠错码和高阶QAM调制的收端速率自适应方案

现有的自适应解调方案中调制阶数最高仅限于16,且方案分析和设计中没有考虑信道编码的译码环节.本文研究适用于高阶QAM的自适应解调算法,并结合无率纠错码提出一种收端速率自适应方案.接收端有多种解调模式,每种解调模式删除一个符号中不同数量的、似然比绝对值最低的几个比特,以提高解调比特的可靠度和平均互信息.从互信息分析的角度,得到在满足要求的译码误码性能时,译码所需要的码字长度的理论结果,进一步给出在译码复杂度约束条件下解调模式的选择方案.以256-QAM调制星座和Raptor码为例对方案进行了仿真,验证了理论分析的正确性和方案的有效性.

高效内容分布网络设计与实现

结合CDN和P2P两种不同网络结构的优点,改善传统内容分布网络拓扑结构,使用基于无比率限制纠错码技术改进Swarming传输协议,给出了一种高效内容分布网络设计。介绍了该内容分布网络的系统结构及相关关键技术等方面内容,以及这种新内容分布网络的特性。