利用工作记忆容量使ALOHA智能化

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Ad Hoc & Sensor Wireless Networks Pub Date : 2022-10-24 DOI:10.1145/3551663.3558592
J. Garcia-Luna-Aceves, Dylan Cirimelli-Low, Shedieh Homayon
{"title":"利用工作记忆容量使ALOHA智能化","authors":"J. Garcia-Luna-Aceves, Dylan Cirimelli-Low, Shedieh Homayon","doi":"10.1145/3551663.3558592","DOIUrl":null,"url":null,"abstract":"ALOHA with priority acknowledgments (ACK) is transformed into a collision-free channel access method by increasing the amount of working memory capacity with which communicating nodes remember each node that has requested to join the channel successfully. This results in ALOHA-NUI, for neighborhood understood index. The throughput of ALOHA-NUI is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA with priority ACK's, and CSMA with priority ACK's analytically and by simulation. ALOHA-NUI is shown to attain the high throughput of collision-free transmission scheduling methods that usually require clock synchronization while maintaining most of the simplicity of ALOHA with priority ACK's.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":"42 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2022-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Making ALOHA Intelligent Taking Advantage of Working Memory Capacity\",\"authors\":\"J. Garcia-Luna-Aceves, Dylan Cirimelli-Low, Shedieh Homayon\",\"doi\":\"10.1145/3551663.3558592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ALOHA with priority acknowledgments (ACK) is transformed into a collision-free channel access method by increasing the amount of working memory capacity with which communicating nodes remember each node that has requested to join the channel successfully. This results in ALOHA-NUI, for neighborhood understood index. The throughput of ALOHA-NUI is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA with priority ACK's, and CSMA with priority ACK's analytically and by simulation. ALOHA-NUI is shown to attain the high throughput of collision-free transmission scheduling methods that usually require clock synchronization while maintaining most of the simplicity of ALOHA with priority ACK's.\",\"PeriodicalId\":55557,\"journal\":{\"name\":\"Ad Hoc & Sensor Wireless Networks\",\"volume\":\"42 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2022-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc & Sensor Wireless Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3551663.3558592\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc & Sensor Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3551663.3558592","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

摘要

具有优先级确认(ACK)的ALOHA通过增加工作内存容量将转换为无冲突的通道访问方法,通信节点可以使用该工作内存容量记住请求成功加入通道的每个节点。这就产生了ALOHA-NUI,即邻里理解指数。将ALOHA- nui的吞吐量与固定传输调度的TDMA、具有优先级ACK的ALOHA和具有优先级ACK的CSMA的吞吐量进行了分析和仿真比较。ALOHA- nui被证明可以实现通常需要时钟同步的无冲突传输调度方法的高吞吐量,同时保持ALOHA具有优先级ACK的大部分简单性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Making ALOHA Intelligent Taking Advantage of Working Memory Capacity
ALOHA with priority acknowledgments (ACK) is transformed into a collision-free channel access method by increasing the amount of working memory capacity with which communicating nodes remember each node that has requested to join the channel successfully. This results in ALOHA-NUI, for neighborhood understood index. The throughput of ALOHA-NUI is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA with priority ACK's, and CSMA with priority ACK's analytically and by simulation. ALOHA-NUI is shown to attain the high throughput of collision-free transmission scheduling methods that usually require clock synchronization while maintaining most of the simplicity of ALOHA with priority ACK's.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ad Hoc & Sensor Wireless Networks
Ad Hoc & Sensor Wireless Networks 工程技术-电信学
CiteScore
2.00
自引率
44.40%
发文量
0
审稿时长
8 months
期刊介绍: Ad Hoc & Sensor Wireless Networks seeks to provide an opportunity for researchers from computer science, engineering and mathematical backgrounds to disseminate and exchange knowledge in the rapidly emerging field of ad hoc and sensor wireless networks. It will comprehensively cover physical, data-link, network and transport layers, as well as application, security, simulation and power management issues in sensor, local area, satellite, vehicular, personal, and mobile ad hoc networks.
期刊最新文献
Enumeration of the Number of Spanning Trees of the Globe Network and its Subdivision A HYBRID OPTIMIZATION ALGORITHMS FOR SOLVING METRIC DIMENSION PROBLEM Detecting Malicious Use of DoH Tunnels Using Statistical Traffic Analysis RPL+: An Improved Parent Selection Strategy for RPL in Wireless Smart Grid Networks Prototype of deployment of Federated Learning with IoT devices
×
引用
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