- Research Article
39
- 10.1016/j.jss.2003.09.029
Adaptive video transcoding and streaming over wireless channels
- Mar 25, 2004
- Journal of Systems and Software
- Zhijun Lei + 1 more +1
Adaptive video transcoding and streaming over wireless channels
The problem of optimal scheduling of multicast traffic in time-varying wireless networks is studied in the framework of utility maximization. Since the wireless channel cannot be known exactly, only scheduling policies that take decisions based on a possibly inaccurate estimate of the wireless channel state are considered. A stationary, on-line, gradient-based scheduling and rate control policy is introduced which identifies at every decision instant the sources that should access the wireless medium along with their respective transmission rates. Furthermore, in the case that more than one optimal rate allocation is possible, the one that requires the minimum sum-power expenditure is selected by the policy. The optimality of the proposed policy among all policies that have access to the same estimate of the current wireless channel state is established through stochastic approximation arguments.
Adaptive video transcoding and streaming over wireless channels
Adaptive video transcoding and streaming over wireless channels
A rate adaptation transcoding scheme for real-time video transmission over wireless channels
A rate adaptation transcoding scheme for real-time video transmission over wireless channels
Joint Optimal Data Rate and Power Allocation in Lossy Mobile Ad Hoc Networks with Delay-Constrained Traffics
In this paper, we consider lossy mobile ad hoc networks where the data rate of a given flow becomes lower and lower along its routing path. One of the main challenges in lossy mobile ad hoc networks is how to achieve the conflicting goal of increased network utility and reduced power consumption, while without following the instantaneous state of a fading channel. To address this problem, we propose a cross-layer rate-effective network utility maximization (RENUM) framework by taking into account the lossy nature of wireless links and the constraints of rate outage probability and average delay. In the proposed framework, the utility is associated with the effective rate received at the destination node of each flow instead of the injection rate at the source of the flow. We then present a distributed joint transmission rate, link power and average delay control algorithm, in which explicit broadcast message passing is required for power allocation algorithm. Motivated by the desire of power control devoid of message passing, we give a near-optimal power-allocation scheme that makes use of autonomous SINR measurements at each link and enjoys a fast convergence rate. The proposed algorithm is shown through numerical simulations to outperform other network utility maximization algorithms without rate outage probability/average delay constraints, leading to a higher effective rate, lower power consumption and delay. Furthermore, we conduct extensive network-wide simulations in NS-2 simulator to evaluate the performance of the algorithm in terms of throughput, delay, packet delivery ratio and fairness.
Read moreACWSN: an adaptive cross layer framework for video transmission over wireless sensor networks
Wireless multimedia sensor networks (WMSNs), have limited resources in terms of computational, memory, bandwidth, and battery capability, which makes transmitting multimedia content over it, is a challenge as multimedia requires QoS guarantee. Recently adopting cross-layer design in WMSNs proved to be a promising approach, which improves quality of service of WSN under various operational conditions. In this work, an adaptive cross layer framework for transmitting multimedia content over WSN (ACWSN) is presented, it is based on an extensive study of Group Of Picture structure effect on quality of multimedia transmission in various wireless channel states that is executed at sink node. It adaptably selects optimum video encoding parameters at application layer according to current wireless channel state which is communicated from physical layer and recommendations communicated from sink node; in addition an AVQ (adaptive video queue) which schedule packets according to its type to drop less important packets in case of network congestion. Simulation results show that ACWSN optimizes video quality in different wireless channel conditions.
Read moreJoint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty
We determine a joint link activation and routing policy that maximizes the stable throughput region of time-varying wireless ad-hoc networks with multiple commodities. In practice, the state of the channel process from the time it is observed till the time a transmission actually takes place can be significantly different. With this in mind, we introduce a stationary policy that takes scheduling and routing decisions based on a possibly inaccurate estimate of the true channel state. We show optimality of this policy within a broad class of link activation processes under certain mild conditions. In particular, processes in this class may be induced almost by any policy, possibly non-stationary, even anticipative and aware of the entire sample paths of the arrival, estimated and true channel processes, provided that it has no knowledge on the current true channel state, besides that available through its estimate.
Read moreVector quantisation for finite‐state Markov channels and application to wireless communications
Vector quantisation for joint source‐channel (JSC) coding over a finite‐state Markov channel (FSMC) is studied. In particular, minimum mean square error (MMSE) decoding of a vector quantised source in the absence of channel state information (CSI) is considered. Based on hidden Markov modelling of the channel output, two decoding strategies are proposed. The first one is a soft‐decoder which estimates the source reconstruction vectors directly from a sequence of channel output samples. The second one is a hard‐decoder based on joint maximum a posteriori (MAP) probability estimation of channel symbols and channel states. An iterative procedure for designing JSC optimised vector quantisers (VQs) is also proposed. Finally, the design of VQs for wireless channels using a finite‐state model is examined. Experimental results are provided for a Gauss‐Markov source and flat‐fading wireless channels. A comparison with an idealised tandem source‐channel coding system is also provided to demonstrate the advantage of the proposed JSC coding approach. Copyright © 2007 John Wiley & Sons, Ltd.
Read moreExperimental Study on the Performance of Rate Adaptation Algorithm in IEEE 802.11g Networks
<p>IEEE 802.11 technology provides a low-cost wireless networking solution. In the last few years, we have seen that the demand for high-bandwidth wireless local area networks increases rapidly, due to the proliferation of mobile devices such as laptops, smart phones and tablet PCs. This has driven the widespread deployment of IEEE 802.11 wireless networks to provide Internet access. However, wireless networks present their own unique problems. Wireless channel is extremely variable and can be affected by a number of different factors, such as collisions, multipath fading and signal attenuation. As such, rate adaptation algorithm is a key component of IEEE 802.11 standard which is used to vary the transmission data rate to match the wireless channel conditions, in order to achieve the best possible performance. Rate adaptation algorithm studies and evaluations are always hot research topics. However, despite its popularity, little work has been done on evaluating the performance of rate adaptation algorithms by comparing the throughput of the algorithm with the throughput of the fixed rates. This thesis presents an experimental study that compares the performance ofMikroTik rate adaptation algorithm andMinstrel rate adaptation algorithm against fixed rates in an IEEE 802.11g network. MikroTik and Minstrel rate adaptation algorithm are most commonly used algorithm around the world. All experiments are conducted in a real world environment in this thesis. In a real world environment, wireless channel conditions are not tightly being controlled, and it is extremely vulnerable to interference of surrounding environment. The dynamic changes of wireless channel conditions have a considerable effect on the performance of rate adaptation algorithms. The main challenge of evaluating a rate adaptation algorithm in a real world environment is getting different experiment behaviours from the same experiment. Experiment results may indicate many different behaviours which due to the leak of wireless environment controlling. Having a final conclusion from those experiment results can be a challenge task. In order to perform a comprehensive rate adaptation algorithm evaluation. All experiments run 20 times for 60 seconds. The average result and stand deviation is calculated. We also design and implement an automation experiment controlling program to help us maintain that each run of experiment is following exactly the same procedures. In MikroTik rate adaptation algorithm evaluation, the results show in many cases that fixed rate outperforms rate adaptation. Our findings raise questions regarding the suitability of the adopted rate adaptation algorithm in typical indoor environments. Furthermore, our study indicates that it is not wise to simply ignore fixed rate. A fine selection of a fixed rate could be made to achieve desired performance. The result ofMinstrel rate adaptation evaluation show that whilst Minstrel performs reasonably well in static wireless channel conditions, in some cases the algorithm has difficulty selecting the optimal data rate in the presence of dynamic channel conditions. In addition, Minstrel performs well when the channel condition improves frombad quality to good quality. However, Minstrel has trouble selecting the optimal rate when the channel condition deteriorates from good quality to bad quality. By comparing the experimental results between the performance of rate adaptation algorithms and the performance of fixed data rate against different factors, the experiment results directly pointed out the weakness of these two rate adaptation algorithms. Our findings from both experiments provide useful information on the design of rate adaptation algorithms.</p>
Read moreOn the Capacity-Performance Trade-Off of Online Policy in Delayed Mobile Offloading
WiFi offloading, where mobile users opportunistically obtain data through WiFi rather than cellular networks, is a promising technique for greatly improving spectrum efficiency and reduce cellular network congestion. We consider a system where the service provider deploys multiple WiFi hotspots to offload mobile traffic, and study the scheduling policy to maximize the amount of offloaded data. Since users’ movements are unpredictable, we focus on online scheduling policy, where APs have no knowledge of users’ mobility patterns. We study the performance of online policies by comparing them against the optimal offline policy. We prove that any work-conserving policy is able to offload at least half as much data as the offline policy, and then propose an online policy such that when the requested data by each user is very large, the policy can offload $(e-1)/e$ as much data as the offline policy, where $e$ is Euler’s constant. We further study the case where the service provider can increase the capacity of WiFi so as to provide some guarantees on the amount of offloaded data. We derive a lower-bound on the trade-off between capacity and the amount of offloaded data, and propose a simple online policy that achieves this lower bound. In addition, we show that our policy only needs half as much capacity as current mechanisms to provide the same performance guarantee.
Read moreCapacity-distortion trade-off in channels with state
A problem of state information transmission over a state-dependent discrete memoryless channel (DMC) with independent and identically distributed (i.i.d.) states, known strictly causally at the transmitter is investigated. It is shown that block-Markov encoding coupled with channel state estimation conditioned on treating the decoded message and received channel output as side information at the decoder yields the minimum state estimation error. This same channel can also be used to send additional independent information at the expense of a higher channel state estimation error. The optimal tradeoff between the rate of the independent information that can be reliably transmitted and the state estimation error is characterized via the capacity-distortion function. It is shown that any optimal tradeoff pair can be achieved via a simple rate-splitting technique, whereby the transmitter appropriately allocates its rate between pure information transmission and state estimation.
Read moreCross-layer Optimization for Wireless Networks with Deterministic Channel Models
Existing work on cross-layer optimization for wireless networks adopts simple physical-layer models, i.e., treating interference as noise. In this paper, we adopt a deterministic channel model proposed in, a simple abstraction of the physical layer that effectively captures the effect of channel strength, broadcast and superposition in wireless channels. Within the Network Utility Maximization (NUM) framework, we study the cross-layer optimization for wireless networks based on this deterministic channel model. First, we extend the well-applied conflict graph model to capture the flow interactions over the deterministic channels and characterize the feasible rate region. Then we study distributed algorithms for general wireless multi-hop networks. The convergence of algorithms is proved by Lyapunov stability theorem and stochastic approximation method. Further, we show the convergence to the bounded neighborhood of optimal solutions with probability one under constant steps and constant update intervals. Our numerical evaluation validates the analytical results.
Read moreEffective Capacity of a Rayleigh Fading Channel in the Presence of Interference
In recent years the concept of the effective capacity that relates the physical layer characteristics of a wireless channel to the data link layer has gained a lot of attraction in wireless networking research community. The effective capacity is based on Gartner-Ellis’ large deviation theorem and it is used to provide the statistical QoS provisioning in the wireless networks. Effective capacity also helps in the analysis of the resource allocation or scheduling policies in various wireless systems such as Relay networks, multi-user systems and multi-carrier systems subject to statistical QoS requirements. The effective capacity in noise limited wireless network has already been investigated in the recent works. Considering the interference limited wireless channels, in this paper we propose an analytical approach based on Laplace’s method for the effective capacity of uncorrelated Rayleigh fading channel in the presence of uncorrelated Rayleigh fading interference. The accuracy of the analytical model for the effective capacity is validated by numerical simulations. We also provide the evaluation of tail probability of the delay and maximum sustainable rate. The validation results reveal that the proposed mathematical approach to the effective capacity can open the path for further researches in statistical QoS provisioning in interference limited wireless networks.
Read moreOn the estimation of available bandwidth in broadband cellular networks
Over-the-top estimation of available bandwidth (AB) in a network path has been well studied for wired networks. The AB of a path denotes its slack capacity, i.e., the bandwidth available for use in the path without impacting the existing traffic. This estimation problem has been receiving attention only recently in cellular networks, which are increasingly becoming one of the main modes of access for a large number of applications. In this paper, we discuss the challenges posed by the problem, and why existing techniques developed for wired networks cannot be applied. We show that, interestingly, it may not even be feasible to estimate AB using over-the-top approaches under certain conditions, even when the wireless channel and traffic conditions are non-varying. We then present a novel AB estimation technique for cellular networks, which typically use proportional fair scheduling at base stations. When the wireless channel and traffic conditions are non-varying, our technique can accurately determine AB when it exceeds the “fair share” due to a new flow. We also extend the basic technique for estimation under conditions that are time-varying. The proposed methods can as well be used when one or more bottleneck links in a network path are fair-scheduled using algorithms such as weighted-fair queueing. We evaluate our methods using simulations and over operational networks, and present the results. In simulations, our technique is capable of detecting AB close to 90% of the time under feasible conditions even with bursty traffic.
Read moreVideo-Aware Scheduling and Caching in the Radio Access Network
In this paper, we introduce distributed caching of videos at the base stations of the Radio Access Network (RAN) to significantly improve the video capacity and user experience of mobile networks. To ensure effectiveness of the massively distributed but relatively small-sized RAN caches, unlike Internet content delivery networks (CDNs) that can store millions of videos in a relatively few large-sized caches, we propose RAN-aware reactive and proactive caching policies that utilize User Preference Profiles (UPPs) of active users in a cell. Furthermore, we propose video-aware backhaul and wireless channel scheduling techniques that, in conjunction with edge caching, ensure maximizing the number of concurrent video sessions that can be supported by the end-to-end network while satisfying their initial delay requirements and minimize stalling. To evaluate our proposed techniques, we developed a statistical simulation framework using MATLAB and performed extensive simulations under various cache sizes, video popularity and UPP distributions, user dynamics, and wireless channel conditions. Our simulation results show that RAN caches using UPP-based caching policies, together with video-aware backhaul scheduling, can improve capacity by 300% compared to having no RAN caches, and by more than 50% compared to RAN caches using conventional caching policies. The results also demonstrate that using UPP-based RAN caches can significantly improve the probability that video requests experience low initial delays. In networks where the wireless channel bandwidth may be constrained, application of our videoaware wireless channel scheduler results in significantly (up to 250%) higher video capacity with very low stalling probability.
Read moreVariable Content Characteristic and Variable Network Coding for Wireless Digital Video Broadcasting Application
Digital video broadcasting network facilitates distribution of real time video and video on demand services to global end users. This network has significant limitations stemming from scarced network resources to meet users popular demand of improved received quality. This research, presents a thorough investigation of variable content characteristic and application of variable network coding on digital video quality performance over wireless channel to enhance received video quality performance. In the proposed scheme, variable channel coding-rate is deployed to provide significant received quality performance gain by intelligently avoiding waste of limited network resources related to the fixed resource allocation necessary to guarantee acceptable quality performance. In order to assess the performance of the proposed scheme, experimental set up consisting of H.264 reference software for source coding, motion rate classifier and simulated wireless channel consisting of various channel coding and modulation schemes were adopted for this study. The test video samples were classified into high and low motion rate videos. In contrast, investigation of extension from fixed channel coding scheme to the application of variable channel coding-rate and modulation schemes in response to variable content motion-rate is analyzed over error free and poor channel conditions. The quality performance of received video quality over various wireless channel conditions is measured using standard objective algorithm, Peak-Signal-to-Noise-Ratio (PSNR). For the Soccer test video sample representing high motion rate videos, the 16QAM;1/2, the lower channel coding rate recorded the highest received video quality performance with PSNR value of 37.95dB compared to PSNR values of 33.29dB for 64QAM;1/2, and 24.40dB for the 64QAM;2/3 modulation and channel coding technique. Whereas, Akiyo test video sample representing low motion rate videos recorded significant quality performance of 51.19dB, 50.97dB and 39.93dB for 16QAM;1/2, 64QAM;1/2 and 64QAM;2/3 channel coding and modulation schemes, respectively.
Read moreTCP Performance Dynamics and Link-Layer Adaptation Based Optimization Methods for Wireless Networks
Almost a decade long research on the performance of TCP in wireless networks has resulted in many proposals and solutions to the problem of TCP throughput degradation. Several of these measures, however, have their share of drawbacks. With the continuing emergence of wireless technologies ever since the work on TCP performance over wireless began, smart link-layer mechanisms like adaptive modulation and coding, power control, and incremental redundancy have been designed and deployed. In this work, we outline a cross-layer optimization framework based on the congestion control dynamics of a bulk-transfer TCP flow and demonstrate its application to networks which offer link-layer adaptive measures. We begin by observing that the TCP's congestion window dynamics are comprised of certain recurring patterns which we term as cycles. We then overlay a TCP throughput optimization methodology that selects link-layer transmission modes (e.g. modulation scheme, coding rate, transmission power, or a combination thereof) in accordance with TCP dynamics and wireless channel conditions. We provide insights into the working of the optimization procedure which protects TCP segments against losses on the wireless channel when the TCP congestion window size (in bytes) is below the bandwidth-delay product of the network. The protection against wireless channel losses is rendered by the link-layer by employing robust modulation and coding schemes, high transmission power, etc. We show that TCP dynamics aware link adaptation measures lead to substantial enhancement of TCP throughput in EGPRS and IEEE 802.11a networks
Read more