Node-Based Distributed Channel Access With Enhanced Delay Characteristics - 2018


Recent studies in wireless scheduling have shown that carrier-sense multiple access (CSMA) can be created throughput optimal by optimizing over activation rates. However, those throughput optimal CSMA algorithms were found to suffer from poor delay performance, particularly at high throughputs where the delay will potentially grow exponentially in the scale of the network. Motivated by these shortcomings, in this Project we propose a node-based mostly version of the throughput optimal CSMA (NB-CSMA) as opposed to ancient link-based mostly CSMA algorithms, where links were treated as separate entities. Our algorithm is fully distributed and corresponds to Glauber dynamics with “Block updates”. We tend to show analytically and via simulations that NB-CSMA outperforms conventional link-based CSMA in terms of delay for any fastened-size network. We have a tendency to also characterize the fraction of the capacity region for that the typical queue lengths (and the typical delay) grow polynomially in the scale of the network, for networks with bounded-degree conflict graphs. This fraction isn't any smaller than the fraction known for link-primarily based CSMA, and is considerably larger for several instances of practical wireless ad-hoc networks. Finally, we have a tendency to limit our focus to the special case of collocated networks, analyze the mean starvation time employing a Markov chain with rewards framework and use the results to quantitatively demonstrate the improvement of NB-CSMA over the baseline link-based mostly algorithm.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE : On the Delay Advantage of Coding in Packet Erasure Networks - 2014 ABSTRACT: We consider the delay of network coding compared to routing with retransmissions in packet erasure networks with probabilistic erasures.
PROJECT TITLE : Joint Topology-Transparent Scheduling and QoS Routing in Ad Hoc Networks - 2014 ABSTRACT: This paper considers the problem of joint topologytransparent scheduling (TTS) and quality-of-service (QoS) routing in
PROJECT TITLE : Joint Routing and Resource Allocation for Delay Minimization in Cognitive Radio Based Mesh Networks - 2014 ABSTRACT: This paper studies the joint design of routing and resource allocation algorithms in cognitive
PROJECT TITLE : Joint Routing and Medium Access Control in Fixed Random Access Wireless Multihop Networks - 2014 ABSTRACT: We study cross-layer design in random-access-based fixed wireless multihop networks under a physical
PROJECT TITLE : Joint Interference Coordination and Load Balancing for OFDMA Multihop Cellular Networks - 2014 ABSTRACT: Multihop cellular networks (MCNs) have drawn tremendous attention due to its high throughput and extensive

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry