A Novel Anti-Collision Algorithm for Large Scale of UHF RFID Tags Access Systems

When the radio frequency identification(RFID)system inventories multiple tags,the recognition rate will be seriously affected due to collisions.Based on the existing dynamic frame slotted Aloha(DFSA)algorithm,a sub-frame observation and cyclic redundancy check(CRC)grouping combined dynamic framed slotted Aloha(SUBF-CGDFSA)algorithm is proposed.The algorithm combines the precise estimation method of the quantity of large-scale tags,the large-scale tags grouping mechanism based on CRC pseudo-randomcharacteristics,and the Aloha anti-collision optimization mechanism based on sub-frame observation.By grouping tags and sequentially identifying themwithin subframes,it accurately estimates the number of remaining tags and optimizes frame length accordingly to improve efficiency in large-scale RFID systems.Simulation outcomes demonstrate that this proposed algorithmcan effectively break through the system throughput bottleneck of 36.8%,which is up to 30%higher than the existing DFSA standard scheme,and has more significant advantages,which is suitable for application in largescale RFID tags scenarios.

An Adaptive Tag Anti-Collision Protocol in RFID Wireless Systems

A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.

OFDM-UAV中继广播通信系统航迹优化方法

为了提高无人机中继广播通信系统的性能,针对频率选择性衰落信道,考虑基站到无人机以及无人机到用户的全通信链路,提出了基于正交频分复用(OFDM)技术的无人机中继广播通信系统航迹优化方法。首先提出了基于OFDM的无人机中继广播通信传输模型,对单用户节点中断概率和系统平均中断概率进行理论分析并给出近似计算公式;然后以平均中断概率最小化和最大用户中断概率最小化为优化准则,提出无人机的航迹优化方法并分析了各因素对系统中断性能的影响;最后通过计算机仿真,证明了所提航迹优化方法正确有效。研究表明:在多径信道下,基于OFDM的无人机中继广播通信系统能有效克服频率选择性衰落,且译码转发方式下的连通性优于放大转发方式;基于平均中断概率最小化准则得到的系统中断性能优于最大用户中断概率最小化准则。

Design of Anti-Collision Integrated Security Mechanism Based on Chaotic Sequence in UHF RFID System

Collision and security issues are considered as barriers to RFID applications.In this paper,a parallelizable anti-collision based on chaotic sequence combined dynamic frame slotted aloha to build a high-efficiency RFID system is proposed.In the tags parallelizable identification,we design a Discrete Markov process to analyze the success identification rate.Then a mutual authentication security protocol merging chaotic anti-collision is presented.The theoretical analysis and simulation results show that the proposed identification scheme has less than 45.1%of the identification time slots compared with the OVSF-system when the length of the chaos sequence is 31.The success identification rate of the proposed chaotic anti-collision can achieve 63%when the number of the tag is100.We test the energy consumption of the presented authentication protocol,which can simultaneously solve the anti-collision and security of the UHF RFID system.

A Physical Layer Algorithm for Estimation of Number of Tags in UHF RFID Anti-Collision Design

A priori knowledge of the number of tags is crucial for anti-collision protocols in slotted UHF RFID systems.The number of tags is used to decide optimal frame length in dynamic frame slotted ALOHA(DFSA)and to adjust access probability in random access protocols.Conventional researches estimate the number of tags in MAC layer based on statistics of empty slots,collided slots and successful slots.Usually,a collision detection algorithm is employed to determine types of time slots.Only three types are distinguished because of lack of ability to detect the number of tags in single time slot.In this paper,a physical layer algorithm is proposed to detect the number of tags in a collided slot.Mean shift algorithm is utilized,and some properties of backscatter signals are investigated.Simulation results verify the effectiveness of the proposed solution in terms of low estimation error with a high SNR range,outperforming the existing MAC layer approaches.

基于多密度流聚类的UAV-NOMA用户分簇与功率分配算法

