RFID 网络规划中采用网格单元大小和任意工作空间形状分配读取器的最佳模型

Q2 Computer Science
Van Hoa Le
{"title":"RFID 网络规划中采用网格单元大小和任意工作空间形状分配读取器的最佳模型","authors":"Van Hoa Le","doi":"10.58346/jisis.2024.i1.012","DOIUrl":null,"url":null,"abstract":"RFID Network Planning (RNP) is the problem of deploying RFID readers within a workspace so that each tag can be covered by at least one reader. The objective of RNP is to determine the optimal positions of readers while satisfying certain constraints, such as maximum coverage, minimal interference, load balance among readers, etc. However, most previous studies considered the workspace rectangular or square and assumed a fixed number of readers. They then employed some heuristic methods to find the optimal reader positions. This approach is not practical because the workspace can have any shape, and an approach adaptable to the actual shape of the workspace is needed. This paper proposed an improved adaptive model considering the workspace shape, called RNP-3P. The objectives of RNP-3P are to minimize the number of readers, maximize coverage area, minimize interference, and achieve load balance. RNP-3P optimizes the problem in three phases: Phase 1 involves modeling the workspace with grid cell size, Phase 2 determines the objective function, and Phase 3 proposes the iGAPO algorithm to optimize the number and positions of readers within the workspace. Simulation results demonstrate that the proposed model is more effective compared to other heuristic methods.","PeriodicalId":36718,"journal":{"name":"Journal of Internet Services and Information Security","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Optimal Model for Allocation Readers with Grid Cell Size and Arbitrary Workspace Shapes in RFID Network Planning\",\"authors\":\"Van Hoa Le\",\"doi\":\"10.58346/jisis.2024.i1.012\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"RFID Network Planning (RNP) is the problem of deploying RFID readers within a workspace so that each tag can be covered by at least one reader. The objective of RNP is to determine the optimal positions of readers while satisfying certain constraints, such as maximum coverage, minimal interference, load balance among readers, etc. However, most previous studies considered the workspace rectangular or square and assumed a fixed number of readers. They then employed some heuristic methods to find the optimal reader positions. This approach is not practical because the workspace can have any shape, and an approach adaptable to the actual shape of the workspace is needed. This paper proposed an improved adaptive model considering the workspace shape, called RNP-3P. The objectives of RNP-3P are to minimize the number of readers, maximize coverage area, minimize interference, and achieve load balance. RNP-3P optimizes the problem in three phases: Phase 1 involves modeling the workspace with grid cell size, Phase 2 determines the objective function, and Phase 3 proposes the iGAPO algorithm to optimize the number and positions of readers within the workspace. Simulation results demonstrate that the proposed model is more effective compared to other heuristic methods.\",\"PeriodicalId\":36718,\"journal\":{\"name\":\"Journal of Internet Services and Information Security\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Internet Services and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.58346/jisis.2024.i1.012\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Internet Services and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.58346/jisis.2024.i1.012","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

摘要

RFID 网络规划(RNP)是在工作区内部署 RFID 阅读器,使每个标签至少能被一个阅读器覆盖的问题。RNP 的目标是确定阅读器的最佳位置,同时满足某些约束条件,如最大覆盖率、最小干扰、阅读器之间的负载平衡等。然而,以往的大多数研究都认为工作空间是矩形或正方形的,并假设阅读器的数量是固定的。然后,他们采用一些启发式方法来找到最佳的阅读器位置。这种方法并不实用,因为工作区可以是任何形状,因此需要一种能适应工作区实际形状的方法。本文提出了一种考虑到工作空间形状的改进型自适应模型,称为 RNP-3P。RNP-3P 的目标是最小化阅读器数量、最大化覆盖区域、最小化干扰和实现负载平衡。RNP-3P 分三个阶段对问题进行优化:第一阶段是建立具有网格单元大小的工作区模型,第二阶段是确定目标函数,第三阶段是提出 iGAPO 算法,以优化工作区内阅读器的数量和位置。仿真结果表明,与其他启发式方法相比,所提出的模型更为有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Optimal Model for Allocation Readers with Grid Cell Size and Arbitrary Workspace Shapes in RFID Network Planning
RFID Network Planning (RNP) is the problem of deploying RFID readers within a workspace so that each tag can be covered by at least one reader. The objective of RNP is to determine the optimal positions of readers while satisfying certain constraints, such as maximum coverage, minimal interference, load balance among readers, etc. However, most previous studies considered the workspace rectangular or square and assumed a fixed number of readers. They then employed some heuristic methods to find the optimal reader positions. This approach is not practical because the workspace can have any shape, and an approach adaptable to the actual shape of the workspace is needed. This paper proposed an improved adaptive model considering the workspace shape, called RNP-3P. The objectives of RNP-3P are to minimize the number of readers, maximize coverage area, minimize interference, and achieve load balance. RNP-3P optimizes the problem in three phases: Phase 1 involves modeling the workspace with grid cell size, Phase 2 determines the objective function, and Phase 3 proposes the iGAPO algorithm to optimize the number and positions of readers within the workspace. Simulation results demonstrate that the proposed model is more effective compared to other heuristic methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Internet Services and Information Security
Journal of Internet Services and Information Security Computer Science-Computer Science (miscellaneous)
CiteScore
3.90
自引率
0.00%
发文量
0
审稿时长
8 weeks
×
引用
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学术官方微信