Opportunistic medium access in multi-session networks based on cooperative ARQ

M. Mehbodnia, H. Khoshbin, Mahdi Haraty
{"title":"Opportunistic medium access in multi-session networks based on cooperative ARQ","authors":"M. Mehbodnia, H. Khoshbin, Mahdi Haraty","doi":"10.1109/ISTEL.2014.7000888","DOIUrl":null,"url":null,"abstract":"Many wireless systems have leveraged the cooperation of nodes to improve network capacity. However, these approaches have left uncertainty over the performance gain of spatial diversity either with protocol overheads or unrealistic assumptions. Also more practical relay selection algorithm is required to be simple and totally distributed. In this paper, a CSMA-liked queue length based algorithm is proposed that randomly schedules ARQ relays, and involves other sessions to create network coding opportunities in erroneous hyperedges. Through partial data recovery, we exploit the probabilistic nature of wireless reception for joint cooperation, scheduling and ARQ to provide relevant gains (e.g., transmission reliability and opportunity to access to the channel) for both the source and cooperating nodes.","PeriodicalId":417179,"journal":{"name":"7'th International Symposium on Telecommunications (IST'2014)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"7'th International Symposium on Telecommunications (IST'2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2014.7000888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Many wireless systems have leveraged the cooperation of nodes to improve network capacity. However, these approaches have left uncertainty over the performance gain of spatial diversity either with protocol overheads or unrealistic assumptions. Also more practical relay selection algorithm is required to be simple and totally distributed. In this paper, a CSMA-liked queue length based algorithm is proposed that randomly schedules ARQ relays, and involves other sessions to create network coding opportunities in erroneous hyperedges. Through partial data recovery, we exploit the probabilistic nature of wireless reception for joint cooperation, scheduling and ARQ to provide relevant gains (e.g., transmission reliability and opportunity to access to the channel) for both the source and cooperating nodes.
基于协作ARQ的多会话网络中的机会媒体访问
许多无线系统利用节点之间的合作来提高网络容量。然而,这些方法在空间多样性的性能增益上留下了不确定性,要么是协议开销,要么是不切实际的假设。同时也要求更实用的中继选择算法简单、完全分布式。本文提出了一种类似csma的基于队列长度的算法,该算法随机调度ARQ中继,并在错误的超边缘中引入其他会话来创建网络编码机会。通过部分数据恢复,我们利用无线接收的概率特性进行联合合作、调度和ARQ,为源节点和合作节点提供相关收益(例如,传输可靠性和访问信道的机会)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信