With the rapid growth of multimedia applications and the advances of wireless communication technologies, quality-of-service (QoS) provisioning for multimedia services in heterogeneous wireless networks has been an important issue and drawn much attention from both academia and industry. Due to the hostile transmission environment and limited radio resources, QoS provisioning in wireless networks is much more complex and difficult than in its wired counterpart. Moreover, due to the lack of central controller in the networks, distributed network control is required, adding complexity to QoS provisioning. In this thesis, medium access control (MAC) with QoS provisioning is investigated for both single- and multi-hop wireless networks including wireless local area networks (WLANs), wireless ad hoc networks, and wireless mesh networks. Originally designed for high-rate data traffic, a WLAN has limited capability to support delay-sensitive voice traffic, and the service for voice traffic may be impacted by data traffic load, resulting in delay violation or large delay variance. Aiming at addressing these limitations, we propose an efficient MAC scheme and a call admission control algorithm to provide guaranteed QoS for voice traffic and, at the same time, increase the voice capacity significantly compared with the current WLAN standard. In addition to supporting voice traffic, providing better services for data traffic in WLANs is another focus of our research. In the current WLANs, all the data traffic receives the same best-effort service, and it is difficult to provide further service differentiation for data traffic based on some specific requirements of customers or network service providers. In order to address this problem, we propose a novel token-based scheduling scheme, which provides great flexibility and facility to the network service provider for service class management. As a WLAN has small coverage and cannot meet the growing demand for wireless service requiring communications ``at anywhere and at anytime", a large scale multi-hop wireless network (e.g., wireless ad hoc networks and wireless mesh networks) becomes a necessity. Due to the location-dependent contentions, a number of problems (e.g., hidden/exposed terminal problem, unfairness, and priority reversal problem) appear in a multi-hop wireless environment, posing more challenges for QoS provisioning. To address these challenges, we propose a novel busy-tone based distributed MAC scheme for wireless ad hoc networks, and a collision-free MAC scheme for wireless mesh networks, respectively, taking the different network characteristics into consideration. The proposed schemes enhance the QoS provisioning capability to real-time traffic and, at the same time, significantly improve the system throughput and fairness performance for data traffic, as compared with the most popular IEEE 802.11 MAC scheme.

Wireless mesh networking has emerged as a promising technology for future broadband wireless access, providing a viable and economical solution for both peer-to-peer applications and Internet access. The success of wireless mesh networks (WMNs) is highly contingent on effective radio resource management. In conventional wireless networks, system throughput is usually a common performance metric. However, next-generation broadband wireless access networks including WMNs are anticipated to support multimedia traffic (e.g., voice, video, and data traffic). With heterogeneous traffic, quality-of-service (QoS) provisioning and fairness support are also imperative. Recently, wireless mesh networking for suburban/rural residential areas has been attracting a plethora of attentions from industry and academia. With austere suburban and rural networking environments, multi-hop communications with decentralized resource allocation are preferred. In WMNs without powerful centralized control, simple yet effective resource allocation approaches are desired for the sake of system performance melioration. In this dissertation, we conduct a comprehensive research study on the topic of radio resource management for WMNs supporting multimedia traffic. In specific, this dissertation is intended to shed light on how to effectively and efficiently manage a WMN for suburban/rural residential areas, provide users with high-speed wireless access, support the QoS of multimedia applications, and improve spectrum utilization by means of novel radio resource allocation. As such, five important resource allocation problems for WMNs are addressed, and our research accomplishments are briefly outlined as follows: Firstly, we propose a novel node clustering algorithm with effective subcarrier allocation for WMNs. The proposed node clustering algorithm is QoS-aware, and the subcarrier allocation is optimality-driven and can be performed in a decentralized manner. Simulation results show that, compared to a conventional conflict-graph approach, our proposed approach effectively fosters frequency reuse, thereby improving system performance; Secondly, we propose three approaches for joint power-frequency-time resource allocation. Simulation results show that all of the proposed approaches are effective in provisioning packet-level QoS over their conventional resource allocation counterparts. Our proposed approaches are of low complexity, leading to preferred candidates for practical implementation; Thirdly, to further enhance system performance, we propose two low-complexity node cooperative resource allocation approaches for WMNs with partner selection/allocation. Simulation results show that, with beneficial node cooperation, both proposed approaches are promising in supporting QoS and elevating system throughput over their non-cooperative counterparts; Fourthly, to further utilize the temporarily available radio spectrum, we propose a simple channel sensing order for unlicensed secondary users. By sensing the channels according to the descending order of their achievable rates, we prove that a secondary user should stop at the first sensed free channel for the sake of optimality; and Lastly, we derive a unified optimization framework to effectively attain different degrees of performance tradeoff between throughput and fairness with QoS support. By introducing a bargaining floor, the optimal tradeoff curve between system throughput and fairness can be obtained by solving the proposed optimization problem iteratively.

