有线无线融合的卫星时间敏感网络流调度研究

随着空间通信任务日趋复杂化,尤其是对时间敏感的需求不断提升,一方面要求星内系统的高带宽、可靠性和实时性;另一方面星间无线链路也应具备低时延和高可靠性.但由于卫星内部有线链路与星间无线链路差异大,业务数据经过有线和无线链路联合传输时,容易引发节点拥塞,而无法保障时敏业务的时延有界需求.为了提升数据在空间网络传输的实时性,...     

基于流的无线网络编码

针对无线链路的不可靠性和物理层的广播特性,将网络编码与无线网络相结合,提出一种基于流的无线网络编码算法——FNC。该算法在先验参考路径的基础上,充分利用每个节点处的路由表项,探测编码机会,在有编码机会的节点对满足编码条件的数据流进行网络编码,达到提高网络吞吐量的目的。仿真结果表明：FNC有效提高了整个网络的吞吐量,改善了网络性能。     

A Network Coding Scheme to Improve Throughput for IEEE 802.11 WLAN

In IEEE 802.11 infrastructure wireless local area network (WLAN), the communication between any two nodes is relayed by an access point (AP), which becomes the bottleneck of WLAN and severely restricts the overall throughput. It is well known that network coding technique is able to greatly improve the throughput of wireless networks. But, the available coding schemes do not make full advantage of channel capacity due to the fact that they pick at most one packet from each data flow for coding and the picked packets may have a great difference in packet size, wasting some channel capacity. To remedy the problem, in this paper, we propose the coding scheme that combines multiple buffered packets in one flow into a larger packet for coding so that the packets participating in coding have close sizes. We formulate an integer programming problem to find the optimal packet coding, which is solved by an optimal algorithm with relative high time complexity together with a heuristic algorithm with relative low time complexity. Simulation results show that the proposed coding scheme is able to greatly improve the throughput of WLAN and the throughput gain increases with the growth of the number of coding flows.     

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

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

一种基于自适应网络卷积编码的协作中继方法

在无线衰落信道环境中,协作中继是一种增加额外分集增益的有效方法,而网络编码可以用来提高网络吞吐量。网络编码采用XOR(异或)来混合两个源端的信息包,其稳健性差并且每个中继只能服务两个源端。该文提出一种自适应网络卷积编码协作中继方法,在中继端采用卷积编码方法代替XOR来混合两个或多个源端的信息包,混合后的信息可以看作是卷积编码器的一路输出,然后将其转发给目的端。当信道处于深度衰落时,该文提出了一种宽松自适应网络卷积编码协作中继方法,放松了中继参与转发的条件。该文提出的中继方法稳健性好,可以自适应匹配变化的无线网络拓扑结构,并且减少了网络编码协作中继方法所需要的中继个数。理论分析和仿真结果表明所提出的中继方法相比网络编码协作中继方法在性能上有大幅提高,尤其是随着协作节点数目增加,可保证系统获得稳定的额外满分集增益。     

多播网络中基于网络编码的高效丢失恢复机制

网络编码为无线网络中可靠多播通信提供了有效解决途径。该文分析了网络中编码机会的变化规律,研究了解码失败的编码数据包对网络编码性能的影响,提出了新的基于网络编码的丢失恢复算法(NCLR)。NCLR要求节点缓存解码失败的编码数据包,并反馈信息给发送节点。根据各个节点的丢包情况,NCLR通过优先传输对编码性能影响较大的数据包,并在需要重传的已编码数据包和原始数据包中选择编码组合,来充分挖掘网络中的编码机会。仿真结果表明相对于已有算法,NCLR算法可以在重传次数和丢失恢复时延方面有显著性能改善。     

一种新的基于虚拟队列的无线多播网络编码调度策略

网络编码由于其传输效率高的特性,近年来在无线多播网络中得到广泛的应用。针对无线多播网络中丢包自动重传效率低的问题,该文提出一种新的基于虚拟队列中数据包到达时间的编码调度策略(CSAT)。在CSAT策略中,为了提高编码效率,采用虚拟队列来存放初始以及未被所有接收者接收到的数据包。考虑到队列的稳定性,CSAT策略按照一定的比率从主次队列选择发送;在次队列发送数据包时,结合了编码和非编码两种方式,根据数据包到达队列的先后,选取能够使较多数据包参与编码的方式发送。仿真结果表明,该文所提的CSAT编码调度策略在有效提高了数据包传输效率的同时,提高了网络的吞吐量并降低了平均等待时延。     

无线物联网中基于网络编码的能量受限数据传输机制

本文针对无线物联网能量有限的应用场景,提出一种基于网络编码的能量受限数据传输机制NCDT.NCDT引入传染病路由的思想,对网络编码数据包的传输方式进行建模.通过限制编码数据包在网络中的复制次数,以及参与数据包交换的移动终端数量,控制网络的整体能量消耗.NCDT机制在限制网络编码资源消耗的同时,保证了在传输过程中取得较高的传输可靠性.     

非对称协作分集通信中网络编码的应用

该文提出了网络编码在非对称三点协作传输系统中的应用。通过协作分集技术和网络编码技术的联合运用,不但可得到无线通信传输系统的分集增益,也可得到系统的编码增益。该文设计的方案,充分考虑无线通信环境的差异性,利用非对称调制方式,在保证较差通信环境中取得通信可靠性的同时,在较优链路采取较高速率进行传输,利用较优链路传输更多的信息,实现系统资源的充分利用。在方案的具体实现中,通过在中继链路的中继节点加入已知信息实现网络编码,使得系统的译码性能得到增加。仿真结果表明,将网络编码技术应用于非对称协作分集通信中,相对比非协作传输方案可增加分集增益,降低系统的误比特率。跟传统对称传输系统相比,可充分利用系统资源,提升了系统传输容量。     

Broadcasting with hard deadlines in wireless multihop networks using network coding

Broadcasting with network coding mixes packets to minimize the number of transmissions, which improves the energy efficiency of wireless networks. On the other hand, delaying the transmissions increases coding opportunities at intermediate nodes, but increases the delay of packets. In this paper, we consider these two contradicting factors and study the problem of minimizing the number of transmissions in wireless networks while meeting the deadline constraints. We show that this problem is NP‐complete; therefore, we provide a heuristic to solve it. First, we construct broadcasting trees, each of them rooted at one source. We then specify overlapping conditions based on the constructed trees, to determine the number of transmissions each node has to perform without the deadline constraints. Then, we partition the set of packets such that coding is performed among the packets of the same partition, which does not result in deadline misses. Linear coding may not be applicable in some wireless networks because of its computational complexity. For these networks, we propose three XOR coding approaches, which rely only on local neighborhood information. Simulation results show that our techniques not only reduce the number of transmissions but also allow the majority of nodes to receive the packets on time. Copyright © 2013 John Wiley & Sons, Ltd.