Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation

This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput of each flow. However, the corresponding scheduling solution (when assuming dynamic arrivals instead and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, we propose the first opportunistic INC + scheduling solution that is provably optimal for time-varying channels, i.e., the corresponding stability region matches the optimal Shannon capacity. Specifically, we first introduce a new binary INC operation, which is distinctly different from the traditional wisdom of XORing two overheard packets. We then develop a queue-length-based scheduling scheme, which, with the help of the new INC operation, can robustly and optimally adapt to time-varying channel quality. We then show that the proposed algorithm can be easily extended for rate adaptation and it again robustly achieves the optimal throughput. A byproduct of our results is a scheduling scheme for stochastic processing networks (SPNs) with random departure, which relaxes the assumption of deterministic departure in the existing results. The new SPN scheduler could thus further broaden the applications of SPN scheduling to other real-world scenarios

Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes

Many opportunistic scheduling techniques are impractical because they require accurate channel state information (CSI) at the transmitter. In this paper, we investigate the scheduling of unicast and multicast services in a downlink network with a very limited amount of feedback information. Specifically, unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs) to a base station, and multicast users only report infrequent ACKs to avoid feedback implosion. We consider the use of physical-layer rateless codes, which not only combats channel uncertainty, but also reduces the overhead of ACK feedback. A joint scheduling and power allocation scheme is developed to realize multiuser diversity gain for unicast service and multicast gain for multicast service. We prove that our scheme achieves a near-optimal throughput region. Our simulation results show that our scheme significantly improves the network throughput over schemes employing fixed-rate codes or using only unicast communications

Local network coding on packet erasure channels -- From Shannon capacity to stability region

Network Coding (NC) has emerged as a ubiquitous technique of communication networks and has extensive applications in both practical implementations and theoretical developments. While the Avalanche P2P file system from Microsoft, the MORE routing protocol, and the COPE coding architecture from MIT have implemented the idea of NC and exhibited promising performance improvements, a significant part of the success of NC stems from the continuing theoretic development of NC capacity, e.g., the Shannon capacity results for the single-flow multi-cast network and the packet erasure broadcast channel with feedback. However, characterizing the capacity for the practical wireless multi-flow network setting remains a challenging topic in NC. For example, the difficulties of finding the optimal NC strategy over multiple flows under varying-channel qualities and the rate adaption scenarios hinder any further advancement in this area. Despite the difficulty of characterizing the full capacity for large networks, there are evidences showing that even when using only local operations, NC can still recover substantial NC gain. We believe that a deeper understanding of multi-flow local network coding will play a key role in designing the next-generation high-throughput coding-based wireless network architecture. This thesis consists of three parts. In the first part, we characterize the full Shannon capacity region of the COPE principle when applied to a 2-flow wireless butterfly network with broadcast packet erasure channels. The capacity results allow for random overhearing probabilities, arbitrary scheduling policies, network-wide channel state information (CSI) feedback after each transmission, and potential use of non-linear network codes. We propose a theoretical outer bound and a new class of linear network codes, named the Space-Based Linear Network Coding (SBLNC), that achieves the capacity outer bound. Numerical experiments show that SBLNC provides close-to-optimal throughput even in the scenario with opportunistic routing. In the second part, we further consider the complete network dynamics of stochastic arrivals and queueing and study the corresponding stability region. Based on dynamic packet arrivals, the resulting solution would be one step closer to practical implementation, when compared to the previous block-code-based capacity study. For the 2-flow downlink scenario, we propose the first opportunistic INC + scheduling solution that is provably optimal for time-varying channels, i.e., the corresponding stability region matches the optimal Shannon capacity. Specifically, we first introduce a new binary INC operation, which is distinctly different from the traditional wisdom of XORing two overheard packets. We then develop a queue-length-based scheduling scheme, which, with the help of the new INC operation, can robustly and optimally adapt to time-varying channel quality. We then show that the proposed algorithm can be easily extended for rate adaptation and it again robustly achieves the optimal throughput. In the third part, we propose an 802.11-based MAC layer protocol which incorporates the rate adaption solution developed in the second part. The new MAC protocol realizes the promised intersession network coding gain for two-flow downlink traffic with short decoding delay. Furthermore, we delicately retain the CSMA-CA distributed contention mechanism with only 17 bits new header field changes, and carefully ensure the backward compatibility. In summary, the new solution demonstrates concrete throughput improvement without alternating the too much packet-by-packet traffic behavior. Such a feature is critical in practical implementation since it allows the network coding solution to be transparent to any arbitrary upper layer applications

Cross-layer design and optimization of medium access control protocols for wlans

