基于优先级的应用层组播横向差错恢复模型

提出了一种基于优先级的应用层组播横向差错恢复PLER（Priority-based Lateral Error Recovery）模型。该模型把节点划分为多个独立的组,由于组间的错误关联度低,节点通过请求邻近节点来“横向”重传数据可以有效地恢复差错。仿真实验结果表明,与传统的恢复模型相比,PLER能够更有效减少平均链路压力,降低二次丢失率。     

基于重传的多媒体组播自适应包丢失恢复

由于多媒体应用实时性和带宽要求较高，在多媒体组中播中实现包丢失恢复一度被认为是不可能和不必要的，本文提出了一种基于本地重传的 多媒体组播自适应包丢失恢复机制，在实现包丢失恢复的同时，能有效消除时延抖动的影响，通过对本文提出的基于重传的多媒体组播自适应包丢失恢复模型进行分类，揭示了多媒体流接收主机回放特性与包丢失恢复之间的自适应约束关系。     

无线网络中基于网络编码的重传机制

鉴于目前网络编码在单跳无线网络重传中的应用研究都是基于单发-多收场景的局限性,提出一种应用于多发-多收无线网络中的重传机制NCWRM。该重传机制中,网络节点既可以是发送方也可以是接收方,节点发送的数据包在直传和第一次重传中都失败后,第二次重传时广播发送由多个丢失数据包编码组合得到的编码包。多个接收方通过解码编码包得到丢失的数据包,从而实现一次重传获得多个丢失的数据包,可以有效提高重传效率。理论分析和仿真结果表明,NCWRM算法能够明显提高系统的饱和吞吐量,同时减小开销及丢包率。     

一种适合卫星可靠组播的差错恢复方案*

针对卫星网络高误码率、长延时等特点,提出了一种适合卫星可靠组播的差错恢复方案。该方案采用异或（XOR）编译码的方法,可以一次重传恢复多个丢失的数据包;在此基础上,设计了一种基于重传矩阵预处理的最优重传策略来实现重传数量最小化。仿真结果证明了该可靠组播差错恢复方案在卫星环境中的有效性。     

基于转接节点的可靠多媒体多播协议

研讨了多媒体多播应用中的允许延迟和分组丢失率问题,提出了一种基于转接节点概念的可靠多播协议（RMPRM）。RMPRM协议聚焦在允许延迟上提供多媒体服务质量保证,转接节点放置在多播树上,数据恢复在两个转接节点之间进行。RMPRM协议转接能满足重传需求和减少分组的复制数量。给出了RMPRM协议与不可靠多播协议的比较。仿真实验表明,该协议具有较高的传输率和较低的端到端的传输延迟。     

一种高可靠性的组播树恢复方法

应用层组播树中某个非叶子节点失效后,需要重新构建组播树保证失效节点的子孙节点能够正确接收数据。针对这一问题,考虑满足高可靠性环境中保证恢复完整性的情况,提出一种基于备用父节点的组播树预先式恢复方法,即为每个非根节点找到一个备用父节点,使得当某一非叶节点失效时可以迅速的恢复组播树。首先建立模型并对其求解构造恢复方法,然后论证此方法保证组播树恢复的完整性,最后通过仿真实验验证了此方法的有效性以及其在恢复延迟和管理代价上的改进。     

Adaptive hybrid error correction model for video streaming over wireless networks

The Hybrid ARQ (HARQ) mechanism is the well-known error packet recovery solution composed of the Automation Repeat reQuest (ARQ) mechanism and the Forward Error Correction (FEC) mechanism. However, the HARQ mechanism neither retransmits the packet to the receiver in time when the packet cannot be recovered by the FEC scheme nor dynamically adjusts the number of FEC redundant packets according to network conditions. In this paper, the Adaptive Hybrid Error Correction Model (AHECM) is proposed to improve the HARQ mechanism. The AHECM can limit the packet retransmission delay to the most tolerable end-to-end delay. Besides, the AHECM can find the appropriate FEC parameter to avoid network congestion and reduce the number of FEC redundant packets by predicting the effective packet loss rate. Meanwhile, when the end-to-end delay requirement can be met, the AHECM will only retransmit the necessary number of redundant FEC packets to receiver in comparison with legacy HARQ mechanisms. Furthermore, the AHECM can use an Unequal Error Protection to protect important multimedia frames against channel errors of wireless networks. Besides, the AHECM uses the Markov model to estimate the burst bit error condition over wireless networks. The AHECM is evaluated by several metrics such as the effective packet loss rate, the error recovery efficiency, the decodable frame rate, and the peak signal to noise ratio to verify the efficiency in delivering video streaming over wireless networks.     

高效自适应的抗污染攻击网络编码传输方案

本文主要研究网络编码在抗污染攻击中的应用,针对中间节点对收到的所有编码包进行验证浪费网络资源和目的节点解码速率慢等问题,提出一种高效自适应的抗污染攻击网络编码传输方案-EANC(Efficient and Adaptive Network Coding transmission scheme against pollution attack)。EANC方案在数据分组编码阶段,利用按照网络编码的时间和空间特性构造的线性子空间签名方案准确地验证数据分组是否被污染从而有效控制污染数据分组的传播,并且能使中间节点调节验证步骤使之自适应于当前网络的污染程度,从而提高验证效率;在目的节点解码阶段,EANC方案利用目的节点重传恢复机制降低解码恢复时延。仿真结果表明,EANC方案能够减少子空间的签名长度并且降低目的节点解码恢复的平均时延。     

MTCP: scalable TCP-like congestion control for reliable multicast

We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multimedia and collaborative computing, yet non-trivial, because of the potentially large number of receivers involved. Many schemes have been proposed to handle the recovery of lost packets in a scalable manner, but there is little work on the design and implementation of congestion control schemes for reliable multicast. We propose new techniques that can effectively handle instances of congestion occurring simultaneously at various parts of a multicast tree.Our protocol incorporates several novel features: (1) hierarchical congestion status reports that distribute the load of processing feedback from all receivers across the multicast group, (2) the relative time delay concept which overcomes the difficulty of estimating round-trip times in tree-based multicast environments, (3) window-based control that prevents the sender from transmitting faster than packets leave the bottleneck link on the multicast path through which the sender's traffic flows, (4) a retransmission window that regulates the flow of repair packets to prevent local recovery from causing congestion, and (5) a selective acknowledgment scheme that prevents independent (i.e., non-congestion-related) packet loss from reducing the sender's transmission rate. We have implemented MTCP both on UDP in SunOS 5.6 and on the simulator ns, and we have conducted extensive Internet experiments and simulation to test the scalability and inter-fairness properties of the protocol. The encouraging results we have obtained support our confidence that TCP-like congestion control for large-scale reliable multicast is within our grasp.     

基于Internet的可靠多播传输协议

对于大规模多媒体多播应用来说，一个有效发现和修正传输错误的可靠多媒体多播传输协议是必要的。研讨了多媒体多播应用中的传输延迟和分组丢失率问题，提出了一种基于转接节点概念的Internet可靠多播传输协议（IRMTP）。IPMTP协议聚焦在一定延迟上提供多媒体服务质量保证，转接节点放置在多播树上，数据恢复在两个转接节点之问进行，IRMTP协议能满足分组重传需求和减少分组的传输延迟。给出了IRMTP协议与SRM协议的性能比较，仿真实验表明，IRMTP协议能提供较高的传输率和较低的端到端分组传输延迟。     

WSN中基于网络编码的最小广播重传算法

为了减少在无线传感网络中数据的重传次数,提高无线传感网的数据传输效率,提高服务质量,文中提出了一种网络编码的广播算法（WMBR）。在该算法中,依据网络接收节点的丢包情况,创建生成丢包的哈希表,选择并生成高效的重传数据包,然后对数据包再进行二次编码,通过这种方法有效地提高了重传效率。经过软件的仿真,结果表明：相比于普通重传方法及现有的算法而言,这种方法能够有效地降低数据包的重传次数,提高了无线传感网中数据通信的效率。     

Location aware, dependable multicast for mobile ad hoc networks

This paper introduces dynamic source multicast (DSM), a new protocol for multi-hop wireless (i.e., ad hoc) networks for the multicast of a data packet from a source node to a group of mobile nodes in the network. The protocol assumes that, through the use of positioning system devices, each node knows its own geographic location and the current (global) time, and it is able to efficiently spread these measures to all other nodes. When a packet is to be multicast, the source node first locally computes a snapshot of the complete network topology from the collected node measures. A Steiner (i.e., multicast) tree for the addressed multicast group is then computed locally based on the snapshot, rather than maintained in a distributed manner. The resulting Steiner tree is then optimally encoded by using its unique Pr

