基于网络编码的多播路由算法性能分析

多播传输是目前通信系统中的一项关键技术,可以将相同的信息同时传向多个接收节点。该文提出一种基于网络编码的新的多播路由算法,该算法利用Dijkstra约简网络搜索源节点到各接收节点的路径族。仿真结果表明,该算法在资源消耗和负载均衡方面较传统的多播路由算法有更好的表现,同时性能也更接近基于网络编码的最小费用多播算法。最后,数学分析表明该算法具有较低的计算复杂度。     

Subgrouping‐based multicast transmission over high‐throughput satellite systems with beam cooperation

This paper investigates the multicast transmission for multicast services in high‐throughput satellite (HTS) systems. Considering the multibeam multicast feature of HTSs, cooperative transmission among beams is involved in to improve the efficiency of the multicast transmission. Since the multicast transmission rate depends on the worst user channel state, all the users experience an unreasonably low rate. In this situation, subgrouping techniques are employed to increase transmission rates of users. A subgrouping‐based multicast transmission problem aiming at maximizing the lowest transmission rate of the users is studied to guarantee fairness among users. We formulate the problem as a max–min optimization problem and propose two low‐complex subgrouping algorithms for this problem. Additionally, we also consider multicasting in a single beam and devise a two‐layer transmission scheme for it. In the performance evaluation part, besides the impact of parameters on subgrouping performance, we analyze the performance and the computational complexity of the proposed algorithms. The results indicate that the two subgrouping algorithms can achieve favorable performance with low complexity.     

Efficient scalable video multicast based on network-coded communication

In order to increase the efficiency of mobile video transmission in a 5G network, this paper investigates a cooperative multicast of scalable video using network coding with adaptive modulation and coding over dedicated relay-based cellular networks. Different scalable video layers prefer different protection degrees, and user equipments (UEs) in different locations experience different packet loss rates in wireless networks. Guaranteeing that all UEs experience a certain level of video quality is one of the biggest challenges in scalable video multicast. Using the number of satisfied UEs as a metric, the proposed efficient scalable video multicast based on network-coded cooperation (SVM-NC) scheme, combined with adaptive modulation and coding, enhances the attainable system performance under strict time and bandwidth resource constraints for guaranteed smooth playback. Various simulations were performed for performance evaluation. The proposed scheme ensures that the expected percentage of satisfied UEs approximately achieves the maximum number of UEs in a multicast group by using network-coded cooperation over dedicated relay-based cellular networks. In addition, the peak signal-to-noise ratio metric is asymptotic to the maximum performance of high-resolution video quality offered by service providers.     

Scaling Group Communication Services with Self-adaptive and Utility-driven Message Routing

Group communication services typically generate large multicast data streams. Delivering such massive data streams to the end system nodes at the edge of the Internet has been a challenging problem in terms of high stress on the network links and high demand on network resources and routing node capacities. Most of existing research has been dedicated on geo-distance based routing with various optimizations to alleviate the performance impact on geo-distance based routing due to unpredictable network dynamics. Most representative techniques are targeted at reducing the delivery path length or optimizing routing path by utilizing network locality. In this paper, we identify the inefficiency of geo-distance based routing protocols in many existing multicast overlay networks in terms of both resource utilization and group communication efficiency. To address this issue, we develop a utility-based routing scheme (UDR) that can provide efficient group communication services in a decentralized geographical overlay network. Our approach makes three unique contributions. First, we introduce a utility function to refine the geo-distance based routing in such a way that the routing path selection can carefully incorporate both geo-distance based metric and the network latency. Second, we enhance our utility driven routing scheme with self-adaptive capability by considering the nodes?? state and network density. Thus, nodes in the multicast network can dynamically accommodate the changes of network conditions based solely on their local knowledge about the network. Third, we devise a suite of optimization techniques to minimize the maintenance cost and computational complexity of our self-adaptive and utility-drive routing scheme. We evaluate our approach through extensive experiments based on a realistic network topology model and show that the UDR method is highly scalable and it effectively enhances the multicast delivery efficiency for large scale group communication services compared to existing geo-distance based routing protocols.     

Resource Allocation with Limited Feedback and Joint Coding Scheme for Wireless Multi-antenna Multicast System

In conventional multicast scheme (CMS), the total throughput of multicast group is constrained by the user with the worst channel quality. In order to overcome this problem of limited throughput, we introduce a resource allocation algorithm by exploiting layered coding combined with erasure correction coding for multicast services in the downlink of OFDMA-based multi-antenna system. To reduce the feedback overhead of uplink, we design a novel transmission scheme with limited feedback. Then, we formulate the joint subcarrier and power allocation problem for the data of base layer and enhancement layers, which is shown to be NP hard. Hence, in order to reduce the computational complexity, we propose a three-phase suboptimal algorithm. The algorithm is designed to maximize the system throughput while at the same time guarantee the quality of services (QoS) requirements of all multicast groups. It is composed of precoding scheme, proportional fairness subcarrier allocation algorithm and modified water-filling power allocation algorithm with QoS guarantees (MWF-Q). To further decrease the complexity of MWF-Q, a power allocation algorithm with increased fixed power allocation algorithm with QoS guarantees is introduced. Simulation results show that the proposed algorithms based on limited feedback scheme significantly outperform CMS and any other existing algorithm with full feedback. Moreover, the proposed scheme can efficiently reduce 50 % of the full feedback overhead.     

