Efficient Cellular Network with Network Coding in Disaster Area

Wireless Personal Communications - Intermittent connectivity due to the difficult topography in disaster area prevents a direct transmission from the base station to the demand users. An analytical...     

一种新的基于多节点网络编码的无线广播重传算法

提出了一种基于网络编码的无线网络广播重传算法。该算法按照包丢失分布概率的特点生成新的重传序列,采用多节点的网络编码方法进行丢失包组合实现重传。通过数学分析和仿真证明,该算法能保证接收节点的编码可解性,同时重传次数可达到局部最优性;与传统重传方法相比,该算法可以有效地减少信息包的平均传输次数,从而提高传输效率。     

无线网络中基于机会网络编码的加权广播重传

在无线广播网链路状态不同和丢包率高的条件下,基于机会网络编码的数据分发策略面临传输效率低和计算复杂度高的问题。针对这一问题,该文提出一种新的基于机会网络编码的加权广播重传(Weighted Opportunistic Network Coding Retransmission, WONCR)方案。该方案通过构建加权数据包分布矩阵(Weighted Packet Distribution Matrix, WPDM),在重传过程中采用新的调度算法进行编码数据包的选取,并将选取的数据包进行XOR编码后再重传。机会仿真结果表明,WONCR方案提高了传输效率,且计算开销较小,实现了无线广播网中高效、可靠的数据分发。     

Efficient Stereoscopic Video Coding Using Joint Disparity-Motion Estimation

The goal of this paper is to determine dense disparity and motion fields jointly and efficiently, given a sequence of stereoscopic images. At each time instant, the motion field of left sequences is estimated by using the current disparity field, the next disparity field, and the motion field of right sequences. The improved concepts for the proposed joint estimation are based on an edge-preserving regularization, an ambiguous vector region detection, and a median filtering for block-based vector generation. The reported approach is verified by processing a set of stereo sequences. Results are given with real stereoscopic data.     

无线网络中基于混合流的高效可靠机会网络编码算法

Although the wireless network is widely used in many fields, its characteristics such as high bit error rate and broadcast links may block its development. Network coding is an artistic way to exploit its intrinsic characteristics to increase the network reliability. Some people research network coding schemes for inter flow or intra flow, each type with its own advantages and disadvantages. In this paper, we propose a new mechanism, called MM NCOPE, which integrates the idea of inter flow and intra flow coding. On the one hand, MM NCOPE utilizes random liner coding to encode the NCOPE packets while NCOPE is a sub protocol for optimizing the COPE algorithm by iteration. In NCOPE, packets are automatically matched by size to be coded. As a result, it improves the coding gain in some level. On the other hand, we adopt the partial Acknowledgement retransmission scheme to achieve high compactness and robustness. ACK is an independent packet with the highest priority rather than a part of the data packets. Compared with existing works on opportunistic network coding, our approach ensures the reliability of wireless links and improves the coding gain.     

采用数字同相编解码卫星传输的调频同步广播系统

音频信号采用数字同相编解码,是针对DVB-S卫视频道传输音频信号,接收端解码后音频信号的时延不确定这一问题,而采用的技术措施不仅很好地解决了利用DVB-S卫视频道传输音频信号的调频同步系统实现信号在相干区“同相”的难题,而且使多站点调频同步系统的调试变得非常简单,从而很容易实现大范围多站点的系统同步.     

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

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

Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks

Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networks such as ad-hoc and sensor networks. In this work, we investigate the multicast routing problem based on network coding and put forward a practical algorithm to obtain the maximum flow multicast routes in ad-hoc networks. The "conflict phenomenon" that occurs in undirected graphs will also be discussed. Given the developed routing algorithm, we will present the condition for a node to be an encoding node along with a corresponding capacity allocation scheme. We will also analyze the statistical characteristics of encoding nodes and maximum flow in ad-hoc networks based on random graph theory.     

应用神经网络的图像分类矢量量化编码

矢量量化作为一种有效的图像数据压缩技术，越来越受到人们的重视。设计矢量量化器的经典算法ＬＢＧ算法，由于运算复杂，从而限制了矢量量化的实用性。本文讨论了应用神经网络实现的基于边缘特征分类的矢量量化技术。它是根据人的视觉系统对图象的边缘的敏感性，应用模式识别技术，在对图像编码前，以边缘为特征对图像内容分类，然后再对每类进行矢量量化。除特征提取是采用离散余弦变换外，图像的分类和矢量量化都是由神经网络完成     

Efficient Error Control Decoder Architectures for Noncoherent Random Linear Network Coding

Random linear network coding is an efficient technique for disseminating information in networks, but it is highly susceptible to errors. Kötter-Kschischang (KK) codes and Mahdavifar-Vardy (MV) codes are two important families of subspace codes that provide error control in noncoherent random linear network coding. List decoding has been used to decode MV codes beyond half distance. Existing hardware implementations of the rank metric decoder for KK codes suffer from limited throughput, long latency and high area complexity. The interpolation-based list decoding algorithm for MV codes still has high computational complexity, and its feasibility for hardware implementations has not been investigated. In this paper we propose efficient decoder architectures for both KK and MV codes and present their hardware implementations. Two serial architectures are proposed for KK and MV codes, respectively. An unfolded decoder architecture, which offers high throughput, is also proposed for KK codes. The synthesis results show that the proposed architectures for KK codes are much more efficient than rank metric decoder architectures, and demonstrate that the proposed decoder architecture for MV codes is affordable.     

