Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Collision detection in radio channels
Rom R., Computer Science Press, Inc., New York, NY, 1986. Type: Book (9780881751437)
Date Reviewed: Oct 1 1987

This paper describes a CSMA channel access algorithm that is capable of detecting collisions in radio channels. Radio networks have a special problem in that the transmitted and received signal amplitudes differ by orders of magnitude. This makes it infeasible to detect collisions by comparing the transmitted and received signals. The algorithm in this paper is based on the sender pausing briefly during transmission and listening to the channel. If the channel is not idle during the pause, a collision has occurred.

The author evaluates the throughput, channel capacity, and throughput-delay performance of the algorithm. The paper also discusses the dependence of performance on the duration of the collision detection interval, the minimum transmission duration following detection of a collision that guarantees that the collision will be sensed by all receivers. The author concludes that this algorithm exhibits improved performance relative to standard CSMA, especially under high loads and near the limit of channel capacity.

Reviewer:  Martin W. Sachs Review #: CR111631
Bookmark and Share
 
Access Schemes (C.2.5 ... )
 
 
Performance Analysis And Design Aids (B.4.4 )
 
Would you recommend this review?
yes
no
Other reviews under "Access Schemes": Date
A tutorial on the IEEE 802 Local Network Standard
Stallings W., Computer Science Press, Inc., New York, NY, 1986. Type: Book (9780881751437)
Oct 1 1987
A model for an expert system for medium access control in a local area network
Maule R., Kandel A. (ed) Information Sciences 37(1-3): 39-83, 1985. Type: Article
Aug 1 1986
A unified analysis of steady state behavior in random access schemes
Onozato Y., Naguchi S. Computer Networks and ISDN Systems 10(2): 111-122, 1985. Type: Article
Dec 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy