Learning-Based Constraint Satisfaction With Sensing Restrictions

In this paper we consider graph-coloring problems, an important subset of general constraint satisfaction problems that arise in wireless resource allocation. We constructively establish the existence of fully decentralized learning-based algorithms that are able to find a proper coloring even in the presence of strong sensing restrictions, in particular sensing asymmetry of the type encountered when hidden terminals are present. Our main analytic contribution is to establish sufficient conditions on the sensing behaviour to ensure that the solvers find satisfying assignments with probability one. These conditions take the form of connectivity requirements on the induced sensing graph. These requirements are mild, and we demonstrate that they are commonly satisfied in wireless allocation tasks. We argue that our results are of considerable practical importance in view of the prevalence of both communication and sensing restrictions in wireless resource allocation problems. The class of algorithms analysed here requires no message-passing whatsoever between wireless devices, and we show that they continue to perform well even when devices are only able to carry out constrained sensing of the surrounding radio environment

Future Evolution of CSMA Protocols for the IEEE 802.11 Standard

In this paper a candidate protocol to replace the prevalent CSMA/CA medium access control in Wireless Local Area Networks is presented. The proposed protocol can achieve higher throughput than CSMA/CA, while maintaining fairness, and without additional implementation complexity. Under certain circumstances, it is able to reach and maintain collision-free operation, even when the number of contenders is variable and potentially large. It is backward compatible, allowing for new and legacy stations to coexist without degrading one another's performance, a property that can make the adoption process by future versions of the standard smooth and inexpensive.Comment: This paper has been accepted in the Second IEEE ICC Workshop 2013 on Telecommunication Standards: From Research to Standard

Enabling Techniques Design for QoS Provision in Wireless Communications

Guaranteeing Quality of Service (QoS) has become a recognized feature in the design of wireless communications. In this thesis, the problem of QoS provision is addressed from different prospectives in several modern communication systems. In the first part of the thesis, a wireless communication system with the base station (BS) associated by multiple subscribers (SS) is considered, where different subscribers require different QoS. Using the cross-layer approach, the conventional single queue finite state Markov chain system model is extended to multiple queues\u27 scenario by combining the MAC layer queue status with the physical layer channel states, modeled by finite state Markov channel (FSMC). To provide the diverse QoS to different subscribers, a priority-based rate allocation (PRA) algorithm is proposed to allocate the physical layer transmission rate to the multiple medium access control (MAC) layer queues, where different queues are assigned with different priorities, leading to their different QoS performance and thus, the diverse QoS are guaranteed. Then, the subcarrier allocation in multi-user OFDM (MU-OFDM) systems is stuied, constrained by the MAC layer diverse QoS requirements. A two-step cross-layer dynamic subcarrier allocation algorithm is proposed where the MAC layer queue status is firstly modeled by a finite state Markov chain, using which MAC layer diverse QoS constraints are transformed to the corresponding minimum physical layer data rate of each user. Then, with the purpose of maximizing the system capacity, the physical layer OFDM subcarriers are allocated to the multiple users to satisfy their minimum data rate requirements, which is derived by the MAC layer queue status model. Finally, the problem of channel assignment in IEEE 802.11 wireless local area networks (WLAN) is investigated, oriented by users\u27 QoS requirements. The number of users in the IEEE 802.11 channels is first determined through the number of different channel impulse responses (CIR) estimated at physical layer. This information is involved thereafter in the proposed channel assignment algorithm, which aims at maximum system throughput, where we explore the partially overlapped IEEE 802.11 channels to provide additional frequency resources. Moreover, the users\u27 QoS requirements are set to trigger the channel assignment process, such that the system can constantly maintain the required QoS

Analysis and Optimization of Dynamic Spectrum Sharing for Cognitive Radio Networks

