联合蜂窝与D2D链路的网络编码广播重传方案

移动设备之间的合作以及利用蜂窝和D2D链路等多个接口有望满足日益增长的吞吐量需求。考虑设备配备有双接口的无线D2D广播（Network coding for dual interfaces,NCDI）场景,重传阶段,设备同时利用蜂窝与D2D链路来恢复丢失数据包。然而,如何合理的进行编码调度,充分发挥网络编码增益显得至关重要。为最小化重传次数,文章旨在设计联合蜂窝与D2D链路的网络编码广播重传方案。针对随机线性网络编码（RLNC）与立即可译网络编码（IDNC）,分别提出了NCDI-RLNC以及NCDI-IDNC方案。仿真结果表明,与其他方案相比,提出的两种方案均能够有效地提高重传效率、减少重传次数。      

一种改进的网络编码广播重传算法

在无线网络广播传输中,为了提升效率提出改进的基于冗余避免的网络编码广播重传算法（INCBRRA）。对接收状态矩阵进行重排列后,再主动避免重传不可解码的编码组合,从而优先编码有助于接收节点解码的丢失数据包组合。分析结果表明,INCBRRA算法相比于现有算法能有效减少重传次数,提升了传输效率。     

D2D网络中基于牺牲节点的网络编码协作重传策略

针对D2D无线网络中多终端并发协作重传过程中平均解码时延较高的问题,提出了一种牺牲节点的协作重传策略.在重传阶段,发送终端在立即可解网络编码(Instantly Decodable Network Coding,IDNC)图上根据接收终端与发送终端的链路质量、终端数据包权重和接收终端的连通度选择出发送终端的最优编码包,...     

一种新的基于多节点网络编码的无线广播重传算法

提出了一种基于网络编码的无线网络广播重传算法。该算法按照包丢失分布概率的特点生成新的重传序列,采用多节点的网络编码方法进行丢失包组合实现重传。通过数学分析和仿真证明,该算法能保证接收节点的编码可解性,同时重传次数可达到局部最优性;与传统重传方法相比,该算法可以有效地减少信息包的平均传输次数,从而提高传输效率。     

D2D网络中基于立即可解网络编码的时延最小化重传方案

该文针对D2D无线网络中多终端并发协作重传冲突避免问题,提出一种基于立即可解网络编码的时延最小化重传方案。在重传阶段,充分利用D2D无线网络终端协作传输数据的优势,结合各终端数据包接收状态,综合考虑时延的影响因素,选取单次重传时延增量较小的数据包生成编码包,最小化重传时延。同时,构建终端冲突图,在图中搜索极大独立集,根据各终端的编码包权重值,选择最大加权独立集中的终端作为并发协作重传终端,从而降低重传次数。仿真结果表明,所提方案能够进一步改善D2D无线网络的重传效率。     

基于二进制网络编码的无线广播重传方法

为了提高无线广播网络中数据包的传输效率,提出了一种新的基于二进制网络编码的高效无线广播重传方法(WBRBNC).法基于数据包分布矩阵(PDM),在广播重传过程中使用一种新的数据包算法选取编码包,对这些丢包采用二进制网络编码方法进行编码,然后再进行广播,使一次广播重传可以使多个具有不同丢包的接收机受益.分析和仿真表明,该方法能有效保证接收节点的编码可解性,使重传次数显著减少,更接近于理论值,从而大大提高了传输效率.另外,该方法计算开销小,很适合应用在卫星广播网和无线传感器网等资源受限的系统中.     

基于网络编码的无线网络广播重传方法

提出了一种适用于无线广播的基于网络编码的重传方法--NCWBR,通过网络编码组合不同的丢失包进行重传.理论分析表明,该方法能保证接收节点的编码可解性,同时重传次数较原方法更优;模拟测试结果表明,与逐个重传的方法相比,NCWBR有效地减少了信息包的平均传输次数,提高了传输效率.     

