Studying the Reporting Cells strategy in a realistic mobile environment

V. Berrocal-Plaza, M. A. Vega-Rodríguez, J. M. Sánchez-Pérez
{"title":"Studying the Reporting Cells strategy in a realistic mobile environment","authors":"V. Berrocal-Plaza, M. A. Vega-Rodríguez, J. M. Sánchez-Pérez","doi":"10.1109/NaBIC.2014.6921900","DOIUrl":null,"url":null,"abstract":"In this paper, we optimize the Reporting Cells Planning Problem in a realistic mobile network. To the best of our knowledge, this is the first work in the literature in which the Reporting Cells Planning Problem is studied in a realistic mobile environment. This problem is based on a mobile location management strategy where the network cells can be in two possible states: Reporting Cells and non-Reporting Cells. In this location management strategy, a mobile station only updates its location when moving to a new Reporting Cell, and it is free to move among non-Reporting Cells without updating its location. The Reporting Cells Planning Problem can be classified as a multiobjective optimization problem with two objective functions: minimize the number of location updates and minimize the number of paging messages. With the aim of finding the best possible set of non-dominated solutions, we have implemented a well-known multiobjective evolutionary algorithm: the Non-dominated Sorting Genetic Algorithm II (NSGAII). Experimental results show that our proposal is able to achieve good sets of non-dominated solutions and, at the same time, to improve the results obtained with other optimization techniques.","PeriodicalId":209716,"journal":{"name":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaBIC.2014.6921900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we optimize the Reporting Cells Planning Problem in a realistic mobile network. To the best of our knowledge, this is the first work in the literature in which the Reporting Cells Planning Problem is studied in a realistic mobile environment. This problem is based on a mobile location management strategy where the network cells can be in two possible states: Reporting Cells and non-Reporting Cells. In this location management strategy, a mobile station only updates its location when moving to a new Reporting Cell, and it is free to move among non-Reporting Cells without updating its location. The Reporting Cells Planning Problem can be classified as a multiobjective optimization problem with two objective functions: minimize the number of location updates and minimize the number of paging messages. With the aim of finding the best possible set of non-dominated solutions, we have implemented a well-known multiobjective evolutionary algorithm: the Non-dominated Sorting Genetic Algorithm II (NSGAII). Experimental results show that our proposal is able to achieve good sets of non-dominated solutions and, at the same time, to improve the results obtained with other optimization techniques.
在现实的移动环境中研究报告单元策略
本文对实际移动网络中的报告单元规划问题进行了优化。据我们所知,这是在一个现实的移动环境中研究报告单元规划问题的文献中的第一个工作。该问题基于移动位置管理策略,其中网络单元可以处于两种可能的状态:报告单元和非报告单元。在此位置管理策略中,移动站仅在移动到新的报告单元时更新其位置,并且可以在非报告单元之间自由移动而不更新其位置。报告单元规划问题可以归类为具有两个目标函数的多目标优化问题:最小化位置更新的数量和最小化分页消息的数量。为了找到非支配解的最佳可能集,我们实现了一个著名的多目标进化算法:非支配排序遗传算法II (NSGAII)。实验结果表明,本文提出的方法能够得到较好的非支配解集,同时也改善了其他优化方法所得到的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信