Throughput Analysis in Multihop CSMA Packet Radio Networks

TLDR

The authors develop a Markov‑based product‑form solution to efficiently analyze the throughput of arbitrary‑topology multihop CSMA packet‑radio networks with perfect capture. The method models both exponential and non‑exponential packet lengths, preserves CSMA node dependence, and computes the joint probability of node transmissions. The product‑form analysis enables an automated algorithm that determines maximum throughput for networks up to 100 nodes, as demonstrated by numerical examples and extended to other protocols and acknowledgment scenarios.

Abstract

In this paper, we use a Markov model to develop a product form solution to efficiently analyze the throughput of arbitrary topology multihop packet radio networks that employ a carrier sensing multiple access (CSMA) protocol with perfect capture. We consider both exponential and nonexponential packet length distributions. Our method preserves the dependence between nodes, characteristic of CSMA, and determines the joint probability that nodes are transmitting. The product form analysis provides the basis for an automated algorithm that determines the maximum throughput in networks of size up to 100 radio nodes. Numerical examples for several networks are presented. This model has led to many theoretical and practical extensions. These include determination of conditions for product form analysis to hold, extension to other access protocols, and consideration of acknowledgments.