Rapid Node Cardinality Estimation in Heterogeneous Machine-to-Machine Networks
Sachin Kadam, Sesha Vivek Y., P. Hari Prasad, Rajesh Kumar, Gaurav S., Kasbekar

TL;DR
This paper introduces two efficient schemes for rapidly estimating the number of active nodes of each type in heterogeneous M2M networks, significantly reducing time slots and energy consumption compared to prior methods.
Contribution
The paper proposes two novel two-phase estimation schemes tailored for heterogeneous M2M networks, with analytical conditions for optimal approach selection and performance analysis.
Findings
Fewer time slots required compared to prior heterogeneous schemes.
Significant reduction in energy consumption per node.
Estimates achieve the same accuracy as existing methods.
Abstract
Machine-to-Machine (M2M) networks are an emerging technology with applications in various fields, including smart grids, healthcare, vehicular telematics and smart cities. Heterogeneous M2M networks contain different types of nodes, e.g., nodes that send emergency, periodic, and normal type data. An important problem is to rapidly estimate the number of active nodes of each node type in every time frame in such a network. In this paper, we design two schemes for estimating the active node cardinalities of each node type in a heterogeneous M2M network with types of nodes, where is an arbitrary integer. Our schemes consist of two phases-- in phase 1, coarse estimates are computed, and in phase 2, these estimates are used to compute the final estimates to the required accuracy. We analytically derive a condition for one of our schemes that can be used to decide as to which of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