Full-size image

u" height="11" width="9">fer sequence and is included in the packet header as in, and extending the length of the header by no more than, the header of packets in source routing (unicast) techniques. We show that all the local computations are executed in polynomial time. More specifically, the time complexity of the local operation of finding a Steiner tree, and the encoding/decoding procedures of the related Prüfer sequence, is proven to be O(n²), where n is the number of nodes in the network. The protocol has been simulated in ad hoc networks with 30 and 60 nodes and with different multicast group sizes. We show that DSM delivers packets to all the nodes in a destination group in more than 90% of the cases. Furthermore, compared to flooding, DSM achieves improvements of up to 50% on multicast completion delay.     

An Adaptive Media-Aware Retransmission Timeout Estimation Method for Low-Delay Packet Video

Time-constrained error recovery is an integral component of reliable low-delay video applications. Regardless of the error-control method adopted by the application, unacknowledged or missing packets must be quickly identified as lost or delayed, so that necessary actions can be taken by the server/client on time. Historically, this problem has been referred to as retransmission timeout (RTO) estimation. Earlier studies show that existing RTO estimators suffer from either long loss detection times or a large number of spurious timeouts. The goal of this study is to address these problems by developing an RTO estimation method specifically tailored for low-delay video applications. In the media-unaware mode, this method exploits the temporal dependence in packet delay to optimally manage the tradeoff between the amount of overwaiting and redundant retransmission rate. As opposed to existing methods, our approach is completely adaptive to the source video characteristics and time-varying network conditions, and does not use any preset parameters. In the media-aware mode, on the other hand, the timeout estimates are jointly optimized based on the importance and urgency of the video packets such that the rendering quality is maximized under the given rate constraints. With a comprehensive set of simulation and experimental results, we show that both the media-unaware and media-aware RTO estimators detect lost packets faster and more accurately than their rivals. Furthermore, our results also substantiate the fact that the media-aware RTO estimator outperforms all other RTO estimators in terms of video quality     

多通道并行传输中接收缓存阻塞的缓解方法

针对多通道并行传输中的接收缓存阻塞问题,分析了引起接收缓存阻塞的原因,提出一种改进的缓解接收缓存阻塞的数据包调度方法,综合考虑通道的带宽、时延和丢包率,引入通道质量的评价函数,优化多通道之间的数据包调度,选择质量最好的通道进行传输,减少由于通道特性不同造成的接收端数据包乱序;提出一种改进的数据包重传策略,基于时延和丢包率选择能使数据包最快到达接收端的通道进行重传;提出一种根据通道的带宽-延迟积估算所需接收缓存大小的方法。仿真实验表明,所提出的调度方法和重传策略能够有效地减轻接收缓存阻塞,与CMT-SCTP相比具有更优的性能,所提出的缓存大小的估算方法也能够准确估算所需接收缓存的大小。     

移动IP分布式路由优化研究

IETF提出的移动IP协议对微移动的支持不够,而分布式路由方案能较好地解决该问题。该文在一种分布式移动IP方案的基础上进行了改进：将转向代理的缓存修改为循环列表,减少移动节点接收的乱序分组;当切换转向代理时,移动节点向前一个转向代理发送绑定更新消息,减少转向代理切换时的分组丢失;在转向代理处引入Snoop机制,减少通信对端重传分组数。利用NS2软件对两种方案进行了仿真。仿真结果表明,改进的方案能够明显地减少重传分组和乱序分组,进一步减少远程信令流量和数据流量,提高网络资源的利用率,有效地改善移动IP的性能。     

可靠多媒体多播传输协议

对于大规模多媒体多播应用来说,一个有效发现和修正传输错误的可靠多媒体多播协议是必要的。该文研讨了多媒体多播应用中的允许延迟和分组丢失率问题,提出了一种基于协议转接概念的可靠多播传输协议(RMTP)。RMTP协议聚焦在允许延迟上提供多媒体服务质量保证,转接节点放置在多播树上,数据恢复在两个转接节点之间进行。RMTP协议转接能立即满足重传需求和减少分组的复制数量。最后,给出了RMTP协议的性能分析及与SRM协议的比较。研究表明RMTP协议为多媒体多播传输提供了一种新的有效途径。     