Image coding using lapped biorthogonal transform

The wireless sensor network utilizes image compression algorithms like JPEG, JPEG2000, and SPIHT for image transmission with high coding efficiency. During compression, discrete cosine transform (DCT)–based JPEG has blocking artifacts at low bit-rates. But this effect is reduced by discrete wavelet transform (DWT)–based JPEG2000 and SPIHT algorithm but it possess high computational complexity. This paper proposes an efficient lapped biorthogonal transform (LBT)–based low-complexity zerotree codec (LZC), an entropy coder for image coding algorithm to achieve high compression. The LBT-LZC algorithm yields high compression, better visual quality with low computational complexity. The performance of the proposed method is compared with other popular coding schemes based on LBT, DCT and wavelet transforms. The simulation results reveal that the proposed algorithm reduces the blocking artifacts and achieves high compression. Besides, it is analyzed for noise resilience.     

在线multicast数据传输网络中的一个优化问题

首先建立了数据传输网络选择的最小成本模型，给出了有效支撑树代表集的概念，并给出了一个时间复杂性为D(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题，分别给出了一个时间复杂性为D(mlogen)和O(m^2 mlogen)的多项式时间的算法。     

中继协作无线网络中不完美反馈下基于网络编码的重传方案

无线广播网络传输过程中,目的节点反馈信息丢失或部分丢失导致发送节点不能了解目的节点的真实接收状态.为提高不完美反馈下无线网络的重传效率,本文提出中继协作无线网络中不完美反馈下基于网络编码的重传方案.本方案基于部分可观察马尔科夫决策过程对不完美反馈下的重传过程进行建模.发送节点根据系统观测状态和最大置信度更新系统估计状态,根据数据包发送顺序,优先选择最早丢失且能够恢复最多丢包的编码包重传.目的节点缓存不可解编码包以提升编解码机会.重传过程中源节点关注目的节点请求包需求,相同情况优先选择传输可靠性较高的中继节点,以提升传输有效性.仿真结果表明,在不完美反馈下相对于传统方案,本方案可有效提高重传效率.     

基于自适应随机线性网络编码的优先级调度方案

该文针对无线多播网络中基于随机线性网络编码(RLNC)调度方案计算复杂度高,且网络传输性能易受反馈信息影响等问题,提出一种基于自适应RLNC的优先级调度方案(PSARLNC)。该方案结合视频流的特征采用适应多播的RLNC,相较于传统RLNC计算复杂度降低。经过初始传输后,在后续数据恢复阶段,综合考虑数据包剩余传输时隙,选取目的节点增益最大传输方式,最大化数据传输。同时,各中继节点根据接收情况,构建各自解码概率值,并以此为依据确定调度优先级并完成转发,自适应调整各节点传输,有效减少对反馈信息的依赖。仿真结果表明该方案与完全反馈方案性能十分接近,且在减小计算复杂度和降低对反馈信息依赖同时保证了较好的性能。     

An adaptive spatio-temporal coding scheme for indoor wireless communication

Systems that employ multiple antennas in both the transmitter and the receiver of a wireless system have been shown to promise extraordinary spectral efficiency. With full channel knowledge at the transmitter and receiver, Raleigh and Cioffi (1998) proposed a spatio-temporal coding scheme, discrete matrix multitone (DMMT), to achieve asymptotically optimum multiple-input-multiple-output (MIMO) channel capacity. The DMMT can be regarded as an extension of the discrete multitone for a digital subscriber lines (DSL) system to the MIMO wireless application. However, the DMMT is basically impracticable in nonstationary wireless environments due to its high-computational complexity. Exploring second-order statistics, we develop an efficient adaptive blind coding scheme for a high-capacity time-division duplexing (TDD) system with slow time-varying frequency-selective MIMO channels. With this method, neither a training sequence nor feedback of channel information is required in the proposed blind approach. Besides, the computational complexity of the proposed scheme is significantly lower than that of the coding scheme described by Raleigh and Cioffi. Simulation results show that the proposed architecture works efficiently in indoor wireless local area network applications.     

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

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

A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network

Peer-to-peer (P2P) live streaming over mobile ad hoc network (MANET) is a state-of-the-art technique for wireless multimedia applications, such as entertainments and disaster recovery. The peers share the live streaming over MANET via multi-hop wireless link, so an efficient data delivery scheme must be required. However, the high churn rate and the frequent mobility baffle the P2P membership management and overlay maintenance. The unreliable wireless connection of MANET leads to the difficulties of large-scale and real-time streaming distribution, and a lack of overlay proximity leads to the inefficient streaming delivery. We present a cross-layer design for P2P over MANET to manage and maintain the overlay, and select efficient routing path to multicast media streams. Our proposed scheme (COME-P2P) integrates both P2P DHT-based lookup and IPv6 routing header to improve the delivery efficiency. Through the cross-layer design, the low layer detects mobility for informing high layer to refine the finger table, and high layer maintains the efficient multicast path for informing low layer to refine the routing table. How to keep stable routing paths for live streaming via IPv6 routing is the main contribution of this paper. The overlay proximity can shorten routing propagation delay, and the hop-by-hop routing can avoid the traffic bottleneck. Through the mathematical analysis and simulation results, COME-P2P can be demonstrated to achieve high smoothness and reduce signaling overhead for live streaming.     

3D-HEVC深度图帧内预测快速编码算法

三维高效视频编码在产生了高效的编码效率的同时也是以大量的计算复杂性作为代价的。因此为了降低计算的复杂度,本文提出了一种基于深度学习网络的边缘检测的3D-HEVC深度图帧内预测快速算法。算法中首先使用整体嵌套边缘检测网络对深度图进行边缘检测,而后使用最大类间方差法将得到的概率边缘图进行二值化处理,得到显著性的边缘区域。最后针对处于不同区域的不同尺寸的预测单元,设计了不同的优化方法,通过跳过深度建模模式和其他某些不必要的模式来降低深度图帧内预测的模式选择的复杂度,最终达到减少深度图的编码复杂度的目的。经过实验仿真的验证,本文提出的算法与原始的编码器算法相比,平均总编码时间可减少35%左右,且深度图编码时间平均大约可减少42%,而合成视点的平均比特率仅增加了0.11%。即本文算法在可忽略的质量损失下,达到降低编码时间的目的。     

无线网络中基于网络编码的可靠广播传输

Recently, network coding has been applied to the loss recovery of reliable broadcast transmission in wireless networks. Since it was proved that fi nding the optimal set of lost packets for XOR-ing is a complex NP-complete problem, the available time-based retransmission scheme and its enhanced retransmission scheme have exponential computational complexity and thus are not scalable to large networks. In this paper, we present an efficient heuristic scheme based on hypergraph coloring and also its enhanced ...     

A scalable approach to the partition of QoS requirements in unicast and multicast

Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. An important problem in this context is how to partition QoS requirements along a selected topology (path for unicast and tree for multicast). As networks grow in size, the scalability of the solution becomes increasingly important. This calls for efficient algorithms, whose computational complexity is less dependent on the network size. In addition, recently proposed precomputation-based methods can be employed to facilitate scalability by significantly reducing the time needed for handling incoming requests. We present a novel solution technique to the QoS partition problem(s), based on a "divide-and-conquer" scheme. As opposed to previous solutions, our technique considerably reduces the computational complexity in terms of dependence on network size; moreover, it enables the development of precomputation schemes. Hence, our technique provides a scalable approach to the QoS partition problem, for both unicast and multicast. In addition, our algorithms readily generalize to support QoS routing in typical settings of large-scale networks.     

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

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

高效率的小规模Ad Hoc组播路由协议

Ad Hoc网络中,组播路由协议具有广泛的应用前景。但由于网络拓扑的变化和节点能量的限制,设计具有高效传输能力的组播路由协议比较困难。通过综合比较表驱动路由协议与按需路由协议的优缺点,并且考虑Ad Hoc网络中节点的移动性以及路由发现与路由维护的方法对传输效率的影响,在无状态组播路由的基础上,使用表驱动与按需路由驱动相结合的路由方法,提出一种新的组播路由协议,使传输效率有较高的提升。     

Reliable Key Management and Data Delivery Method in Multicast Over Wireless IPv6 Networks

Multicast is an efficient way to reduce the required bandwidth of transmitting data simultaneously to a group of users in wireless IPv6 networks. Nevertheless, multicast suffers from two main drawbacks which can be looked from two perspectives, namely security and QoS. With regard to security, the main challenge is to provide security protection to multicast data, which can be achieved by using a secure key management process. Considering a highly dense environment where connection of users to the network is changing frequently due to join or leave operations, key updating approach may burden a network devices with a huge amount of complex encryption/decryption processes. From the QoS perspective, multicast transmission over WLAN offers a tradeoff between the transmission rate and the coverage. The transmission rate of multicast is confined by the user with the lowest data rate in the group which is called fixed base rate problem. To address the above mentioned problems, we propose and implement a lightweight key management and data delivery scheme for multicast over wireless IPv6 networks. The proposed solution is envisaged to reduce the complexity of key updating, while at the same time is able to address the fixed base rate problem. The performance evaluation (by means of analytical and test-bed implementation) of the proposed key management method indicates its efficiency in reducing communication, computation, and storage costs, while maintaining both forward and backward securities. Moreover, the proposed data delivery method is able to improve the throughput and QoS, with low packet loss and transmission delay.