Rapid Node Cardinality Estimation in Heterogeneous Machine-to-Machine Networks

Kadam, Sachin; Yenduri, Sesha Vivek; Prasad, P. Durga; Kumar, Rakesh; Kasbekar, Gaurav S.

doi:10.1109/tvt.2021.3054594

Cited by 2 publications

(3 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that a node may lie in the coverage region(s) of the MBS at one or more stopping locations. We cannot simply use an estimation protocol designed for a network with a static base station [7], [8], [56], [57] to separately estimate the node cardinality of a given type at each stop m and add up the estimates since a node that is in the range of the MBS at multiple stops would appear multiple times in the estimate.…”

Section: A Network Model and Problem Formulationmentioning

confidence: 99%

“…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%

“…Note that a challenge that needs to be overcome is that the coverage regions at different stops may overlap; hence, the proposed schemes are designed to prevent multiple counting of the same active nodes. The schemes, HSRC-M1 and HSRC-M2, proposed in this paper, are generalizations of the HSRC-1 and HSRC-2 schemes proposed in [57]. We prove that the node cardinality estimates computed using any one of our proposed schemes, HSRC-M1 and HSRC-M2, equal and hence are as accurate as the estimates that would have been obtained if the SRC M protocol were separately executed T times to estimate the cardinalities of the T node types.…”

mentioning

confidence: 99%

See 2 more Smart Citations

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