Efficient Distributed Medium Access
Devavrat Shah, Jinwoo Shin, Prasad Tetali

TL;DR
This paper introduces a simple, fully distributed randomized medium access algorithm for wireless networks that efficiently utilizes resources and is proven to be optimal for various network topologies.
Contribution
It presents a novel, totally distributed, and simple medium access algorithm that is proven to be optimal in resource utilization for wireless networks.
Findings
Algorithm is positive recurrent when network demand is supportable.
It is oblivious to network graph structure.
Achieves optimal resource utilization across different topologies.
Abstract
Consider a wireless network of n nodes represented by a graph G=(V, E) where an edge (i,j) models the fact that transmissions of i and j interfere with each other, i.e. simultaneous transmissions of i and j become unsuccessful. Hence it is required that at each time instance a set of non-interfering nodes (corresponding to an independent set in G) access the wireless medium. To utilize wireless resources efficiently, it is required to arbitrate the access of medium among interfering nodes properly. Moreover, to be of practical use, such a mechanism is required to be totally distributed as well as simple. As the main result of this paper, we provide such a medium access algorithm. It is randomized, totally distributed and simple: each node attempts to access medium at each time with probability that is a function of its local information. We establish efficiency of the algorithm by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Cooperative Communication and Network Coding · Opportunistic and Delay-Tolerant Networks
