Name
Abstract | ||
|---|---|---|
In this paper, we study the localized polling problem in large-scale RFID systems, i.e., how to efficiently collect information from wanted tags dM of total interrogated tags dN, where both dM and dN are unknown, but all the tags N including all the wanted tags M in the system have been collected in advance. This issue has great significance in many practical applications but appears to be challenging. Aiming at time efficiency, we propose a novel polling protocol called LocP, which consists of two phases: the Tags-Filtering phase and the Ordering-and-Reporting phase. LocP employs Bloom Filter twice to significantly reduce the scale of candidate tags in the Tags-Filtering phase. In the Ordering-and-Reporting phase, tags determine their own transmission time-slots according to the allocation vectors iteratively broadcasted by the reader. We conduct extensive simulations to evaluate the performance of LocP. The results demonstrate that LocP is highly efficient in terms of information collection time, leading to convincing applicability and scalability for large-scale RFID systems. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.comnet.2019.01.012 | Computer Networks |
Keywords | Field | DocType |
RFID,Localized polling,Information collection | Bloom filter,Computer science,Polling,Computer network,Distributed computing,Scalability | Journal |
Volume | ISSN | Citations |
150 | 1389-1286 | 0 |
PageRank | References | Authors |
0.34 | 28 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| binbin li | 1 | 9 | 10.30 |
| Yuan He | 2 | 1012 | 81.82 |
| Wenyuan Liu | 3 | 33 | 11.78 |
| Lin Wang | 4 | 34 | 9.53 |