Analysis of link-level hybrid FEC/ARQ-SR for wireless links and long-lived TCP traffic

Since the TCP protocol uses the loss of packets as an indication of network congestion, its performance degrades over wireless links, which are characterized by a high bit error rate. Different solutions have been proposed to improve the performance of TCP over wireless links, the most promising one being the use of a hybrid model at the link level combining Forward Error Correction (FEC), Automatic Repeat Request with Selective Repeat (ARQ-SR), and an in-order delivery of packets to IP. The drawback of FEC is that it consumes some extra bandwidth to transmit the redundant information. ARQ-SR consumes extra bandwidth only when packets are lost, its drawback is that it increases the round-trip time (RTT), which may deteriorate the performance of TCP. Another drawback of ARQ-SR is that a complete packet can be retransmitted to correct a small piece of errored data. We study in this paper the performance of TCP over a wireless link implementing hybrid FEC/ARQ-SQ. The study is done by simulating and modeling long-lived TCP transfers over wireless links showing Bernoulli errors. We are motivated by how to tune link-level error recovery, e.g. amount of FEC, persistency of ARQ, so as to maximize the performance of TCP. We provide results for different physical characteristics of the wireless link (delay, error rate) and for different traffic loads (number of TCP connections).     

Video loss recovery with FEC and stream replication

Packet loss is inevitable in video multicast. In this paper, we propose and study an effective feedback-free loss recovery scheme for layered video which combines forward error correction (FEC) and stream replication. In our scheme, the server multicasts the video in parallel with FEC packets and a number of replicated delayed (ReD) version of the stream. Receivers autonomously and dynamically join the FEC and ReD streams to repair their losses. On the server side, we analyze and optimize the number of replicated streams and FEC packets to meet a certain residual loss requirement (i.e., error after correction). On the receiver side, we analyze the optimal combination of FEC and ReD packets to minimize its loss. We also present a fast yet accurate approximation algorithm for receiver to make such decision. We show that FEC combined with merely one or two replicated streams can effectively reduce the residual error rate (by as much as 50%) as compared with pure FEC or replication alone. Both subjective and objective video measures confirm that our recovery scheme achieves much better visual quality.     

无线传感器网络节点通信抗干扰实验研究

干扰问题是影响传感器节点间成功通信的重要因素,设计抗干扰方案是解决传感器节点通信干扰的首要问题。设置了无线传感器网络节点通信的两种干扰模型：一种是基于环境的干扰模型,旨在得到节点距离和通信强弱的指数关系;另一种是基于人为设置的干扰,旨在得到密封铁盒对铁盒中节点通信强弱的影响。根据丢包率与距离成指数关系原理得出不同干扰下的干扰系数值,针对所设置的不同通信干扰模型,统一采取丢包重传的抗干扰技术,可以降低丢包率,提升传感器网络节点通信抗干扰性能。     

An efficient homomorphic MAC-based scheme against data and tag pollution attacks in network coding-enabled wireless networks

Recent research efforts have shown that wireless networks can benefit from network coding (NC) technology in terms of bandwidth, robustness to packet losses, delay and energy consumption. However, NC-enabled wireless networks are susceptible to a severe security threat, known as data pollution attack, where a malicious node injects into the network polluted packets that prevent the destination nodes from decoding correctly. Due to recoding, occurred at the intermediate nodes, according to the core principle of NC, the polluted packets propagate quickly into other packets and corrupt bunches of legitimate packets leading to network resource waste. Hence, a lot of research effort has been devoted to schemes against data pollution attacks. Homomorphic MAC-based schemes are a promising solution against data pollution attacks. However, most of them are susceptible to a new type of pollution attack, called tag pollution attack, where an adversary node randomly modifies tags appended to the end of the transmitted packets. Therefore, in this paper, we propose an efficient homomorphic message authentication code-based scheme, called HMAC, providing resistance against data pollution attacks and tag pollution attacks in NC-enabled wireless networks. Our proposed scheme makes use of three types of homomorphic tags (i.e., MACs, D-MACs and one signature) which are appended to the end of the coded packet. Our results show that the proposed HMAC scheme is more efficient compared to other competitive tag pollution immune schemes in terms of complexity, communication overhead and key storage overhead.