Abstract

Machine-to-Machine (M2M) applications, which currently are growing rapidly, will be an important source of traffic on 5G cellular networks. A typical working model of M2M networks is a machine which is equipped with sensors or meters and directly delivers sensed data (e.g. temperature readings or inventory levels) to other machines that take actions based on the data. In such a working model, machines producing readings are referred to as sources, while those consuming the readings are called sinks. In this study, we consider a multiple-source multiple-sink scenario in M2M networks, in which a source may be demanded by multiple sinks and a sink may consume readings generated by several source nodes. However, how to efficiently process and reduce communication traffic in an urban-scale M2M network has been an engineering challenge. To solve the problem, in this paper, we propose a novel in-network aggregation scheme, called Diffusion Unit (DU), which encodes readings and aggregates data collected from its neighbors to effectively reduce transmitted data in a M2M network. We will show how existing distinct counting algorithms, like Linear Counting and Flajolet-Martin Counting, are adapted to implement a DU and introduce a family of techniques to optimize a DU's space efficiency. Furthermore, a comprehensive performance evaluation on the proposed techniques and some existing state-of-the-art techniques is presented. The results demonstrate that our techniques significantly outperform existing ones.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.