IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v162y2008i1p3-1810.1007-s10479-008-0315-4.html
   My bibliography  Save this article

Analysis of IEEE 802.11 non-saturated DCF by matrix analytic methods

Author

Listed:
  • Yun Bae
  • Kyung Kim
  • Mi-Nam Moon
  • Bong Choi

Abstract

In the IEEE 802.11 MAC layer protocol, the basic access method is the Distributed Coordination Function based on the CSMA/CA. In this paper, we investigate the analytic performance of IEEE 802.11 DCF in the non-saturation mode. We assume that there is a fixed number n of competing stations and the packet arrival process to each station is a Poisson process. We model IEEE 802.11 DCF in non-saturation mode by a 3-dimensional Markov chain and derive the steady state probability of the Markov chain by applying the matrix analytic method. We obtain the probability generating function of Head-of-Line delay (HoL-delay), non-saturation throughput and packet loss probability. Our results can be used for finding the optimal number of stations that can be accommodated while satisfying a given QoS requirement. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Yun Bae & Kyung Kim & Mi-Nam Moon & Bong Choi, 2008. "Analysis of IEEE 802.11 non-saturated DCF by matrix analytic methods," Annals of Operations Research, Springer, vol. 162(1), pages 3-18, September.
    • Handle: RePEc:spr:annopr:v:162:y:2008:i:1:p:3-18:10.1007/s10479-008-0315-4
    DOI: 10.1007/s10479-008-0315-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-008-0315-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-008-0315-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Anatoly Nazarov & János Sztrik & Anna Kvach & Tamás Bérczes, 2019. "Asymptotic analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs," Annals of Operations Research, Springer, vol. 277(2), pages 213-229, June.
    2. Dieter Fiems & Tuan Phung-Duc, 2019. "Light-traffic analysis of random access systems without collisions," Annals of Operations Research, Springer, vol. 277(2), pages 311-327, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:162:y:2008:i:1:p:3-18:10.1007/s10479-008-0315-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.