High efficient multipacket decoding approach for network coding in wireless networks

To improve the performance of transmission by reducing the number of transmission and network overhead of wireless single-hop networks, this paper presents a high efficient multipacket decoding approach for network coding (EMDNC) in wireless networks according to the idea of encoding packets which cannot be decoded and are stored in buffer by receiving nodes, the lost packets can be recovered from these encoded packets. Compared with the network coding wireless broadcasting retransmission (NCWBR), EMDNC can improve the efficiency of decoding and reduce the number of retransmission and transmission delay. Simulation results reveal that EMDNC can effectively reduce the number of retransmission and network overhead.     

无线Mesh网中基于网络编码的多路径TCP研究

在无线多跳网络中,本地重传和网络编码已经被成功地应用到多路径技术上以增加吞吐量并减少丢包。然而,在提高UDP传输性能的同时,也产生了数据包重排序和延迟等副作用,严重影响了TCP性能。针对此问题,主要提出一种基于网络编码的多路径传输方案NC-MPTCP,即在无线mesh网络的多条路径中引入网络编码、执行拥塞控制以及使用一个基于信用的方法控制节点的传输速率,提高网络的吞吐量以及增加网络传输的可靠性。该方案使用一个简单的算法,评估丢包率以及发送线性组合数据包的速率,用来降低目的节点的数据包解码延迟和防止TCP的超时重传。仿真结果表明设计的NC-MPTCP有效。     

Media Streaming With Network Diversity

Today's packet networks including the Internet offer an intrinsic diversity for media distribution in terms of available network paths and servers or information sources. Novel communication infrastructures such as ad hoc or wireless mesh networks use network diversity to extend their reach at low cost. Diversity can bring interesting benefits in supporting resource greedy applications such as media streaming services, by aggregation of bandwidth and computing resources. Typically, overlay network architectures compensate for lack of quality-of-service guarantees in the network by introducing redundancy in the media delivery system through network diversity. They can support efficient multimedia services when routing, coding, and scheduling algorithms are able to adapt to both the media information and the dynamic network status. This paper presents an overview of the distributed streaming solutions that profit from network diversity in order to improve the quality of multimedia applications. We discuss the coding techniques used for adaptive and flexible media streaming with network diversity. We describe the problem of media streaming with path diversity and focus on routing, path computation, and packet scheduling problems in multipath networks. Then, the advantages of server or source peer diversity in collaborative streaming solutions are discussed. Lastly, we present an overview of wireless mesh networks and focus on the typical constraints imposed by these novel communication models on media streaming with network diversity.     

A framework of data caching for improving decoding efficiency of opportunistic network coding

Throughput performance of wireless networks can be enhanced by applying network coding (NC) technique based on opportunistic listening. The packets sent or overheard by a network node should be locally cached for the purpose of possible future decoding. How to manage the cache to reduce the overhead incurred in performing NC and, meanwhile, exploit performance gain is an interesting issue that has not been deeply investigated. In this paper, we present a framework for packet caching policy in multihop wireless networks, aiming at improving decoding efficiency, and thus throughput gain of NC. We formulate the caching policy design as an optimization problem for maximizing decoding utility and derive a set of optimization rules. We propose a distributed network coding caching policy (NCP), which can be readily incorporated into various existing NC architectures to improve NC performance gain. We theoretically analyze the performance improvement of NCP over completely opportunistic NC (COPE). In addition, we use simulation experiments based on ns‐2 to evaluate the performance of NCP. Numerical results validate our analytical model and show that NCP can effectively improve the performance gain of NC compared with COPE. Copyright © 2013 John Wiley & Sons, Ltd.     

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

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

Downlink media streaming with wireless fountain coding in wireline‐cum‐WiFi networks

This paper addresses the problem of streaming packetized media data in a combined wireline/802.11 network. Since the wireless channel is normally the bottleneck for media streaming in such a network, we propose that wireless fountain coding (WFC) be used over the wireless downlink in order to efficiently utilize the wireless bandwidth and exploit the broadcast nature of the channel. Forward error correction (FEC) is also used to combat errors at the application‐layer. We analytically obtain the moment generating function (MGF) for the wireless link‐layer delay incurred by WFC. With the MGF, the expected value of this wireless link‐layer delay is found and used by the access point (AP), who has no knowledge of the buffer contents of wireless receivers, to make a coding‐based decision. We then derive the end‐to‐end packet loss/late probability based on the MGF. We develop an integrated ns‐3/EvalVid simulator to evaluate our proposed system and compare it with the traditional 802.11e scheme which is without WFC capability but equipped with application‐ and link‐layer retransmission mechanisms. Through extensive simulations of video streaming, we show that streaming with WFC is able to support more concurrent video flows compared to the traditional scheme. When the deadlines imposed on video packets are relatively stringent, streaming with WFC also shows superior performance in terms of packet loss/late probability, video distortion, and video frame delay, over the traditional scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

