Interference Calculation in Asynchronous Random Access Protocols using Diversity
The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet interference calculation in asynchronous Random Access protocols using...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2015-02 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Meloni, Alessio Murroni, Maurizio |
| description | The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet interference calculation in asynchronous Random Access protocols using diversity is presented. The aim is to provide a tool that avoids time-consuming simulations to evaluate packet loss and throughput in case decodability is still possible when a certain interference threshold is not exceeded. Moreover the same model represents the groundbase for further studies in which iterative Interference Cancellation is applied to received frames. |
| doi_str_mv | 10.48550/arxiv.1501.06470 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_1501_06470</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2081779084</sourcerecordid><originalsourceid>FETCH-LOGICAL-a524-68b4a026395a173404fe9eb633d76bf4e6108d474fe0cad45572179baaab2ca23</originalsourceid><addsrcrecordid>eNotj11LwzAYhYMgOOZ-gFcGvO5889W0l2N-DQYO2X15m6aa0SUzaYf799bNqwOHw-F5CLljMJeFUvCI8ccd50wBm0MuNVyRCReCZYXk_IbMUtoBAM81V0pMyGblextbG603li6xM0OHvQueOk8X6eTNVww-DIl-oG_Cni6MsSnRTQx9MKFLdEjOf9Ind7Qxuf50S65b7JKd_eeUbF-et8u3bP3-ulou1hkqLrO8qCWOFKJUyLSQIFtb2joXotF53UqbMygaqccaDDZSKc2ZLmtErLlBLqbk_nJ71q0O0e0xnqo_7eqsPS4eLotDDN-DTX21C0P0I1PFoWBal1BI8QvPrFss</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2081779084</pqid></control><display><type>article</type><title>Interference Calculation in Asynchronous Random Access Protocols using Diversity</title><source>Freely Accessible Journals</source><source>arXiv.org</source><creator>Meloni, Alessio ; Murroni, Maurizio</creator><creatorcontrib>Meloni, Alessio ; Murroni, Maurizio</creatorcontrib><description>The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet interference calculation in asynchronous Random Access protocols using diversity is presented. The aim is to provide a tool that avoids time-consuming simulations to evaluate packet loss and throughput in case decodability is still possible when a certain interference threshold is not exceeded. Moreover the same model represents the groundbase for further studies in which iterative Interference Cancellation is applied to received frames.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.1501.06470</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Information Theory ; Computer Science - Networking and Internet Architecture ; Computer simulation ; Interference ; Iterative methods ; Mathematical models ; Mathematics - Information Theory ; Outsourcing ; Random access</subject><ispartof>arXiv.org, 2015-02</ispartof><rights>2015. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27902</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.1501.06470$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1007/s11235-015-9970-3$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Meloni, Alessio</creatorcontrib><creatorcontrib>Murroni, Maurizio</creatorcontrib><title>Interference Calculation in Asynchronous Random Access Protocols using Diversity</title><title>arXiv.org</title><description>The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet interference calculation in asynchronous Random Access protocols using diversity is presented. The aim is to provide a tool that avoids time-consuming simulations to evaluate packet loss and throughput in case decodability is still possible when a certain interference threshold is not exceeded. Moreover the same model represents the groundbase for further studies in which iterative Interference Cancellation is applied to received frames.</description><subject>Computer Science - Information Theory</subject><subject>Computer Science - Networking and Internet Architecture</subject><subject>Computer simulation</subject><subject>Interference</subject><subject>Iterative methods</subject><subject>Mathematical models</subject><subject>Mathematics - Information Theory</subject><subject>Outsourcing</subject><subject>Random access</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><sourceid>GOX</sourceid><recordid>eNotj11LwzAYhYMgOOZ-gFcGvO5889W0l2N-DQYO2X15m6aa0SUzaYf799bNqwOHw-F5CLljMJeFUvCI8ccd50wBm0MuNVyRCReCZYXk_IbMUtoBAM81V0pMyGblextbG603li6xM0OHvQueOk8X6eTNVww-DIl-oG_Cni6MsSnRTQx9MKFLdEjOf9Ind7Qxuf50S65b7JKd_eeUbF-et8u3bP3-ulou1hkqLrO8qCWOFKJUyLSQIFtb2joXotF53UqbMygaqccaDDZSKc2ZLmtErLlBLqbk_nJ71q0O0e0xnqo_7eqsPS4eLotDDN-DTX21C0P0I1PFoWBal1BI8QvPrFss</recordid><startdate>20150204</startdate><enddate>20150204</enddate><creator>Meloni, Alessio</creator><creator>Murroni, Maurizio</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20150204</creationdate><title>Interference Calculation in Asynchronous Random Access Protocols using Diversity</title><author>Meloni, Alessio ; Murroni, Maurizio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a524-68b4a026395a173404fe9eb633d76bf4e6108d474fe0cad45572179baaab2ca23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Information Theory</topic><topic>Computer Science - Networking and Internet Architecture</topic><topic>Computer simulation</topic><topic>Interference</topic><topic>Iterative methods</topic><topic>Mathematical models</topic><topic>Mathematics - Information Theory</topic><topic>Outsourcing</topic><topic>Random access</topic><toplevel>online_resources</toplevel><creatorcontrib>Meloni, Alessio</creatorcontrib><creatorcontrib>Murroni, Maurizio</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Meloni, Alessio</au><au>Murroni, Maurizio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Interference Calculation in Asynchronous Random Access Protocols using Diversity</atitle><jtitle>arXiv.org</jtitle><date>2015-02-04</date><risdate>2015</risdate><eissn>2331-8422</eissn><abstract>The use of Aloha-based Random Access protocols is interesting when channel sensing is either not possible or not convenient and the traffic from terminals is unpredictable and sporadic. In this paper an analytic model for packet interference calculation in asynchronous Random Access protocols using diversity is presented. The aim is to provide a tool that avoids time-consuming simulations to evaluate packet loss and throughput in case decodability is still possible when a certain interference threshold is not exceeded. Moreover the same model represents the groundbase for further studies in which iterative Interference Cancellation is applied to received frames.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.1501.06470</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2015-02 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_1501_06470 |
| source | Freely Accessible Journals; arXiv.org |
| subjects | Computer Science - Information Theory Computer Science - Networking and Internet Architecture Computer simulation Interference Iterative methods Mathematical models Mathematics - Information Theory Outsourcing Random access |
| title | Interference Calculation in Asynchronous Random Access Protocols using Diversity |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T13%3A46%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Interference%20Calculation%20in%20Asynchronous%20Random%20Access%20Protocols%20using%20Diversity&rft.jtitle=arXiv.org&rft.au=Meloni,%20Alessio&rft.date=2015-02-04&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.1501.06470&rft_dat=%3Cproquest_arxiv%3E2081779084%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2081779084&rft_id=info:pmid/&rfr_iscdi=true |