Adaptive Prioritized Random Linear Coding and Scheduling for Layered Data Delivery From Multiple Servers

In this paper, we deal with the problem of jointly determining the optimal coding strategy and the scheduling decisions when receivers obtain layered data from multiple servers. The layered data is encoded by means of prioritized random linear coding (PRLC) in order to be resilient to channel loss while respecting the unequal levels of importance in the data, and data blocks are transmitted simultaneously in order to reduce decoding delays and improve the delivery performance. We formulate the optimal coding and scheduling decisions problem in our novel framework with the help of Markov decision processes (MDP), which are effective tools for modeling adapting streaming systems. Reinforcement learning approaches are then proposed to derive reduced computational complexity solutions to the adaptive coding and scheduling problems. The novel reinforcement learning approaches and the MDP solution are examined in an illustrative example for scalable video transmission . Our methods offer large performance gains over competing methods that deliver the data blocks sequentially. The experimental evaluation also shows that our novel algorithms offer continuous playback and guarantee small quality variations which is not the case for baseline solutions. Finally, our work highlights the advantages of reinforcement learning algorithms to forecast the temporal evolution of data demands and to decide the optimal coding and scheduling decisions

Network-based dynamic prioritization of HTTP adaptive streams to avoid video freezes

HTTP Adaptive Streaming (HAS) is becoming the de-facto standard for video streaming services over the Internet. In HAS, each video is segmented and stored in different qualities. Rate adaptation heuristics, deployed at the client, allow the most appropriate quality level to be dynamically requested, based on the current network conditions. Current heuristics under-perform when sudden bandwidth drops occur, therefore leading to freezes in the video play-out, the main factor influencing users' Quality of Experience (QoE). In this article, we propose an Openflow-based framework capable of increasing clients' QoE by reducing video freezes. An Openflow-controller is in charge of introducing prioritized delivery of HAS segments, based on feedback collected from both the network nodes and the clients. To reduce the side-effects introduced by prioritization on the bandwidth estimation of the clients, we introduce a novel mechanism to inform the clients about the prioritization status of the downloaded segments without introducing overhead into the network. This information is then used to correct the estimated bandwidth in case of prioritized delivery. By evaluating this novel approach through emulation, under varying network conditions and in several multi-client scenarios, we show how the proposed approach can reduce freezes up to 75% compared to state-of-the-art heuristics

Inter-session Network Coding for Transmitting Multiple Layered Streams over Single-hop Wireless Networks

This paper studies the problem of transmitting multiple independent layered video streams over single-hop wireless networks using network coding (NC). We combine feedback-free random linear NC (RLNC) with unequal error protection (UEP) and our goal is to investigate the benefits of coding across streams, i.e. inter session NC. To this end, we present a transmission scheme that in addition to mixing packets of different layers of each stream (intra-session NC), mixes packets of different streams as well. Then, we propose the analytical formulation of the layer decoding probabilities for each user and utilize it to define a theoretical performance metric. Assessing this performance metric under various scenarios, it is observed that inter-session NC improves the trade-off among the performances of users. Furthermore, the analytical results show that the throughput gain of inter-session NC over intra-session NC increases with the number of independent streams and also by increasing packet error rate, but degrades as network becomes more heterogeneous.Comment: Accepted to be presented at 2014 IEEE Information Theory Workshop (ITW), 5 pages, 4 figure

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

Efficient radio resource management in next generation wireless networks

The current decade has witnessed a phenomenal growth in mobile wireless communication networks and subscribers. In 2015, mobile wireless devices and connections were reported to have grown to about 7.9 billion, exceeding human population. The explosive growth in mobile wireless communication network subscribers has created a huge demand for wireless network capacity, ubiquitous wireless network coverage, and enhanced Quality of Service (QoS). These demands have led to several challenging problems for wireless communication networks operators and designers. The Next Generation Wireless Networks (NGWNs) will support high mobility communications, such as communication in high-speed rails. Mobile users in such high mobility environment demand reliable QoS, however, such users are plagued with a poor signal-tonoise ratio, due to the high vehicular penetration loss, increased transmission outage and handover information overhead, leading to poor QoS provisioning for the networks' mobile users. Providing a reliable QoS for high mobility users remains one of the unique challenges for NGWNs. The increased wireless network capacity and coverage of NGWNs means that mobile communication users at the cell-edge should have enhanced network performance. However, due to path loss (path attenuation), interference, and radio background noise, mobile communication users at the cell-edge can experience relatively poor transmission channel qualities and subsequently forced to transmit at a low bit transmission rate, even when the wireless communication networks can support high bit transmission rate. Furthermore, the NGWNs are envisioned to be Heterogeneous Wireless Networks (HWNs). The NGWNs are going to be the integration platform of diverse homogeneous wireless communication networks for a convergent wireless communication network. The HWNs support single and multiple calls (group calls), simultaneously. Decision making is an integral core of radio resource management. One crucial decision making in HWNs is network selection. Network selection addresses the problem of how to select the best available access network for a given network user connection. For the integrated platform of HWNs to be truly seamless and efficient, a robust and stable wireless access network selection algorithm is needed. To meet these challenges for the different mobile wireless communication network users, the NGWNs will have to provide a great leap in wireless network capacity, coverage, QoS, and radio resource utilization. Moving wireless communication networks (mobile hotspots) have been proposed as a solution to providing reliable QoS to high mobility users. In this thesis, an Adaptive Thinning Mobility Aware (ATMA) Call Admission Control (CAC) algorithm for improving the QoS and radio resource utilization of the mobile hotspot networks, which are of critical importance for communicating nodes in moving wireless networks is proposed. The performance of proposed ATMA CAC scheme is investigated and compare it with the traditional CAC scheme. The ATMA scheme exploits the mobility events in the highspeed mobility communication environment and the calls (new and handoff calls) generation pattern to enhance the QoS (new call blocking and handoff call dropping probabilities) of the mobile users. The numbers of new and handoff calls in wireless communication networks are dynamic random processes that can be effectively modeled by the Continuous Furthermore, the NGWNs are envisioned to be Heterogeneous Wireless Networks (HWNs). The NGWNs are going to be the integration platform of diverse homogeneous wireless communication networks for a convergent wireless communication network. The HWNs support single and multiple calls (group calls), simultaneously. Decision making is an integral core of radio resource management. One crucial decision making in HWNs is network selection. Network selection addresses the problem of how to select the best available access network for a given network user connection. For the integrated platform of HWNs to be truly seamless and efficient, a robust and stable wireless access network selection algorithm is needed. To meet these challenges for the different mobile wireless communication network users, the NGWNs will have to provide a great leap in wireless network capacity, coverage, QoS, and radio resource utilization. Moving wireless communication networks (mobile hotspots) have been proposed as a solution to providing reliable QoS to high mobility users. In this thesis, an Adaptive Thinning Mobility Aware (ATMA) Call Admission Control (CAC) algorithm for improving the QoS and radio resource utilization of the mobile hotspot networks, which are of critical importance for communicating nodes in moving wireless networks is proposed

