Dynamic Adaptive Access Barring Scheme For Heavily Congested M2M Networks

Meriam Bouzouita, Y. H. Aoul, N. Zangar, G. Rubino, S. Tabbane
{"title":"Dynamic Adaptive Access Barring Scheme For Heavily Congested M2M Networks","authors":"Meriam Bouzouita, Y. H. Aoul, N. Zangar, G. Rubino, S. Tabbane","doi":"10.1145/2988287.2989174","DOIUrl":null,"url":null,"abstract":"The massive deployment of Machine-to-machine (M2M) communications may overwhelm the cellular network by imposing strong constraints on the Radio Access Network (RAN). As the base station cannot accurately get the exact number of M2M arrivals, it cannot really predict the overload status. Consequently, a better estimation of this number would efficiently help to overcome the risk of congestion. In this paper, we proposed a novel fluid model for M2M communications, which allows gaining an enhanced understanding of the dynamics of such systems. The provided analysis of the model was used to devise a new method to estimate accurately the number of M2M devices. We proposed, then, a novel implementation of the ACB process, which dynamically computes the ACB factor according to the network's overload conditions while includes a corrective action adapting the controller action based on the mismatch existing between the computed and the targeted mean load. The simulation results show that the proposed algorithms allow improving considerably the estimation of the number of M2M devices' arrivals, while outperforming existing techniques.","PeriodicalId":158785,"journal":{"name":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2988287.2989174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The massive deployment of Machine-to-machine (M2M) communications may overwhelm the cellular network by imposing strong constraints on the Radio Access Network (RAN). As the base station cannot accurately get the exact number of M2M arrivals, it cannot really predict the overload status. Consequently, a better estimation of this number would efficiently help to overcome the risk of congestion. In this paper, we proposed a novel fluid model for M2M communications, which allows gaining an enhanced understanding of the dynamics of such systems. The provided analysis of the model was used to devise a new method to estimate accurately the number of M2M devices. We proposed, then, a novel implementation of the ACB process, which dynamically computes the ACB factor according to the network's overload conditions while includes a corrective action adapting the controller action based on the mismatch existing between the computed and the targeted mean load. The simulation results show that the proposed algorithms allow improving considerably the estimation of the number of M2M devices' arrivals, while outperforming existing techniques.
重度拥塞M2M网络的动态自适应接入限制方案
机器对机器(M2M)通信的大规模部署可能会对无线接入网(RAN)施加强大的限制,从而使蜂窝网络不堪重负。由于基站无法准确得到M2M到达的确切数量,因此无法真正预测过载状态。因此,更好地估计这个数字将有效地帮助克服拥堵的风险。在本文中,我们提出了一种新的M2M通信流体模型,该模型可以增强对此类系统动力学的理解。利用所提供的模型分析,设计了一种新的方法来准确估计M2M设备的数量。然后,我们提出了一种新的ACB过程实现,该过程根据网络的过载条件动态计算ACB因子,同时包含基于计算结果与目标平均负载之间存在的不匹配而适应控制器动作的校正动作。仿真结果表明,所提出的算法大大提高了对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学术官方微信