Analysis of robust collision resolution algorithm with successive interference cancellation and bursty arrivals

S. Andreev, E. Pustovalov, A. Turlikov
{"title":"Analysis of robust collision resolution algorithm with successive interference cancellation and bursty arrivals","authors":"S. Andreev, E. Pustovalov, A. Turlikov","doi":"10.1109/ITST.2011.6060159","DOIUrl":null,"url":null,"abstract":"A novel tree multiple access algorithm is discussed, which is robust to imperfect successive interference cancellation. The algorithm exploits a single memory location to store the captured packets and thus has feasible complexity. For this algorithm, the performance evaluation is conducted, which focuses on its transmission rate and mean packet delay. Both virtual and actual delays are established analytically. Additionally to Poisson arrivals, bursty arrival model is considered and the analysis is extended respectively. The results are new and important to conclude upon the efficiency of the proposed algorithm.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"447 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Conference on ITS Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2011.6060159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A novel tree multiple access algorithm is discussed, which is robust to imperfect successive interference cancellation. The algorithm exploits a single memory location to store the captured packets and thus has feasible complexity. For this algorithm, the performance evaluation is conducted, which focuses on its transmission rate and mean packet delay. Both virtual and actual delays are established analytically. Additionally to Poisson arrivals, bursty arrival model is considered and the analysis is extended respectively. The results are new and important to conclude upon the efficiency of the proposed algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有连续干扰抵消和突发到达的鲁棒碰撞解决算法分析
讨论了一种新的树形多址算法,该算法对不完全连续干扰消除具有鲁棒性。该算法利用单个存储位置来存储捕获的数据包,因此具有可行的复杂度。对该算法进行了性能评价,重点对其传输速率和平均包延迟进行了评价。通过分析确定了虚拟延迟和实际延迟。在泊松到达模型的基础上,分别考虑了突发到达模型并对其进行了扩展。这些结果是新的,对该算法的有效性有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
From user wishes to system architecture safety for children going to and from school by bus An efficient destination-based data management policy for vehicular networks Joint IP networking and radio architecture for vehicular networks Navigation without GPS: Fake location for mobile phone tracking Analysis of robust collision resolution algorithm with successive interference cancellation and bursty arrivals
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1