Multipath streaming: fundamental limits and efficient algorithms

We investigate streaming over multiple links. A file is split into small units called chunks that may be requested on the various links according to some policy, and received after some random delay. After a start-up time called pre-buffering time, received chunks are played at a fixed speed. There is starvation if the chunk to be played has not yet arrived. We provide lower bounds (fundamental limits) on the starvation probability of any policy. We further propose simple, order-optimal policies that require no feedback. For general delay distributions, we provide tractable upper bounds for the starvation probability of the proposed policies, allowing to select the pre-buffering time appropriately. We specialize our results to: (i) links that employ CSMA or opportunistic scheduling at the packet level, (ii) links shared with a primary user (iii) links that use fair rate sharing at the flow level. We consider a generic model so that our results give insight into the design and performance of media streaming over (a) wired networks with several paths between the source and destination, (b) wireless networks featuring spectrum aggregation and (c) multi-homed wireless networks.Comment: 24 page

Resource management in QoS-aware wireless cellular networks

2011 Summer.Includes bibliographical references.Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study two types of resource allocation problems in QoS-aware wireless cellular networks. First, we develop a rigorous framework to study opportunistic scheduling in multiuser OFDM systems. We derive optimal opportunistic scheduling policies under three common QoS/fairness constraints for multiuser OFDM systems--temporal fairness, utilitarian fairness, and minimum-performance guarantees. To implement these optimal policies efficiently, we provide a modified Hungarian algorithm and a simple suboptimal algorithm. We then propose a generalized opportunistic scheduling framework that incorporates multiple mixed QoS/fairness constraints, including providing both lower and upper bound constraints. Next, taking input queues and channel memory into consideration, we reformulate the transmission scheduling problem as a new class of Markov decision processes (MDPs) with fairness constraints. We investigate the throughput maximization and the delay minimization problems in this context. We study two categories of fairness constraints, namely temporal fairness and utilitarian fairness. We consider two criteria: infinite horizon expected total discounted reward and expected average reward. We derive and prove explicit dynamic programming equations for the above constrained MDPs, and characterize optimal scheduling policies based on those equations. An attractive feature of our proposed schemes is that they can easily be extended to fit different objective functions and other fairness measures. Although we only focus on uplink scheduling, the scheme is equally applicable to the downlink case. Furthermore, we develop an efficient approximation method--temporal fair rollout--to reduce the computational cost

Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

Wireless Cellular Networks

When aiming for achieving high spectral efficiency in wireless cellular networks, cochannel interference (CCI) becomes the dominant performancelimiting factor. This article provides a survey of CCI mitigation techniques, where both active and passive approaches are discussed in the context of both open- and closed-loop designs.More explicitly, we considered both the family of flexible frequency-reuse (FFR)-aided and dynamic channel allocation (DCA)-aided interference avoidance techniques as well as smart antenna-aided interference mitigation techniques, which may be classified as active approach

Bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation for wireless networks

Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications pose special channel-specific problems such as time-varying link capacities and location-dependent errors. These problems make designing efficient and effective traffic scheduling algorithms for wireless networks very challenging. Although many wireless packet scheduling algorithms have been proposed in recent years, issues such as how to improve bandwidth efficiency and maintain goodput fairness with various link qualities for power-constrained mobile hosts remain unresolved. In this paper, we devise a simple wireless packet scheduling algorithm called bandwidth-guaranteed fair scheduling with effective excess bandwidth allocation (BGFS-EBA), which addresses these issues. Our studies reveal that BGFS-EBA effectively distributes excess bandwidth, strikes a balance between effort-fair and outcome-fair, and provides a delay bound for error-free flows and transmission effort guarantees for error-prone flows. © 2008 IEEE.published_or_final_versio

SCHEDULING IN PACKET SWITCHED CELLULAR WIRELESS SYSTEMS

