On an Efficient Random Access Scheme for Capillary Machine Type Communication

K. Ashrafuzzaman, A. Fapojuwo
{"title":"On an Efficient Random Access Scheme for Capillary Machine Type Communication","authors":"K. Ashrafuzzaman, A. Fapojuwo","doi":"10.1109/LCN.2016.21","DOIUrl":null,"url":null,"abstract":"In capillary machine type communications, random multi-access lends itself as a natural choice at the link layer due to the largely intermittent, event-driven traffic involved. A major challenge to that end arises, however, from the anticipated large scale of the network. Considering a carrier sense multiple access based random access protocol where infrastructural support is available in the form of a coordinator node, this paper presents a framework to help sustain efficient protocol performance when faced with temporal variation in packet traffic. The coordinator dynamically determines a timely contention parameter by means of an online algorithm based on certain analytic characterizations of the protocol performance, and the end-nodes get opportunistically notified of it. Throughput, fairness and delay-variation performance produced by the proposed scheme turns out to be consistently close to an optimal protocol in identical settings, in contrast with that of the binary exponential backoff based solutions.","PeriodicalId":6864,"journal":{"name":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","volume":"17 1","pages":"95-103"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 41st Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2016.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In capillary machine type communications, random multi-access lends itself as a natural choice at the link layer due to the largely intermittent, event-driven traffic involved. A major challenge to that end arises, however, from the anticipated large scale of the network. Considering a carrier sense multiple access based random access protocol where infrastructural support is available in the form of a coordinator node, this paper presents a framework to help sustain efficient protocol performance when faced with temporal variation in packet traffic. The coordinator dynamically determines a timely contention parameter by means of an online algorithm based on certain analytic characterizations of the protocol performance, and the end-nodes get opportunistically notified of it. Throughput, fairness and delay-variation performance produced by the proposed scheme turns out to be consistently close to an optimal protocol in identical settings, in contrast with that of the binary exponential backoff based solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种高效的毛细机型通信随机接入方案
在毛细管机器类型的通信中,随机多址是链路层的自然选择,因为涉及到大量间歇性的、事件驱动的通信。然而,这方面的一个主要挑战来自预期的大规模网络。考虑基于载波感知的多址随机访问协议,其中基础设施支持以协调节点的形式提供,本文提出了一个框架,以帮助在面对分组流量的时间变化时保持有效的协议性能。协调器根据协议性能的某些分析特征,通过在线算法动态确定一个及时的争用参数,并机会地通知终端节点。与基于二进制指数回退的解决方案相比,该方案产生的吞吐量、公平性和延迟变化性能在相同设置下始终接近于最优协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the General Chair Message from the general chair Best of Both Worlds: Prioritizing Network Coding without Increased Space Complexity Controlling Network Latency in Mixed Hadoop Clusters: Do We Need Active Queue Management? TransFetch: A Viewing Behavior Driven Video Distribution Framework in Public Transport
×
引用
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