Minimum Time Extrema Estimation for Large-Scale Radio-Frequency Identification Systems

We consider the extrema estimation problem in large-scale radio-frequency identification (RFID) systems, where there are thousands of tags and each tag contains a finite value. The objective is to design an extrema estimation protocol with the minimum execution time. Because the standard binary sear...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer science and technology 2020-10, Vol.35 (5), p.1099-1114
Main Authors: Zhu, Xiao-Jun, Xu, Li-Jie, Wu, Xiao-Bing, Chen, Bing
Format: Article
Language:English
Subjects:
Artificial Intelligence
Computer Science
Data Structures and Information Theory
Information Systems Applications (incl.Internet)
Parameters
Radio frequency
Radio frequency identification
Radio frequency identification (RFID)
Regular Paper
Software Engineering
Theory of Computation
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the extrema estimation problem in large-scale radio-frequency identification (RFID) systems, where there are thousands of tags and each tag contains a finite value. The objective is to design an extrema estimation protocol with the minimum execution time. Because the standard binary search protocol wastes much time due to interframe overhead, we propose a parameterized protocol and treat the number of slots in a frame as an unknown parameter. We formulate the problem and show how to find the best parameter to minimize the worst-case execution time. Finally, we propose two rules to further reduce the execution time. The first is to find and remove redundant frames. The second is to concatenate a frame from minimum value estimation with a frame from maximum value estimation to reduce the total number of frames. Simulations show that, in a typical scenario, the proposed protocol reduces execution time by 79% compared with the standard binary search protocol.
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-020-9828-3