Quality of service differentiation for multimedia delivery in wireless LANs

Delivering multimedia content to heterogeneous devices over a variable networking environment while maintaining high quality levels involves many technical challenges. The research reported in this thesis presents a solution for Quality of Service (QoS)-based service differentiation when delivering multimedia content over the wireless LANs. This thesis has three major contributions outlined below: 1. A Model-based Bandwidth Estimation algorithm (MBE), which estimates the available bandwidth based on novel TCP and UDP throughput models over IEEE 802.11 WLANs. MBE has been modelled, implemented, and tested through simulations and real life testing. In comparison with other bandwidth estimation techniques, MBE shows better performance in terms of error rate, overhead, and loss. 2. An intelligent Prioritized Adaptive Scheme (iPAS), which provides QoS service differentiation for multimedia delivery in wireless networks. iPAS assigns dynamic priorities to various streams and determines their bandwidth share by employing a probabilistic approach-which makes use of stereotypes. The total bandwidth to be allocated is estimated using MBE. The priority level of individual stream is variable and dependent on stream-related characteristics and delivery QoS parameters. iPAS can be deployed seamlessly over the original IEEE 802.11 protocols and can be included in the IEEE 802.21 framework in order to optimize the control signal communication. iPAS has been modelled, implemented, and evaluated via simulations. The results demonstrate that iPAS achieves better performance than the equal channel access mechanism over IEEE 802.11 DCF and a service differentiation scheme on top of IEEE 802.11e EDCA, in terms of fairness, throughput, delay, loss, and estimated PSNR. Additionally, both objective and subjective video quality assessment have been performed using a prototype system. 3. A QoS-based Downlink/Uplink Fairness Scheme, which uses the stereotypes-based structure to balance the QoS parameters (i.e. throughput, delay, and loss) between downlink and uplink VoIP traffic. The proposed scheme has been modelled and tested through simulations. The results show that, in comparison with other downlink/uplink fairness-oriented solutions, the proposed scheme performs better in terms of VoIP capacity and fairness level between downlink and uplink traffic

Urban mobility services based on user virtualization and social IoT

Smart cities are characterized by smart heterogeneous devices that can interact and cooperate with each other by exchanging regularly low amounts of data in the context of IoT. Lately, there has been an increasing interest in enhancing the IoT paradigm to support exchange of multimedia data. This paper focuses on the concept of Urban Mobility Services and in particular on proposing a solution to enable best QoS and load balance in a 5G network context. The paper introduces a novel algorithm for MobilIty Services uSer vIrtualizatiON (MISSION). MISSION employs cloud computing and broadcast of multimedia content in order to reduce the network load, the number of interactions, and user device energy consumption. It also relies on rating of network reputation in the 5G heterogeneous network environment and performing network selection in the quest to maximize QoS parameters. The performance of the proposed solution is compared against that of a TraffictYpe-based DifferEntiated Reputation (TYDER) algorithm. This performance was evaluated in terms of QoS parameters such as delay, latency, packet loss and prediction error. The results show how MISSION outperforms TYDER in urban mobility scenario

Task Assignment and Path Planning for Autonomous Mobile Robots in Stochastic Warehouse Systems

The material handling industry is in the middle of a transformation from manual operations to automation due to the rapid growth in e-commerce. Autonomous mobile robots (AMRs) are being widely implemented to replace manually operated forklifts in warehouse systems to fulfil large shipping demand, extend warehouse operating hours, and mitigate safety concerns. Two open questions in AMR management are task assignment and path planning. This dissertation addresses the task assignment and path planning (TAPP) problem for autonomous mobile robots (AMR) in a warehouse environment. The goals are to maximize system productivity by avoiding AMR traffic and reducing travel time. The first topic in this dissertation is the development of a discrete event simulation modeling framework that can be used to evaluate alternative traffic control rules, task assignment methods, and path planning algorithms. The second topic, Risk Interval Path Planning (RIPP), is an algorithm designed to avoid conflicts among AMRs considering uncertainties in robot motion. The third topic is a deep reinforcement learning (DRL) model that is developed to solve task assignment and path planning problems, simultaneously. Experimental results demonstrate the effectiveness of these methods in stochastic warehouse systems