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).

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.

An Overview of Anti-Collision Protocols for Radio Frequency Identification Devices

Radio frequency identification(RFID) is a new type of non-contact automatic identification technology.Due to its low energy consumption,low cost,and its adaptability to harsh environments,it has been applied to many fields.In the RFID systems,data collision is inevitable when the reader sends a communication request and multiple tags respond with simultaneous data transmission.Data collision is prone to causing problems such as:identification delay,spectrum resource waste,a decreased system throughput rate,etc.Therefore,an efficient,stable anti-collision protocol is crucial for RFID systems.This research analysed the current research into RFID anticollision protocols and summarised means for its improvement through the mechanism of implementation of different types anticollision protocols.Finally,a new direction is proposed for the future development of RFID anti-collision protocol systems.

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.

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.

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.

acSB:Anti-Collision Selective-Based Broadcast Protocol in CRAdHocs

As a fundamental operation in ad hoc networks,broadcast could achieve efficient message propagations.Particularl y in the cognitive radio ad hoc network where unlicensed users have different sets of available channels,broadcasts are carried out on multiple channels.Accordingly,channel selection and collision avoidance are challenging issues to balance the efficiency against the reliability of broadcasting.In this paper,an anticollision selective broadcast protocol,called acSB,is proposed.A channel selection algorithm based on limited neighbor information is considered to maximize success rates of transmissions once the sender and receiver have the same channel.Moreover,an anticollision scheme is adopted to avoid simultaneous rebroadcasts.Consequently,the proposed broadcast acSB outperforms other approaches in terms of smaller transmission delay,higher message reach rate and fewer broadcast collisions evaluated by simulations under different scenarios.

Incorporating red blanket protocol within code crimson:Streamlining definitive trauma care amid the chaos

The care of a patient involved in major trauma with exsanguinating haemorrhage is time-critical to achieve definitive haemorrhage control,and it requires coordinated multidisciplinary care.During initial resuscitation of a patient in the emergency department(ED),Code Crimson activation facilitates rapid decisionmaking by multi-disciplinary specialists for definitive haemorrhage control in operating theatre(OT)and/or interventional radiology(IR)suite.Once this decision has been made,there may still be various factors that lead to delay in transporting the patient from ED to OT/IR.Red Blanket protocol identifies and addresses these factors and processes which cause delay,and aims to facilitate rapid and safe transport of the haemodynamically unstable patient from ED to OT,while minimizing delay in resuscitation during the transfer.The two processes,Code Crimson and Red Blanket,complement each other.It would be ideal to merge the two processes into a single protocol rather than having two separate workflows.Introducing these quality improvement strategies and coor-dinated processes within the trauma framework of the hospitals/healthcare systems will help in further improving the multi-disciplinary care for the complex trauma patients requiring rapid and definitive haemorrhage control.

Improving nursing care protocols for diabetic patients through a systematic review and meta-analysis of recent years

BACKGROUND Diabetes mellitus has become one of the major pandemics of the 21st century.In this scenario,nursing interventions are essential for improving self-care and quality of life in patients with type 2 diabetes mellitus.Nursing interventions are crucial for managing the disease and preventing complications.AIM To analyse nursing interventions in recent years through a systematic review and meta-analysis and to propose improvements in care plans.METHODS This study conducted a systematic review and meta-analysis of the impact of nursing interventions on quantitative glycaemic variables,such as glycated haemoglobin and fasting plasma glucose.RESULTS After confirming that the combined effect of all studies from the past 5 years positively impacts quantitative variables,a descriptive analysis of the studies with the most significant changes was conducted.Based on this,an improvement in diabetic patient care protocols has been proposed through follow-up plans tailored to the patient’s technological skills.CONCLUSION The combined results obtained and the proposal for improvement developed in this manuscript could help to improve the quality of life of many people around the world.

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.

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.

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.

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.

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.

Safety and effectiveness of butorphanol in epidural labor analgesia:A protocol for a systematic review and meta-analysis