针对无人机(Unmanned Aerial Vehicle,UAV)辅助非正交多址(Non-Orthogonal Multiple Access,NOMA)下行通信系统,提出了最大化和速率的用户动态分簇与功率分配方案.考虑用户服务质量与UAV位置约束,建立了和速率最大化的优化问题.由于目标函数的非凸性,将原问题解耦为三个子问题,分别优化UAV位置部署与用户连接、用户动态分簇、功率分配以提高系统性能.首先,基于K-means算法设计了UAV位置部署与用户连接方案,以减小路损为目的确定UAV最佳部署位置,同时选择其服务的最优用户群;其次,改进多密度流聚类(Multi-Density Stream Clustering, MDSC)算法,提出了单UAV下用户静态与动态分簇方案,静态分簇方案可自适应平衡簇数与簇用户数,并获得较大的簇内用户信道增益差异,动态分簇方案则针对用户移动属性,制定了即时更新策略;最后,使用分式规划(Fractional Programming,FP)二次变换的方法,引入辅助变量将原非凸问题变换为凸问题,交替优化辅助变量与功率分配因子,获得原非凸问题的次优解.仿真结果表明,与其他算法相比,本文分簇方案能获得更大的簇内信道差异与更小的簇内用户数标准差,同时用户系统性能也获得了显著提升.

A Novel Time-aware Frame Adjustment Strategy for RFID Anti-collision

Recently,object identification with radio frequency identification(RFID)technology is becoming increasingly popular.Identification time is a key performance metric to evaluate the RFID system.The present paper analyzes the deficiencies of the state-of-the-arts algorithms and proposes a novel sub-frame-based algorithm with adaptive frame breaking policy to lower the tag identification time for EPC global C1 Gen2 UHF RFID standard.Through the observation of slot statistics in a sub-frame,the reader estimates the tag quantity and efficiently calculates an optimal frame size to fit the unread tags.Only when the expected average identification time in the calculated frame size is less than that in the previous frame size,the reader starts the new frame.Moreover,the estimation of the proposed algorithm is implemented by the look-up tables,which allows dramatically reduction in the computational complexity.Simulation results show noticeable throughput and time efficiency improvements of the proposed solution over the existing approaches.

An Improved Binary Search Anti-Collision Protocol for RFID Tag Identification

Radio frequency identification(RFID)has been widespread used in massive items tagged domains.However,tag collision increases both time and energy consumption of RFID network.Tag collision can seriously affect the success of tag identification.An efficient anti-collision protocol is very crucially in RFID system.In this paper,an improved binary search anti-collision protocol namely BRTP is proposed to cope with the tag collision concern,which introduces a Bi-response mechanism.In Bi-response mechanism,two groups of tags allowed to reply to the reader in the same slot.According to Bi-response mechanism,the BRTP strengthens the tag identification of RFID network by reducing the total number of queries and exchanged messages between the reader and tags.Both theoretical analysis and numerical results verify the effectiveness of the proposed BRTP in various performance metrics including the number of total slots,system efficiency,communication complexity and total identification time.The BRTP is suitable to be applied in passive RFID systems.

Research on the adaptive hybrid search tree anti-collision algorithm in RFID system

Due to more tag-collisions result in failed transmissions,tag anti-collision is a very vital issue in the radio frequency identification(RFID) system.However,so far decreases in communication time and increases in throughput are very limited.In order to solve these problems,this paper presents a novel tag anti-collision scheme,namely adaptive hybrid search tree(AHST),by combining two algorithms of the adaptive binary-tree disassembly(ABD) and the combination query tree(CQT),in which ABD has superior tag identification velocity and CQT has optimum performance in system throughput and search timeslots.From the theoretical analysis and numerical simulations,the proposed algorithm can colligate the advantages of above algorithms,improve the system throughput and reduce the searching timeslots dramatically.

Performance Analysis of RFID Framed Slotted Aloha Anti-Collision Protocol

In this paper, we develop a novel mathematical model to estimate the probability distribution function of the number of tags discovered after a certain number of interrogation rounds. In addition, the pdfs of the number of rounds needed to discover all the tags are also calculated. The estimation of such pdfs will be helpful in estimating the number of interrogation rounds and the optimal parameter configuration of the RFID system which in turn will be helpful in estimating the time needed to discover all tags. Our results show that the proposed model accurately predicts the tags detection probability. We then use the proposed model to optimally configure the reader parameters (i.e. the frame size and the number of interrogation rounds).

Distance-Measuring Technology Using LD for Auto Anti-Collision

Auto anti-collision technology is one of the main research subjects of automobiles’ safety technology. Aiming at the key technology of Auto anti-collision, measuring the distance from obstacles, based on the theory of phase laser distance ranging, Laser Diode (LD) distance-measuring system for auto anti-collision has been developed to solve the problem of on-line measuring distance technology in middle to long distance utilizing the good characteristics of LD when modulating its optical intensity and adopting typical kinds of filter techniques in this paper. By theoretical analysis, adopting typical kinds of filter techniques can reduce the interference of strong light, so distance-measuring range can be 0.5–100 m in daytime or 1–200 m at night. And more, from theoretical analysis and experiment result, it can guarantee the high measuring resolution which can be less than 24.5 mm, utilizing the method of two Laser Diode optical intensity modulating wavelength and complimenting precise calibration and revision. The idea of LD distance-measuring technology is novel and feasible and this technology can be applied in Auto anti-collision. Key words laser diode - phase laser distance ranging - filter techniques - auto anti-collision CLC number TH 161 Foundation item: Supported by the National Natural Science Foundation of China (59675080, 59805006) and Wuhan Chenguang Foundation (20025001001)Biography: Zhang Xin-bao (1965-), male, Associate professor, research direction: precise mechanism and instrument.

A Frame Breaking Based Hybrid Algorithm for UHF RFIDAnti-Collision

Multi-tag collision imposes a vital detrimental effect on reading performanceof an RFID system. In order to ameliorate such collision problem and to improve thereading performance, this paper proposes an efficient tag identification algorithm termedas the Enhanced Adaptive Tree Slotted Aloha (EATSA). The key novelty of EATSA is toidentify the tags using grouping strategy. Specifically, the whole tag set is divided intogroups by a frame of size F. In cases multiple tags fall into a group, the tags of the groupare recognized by the improved binary splitting (IBS) method whereas the rest tags arewaiting in the pipeline. In addition, an early observation mechanism is introduced toupdate the frame size to an optimum value fitting the number of tags. Theoretical analysisand simulation results show that the system throughput of our proposed algorithm canreach as much as 0.46, outperforming the prior Aloha-based protocols.

基于DPBBO算法的智慧云仓UAV盘库作业优化

针对智慧云仓货物信息量大、易出现账物不符等库存管理问题,迫切需要将无人机(unmanned aerial vehicle, UAV)和工业物联网(industrial Internet of things, IIoT)集成起来,为仓储精细化管理提供解决方案。首先,分析盘库作业数据采集与信息交互运行机制,以危险避障和数据采集为约束函数,考虑了UAV在加速、减速、匀速、转角等飞行条件下的能耗差异,并以能耗最低和时间最短为目标函数构造UAV盘库作业数学模型;然后,设计了差分迁移-分段变异生物地理学优化(differential migration-piecewise mutation-biogeography-based optimization, DPBBO)算法对上述模型进行优化解算;最后,进行了仿真实验验证。结果表明:DPBBO算法对解决该盘库作业问题的效果较优,可以提升库存抽检任务的时效性和库存管理的准确性。

A Dynamic Multi-ary Query Tree Protocol for Passive RFID Anti-collision

