TY - GEN
T1 - On channel adaptive multiple access control with queued transmission requests for wireless ATM
AU - Lau, V. K.N.
AU - Kwok, Yu Kwong
PY - 2000
Y1 - 2000
N2 - We propose a new multiple access control (MAC) protocol for wireless ATM systems, in which user demands are highly heterogeneous and can be classified as CBR, VBR, and ABR. Our protocol is motivated by two of the most significant drawbacks of existing protocols: (1) the channel condition is ignored or not exploited, and (2) inflexible or biased time slots allocation algorithms are used. Indeed, existing protocols mostly ignore the burst errors due to fading and shadowing, which are inevitable in a mobile and wireless communication environment. A few protocols take into account the burst errors but just «handle» the errors in a passive manner. On the other hand, most of the existing protocols employ an inflexible or biased allocation algorithm such that over-provisioning may occur for a certain class of users at the expense of the poor service quality received by other users. Our proposed protocol, called SCAMA (synergistic channel adaptive multiple access), does not have these two drawbacks. The proposed protocol works closely with the underlying physical layer in that through observing the channel state information (CSI) of each mobile user, the MAC protocol first segregates a set of users with good CSI from requests gathered in the request contention phase of an uplink frame. The MAC protocol then judiciously allocates information time slots to the users according to their traffic types, CSI, urgency, and throughput, which are collectively represented by a novel and flexible priority function. Extensive simulations have been conducted to evaluate the SCAMA protocol.
AB - We propose a new multiple access control (MAC) protocol for wireless ATM systems, in which user demands are highly heterogeneous and can be classified as CBR, VBR, and ABR. Our protocol is motivated by two of the most significant drawbacks of existing protocols: (1) the channel condition is ignored or not exploited, and (2) inflexible or biased time slots allocation algorithms are used. Indeed, existing protocols mostly ignore the burst errors due to fading and shadowing, which are inevitable in a mobile and wireless communication environment. A few protocols take into account the burst errors but just «handle» the errors in a passive manner. On the other hand, most of the existing protocols employ an inflexible or biased allocation algorithm such that over-provisioning may occur for a certain class of users at the expense of the poor service quality received by other users. Our proposed protocol, called SCAMA (synergistic channel adaptive multiple access), does not have these two drawbacks. The proposed protocol works closely with the underlying physical layer in that through observing the channel state information (CSI) of each mobile user, the MAC protocol first segregates a set of users with good CSI from requests gathered in the request contention phase of an uplink frame. The MAC protocol then judiciously allocates information time slots to the users according to their traffic types, CSI, urgency, and throughput, which are collectively represented by a novel and flexible priority function. Extensive simulations have been conducted to evaluate the SCAMA protocol.
UR - http://www.scopus.com/inward/record.url?scp=84905408083&partnerID=8YFLogxK
U2 - 10.1109/HPSR.2000.856698
DO - 10.1109/HPSR.2000.856698
M3 - Conference contribution
AN - SCOPUS:84905408083
SN - 0780358848
SN - 9780780358843
T3 - IEEE International Conference on High Performance Switching and Routing, HPSR
SP - 473
EP - 481
BT - ATM 2000 - Proceedings of the IEEE Conference 2000 on High Performance Switching and Routing; Joint IEEE ATM Workshop 2000 and 3rd International Conference on ATM, ICATM 2000
T2 - 2000 IEEE Conference on High Performance Switching and Routing, ATM 2000 - Joint IEEE ATM Workshop 2000 and 3rd International Conference on ATM, ICATM 2000
Y2 - 26 June 2000 through 29 June 2000
ER -