无线多播中基于网络编码的QoS研究

在无线网络中使用网络编码可以提高吞吐量和降低能耗．近来,有许多工作在研究如何利用网络编码来提高吞吐量,但是很少有考虑到QoS．本文重点研究在实时无线网络中数据包在延时约束条件下,网络编码的广播调度问题,目标是在数据包的误时率（deadlinemissratio）容许范围内,减少重传包的数量．我们将综合两种编码调度方案,阐释各自的优劣,动态地选取编码方案．仿真结果显示,我们的算法可以有效减少重传包的数量．     

无线网络中优化TCP性能的网络编码方法研究

网络编码的出现为改进网络的传输性能提供了新的方法.J.K.Sundararajan等人将网络编码技术与传输控制协议相结合,提出了基于网络编码的TCP/NC协议,其在改进无线网络中传统TCP的性能方面取得了明显效果.但该协议及其改进协议存在的数据传榆和解码操作同步性问题会严重影响TCP/NC性能.提出的改进协议TCP/NCW根据解码时间调节解码窗口,以确保数据传输和解码操作同步,从而获得更好性能.运用排队论分析了TCP/NCW最优解码窗口的存在性.在NS2中的仿真结果表明,在静态场景和动态场景下TCP/NCW的吞吐率比TCP/Vegas和TCP/NC有显著提高,同时也具有较好的公平性.     

Investigating the performance of TCP in mobile ad hoc networks

Mobile ad hoc networks have several inherent characteristics (e.g. dynamic topology, time-varying and bandwidth constrained wireless channels, multi-hop routing, and distributed control and management). The goal of this work is to investigate the impact of these characteristics on the performance of TCP. First, we investigate throughput performance of TCP as a function of path length (i.e. multiple wireless hops), node mobility, and traffic intensity. Next, we examine the ‘fairness’ of the ad hoc network with regard to equal sharing of network bandwidth among multiple TCP flows. Third, we evaluate the impact of two on-demand routing protocols (i.e. AODV and DSR) on the throughput of TCP. Finally, a factorial design experiment is conducted to quantify the effects and interactions of three factors, which influence the throughput of TCP. These factors include routing, node speed, and node pause time. Two key results were observed. Results show that traffic intensity (e.g. number of concurrent flows) is significantly affects TCP throughput, suggesting the need for congestion control, scheduling and traffic management schemes. Second, source routing achieves higher throughputs while also generating significantly less routing overhead than AODV. Results also show that in some instances, the fairness of the network is very uneven among concurrent TCP flows, resulting in several sending stations achieving very little or no throughput.     

一种基于网络编码的无线网络机会路由算法

机会路由和网络编码是近几年出现的两项新技术,它们能使有损网络达到较高的吞吐量.然而,已有的研究两者大多是分离的,这样不能同时发挥两者的优势.提出了一种基于网络编码的无线网络机会路由算法- MinACK( Minimum ACKnowledgement),它结合了机会路由和网络编码各自的优势,能够在网络中同时传输多个段的...     

无线Mesh网多路径混合包的传输方法

无线Mesh网络是目前无线网络中的研究热点,而Mesh网络中的一个重要瓶颈就是网络吞吐量受到限制.多路径传输可使无线网络获得更高的带宽达到提高吞吐量的目的,然而它也会造成能效降低,调度复杂;因此,提出一种吞吐量能有效提高的方法,将一种改进的新网络编码与多路径结合在一起,通过把数据包以段为单位进行编码,然后把编码后相互独立的多份数据沿多条路径进行传输,有效的降低数据包的重传,减少通信量.在提高吞吐量的同时,保证了数据传输的可靠性.模拟实验结果表明该方法有效.     

基于机会网络编码的视频流传输性能仿真研究

研究无线网络中基于机会网络编码的实时视频数据传输性能。深入分析网络编码的工作原理及其对于无线网络性能的提升, 在简要介绍视频传输特点的基础上探讨机会网络编码支持视频传输的要点, 通过仿真的方法研究无线网络中基于机会网络编码的实时视频传输性能, 并比较分析传输后的重构图像与原始图像的质量。仿真结果表明, 网络编码不仅可以提高网络吞吐量, 还提高了视频传输的质量。     

应用累积系数确认的网络编码机会路由协议

在无线mesh网络中,机会路由通过高效使用无线传输的广播特性显著地提高了无线网络的吞吐量.引入网络编码,使得机会路由协议可以避免复杂的调度,更加易于实现.然而,网络编码的引入给机会路由协议带来新的问题：转发节点应该发送多少编码包?MORE等协议依据平均链路状况信息来预计节点转发编码包数目的方法,无法准确判定发送的冗余.以CCACK为代表的研究采用逐跳反馈的方式来减少编码包的冗余发送.首先,针对采用正交向量确认的CCACK机制进行分析,说明了CCACK尽管可以减少确认开销,减少误判,但却带来了“信息空间已覆盖而无法正交”的漏判问题.在此基础上,提出了一种基于累积编码系数反馈确认的网络编码机会路由协议CFACK.该确认机制中转发节点通过侦听下游节点的编码系数向量,并与来自上游节点的编码系数向量进行相关性分析,从而获知下游节点信息是否覆盖自身信息.证明了在无差错网络环境下该确认机制不存在误判和漏判的可能,同时,在有差错网络环境下对该确认机制的有效性进行了分析.结果表明：在一般节点分布情况下,利用额外的一次携带确认,可以确保90%以上的准确性.仿真测试结果表明：CFACK相比CCACK,显著提高了网络的吞吐量,平均提高率为72.2%,同时在编码计算、存储和包头开销上都少于CCACK.     

无线车载网络中一种基于跨层优化的网络编码TCP协议

无线车载网络(Wireless Vehicular Networks,WVN)具有研究价值和重要应用价值,目前关于WVN中的网络编码TCP协议的研究并不多,且对跨层的优化也没有被重视。文中首先针对无线车载网络中不同的丢包原因,给出了一种基于随机线性网络编码的跨层联合优化方法VC-TPC/NC,可以针对不同丢包原因采取不同的处理方式;进一步,重新设计了网络编码层发送端的发送策略,并通过理论分析说明了VC-TCP/NC在时延和网络吞吐量方面的优势;最后,在不同场景下的仿真结果表明,VC-TCP/NC的性能相比于传统TCP与TCP/NC等性能有较大提高。     

双向中继网络中的物理层网络编码方案

双向中继系统中的物理层网络编码可以有效的提高无线中继网络的吞吐量,受到了普遍关注。为了提升物理层网络编码在无线信道中的性能,提出了联合网络编码与信道编码设计思想。在联合信道编码-网络编码思想基础上,提出了一种结合LDPC信道编码和网络编码的线性性质来提升网络编码在双向中继系统中的性能,并最后给出该方案的误码率仿真图。     

一种TD-HSUPA系统的TCP优化方法

TCP在TD-HSUPA系统中的表现不理想,需要采取一些优化措施,在分析了TD-HSUPA系统的网络协议结构之后,提出了一种适用于TD-HSUPA系统的TCP优化方法--由RNC解析终端TCP连接的状态,在终端可能出现超时之前,由NodeB通过调度和信道分配相结合的方法改变终端物理层网络环境.经仿真表明,对于复杂多变的...     

流内编码中考虑链路相关性的机会路由机制

现存的结合网络编码的机会路由协议假设无线链路传输是相互独立的,但是相关研究表明无线链路传输具有相关性。链路相关性会影响节点转发编码包的次数以及转发节点的选取,进而降低协议的性能表现。对此,提出了一种流内编码中考虑链路相关性的机会路由机制。在该机制中,节点周期性收集邻居节点的反馈信息以衡量链路相关性,并由此准确计算节点期望转发次数进而选取总转发次数更少的转发节点集合。仿真实验表明,该机制能显著降低网络中的发送冗余,提高网络的整体吞吐量。     

