Throughput Analysis in Multihop CSMA Packet Radio Networks
- 1 March 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 35 (3), 267-274
- https://doi.org/10.1109/tcom.1987.1096769
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.Keywords
This publication has 12 references indexed in Scilit:
- An Algorithm for Evaluation of Throughput in Multihop Packet Radio Networks with Complex TopologiesIEEE Journal on Selected Areas in Communications, 1987
- Throughput Analysis in Multihop CSMA Packet Radio NetworksIEEE Transactions on Communications, 1987
- On the Capacity of Multihop Slotted ALOHA Networks with Regular StructureIEEE Transactions on Communications, 1983
- Analysis of a Two-Hop Centralized Packet Radio Network--Part I: Slotted ALOHAIEEE Transactions on Communications, 1980
- An Approximate Analysis of Delay for Fixed and Variable Length Packets in an Unslotted ALOHA ChannelIEEE Transactions on Communications, 1977
- The Organization of Computer Resources into a Packet Radio NetworkIEEE Transactions on Communications, 1977
- Routing in Packet-Switching Broadcast Radio NetworksIEEE Transactions on Communications, 1976
- Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay CharacteristicsIEEE Transactions on Communications, 1975
- Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone SolutionIEEE Transactions on Communications, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973