• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Multi-services MAC protocol for wireless Networks

Ben Othman, Jalel; Castel-Taleb, Hind; Mokdad, Lynda (2005), Multi-services MAC protocol for wireless Networks, The 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005, IEEE, p. 61-69. http://dx.doi.org/10.1109/AICCSA.2005.1387055

Type
Communication / Conférence
Date
2005
Conference title
3rd ACS/IEEE International Conference on Computer Systems and Applications, AICCSA-05
Conference date
2005-01
Conference city
Le Caire
Conference country
Égypte
Book title
The 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
Publisher
IEEE
ISBN
0-7803-8735-X
Pages
61-69
Publication identifier
http://dx.doi.org/10.1109/AICCSA.2005.1387055
Metadata
Show full item record
Author(s)
Ben Othman, Jalel cc
Castel-Taleb, Hind
Mokdad, Lynda
Abstract (EN)
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.
Subjects / Keywords
Markov chains; wireless networks

Related items

Showing items related by title and author.

  • Thumbnail
    Bounds on Performance Measures in Wireless Networks 
    Mokdad, Lynda; Castel-Taleb, Hind; Ben Othman, Jalel (2003) Communication / Conférence
  • Thumbnail
    Performance Analysis of a Call Admission Control for mobile networks 
    Mokdad, Lynda; Castel-Taleb, Hind; Ben Othman, Jalel (2005) Communication / Conférence
  • Thumbnail
    Performance Evaluation of Mobile Networks based on stochastic ordering of Markov chains 
    Mokdad, Lynda; Castel-Taleb, Hind; Ben Othman, Jalel (2006) Article accepté pour publication ou publié
  • Thumbnail
    AMCLM: Adaptive Multi-Services Cross-Layer MAC Protocol for IEEE 802.11 Networks 
    Ben Othman, Jalel; Mokdad, Lynda; Bouam, Souheila (2009) Article accepté pour publication ou publié
  • Thumbnail
    Loss rates bounds for IP switches in MPLS networks 
    Castel-Taleb, Hind; Mokdad, Lynda; Pekergin, Nihal (2006) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo