元胞系统中动态邻居元胞表规划的概念

H. Olofsson, S. Magnusson, M. Almgren
{"title":"元胞系统中动态邻居元胞表规划的概念","authors":"H. Olofsson, S. Magnusson, M. Almgren","doi":"10.1109/PIMRC.1996.567532","DOIUrl":null,"url":null,"abstract":"In the near future, capacity needs will lead to cellular systems with a complex mixture of cells with different sizes and unpredictable coverage areas. Such complex systems will increase the need for manual radio network planning dramatically, unless intelligent tools are developed to assist in the planning. This paper addresses the problem of determining which cells are neighbors to a certain cell in a TDMA system. At present this has to be manually determined for each cell in a system. A concept is proposed where the neighbor cell lists are dynamically planned during system operation, with little or no manual assistance. The proposed class of algorithms uses information about the long term network behavior, and the neighbor cell lists are continuously updated. The proposed concept considerably reduces manual planning, and simulation results show that the scheme also improves the overall system quality by reducing the length of the neighbor cell lists.","PeriodicalId":206655,"journal":{"name":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"42","resultStr":"{\"title\":\"A concept for dynamic neighbor cell list planning in a cellular system\",\"authors\":\"H. Olofsson, S. Magnusson, M. Almgren\",\"doi\":\"10.1109/PIMRC.1996.567532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the near future, capacity needs will lead to cellular systems with a complex mixture of cells with different sizes and unpredictable coverage areas. Such complex systems will increase the need for manual radio network planning dramatically, unless intelligent tools are developed to assist in the planning. This paper addresses the problem of determining which cells are neighbors to a certain cell in a TDMA system. At present this has to be manually determined for each cell in a system. A concept is proposed where the neighbor cell lists are dynamically planned during system operation, with little or no manual assistance. The proposed class of algorithms uses information about the long term network behavior, and the neighbor cell lists are continuously updated. The proposed concept considerably reduces manual planning, and simulation results show that the scheme also improves the overall system quality by reducing the length of the neighbor cell lists.\",\"PeriodicalId\":206655,\"journal\":{\"name\":\"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"42\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.1996.567532\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.1996.567532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 42

摘要

在不久的将来,容量需求将导致蜂窝系统具有不同大小和不可预测覆盖区域的复杂混合蜂窝。除非开发出智能工具来协助规划,否则这种复杂的系统将大大增加对手动无线网络规划的需求。本文解决了在时分多址系统中确定哪些小区是某个小区的邻居的问题。目前,这必须手动确定系统中的每个单元。提出了一个在系统运行过程中动态规划邻居单元列表的概念,很少或不需要人工帮助。所提出的这类算法使用关于长期网络行为的信息,并且邻居单元列表不断更新。提出的概念大大减少了人工规划,仿真结果表明,该方案还通过减少邻居单元列表的长度来提高系统的整体质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A concept for dynamic neighbor cell list planning in a cellular system
In the near future, capacity needs will lead to cellular systems with a complex mixture of cells with different sizes and unpredictable coverage areas. Such complex systems will increase the need for manual radio network planning dramatically, unless intelligent tools are developed to assist in the planning. This paper addresses the problem of determining which cells are neighbors to a certain cell in a TDMA system. At present this has to be manually determined for each cell in a system. A concept is proposed where the neighbor cell lists are dynamically planned during system operation, with little or no manual assistance. The proposed class of algorithms uses information about the long term network behavior, and the neighbor cell lists are continuously updated. The proposed concept considerably reduces manual planning, and simulation results show that the scheme also improves the overall system quality by reducing the length of the neighbor cell lists.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信