Collision Avoidance and Resolution Multiple Access with Transmission Queues

Abstract

this paper we describe and analyze a new channel access protocol that combines distributed queues and RTS/CTS handshakes with collision resolution. We call the resulting protocol "Collision Avoidance and Resolution Multiple Access" protocol with non-persistence and transmission queues (CARMA-NTQ). CARMA-NTQ provides dynamic reservations of the channel, together with collision resolution of the reservations requests based on a tree-splitting algorithm [11]. Like GAMA [15], CARMA-NTQ builds a dynamically-sized cycle that grows and shrinks depending upon traffic demand. Each cycle consists of a contention period and a queue-transmission period during which one or more stations transmit data packets without collision. A position in the transmission queue is allocated to an individual station during the contention period, and a station can continue to transmit in this position as long as it has data to send to any other station in the network. Stations compete to acquire the right to be in the transmission queue based on a deterministic tree-splitting algorithm