The goal of this dissertation is to present the analysis and optimization of dynamic spectrum sharing for cognitive radio networks (CRNs). Spectrum scarcity is a well known problem at present. In order to deal with this problem, dynamic spectrum sharing (DSS) was proposed. DSS is a technique where cognitive radio networks dynamically and opportunistically share the channels with primary users. The major contribution of this dissertation is in analyzing the problem of dynamic spectrum sharing under different scenarios and developing optimal solutions for these scenarios. In the first scenario, a contention based dynamic spectrum sharing model is considered and its throughput analysis is presented. One of the applications of this throughput analysis is in finding the optimal number of secondary users in such a scenario. The problem is studied for fixed and random allocation of channels to primary users while secondary users try to opportunistically use these channels. Primary users contend for the channels, and secondary users try to use the channels only when primary users are not using it. These secondary users themselves contend for the opportunistic usage. The numerical formulas developed for finding the optimal number of secondary users have been carefully analyzed with the solutions obtained using the throughput model directly and finding the optimal number of secondary users. These two match very closely with each other and hence provide simple numerical formulas to calculate the optimal number. The second scenario studied is based upon the idea of pre-knowledge of primary user activity. For instance, the active broadcasting periods of TV channels can be obtained from past measurements as the TV channels activities are approximately fixed. In this scenario, time spectrum block (TSB) allocation for DSS is studied. Optimal TSB allocation is considered to minimize the total interference of the system and hence maximize the overall throughput of the system of community networks. The results obtained using the proposed ABCD algorithm follow very closely with the optimal results. Thus the simple algorithm developed can be used for time spectrum block allocation in practical scenarios

Priority-Oriented Adaptive Control With QoS Guarantee for Wireless LANs.

In today’s wireless networks there is a great need for QoS, because of the time-bounded voice, audio and video traffic. A new QoS enhanced standard is being standardized by the IEEE 802.11e workgroup. It uses a contention free access mechanism called Hybrid Control Channel Access (HCCA) to guarantee QoS. However, HCCA is not efficient for all types of time-bounded traffic. This work proposes an alternative protocol which could be adapted in HCF (Hybrid Coordination Function). The Priority Oriented Adaptive Control with QoS Guarantee (POAC-QG) is a complete centralized channel access mechanism, it is able to guarantee QoS for all types of multimedia network applications, it enhances the parameterized traffic with priorities, and it supports time division access using slots. Furthermore, it instantly negotiates the quality levels of the traffic streams according to their priorities, supporting multiple streams to the best quality it can achieve. POAC-QG compared to HCCA, provides higher channel utilization, adapts better to the characteristics of the different traffic types, differentiates the traffic streams more efficiently using priorities, and generally exhibits superior performance

Multimedia delivery in the future internet

The term “Networked Media” implies that all kinds of media including text, image, 3D graphics, audio and video are produced, distributed, shared, managed and consumed on-line through various networks, like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked challenges of the Networked Media in the transition to the Future of the Internet. Internet has evolved and changed the way we work and live. End users of the Internet have been confronted with a bewildering range of media, services and applications and of technological innovations concerning media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged that in a near- to mid-term future, the Internet will provide the means to share and distribute (new) multimedia content and services with superior quality and striking flexibility, in a trusted and personalized way, improving citizens’ quality of life, working conditions, edutainment and safety. In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and innovative applications “on the move”, like virtual collaboration environments, personalised services/ media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to contribute towards such a vision. Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6) and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way ahead in the area of Content Aware media delivery platforms

Multicast Mobility in Mobile IP Version 6 (MIPv6) : Problem Statement and Brief Survey

Publisher PD

Design and evaluation of coexistence mechanisms for Bluetooth and IEEE 802.11b systems

Short-range wireless technologies are becoming increasingly important in enabling useful mobile applications. Bluetooth and IEEE 802.11b standards are the most commonly deployed technologies for WPAN and WLAN. However, because both standards share the same unlicensed ISM (Industrial, Scientific, Medical) radio spectrum, severe interference is inevitable and performance can be impaired significantly when heterogeneous devices using the two technologies come into close proximity. The most notable solution to this problem is a frequency domain noncollaborative coexistence mechanism called adaptive frequency hopping (AFH). However, we find that the efficiency of the 'channel classification' sub-process in noncollaborative mechanisms is by and large ignored in the literature. Moreover, we also find that there is no system resources awareness and no interference source genre concerns in IEEE 802.15 Task Group 2 AFH (TG2 AFH) design. Thus, we suggest a new approach called ISOAFH (Interference Source Oriented AFH). With the above considerations, we propose a customized channel classification process, thereby simplifying the time and space complexity of the mechanism. Through our detailed implementation of various coexistence mechanisms in MATLAB Simulink, it is observed that TG2 AFH performance is sensitive to memory and power limitations, while ISOAFH is much less sensitive to these constraints and can keep a much lower channel collision rate. On the other hand, We also study some open issues of a time domain mechanism called MDMS (Master Delay MAC Scheduling). We compare different coexistence mechanisms and find that the performance of each approach very much depends on the efficiency of its sub-processes.published_or_final_versio