Call admission control scheme using borrowable guard channels and prioritizing fresh calls retrials in small cell networks

Ahmed Alioua, Nawel Gharbi, S. Senouci
{"title":"Call admission control scheme using borrowable guard channels and prioritizing fresh calls retrials in small cell networks","authors":"Ahmed Alioua, Nawel Gharbi, S. Senouci","doi":"10.1109/GIIS.2014.6934256","DOIUrl":null,"url":null,"abstract":"Recent trends in mobile cellular networks turn towards deployment of Small Cell Networks (SCNs), where, the cell size gets smaller, and thus the number of subscribers served in a cell will be relatively smaller, such that traffic models with a finite source of subscribers should be considered. Smaller cells cause the mobile subscribers to cross several cells during an ongoing conversation resulting in frequent handovers. Most of works dealing with Call Admission Control (CAC) problems based on guard channels scheme in cellular mobile networks consider models without retrials (reapeted calls phenomenon). However, almost all existing works which take into account retrial consider an infinite population cell resulting in multi-servers retrial queueing model, for which the analytical solution is not available. In this paper, we propose to use the Generalized Stochastic Petri Nets (GSPNs) formalism as a novel alternative to investigate a new CAC strategy with retrial policy of fresh and handover calls generated by a finite population of subscribers, based on prioritization of retrial calls and adopting a guard channels borrowing concept, operating in SCNs. Performance evaluation shows that our approach is more efficient compared to basic guard channel scheme with better blocking probability, especially for low to medium handover calls rates.","PeriodicalId":392180,"journal":{"name":"2014 Global Information Infrastructure and Networking Symposium (GIIS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Global Information Infrastructure and Networking Symposium (GIIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GIIS.2014.6934256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Recent trends in mobile cellular networks turn towards deployment of Small Cell Networks (SCNs), where, the cell size gets smaller, and thus the number of subscribers served in a cell will be relatively smaller, such that traffic models with a finite source of subscribers should be considered. Smaller cells cause the mobile subscribers to cross several cells during an ongoing conversation resulting in frequent handovers. Most of works dealing with Call Admission Control (CAC) problems based on guard channels scheme in cellular mobile networks consider models without retrials (reapeted calls phenomenon). However, almost all existing works which take into account retrial consider an infinite population cell resulting in multi-servers retrial queueing model, for which the analytical solution is not available. In this paper, we propose to use the Generalized Stochastic Petri Nets (GSPNs) formalism as a novel alternative to investigate a new CAC strategy with retrial policy of fresh and handover calls generated by a finite population of subscribers, based on prioritization of retrial calls and adopting a guard channels borrowing concept, operating in SCNs. Performance evaluation shows that our approach is more efficient compared to basic guard channel scheme with better blocking probability, especially for low to medium handover calls rates.
基于可借保护信道和优先级的小蜂窝网络呼叫接纳控制方案
移动蜂窝网络的最新趋势转向小型蜂窝网络(scn)的部署,其中,小区规模越来越小,因此在小区中服务的用户数量将相对较少,因此应考虑具有有限用户来源的流量模型。较小的蜂窝导致移动用户在正在进行的会话中跨越多个蜂窝,从而导致频繁的切换。在蜂窝移动网络中,基于保护信道方案的呼叫接纳控制(CAC)问题的研究大多考虑无重审(重复呼叫现象)的模型。然而,现有的考虑重审的研究几乎都是考虑无限种群单元导致的多服务器重审排队模型,其解析解是不可用的。在本文中,我们提出使用广义随机Petri网(gspn)形式主义作为一种新的替代方案来研究一种新的CAC策略,该策略基于重审呼叫的优先级并采用保护通道借用概念,在scn中运行,具有由有限用户群体产生的新鲜和切换呼叫的重审策略。性能评估表明,与基本保护通道方案相比,该方法具有更好的阻塞概率,特别是在中低切换呼叫率下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信