移动蜂窝网络自适应分布式信道分配策略

G. Cao, M. Singhal
{"title":"移动蜂窝网络自适应分布式信道分配策略","authors":"G. Cao, M. Singhal","doi":"10.1109/PCCC.1999.749418","DOIUrl":null,"url":null,"abstract":"There are two approaches to design a distributed channel allocation algorithm: Search and Update. The update approach has shorter acquisition delay and lower call blocking rate, but higher message complexity. On the other hand, the search approach has lower message complexity, but longer acquisition delay and higher call blocking rate. In this paper, we propose a novel distributed acquisition algorithm, which has similar message complexity as the search approach and similar acquisition delay as the update approach. Also, we propose a channel selection algorithm, which has low call blocking rate and low intra-handoff overhead. By integrating the channel selection algorithm into our channel acquisition algorithm, we get a complete distributed channel allocation algorithm. By keeping the borrowed channels, our channel allocation algorithm adapts to the network traffic; i.e., free channels are transferred to hot cells to achieve load balance. Simulation results show that our algorithm significantly outperforms the search approach and the update approach in terms of call blocking rate, message complexity, and acquisition delay.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"40","resultStr":"{\"title\":\"An adaptive distributed channel allocation strategy for mobile cellular networks\",\"authors\":\"G. Cao, M. Singhal\",\"doi\":\"10.1109/PCCC.1999.749418\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are two approaches to design a distributed channel allocation algorithm: Search and Update. The update approach has shorter acquisition delay and lower call blocking rate, but higher message complexity. On the other hand, the search approach has lower message complexity, but longer acquisition delay and higher call blocking rate. In this paper, we propose a novel distributed acquisition algorithm, which has similar message complexity as the search approach and similar acquisition delay as the update approach. Also, we propose a channel selection algorithm, which has low call blocking rate and low intra-handoff overhead. By integrating the channel selection algorithm into our channel acquisition algorithm, we get a complete distributed channel allocation algorithm. By keeping the borrowed channels, our channel allocation algorithm adapts to the network traffic; i.e., free channels are transferred to hot cells to achieve load balance. Simulation results show that our algorithm significantly outperforms the search approach and the update approach in terms of call blocking rate, message complexity, and acquisition delay.\",\"PeriodicalId\":211210,\"journal\":{\"name\":\"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)\",\"volume\":\"254 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"40\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1999.749418\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1999.749418","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 40

摘要

设计分布式信道分配算法有两种方法:搜索和更新。更新方法具有较短的获取延迟和较低的呼叫阻塞率,但消息复杂度较高。另一方面,搜索方法具有较低的消息复杂度,但较长的获取延迟和较高的呼叫阻塞率。在本文中,我们提出了一种新的分布式获取算法,该算法具有与搜索方法相似的消息复杂度和与更新方法相似的获取延迟。此外,我们还提出了一种具有低呼叫阻塞率和低内切换开销的信道选择算法。将信道选择算法集成到信道获取算法中,得到完整的分布式信道分配算法。通过保留借来的信道,我们的信道分配算法可以适应网络流量;即,空闲通道被转移到热单元以实现负载平衡。仿真结果表明,该算法在呼叫阻塞率、消息复杂度和获取延迟方面明显优于搜索方法和更新方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An adaptive distributed channel allocation strategy for mobile cellular networks
There are two approaches to design a distributed channel allocation algorithm: Search and Update. The update approach has shorter acquisition delay and lower call blocking rate, but higher message complexity. On the other hand, the search approach has lower message complexity, but longer acquisition delay and higher call blocking rate. In this paper, we propose a novel distributed acquisition algorithm, which has similar message complexity as the search approach and similar acquisition delay as the update approach. Also, we propose a channel selection algorithm, which has low call blocking rate and low intra-handoff overhead. By integrating the channel selection algorithm into our channel acquisition algorithm, we get a complete distributed channel allocation algorithm. By keeping the borrowed channels, our channel allocation algorithm adapts to the network traffic; i.e., free channels are transferred to hot cells to achieve load balance. Simulation results show that our algorithm significantly outperforms the search approach and the update approach in terms of call blocking rate, message complexity, and acquisition delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信