Enabling in-network aggregation by diffusion units for urban scale M2M networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Fan, Yao-Chung | - |
dc.contributor.author | Chen, Huan | - |
dc.contributor.author | Leu, Fang-Yie | - |
dc.contributor.author | You, Ilsun | - |
dc.date.accessioned | 2021-08-11T14:24:29Z | - |
dc.date.available | 2021-08-11T14:24:29Z | - |
dc.date.issued | 2017-09-01 | - |
dc.identifier.issn | 1084-8045 | - |
dc.identifier.issn | 1095-8592 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/7223 | - |
dc.description.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 FlajoletMartin 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. | - |
dc.format.extent | 13 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Academic Press | - |
dc.title | Enabling in-network aggregation by diffusion units for urban scale M2M networks | - |
dc.type | Article | - |
dc.publisher.location | 영국 | - |
dc.identifier.doi | 10.1016/j.jnca.2017.05.002 | - |
dc.identifier.scopusid | 2-s2.0-85021332496 | - |
dc.identifier.wosid | 000407659700014 | - |
dc.identifier.bibliographicCitation | Journal of Network and Computer Applications, v.93, pp 215 - 227 | - |
dc.citation.title | Journal of Network and Computer Applications | - |
dc.citation.volume | 93 | - |
dc.citation.startPage | 215 | - |
dc.citation.endPage | 227 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordPlus | TO-MACHINE COMMUNICATIONS | - |
dc.subject.keywordPlus | EFFICIENT | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | SCHEMES | - |
dc.subject.keywordAuthor | M2M networks | - |
dc.subject.keywordAuthor | Data aggregation | - |
dc.subject.keywordAuthor | ECA (Event Condition Action) applications | - |
dc.subject.keywordAuthor | 5G cellular networks | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.