ID-Free Multigroup Cardinality Estimation for Massive RFID Tags in IoT

Lee, Tsu-Kuang; Chen, Chih-Chieh; Ren, Yi; Lin, Cheng-Kuan; Tseng, Yu–Chee

doi:10.1109/vts-apwcs.2019.8851625

Cited by 2 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Node cardinality estimation schemes for heterogeneous RFID systems and M2M networks have been proposed in [7], [8], [52]- [57]. In these works, the authors have considered the case where a single static reader or base station (BS) can cover the entire region.…”

mentioning

confidence: 99%

Node Cardinality Estimation Using a Mobile Base Station in a Heterogeneous Wireless Network Deployed Over a Large Region

Kadam

Kasbekar

2020

2020 International Conference on Signal Processing and Communications (SPCOM)

View full text Add to dashboard Cite

We consider the problem of estimation of the node cardinality of each node type in a heterogeneous wireless network with T types of nodes deployed over a large region, where T ≥ 2 is an integer. A mobile base station (MBS), such as that mounted on an unmanned aerial vehicle, is used in such cases since a single static base station is not sufficient to cover such a large region. The MBS moves around in the region and makes multiple stops, and at the last stop, it is able to estimate the node cardinalities for the entire region. In this paper, we propose two schemes, viz., HSRC-M1 and HSRC-M2, to rapidly estimate the number of nodes of each type. Both schemes have two phases, and they are performed at each stop. We prove that the node cardinality estimates computed using our proposed schemes are equal to, and hence as accurate as, the estimates that would have been obtained if a well-known estimation protocol designed for homogeneous networks in prior work were separately executed T times. We compute closed-form expressions for the expected number of slots required by HSRC-M1 to execute and the expected energy consumption of a node under HSRC-M1. We formulate the problem of finding the optimal tour of the MBS around the region, which covers all the nodes and minimizes the travel cost of the MBS, show that it is NP-complete, and provide a greedy algorithm to solve it. Using simulations, we show that the numbers of slots required by the proposed schemes, HSRC-M1 and HSRC-M2, for computing node cardinality estimates are significantly less than the number of slots required for T separate executions of the above estimation protocol for homogeneous networks.

show abstract

mentioning

confidence: 99%