一种基于机会式网络编码的高效广播重传方法

为了提高无线广播网络中数据传输的效率,该文提出了一种新颖的基于机会式网络编码的重传方法。将机会式网络编码技术应用于丢包的重传,并采用高效的丢包组合策略生成重传包。根据网络终端的丢包情况,首先创建丢包的哈希表,再根据哈希表快速选择满足一定编码条件的丢包以生成重传数据包,从而在提高重传性能的同时,有效地降低了重传方法的复杂度。仿真结果表明该方法相比已有算法能有效地减少重传次数,并提高重传包发送和接收的效率。     

适合TCP的网络编码重传机制

通过理论分析,看出基于反馈的重传方法比定量重传的方法有更低的解码延迟。提出了一种新型的基于反馈的网络编码(FNC)重传机制,利用seen机制中的隐含信息来获取接收方解码所需的重传分组个数,并改变了编码规则使部分分组可以提前解码。该机制不仅可以处理有固定误码率的随机分组丢失,还可以有效地应对大量突发性分组丢失。仿真结果显示,该机制在高误码率下也能保持较高的吞吐量,且极大地减少了解码延迟,传输过程基本不受分组丢失的影响,有效地对拥塞控制协议隐藏了链路错误。算法简单有效,更适于在实际系统中应用。     

多播网络中基于机会网络编码改进的重传方法

针对高链路分组丢失率下HLAR (hash lookup assisted retransmission)等重传方法存在的编码率低、算法性能下降等缺陷,提出了一种改进的基于机会网络编码的广播重传方法.该方法根据接收节点反馈的丢失分组情况,不仅能够通过散列查找快速选择丢失分组组合进行编码重传,并优先重传能让最多接收节点恢复其丢失分组的单个重传分组,而且基于邻域关联充分挖掘编码机会,允许节点从多个重传分组中恢复丢失分组,从而在保持较低算法复杂度的情况下,有效地提高重传性能.仿真结果表明,相对于已有算法,该方法能有效减少重传次数,提高传输效率.     

基于格签名的安全网络编码（英文）

To provide a high-security guarantee to network coding and lower the computing complexity induced by signature scheme,we take full advantage of homomorphic property to build lattice signature schemes and secure network coding algorithms.Firstly,by means of the distance between the message and its signature in a lattice,we propose a Distance-based Secure Network Coding(DSNC) algorithm and stipulate its security to a new hard problem Fixed Length Vector Problem(FLVP),which is harder than Shortest Vector Problem(SVP)on lattices.Secondly,considering the boundary on the distance between the message and its signature,we further propose an efficient Boundary-based Secure Network Coding(BSNC)algorithm to reduce the computing complexity induced by square calculation in DSNC.Simulation results and security analysis show that the proposed signature schemes have stronger unforgeability due to the natural property of lattices than traditional Rivest-Shamir-Adlcman(RSA)-based signature scheme.DSNC algorithm is more secure and BSNC algorithm greatly reduces the time cost on computation.     

基于网络编码的Ⅲ型HARQ无线广播跨层设计

为提高无线广播效率,该文设计一种基于网络编码的Ⅲ型混合自动重传请求(HARQ)机制,同时为执行网络编码重传,提出一种异或型联合策略。其主要思想是通过网络编码(NC),使重传数据包能服务于尽量多的用户,并且每个用户能获得丢失包的软信息,以实施联合网络-信道译码。文章进一步利用机会中继的思想,将所提NC-HARQ Ⅲ型机制扩展到中继广播系统。数值分析和仿真表明,NC-HARQ Ⅲ型机制能显著降低广播系统的平均传输次数,与I型HARQ和NC-HARQ Ⅰ型机制相比,其性能增益应归功于网络编码的潜在优势和联合网络-信道译码技术带来的较低的误包率。     

Bandwidth‐Efficient Selective Retransmission for MIMO‐OFDM Systems

