An efficient demand-assignment multiple access protocol for wireless packet (ATM) networks

In a wireless packet (ATM) network that supports an integrated mix of multimedia traffic, the channel access protocol needs to be designed such that mobiles share the limited communications bandwidth in an efficient manner: maximizing the utilization of the frequency spectrum and minimizing the delay experienced by mobiles. In this paper, we propose and study an efficient demand-assignment channel access protocol, which we call Distributed-Queueing Request Update Multiple Access (DQRUMA). The protocol can be used for a wide range of applications and geographic distances. Mobiles need to send requests to the base station only for packets that arrive to an empty buffer. For packets that arrive to a non-empty buffer, transmission requests are placed collision-free by piggybacking the requests with packet transmissions. The simulation results show that even with the “worst possible” traffic characteristics, the delay-throughput performance of DQRUMA is close to the best possible with any access protocol. In addition, explicit slot-by-slot announcement of the “transmit permissions” gives the base station complete control over the order in which mobiles transmit their packets. This important feature helps the base station satisfy diverse Quality-of-Service (QoS) requirements in a wireless ATM network.

[1]  Bhaskar Ramamurthi,et al.  Packet reservation multiple access for local wireless communications , 1989, IEEE Trans. Commun..

[2]  Norman Abramson,et al.  The ALOHA System-Another Alternative for Computer Communications , 1899 .

[3]  Reinaldo A. Valenzuela,et al.  BAHAMA: a broadband ad-hoc wireless ATM local-area network , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[4]  Raphael Rom,et al.  Multiple Access Protocols: Performance and Analysis , 1990, SIGMETRICS Perform. Evaluation Rev..

[5]  Raphael Rom,et al.  Multiple Access Protocols: Performance and Analysis , 1990, SIGMETRICS Perform. Evaluation Rev..

[6]  Mark J. Karol,et al.  Guaranteeing bandwidth and minimizing delay in packet-switched (ATM) networks , 1995, Proceedings of GLOBECOM '95.

[7]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Performance Evaluation , 1975, IEEE Trans. Commun..

[8]  Richard D. Gitlin,et al.  Spectrally efficient universal time slots using time-frequency-code slicing , 1994, 5th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Wireless Networks - Catching the Mobile Future..

[9]  John Capetanakis,et al.  Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[10]  N. Amitay,et al.  Resource auction multiple access (rama) : efficient method for fast resource assignment in decentralised wireless PCS , 1992 .

[11]  James L. Massey Some New Approaches to Random-Access Communication , 1987, Performance.

[12]  Noach Amitay Distributed Switching and Control with Fast Resource Assignment/Handoff for Personal Communications Systems , 1993, IEEE J. Sel. Areas Commun..