An Approximate Analysis of Buffered S-ALOHA in Fading Channels Using Tagged User Analysis
Tagged user analysis (TUA) is a generic approximate method of analyzing random access protocols for finite-user finite-buffer systems. This technique decouples the channel contention behavior from the user queuing behavior and allows the use of classical queuing theory results to be directly applica...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on wireless communications 2007-04, Vol.6 (4), p.1320-1326 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1326 |
---|---|
container_issue | 4 |
container_start_page | 1320 |
container_title | IEEE transactions on wireless communications |
container_volume | 6 |
creator | Rasool, S.B. Sheikh, A.U.H. |
description | Tagged user analysis (TUA) is a generic approximate method of analyzing random access protocols for finite-user finite-buffer systems. This technique decouples the channel contention behavior from the user queuing behavior and allows the use of classical queuing theory results to be directly applicable to the analysis of finite-user finite-buffer random access methods. In this paper, we extend TUA to analyze finite buffer S-ALOHA operating over flat fading radio channels and derive expressions for system performance indices like throughput, average packet delay, blocking probability and queue length. It is shown that for a moderate number of active users, the simulation and analytical results fit closely |
doi_str_mv | 10.1109/TWC.2007.348328 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_pascalfrancis_primary_18688254</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4155671</ieee_id><sourcerecordid>903632463</sourcerecordid><originalsourceid>FETCH-LOGICAL-c413t-31e69590f49af28fbb4a1854596cd8ddbae89c6c71a7690ae34063982d4675203</originalsourceid><addsrcrecordid>eNqFkcFLwzAUh4soOKdnD16CoJ66JXlJmhzrcE4Y7OCGeCpZm8yOrp3JCu6_N2Njggc95YX3vR-890XRNcE9QrDqT98GPYpx0gMmgcqTqEM4lzGlTJ7uahAxoYk4jy68X2JMEsF5J3pPa5Su1675Kld6Y1Ba62rrS48aix5ba40zBXqN0_FklKKyRkNdlPUCDT50XZvKo5nffad6sQjczBt3TLiMzqyuvLk6vN1oNnyaDkbxePL8MkjHcc4IbGIgRiiusGVKWyrtfM40kZxxJfJCFsVcG6lykSdEJ0JhbYBhAUrSgomEUwzd6GGfG5b4bI3fZKvS56aqdG2a1mcKgwDKBPxLSomF4ARIIO__JIExAMxVAG9_gcumdeECIU0wLkEpGaD-Hspd470zNlu7cG23zQjOdu6y4C7bucv27sLE3SFW-1xX1uk6L_3PmBRSUs4Cd7PnSmPMsc2CeJEQ-AZNMJ6N</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>864583998</pqid></control><display><type>article</type><title>An Approximate Analysis of Buffered S-ALOHA in Fading Channels Using Tagged User Analysis</title><source>IEEE Electronic Library (IEL)</source><creator>Rasool, S.B. ; Sheikh, A.U.H.</creator><creatorcontrib>Rasool, S.B. ; Sheikh, A.U.H.</creatorcontrib><description>Tagged user analysis (TUA) is a generic approximate method of analyzing random access protocols for finite-user finite-buffer systems. This technique decouples the channel contention behavior from the user queuing behavior and allows the use of classical queuing theory results to be directly applicable to the analysis of finite-user finite-buffer random access methods. In this paper, we extend TUA to analyze finite buffer S-ALOHA operating over flat fading radio channels and derive expressions for system performance indices like throughput, average packet delay, blocking probability and queue length. It is shown that for a moderate number of active users, the simulation and analytical results fit closely</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2007.348328</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>Piscataway, NJ: IEEE</publisher><subject>Access methods and protocols, osi model ; Access protocols ; Analytical models ; Applied sciences ; Approximation ; Buffers ; Channels ; Delay ; Exact sciences and technology ; Fading ; Mathematical analysis ; Performance analysis ; Queueing analysis ; Queueing theory ; Queues ; Random access ; Rayleigh channels ; State-space methods ; System performance ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Teleprocessing networks. Isdn ; Teletraffic ; Throughput ; Transmission and modulation (techniques and equipments)</subject><ispartof>IEEE transactions on wireless communications, 2007-04, Vol.6 (4), p.1320-1326</ispartof><rights>2007 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c413t-31e69590f49af28fbb4a1854596cd8ddbae89c6c71a7690ae34063982d4675203</citedby><cites>FETCH-LOGICAL-c413t-31e69590f49af28fbb4a1854596cd8ddbae89c6c71a7690ae34063982d4675203</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4155671$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4155671$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18688254$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Rasool, S.B.</creatorcontrib><creatorcontrib>Sheikh, A.U.H.</creatorcontrib><title>An Approximate Analysis of Buffered S-ALOHA in Fading Channels Using Tagged User Analysis</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>Tagged user analysis (TUA) is a generic approximate method of analyzing random access protocols for finite-user finite-buffer systems. This technique decouples the channel contention behavior from the user queuing behavior and allows the use of classical queuing theory results to be directly applicable to the analysis of finite-user finite-buffer random access methods. In this paper, we extend TUA to analyze finite buffer S-ALOHA operating over flat fading radio channels and derive expressions for system performance indices like throughput, average packet delay, blocking probability and queue length. It is shown that for a moderate number of active users, the simulation and analytical results fit closely</description><subject>Access methods and protocols, osi model</subject><subject>Access protocols</subject><subject>Analytical models</subject><subject>Applied sciences</subject><subject>Approximation</subject><subject>Buffers</subject><subject>Channels</subject><subject>Delay</subject><subject>Exact sciences and technology</subject><subject>Fading</subject><subject>Mathematical analysis</subject><subject>Performance analysis</subject><subject>Queueing analysis</subject><subject>Queueing theory</subject><subject>Queues</subject><subject>Random access</subject><subject>Rayleigh channels</subject><subject>State-space methods</subject><subject>System performance</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teleprocessing networks. Isdn</subject><subject>Teletraffic</subject><subject>Throughput</subject><subject>Transmission and modulation (techniques and equipments)</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqFkcFLwzAUh4soOKdnD16CoJ66JXlJmhzrcE4Y7OCGeCpZm8yOrp3JCu6_N2Njggc95YX3vR-890XRNcE9QrDqT98GPYpx0gMmgcqTqEM4lzGlTJ7uahAxoYk4jy68X2JMEsF5J3pPa5Su1675Kld6Y1Ba62rrS48aix5ba40zBXqN0_FklKKyRkNdlPUCDT50XZvKo5nffad6sQjczBt3TLiMzqyuvLk6vN1oNnyaDkbxePL8MkjHcc4IbGIgRiiusGVKWyrtfM40kZxxJfJCFsVcG6lykSdEJ0JhbYBhAUrSgomEUwzd6GGfG5b4bI3fZKvS56aqdG2a1mcKgwDKBPxLSomF4ARIIO__JIExAMxVAG9_gcumdeECIU0wLkEpGaD-Hspd470zNlu7cG23zQjOdu6y4C7bucv27sLE3SFW-1xX1uk6L_3PmBRSUs4Cd7PnSmPMsc2CeJEQ-AZNMJ6N</recordid><startdate>20070401</startdate><enddate>20070401</enddate><creator>Rasool, S.B.</creator><creator>Sheikh, A.U.H.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope><scope>KR7</scope></search><sort><creationdate>20070401</creationdate><title>An Approximate Analysis of Buffered S-ALOHA in Fading Channels Using Tagged User Analysis</title><author>Rasool, S.B. ; Sheikh, A.U.H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c413t-31e69590f49af28fbb4a1854596cd8ddbae89c6c71a7690ae34063982d4675203</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Access methods and protocols, osi model</topic><topic>Access protocols</topic><topic>Analytical models</topic><topic>Applied sciences</topic><topic>Approximation</topic><topic>Buffers</topic><topic>Channels</topic><topic>Delay</topic><topic>Exact sciences and technology</topic><topic>Fading</topic><topic>Mathematical analysis</topic><topic>Performance analysis</topic><topic>Queueing analysis</topic><topic>Queueing theory</topic><topic>Queues</topic><topic>Random access</topic><topic>Rayleigh channels</topic><topic>State-space methods</topic><topic>System performance</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teleprocessing networks. Isdn</topic><topic>Teletraffic</topic><topic>Throughput</topic><topic>Transmission and modulation (techniques and equipments)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rasool, S.B.</creatorcontrib><creatorcontrib>Sheikh, A.U.H.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rasool, S.B.</au><au>Sheikh, A.U.H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Approximate Analysis of Buffered S-ALOHA in Fading Channels Using Tagged User Analysis</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2007-04-01</date><risdate>2007</risdate><volume>6</volume><issue>4</issue><spage>1320</spage><epage>1326</epage><pages>1320-1326</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>Tagged user analysis (TUA) is a generic approximate method of analyzing random access protocols for finite-user finite-buffer systems. This technique decouples the channel contention behavior from the user queuing behavior and allows the use of classical queuing theory results to be directly applicable to the analysis of finite-user finite-buffer random access methods. In this paper, we extend TUA to analyze finite buffer S-ALOHA operating over flat fading radio channels and derive expressions for system performance indices like throughput, average packet delay, blocking probability and queue length. It is shown that for a moderate number of active users, the simulation and analytical results fit closely</abstract><cop>Piscataway, NJ</cop><pub>IEEE</pub><doi>10.1109/TWC.2007.348328</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1536-1276 |
ispartof | IEEE transactions on wireless communications, 2007-04, Vol.6 (4), p.1320-1326 |
issn | 1536-1276 1558-2248 |
language | eng |
recordid | cdi_pascalfrancis_primary_18688254 |
source | IEEE Electronic Library (IEL) |
subjects | Access methods and protocols, osi model Access protocols Analytical models Applied sciences Approximation Buffers Channels Delay Exact sciences and technology Fading Mathematical analysis Performance analysis Queueing analysis Queueing theory Queues Random access Rayleigh channels State-space methods System performance Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Teletraffic Throughput Transmission and modulation (techniques and equipments) |
title | An Approximate Analysis of Buffered S-ALOHA in Fading Channels Using Tagged User Analysis |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-31T00%3A04%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Approximate%20Analysis%20of%20Buffered%20S-ALOHA%20in%20Fading%20Channels%20Using%20Tagged%20User%20Analysis&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Rasool,%20S.B.&rft.date=2007-04-01&rft.volume=6&rft.issue=4&rft.spage=1320&rft.epage=1326&rft.pages=1320-1326&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2007.348328&rft_dat=%3Cproquest_RIE%3E903632463%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=864583998&rft_id=info:pmid/&rft_ieee_id=4155671&rfr_iscdi=true |