A multi-service MAC protocol in a multi-channel CSMA/CA for IEEE 802.11 networks

The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because of its random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.

[1]  T. Lindvall Lectures on the Coupling Method , 1992 .

[2]  William A. Massey,et al.  New stochastic orderings for Markov processes on partially ordered spaces , 1984, The 23rd IEEE Conference on Decision and Control.

[3]  Winfried K. Grassmann,et al.  Regenerative Analysis and Steady State Distributions for Markov Chains , 1985, Oper. Res..

[4]  Andrea Goldsmith,et al.  Wireless Communications , 2005, 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).

[5]  Jalel Ben-Othman,et al.  Performance Evaluation of Mobile Networks Based on Stochastic Ordering Markov Chains , 2008, Stud. Inform. Univ..

[6]  Michel Doisy,et al.  Comparaison de processus markoviens , 1992 .

[7]  Dong In Kim,et al.  Medium access control protocols for wireless mobile ad hoc networks: issues and approaches , 2003, Wirel. Commun. Mob. Comput..

[8]  Annie Gravey,et al.  A Space Priority Queuing Mechanism for Multiplexing ATM Channels , 1990, Comput. Networks ISDN Syst..

[9]  John A. Silvester,et al.  Spreading code protocols for distributed spread-spectrum packet radio networks , 1988, IEEE Trans. Commun..

[10]  Hind Castel-Taleb,et al.  Performance measure bounds in mobile networks by state space reduction , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[11]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[12]  Moshe Sidi,et al.  New call blocking versus handoff blocking in cellular networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[13]  Jean-Michel Fourneau,et al.  Bounding the Loss Rates in a Multistage ATM Switch , 1997, Computer Performance Evaluation.