In this work, we propose an efficient selective retransmission method for multiple‐input and multiple‐output (MIMO) wireless systems under orthogonal frequency‐division multiplexing (OFDM) signaling. A typical received OFDM frame may have some symbols in error, which results in a retransmission of the entire frame. Such a retransmission is often unnecessary, and to avoid this, we propose a method to selectively retransmit symbols that correspond to poor‐quality subcarriers. We use the condition numbers of the subcarrier channel matrices of the MIMO‐OFDM system as a quality measure. The proposed scheme is embedded in the modulation layer and is independent of conventional hybrid automatic repeat request (HARQ) methods. The receiver integrates the original OFDM and the punctured retransmitted OFDM signals for more reliable detection. The targeted retransmission results in fewer negative acknowledgements from conventional HARQ algorithms, which results in increasing bandwidth and power efficiency. We investigate the efficacy of the proposed method for optimal and suboptimal receivers. The simulation results demonstrate the efficacy of the proposed method on throughput for MIMO‐OFDM systems.     

An adaptive end‐to‐end RTO calculation framework for DTNs with scheduled connectivity

In this work, we propose an end‐to‐end retransmission framework for dynamically calculating efficient retransmission time‐out intervals in delay‐tolerant networks (DTNs) with scheduled connectivity. The proposed framework combines deterministic and statistical information about the network state to calculate worst‐case estimates about the expected round trip times. Such information includes connectivity schedules, convergence layer protocols specifics, communication link characteristics, and network statistics about the maximum expected packet error rates and storage congestion. We detail the implementation of the proposed framework within the end‐to‐end application data conditioning layer proposed for the DTN architecture, realized by the Delay‐Tolerant Payload Conditioning protocol, as part of the Interplanetary Overlay Network–DTN reference implementation, and evaluate its performance in a complex deep‐space emulation scenario in our DTN testbed. Our results show that our approach achieves great accuracy in round‐trip time estimations and, therefore, faster retransmissions of lost data, in comparison to the statically configured retransmission mechanism of the original Delay‐Tolerant Payload Conditioning protocol. As a result, in‐order data reception rate and storage requirements on the receiver side are significantly improved, at minimum or even zero extra cost in transmission overhead due to duplicate transmissions.     

一种基于网络编码的重传算法研究

无线网络中,节点发送的数据分组传输失败后,执行重传机制。传统的重传机制ARQ由于在一次重传中只能发送一个丢失的数据分组,因此传输效率比较低。利用网络编码技术和AQR重传机制,我们可以在重传中使用网络编码,广播发送由多个丢失数据分组编码得到的编码分组,从而提高重传效率。本文中我们提出一种将网络编码应用于多个发送方多个接收方(MSMR)无线网络中的算法RMBNC。理论推导和仿真分析验证了我们提出的算法的有效性。     

Concurrent Multipath Transfer Using SCTP Multihoming Over Independent End-to-End Paths

Concurrent multipath transfer (CMT) uses the Stream Control Transmission Protocol's (SCTP) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. We identify three negative side-effects of reordering introduced by CMT that must be managed before efficient parallel transfer can be achieved: (1) unnecessary fast retransmissions by a sender; (2) overly conservative congestion window (cwnd) growth at a sender; and (3) increased ack traffic due to fewer delayed acks by a receiver. We propose three algorithms which augment and/or modify current SCTP to counter these side-effects. Presented with several choices as to where a sender should direct retransmissions of lost data, we propose five retransmission policies for CMT. We demonstrate spurious retransmissions in CMT with all five policies and propose changes to CMT to allow the different policies. CMT is evaluated against AppStripe, which is an idealized application that stripes data over multiple paths using multiple SCTP associations. The different CMT retransmission policies are then evaluated with varied constrained receive buffer sizes. In this foundation work, we operate under the strong assumption that the bottleneck queues on the end-to-end paths used in CMT are independent.