This paper proposes and analyzes a distributed MAC protocol that achieves zero collision with no control message exchange nor synchronization. ZC (ZeroCollision) is neither reservation-based nor dynamic TDMA; the protocol supports variable-length packets and does not lose efficiency when some of the stations do not transmit. At the same time, ZC is not a CSMA; in its steady state, it is completely collision-free. The stations transmit repeatedly in a round-robin order once the convergence state is reached. If some stations skip their turn, their transmissions are replaced by idle @math -second mini-slots that enable the other stations to keep track of their order. Because of its short medium access delay and its efficiency, the protocol supports both real-time and elastic applications. The protocol allows for nodes leaving and joining the network; it can allocate more throughput to specific nodes (such as an access point). The protocol is robust against carrier sensing errors or clock drift. While collision avoidance is guaranteed in a single collision domain, it is not the case in a multiple collision one. However, experiments show ZC supports a comparable amount of goodput to CSMA in a multiple collision domain environment. The paper presents an analysis and extensive simulations of the protocol, confirming that ZC outperforms both CSMA and TDMA at high and low load.
In a reservation or dynamic TDMA protocol, a device reserves some future epochs to transmit its packets. The random reservation TDMA protocols have many variations. R-ALOHA @cite_28 , PRMA @cite_16 and their vast number of derivatives adopts reserve-on-success.'' There, time is divided into a sequence of frames and each frame consists of fixed-length slots. If a trial transmission is successful during a non-reserved slot within a frame, the corresponding slot of the following frames are regarded as reserved. @cite_7 @cite_1 analyze performance and stability of this class of protocols.
@cite_28 @cite_16 @cite_1 @cite_7
2110504193 2111620924 2123136297 2148565706
Here we continue the analytic study of packet switching in radio channels which we reported upon m our two previous papers [1], [2] Again we consider a population of terminals communicating with a central station over a packet-switched radio channel. The allocation of bandwidth among the contending terminals can be fixed [e.g., time-division multiple access (TDMA) or frequency-division multiple access (FDMA)], random [e.g., ALOHA or carrier sense multiple access (CSMA)] or centrally controlled (e.g., polling or reservation). In this paper we show that with a large population of bursty users, (as expected) random access is superior to both fixed assignment and polling. We also introduce and analyze a dynamic reservation technique which we call split-channel reservation multiple access (SRMA) which is interesting in that it is both simple and efficient over a large range of system parameters. Adding frame structure to slotted ALOHA makes it very convenient to control the ALOHA channel and eliminate instability. The frame length is adjusted dynamically according to the number of garbled, successful, and empty timeslots in the past. Each terminal that has a packet to transmit selects at random one of the n timeslots of a frame. Dynamic frame length ALOHA achieves a throughput (expected number of successful packets per timeslot) of 0.426 which compares favorably with the 1 e ( .368) upper bound of ordinary slotted ALOHA. Simulation work is reported indicating that packet reservation multiple access (PRMA) allows a variety of information sources to share the same wireless access channel. Some of the sources, such as speech terminals, are classified as periodic and others, such as signaling, are classified as random. Packets from all sources contend for access to channel time slots. When a periodic information terminal succeeds in gaining access, it reserves subsequent time slots for uncontested transmission. Both computer simulations and a listening test reveal that PRMA achieves a promising combination of voice quality and bandwidth efficiency. > In multihop packet radio networks with randomly distributed terminals, the optimal transmission radii to maximize the expected progress of packets in desired directions are determined with a variety of transmission protocols and network configurations. It is shown that the FM capture phenomenon with slotted ALOHA greatly improves the expected progress over the system without capture due to the more limited area of possibly interfering terminals around the receiver. The (mini)slotted nonpersistent carrier-sense-multiple-access (CSMA) only slightly outperforms ALOHA, unlike the single-hop case (where a large improvement is available), because of a large area of "hidden" terminals and the long vulnerable period generated by them. As an example of an inhomogeneous terminal distribution, the effect of a gap in an otherwise randomly distributed terminal population on the expected progress of packets crossing the gap is considered. In this case, the disadvantage of using a large transmission radius is demonstrated.