Algebraic Approach to Random Convolutional Network Coding over Wireless Packet Networks

To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is deduced, and the coding condition is also presented. Analyses and simulations show that random convolutional coding is capacity-achieving with probability approaching 1.

Multimedia Streaming for Ad Hoc Wireless Mesh Networks Using Network Coding

Over the past years, we have witnessed an explosive growth in the use of multimedia applications such as audio and video streaming with mobile and static devices. Multimedia streaming applications need new approaches to multimedia transmissions to meet the growing volume demand and quality expectations of multimedia traffic. This paper studies network coding which is a promising paradigm that has the potential to improve the performance of networks for multimedia streaming applications in terms of packet delivery ratio (PDR), latency and jitter. This paper examines several network coding protocols for ad hoc wireless mesh networks and compares their performance on multimedia streaming applications with optimized broadcast protocols, e.g., BCast, Simplified Multicast Forwarding (SMF), and Partial Dominant Pruning (PDP). The results show that the performance increases significantly with the Random Linear Network Coding (RLNC) scheme.

TCAR: A new network coding-aware routing mechanism based on local topology detection

Recent researches show that inter-session network coding could decrease the number of packets transmission and achieve higher throughput in wireless network compared with traditional forwarding mechanism.In most existing relay mechanisms based on inter-session network such as COPE,relay node demands to collect the messages from its neighbor nodes to get notice of which packets already overheard by them so as to determine whether there exists coding opportunity between or among forwarding packets.However,transmission overhead of this message collection and computing cost of opportunity determination will degrade the performance of these mechanisms.It is observed that coding opportunity at relay node is much more related with the local topology,and the opportunity of encoding three or more packets together is far less than that of encoding two packets together in wireless network with general density.Based on this,a new coding-aware routing mechanism,named TCAR,is proposed.TCAR ignores the opportunity of encoding three or more than three packets together.Each relay node maintains an encoding mapping table being established according to the result of its local topology detection,which can be used to calculate the path cost during routing setup phase,and determine that which two packets can be encoded together during the packets forwarding phase.In TCAR,instead of periodic messages collection,each relay nodes just need once local topology detection,and the encoding determination is much simpler than that of the former mechanisms.Simulation results show that compared with typical inter-session network coding mechanisms COPE and COPE-based routing,TCAR achieves 12% and 7% throughput gains,and keeps the minimum end to end delay.

Deployment of Polar Codes for Mission-Critical Machine-Type Communication Over Wireless Networks

Mission critical Machine-type Communication(mcMTC),also referred to as Ultra-reliable Low Latency Communication(URLLC),has become a research hotspot.It is primarily characterized by communication that provides ultra-high reliability and very low latency to concurrently transmit short commands to a massive number of connected devices.While the reduction in physical(PHY)layer overhead and improvement in channel coding techniques are pivotal in reducing latency and improving reliability,the current wireless standards dedicated to support mcMTC rely heavily on adopting the bottom layers of general-purpose wireless standards and customizing only the upper layers.The mcMTC has a significant technical impact on the design of all layers of the communication protocol stack.In this paper,an innovative bottom-up approach has been proposed for mcMTC applications through PHY layer targeted at improving the transmission reliability by implementing ultra-reliable channel coding scheme in the PHY layer of IEEE 802.11a standard bearing in mind short packet transmission system.To achieve this aim,we analyzed and compared the channel coding performance of convolutional codes(CCs),low-density parity-check(LDPC)codes,and polar codes in wireless network on the condition of short data packet transmission.The Viterbi decoding algorithm(VA),logarithmic belief propagation(Log-BP)algorithm,and cyclic redundancy check(CRC)successive cancellation list(SCL)(CRC-SCL)decoding algorithm were adopted to CC,LDPC codes,and polar codes,respectively.Consequently,a new PHY layer for mcMTC has been proposed.The reliability of the proposed approach has been validated by simulation in terms of Bit error rate(BER)and packet error rate(PER)vs.signal-to-noise ratio(SNR).The simulation results demonstrate that the reliability of IEEE 802.11a standard has been significantly improved to be at PER=10−5 or even better with the implementation of polar codes.The results also show that the general-purpose wireless networks are prominent inproviding short packet mcMTC with the modification needed.

Optimal chunk caching in network coding-based qualitative communication

Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity,namely chunk level,which obsoletes many existing networking policies and schemes,especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching,Content Delivery Networks(CDN)or Information-Centric Networks(ICN).This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them.A novel metric is proposed by taking these new factors into consideration.An optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit.A cache replacement scheme that obtains the optimal result in a recursive manner is proposed correspondingly.With the help of the introduced intelligent cache replacement algorithm,the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.

Complex field network-coded cooperation based on multi-user detection in wireless networks

Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.

DIVERSITY-AND-MULTIPLEXING TRADEOFF AND THROUGHPUT OF SUPERPOSITION CODING RELAYING STRATEGY

While the Network Coding cooperative relaying (NC-relaying) has the merit of high spectral efficiency,Superposition Coding relaying (SC-relaying) has the merit of high throughput. In this paper,a novel concept,coded cooperative relaying,is presented,which is a unified scheme of the NC-relaying and SC-relaying. For the SC-relaying strategy which can be considered one-way coded relaying scheme with multi-access channel,the close-form solution of the outage probabilities of the basic signal and additional signal are obtained firstly. Secondly,the Diversity-and-Multiplexing Tradeoff (DMT) characteristics of basic signal and additional signal are investigated entirely as well as the optimal close-form solutions. The compared numerical analysis shows the evaluation error of throughput based on the close-form solution is about 0.15 nats,which is within the acceptable error range. Due to the mutual effect between the both source signals,the available maximal values of the two multiplexing gains are less than 1.

Efficient Scheduling with Random Network Coding in Multi-Relay Wireless Network

In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding(AF-NC), in which each relay adaptively calculates the number of packets having innovative information according to the feedback from the sink. With AF-NC, duplicate packets are not sent, and the total number of time slots needed to complete transmission can be significantly reduced. The second scheme, named adaptive forwarding with network coding and retransmission(AFR-NC), combines AF-NC with automatic repeat request(ARQ) to guarantee reliable end-to-end communication with limited resource occupation. Numerical results show that compared with simple forwarding with network coding(F-NC), AF-NC has close successful delivery rate with dramatically less time slots, while AFR-NC achieves strict reliability with limited resource cost.

Multipath Routing of Multiple Description Coded Images in Wireless Networks

Multiple description coding （MDC） generates multiple decodable bitstreams for a source to combat informa- tion loss. In this paper, multipath routing problem for two-description coded images is investigated for traditional and coded wireless networks without and with coding capability at intermediate nodes, respectively. Firstly, we formulate an interference-aware MDC multipath routing for traditional networks by employing a time-division link scheduling method to eliminate wireless interference, and ultimately obtain an optimal path selection corresponding to the minimum achievable distortion. Secondly, for coded networks, we evaluate practical wireless network coding （NC） in delivering descriptions of multiple unicast sessions. While NC increases maximum supporting flow rate of MDC descriptions in wireless networks, possible undecodability of NC mixed information is alleviated by MDC. To minimize achievable distortion, a proposed interference-and-coding-aware MDC multipath routing strikes a good balance between minimizing side effect of wireless interference avoidance and maximizing NC opportunity. Simulation results validate the effectiveness of the two proposed schemes.

基于DAG和改进随机线性编码的数据传输

为提高无线传感器网络的数据可操作性和传输效率,提出一种基于有向无环图(DAG)模型的网络编码传输方法。开发一个生成DAG的数学模型,将簇头(CH)节点参与到DAG,仅通过CH进行编码;采用改进随机线性网络编码,降低编码复杂度;使用P2P覆盖存储系统,联合多个网关/代理,可对丢失的数据包进行恢复。实验结果表明,所提方法在临界链路位置无法预测的场景,明显提高了丢失数据包的恢复率,避免了过多数据包的传输。在数据包恢复和能消之间实现了较好平衡。

An Improved Immune Genetic Algorithm for Solving the Optimization Problems of Computer Communication Networks

Obtaining the average delay and selecting a route in a communication networkare multi-constrained nonlinear optimization problems . In this paper, based on the immune geneticalgorithm, a new fuzzy self-adaptive mutation operator and a new upside-down code operator areproposed. This improved IGA is further successfully applied to solve optimal problems of computercommunication nets.

Network coding theory:An introduction

