Offloading Channel Allocation to Terminals in High-Density IoTs for Next Generation Networks

Haitao Zhao, Qiangjian Dong, Luo Chen, Yongxiang Liu, Honghu Hua
{"title":"Offloading Channel Allocation to Terminals in High-Density IoTs for Next Generation Networks","authors":"Haitao Zhao, Qiangjian Dong, Luo Chen, Yongxiang Liu, Honghu Hua","doi":"10.1109/iccomm.2018.8484836","DOIUrl":null,"url":null,"abstract":"Machine-to-Machine (M2M) communications in high-density Internet of Things (IoTs) pose significant challenges in accessing the wireless channel for concurrent transmissions. In this scenario, the channel allocation plays a crucial role, which usually involves a centralized coordination (such as a base station). With the increasing number of edge terminals as well as the dynamic network environment, the computation and information exchange for the centralized channel allocation would be a big burden for the coordination. In this paper, we tackle this challenging problem by proposing a distributed channel allocation method with blind rendezvous to enable collision-free concurrent transmission over multiple channels. Specifically, we first present a receiver-oriented channel allocation algorithm to reduce interference and then focus on a receiver-wait sender-jump blind channel rendezvous algorithm based on channel hopping techniques. The proposed channel allocation method allows each sender-receiver pair to obtain an appropriate channel for transmission without interfering other pairs, in a distributed manner. This study may help network researchers to contribute in the development of next generation high-density IoTs.","PeriodicalId":158890,"journal":{"name":"2018 International Conference on Communications (COMM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Communications (COMM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccomm.2018.8484836","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Machine-to-Machine (M2M) communications in high-density Internet of Things (IoTs) pose significant challenges in accessing the wireless channel for concurrent transmissions. In this scenario, the channel allocation plays a crucial role, which usually involves a centralized coordination (such as a base station). With the increasing number of edge terminals as well as the dynamic network environment, the computation and information exchange for the centralized channel allocation would be a big burden for the coordination. In this paper, we tackle this challenging problem by proposing a distributed channel allocation method with blind rendezvous to enable collision-free concurrent transmission over multiple channels. Specifically, we first present a receiver-oriented channel allocation algorithm to reduce interference and then focus on a receiver-wait sender-jump blind channel rendezvous algorithm based on channel hopping techniques. The proposed channel allocation method allows each sender-receiver pair to obtain an appropriate channel for transmission without interfering other pairs, in a distributed manner. This study may help network researchers to contribute in the development of next generation high-density IoTs.
面向下一代网络的高密度物联网终端卸载信道分配
高密度物联网(iot)中的机器对机器(M2M)通信在访问无线信道以进行并发传输方面提出了重大挑战。在这种情况下,信道分配起着至关重要的作用,它通常涉及集中协调(例如基站)。随着边缘终端数量的不断增加和网络环境的不断变化,集中信道分配的计算和信息交换给协调带来了很大的负担。在本文中,我们提出了一种基于盲交会的分布式信道分配方法,以实现多信道无冲突并发传输。具体来说,我们首先提出了一种面向接收机的信道分配算法来减少干扰,然后重点研究了一种基于信道跳变技术的接收机-等待发送端-跳变盲信道交会算法。所提出的信道分配方法允许每个发送-接收对以分布式方式在不干扰其他对的情况下获得适当的信道进行传输。本研究将有助于网络研究人员为下一代高密度物联网的发展做出贡献。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信