Citation Context

...dren. The second category [1]–[3], [5]–[16] employs a framed slotted ALOHA protocol which will be introduced in detail in Section II-B. Our work in this paper belongs to the second category. In [10], =-=[11]-=-, [13], a few probabilistic models were presented to fast estimate the number of tags in large-scale RFID systems. Some probabilistic algorithms were proposed in [12] to efficiently find popular categ...

Citation Context

...sed to efficiently estimate the cardinality of tags. Kodialam et al. [22] propose Unified Simple Estimator (USE) and Unified Probabilistic Estimator (UPE) using linear counting technique. Qian et al. =-=[23]-=- introduce geometric distribution hashes to quickly estimate the cardinality of tags and the proposed LOF algorithm achieves O(log n) time complexity. Zheng et al [24] propose Probabilistic Estimation...

Citation Context

...frame) until the reader gets an empty slot. Suppose the empty slot occurred in the th frame, TH estimates the tag population size to be based on Flajolet and Martin's algorithm used in databases [9], =-=[23]-=-. 798 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 23, NO. 3, JUNE 2015 2) Finding Optimal Level: To determine the optimal level that TH directly hops to, we first calculate the expected number of nodes ...

Citation Context

... results are often not necessary for many applications (e.g., for the earlier example application scenarios) and since the overhead of exact counting isfundamentally high, 1 as in most prior efforts =-=[9, 12, 13, 16, 18, 24, 25]-=-, we will focus on approximate counting. Previous efforts. Given the paramount practical importance of RFID counting, there have been a steady stream of recent research efforts on efficient RFID count...

Citation Context

... are proposed, aiming to collect information from RFID tags in a time/energy efficient approach. In order to estimate the number of tags without collecting tag IDs, a number of protocols are proposed =-=[8, 11, 15, 6, 17]-=- to leverage the information gathered in slotted ALOHA protocol for fast estimation of the number of tags. In order to verify the impact of the physical layer’s unreliability, Buettner et al. [4] exam...

Citation Context

...r of tags is estimated as the value which maximizes the a posteriori probability. Other tag estimation techniques have also been proposed in the literature for RFID systems with a single reader [12], =-=[13]-=-. For large scale RFID systems, it is necessary to deploy multiple readers with overlapped interrogation zones in order to fully cover the area and achieve a high accuracy in the estimation. Consequen...

Citation Context

...ied, yielding solutions fall into two categories, slotted ALOHA [7]–[10] and tree splitting algorithms [10]– [13]. The problem of counting RFID tags by using statistic approaches was studied in [14], =-=[15]-=-. Meanwhile, [16] and [17] intend to discover missing tags and tag popularity, respectively. A load balancing scheme is introduced in [18] to distribute the communication load evenly among readers. In...

Citation Context

... are two unknowns to estimate C(A,B), namely |A| and J(A,B). To obtain |A|, various tag cardinality estimation schemes can be leveraged. 4For example, Qian et al. proposed a fast estimation scheme in =-=[19]-=-, which achieves fairly accurate result with small overhead. Hence, we focus on estimating J(A,B). Note that the estimation algorithm should be lightweight, otherwise the overhead it incurs might outw...

Citation Context

...cting the missing tags [5][6] and searching a particular subset of tags [7] only concern the part of tags. Rather than tag identification, cardinality estimation protocols count the number of tags [8]=-=[9]-=-[10]. However, all the literature do not research the problem of tag identification in a specified area, which is rather important in many applications. Taking the inventory for example, we may only n...