In this paper,a dynamic multi-ary query tree(DMQT)anti-collision protocol for Radio Frequency Identification(RFID)systems is proposed for large scale passive RFID tag identification.The proposed DMQT protocol is based on an iterative process between the reader and tags which identifies the position of collision bits through map commands and dynamically encodes them to optimize slots allocation through query commands.In this way,the DMQT completely eliminates empty slots and greatly reduces collision slots,which in turn reduces the identification time and energy costs.In addition and differently to other known protocols,the DMQT does not need to estimate the number of tags,reducing the protocol implementation complexity and eliminating the uncertainty caused by the estimation algorithm.A numerical analysis shows that DMQT has better performance than other algorithms for a number of tags larger than 300.Meanwhile,when the number of tags is 2000 and the tag identity(ID)length is 128 bits,the total identification time is 2.58 s and the average energy cost for a tag identification is 1.2 mJ,which are 16.9%and 10.4%less than those of state-of-the-art algorithms,respectively.In addition,a DMQT extension based on ACK command has also been presented to deal with capture effect and avoid missing identification.

A Physical Layer Network Coding Based Tag Anti-Collision Algorithm for RFID System

In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.

通信约束下UAV集群协同拦截任务分配算法

针对多无人机协同拦截多机动目标的任务分配问题,同时考虑到真实战场环境中存在的通信约束以及探测范围约束条件,本文提出了分步一致性拍卖算法(SCBAA)。首先,对真实战场环境中存在的通信约束以及探测范围约束等问题进行了描述分析,构建了多无人机协同拦截任务分配模型,设计了综合效能函数以及相应约束条件。其次,为解决多无人机协同打击单一目标的不平衡任务分配以及冲突消解问题,将原任务分配过程分为主要任务分配以及次要任务分配两部分,通过多次拍卖以及冲突消解实现多无人机对单一目标的任务分配。仿真结果表明,该算法可有效解决通信约束条件下的分布式多无人机协同拦截问题,并适应动态环境中任务分配对实时性的要求。

基于UAV勘察与层次分析法的安阳许家沟露天矿山地质风险评价

矿产资源是社会经济发展的重要基础,在社会发展与生态建设统筹的背景下,矿山地质风险防治与生态环境修复成为矿业研究的焦点。矿山地质风险的分类和量化是矿山地质风险防治和修复的基础,有利于因地制宜制定治理措施。本文基于UAV勘察和层次分析法对安阳许家沟露天矿山群地质风险进行了评价,根据勘察结果总结出边坡崩塌、矿坑坍塌和水土流失3个主要地质风险,各风险层选取4个因素,共12个评价指标,并利用ArcGIS栅格计算模块对选取的12个评价因素进行叠加分析。研究结果显示:高度风险区、显著风险区、一般风险区和稍有风险区的面积分别为13500 m^(2)、39000 m^(2)、26750 m^(2)、45750 m^(2),分别占研究区总面积的10.8%、31.2%、21.4%、36.6%;综合矿山地质风险排序为河西胜利II区<豫隆I区<豫安III区;从豫隆I区到豫安III区,随着研究子区面积的减少,边坡崩塌风险贡献率逐渐降低,矿坑坍塌风险和水土流失风险逐渐升高。研究结果表明,边坡崩塌评分与矿山地质评分呈现双峰态势,而矿坑坍塌风险和水土流失风险呈单峰态势。本文提出危岩清除、矿渣回填、边坡修整、客土恢复林地和耕地、养护治理等治理措施,从而降低矿山地质风险,修复矿山生态。

基于UAV成像技术的‘高原红’海棠花期物候监测研究