By equipping vehicles with the on-board wireless facility, the newly emerged vehicular networking targets to provision the broadband serves to vehicles. As such, a variety of novel and exciting applications can be provided to vehicular users to enhance their road safety and travel comfort, and finally raise a complete change to their on-road life. As the content distribution and media/video streaming, such as Youtube, Netflix, nowadays have become the most popular Internet applications, to enable the efficient content distribution and audio/video streaming services is thus of the paramount importance to the success of the vehicular networking. This, however, is fraught with fundamental challenges due to the distinguished natures of vehicular networking. On one hand, the vehicular communication is challenged by the spotty and volatile wireless connections caused by the high mobility of vehicles. This makes the download performance of connections very unstable and dramatically change over time, which directly threats to the on-top media applications. On the other hand, a vehicular network typically involves an extremely large-scale node population (e.g., hundreds or thousandths of vehicles in a region) with intense spatial and temporal variations across the network geometry at different times. This dictates any designs to be scalable and fully distributed which should not only be resilient to the network dynamics, but also provide the guaranteed quality-of-service (QoS) to users. The purpose of this dissertation is to address the challenges of the vehicular networking imposed by its intrinsic dynamic and large-scale natures, and build the efficient, scalable and, more importantly, practical systems to enable the cost-effective and QoS guaranteed content distribution and media streaming services to vehicular users. Note that to effective- ly deliver the content from the remote Internet to in-motion vehicles, it typically involves three parts as: 1.) an infrastructure grid of gateways which behave as the data depots or injection points of Internet contents and services to vehicles, 2.) protocol at gateways which schedules the bandwidth resource at gateways and coordinates the parallel transmissions to different vehicles, and 3.) the end-system control mechanism at receivers which adapts the receiver’s content download/playback strategy based on the available network throughput to provide users with the desired service experience. With above three parts in mind, the entire research work in this dissertation casts a systematic view to address each part in one topic with: 1.) design of large-scale cost-effective content distribution infrastructure, 2.) MAC (media access control) performance evaluation and channel time scheduling, and 3.) receiver adaptation and adaptive playout in dynamic download environment. In specific, in the first topic, we propose a practical solution to form a large-scale and cost-effective content distribution infrastructure in the city. We argue that a large-scale infrastructure with the dedicated resources, including storage, computing and communication capacity, is necessary for the vehicular network to become an alternative of 3G/4G cellular network as the dominating approach of ubiquitous content distribution and data services to vehicles. On addressing this issue, we propose a fully distributed scheme to form a large-scale infrastructure by the contributions of individual entities in the city, such as grocery stores, movie theaters, etc. That is to say, the installation and maintenance costs are shared by many individuals. In this topic, we explain the design rationale on how to motivate individuals to contribute, and specify the detailed design of the system, which is embodied with distributed protocols and performance evaluation. The second topic investigates on the MAC throughput performance of the vehicle-to- infrastructure (V2I) communications when vehicles drive through RSUs, namely drive-thru Internet. Note that with a large-scale population of fast-motion nodes contending the chan- nel for transmissions, the MAC performance determines the achievable nodal throughput and is crucial to the on-top applications. In this topic, using a simple yet accurate Marko- vian model, we first show the impacts of mobility (characterized by node velocity and moving directions) on the nodal and system throughput performance, respectively. Based on this analysis, we then propose three enhancement schemes to timely adjust the MAC parameters in tune with the vehicle mobility to achieve the maximal the system throughput. The last topic investigates on the end-system design to deliver the user desired media streaming services in the vehicular environment. In specific, the vehicular communications are notoriously known for the intermittent connectivity and dramatically varying throughput. Video streaming on top of vehicular networks therefore inevitably suffers from the severe network dynamics, resulting in the frequent jerkiness or even freezing video playback. To address this issue, an analytical model is first developed to unveil the impacts of network dynamics on the resultant video performance to users in terms of video start-up delay and smoothness of playback. Based on the analysis, the adaptive playout buffer mechanism is developed to adapt the video playback strategy at receivers towards the user-defined video quality. The proposals developed in the three topics are validated with the extensive and high fidelity simulations. We believe that our analysis developed in the dissertation can provide insightful lights on understanding the fundamental performance of the vehicular content distribution networks from the aspects of session-level download performance in urban vehicular networks (topic 1), MAC throughput performance (topic 2), and user perceived media quality (topic 3). The protocols developed in the three topics, respectively, offer practical and efficient solutions to build and optimize the vehicular content distribution networks.

