A Multi-Service MAC Protocol in a Multi-Channel CSMA/CA for IEEE 802.11 Networks

  • Ben-Othman, Jalel (Laboratoire Prism-CNRS, Universite de Versailles) ;
  • Castel, Hind (Dept. RST/SAMOVAR, Institut National des Telecommunications) ;
  • Mokdad, Lynda (Laboratoire Lamsade, Universite de Paris Dauphine)
  • 발행 : 2008.09.30

초록

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 orits 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. S. Rappaport, Wireless Communications. Prentice Hall, 2001.
  2. M. Doisy, "Comparaison de processus Markoviens," Ph.D. thesis, Université de Pau et des pays de l'Adour, 1992.
  3. D. Stoyan, Comparaison Methods for Queues and Other Stochastics Models. John Wiley and Sons, Inc., 1976.
  4. W. A. Massey, "Stochastic orderings for Markov processses on partially ordered spaces," Mathematics of Operations Research, vol. 12, pp. 350- 367, 1987. https://doi.org/10.1287/moor.12.2.350
  5. J.-M. Vincent, "Encadrement de performances: Une approche algorithmique," Rapport interne LGI-IMAG, 1993.
  6. L. Truffet, "Methodes de calcul de bornes stochastiques sur des modèles de systemes et de reseaux," Ph.D. thesis Universite Paris 6, 1995.
  7. J. M. Fourneau, L. Mokdad, and N. Pekergin, "Bounding the loss rates in a multistage ATM switch," in Proc. 9th Int. Conf. Modelling Techniques and Tools for Computer Performance Evaluation, France, 1997.
  8. J. M. Fourneau, N. Pekergin, and H. Taleb, "Stochastic bounds and QoS: Application to the loss rates in ATM networks," in Proc. European Simulation Multiconference, Budapest, 1996.
  9. H. Castel and L. Mokdad, "Performance measure bounds in mobile networks by state space reduction," in Proc. the 13th IEEE/ACM MASCOTS, Sept. 2005, pp. 397-406.
  10. J. Ben-Othman, H. Castel-Taleb, and L.Mokdad, "Performance evaluation of mobile networks based on stochastic ordering of Markov chains," Studia Informatica Universalis, vol. 4, no. 2, pp. 191-208, 2006.
  11. S. Sousa and J. A. Silvester, "Spreading code protocols for distributed spreading-spectrm packet radio networks" IEEE Trans. Commun., vol. 36, no. 3, pp. 776-783, 1998.
  12. I. Teerawat, E. Hossain, and I. K. Dong, "Medium access control protocols for wireless mobile ad hoc networks: Issues and approaches," Wireless Commun. Mob. Comput., vol. 3, pp. 935-958, 2003. https://doi.org/10.1002/wcm.118
  13. M. Sidi and D. Starobinski, "New call blocking versus handoff blocking in cellular networks," Baltzer J.
  14. G. Hebuterne and A. Gravey, "A space priority queueing mechanism for multiplexing ATM channels," ITC Specialist Seminar, Computer Network and ISDN Systems, vol. 20, pp. 37-42, 1990.
  15. W. K. Grassman, M. I. Taksar, and D. P. Heyman, "Regenerative analysis and steady state distributions for Markov chains," Oper. Res. J., vol. 13, no. 3, pp. 1107-1116.
  16. T. Lindvall, Lectures on the Coupling Method. John Wiley and Sons, Inc., 1992.