以‘高原红’海棠(Malus‘Prairifire’)为试材,基于UAV成像技术采集物候期内图像样本并提取色彩参数值(CIE L^(*)a^(*)b^(*)),计算不同采样点及不同物候期的色差值(△E),通过对比△E的变化情况实现海棠物候的动态监测,为实时掌握海棠物候动态变化情况,适时作出调整策略提供技术参考,同时也为开展花期物候调控相关研究提供参考依据。结果表明:1)利用Photoshop提取航拍图像色彩参数,并基于物候色彩参数进行聚类分析,将其物候划分为萌芽期、展叶期、蕾期、初花期、盛花期、末花期、落叶期、结果期、休眠期,建立了‘高原红’海棠物候色彩参数库;2)计算‘高原红’海棠各物候期内色差△E_(1)及不同物候期间色差△E_(2)范围,并基于各物候期内最大色差△E_(1max)′及不同物候期间最小色差△E_(2min)′,建立了基于色差参数的物候判别方法;3)随机提取了2个日期(3月22日、4月10日)的‘高原红’海棠物候图像色彩参数,通过聚类分析判定2个日期物候图分别处于蕾期和盛花期,结果与实际相符;2个日期物候图间色差(△E_(2)′=21.8)大于蕾期至初花期最小色差(△E_(2min)=9.6),表明此时物候期跨度较大,结果与实际相符。综上,该方法可便捷高效判断海棠花期等物候期情况。

UAV-Assisted Dynamic Avatar Task Migration for Vehicular Metaverse Services: A Multi-Agent Deep Reinforcement Learning Approach

Avatars, as promising digital representations and service assistants of users in Metaverses, can enable drivers and passengers to immerse themselves in 3D virtual services and spaces of UAV-assisted vehicular Metaverses. However, avatar tasks include a multitude of human-to-avatar and avatar-to-avatar interactive applications, e.g., augmented reality navigation,which consumes intensive computing resources. It is inefficient and impractical for vehicles to process avatar tasks locally. Fortunately, migrating avatar tasks to the nearest roadside units(RSU)or unmanned aerial vehicles(UAV) for execution is a promising solution to decrease computation overhead and reduce task processing latency, while the high mobility of vehicles brings challenges for vehicles to independently perform avatar migration decisions depending on current and future vehicle status. To address these challenges, in this paper, we propose a novel avatar task migration system based on multi-agent deep reinforcement learning(MADRL) to execute immersive vehicular avatar tasks dynamically. Specifically, we first formulate the problem of avatar task migration from vehicles to RSUs/UAVs as a partially observable Markov decision process that can be solved by MADRL algorithms. We then design the multi-agent proximal policy optimization(MAPPO) approach as the MADRL algorithm for the avatar task migration problem. To overcome slow convergence resulting from the curse of dimensionality and non-stationary issues caused by shared parameters in MAPPO, we further propose a transformer-based MAPPO approach via sequential decision-making models for the efficient representation of relationships among agents. Finally, to motivate terrestrial or non-terrestrial edge servers(e.g., RSUs or UAVs) to share computation resources and ensure traceability of the sharing records, we apply smart contracts and blockchain technologies to achieve secure sharing management. Numerical results demonstrate that the proposed approach outperforms the MAPPO approach by around 2% and effectively reduces approximately 20% of the latency of avatar task execution in UAV-assisted vehicular Metaverses.

Quantifying glacier surging and associated lake dynamics in Amu Darya river basin using UAV and remote sensing data

Glaciers in the Pamir region are experiencing rapid melting and receding due to climate change,which has a significant implication for the Amu Darya river basin.Predominantly,surging glaciers,which undergo unpredictable advances,are potentially leading to the obstruction of high-altitude river channels and also glacial lake outburst floods.decrease of-703.5±30.0 m.There is a substantial increase in the number(from 19 to 75)and area(from 4889.7±0.6 m2 to 15345.5±0.6 m2)of RGS lakes along with supra-glacier ponds based on a comparison of ArcGIS base map in 2011 and high-resolution UAV data in 2023.For M glacier,number of lakes increased from 4 to 22 but the lake area declined from 10715.2±0.6 to 365.6±0.6 m2.It was noted that the largest lake in 2011 with an area of 10406.4±0.6 m2 at the southeastern portion of the glacier was not observed in 2023 due to outburst.Both the glaciers have substantially impacted the river flow(Abdukahor river)by obstructing a significant proportion of river channel in recent years and might cause outburst floods.These findings enhance the understanding of glacier dynamics and their impacts on the surrounding areas,emphasizing the urgent need for continued monitoring and appropriate management strategies,with a specific focus on surging glaciers and the associated risks.