BACKGROUND Epidural analgesia is the most effective analgesic method during labor.Butorphanol administered epidurally has been shown to be a successful analgesic method during labor.However,no comprehensive study has examined the safety and efficacy of using butorphanol as an epidural analgesic during labor.AIM To assess butorphanol's safety and efficacy for epidural labor analgesia.METHODS The PubMed,Cochrane Library,EMBASE,Web of Science,China National Knowledge Infrastructure,and Google Scholar databases will be searched from inception.Other types of literature,such as conference abstracts and references to pertinent reviews,will also be reviewed.We will include randomized controlled trials comparing butorphanol with other opioids combined with local anesthetics for epidural analgesia during labor.There will be no language restrictions.The primary outcomes will include the visual analog scale score for the first stage of labor,fetal effects,and Apgar score.Two independent reviewers will evaluate the full texts,extract data,and assess the risk of bias.Publication bias will be evaluated using Egger's or Begg's tests as well as visual analysis of a funnel plot,and heterogeneity will be evaluated using the Cochran Q test,P values,and I2 values.Meta-analysis,subgroup analysis,and sensitivity analysis will be performed using RevMan software version 5.4.This protocol was developed in accordance with the Preferred Reporting Items for Systematic Reviews and Meta-Analyses(PRISMA)Protocols statement,and the PRISMA statement will be used for the systematic review.RESULTS This study provides reliable information regarding the safety and efficacy of using butorphanol as an epidural analgesic during labor.CONCLUSION To support clinical practice and development,this study provides evidence-based findings regarding the safety and efficacy of using butorphanol as an epidural analgesic during labor.

Corneal collagen cross-linking in patients with keratoconus from the Dresden protocol to customized solutions:theoretical basis

Keratoconus is an ectatic condition characterized by gradual corneal thinning,corneal protrusion,progressive irregular astigmatism,corneal fibrosis,and visual impairment.The therapeutic options regarding improvement of visual function include glasses or soft contact lenses correction for initial stages,gas-permeable rigid contact lenses,scleral lenses,implantation of intrastromal corneal ring or corneal transplants for most advanced stages.In keratoconus cases showing disease progression corneal collagen crosslinking(CXL)has been proven to be an effective,minimally invasive and safe procedure.CXL consists of a photochemical reaction of corneal collagen by riboflavin stimulation with ultraviolet A radiation,resulting in stromal crosslinks formation.The aim of this review is to carry out an examination of CXL methods based on theoretical basis and mathematical models,from the original Dresden protocol to the most recent developments in the technique,reporting the changes proposed in the last 15y and examining the advantages and disadvantages of the various treatment protocols.Finally,the limits of non-standardized methods and the perspectives offered by a customization of the treatment are highlighted.

Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

Unknown Application Layer Protocol Recognition Method Based on Deep Clustering

In recent years,many unknown protocols are constantly emerging,and they bring severe challenges to network security and network management.Existing unknown protocol recognition methods suffer from weak feature extraction ability,and they cannot mine the discriminating features of the protocol data thoroughly.To address the issue,we propose an unknown application layer protocol recognition method based on deep clustering.Deep clustering which consists of the deep neural network and the clustering algorithm can automatically extract the features of the input and cluster the data based on the extracted features.Compared with the traditional clustering methods,deep clustering boasts of higher clustering accuracy.The proposed method utilizes network-in-network(NIN),channel attention,spatial attention and Bidirectional Long Short-term memory(BLSTM)to construct an autoencoder to extract the spatial-temporal features of the protocol data,and utilizes the unsupervised clustering algorithm to recognize the unknown protocols based on the features.The method firstly extracts the application layer protocol data from the network traffic and transforms the data into one-dimensional matrix.Secondly,the autoencoder is pretrained,and the protocol data is compressed into low dimensional latent space by the autoencoder and the initial clustering is performed with K-Means.Finally,the clustering loss is calculated and the classification model is optimized according to the clustering loss.The classification results can be obtained when the classification model is optimal.Compared with the existing unknown protocol recognition methods,the proposed method utilizes deep clustering to cluster the unknown protocols,and it can mine the key features of the protocol data and recognize the unknown protocols accurately.Experimental results show that the proposed method can effectively recognize the unknown protocols,and its performance is better than other methods.