Instant collision resolution for tag identification in RFID networks

Bonuccelli, Maurizio A.; Lonetti, Francesca; Martelli, Francesca

doi:10.1016/j.adhoc.2007.02.016

Cited by 77 publications

(56 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One of the main challenges in Aloha protocols is the reader doesn't know the number of identified tags and must estimate to properly tune the frames size. Some basic Frame Slotted Aloha schemes devote to optimizing the slot-based protocols, such as the Tree Slotted Aloha (TSA) [17], Binary Splitting Tree Slotted Aloha (BSTSA) protocol [18]. TSA will issue a new frame for each collision groups in the previous frame, compelling the collided ones to participate, which reduces the size of collision groups and makes the protocol much more efficient.…”

Section: Related Workmentioning

confidence: 99%

Collision alignment: an RFID anti-collision algorithm assisted by orthogonal signal detection and analogy principle

Zhao

et al. 2017

Telecommun Syst

View full text Add to dashboard Cite

The replenishment of resource management problem is tough and necessary in RFID system, which requires tags to report the existing information uninterruptedly for guaranteeing goods supply. However, the random or synchronous reply may lead to collision, further, make the system low efficiency. Based on the fusion method between orthogonal code compiling category ID and analogy principle, we present the collision tolerance protocol UACP to identify tags efficiently, which contains UCOM and ACAM mechanisms. UCOM relies on orthogonal signals' correlation to realize the tolerance and accurate category identification by making a comparison between the collision and the whole elements. ACAM depends on the analogy principle to estimate the existing number from microcosmic to macrocosmic only using the singleton slots, and the tags can transmit one-bit affirming message after a series of ACK commands. UACP also analyses some factors, such as the permutation B Jumin Zhao and combination of multiple sets orthogonal codes, asynchronous code offset, signal missing rate, signal misjudgment probability, and shows the advantages on slot utilization rate, identification rate and time efficiency compared with other algorithms. After adopting BPSK modulation and USRP platform, UACP is verified the time-efficiency increasing of 25-60%.

show abstract

Section: Related Workmentioning

confidence: 99%

Collision alignment: an RFID anti-collision algorithm assisted by orthogonal signal detection and analogy principle

Zhao

et al. 2017

Telecommun Syst

View full text Add to dashboard Cite

show abstract

“…32 This paper aims to verify the intactness of anonymous 33 RFID systems without tag IDs as a priori (Section 2). Since tag 34 IDs usually contain object-specific information, we should 35 prevent such information from leakage when it is privacy 36 sensitive for tagged objects [6,17,18]. In an anonymous RFID 37 system, RFID readers are not expected to collect IDs from 38 tags or to access them on the server [19][20][21][22].…”

Section: Introductionmentioning

confidence: 99%

Who stole my cheese?: Verifying intactness of anonymous RFID systems

Bao

Weng

et al. 2016

Ad Hoc Networks

View full text Add to dashboard Cite

“…In (10), the minimal is supposed to be achieved by a searching process with varying in the range [ 1 + 2 , 3( 1 + 2 )], where 1 + 2 is the lower bound of according to [15], since 1 tags have been identified, and if there are collisions, at least 2 tags collided. The upper bound of is set to 3( 1 + 2 ), since by simulation no further accuracy in the estimation is obtained if the upper bound is set to higher values.…”

Section: The Proposed Algorithm T-gdfsamentioning

confidence: 99%

A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process

Yang

Wang

Cai

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Recently, RFID technology has come into end-user applications for monitoring, tracking, and so forth. In RFID system, a reader identifies a set of tags over a shared wireless channel. When multiple tags communicate with the same reader simultaneously, all packages will be lost and no tag can be recognized, which is known as tag collision. Tag collision is a significantly important issue for fast tag identification. We firstly make a thorough analysis among a variety of traditional RFID anticollision algorithms. Then a novel hybrid anticollision algorithm called T-GDFSA is proposed. Tags are assigned to different groups based on the initial tag estimation and then experience several dynamic read frames for identification. When a collision occurs in current slot, a tree-based recursive process will be deployed immediately. T-GDFSA combines the advantages of ALOHA-based and tree-based together and acquires higher system throughput by reducing unnecessary idle and collision slots and lower communication complexity by decreasing the data transmitted, which makes it identify tags faster with less power consumption. Simulations show that the theoretical values match well the simulation results. Moreover, T-GDFSA also has a good tolerance for the inaccuracy of initial tag estimation and the length variation of tag's ID.

show abstract

Instant collision resolution for tag identification in RFID networks

Cited by 77 publications

References 6 publications

Collision alignment: an RFID anti-collision algorithm assisted by orthogonal signal detection and analogy principle

Collision alignment: an RFID anti-collision algorithm assisted by orthogonal signal detection and analogy principle

Who stole my cheese?: Verifying intactness of anonymous RFID systems

A Novel Hybrid Anticollision Algorithm for RFID System Based on Grouped Dynamic Framed Recognition and Binary Tree Recursive Process

Contact Info

Product

Resources

About