Carrier-Sense Stack Algorithms for Multiple Access Communication Channels.
CONNECTICUT UNIV STORRS DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE
Pagination or Media Count:
We consider the random multiple access of a collision-type, packet-switched channel, for the Poisson user model in a local area network environment, where carrier sensing techniques are possible due to small propagation delays. We propose and analyze random access algorithms that are representative of a new class of stable algorithms with limited sensing and free access characteristics. Limited sensing algorithms require that users sense the channel only while they have a packet to transmit, and, therefore, they have practical advantages over algorithms that require continuous channel sensing. The free access characteristics of the proposed algorithms simplify their implementation, since newly arrived packets are transmitted upon arrival, provided that the channel is sensed idle. Utilizing the regenerative character of the stochastic processes that are associated with the random access system, we derive lower bounds on the maximum stable throughput, and tight upper and lower bounds on the induced mean packet delay. The proposed algorithms are easy-to-implement, and they combine inherently stable operation and high performance with modest channel sensing requirements.
- Non-Radio Communications