On the differentiated QoE enforcement between competing scalable video flows over wireless networks

In differentiated quality‐of‐experience enforcement (QoE) for video transmission over wireless networks, accurate video quality metrics play a crucial role in the designing process of optimal resource assignment algorithms. Many cross‐layer optimization‐based rate‐allocation strategies, which consider different objective functions (congestion level, total packet loss, etc.), have been developed for this purpose. The main contributions of the proposed work are twofold. Firstly, an optimal resource assignment framework is being developed in which, based on some network‐specific constraints and by incorporating appropriate video quality metrics, the total weighted QoE of some competing scalable video sources is being optimized based on cross‐layer optimization techniques. Secondly, these optimal rates can be used for differentiated QoE enforcement between multiple competing scalable video sources. The resulting optimal rates can be considered as rate feedbacks for online rate adaptation of a moderate scalable video encoder such as H.264/MPEG‐4 advanced video coding. The aforementioned weight parameters are selected based on the importance of each video sequence's quality and can be associated with some previous service level agreement‐based prices. Some numerical analysis have been presented to validate the theoretical results and to verify the claims. Copyright © 2011 John Wiley & Sons, Ltd.     

Multi-Source Video Transmission with Minimized Total Distortion Over Wireless Ad Hoc Networks

Many optimization theoretic based rate allocation strategies have been developed for allocating some optimal rates to the competing users in wireless ad hoc networks. By considering different objective functions (such as congestion level, total packet loss and so on), the researchers propose some optimization framework by which the problem can be solved. Due to the rapid increase in the development of different video applications in such environments and the existence of difficulties in satisfying the pre-specified QoS limits, increasing the received video quality can be considered as an important and challenging issue. The quality of the received video stream is inversely proportional to the amount of distortion which is being imposed on the video stream by the network packet loss and the video encoder. The main objective of the current paper is to introduce an optimization framework in which by optimal rate allocation to some competing video sources, the aggregate distortion of the all of the sources be minimized. The simulation results verify the claims.

QoE-based routing algorithms for H.264/SVC video over ad-hoc networks

Multi-hop relaying combined with scarcity of wireless resources in ad-hoc networks can deteriorate the quality of service. As a result, one of the major challenges in video streaming over ad-hoc networks is enhancing users’ experience and network utilization. The emergence of scalable video coding standard enables smooth adaptation of video quality to network conditions. In this paper, we study two optimization problems: (1) maximize the global quality of experience of all users and (2) maximize the number of qualified streams. We formulate the both problems as mixed integer linear programming problems. These optimization problems are shown to be NP-hard. Consequently, we propose heuristic algorithms to solve them. Simulation results show that the proposed algorithms can provide the near-optimal video quality while the calculation times are much shorter than the one of optimal solution.     

QoE-aware video distribution mechanism in FiWi

The mismatch of transmission ability causes the discontinuous transmission of video services in fiber-wireless access network,aimed at this problem,an QoE-aware video distribution mechanism was proposed.According to the structural characteristics of fiber-wireless access network,link state information and scalable video coding structure was considered,a QoE evaluation mode was established,and the particle swarm optimization algorithm was used to select optimal video transmission rate.Then the node transmission capacity and the node matching degree was analyzed,transmission path for the services was selected,so as to ensure the reliable transmission of services.The results show that the proposed mechanism can effectively improve the utilization rate of network resources and reduce network congestion while improving the quality of the user experience.     

基于量子粒子群算法的移动节点覆盖优化

提出了基于量子粒子群的无线传感器网络覆盖优化算法.由于在量子空间中粒子满足集聚态性质完全不同,使得该算法可以在整个可行区域内搜索.全局搜索能力远远优干基本粒子群,克服了粒子群算法容易陷入局部最优的缺点.仿真结果表明,该算法比基本粒子群算法拥有更好的覆盖优化效果。     

A unified framework for distributed video rate allocation over wireless networks

