Mobility

Buffered Aloha With K-Exponential Backoff Part I: Stability and Throughput Analysis

Free registration required

Executive Summary

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. The authors 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.

  • Format: PDF
  • Size: 526.6 KB