Collision avoidance and resolution multiple access (CARMA)
- 49 Downloads
The collision avoidance and resolution multiple access (CARMA) protocol is presented and analyzed. CARMA uses a collision avoidance handshake in which the sender and receiver exchange a request to send (RTS) and a clear to send (CTS) before the sender transmits any data. CARMA is based on carrier sensing, together with collision resolution based on a deterministic tree-splitting algorithm. For analytical purposes, an upper bound is derived for the average number of steps required to resolve collisions of RTSs using the tree-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. Under light-load conditions, CARMA achieves the same average throughput as multiple access protocols based on RTS/CTS exchange and carrier sensing. It is also shown that, as the arrival rate of RTSs increases, the throughput achieved by CARMA is close to the maximum throughput that any protocol based on collision avoidance (i.e., RTS/CTS exchange) can achieve if the control packets used to acquire the floor are much smaller than the data packet trains sent by the stations. Simulation results validate the simplifying approximations made in the analytical model. Our analysis results indicate that collision resolution makes floor acquisition multiple access much more effective.
KeywordsData Packet Medium Access Control Protocol Control Packet Collision Resolution Left Subtree
Unable to display preview. Download preview PDF.
- N. Amitay, Resource auction multiple access (RAMA): Efficient method for fast resource assignment in decentralized wireless PCS, Electronic Letters 28(8) (1992) 799-801.Google Scholar
- V. Bharghavan, A. Demers, S. Shenker and L. Zhang, MACAW: a media access protocol for wireless LANs, in: Proceedings of ACM SIGCOMM' 94(1994) pp. 212-225.Google Scholar
- C. Fullmer and J.J. Garcia-Luna-Aceves, Floor acquisition multiple access for packet-radio networks, in: Proc. ACM SIGCOMM' 95, Cambridge, MA (August 30-September 1, 1995).Google Scholar
- C.L. Fullmer and J.J. Garcia-Luna-Aceves, Solutions to hidden terminal problems in wireless networks, in: Proc. ACM SIGCOMM' 97, Cannes, France (September 14-18, 1997).Google Scholar
- R. Garcés and J.J. Garcia-Luna-Aceves, Floor acquisition multiple access with collision resolution, in: Proc. ACM/IEEE Mobile Computing and Networking' 96, Rye, NY (November 10-12, 1996).Google Scholar
- P. Karn, MACA - a new channel access method for packet radio, in: ARRL/CRRL Amateur Radio 9th Computer Networking Conference(1990) pp. 134-140.Google Scholar
- M.J. Karol, L. Zhao and K.Y. Eng, Distributed-queuing request update multiple access (DQRUMA) for wireless packet (ATM) networks, in: Proc. IEEE ICC' 95, Seattle, WA (June 18-21, 1995).Google Scholar
- W.F. Lo and H.T. Mouftah, Carrier sense multiple access with collision detection for radio channels, in: IEEE 13th International Communications and Energy Conference(1984) pp. 244-247.Google Scholar
- G.S. Sidhu, R.F. Andrews and A.B. Oppenheimer, Inside AppleTalk, 2nd ed. (Addison-Wesley, Reading, MA, 1990).Google Scholar
- W. Xu and G. Campbell, A distributed queuing random access protocol for a broadcast channel, in: Proc. ACM SIGCOMM' 93, San Francisco, CA (13-17 September, 1993).Google Scholar