When multiple video streams share a wireless network, careful rate allocation is needed to prevent congestion, as well as to balance the video qualities among the competing streams. In this paper, we present a unified optimization framework for video rate allocation over wireless networks. Our framework applies to both unicast and multicast sessions, and accommodates both scalable and non-scalable streams. The optimization objective is to minimize the total distortion of all video streams without incurring excessive network utilization. Our system model explicitly accounts for heterogeneity in wireless link capacities, traffic contention among neighboring links, as well as different video rate-distortion (RD) characteristics. The proposed distributed media-aware rate allocation scheme leverages cross-layer information exchange between the MAC and application layers to achieve fast convergence at the optimal allocation.We evaluate performance of the proposed scheme for streaming of high-definition (HD) and standard-definition (SD) video sequences over 802.11-based wireless networks, both in unicast and multicast scenarios. The scheme consistently outperforms conventional TCP-Friendly Rate Control (TFRC) in terms of overall video quality, and achieves more balanced qualities among the streams.     

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.     

An Energy Efficient Scalable Clustering Protocol for Dynamic Wireless Sensor Networks

The issue of energy constraint has always been a challenging task in the research field of wireless sensor networks. Clustering is the most effective approach for enhancing the performance of wireless sensor networks to a great extent in terms of energy consumption, network lifetime and throughput. However, the uneven formation of clusters can lead to faster energy depletion of few nodes, and thus results in premature failure of the wireless sensor network. This paper proposes an energy-efficient scalable clustering protocol (EESCP) which considers inter-cluster and intra-cluster distances to generate balanced clusters. A novel Dragonfly algorithm based particle swarm optimization technique is proposed to optimize the selection of cluster heads. Further, extensive simulations have been carried out by varying node densities and network sizes to demonstrate the full potential of EESCP.

     

一种面向三维感知的无线多媒体传感器网络覆盖增强算法

 覆盖作为无线传感器网络中的基础问题直接反映了网络感知服务质量.本文在分析现有无线多媒体传感器网络覆盖增强算法的基础上,构建节点三维感知模型,提出面向三维感知的多媒体传感器网络覆盖增强算法(Three-Dimensional Perception Based Coverage-Enhancing Algorithm,TDPCA).该算法将节点主感知方向划分为仰俯角和偏向角,并根据节点自身位置及监测区域计算并调整各节点最佳仰俯角,在此基础上基于粒子群优化调整节点偏向角,从而有效减少节点感知重叠区及感知盲区,最终实现监测场景的区域覆盖增强.仿真实验表明:对比已有的覆盖增强算法,TDPCA可有效降低除节点感知重叠区和盲区,最终实现网络的高效覆盖.     

A non-cooperative quality optimization game for scalable video delivery over MANETs

Non-cooperative game theory has found many important applications in engineering. In networking research community, this theory has been adopted to represent the selfish behaviour of the network users. In video transmission over Mobile Ad hoc NETworks (MANETs), video sources try to optimize their perceived video quality unilaterally. On the other hand, network providers try to set some prices on the scarce network resources such that their associated income is maximized. In the current paper, a non-cooperative quality game framework has been introduced in which by exploiting a related quality metric, scalable video users try to optimize their perceived quality in a distributed manner. The existence of a Nash Equilibrium (NE) has been proved and the stability of the distributed resource allocation strategy has been investigated. In the proposed resource assignment game, the utility functions of all competing scalable video sources converge to some optimal value which is dictated by the resulting Nash equilibrium in the allocated rates. In this optimal point, no player (video source) can enhance its utility unilaterally without compromising other players’ utility. The assigned rates in the game can be considered as rate-feedbacks for on-line rate adaptation of a moderate scalable video encoder such as H.264/MPEG4 AVC. Some numerical analysis have been presented to validate the theoretical results and to verify the claims.     

基于粒子群优化和M-H采样粒子滤波的传感器网络目标跟踪方法

