Minimal Perfect Hashing-Based Information Collection Protocol for RFID Systems

Xie, Xin; Liu, Xiulong; Li, Keqiu; Xiao, Bin; Qi, Heng

doi:10.1109/tmc.2017.2677912

Cited by 17 publications

(13 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The explanation is: once tags are sorted, the reader can more quickly isolate a tag subset from a large population by using the assigned short integers than using the original 96-bit IDs. For the same reason, a tag sorting protocol also helps some applications that needs to store the same piece of information in a tag subset for tracking or security reason [14], [21], [25], [30], [31] (since tag subsets can be more quickly selected with these assigned integers after all tags are sorted).…”

Section: Edge Servermentioning

confidence: 99%

“…There are some researches [25], [30], [33]- [35] devoted to rapidly collecting tag information in RFID systems. For example, in Ref.…”

Section: A Limitations Of Prior Workmentioning

confidence: 99%

“…Ref. [30] studied how to use minimal perfect hashing to collect the information of a tag subset. For this purpose, they proposed a protocol called the minimal Perfect hashing-based Information Collection (PIC) which uses multiple indicate vectors to recursively appoint one slot solely to one tag, and then filters out other non-target tags.…”

Section: A Limitations Of Prior Workmentioning

confidence: 99%

“…* Specifically, given an RFID system with n identified tags and an unknown number of unidentified tags, the communication costs of the existing protocol are lower bounded by 1.44n log 2 (1/ε) + 2.71n (see Theorem 3.4). The first subformula 1.44n log 2 (1/ε) is the communication cost of using a Bloom filter to keep unidentified tags from receiving any integers with an error probability ε [39]; The second subformula 2.71n is the communication cost for informing each identified tag of a unique integer [30], [40]. We will explain in the following sections how we break this upper limit by handling the two objectives simultaneously.…”

Section: A Limitations Of Prior Workmentioning

confidence: 99%

“…• How to rapidly inform identified tags of unique integers. When assigning integers to tags, people usually think of the traditional aloha-like protocols [25], [30], [33]- [35], [38] which randomly distribute tags to different slots, and then assign different integers to different tags by using the singleton slots (a slot is called a singleton slot if there is exactly one tag mapped to this slot). Although this scheme is popular in RFID systems, it still suffers from low communication efficiency because a large proportion of transmitted slots are not singleton slots and thus unused.…”

Section: B Technical Challenges and Contributionsmentioning

confidence: 99%

See 4 more Smart Citations

Fast RFID Tag Sorting at the Edge for Internet of Things

Yang

Wang

2021

IEEE Access

View full text Add to dashboard Cite

Internet of Things (IoT) has gained great popularity in various fields including smart warehouse and intelligent manufacturing. As a building block of IoT network, the Radio Frequency IDentification (RFID) technology enables a large and ever-increasing number of physical objects to be monitored across the Internet via tag identification. Efficiently managing massive tags in RFID systems becomes an important research issue for IoT networks. This paper focuses on a fundamental management problem -tag-sorting, which is to (1) put a set S of identified tags into a certain order by informing each tag t ∈ S of a unique integer ∆(t) ∈ {1, 2, • • • , |S|}, and meanwhile (2) keep unidentified tags from receiving any of these integers. For RFID systems, it is critical to solve this problem as quickly as possible in the sense that, once sorted, every identified tag t ∈ S can be manipulated via t's log 2 (|S|)-bit integer significantly shorter than t's 96-bit long tag-ID (log 2 (|S|) 96), boosting efficiency substantially. The existing works of literature, however, fails to solve this problem rapidly, as they accomplish (1) and (2) separately by using aloha-like protocols and Bloom filters, which incur a long communication time far from the optimum. In this paper, we overcome this drawback by proposing a protocol P sort capable of solving the problem fastly. In particular, this protocol is built with a novel data structure and communication scheme to achieve (1) and (2) simultaneously by using a communication time proven to be much less than the stateof-the-art protocols. The simulation results demonstrate the competence of P sort in achieving about 1.4× speedup than the state-of-the-art solutions.INDEX TERMS IoT network, edge server, RFID systems, tag management, tag-sorting, unidentified tag, identified tag.

show abstract