• français
    • English
  • français 
    • français
    • English
  • Connexion
JavaScript is disabled for your browser. Some features of this site may not work without it.
Accueil

Afficher

Cette collectionPar Date de CréationAuteursTitresSujetsNoms de revueToute la baseCentres de recherche & CollectionsPar Date de CréationAuteursTitresSujetsNoms de revue

Mon compte

Connexion

Statistiques

Afficher les statistiques d'usage

Multi-services MAC protocol for wireless Networks

Thumbnail
Date
2005
Indexation documentaire
Informatique générale
Subject
Markov chains; wireless networks
Réf version publiée
http://dx.doi.org/10.1109/AICCSA.2005.1387055
Titre du colloque
3rd ACS/IEEE International Conference on Computer Systems and Applications, AICCSA-05
Date du colloque
01-2005
Ville du colloque
Le Caire
Pays du colloque
Égypte
Titre de l'ouvrage
The 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
Nom de l'éditeur
IEEE
Année
2005
ISBN
0-7803-8735-X
URI
https://basepub.dauphine.fr/handle/123456789/4959
Collections
  • LAMSADE : Publications
Métadonnées
Afficher la notice complète
Auteur
Ben Othman, Jalel
Castel-Taleb, Hind
Mokdad, Lynda
Type
Communication / Conférence
Nombre de pages du document
61-69
Résumé en anglais
Summary form only given. Due to random access in wireless networks using CSMA/CA like in Wifi networks, the integration of services with a lot of quality of service needs is impossible. In this paper, we propose to study and to evaluate a new MAC protocol that takes into account different types of traffic (e.g.. voice and data) and for each traffic, different priority levels are considered. To improve the QoS of WIFI MAC protocols, we add a selective reject and push-out mechanisms. To model our protocol, using Markov chain is impossible because it provides Markov chain with a large state-space. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a less state-space that allows to compute easily performance measures. We have used stochastic comparisons of Markov chains to prove that the considered 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 selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Cette création est mise à disposition sous un contrat Creative Commons.