针对实际应用条件下传感器节点的观测数据与目标动态参数间呈现为非线性关系的特性,提出了一种基于粒子群优化和M-H抽样粒子滤波的传感器网络目标跟踪方法。该方法采用分布式结构,在动态网络拓扑结构下,由粒子群优化和M-H抽样技术实现滤波中的重抽样过程,抑制粒子退化现象,并通过粒子间共享历史信息,降低单个粒子历史状态间的相关性使各粒子能快速收敛至最优分布,从而实现高精度的目标跟踪效果。仿真结果表明,相比现有的基于信息粒子滤波和并行粒子滤波技术的传感器网络目标跟踪方法,所提出的方法能降低网络总能耗,同时保证目标跟踪的精度。     

基于文化粒子群算法的广义OPM测向

在引入合成导向矢量和合成导向矩阵的基础上建立了一种更通用的阵列数据模型,提出了广义正交传播算子测向算法。该方法在不损失阵列孔径的前提下可有效估计相干信源和独立信源。为快速求解所提基于四阶累积量的广义OPM算法,在文化算法中使用和粒子群演进进化机制,提出了一种多维搜索的文化粒子群算法。Monte-Carlo仿真试验证明了所设计的测向算法可有效解决使用高阶累积量不能直接测相干信源的局限,所提算法在检测性能上与现有一些算法比较有较大的优势。     

基于PSO的无线多媒体传感器网络覆盖增强算法

在无线多媒体传感器网络(Wireless Multimedia Sensor Networks,WMSNs)中,由于节点部署的不合理,往往存在较多的监控盲区,影响了网络的服务质量。为了提高网络的覆盖率,在有向感知模型基础的基础上,提出了一种基于粒子群算法的WMSNs覆盖增强算法PSOCE。PSOCE算法以网络覆盖率为优化目标,以粒子群算法为计算工具,同时对节点的位置与主感知方向进行调整。仿真试验表明,PSOCE算法能够有效地改进WMSNs的覆盖质量,网络的覆盖率能提高6%～12%。     

物联网感知层多路径传输策略研究

多路径数据传输是无线传感器网络亟需解决的一个关键问题.本文针对节点故障、链路失效和外界干扰影响网络稳定性和可靠性,提出一种基于混合蛙跳算法的无线传感器网络多路径传输策略.首先我们详细介绍了蛙跳算法及其原理,之后我们将其应用到无线传感器网络多路径传输策略之中,接着运用混合蛙跳算法对传感网络节点其进行更新、划分、重组以便选择出最优节点建立传输最优路径,提高网络的稳定性和可靠性.通过算法仿真与结果对比提出的算法与AODV、粒子群PSO算法相比,在网络能耗、传输时延、丢包率、连通率和可靠度等方面都具有较好的性能.其中网络能耗比AODV、PSO算法降低了62.5％和35.8％.     

基于多目标粒子群算法的异构网接入控制

各种异构接入网络的无缝融合是下一代网络的显著体征之一。研究异构网络的呼入接纳控制,考虑延时、价格和阻塞率因素,致力于同时提高运营商收益和用户满意度,将无线异构网络的呼入接纳控制转换为组合优化问题,利用多目标粒子群优化算法收敛速度快,可同时在多目标上进行优化的特点,提出了一种基于多目标粒子群优化算法的异构无线网络呼入接纳控制算法。通过仿真,证明可以在运营商的收益和用户群的满意度中找到好的平衡。     

Scalable 3D video streaming over P2P networks with playback length changeable chunk segmentation

3D video distribution over P2P networks has been thought as a promising way for 3D video entering home. The convergence of scalable 3D video coding and P2P streaming can provide diverse 3D experiences for heterogeneous clients with high distribution efficiencies. However, the conventional chunk segmentation and scheduling algorithms originally aiming at the non-scalable 2D video streaming are not very efficient for scalable 3D video streaming over P2P networks due to the particular data characteristics of scalable 3D video. Based on this motivation, this paper first presents a playback length changeable 3D video chunk segmentation (PLC3DCS) algorithm to provide different error resilience strengths to video and depth as well as layers with different importance levels in the 3D video transmission. Then, a hybrid-priority based chunk scheduling (HPS) algorithm is proposed to be tied in with the proposed chunk segmentation algorithm to further promote the overall 3D video P2P streaming performance. The simulation results show that the proposed PLC3DCS algorithm with the corresponding HPS can increase the success delivery rates of chunks with more important levels, and further improve the user’s quality of 3D experience.     

IRS辅助的安全通信系统波束成形嵌套优化算法

智能反射面（Intelligent Reflecting Surface,IRS）是一种通过重新配置无线传播环境,提高无线通信网络安全性的绿色通信新技术。该文针对IRS辅助的多输入单输出安全通信系统,考虑在合法用户保密率约束下,联合优化基站处的发射波束成形和IRS处无源移相器的反射波束成形,使基站的发射功率最小。为了求解多变量耦合的非凸优化问题,我们提出了拉格朗日函数和粒子群嵌套优化算法,使用粒子群算法搜索IRS的反射波束成形,拉格朗日函数求解对应的发射波束成形,获得非凸优化问题的次优解。论文仿真比较了不同算法下基站所需的发射功率,结果表明所提算法基站所需发射功率更低。     

A distributed utility‐based scheduling for peer‐to‐peer video streaming over wireless networks

Interactive multimedia applications such as peer‐to‐peer (P2P) video services over the Internet have gained increasing popularity during the past few years. However, the adopted Internet‐based P2P overlay network architecture hides the underlying network topology, assuming that channel quality is always in perfect condition. Because of the time‐varying nature of wireless channels, this hardly meets the user‐perceived video quality requirement when used in wireless environments. Considering the tightly coupled relationship between P2P overlay networks and the underlying networks, we propose a distributed utility‐based scheduling algorithm on the basis of a quality‐driven cross‐layer design framework to jointly optimize the parameters of different network layers to achieve highly improved video quality for P2P video streaming services in wireless networks. In this paper, the quality‐driven P2P scheduling algorithm is formulated into a distributed utility‐based distortion‐delay optimization problem, where the expected video distortion is minimized under the constraint of a given packet playback deadline to select the optimal combination of system parameters residing in different network layers. Specifically, encoding behaviors, network congestion, Automatic Repeat Request/Query (ARQ), and modulation and coding are jointly considered. Then, we provide the algorithmic solution to the formulated problem. The distributed optimization running on each peer node adopted in the proposed scheduling algorithm greatly reduces the computational intensity. Extensive experimental results also demonstrate 4–14 dB quality enhancement in terms of peak signal‐to‐noise ratio by using the proposed scheduling algorithm. Copyright © 2015 John Wiley & Sons, Ltd.     

MDP-Based Network Selection Scheme by Genetic Algorithm and Simulated Annealing for Vertical-Handover in Heterogeneous Wireless Networks

The hybrid algorithm for real-time vertical handover using different objective functions has been presented to find the optimal network to connect with a good quality of service in accordance with the user’s preferences. Markov processes are widely used in performance modelling of wireless and mobile communication systems. We address the problem of optimal wireless network selection during vertical handover, based on the received information, by embedding the decision problem in a Markov decision process (MDP) with genetic algorithm (GA), we use GA to find a set of optimal decisions that ensures the best trade-off between QoS based on their priority level. Then, we emerge improved genetic algorithm (IGA) with simulated annealing (SA) as leading methods for search and optimization problems in heterogeneous wireless networks. We formulate the vertical handoff decision problem as a MDP, with the objectives of maximizing the expected total reward and minimizing average number of handoffs. A reward function is constructed to assess the QoS during each connection, and the AHP method are applied in an iterative way, by which we can work out a stationary deterministic handoff decision policy. As it is, the characteristics of the current mobile devices recommend using fast and efficient algorithms to provide solutions near to real-time. These constraints have moved us to develop intelligent algorithm that avoid the slow and massive computations. This paper compares the formulation and results of five recent optimization algorithms: artificial bee colony, GA, differential evolution, particle swarm optimization and hybrid of (GA–SA). Simulation results indicated that choosing the SA rules would minimize the cost function, and also that, the IGA–SA algorithm could decrease the number of unnecessary handovers, and thereby prevent the ‘Ping-Pong’ effect.