A New Markov Model for Non-Saturated 802.11 Networks

In this work, we introduce a new Markov model for the distributed coordination function (DCF) protocol which accurately predicts the network throughput of 802.11 networks under realistic traffic load. Specifically, we provide an improved treatment of the post backoff, the probability of immediate tr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dao, N.T., Malaney, R.A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 424
container_issue
container_start_page 420
container_title
container_volume
creator Dao, N.T.
Malaney, R.A.
description In this work, we introduce a new Markov model for the distributed coordination function (DCF) protocol which accurately predicts the network throughput of 802.11 networks under realistic traffic load. Specifically, we provide an improved treatment of the post backoff, the probability of immediate transmission after DIFS, and the probability of having a new packet for transmission after the post backoff. A key feature of our model is the ability to predict the optimal network throughput and the network capacity (in terms of number of stations with acceptable QoS). Knowledge of the network capacity aids to network planning and QoS for multimedia applications. Another feature is that the model converges to a saturated model when the number of stations becomes large. Based on this feature, we introduce a new method to estimate the lower bound of network capacity.
doi_str_mv 10.1109/ccnc08.2007.100
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4446398</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4446398</ieee_id><sourcerecordid>4446398</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e61809aa629209a9d35586769ba6c8f34edb841b59d2391ed89e01a1c8f635703</originalsourceid><addsrcrecordid>eNo1jc1OwzAQhI0AiVJy5sDFL5Cw6_XP-lhVUJDacgDOlRO7UmhpkBOoeHsiAXP5NJrRjBDXCBUi-NumOTTAlQJwFQKciMI7Rq20Rm2cPhWX_8bSmZgoIiw9G3Uhir5_g1HaEDNNhJ7JdTrKVci77kuuupj2cttlue4O5XMYPnMYUpQMajwem8Oxy7v-Spxvw75PxR-n4vX-7mX-UC6fFo_z2bJs0ZmhTBYZfAhWeTXSRzKGrbO-DrbhLekUa9ZYGx8VeUyRfQIMOGaWjAOaipvf3TaltPnI7XvI3xuttSXP9AMkSUTq</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A New Markov Model for Non-Saturated 802.11 Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Dao, N.T. ; Malaney, R.A.</creator><creatorcontrib>Dao, N.T. ; Malaney, R.A.</creatorcontrib><description>In this work, we introduce a new Markov model for the distributed coordination function (DCF) protocol which accurately predicts the network throughput of 802.11 networks under realistic traffic load. Specifically, we provide an improved treatment of the post backoff, the probability of immediate transmission after DIFS, and the probability of having a new packet for transmission after the post backoff. A key feature of our model is the ability to predict the optimal network throughput and the network capacity (in terms of number of stations with acceptable QoS). Knowledge of the network capacity aids to network planning and QoS for multimedia applications. Another feature is that the model converges to a saturated model when the number of stations becomes large. Based on this feature, we introduce a new method to estimate the lower bound of network capacity.</description><identifier>ISSN: 2331-9852</identifier><identifier>ISBN: 1424414563</identifier><identifier>ISBN: 9781424414574</identifier><identifier>ISBN: 1424414571</identifier><identifier>ISBN: 9781424414567</identifier><identifier>EISBN: 9781424414574</identifier><identifier>EISBN: 1424414571</identifier><identifier>DOI: 10.1109/ccnc08.2007.100</identifier><language>eng</language><publisher>IEEE CCP</publisher><subject>Analytical models ; Australia ; Capacity planning ; Mathematical model ; Multiaccess communication ; Predictive models ; Protocols ; Telecommunication traffic ; Throughput ; Traffic control</subject><ispartof>2008 5th IEEE Consumer Communications and Networking Conference, 2008, p.420-424</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4446398$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4446398$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Dao, N.T.</creatorcontrib><creatorcontrib>Malaney, R.A.</creatorcontrib><title>A New Markov Model for Non-Saturated 802.11 Networks</title><title>2008 5th IEEE Consumer Communications and Networking Conference</title><addtitle>CCNC</addtitle><description>In this work, we introduce a new Markov model for the distributed coordination function (DCF) protocol which accurately predicts the network throughput of 802.11 networks under realistic traffic load. Specifically, we provide an improved treatment of the post backoff, the probability of immediate transmission after DIFS, and the probability of having a new packet for transmission after the post backoff. A key feature of our model is the ability to predict the optimal network throughput and the network capacity (in terms of number of stations with acceptable QoS). Knowledge of the network capacity aids to network planning and QoS for multimedia applications. Another feature is that the model converges to a saturated model when the number of stations becomes large. Based on this feature, we introduce a new method to estimate the lower bound of network capacity.</description><subject>Analytical models</subject><subject>Australia</subject><subject>Capacity planning</subject><subject>Mathematical model</subject><subject>Multiaccess communication</subject><subject>Predictive models</subject><subject>Protocols</subject><subject>Telecommunication traffic</subject><subject>Throughput</subject><subject>Traffic control</subject><issn>2331-9852</issn><isbn>1424414563</isbn><isbn>9781424414574</isbn><isbn>1424414571</isbn><isbn>9781424414567</isbn><isbn>9781424414574</isbn><isbn>1424414571</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1jc1OwzAQhI0AiVJy5sDFL5Cw6_XP-lhVUJDacgDOlRO7UmhpkBOoeHsiAXP5NJrRjBDXCBUi-NumOTTAlQJwFQKciMI7Rq20Rm2cPhWX_8bSmZgoIiw9G3Uhir5_g1HaEDNNhJ7JdTrKVci77kuuupj2cttlue4O5XMYPnMYUpQMajwem8Oxy7v-Spxvw75PxR-n4vX-7mX-UC6fFo_z2bJs0ZmhTBYZfAhWeTXSRzKGrbO-DrbhLekUa9ZYGx8VeUyRfQIMOGaWjAOaipvf3TaltPnI7XvI3xuttSXP9AMkSUTq</recordid><startdate>200801</startdate><enddate>200801</enddate><creator>Dao, N.T.</creator><creator>Malaney, R.A.</creator><general>IEEE CCP</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200801</creationdate><title>A New Markov Model for Non-Saturated 802.11 Networks</title><author>Dao, N.T. ; Malaney, R.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e61809aa629209a9d35586769ba6c8f34edb841b59d2391ed89e01a1c8f635703</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Analytical models</topic><topic>Australia</topic><topic>Capacity planning</topic><topic>Mathematical model</topic><topic>Multiaccess communication</topic><topic>Predictive models</topic><topic>Protocols</topic><topic>Telecommunication traffic</topic><topic>Throughput</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Dao, N.T.</creatorcontrib><creatorcontrib>Malaney, R.A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dao, N.T.</au><au>Malaney, R.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A New Markov Model for Non-Saturated 802.11 Networks</atitle><btitle>2008 5th IEEE Consumer Communications and Networking Conference</btitle><stitle>CCNC</stitle><date>2008-01</date><risdate>2008</risdate><spage>420</spage><epage>424</epage><pages>420-424</pages><issn>2331-9852</issn><isbn>1424414563</isbn><isbn>9781424414574</isbn><isbn>1424414571</isbn><isbn>9781424414567</isbn><eisbn>9781424414574</eisbn><eisbn>1424414571</eisbn><abstract>In this work, we introduce a new Markov model for the distributed coordination function (DCF) protocol which accurately predicts the network throughput of 802.11 networks under realistic traffic load. Specifically, we provide an improved treatment of the post backoff, the probability of immediate transmission after DIFS, and the probability of having a new packet for transmission after the post backoff. A key feature of our model is the ability to predict the optimal network throughput and the network capacity (in terms of number of stations with acceptable QoS). Knowledge of the network capacity aids to network planning and QoS for multimedia applications. Another feature is that the model converges to a saturated model when the number of stations becomes large. Based on this feature, we introduce a new method to estimate the lower bound of network capacity.</abstract><pub>IEEE CCP</pub><doi>10.1109/ccnc08.2007.100</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2331-9852
ispartof 2008 5th IEEE Consumer Communications and Networking Conference, 2008, p.420-424
issn 2331-9852
language eng
recordid cdi_ieee_primary_4446398
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Analytical models
Australia
Capacity planning
Mathematical model
Multiaccess communication
Predictive models
Protocols
Telecommunication traffic
Throughput
Traffic control
title A New Markov Model for Non-Saturated 802.11 Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T07%3A08%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20New%20Markov%20Model%20for%20Non-Saturated%20802.11%20Networks&rft.btitle=2008%205th%20IEEE%20Consumer%20Communications%20and%20Networking%20Conference&rft.au=Dao,%20N.T.&rft.date=2008-01&rft.spage=420&rft.epage=424&rft.pages=420-424&rft.issn=2331-9852&rft.isbn=1424414563&rft.isbn_list=9781424414574&rft.isbn_list=1424414571&rft.isbn_list=9781424414567&rft_id=info:doi/10.1109/ccnc08.2007.100&rft_dat=%3Cieee_6IE%3E4446398%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424414574&rft.eisbn_list=1424414571&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4446398&rfr_iscdi=true