基于跨层网络编码感知的无线传感器网络节能路由算法研究

编码感知路由可以发现路由中的网络编码机会,减少数据传输次数,提高网络吞吐量,是近年来路由算法研究的一个热点.当前编码感知路由存在编码条件失效、未考虑节点能量的问题,不适合直接应用于无线传感器网络.本文提出基于跨层网络编码感知的无线传感器网络节能路由算法CAER (Cross layer coding Aware Energy efficient Routing).提出并证明了修正后的网络编码条件,以解决编码条件失效问题.基于跨层思想,将网络编码感知机制与拓扑控制、覆盖控制结合,挖掘潜在编码机会.提出综合考虑节点编码机会、节点能量的跨层综合路由度量CCRM (Cross layer Coding aware Routing Metric).仿真结果表明,相比现有编码感知路由,CAER能够提高网络编码感知准确性,增加网络编码机会数量5%~15%,延长网络生存时间8%~12%.     

Spectrally Efficient Differential Space–Time Coding Using Non-Full-Diverse Constellations

In this paper, a method is proposed to construct spectrally efficient unitary space–time codes for high-rate differential communications over multiple-antenna channels. Unlike most of the known methods which are designed to maximize the diversity product (the minimum determinant distance), our objective is to increase the spectral efficiency. The simulation results indicate that for high spectral efficiency and for more than one receive antenna, the new method significantly outperforms the existing alternatives. In the special case of two transmit antennas, which is the main focus of this paper, the relation between the proposed code and the Alamouti scheme helps us to provide an efficient maximum-likelihood (ML) decoding algorithm. Also, we demonstrate that similar ideas can be applied to designing codes for more than two transmit antennas. As an example, we present a construction for 4-by-4 unitary constellations which has a good performance, compared with the other known codes.     

采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

Enhancing Emergency Messages Dissemination in Vehicular Networks Using Network Coding

Vehicular ad-hoc networks play an important role in providing safety on the road. Vehicles generate and exchange emergency and control messages to avoid dangerous situations. According to IEEE 1609.4 standard, all these messages share the same control channel interval even if the emergency messages are with a highest priority. Besides that, network’s characteristics, such as vehicle density and high mobility, would make the diffusion of emergency messages a challenging task. Especially with the absence of acknowledgements and retransmission. Network coding could be seen as a solution where a block of data packets could be sent on the same transmission process. Firstly, we analyze the messages’ dissemination, and we propose a thoroughly model for success probability according to the emergency messages’ generation probabilities. Further, we propose a new network coding access scheme. The emergency messages take the priority in the channel access and it could be retransmitted several times. Thus, the scheme deals with the emergency messages’ loss and latency. NS-3 simulations show that our model increases emergency messages’ reliability.

     

基于网络编码的多跳无线网络可靠组播

多跳无线网络中实现可靠组播面临许多挑战,数据丢失恢复是其中的核心问题之一。该文提出一种基于8GF(2)域的随机线性网络编码的多跳无线网络中高效可靠组播(Network Coding Reliable Multicast,NCRM)算法,克服了XOR编码方式的局限性,将原始数据包划分成不同"代"(generation)进行发送,恢复节点采用随机线性网络编码方式发送编码包,发生丢包的组播组成员发送携带丢包比特向量的NACK(Negative ACKnowledgement),经过邻居恢复、多跳恢复或源端恢复,完成可靠组播过程。该文建立了节点丢失恢复过程的齐次马尔科夫链数学模型,给出理论平均时延和重传跳数。NS2仿真结果验证了理论分析模型的准确性。数值结果表明,与PGM(PragmaticGeneral Multicast)和CoreRM可靠组播协议相比,NCRM算法显著改善了网络吞吐量和丢失恢复延时等性能。     

一种基于神经网络的矢量量化零冗余度信道编码方法

本文提出一种新的基于神经网络的矢量量化零冗余度信道编码方法,该方法能有效地降低矢量量化编码系统在有噪信道下的平均失真。     

Efficient Broadcasting in Mobile Ad Hoc Networks

This paper presents two efficient flooding algorithms based on 1-hop neighbor information. In the first part of the paper, we consider sender-based flooding algorithms, specifically the algorithm proposed by Liu et al. In their paper, Liu et al. propose a sender-based flooding algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O(n logn), where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based flooding algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O(n). In Liu's algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. In the second part of the paper we propose a simple and highly efficient receiver-based flooding algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same messageneighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The analytical results are confirmed using simulation.     

Generalized Greedy Broadcasting for Efficient Media-on-Demand Transmissions

To reduce the bandwidth of media-on-demand transmissions, different broadcasting techniques have been developed over the last years. For highly demanded media, proactive schemes have a lower bandwidth requirement compared to reactive ones. While some of the proactive schemes try to obtain an efficiency near to the theoretical limit, others have been developed to lower the bandwidth by partial preloading, additional playout delay, the use of breaks within the transmission or by exploiting bandwidth variations of variable-bit-rate media. In this article we describe how one of the most efficient proactive transmission schemes can further be improved and generalized so it supports all these additional enhancements and outperforms its predecessor and the specialized schemes.