For a long time,store-and-forward had been the transport mode in network communications.In other words,information had been regarded as a commodity that only needs to be routed through the network,possibly with replication at the intermediate nodes.In the late 1990’s,a new concept called network coding fundamentally changed the way a network can be operated.Under the paradigm of network coding,information can be processed within the network for the purpose of transmission.It was demonstrated that compared with store-and-forward,the network throughput can generally be increased by employing network coding.Since then,network coding has made significant impact on different branches of information science.The impact of network coding has gone as far as mathematics,physics,and biology.This expository work aims to be an introduction to this fast-growing subject with a detailed discussion of the basic theoretical results.

支持网络编码的无线Mesh网络路由协议

无线Mesh网络的吞吐量受路由策略、无线干扰等因素影响,基于最短路径的传统路由协议并不能获得良好的性能.为此,提出了1个在单播通信中基于网络编码的无线Mesh网络路由协议.该协议引入条件链路消耗,采用马尔可夫链模型来设计路由判据,下一跳的路由消耗以上一跳为条件.网络中的节点对数据编码组合后,选择条件消耗值最小的路径传输编码后的分组.实验结果表明,优化后的路由判据能更好地支持网络编码,节省网络资源,使得网络吞吐量提高了大约20%.

无线网络编码感知路由综述

流间网络编码具有改善无线网络性能的潜力,然而,由于实际网络中编码机会数量通常十分有限,仅仅被动地利用编码机会无法获得高的性能增益.编码感知路由的核心思想是使用有利于网络编码的路由,它通过在路由建立阶段构造特定的编码结构,可以主动创造编码机会.系统地总结了流间网络编码中的编码结构,并以此为主线,分类介绍了编码感知路由的研究现状.最后,对编码感知路由的研究热点进行了展望.

基于网络编码的无线传感网多路径传输方法

可靠性在无线传感器网络中是非常重要的.传感器网络主要通过增加传输冗余来提高数据传输的可靠性,如多路径或重传.然而,这些方法会造成能效降低,缩短网络生命周期.因此,提出了一种能量有效的方法,将一种新型的网络编码与多路径结合在一起,通过将同组数据编码产生的相互独立的多份数据沿多条路径进行传输,有效地降低了对单份数据的依赖,减少了链路失效带来的影响.在保证数据传输可靠性的同时,显著地减少了通信量,而代价仅仅是少量的元数据传输和小规模的线性运算.此外,还就其中的关键问题——每组数据所需的最小路径数问题提出了一种低开销的近似方法.详细的模拟实验验证了该方法的有效性.

无线传感器网络中网络层故障容错技术研究进展

故障容错能提高无线传感器网络的稳定性和可靠性,是无线传感器网络的一项关键技术。网络层容错及跨层协同优化设计是网络故障容错的重要研究内容,主要对网络层容错技术研究进行了归纳和总结。网络层容错控制技术主要分为多路由传输、纠删编码/网络编码、数据重传机制、跨层协同优化与复合容错和仿生智能容错等,并对网络层容错控制技术研究趋势作了探讨。

无线多跳网络中的机会路由

机会路由通过充分利用无线信道的广播特性,可以大大提高无线多跳网络的性能.从阐述机会路由的基本思想开始,介绍了机会路由协议的主要特点、适用环境和影响机会路由性能的重要因素.在此基础上,对重要机会路由协议进行了综述,讨论不同协议的工作机制及其优缺点.最后,探讨了机会路由的一些未来发展方向,以期为这一领域的发展提供一些有意义的借鉴.

无线多媒体传感器网络研究

无线多媒体传感器网络(WMSNs)是在传统无线传感器网络(WSNs)的基础上发展起来的具有音频、视频、图像等多媒体信息感知功能的新型传感器网络,具有广阔的应用前景。该文介绍了WMSNs的概念,分析了WMSNs区别于传统WSNs的个性化特点。对节点系统、MAC协议、路由协议、多媒体信息处理等关键技术的国内外研究现状、面临的问题和可行的解决方案进行了深入探讨。最后对WMSNs亟待解决的问题和发展趋势进行了总结。

无线网络中基于编码感知的能量优化路由算法

由电池供应电量的无线通信网络中,数据需要通过作为路由的中间节点进行传输,所以这些中间节点的能量消耗对整个网络的生存有很大的影响。本文从延长网络生存时间的目的出发,提出了一种能量优化的编码感知路由协议COER(Coding-aware based Optimal Energy Routing),利用能量门限值以及相对剩余能量来均衡网络节点能量的消耗,同时用网络编码来减少能量的消耗,并将两者统一来实现网络能量的优化。仿真结果表明:COER能够减少传输能耗,均衡网络能量消耗,延长网络生存时间。