Content distribution is the primary function of the Internet today. Technologies like multicast and peer-to-peer networks hold the potential to serve content to large populations in a scalable manner. While multicast provides an efficient transport mechanism for one-to-many and many-to-many delivery of data in an Internet environment, the peer-to-peer networks allow scalable content location and retrieval among large groups of users in the Internet. Incorporating quality-consciousness in these technologies is necessary to enhance the overall experience of clients. This dissertation focuses on the architectures and mechanisms to enhance multicast and peer-to-peer content distribution through quality-consciousness. In particular, the following aspects of quality-consciousness are addressed: 1) client latency, 2) service differentiation, and 3) content quality. Data analysis shows that the existing multicast scheduling algorithms behave unfairly when the access conditions for the popular files changes. They favor the popular files while penalizing the files whose access conditions have not changed. To maintain the client latency for all files under dynamic access conditions we develop a novel multicast scheduling algorithm that requires no change in server provisioning. Service differentiation is a desirable functionality for both multicast and peer-to-peer networks. For multicast, we design a scalable and low overhead service differentiation architecture. For peer-to-peer networks, we focus on a protocol to provide different levels of service to peers based on their contributions in the system. The ability to associate reliable reputations with peers in a peer-to-peer network is a useful feature of these networks. Reliable reputations can help establish trust in these networks and hence improve content quality. They can also be used as a substrate for a service differentiation scheme for these networks. This dissertation develops two methods of tracking peer reputations with varying degrees of reliability and overheads.

Channel access fairness and efficiency in capacity utilization are the two main objectives for Quality of Service (QoS) specific to Medium Access Control (MAC) protocols in computer networks. For bursty and unpredictable traffic in networks, fairness and efficiency involve a mutual tradeoff with the currently popular QoS mechanisms. We propose a QoS MAC framework for carrier sensing multiple access (CSMA) networks, that achieves fairness with improved efficiency through extensive state-keeping based on the MAC evolution. This CSMA with Implicit Scheduling through State-keeping (CSMA/ISS) framework involves the tracking of traffic arrival at active nodes, the nodes that need channel access frequently. It also involves implicit channel access grants to different active nodes according to their estimated queue backlogs and the fair scheduling requirements. These methods save channel capacity that may otherwise be required for disseminating the access requirements of various nodes, and their access rights according to fairness rules. A static, hierarchical, and weighted fair access scheme is designed in CSMA/ISS by allowing repeated rounds of access that are weighted fairly according to requirements. Weighted fairness across classes is achieved by invoking channel access for each traffic class in a round as many times as its weight. Within each class, all active nodes are allowed equal access through in-order channel access based on a looped list of active nodes. Although CSMA/ISS is proposed as a distributed control framework for efficiency, it may also be employed in central control protocols. It may also be adapted to different types of CSMA networks, both wireless and wired, by an appropriate choice of the underlying classical access mechanism. The CSMA/ISS framework was modeled and simulated as a QoS capable MAC protocol for a wired fully connected local network environment. We present the CSMA/ISS framework, the example implementation, and the results of performance evaluation of the example implementation. Significant performance improvements were observed, and the memory and processing trade-off was found to be low to moderate.

none

Data intensive applications, requiring reliability and strict delay constraints, have emerged recently and they necessitate a different approach to analyzing system performance. In my work, I establish a framework that relates physical channel parameters to the queueing performance for a single-user wireless system. I then seek to assess the potential benefits of multirate techniques, such as hybrid-ARQ (Automatic Repeat reQuest), in the context of delay-sensitive communications. Present methods of analysis in an information theoretic paradigm define capacity assuming that long codewords can be used to take advantage of the ergodic properties of the fading wireless channel. This definition provides only a limited characterization of the channel in the light of delay constraints. The assumption of independent and identically distributed channel realizations tends to over-estimate the system performance by not considering the inherent time correlation. A finite-state continuous time Markov channel model that I formulate enables me to partition the instantaneous data-rate received at the destination into a finite number of states, representing layers in a hybrid-ARQ scheme. The correlation of channel has been incorporated through level crossing rates as transition rates in the Markov model. The large deviation principle governing the buffer overflow of the Markov model, is very sensitive to channel memory, is tractable, and gives a good estimate of the system performance. Metrics such as effective capacity and probability of buffer overflow, that are obtained through large deviations have been related to the wireless physical layer parameters through the model. Using the above metrics under QoS constraints, I establish the quantitative performance advantage of using hybrid-ARQ over traditional systems. I conduct this inquiry by restricting attention to the case where the expected transmit power is fixed at the transmitter. The results show that hybrid-ARQ helps us in obtaining higher effective capacity, but it is very difficult to support delay sensitive communication over wireless channel in the absence of channel knowledge and dynamic power allocation strategies.

