skip to main content
article
Free access

Floor acquisition multiple access (FAMA) for packet-radio networks

Published: 01 October 1995 Publication History

Abstract

A family of medium access control protocols for single-channel packet radio networks is specified and analyzed. These protocols are based on a new channel access discipline called floor acquisition multiple access (FAMA), which consists of both carrier sensing and a collision-avoidance dialogue between a source and the intended receiver of a packet. Control of the channel (the floor) is assigned to at most one station in the network at any given time, and this station is guaranteed to be able to transmit one or more data packets to different destinations with no collision with transmissions from other stations. The minimum length needed in control packets to acquire the floor is specified as a function of the channel propagation time. The medium access collision avoidance (MACA) protocol proposed by Karn and variants of CSMA based on collision avoidance are shown to be variants of FAMA protocols when control packets last long enough compared to the channel propagation delay. The throughput of FAMA protocols is analyzed and compared with the throughput of non-persistent CSMA. This analysis shows that using carrier sensing as an integral part of the floor acquisition strategy provides the benefits of MACA in the presence of hidden terminals, and can provide a throughput comparable to, or better than, that of non-persistent CSMA when no hidden terminals exist.

References

[1]
N. Abramson, "The ALOHA System - Another Alternative for Computer Communications," in Proceedings of the Fall Joint Computer Conference, pp. 281-85, 1970.]]
[2]
V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, "MACAW: A Media Access Protocol for Wireless LAN's," in Proceedings of ACM SIGCOMM '9J, pp. 212-25, ACM, 1994.]]
[3]
K. Biba, "A Hybrid Wireless MAC Protocol Supporting Asynchronous and Syncronous MSDU Delivery Services," Tech. Rep. Paper 802.11/91-92, IEEE 802.11 Working Group, 1992.]]
[4]
R.L. Brewster and A. M. Glass, "Throughput Analysis of Non- Persistent and Slotted Non-Persistent CSMA/CA Protocols," in Jth Internatzonal Conference on Land Mobile Radzo, pp. 231-6, Institution of Electronic amd Radio Engineers, 1987.]]
[5]
K.-C. Chen, "Medium access control of wireless lans for mobile computing," IEEE Network, vol. 8, no. 5, pp. 50-63, 1994.]]
[6]
I. Chlamtac, W. R. Franta, and K. D. Levin, "BRAM: The Broadcast Recognizing Access Method," IEEE Trans Commun., vol. COM-27, pp. 1183-89, 1979]]
[7]
A. Colvin, "CSMA with collision avoidance," Computer Communicatzons, vol. 6, no. 5, pp. 227-35, 1983.]]
[8]
PSO2.11-Unapproved Draft: W~reless LAN Medium Access Control (MAC) and Physzcal Specificatzons, IEEE, November 1994.]]
[9]
P. Karn, "MACA - a new channel access method for packet radio,'' in ARRL/CRRL Amateur Radio 9th Computer Networking Conference, pp. 134-40, ARRL, 1990.]]
[10]
L. Kleinrock and M. O. Scholl, "Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes," IEEE Trans. Commun., vol. COM-28, pp. 1015-29, 1980.]]
[11]
L. Kleinrock and F. A. Tobagi, "Packet switching in radio channels: Part I - carrier sense multiple-access modes and their throughput-delay characteristics," IEEE Trans. Com* mun., vol. COM-23, no. 12, pp. 1400-1416, 1975.]]
[12]
B. M. Leiner, D. L. Nielson, and F. A. Tobagi, eds., Proceedzngs of the IEEE, vol. 75, tEEE, January 1987.]]
[13]
W. F. Lo and H. T. Mouftah, "Carrier Sense Multiple Access with Collsision Detection for Radio Channels," in IEEE 13th Internatzonal Communications and Energy Conference, pp. 244- 47, IEEE, 1984.]]
[14]
J. Meditch and C. Lea, "Stability and Optimization of CSMA and CSMA/CD Channels," in Advances ~n Local Area Networks, pp. 340-362, IEEE Press, 1987.]]
[15]
R. M. Metcalfe and D. R. Boggs, "ETHERNET: Distributed packet switching for local computer networks," Communcat~ons of the ACM, vol. 19, no. 7, pp. 395 - 403, 1976.]]
[16]
R. Rom, "Collsision Detection in Radio Channels," in Local area and multiple access networks, pp. 235-49, Computer Science Press, 1986.]]
[17]
R. Rom and M. Sidi, Multiple Access Protocols Performance and Analys~s. Springer-Verlag, 1990.]]
[18]
G. S. Sidhu, R. F. Andrews, and A. B. Oppenheimer, Inside AppleTalk, Second Edition. Addison-Wesley Publishing Company, Inc., 1990.]]
[19]
H. Takagi and L. Kleinrock, "Output processes in contention packet broadcasting systems," IEEE Trans. Commun., vot. COM-33, no. 11, pp. 1191-9, 1985.]]
[20]
F. A. Tobagi and L. Kleinrock, "Packet switching in radio channels: Part II - the hidden terminal problem in carrier sense multiple-access modes and the busy-tone solution," IEEE Trans. Commun., vol. COM-23, no. 12, pp. 1417-1433, 1975.]]
[21]
F. A. Tobagi and L. KIeinrock, "Packet switching in radio channels: Part III- polling and (dynamic) split-channel reservation multiple access," IEEE Trans. Commun., vol. COM-24, no. 8, pp. 832-845, 1976]]
[22]
K.S. Trivedi, Probabzlzty and Statzst~cs with Relzability, Queue- ~ng, and Computer Science Applications. Prentice-Hall, 1988.]]

Cited By

View all

Index Terms

  1. Floor acquisition multiple access (FAMA) for packet-radio networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 25, Issue 4
      Oct. 1995
      345 pages
      ISSN:0146-4833
      DOI:10.1145/217391
      • Editor:
      • David Oran
      Issue’s Table of Contents
      • cover image ACM Conferences
        SIGCOMM '95: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
        October 1995
        372 pages
        ISBN:0897917111
        DOI:10.1145/217382
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 October 1995
      Published in SIGCOMM-CCR Volume 25, Issue 4

      Check for updates

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)156
      • Downloads (Last 6 weeks)39
      Reflects downloads up to 01 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media