物理层网络编码在数据会聚无线自组织网络中的容量增益研究

为研究物理层网络编码.(Physical-layer Network Coding,PNC).方案在数据汇聚无线自组织网络中相对于传统方案能够获得的容量增益,该文通过稀疏割容量分析推导得到PNC方案平均每节点信息传输速率的上界和下界。与传统路由方案及传统网络编码方案相比,在数据汇聚无线自组织网络中应用PNC方案能够提升网络容量的数量级。     

基于硬件逻辑的网络编码编解码算法

提出了一种基于硬件逻辑实现的通用网络编码编解码算法。编码算法运用随机线性网络编码对数据分组进行编码,解码算法则运用克莱默法则进行解码。对编码器和解码器的算法和结构进行了详细的设计,并最终运用硬件描述语言在NetFPGA开发板上实现了该设计。测试结果表明,与传统的路由节点相比,使用线速的网络编码编解码器的网络能够达到最大流最小割定理所确定的流量极限,并且端到端的传输延迟稳定在一个很小的常数上。     

Multi-way relay system with network coding in multi-spot beam satellite networks

In this paper, we consider a multi-way relay system with network coding (NC) in multi-spot beam satellite networks. In particular, we focus on multiparty video conferencing via a satellite. Our proposed protocol uses the multicasting routing information and number of video frame packets to generate coded packets. The proposed protocol ensures the reliable transmission of multicasting data for mobile users using the decoding error rate for the random linear network coding batch. To minimize the delay in the link layer, we propose a resource allocation scheme for multiparty video conferencing with NC in satellite communications. For the resource allocation, we use application information acquired by a performance enhancing proxy. The simulation results show that the achievable rate can be increased by the proposed protocol. The proposed protocol can also reduce the number of packet transmissions, resulting in the efficient usage of satellite radio resources. Furthermore, it is shown that the proposed protocol ensures the reliable transmission of multicasting data for mobile users by using resources saved by NC. The average peak signal-to-noise of the video streaming for mobile users is better than that of the conventional system. As a result, the visual quality of video streaming services is improved.     

Information transmission based on network coding over wireless networks: a survey

Network coding (NC) for wireless local area network has received a lot of attention from researchers. It replaces the traditional methods of video erasure protection. The principal of NC is to combine several packets together before their transmission. Thus, NC is able to provide higher throughput, reliability and efficient transmission. Up to now, many works have been done to ensure the advantages and the robustness of NC against the packet loss and link failures. The performance gains of NC are successfully processed not only for data to increase throughput, but also for video streaming over wireless networks. In this context, this paper surveys and discusses the most popular approaches based on NC of both data and video transmission over wireless network (static or dynamic). Strength and limitations for robust video streaming and data transmission are deeply discussed.     

Network-coding-based scheduling and routing schemes for service-oriented wireless mesh networks - [Service-oriented broadband wireless network architecture]

Service-oriented wireless mesh networks have recently been receiving intensive attention as a pivotal component to implement the concept of ubiquitous computing due to their easy and cost-effective deployment. To deliver a variety of services to subscriber stations, a large volume of traffic is exchanged via mesh routers in the mesh backbone network. One of the critical problems in service-oriented wireless mesh networks is to improve the network throughput. Wireless network coding is a key technology to improve network throughput in multihop wireless networks since it can exploit not only the broadcast nature of the wireless channel, but also the native physical-layer coding ability by mixing simultaneously arriving radio waves at relay nodes. We first analyze the throughput improvement obtained by wireless network coding schemes in wireless mesh networks. Then we develop a heuristic joint link scheduling, channel assignment, and routing algorithm that can improve the network throughput for service-oriented wireless mesh networks. Our extensive simulations show that wireless network coding schemes can improve network throughput by 34 percent.     

Novel Section‐Based Joint Network Coding and Scheduling Scheme in WMNs: JNCS

Guaranteeing quality of service over a multihop wireless network is difficult because end‐to‐end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section‐based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay‐ and energy‐efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.     

基于流的无线网络编码

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

An efficient privacy-preserving scheme for secure network coding based on compressed sensing

