Collision avoidance and resolution multiple access with transmission groups
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 134-142 vol.1
- https://doi.org/10.1109/infcom.1997.635123
Abstract
The CARMA-NTG protocol is presented and analyzed. CARMA-NTG dynamically divides the channel into cycles of variable length; each cycle consists of a contention period and a group-transmission period. During the contention period, a station with one or more packets to send competes for the right to be added to the group of stations allowed to transmit data without collisions; this is done using a collision resolution splitting algorithm based on a request-to-send/clear-to-send (RTS/CTS) message exchange with non-persistent carrier sensing. CARMA-NTG ensures that one station is added to the group transmission period if one or more stations send requests to be added in the previous contention period. The group-transmission period is a variable-length train of packets, which are transmitted by stations that have been added to the group by successfully completing an RTS/CTS message exchange in previous contention periods. As long as a station maintains its position in the group, it is able to transmit data packets without collision, An upper bound is derived for the average costs of obtaining the first success in the splitting algorithm. This bound is then applied to the computation of the average channel utilization in a fully connected network with a large number of stations. These results indicate that collision resolution is a powerful mechanism in combination with floor acquisition and group allocation multiple access.Keywords
This publication has 10 references indexed in Scilit:
- Group allocation multiple access with collision detectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Floor acquisition multiple access with collision resolutionPublished by Association for Computing Machinery (ACM) ,1996
- Floor acquisition multiple access (FAMA) for packet-radio networksPublished by Association for Computing Machinery (ACM) ,1995
- FAMA-PJPublished by Association for Computing Machinery (ACM) ,1995
- MACAWPublished by Association for Computing Machinery (ACM) ,1994
- A protocol for fast resource assignment in wireless PCSIEEE Transactions on Vehicular Technology, 1994
- Packet Switching in Radio Channels: New Conflict-Free Multiple Access SchemesIEEE Transactions on Communications, 1980
- Access-control disciplines for multi-access communication channels: Reservation and TDMA schemesIEEE Transactions on Information Theory, 1979
- Packet Switching in Radio Channels: Part I--Carrier Sense Multiple-Access Modes and Their Throughput-Delay CharacteristicsIEEE Transactions on Communications, 1975
- Dynamic Allocation of Satellite Capacity Through Packet ReservationPublished by Springer Nature ,1975