Random Access Game and Medium Access Control Design

Motivated partially by a control-theoretic viewpoint, we propose a game-theoretic model, called random access game, for contention control. We characterize Nash equilibria of random access games, study their dynamics, and propose distributed algorithms (strategy evolutions) to achieve Nash equilibria. This provides a general analytical framework that is capable of modeling a large class of system-wide quality-of-service (QoS) models via the specification of per-node utility functions, in which system-wide fairness or service differentiation can be achieved in a distributed manner as long as each node executes a contention resolution algorithm that is designed to achieve the Nash equilibrium. We thus propose a novel medium access method derived from carrier sense multiple access/collision avoidance (CSMA/CA) according to distributed strategy update mechanism achieving the Nash equilibrium of random access game. We present a concrete medium access method that adapts to a continuous contention measure called conditional collision probability, stabilizes the network into a steady state that achieves optimal throughput with targeted fairness (or service differentiation), and can decouple contention control from handling failed transmissions. In addition to guiding medium access control design, the random access game model also provides an analytical framework to understand equilibrium and dynamic properties of different medium access protocols

Performance modelling of fairness in IEEE 802.11 wireless LAN protocols

PhD ThesisWireless communication has become a key technology in the modern world, allowing network services to be delivered in almost any environment, without the need for potentially expensive and invasive fixed cable solutions. However, the level of performance experienced by wireless devices varies tremendously on location and time. Understanding the factors which can cause variability of service is therefore of clear practical and theoretical interest. In this thesis we explore the performance of the IEEE 802.11 family of wireless protocols, which have become the de facto standard for Wireless Local Area Networks (WLANs). The specific performance issue which is investigated is the unfairness which can arise due to the spatial position of nodes in the network. In this work we characterise unfairness in terms of the difference in performance (e.g. throughput) experienced by different pairs of communicating nodes within a network. Models are presented using the Markovian process algebra PEPA which depict different scenarios with three of the main protocols, IEEE 802.11b, IEEE 802.11g and IEEE 802.11n. The analysis shows that performance is affected by the presence of other nodes (including in the well-known hidden node case), by the speed of data and the size of the frames being transmitted. The collection of models and analysis in this thesis collectively provides not only an insight into fairness in IEEE 802.11 networks, but it also represents a significant use case in modelling network protocols using PEPA. PEPA and other stochastic process algebra are extremely powerful tools for efficiently specifying models which might be very complex to study using conventional simulation approaches. Furthermore the tool support for PEPA facilitates the rapid solution of models to derive key metrics which enable the modeller to gain an understanding of the network behaviour across a wide range of operating conditions. From the results we can see that short frames promote a greater fairness due to the more frequent spaces between frames allowing other senders to transmit. An interesting consequence of these findings is the observation that varying frame length can play a role in addressing topological unfairness, which leads to the analysis of a novel model of IEEE 802.11g with variable frame lengths. While varying frame lengths might not always be practically possible, as frames need to be long enough for collisions to be detected, IEEE 802.11n supports a number of mechanisms for frame aggregation, where successive frames may be sent in series with little or no delay between them. We therefore present a novel model of IEEE 802.11n with frame aggregation to explore how this approach affects fairness and, potentially, can be used to address unfairness by allowing affected nodes to transmit longer frame bursts.Kurdistan Region Government of Iraq (KRG) sponso

Energy-efficient wireless communication

In this chapter we present an energy-efficient highly adaptive network interface architecture and a novel data link layer protocol for wireless networks that provides Quality of Service (QoS) support for diverse traffic types. Due to the dynamic nature of wireless networks, adaptations in bandwidth scheduling and error control are necessary to achieve energy efficiency and an acceptable quality of service. In our approach we apply adaptability through all layers of the protocol stack, and provide feedback to the applications. In this way the applications can adapt the data streams, and the network protocols can adapt the communication parameters

Autonomous QoS Management and Policing in Unmanaged Local Area Networks

The high increase of bandwidth-intensive applications like high definition video streaming in home and small office environments leads to QoS challenges in hybrid wired/wireless local area networks. These networks are often not QoS aware and may contain bottlenecks in their topology. In addition, they often have a hybrid nature due to the used access technology consisting of, for example, Ethernet, wireless, and PowerLAN links. In this paper, we present the research work on a novel autonomous system for hybrid QoS in local area networks, called QoSiLAN, which does not rely on network infrastructure support but on host cooperation and works independently of the access technology. We present a new QoS Signalling Protocol, policing and admission control algorithms, and a new lightweight statistical bandwidth prediction algorithm for autonomous resource management in LANs. This new QoS framework enables link based, access-medium independent bandwidth management without network support. We provide evaluation results for the novel bandwidth prediction algorithm as well as for the QoSiLAN framework and its protocol, which highlight the features, robustness, and the effectiveness of the proposed system

Bandwidth allocation in cooperative wireless networks: Buffer load analysis and fairness evaluation.

In modern cooperative wireless networks, the resource allocation is an issue of major significance. The cooperation of source and relay nodes in wireless networks towards improved performance and robustness requires the application of an efficient bandwidth sharing policy. Moreover, user requirements for multimedia content over wireless links necessitate the support of advanced Quality of Service (QoS) features. In this paper, a novel bandwidth allocation technique for cooperative wireless networks is proposed, which is able to satisfy the increased QoS requirements of network users taking into account both traffic priority and packet buffer load. The performance of the proposed scheme is examined by analyzing the impact of buffer load on bandwidth allocation. Moreover, fairness performance in resource sharing is also studied. The results obtained for the cooperative network scenario employed, are validated by simulations. Evidently, the improved performance achieved by the proposed technique indicates that it can be employed for efficient traffic differentiation. The flexible design architecture of the proposed technique indicates its capability to be integrated into Medium Access Control (MAC) protocols for cooperative wireless networks