低开销的无线网络编码机会路由协议设计

针对基于无线Mesh网络编码的机会路由协议的节点转发冗余问题,从线性空间的角度对该类协议的信息传输过程进行建模与分析,提出一种基于动态冗余控制的无线Mesh网络编码机会路由协议。该协议利用零空间确认技术估计各节点的更新信息总量,根据更新总量动态调整节点转发冗余,通过引入转发优先级调度机制,避免不同的转发节点重复转发来自于相同线性空间的编码包。仿真实验结果显示,与经典的MORE协议相比,该协议能提高30％-100％的网络吞吐量,同时降低20％-45％的归一化开销。     

基于源定向中继的机会网络编码的研究与实现

将源定向中继的思想与机会网络编码结合起来,定义了蝶形结构和链状结构的机会网络编码,并提出一种新的环形结构,大大地降低了网络编码的实现难度,从而使网络编码在无线环境下的应用成了现实。在NS2平台上的仿真结果表明,进行机会网络编码后,吞吐量明显提高,同时具有高能量效率。     

Analysis and scheduling of practical network coding in OFDMA relay networks

Network coding has become a prominent approach to improve throughput of wireless networks. However, most of work in the literature concentrates mainly on 802.11-like random access networks. New technologies such as OFDMA (orthogonal frequency division multiple access), offer new opportunities for employing network coding. This paper considers how to apply the practical network coding scheme in OFDMA relay networks via cross-layer optimization. Specifically, we aim to explore the following questions: (1) When and how can wireless nodes select relay paths in the presence of network coding? (2) How can an OFDMA relay system assign network resource such as subcarrier and power for all the transmitting nodes? (3) What are the impacts of OFDMA system parameters on the network coding gain? To answer these questions, two efficient coding-aware relay strategies are presented to select forwarding paths with fixed and dynamic power allocation. In order to exploit the network capacity in slow frequency selective fading channels, we formulate optimization frameworks and propose channel-aware coding-aware resource allocation algorithms for an arbitrary traffic pattern. Our studies show that the network coding (i.e. XOR) gain depends on the nodes’ powers, traffic patterns etc. Especially, OFDMA relay network with dynamic power possesses both coding gain and power gain. Extensive simulations are performed to verify our analysis and demonstrate the throughput improvement of our proposals in the presence of XOR coding.     

LIAD: Adaptive bandwidth prediction based Logarithmic Increase Adaptive Decrease for TCP congestion control in heterogeneous wireless networks

For accessing plentiful resources in the Internet through wireless mobile hosts, diverse wireless network standards and technologies have been developed and progressed significantly. The most successful examples include IEEE 802.11 WiFi for wireless networks and 3G/HSDPA/HSUPA for cellular communications. All IP-based applications are the primary motivations to make these networks successful. In TCP/IP transmissions, the TCP congestion control operates well in the wired network, but it is difficult to determine an accurate congestion window in a heterogeneous wireless network that consists of the wired Internet and various types of wireless networks. The primary reason is that TCP connections are impacted by not only networks congestion but also error wireless links. This paper thus proposes a novel adaptive window congestion control (namely Logarithmic Increase Adaptive Decrease, LIAD) for TCP connections in heterogeneous wireless networks. The proposed RTT-based LIAD has the capability to increase throughput while achieving competitive fairness among connections with the same TCP congestion mechanism and supporting friendliness among connections with different TCP congestion control mechanisms. In the Congestion Avoidance (CA) phase, an optimal shrink factor is first proposed for Adaptive Decreasing cwnd rather than a static decreasing mechanism used by most approaches. Second, we adopt a Logarithmic Increase algorithm to increase cwnd while receiving each ACK after causing three duplicate ACKs. The analyses of congestion window and throughput under different packet loss rate are analyzed. Furthermore, the state transition diagram of LIAD is detailed. Numerical results demonstrate that the proposed LIAD outperforms other approaches in goodput, fairness, and friendliness under diverse heterogeneous wireless topologies. Especially, in the case of 10% packet loss rate in wireless links, the proposed approach increases goodput up to 156% and 1136% as compared with LogWestwood+ and NewReno, respectively.     

面向编码机会路由的无线Mesh 网络广播信道接入

编码机会路由是有损无线Mesh网络中提供高吞吐量和高可靠性传输的理想方案.该路由机制建立在无线广播的多用户分集优势和随机网络编码的纠删特性之上,为广播MAC的设计引入了新的机会和挑战.基于最优停止理论,研究面向编码机会路由的机会广播信道接入问题,提出一种在接入延迟和信道交付能力之间加以折衷,以获得最优的平均有效速率的方法,并在IEEE 802.11 DCF协议基础上设计实现面向NCOR的广播MAC协议O-BCast.仿真结果表明,该协议显著提高了编码机会路由的端到端吞吐量,具有网络负载自适应的良好特性.     

Network coding for unicast in a WiFi hotspot: Promises,challenges, and testbed implementation

In offices and residential buildings, WiFi networks have become a primary means for providing Internet access to wireless devices whose dominant traffic pattern is unicast. In the meantime, the emergence of network coding has brought about great promises for multicast in communication networks where intermediate nodes are allowed to process independent incoming information flows. Little is known about network coding for unicast, however. The objective of this paper is thus to depart from multicast scenarios and shed light on several possible unicast scenarios to which network coding may be applied in a WiFi hotspot in order to obtain communication benefits such as throughput gain, fairness, and reduced protocol complexity. We identify five representative scenarios in which network coding may be used to benefit unicasting in a WiFi hotspot. Several open research issues and practical challenges related to each scenario are discussed individually. To illustrate the benefits of network coding for unicast in a WiFi hotspot, we propose and implement iCORE: The interface COoperation Repeater-aided network coding Engine. iCORE is a practical system in which multi-channel multi-radio repeaters are used to relay unicast traffic for those terminals sitting far away from an access point and suffering from weak signals at a WiFi hotspot. It is based on our last scenario which illustrates the synergy among network coding, opportunistic routing, and interface management. Utilizing idle wireless interfaces and listening to traffic opportunistically, iCORE allows packets to move across the interfaces and to be coded across flows whenever it sees more transmission opportunities. We evaluate iCORE on a four-node chain-like topology testbed implemented using IEEE 802.11b/g radios and compare it to MORE – the state-of-art intra-flow network coding implementation based on opportunistic routing. Our experimental results reveal promising gains in terms of throughput over MORE.     

车载自组网中基于滑动窗口的网络编码传输策略

由于节点的高速移动和拓扑的快速变化,使得在车载自组网中传输时延敏感的数据是一个很大的挑战。针对此问题,提出了一种在机会路由上使用基于滑动窗口的网络编码传输策略。该策略根据网络状态自适应地调整滑动窗口的大小,来编码不同长度的编码包,去容忍ACK的延迟,使得在各种网络条件下都能保持较高的吞吐率;使用下三角形式的渐进编码使接收端逐步解码,从而平滑接收端的解码时间间隔。仿真结果表明,该策略具有更高的吞吐率,同时能够在接收端形成时延抖动小的数据流,为车载自组网中流媒体等时延敏感的数据流传输提供更好的服务质量。     

高误码率无线环境下的TCP改进算法

针对TCP Westwood拥塞避免算法在误码率较高的无线网络环境下性能仍显不足的问题,对TCP Westwood算法进行了改进,形成了基于选择性确认丢包恢复的TCP Westwood-SACK改进算法。通过仿真表明,改进后的TCP算法柜高误硝率情况下,进一步提高了网络利用率和吞吐量,同时仍具有很好的公平性和友好性。     

Testbed results of an opportunistic routing for multi-robot wireless networks

Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.