This article proposes a novel energy-efficient multimedia delivery system called EStreamer. First, we study the relationship between buffer size at the client, burst-shaped TCP-based multimedia traffic, and energy consumption of wireless network interfaces in smartphones. Based on the study, we design and implement EStreamer for constant bit rate and rate-adaptive streaming. EStreamer can improve battery lifetime by 3x, 1.5x, and 2x while streaming over Wi-Fi, 3G, and 4G, respectively.
Compared to our earlier work @cite_15 , our notable new contributions are the following. First we demonstrate the relationship between available buffer space at the client, the received burst size and the energy consumption. After that, we illustrate the implementation of EStreamer for both CBR and rate-adaptive streaming, and then demonstrate how EStreamer quickly fine-tunes the energy-optimal configuration for a given client using a binary search approach. @cite_13 , we analyzed only video streaming results, whereas in this work we include power and signaling measurement results both for audio and video streaming scenarios.
@cite_15 @cite_13
2044762744 2101261257 2622055490 2057415916
Shaping constant bit rate traffic into bursts has been proposed earlier for UDP-based multimedia streaming to save Wi-Fi communication energy of mobile devices. The relationship between the burst size and energy consumption of wireless interfaces is such that the larger is the burst size, the lower is the energy consumption per bit received as long as there is no packet loss. However, the relationship between the burst size and energy in case of TCP traffic has not yet been fully uncovered. In this paper, we develop a power consumption model which describes this relationship in wireless multimedia streaming scenarios. Then, we implement a cross-layer stream delivery system, EStreamer. This system relies on a heuristic derived from the model and on client playback buffer status to determine a burst size and provides as small energy consumption as possible without jeopardizing smooth playback. The heuristic greatly simplifies the deployment of EStreamer compared to most existing solutions by ensuring energy savings regardless of the wireless interface being used. We show that in the best cases using EStreamer reduces energy consumption of a mobile device by 65 , 50-60 and 35 while streaming over Wi-Fi, LTE and 3G respectively. Compared with existing energy-aware applications energy consumption can be reduced by 10-55 further. This paper considers the problem of power management and throughput maximization for energy neutral operation when using an energy harvesting sensor (EHS) to send data over a wireless link. The EHS is assumed to be able to harvest energy at a constant rate, and use a fixed part of the energy harvested in a slot for measuring the channel state. The rest of the energy harvested is available for transmission, however, it can be stored in an inefficient battery if it is not fully utilized. The key constraint that the EHS needs to satisfy is energy neutrality, i.e., the expected energy drawn from the battery should equal the expected energy deposited into the battery. In this scenario, two popular models for data transmission are contrasted: the constant bit rate (CBR) model and the variable bit rate (VBR) model. In the CBR model, it is assumed that the EHS are designed to transmit data at a constant rate (using a fixed modulation and coding scheme) but are power-controlled. In the VBR model, the EHS selects both the transmit power and the data rate of transmission in each slot based on the channel instantiation. A framework under which the system designer can optimize several parameters of the EHS that determine the average data rate performance when the channel is Rayleigh fading is developed. Using this framework, the two transmission schemes are contrasted. It is shown that, with the right choice of parameter settings, the CBR scheme can perform nearly as well as the VBR scheme at significantly lower complextiy. The usefulness and validity of the framework developed is illustrated through simulations for specific examples. Stalls during video playback are perhaps the most important indicator of a client's viewing experience. To provide the best possible service, a proactive network operator may therefore want to know the buffer conditions of streaming clients and use this information to help avoid stalls due to empty buffers. However, estimation of clients' buffer conditions is complicated by most streaming services being rate-adaptive, and many of them also encrypted. Rate adaptation reduces the correlation between network throughput and client buffer conditions. Usage of HTTPS prevents operators from observing information related to video chunk requests, such as indications of rate adaptation or other HTTP-level information. This paper presents BUFFEST, a novel classification framework that can be used to classify and predict streaming clients' buffer conditions from both HTTP and HTTPS traffic. To illustrate the tradeoffs between prediction accuracy and the available information used by classifiers, we design and evaluate classifiers of different complexity. At the core of BUFFEST is an event-based buffer emulator module for detailed analysis of clients' buffer levels throughout a streaming session, as well as for automated training and evaluation of online packet-level classifiers. We then present example results using simple threshold-based classifiers and machine learning classifiers that only use TCP IP packet-level information. Our results are encouraging and show that BUFFEST can distinguish streaming clients with low buffer conditions from clients with significant buffer margin during a session even when HTTPS is used. We consider the design of a scheduling policy for video streaming in a wireless network formed by several users and helpers (e.g., base stations). In such networks, any user is typically in the range of multiple helpers. Hence, an efficient policy should allow the users to dynamically select the helper nodes to download from and determine adaptively the quality level of the requested video segment. In order to obtain a tractable formulation, we follow a “divide and conquer” approach. First, we formulate a network utility maximization (NUM) problem where the network utility function is a concave and component-wise nondecreasing function of the time-averaged users' requested video quality index, and maximization is subject to the stability of all queues in the system. Second, we solve the NUM problem by using a Lyapunov drift plus penalty approach, obtaining a dynamic adaptive scheme that decomposes into two building blocks: 1) adaptive video quality and helper selection (run at the user nodes); and 2) dynamic allocation of the helper-to-user transmission rates (run at the help nodes). Our solution provably achieves NUM optimality in a strong per-sample path sense (i.e., without assumptions of stationarity and ergodicity). Third, we observe that, since all queues in the system are stable, all requested video chunks shall be eventually delivered. Fourth, in order to translate the requested video quality into the effective video quality at the user playback, it is necessary that the chunks are delivered within their playback deadline. This requires that the largest delay among all queues at the helpers serving any given user is less than the pre-buffering time of that user at its streaming session startup phase. In order to achieve this condition with high probability, we propose an effective and decentralized (albeit heuristic) scheme to adaptively calculate the pre-buffering and re-buffering time at each user. In this way, the system is forced to work in the “smooth streaming regime,” i.e., in the regime of very small playback buffer underrun rate. Through simulations, we evaluate the performance of the proposed algorithm under realistic assumptions of a network with densely deployed helper and user nodes, including user mobility, variable bit-rate video coding, and users joining or leaving the system at arbitrary times.