In cellular wireless networks where users have independent fading channels, throughput for delay tolerant applications has been greatly increased on the downlink by using opportunistic schedulers at the base station. These schedulers exploit the multiuser diversity inherent in cellular systems. An interesting question is how opportunistic schedulers will provide Quality of Service(QoS) guarantees for a mix of data traffic and traffic from delay-sensitive multimedia applications. In the first part of this dissertation, we completely characterize the scheduled rate, delay and packet service times experienced by mobile users in a packet switched cellular wireless system in terms of a configurable base station scheduler metric. The metric used has a general form, combining an estimate of a mobile user's channel quality with the scheduling delay experienced by the user. In addition to quantifying the scheduler performance, our analysis highlights the inherent trade-off between system throughput and the delay experienced by mobile users with opportunistic scheduling. We also use this analysis to study the effect of prioritized voice users on data users in a cellular wireless system with delay constrained opportunistic scheduling. Our statistical analysis of the forward link is validated by extensive simulations of a system architecture based on the CDMA 1xEV-DO system. The increase in data traffic from mobiles to the base station has led to a growing interest in a scheduled reverse link in the 1xEV-DO system. We address the reverse link scheduling problem in a multi-cell scenario with interference constraints both within and outside the cell. This approach leads to a co-operative scheduling algorithm where each base station in a cellular network maximizes the sum of mobile data transmission rates subject to linear constraints on (1) the maximum received power for individual mobiles(2) the total interference caused by scheduled mobiles to (a) traffic and control channels of other mobiles within the cell and (b) mobiles in neighboring cells. Simulations of the reverse link structure based on the 1xEV-D0 system highlight the distinct advantages of this algorithm in ensuring predictable inter-cell interference and higher aggregate cell throughputs

Performance Evaluation of v-eNodeB using Virtualized Radio Resource Management

With the demand upsurge for high bandwidth services, continuous increase in the number of cellular subscriptions, adoption of Internet of Things (IoT), and marked growth in Machine-to-Machine (M2M) traffic, there is great stress exerted on cellular network infrastructure. The present wireline and wireless networking technologies are rigid in nature and heavily hardware-dependent, as a result of which the process of infrastructure upgrade to keep up with future demand is cumbersome and expensive. Software-defined networks (SDN) hold the promise to decrease network rigidity by providing central control and flow abstraction, which in current network setups are hardware-based. The embrace of SDN in traditional cellular networks has led to the implementation of vital network functions in the form of software that are deployed in virtualized environments. This approach to move crucial and hardware intensive network functions to virtual environments is collectively referred to as network function virtualization (NFV). Our work evaluates the cost reduction and energy savings that can be achieved by the application of SDN and NFV technologies in cellular networks. In this thesis, we implement a virtualized eNodeB component (Radio Resource Management) to add agility to the network setup and improve performance, which we compare with a traditional resource manager. When combined with dynamic network resource allocation techniques proposed in Elastic Handoff, our hardware agnostic approach can achieve a greater reduction in capital and operational expenses through optimal use of network resources and efficient energy utilization. Advisor: Jitender S. Deogu

Socio-economic aware data forwarding in mobile sensing networks and systems

The vision for smart sustainable cities is one whereby urban sensing is core to optimising city operation which in turn improves citizen contentment. Wireless Sensor Networks are envisioned to become pervasive form of data collection and analysis for smart cities but deployment of millions of inter-connected sensors in a city can be cost-prohibitive. Given the ubiquity and ever-increasing capabilities of sensor-rich mobile devices, Wireless Sensor Networks with Mobile Phones (WSN-MP) provide a highly flexible and ready-made wireless infrastructure for future smart cities. In a WSN-MP, mobile phones not only generate the sensing data but also relay the data using cellular communication or short range opportunistic communication. The largest challenge here is the efficient transmission of potentially huge volumes of sensor data over sometimes meagre or faulty communications networks in a cost-effective way. This thesis investigates distributed data forwarding schemes in three types of WSN-MP: WSN with mobile sinks (WSN-MS), WSN with mobile relays (WSN-HR) and Mobile Phone Sensing Systems (MPSS). For these dynamic WSN-MP, realistic models are established and distributed algorithms are developed for efficient network performance including data routing and forwarding, sensing rate control and and pricing. This thesis also considered realistic urban sensing issues such as economic incentivisation and demonstrates how social network and mobility awareness improves data transmission. Through simulations and real testbed experiments, it is shown that proposed algorithms perform better than state-of-the-art schemes.Open Acces