Abstract

We consider a population of terminals communicating with a central station over a packet-switched multiple-access radio channel. The performance of carrier sense multiple access (CSMA) [1] used as a method for multiplexing these terminals is highly dependent on the ability of each terminal to sense the carrier of any other transmission on the channel. Many situations exist in which some terminals are "hidden" from each other (either because they are out-of-sight or out-of-range). In this paper we show that the existence of hidden terminals significantly degrades the performance of CSMA. Furthermore, we introduce and analyze the busy-tone multiple-access (BTMA) mode as a natural extension of CSMA to eliminate the hidden-terminal problem. Numerical results giving the bandwidth utilization and packet delays are shown, illustrating that BTMA with hidden terminals performs almost as well as CSMA without hidden terminals.

Keywords

Hidden node problemComputer networkChannel access methodComputer scienceCarrier sense multiple access with collision avoidanceTerminal (telecommunication)Network packetTransmission (telecommunications)Channel (broadcasting)Multiple Access with Collision Avoidance for WirelessMultiplexingSense (electronics)WirelessTelecommunicationsWireless networkEngineeringThroughputElectrical engineeringWi-Fi array

Affiliated Institutions

Related Publications

Publication Info

Year
1975
Type
article
Volume
23
Issue
12
Pages
1417-1433
Citations
1572
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1572
OpenAlex

Cite This

Fouad A. Tobagi, Leonard Kleinrock (1975). Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution. IRE Transactions on Communications Systems , 23 (12) , 1417-1433. https://doi.org/10.1109/tcom.1975.1092767

Identifiers

DOI
10.1109/tcom.1975.1092767