Evolutionary algorithm for cost reduction in cellular network

S. Parija, P. K. Sahu, S. S. Singh
{"title":"Evolutionary algorithm for cost reduction in cellular network","authors":"S. Parija, P. K. Sahu, S. S. Singh","doi":"10.1109/INDICON.2014.7030436","DOIUrl":null,"url":null,"abstract":"Mobility management is a prime issue in a wireless computing environment. There is a need to develop various algorithms that could capture this complexity and used to solve the mobility management scenarios. When a mobile user moves from one cell to another cell some amount of cost is acquired for the same. These cells are assigned as either “reporting cell” or “non-reporting cell”, also known as reporting cell planning problem (RCP). In this paper, to reduce the total cost, two optimization techniques are adopted and compared to solve the problem. Total cost in location management signifies location update cost and paging cost. Two optimization algorithms needed to capture the issue are Genetic Algorithm (GA) and Binary Particle Swarm Optimization Algorithm (BPSO) which is also compared to measure the performance in terms of cost. For the same problem BPSO is shown to outperform GA in terms of quality of solution and also proved to be efficient in a competitive approach for the several benchmark issues. The simulation results also indicate BPSO is robust, gives higher solution quality and offers faster global convergence. These proposed techniques are also validated on service data and compared with the synthetic data of the different subscribers present in different reporting cells. A number of optimization problems are solved using this evolutionary algorithm and results obtained are quite satisfactory.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Annual IEEE India Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON.2014.7030436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Mobility management is a prime issue in a wireless computing environment. There is a need to develop various algorithms that could capture this complexity and used to solve the mobility management scenarios. When a mobile user moves from one cell to another cell some amount of cost is acquired for the same. These cells are assigned as either “reporting cell” or “non-reporting cell”, also known as reporting cell planning problem (RCP). In this paper, to reduce the total cost, two optimization techniques are adopted and compared to solve the problem. Total cost in location management signifies location update cost and paging cost. Two optimization algorithms needed to capture the issue are Genetic Algorithm (GA) and Binary Particle Swarm Optimization Algorithm (BPSO) which is also compared to measure the performance in terms of cost. For the same problem BPSO is shown to outperform GA in terms of quality of solution and also proved to be efficient in a competitive approach for the several benchmark issues. The simulation results also indicate BPSO is robust, gives higher solution quality and offers faster global convergence. These proposed techniques are also validated on service data and compared with the synthetic data of the different subscribers present in different reporting cells. A number of optimization problems are solved using this evolutionary algorithm and results obtained are quite satisfactory.
蜂窝网络中成本降低的进化算法
移动性管理是无线计算环境中的一个主要问题。有必要开发各种算法来捕捉这种复杂性,并用于解决移动性管理场景。当移动用户从一个小区移动到另一个小区时,同样的费用是一定数量的。这些单元被分配为“报告单元”或“非报告单元”,也称为报告单元计划问题(RCP)。为了降低总成本,本文采用了两种优化技术并对其进行了比较。位置管理中的总成本包括位置更新成本和分页成本。解决该问题所需的两种优化算法是遗传算法(GA)和二进制粒子群优化算法(BPSO),并将其与成本方面的性能进行比较。对于相同的问题,BPSO在解决方案的质量方面优于遗传算法,并且在几个基准问题的竞争方法中也被证明是有效的。仿真结果表明,该算法鲁棒性好,具有较高的解质量和较快的全局收敛速度。这些建议的技术还在服务数据上进行了验证,并与不同报告单元中存在的不同订户的综合数据进行了比较。应用该进化算法解决了许多优化问题,得到了令人满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信