In this dissertation, we studied methods for improving efficiency and effectiveness of multipath routing in computer networks. We showed that multipath routing can improve network performance for failure recovery, load balancing, Quality of Service (QoS), and energy consumption. We presented a method for reducing the overhead of computing dynamic path metrics, one of the obstacles for implementing dynamic multipath routing in real world networks. In the first part, we proposed a method for building disjoint multipaths that could be used for local failure recovery as well as for multipath routing. Proactive failure recovery schemes have been recently proposed for continuous service of delay-sensitive applications during failure transients at the cost of extra infrastructural support in the form of routing table entries, extra addresses, etc. These extra infrastructure supports could be exploited to build alternative disjoint paths in those frameworks, while keeping the lengths of the alternative paths close to those of the primary paths. The evaluations showed that it was possible to extend the proactive failure recovery schemes to provide support for nearly-disjoint paths which could be employed in multipath routing for load balancing and QoS. In the second part, we proposed a method for reducing overhead of measuring dynamic link state information for multipath routing, specifically path delays used in Wardrop routing. Even when dynamic routing could be shown to offer convergence properties without oscillations, it has not been widely adopted. One of reasons was that the expected cost of keeping the link metrics updated at various nodes in the network. We proposed threshold-based updates to propagate the link state only when the currently measured link state differs from the last updated state consider- ably. Threshold-based updates were shown through analysis and simulations to offer bounded guarantees on path quality while significantly reducing the cost of propagating the dynamic link metric information. The simulation studies indicated that threshold based updates can reduce the number of link updates by up to 90-95% in some cases. In the third part, we proposed methods of using multipath routing for reducing energy consumption in computer networks. Two different approaches have been advocated earlier, from traffic engineering and topology control to hardware-based approaches. We proposed solutions at two different time scales. On a finer time granularity, we employed a method of forwarding through alternate paths to enable longer sleep schedules of links. The proposed schemes achieved more energy saving by increasing the usage of active links and the down time of sleeping links as well as avoiding too frequent link state changes. To the best of our knowledge, this was the first technique combining a routing scheme with hardware scheme to save energy consumption in networks. In our evaluation, alternative forwarding reduced energy consumption by 10% on top of a hardware-based sleeping scheme. On a longer time granularity, we proposed a technique that combined multipath routing with topology control. The proposed scheme achieved increased energy savings by maximizing the link utilization on a reduced topology where the number of active nodes and links are minimized. The proposed technique reduced energy consumption by an additional 17% over previous schemes with single/shortest path routing.

We propose an object-based multimedia model for specifying the QoS (quality of service) requirements, such as the maximum data-dropping rate or the maximum data-delay rate. We also present a resource allocation model, called the net-profit model, in which the satisfaction of user¡¦s QoS requirements is measured by the benefit earned by the system. Based on the net-profit model, the system is rewarded if it can allocate enough resources to a multimedia delivery request and fulfill the QoS requirements specified by the user. At the same time, the system is penalized if it cannot allocate enough resources to a multimedia delivery request. In this dissertation, we present our research in developing optimal solutions for multimedia stream delivery in bandwidth limited networks. To fulfill the QoS requirements, the resource, such as bandwidth, should be reserved in advance. Hence, we first investigate how to allocate a resource such that the QoS satisfaction is maximized, assuming that the QoS requirements are given a priori. The proposed optimal solution has significant improvement over the based line algorithm, EDF (Earliest Deadline First). Among all the optimal solutions found from the above problem, the net-profit may be distributed unevenly among the multimedia delivery requests. Furthermore, we tackle the fairness problem -- how to allocate a resource efficiently so that the difference of the net-profit between two requests is minimized over all the possible optimal solutions of the maximum total net-profit. A dynamic programming based algorithm is proposed to find all the possible optimal solutions and, in addition, three filters are conducted to improve the efficiency of the proposed algorithm. The experimental results show that the filters prune out unnecessary searches and improve the performance significantly, especially when the number of tasks increases. For some multimedia objects, they might need to be delivered in whole, indivisible, so we extend the proposed multimedia object-based model to indivisible objects. A dynamic programming based algorithm is presented to find an optimal solution of the delivery problem, where the total net-profit is maximized.

Because there has been a rapid development in wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. In this paper we propose a new bandwidth reservation scheme based on the characteristic of the cell equipped with sector antenna and 2-tier cell structure. According to this information, the proposed scheme can predict the next location of each connection and precisely reserve bandwidth in appropriate neighboring cells, not all of its neighboring cells. In addition, the proposed scheme incorporates bandwidth borrowing mechanism into call admission control strategy. The combination of bandwidth reservation and bandwidth borrowing provides network users with QoS in terms of guaranteed bandwidth, call blocking and call dropping probabilities.