Network coding (NC) provides an elegant solution for improving capacity and robustness in computer networks. Different to traditional “store-and-forward” transmission paradigm, each intermediate node linearly combines received data packets, and the original files can be decoded at the sink nodes in NC settings. This brand-new paradigm is vulnerable to pollution attack, which means that some malicious nodes inject fake data packets into the network and this will lead to incorrect decoding. There are some information-theoretical solutions and cryptographic solutions for solving this security issue, and most existing schemes can thwart data pollution attacks. However, the privacy of the original files are vital to some application environments (e.g. military network). To the best of our knowledge, there is not a secure scheme which can thwart pollution attack and can protect the privacy of transmitted data simultaneously. In this paper, we present an efficient privacy-preserving scheme for secure network coding based on compressed sensing (CS), which has attracted considerable research interest in the signal processing community. Specifically, we embed CS into the general NC framework, i.e., the source node needs to compress each original data packet using the sensing matrix before creating the augmented vector and the sink nodes require to perform an additional CS reconstruction algorithm for reconstructing the original file. In addition, we construct a simple key distribution protocol and each intermediate node just needs two secret keys for verifying the integrity of received data packets. Such novel hybrid construction enables the privacy-preserving guarantee, and the performance comparison shows the high-efficiency of our scheme in terms of the computational complexity and communication overhead.     

Network coding for multiple unicast sessions in multi-channel/interface wireless networks

Throughput limitation of wireless networks imposes many practical problems as a result of wireless media broadcast nature. The solutions of the problem are mainly categorized in two groups; the use of multiple orthogonal channels and network coding (NC). The networks with multiple orthogonal channels and possibly multiple interfaces can mitigate co-channel interference among nodes. However, efficient assignment of channels to the available network interfaces is a major problem for network designers. Existing heuristic and theoretical work unanimously focused on joint design of channel assignment with the conventional transport/IP/MAC architecture. Furthermore, NC has been a prominent approach to improve the throughput of unicast traffic in wireless multi-hop networks through opportunistic NC. In this paper we seek a collaboration scheme for NC in multi-channel/interface wireless networks, i.e., the integration of NC, routing and channel assignment problem. First, we extend the NC for multiple unicast sessions to involve both COPE-type and a new proposed scheme named as Star-NC. Then, we propose an analytical framework that jointly optimizes the problem of routing, channel assignment and NC. Our theoretical formulation via a linear programming provides a method for finding source–destination routes and utilizing the best choices of different NC schemes to maximize the aggregate throughput. Through this LP, we propose a novel channel assignment algorithm that is aware of both coding opportunities and co-channel interference. Finally, we evaluate our model for various networks, traffic models, routing and coding strategies over coding-oblivious routing.     

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.     

在多天线多信道无线Mesh网络中基于利用率最大化来融合网络编码和TCP协议

A new approach, named TCP-I2 NC, is proposed to improve the interaction between network coding and TCP and to maximize the network utility in interference-free multi-radio multi-channel wireless mesh networks. It is grounded on a Network Utility Maxmization ( NUM ) formulation which can be decomposed into a rate control problem and a packet scheduling problem. The solutions to these two problems perform resource allocation among different flows. Simulations demonstrate that TCP-I2NC results in a significant throughput gain and a small delay jitter. Network resource is fairly allocated via the solution to the NUM problem and the whole system also runs stably. Moreover, TCP-I2NC is compatible with traditional TCP variants.     

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

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

Ad Hoc上的新协议——流实时传输协议

在Ad Hoc网络中传输多媒体数据会受到网络拓扑变化和无线信道干扰的限制.多流实时传输协议MRTP(multi-flow real-time transport protocol)是一种可以分配和传输多个视频数据流的新协议.它结合多描述编码和多径传输,能提高无线对等网络上视频传输的效率和质量.     

在无线双向通信中基于CRC-NC抵抗污染攻击方案

本文提出一种CRC-NC (Cyclic Redundancy Check-Network Coding）方案．在无线双向通信网络中,该方案通过结合网络编码和循环冗余校验码技术,对接收到的消息的进行可信度检测,能有效地降低目的节点解码误码率,并抵抗污染攻击．该方案中节点与节点在中继节点的辅助下相互发送消息,并利用对方节点和中继节点发送的消息解码．若节点直接从对方节点获得的消息中有S个消息正确,该节点将对方节点发送的消息和中继节点发送的消息进行组合,并计算组合消息的汉明重量,从中选择K-S个最小的汉明重量所对应的由中继节点发送的消息解码．通过仿真结果表明,与基于随机选取方案和加密方案相比,该方案能有效的降低节点解码差错概率．