基于代理的分布式视频流点播传输策略

视频流传输具有带宽高、周期长的特点,使网络带宽成为了制约视频流点播应用发展的主要因素.本文针对现有网络技术条件,充分利用客户端I/O带宽、本地缓存及网络带宽资源,设计了一个适用于大规模点播应用的基于代理的分布式视频点播传输策略.该策略中各本地网络设有一视频流代理服务器用于保存部分视频的部分内容,并按动态批处理的方式来接纳并服务请求用户.视频传输时,服务器与代理端之间采用单播传输机制,在代理与客户端之间采用单播与多播相结合的方式.实验表明该策略可以大大减少对骨干网络带宽的需求,并能为客户端提供理论上的零启动延时服务.     

视频流广播协议的研究和建模

以准视频点播技术为背景,通过对该技术的核心要素--VoD广播协议族进行归纳、分析,并设计了一个新的数学模型--宝塔模型,并由该模型出发分析了N-VoD系统的性能与特点.该模型在一个8 MHz模拟频道上传输4套数字节目,其点播最大延迟为8 s,大大缩短了用户等待时间.     

VoD广播协议分析和建模

以准视频点播技术为背景,通过对该技术的核心要素-VoD广播协议族进行归纳、分析,并从宝塔广播协议出发,设计了一个新的数学模型--宝塔模型,并由该模型出发分析了N-VoD系统的性能与特点.该模型在一个8 MHz模拟频道上传输两套数字节目,其点播最大延迟为8 s,大大缩短了用户等待时间.     

Research on Scheduling Algorithms for Distributed Video Transcoding Service

针对分布式环境下视频转码服务的任务请求自适应接收问题以及处理后视频序列分段向客户端的端传输控制问题,通过分析视频转码处理对资源占用的特点以及流式媒体服务实现的过程,提出了基于处理节点资源与客户信道质量反馈的视频转码任务自适应接收策略和用于实现客户端流畅视频服务的视频任务分段传输控制算法.实验表明,相比现有算法,该自适应客户请求接入策略能够依据客户端的信道质量选择最适合的任务版本;在用户播放缓冲区有限的条件下,提出的传输控制算法可以达到更小的任务失败几率.     

视频广播、视频点播和视频会议

视频广播、视频点播和视频会议都是视频应用的方式。 视频广播是基于ＩＰ组播技术的一种单向、一对多的广播服务，它带宽耗费小。对于每个节目，由于只发送一个视频数据流，因而理论上能够支持无限用户对节目的收看，比较适合大量观众的视频应用，是一种经济有效的视频应用。视频点播是一种一对一传输、双向、不对称的视频应用。允许用户随时请求收看节目，对每一个节目请求都需要占用一个单独的数据流，而与收看者点播的节目无关，从视频点播服务器向用户端传输的视频数据量远远大于反向的点播请求传输的信息数据量，应用带宽耗费较大。视…     

大规模连续媒体服务的缓存替换算法设计与实现

连续媒体的缓存设计是非常关键的问题,本文针对大规模连续媒体服务系统的特点,提出了EA缓存替换算法.该算法充分考虑了现有用户和请求接入用户的服务需求,提高了内存使用效率.我们的理论分析和实验模拟证明了它在性能上大大优于传统的缓存替换算法.     

分布式视频转码服务调度算法研究

针对分布式环境下视频转码服务的任务请求自适应接收问题以及处理后视频序列分段向客户端的端传输控制问题,通过分析视频转码处理对资源占用的特点以及流式媒体服务实现的过程,提出了基于处理节点资源与客户信道质量反馈的视频转码任务自适应接收策略和用于实现客户端流畅视频服务的视频任务分段传输控制算法。实验表明,相比现有算法,该自适应客户请求接入策略能够依据客户端的信道质量选择最适合的任务版本;在用户播放缓冲区有限的条件下,提出的传输控制算法可以达到更小的任务失败几率。     

D2D协作边缘缓存系统中基于传输时延的缓存策略

为了满足5G系统低时延高可靠的需求,针对单缓存终端直传(D2D)协作边缘缓存系统,提出了一种基于传输时延的缓存策略。运用随机几何理论,将请求用户和空闲用户的动态分布建模为相互独立的齐次泊松点过程,综合考虑内容流行度、用户位置信息、设备传输功率以及干扰,推导出用户的平均传输时延与缓存概率分布的关系式。以平均传输时延为目标函数建立优化问题,提出了一个低复杂度的迭代算法,得到平均传输时延次优的缓存策略。仿真结果表明,该缓存策略在传输时延方面优于常见的几种缓存策略。     

一种低复杂度的分簇多带超宽带系统动态资源分配算法

