A Real-Time Massive Data Processing Technique for Densely Distributed Sensor Networks

Today, we are awash in a flood of data coming from different data generating sources. Wireless sensor networks (WSNs) are one of the big data contributors, where data are being collected at unprecedented scale. Unfortunately, much of these data are of no interest, meaningless, and redundant. Hence,...

Full description

Bibliographic Details
Main Authors: Hassan Harb, Abdallah Makhoul, Chady Abou Jaoude
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8478144/
id doaj-cc357a370ebd4eab9ec64e42b980d5e0
record_format Article
spelling doaj-cc357a370ebd4eab9ec64e42b980d5e02021-03-29T20:56:10ZengIEEEIEEE Access2169-35362018-01-016565515656110.1109/ACCESS.2018.28726878478144A Real-Time Massive Data Processing Technique for Densely Distributed Sensor NetworksHassan Harb0Abdallah Makhoul1https://orcid.org/0000-0003-0485-097XChady Abou Jaoude2TICKET Lab, Faculty of Engineering, Antonine University, Baabda, LebanonDISC Department, Université Bourgogne Franche-Comté, FEMTO-ST Institute/CNRS, Belfort, FranceTICKET Lab, Faculty of Engineering, Antonine University, Baabda, LebanonToday, we are awash in a flood of data coming from different data generating sources. Wireless sensor networks (WSNs) are one of the big data contributors, where data are being collected at unprecedented scale. Unfortunately, much of these data are of no interest, meaningless, and redundant. Hence, data reduction is becoming fundamental operation in order to decrease the communication costs and enhance data mining in WSNs. In this paper, we propose a two-level data reduction approach for sensor networks. The first level operated by the sensor nodes consists of compressing collected data while using the Pearson coefficient. The second level is executed at intermediate nodes (e.g., aggregators, cluster heads, and so on). The objective of the second level is to eliminate redundant data generated by neighboring nodes using two adapted clustering methods: EKmeans and TopK. Through both simulations and real experiments on real telosB sensors, we show the relevance of our approach in terms of minimizing the big data collected in WSNs and enhancing network lifetime, compared to other existing techniques.https://ieeexplore.ieee.org/document/8478144/Wireless sensor network (WSN)sensory data processingclustering techniquesbig-data sensingdata compression
collection DOAJ
language English
format Article
sources DOAJ
author Hassan Harb
Abdallah Makhoul
Chady Abou Jaoude
spellingShingle Hassan Harb
Abdallah Makhoul
Chady Abou Jaoude
A Real-Time Massive Data Processing Technique for Densely Distributed Sensor Networks
IEEE Access
Wireless sensor network (WSN)
sensory data processing
clustering techniques
big-data sensing
data compression
author_facet Hassan Harb
Abdallah Makhoul
Chady Abou Jaoude
author_sort Hassan Harb
title A Real-Time Massive Data Processing Technique for Densely Distributed Sensor Networks
title_short A Real-Time Massive Data Processing Technique for Densely Distributed Sensor Networks
title_full A Real-Time Massive Data Processing Technique for Densely Distributed Sensor Networks
title_fullStr A Real-Time Massive Data Processing Technique for Densely Distributed Sensor Networks
title_full_unstemmed A Real-Time Massive Data Processing Technique for Densely Distributed Sensor Networks
title_sort real-time massive data processing technique for densely distributed sensor networks
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description Today, we are awash in a flood of data coming from different data generating sources. Wireless sensor networks (WSNs) are one of the big data contributors, where data are being collected at unprecedented scale. Unfortunately, much of these data are of no interest, meaningless, and redundant. Hence, data reduction is becoming fundamental operation in order to decrease the communication costs and enhance data mining in WSNs. In this paper, we propose a two-level data reduction approach for sensor networks. The first level operated by the sensor nodes consists of compressing collected data while using the Pearson coefficient. The second level is executed at intermediate nodes (e.g., aggregators, cluster heads, and so on). The objective of the second level is to eliminate redundant data generated by neighboring nodes using two adapted clustering methods: EKmeans and TopK. Through both simulations and real experiments on real telosB sensors, we show the relevance of our approach in terms of minimizing the big data collected in WSNs and enhancing network lifetime, compared to other existing techniques.
topic Wireless sensor network (WSN)
sensory data processing
clustering techniques
big-data sensing
data compression
url https://ieeexplore.ieee.org/document/8478144/
work_keys_str_mv AT hassanharb arealtimemassivedataprocessingtechniquefordenselydistributedsensornetworks
AT abdallahmakhoul arealtimemassivedataprocessingtechniquefordenselydistributedsensornetworks
AT chadyaboujaoude arealtimemassivedataprocessingtechniquefordenselydistributedsensornetworks
AT hassanharb realtimemassivedataprocessingtechniquefordenselydistributedsensornetworks
AT abdallahmakhoul realtimemassivedataprocessingtechniquefordenselydistributedsensornetworks
AT chadyaboujaoude realtimemassivedataprocessingtechniquefordenselydistributedsensornetworks
_version_ 1724193876058570752