Constrained multi-objective particle swarm optimization for bistatic RFID network planning with distributed antennas

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yamin Wang, Shuai Ma, Yuan Li, Hongyu Qian, Qianfan Jia, Shanpeng Xiao, Yuhong Huang
{"title":"Constrained multi-objective particle swarm optimization for bistatic RFID network planning with distributed antennas","authors":"Yamin Wang,&nbsp;Shuai Ma,&nbsp;Yuan Li,&nbsp;Hongyu Qian,&nbsp;Qianfan Jia,&nbsp;Shanpeng Xiao,&nbsp;Yuhong Huang","doi":"10.1016/j.swevo.2025.101882","DOIUrl":null,"url":null,"abstract":"<div><div>Radio Frequency Identification (RFID) network planning (RNP) is crucial for optimizing network performance by setting system parameters. The new bistatic RFID architecture with a distributed antenna system (DAS) offers advantages for the passive Internet of Things (IoT). It separates transmission and reception to minimize self-interference and extend uplink communication range, while using distributed antennas for broader coverage. Bistatic DAS RNP differs from monostatic in various aspects. Monostatic RNP focuses on factors like reader number, location, and power, while bistatic DAS RNP involves more parameters, including antenna and device numbers, locations, and interconnections. Coverage and interference are more complex, and practical planning faces constraints on antenna ports and feeder line length. Consequently, bistatic DAS RFID network planning (BDRNP) problems are novel, complex, high-dimensional, and constrained, making them relatively unexplored and highly challenging. This paper analyzes bistatic DAS RFID network coverage and interference, and proposes a mathematical model for BDRNP problems. A modified multi-objective discrete particle optimization (M2DPSO) algorithm is introduced, incorporating a modified k-means clustering method to group antennas, which ensures satisfaction constraints and reduces decision variable dimensionality from <span><math><mrow><mn>4</mn><mrow><mo>|</mo><mi>C</mi><mi>S</mi><mo>|</mo></mrow><mo>+</mo><msup><mrow><mrow><mo>|</mo><mi>C</mi><mi>S</mi><mo>|</mo></mrow></mrow><mrow><mn>2</mn></mrow></msup></mrow></math></span> to <span><math><mrow><mn>4</mn><mrow><mo>|</mo><mi>C</mi><mi>S</mi><mo>|</mo></mrow></mrow></math></span> to <span><math><mrow><mn>4</mn><mrow><mo>|</mo><mi>C</mi><mi>S</mi><mo>|</mo></mrow></mrow></math></span> where <span><math><mrow><mo>|</mo><mi>C</mi><mi>S</mi><mo>|</mo></mrow></math></span> is the problem size. Redundant SDRs/carrier emitters are dynamically eliminated based on global best solution set changes. Experimental results show that M2DPSO algorithm significantly outperforms three existing popular algorithms – nondominated sorting genetic algorithm II (NSGAII), discrete particle swarm optimization (DPSO), and multi-objective evolutionary algorithm based on decomposition (MOEAD) – by 265%, 361%, and 726% respectively, in average inverted generational distance (IGD) metrics.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"94 ","pages":"Article 101882"},"PeriodicalIF":8.2000,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225000409","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Radio Frequency Identification (RFID) network planning (RNP) is crucial for optimizing network performance by setting system parameters. The new bistatic RFID architecture with a distributed antenna system (DAS) offers advantages for the passive Internet of Things (IoT). It separates transmission and reception to minimize self-interference and extend uplink communication range, while using distributed antennas for broader coverage. Bistatic DAS RNP differs from monostatic in various aspects. Monostatic RNP focuses on factors like reader number, location, and power, while bistatic DAS RNP involves more parameters, including antenna and device numbers, locations, and interconnections. Coverage and interference are more complex, and practical planning faces constraints on antenna ports and feeder line length. Consequently, bistatic DAS RFID network planning (BDRNP) problems are novel, complex, high-dimensional, and constrained, making them relatively unexplored and highly challenging. This paper analyzes bistatic DAS RFID network coverage and interference, and proposes a mathematical model for BDRNP problems. A modified multi-objective discrete particle optimization (M2DPSO) algorithm is introduced, incorporating a modified k-means clustering method to group antennas, which ensures satisfaction constraints and reduces decision variable dimensionality from 4|CS|+|CS|2 to 4|CS| to 4|CS| where |CS| is the problem size. Redundant SDRs/carrier emitters are dynamically eliminated based on global best solution set changes. Experimental results show that M2DPSO algorithm significantly outperforms three existing popular algorithms – nondominated sorting genetic algorithm II (NSGAII), discrete particle swarm optimization (DPSO), and multi-objective evolutionary algorithm based on decomposition (MOEAD) – by 265%, 361%, and 726% respectively, in average inverted generational distance (IGD) metrics.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
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学术官方微信