This thesis provides a contribution to the field of Medium Access Control (MAC) layer protocol design for wireless networks by proposing and evaluating mechanisms that enhance different aspects of the network performance. These enhancements are achieved through the exchange of information between different layers of the traditional protocol stack, a concept known as Cross-Layer (CL) design. The main thesis contributions are divided into two parts. The first part of the thesis introduces a novel MAC layer protocol named Distributed Queuing Collision Avoidance (DQCA). DQCA behaves as a reservation scheme that ensures collision-free data transmissions at the majority of the time and switches automatically to an Aloha-like random access mechanism when the traffic load is low. DQCA can be enriched by more advanced scheduling algorithms based on a CL dialogue between the MAC and other protocol layers, to provide higher throughput and Quality of Service (QoS) guarantees. The second part of the thesis explores a different challenge in MAC layer design, related to the ability of multiple antenna systems to offer point-to-multipoint communications. Some modifications to the recently approved IEEE 802.11n standard are proposed in order to handle simultaneous multiuser downlink transmissions. A number of multiuser MAC schemes that handle channel access and scheduling issues and provide mechanisms for feedback acquisition have been presented and evaluated. The obtained performance enhancements have been demonstrated with the help of both theoretical analysis and simulation obtained results

Contention techniques for opportunistic communication in wireless mesh networks

Auf dem Gebiet der drahtlosen Kommunikation und insbesondere auf den tieferen Netzwerkschichten sind gewaltige Fortschritte zu verzeichnen. Innovative Konzepte und Technologien auf der physikalischen Schicht (PHY) gehen dabei zeitnah in zelluläre Netze ein. Drahtlose Maschennetzwerke (WMNs) können mit diesem Innovationstempo nicht mithalten. Die Mehrnutzer-Kommunikation ist ein Grundpfeiler vieler angewandter PHY Technologien, die sich in WMNs nur ungenügend auf die etablierte Schichtenarchitektur abbilden lässt. Insbesondere ist das Problem des Scheduling in WMNs inhärent komplex. Erstaunlicherweise ist der Mehrfachzugriff mit Trägerprüfung (CSMA) in WMNs asymptotisch optimal obwohl das Verfahren eine geringe Durchführungskomplexität aufweist. Daher stellt sich die Frage, in welcher Weise das dem CSMA zugrunde liegende Konzept des konkurrierenden Wettbewerbs (engl. Contention) für die Integration innovativer PHY Technologien verwendet werden kann. Opportunistische Kommunikation ist eine Technik, die die inhärenten Besonderheiten des drahtlosen Kanals ausnutzt. In der vorliegenden Dissertation werden CSMA-basierte Protokolle für die opportunistische Kommunikation in WMNs entwickelt und evaluiert. Es werden dabei opportunistisches Routing (OR) im zustandslosen Kanal und opportunistisches Scheduling (OS) im zustandsbehafteten Kanal betrachtet. Ziel ist es, den Durchsatz von elastischen Paketflüssen gerecht zu maximieren. Es werden Modelle für Überlastkontrolle, Routing und konkurrenzbasierte opportunistische Kommunikation vorgestellt. Am Beispiel von IEEE 802.11 wird illustriert, wie der schichtübergreifende Entwurf in einem Netzwerksimulator prototypisch implementiert werden kann. Auf Grundlage der Evaluationsresultate kann der Schluss gezogen werden, dass die opportunistische Kommunikation konkurrenzbasiert realisierbar ist. Darüber hinaus steigern die vorgestellten Protokolle den Durchsatz im Vergleich zu etablierten Lösungen wie etwa DCF, DSR, ExOR, RBAR und ETT.In the field of wireless communication, a tremendous progress can be observed especially at the lower layers. Innovative physical layer (PHY) concepts and technologies can be rapidly assimilated in cellular networks. Wireless mesh networks (WMNs), on the other hand, cannot keep up with the speed of innovation at the PHY due to their flat and decentralized architecture. Many innovative PHY technologies rely on multi-user communication, so that the established abstraction of the network stack does not work well for WMNs. The scheduling problem in WMNs is inherent complex. Surprisingly, carrier sense multiple access (CSMA) in WMNs is asymptotically utility-optimal even though it has a low computational complexity and does not involve message exchange. Hence, the question arises whether CSMA and the underlying concept of contention allows for the assimilation of advanced PHY technologies into WMNs. In this thesis, we design and evaluate contention protocols based on CSMA for opportunistic communication in WMNs. Opportunistic communication is a technique that relies on multi-user diversity in order to exploit the inherent characteristics of the wireless channel. In particular, we consider opportunistic routing (OR) and opportunistic scheduling (OS) in memoryless and slow fading channels, respectively. We present models for congestion control, routing and contention-based opportunistic communication in WMNs in order to maximize both throughput and fairness of elastic unicast traffic flows. At the instance of IEEE 802.11, we illustrate how the cross-layer algorithms can be implemented within a network simulator prototype. Our evaluation results lead to the conclusion that contention-based opportunistic communication is feasible. Furthermore, the proposed protocols increase both throughput and fairness in comparison to state-of-the-art approaches like DCF, DSR, ExOR, RBAR and ETT

Adaptive radio resource management schemes for the downlink of the OFDMA-based wireless communication systems

Includes bibliographical references.Due to its superior characteristics that make it suitable for high speed mobile wireless systems OFDMA has been adopted by next generation broadband wireless standards including Worldwide Interoperability for Microwave Access (WiMAX) and Long Term Evolution – Advanced (LTE-A). Intelligent and adaptive Radio Resource Management (RRM) schemes are a fundamental tool in the design of wireless systems to be able to fully and efficiently utilize the available scarce resources and be able to meet the user data rates and QoS requirements. Previous works were only concerned with maximizing system efficiency and thus used opportunistic algorithms that allocate resources to users with the best opportunities to optimize system capacity. Thus, only those users with good channel conditions were considered for resource allocation and users in bad channel conditions were left out to starve of resources. The main objective of our study is to design adaptive radio resource allocation (RRA) algorithms that distribute the scarce resources more fairly among network users while efficiently using the resources to maximize system throughput. Four scheduling algorithms have been formulated and analysed based on fairness, throughputs and delay. This was done for users demanding different services and QoS requirements. Two of the scheduling algorithms, Maximum Sum Rate (MSR) and Round Robin (RR) are used respectively, as references to analyze throughput and fairness among network users. The other two algorithms are Proportional Fair Scheduling (PFS) and Margin Adaptive Scheduling Scheme (MASS)

WIMAX Basics from PHY Layer to Scheduling and Multicasting Approaches

WiMAX (Worldwide Interoperability for Microwave Access) is an emerging broadband wireless technology for providing Last mile solutions for supporting higher bandwidth and multiple service classes with various quality of service requirement. The unique architecture of the WiMAX MAC and PHY layers that uses OFDMA to allocate multiple channels with different modulation schema and multiple time slots for each channel allows better adaptation of heterogeneous user’s requirements. The main architecture in WiMAX uses PMP (Point to Multipoint), Mesh mode or the new MMR (Mobile Multi hop Mode) deployments where scheduling and multicasting have different approaches. In PMP SS (Subscriber Station) connects directly to BS (Base Station) in a single hop route so channel conditions adaptations and supporting QoS for classes of services is the key points in scheduling, admission control or multicasting, while in Mesh networks SS connects to other SS Stations or to the BS in a multi hop routes, the MMR mode extends the PMP mode in which the SS connects to either a relay station (RS) or to Bs. Both MMR and Mesh uses centralized or distributed scheduling with multicasting schemas based on scheduling trees for routing. In this paper a broad study is conducted About WiMAX technology PMP and Mesh deployments from main physical layers features with differentiation of MAC layer features to scheduling and multicasting approaches in both modes of operations

Information Technology

The new millennium has been labeled as the century of the personal communications revolution or more specifically, the digital wireless communications revolution. The introduction of new multimedia services has created higher loads on available radio resources. These services can be presented in different levels of quality of service. Namely, the task of the radio resource manager is to provide these levels. Radio resources are scarce and need to be shared by many users. The sharing has to be carried out in an efficient way avoiding as much as possible any waste of resources. The main contribution focus of this work is on radio resource management in opportunistic systems. In opportunistic communications dynamic rate and power allocation may be performed over the dimensions of time, frequency and space in a wireless system. In this work a number of these allocation schemes are proposed. A downlink scheduler is introduced in this work that controls the activity of the users. The scheduler is a simple integral controller that controls the activity of users, increasing or decreasing it depending on the degree of proximity to a requested quality of service level. The scheduler is designed to be a best effort scheduler; that is, in the event the requested quality of service (QoS) cannot be attained, users are always guaranteed the basic QoS level provided by a proportional fair scheduler. In a proportional fair scheduler, the user with the best rate quality factor is selected. The rate quality here is the instantaneous achievable rate divided by the average throughput Uplink scheduling is more challenging than its downlink counterpart due to signalling restrictions and additional constraints on resource allocations. For instance, in long term evolution systems, single carrier FDMA is to be utilized which requires the frequency domain resource allocation to be done in such a way that a user could only be allocated subsequent bands. We suggest for the uplink a scheduler that follows a heuristic approach in its decision. The scheduler is mainly based on the gradient algorithm that maximizes the gradient of a certain utility. The utility could be a function of any QoS. In addition, an optimal uplink scheduler for the same system is presented. This optimal scheduler is valid in theory only, nevertheless, it provides a considerable benchmark for evaluation of performance for the heuristic scheduler as well as other algorithms of the same system. A study is also made for the feedback information in a multi-carrier system. In a multi-carrier system, reporting the channel state information (CSI) of every subcarrier will result in huge overhead and consequent waste in bandwidth. In this work the subcarriers are grouped into subbands which are in turn grouped into blocks and a study is made to find the minimum amount of information for the adaptive modulation and coding (AMC) of the blocks. The thesis also deals with admission control and proposes an opportunistic admission controller. The controller gradually integrates a new user requesting admission into the system. The system is probed to examine the effect of the new user on existing connections. The user is finally fully admitted if by the end of the probing, the quality of service (QoS) of existing connections did not drop below a certain threshold. It is imperative to mention that the research work of this thesis is mainly focused on non-real time applications.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format