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.

我们考虑大规模射频识别（RFID）系统中的极值估计问题，该系统中有成千上万个标签，每个标签都包含一个有限值。目的是设计一种执行时间最短的极值估计协议。由于标准二进制搜索协议由于帧间开销而浪费大量时间，因此我们提出了一种参数化协议，并将一帧中的时隙数视为未知参数。我们提出问题并说明如何找到最佳参数以最小化最坏情况的执行时间。最后，我们提出了两个规则来进一步减少执行时间。首先是查找并删除冗余帧。第二是将来自最小值估计的帧与来自最大值估计的帧连接起来，以减少帧的总数。模拟表明，