基于矩阵的图着色算法的LTE-PCI分配与重分配缩减

Mohanad Mohammed Abdulkareem, Shadha Adnan Yaseen, L. M. Abdullah
{"title":"基于矩阵的图着色算法的LTE-PCI分配与重分配缩减","authors":"Mohanad Mohammed Abdulkareem, Shadha Adnan Yaseen, L. M. Abdullah","doi":"10.1109/ICSGRC.2017.8070565","DOIUrl":null,"url":null,"abstract":"Physical Cell Identity (PCI) has an essential role in the operation of the Long-Term Evolution network (LTE/LTE-A), and is specifically used to identify cells in the network. An improper PCI assignment might lead to cell conflict with undesirable consequences. To solve the aforementioned PCI's challenges, this paper presents a new graph-coloring algorithm called the Matrix Based algorithm that provides optimized solutions for PCI problems. To evaluate the algorithm's robustness, its performance has compared to another graph-coloring algorithm namely, DASTUR in terms of PCI reassignment and re-configuration. The result shows the superiority of the Matrix Based algorithm compared to DASTUR.","PeriodicalId":182418,"journal":{"name":"2017 IEEE 8th Control and System Graduate Research Colloquium (ICSGRC)","volume":" 14","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Matrix based graph coloring algorithm for LTE-PCI assignment and reassignment reduction\",\"authors\":\"Mohanad Mohammed Abdulkareem, Shadha Adnan Yaseen, L. M. Abdullah\",\"doi\":\"10.1109/ICSGRC.2017.8070565\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Physical Cell Identity (PCI) has an essential role in the operation of the Long-Term Evolution network (LTE/LTE-A), and is specifically used to identify cells in the network. An improper PCI assignment might lead to cell conflict with undesirable consequences. To solve the aforementioned PCI's challenges, this paper presents a new graph-coloring algorithm called the Matrix Based algorithm that provides optimized solutions for PCI problems. To evaluate the algorithm's robustness, its performance has compared to another graph-coloring algorithm namely, DASTUR in terms of PCI reassignment and re-configuration. The result shows the superiority of the Matrix Based algorithm compared to DASTUR.\",\"PeriodicalId\":182418,\"journal\":{\"name\":\"2017 IEEE 8th Control and System Graduate Research Colloquium (ICSGRC)\",\"volume\":\" 14\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 8th Control and System Graduate Research Colloquium (ICSGRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSGRC.2017.8070565\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 8th Control and System Graduate Research Colloquium (ICSGRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSGRC.2017.8070565","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

物理蜂窝身份(Physical Cell Identity, PCI)在长期演进网络(LTE/LTE- a)的运行中起着至关重要的作用,专门用于识别网络中的蜂窝。不适当的PCI分配可能导致单元冲突和不良后果。为了解决上述PCI所面临的挑战,本文提出了一种新的基于矩阵的图形着色算法,该算法为PCI问题提供了优化的解决方案。为了评估该算法的鲁棒性,将其性能与另一种图形着色算法即DASTUR在PCI重新分配和重新配置方面进行了比较。结果表明,与DASTUR算法相比,基于矩阵的算法具有优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Matrix based graph coloring algorithm for LTE-PCI assignment and reassignment reduction
Physical Cell Identity (PCI) has an essential role in the operation of the Long-Term Evolution network (LTE/LTE-A), and is specifically used to identify cells in the network. An improper PCI assignment might lead to cell conflict with undesirable consequences. To solve the aforementioned PCI's challenges, this paper presents a new graph-coloring algorithm called the Matrix Based algorithm that provides optimized solutions for PCI problems. To evaluate the algorithm's robustness, its performance has compared to another graph-coloring algorithm namely, DASTUR in terms of PCI reassignment and re-configuration. The result shows the superiority of the Matrix Based algorithm compared to DASTUR.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信