Implementation of the maximum packing channel assignment algorithm in cellular networks

A. Kulshreshtha, K. Sivarajan
{"title":"Implementation of the maximum packing channel assignment algorithm in cellular networks","authors":"A. Kulshreshtha, K. Sivarajan","doi":"10.1109/ICPWC.1997.655485","DOIUrl":null,"url":null,"abstract":"The maximum packing algorithm (MPA) is a greedy algorithm, that rejects a call only when it is forced to do so, even if this involves rearrangement of channels assigned to the ongoing calls, without dropping any of them. This paper mainly concentrates on the performance of this algorithm in terms of the total carried traffic. We model the channel reuse constraints in the cellular network by a hypergraph. Previously (1996) we demonstrated the optimality of MPA for low and moderate offered traffic in the system. In this paper, we envisage MPA as a practical channel assignment algorithm, for moderate sized systems, and suggest a good strategy to implement it. We comment on the complexity of the algorithm and suggest approximations to reduce it.","PeriodicalId":166667,"journal":{"name":"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1997 IEEE International Conference on Personal Wireless Communications (Cat. No.97TH8338)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPWC.1997.655485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The maximum packing algorithm (MPA) is a greedy algorithm, that rejects a call only when it is forced to do so, even if this involves rearrangement of channels assigned to the ongoing calls, without dropping any of them. This paper mainly concentrates on the performance of this algorithm in terms of the total carried traffic. We model the channel reuse constraints in the cellular network by a hypergraph. Previously (1996) we demonstrated the optimality of MPA for low and moderate offered traffic in the system. In this paper, we envisage MPA as a practical channel assignment algorithm, for moderate sized systems, and suggest a good strategy to implement it. We comment on the complexity of the algorithm and suggest approximations to reduce it.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
蜂窝网络中最大打包信道分配算法的实现
最大打包算法(MPA)是一种贪婪算法,它只在被迫这样做时才拒绝调用,即使这涉及到重新排列分配给正在进行的调用的信道,也不会丢弃它们。本文主要研究了该算法在总承载流量方面的性能。我们利用超图对蜂窝网络中的信道复用约束进行建模。之前(1996年)我们证明了MPA对于系统中低流量和中等流量的最优性。在本文中,我们设想MPA是一个实用的信道分配算法,适用于中等规模的系统,并提出了一个很好的策略来实现它。我们评论了算法的复杂性,并建议近似来降低它。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Design of a personal communication services network (PCSN) for optimum location area size A flexible and fast event-driven simulator for wireless MAC protocols A hybrid TDMA/CDMA mobile cellular system using complementary code sets as multiple access codes Wireless technology-a skyway to the future Equalization for multipulse modulation
×
引用
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