Buffered Aloha with K-Exponential Backoff -- Part I: Stability and Throughput Analysis
Tony T. Lee, Lin Dai

TL;DR
This paper analyzes the stability and throughput of buffered Aloha networks using K-Exponential Backoff, showing that exponential backoff maintains stability even with infinitely many nodes, unlike geometric backoff.
Contribution
It introduces a unified method for analyzing stability and throughput of K-Exponential Backoff in buffered Aloha networks for any cutoff K.
Findings
Exponential Backoff maintains stability regardless of network size.
Geometric Backoff's stable region shrinks as the number of nodes increases.
Analytical results are validated through simulations.
Abstract
This two-part paper series studies the performance of buffered Aloha networks with K-Exponential Backoff collision resolution algorithms. Part I focuses on stability and throughput analysis and Part II presents the delay analysis. In Part I, the buffered Aloha network is modeled as a multi-queue single-server system. We adopt a widely used approach in packet switching systems to decompose the multi-queue system into independent first-in-first-out (FIFO) queues, which are hinged together by the probability of success of head-of-line (HOL) packets. A unified method is devised to tackle the stability and throughput problems of K-Exponential Backoff with any cutoff phase K. We demonstrate that a network with K-Exponential Backoff can be stabilized if the retransmission factor q is properly selected. The stable region of q is characterized and illustrated via examples of Geometric…
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
TopicsWireless Networks and Protocols · Mobile Ad Hoc Networks · IoT Networks and Protocols