提出了一种用于多用户多带超宽带系统的低复杂度动态资源分配方案,该方案在满足所有用户数据速率请求和给定的误比特率前提下,可以最小化总的系统传输功率.分析和实验表明,提出的算法与现有方法相比,性能只有很少的损失,却可以显著降低运算的复杂度.复杂度的降低主要通过把一般性的限制性优化问题转化为线性编程问题,并在求解线性编程问题的过程中寻找更好的初始解.此外,还通过对相邻的副载波进行分簇,亦降低了算法的复杂度,并为系统设计提供了更多的灵活性.最后,还通过实验研究了簇的大小和用户数目对算法和系统的影响.     

VOD广播协议分析和建模

真视频点播(T-VOD)技术支持双向点播、延迟时间短,是当今的应用热点。但该技术带来网络双向改造费用巨大的问题。准视频点播技术(N-VOD)以无需改造网络即可实现视频点播功能,使其在有线电视网等宽带网中应用前景远大。本文以准视频点播技术为背景,通过对该技术的核心要素—VOD广播协议族进行归纳、分析,并从宝塔广播协议出发,设计了一个新的数学模型——宝塔模型,并由该模型出发分析了N-VOD系统的性能与特点。该模型在一个8MHz模拟频道上传输两套数字节目,其点播最大延迟为8秒,大大缩短了用户等待时间。     

基于信道借用和信号预测的切换方法

随着业务需求的日益增长,蜂窝也越变越小,移动蜂窝通信环境中的切换成为日益重要的问题。在CDMA蜂窝系统中使用软切换,为了解决切换时的信道短缺问题,提出了许多解决方法。该文中提出了称为基于信道借用和信号预测的切换算法。当切换请求到达蜂窝时,如果没有空闲信道,就将从参与软切换的静止呼叫借用一信道,并将借用的信道分配给移动呼叫的切换请求.如果没有信道可借用,就将切换请求放入队列中,使用信号预测的方法来确定队列中的优先级。并将此切换方式的性能与其它切换方式进行了比较。     

基于双向中继和网络编码的NOMA网络性能分析

针对实际场景中存在的具有上下行双向传输任务的通信系统,本文提出了一种双向中继协作非正交多址接入(NOMA, non-orthogonal multiple access)传输方案,基于解码转发(DF, Decode and Forward)协议研究信号的上行和下行双向传输技术,与现有NOMA方案不同,本方案为近端用户分配较大的功率,利用网络编码(NC, network coding)原理在两个时隙内实现基站和用户之间的双向信息交换。进一步考虑不完美信道状态信息(CSI, Channel State Information)条件,分析系统的传输性能并推导了系统中断概率以及遍历和速率闭合表达式。仿真结果表明,在完美CSI和不完美CSI条件下,相比于现有文献所提方案、单向中继(OWR,One-Way Relay)和正交多址(OMA, Orthogonal Multiple Access)网络,本文所提方案有效降低了系统的传输中断概率,提高了系统的遍历和速率以及系统吞吐量。      

Delay guaranteed MDP scheduling scheme for HCCA based on 802.11p protocol in V2R environments

In recent years, the vehicular ad hoc network has attracted worldwide attention from academe and industry. Many researches have been executed to improve the quality of services (QoS) of the intelligent transportation system. However, current existing channel access schemes at the medium access control layer specified in 802.11 protocol, including hybrid coordination function control channel access (HCCA) and enhanced distributed channel access, could not efficiently achieve the QoS requirements in some special situations. This paper proposes a delay guaranteed HCCA (DG‐HCCA) scheduling scheme, which works based on a Markov decision process model and the measurement of historic performance, to guarantee the QoS enhanced data transmission for vehicles to roadside unit. Besides, this paper also presents a performance analysis model to systematically evaluate the system performance of the channel utility and the average delay. The performance of the proposed delay guaranteed HCCA scheduling scheme is compared with that of original HCCA scheme specified in 802.11p standard and other 2 HCCA improved schemes by the simulation experiments. The simulation results demonstrate that the proposed solution could highly fulfill the transmission delay requirements with a better channel utility and less loss rates than those by the standard HCCA scheme and other 2 schemes.     

一种适用多种空时编码方案的MIMO自编码器通信系统

为提升现有端到端通信系统的适应性与信道估计的准确性,提出了一种适用于多种空时编码方案的多输入多输出(Multiple-Input Multiple-Output,MIMO)自编码器通信系统.该系统将基于卷积神经网络的自编码器引入到MIMO系统中,并结合信道估计网络实现信道均衡,通过端到端的学习方式实现各种空时编码方案下...     

Adaptive Transmission Scheme for Mixed Multicast and Unicast Traffic in Cellular Systems

Wireless communication systems have been developed to support users' various requirements. Multicast and unicast transmission schemes are proposed for various types of services. The multicast transmission is known as an efficient method for group-data transmission. The data rate for multicast transmission depends on the instantaneous worst channel user. On the other hand, unicast transmission exploits wireless channel variation and achieves a multiuser diversity gain. In this paper, we evaluate and compare the system performance of multicast and unicast transmission schemes in terms of system capacity, worst average channel user's capacity, and outage probability for varying cell environments. We also propose a novel hybrid scheduling scheme for mixed multicast and unicast traffic services and compare the proposed scheme with the conventional scheme.      

Low‐complexity inter‐carrier interference cancelation scheme for SC‐IFDMA system

After the standardization of SCFDMA as the uplink transmission scheme for LTE, frequency synchronization and resulting interference cancelation received considerable attention. In this paper, mathematical modeling of uplink SCFDMA system with interleaved subcarrier assignment scheme (SC‐IFDMA) is carried out in the presence of carrier frequency offset, and the results were utilized in framing the concept of effective interference matrix, which efficiently represents the interference cancelation problem. We propose two schemes to mitigate the effects of interference and channel based on linear filtering approach, and the typical structure of effective interference and channel matrices in SC‐IFDMA were utilized in formulating a low‐complexity implementation model for the proposed compensation schemes. Even though many works have been reported in the field of interference cancelation of SCFDMA system, majority of them were extension of the interference compensation schemes proposed for OFDMA system, whereas schemes proposed in this paper utilize the typical characteristics of the SC‐IFDMA system. The proposed schemes were simulated using MATLAB, and the performance is compared with existing schemes. Copyright © 2015 John Wiley & Sons, Ltd.     

Efficient data retrieval algorithms for multiple requests in MIMO wireless networks

Given a set of multiple channels, a set of multiple requests, where each request contains multiple requested data items and a client equipped with multiple antennae, the multi‐antenna‐based multirequest data retrieval problem (DRMR‐MA) is to find a data retrieval sequence for downloading all data items of the requests allocated to each antenna, such that the maximum access latency of all antennae is minimized. Most existing approaches for the data retrieval problem focus on either single antenna or single request and are hence not directly applicable to DRMR‐MA for retrieving multiple requests. This paper proposes two data retrieval algorithms that adopt two different grouping schemes to solve DRMR‐MA so that the requests can be suitably allocated to each antenna. To find the data retrieval sequence of each request efficiently, we present a data retrieval scheme that converts a wireless data broadcast system to a special tree. Experimental results show that the proposed scheme is more efficient than other existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

双向中继信道的模拟网络编码最优功率分配

在双向信息非对称条件下,研究了基于模拟网络编码的双向中继信道中的最优功率分配问题。分别给出了中断概率最小化、和速率最大化意义下的最优功率分配闭式数学表达式,并证明了两种约束下最优功率分配问题的统一性。分析表明:现有的基于模拟网络编码的双向中继信道中的最优功率分配方法是本文提出方法在某些条件下的特例。计算机仿真分析证明了提出的最优功率分配方法在中断概率和和速率性能方面均优于平均功率分配方法。      

Analysis and determination of cooperative MAC strategies from throughput perspectives

In recent years, cooperative communication has been developed as a new communication strategy that incorporates a relay node to assist direct point-to-point transmission. By exploiting cooperative diversity, different types of techniques have been proposed to improve transmission reliability from the physical layer perspective. However, owing to the longer transmission time resulting from the cooperative schemes, there is no guarantee to enhance network throughput in view of the medium access control (MAC) performance. In this paper, system throughput of combined direct/cooperative communication is evaluated by exploiting the proposed analytical model based on the IEEE 802.11 MAC protocol. The feasibility of adopting either cooperative or direct communication is also studied in the analytical model. In terms of network throughput, whether to adopt cooperative schemes depends on the tradeoff between cooperative transmission delay and channel quality of direct communication. Moreover, two cooperative MAC protocols are proposed to determine the circumstances to activate cooperative communication according to the channel quality. The full-channel quality indicator based cooperative (FCC) MAC protocol is introduced to choose both the transmission scheme and the relay node according to the full channel quality information. However, the overhead caused by the FCC scheme can degrade the throughput performance as the number of available relays is significantly increased. Therefore, the bitwise competition based cooperative (BCC) MAC protocol is utilized to efficiently determine a feasible relay node for data transmission. Simulations are performed to validate the effectiveness of proposed analytical models and cooperative MAC protocols. It is observed that the proposed BCC scheme can outperform both the FCC protocol and conventional direct transmission with enhanced system throughput.     

Joint source/channel coding for image transmission with JPEG2000 over memoryless channels.

The high compression efficiency and various features provided by JPEG2000 make it attractive for image transmission purposes. A novel joint source/channel coding scheme tailored for JPEG2000 is proposed in this paper to minimize the end-to-end image distortion within a given total transmission rate through memoryless channels. It provides unequal error protection by combining the forward error correction capability from channel codes and the error detection/localization functionality from JPEG2000 in an effective way. The proposed scheme generates quality scalable and error-resilient codestreams. It gives competitive performance with other existing schemes for JPEG2000 in the matched channel condition case and provides more graceful quality degradation for mismatched cases. Furthermore, both fixed-length source packets and fixed-length channel packets can be efficiently formed with the same algorithm.