Skip to content
naulon
Not checkedNot checked for notices yet.

Exploiting Linear Support Vector Machine for Correlation-Based High Dimensional Data Classification in Wireless Sensor Networks

Lawrence Mwenda Muriira, Zhiwei Zhao, Geyong Min

Sensors · 2018

doi:10.3390/s18092840 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Linear Support Vector Machine (LSVM) has proven to be an effective approach for link classification in sensor networks. In this paper, we present a data-driven framework for reliable link classification that models Kernelized Linear Support Vector Machine (KLSVM) to produce stable and consistent results. KLSVM is a linear classifying technique that learns the “best” parameter settings. We investigated its application to model and capture two phenomena: High dimensional multi-category classification and Spatiotemporal data correlation in wireless sensor network (WSN). In addition, the technique also detects anomalies within the network. With the optimized selection of the linear kernel hyperparameters, the technique models high-dimensional data classification and the examined packet traces exhibit correlations between link features. Link features with Packet Reception Rate (PRR) greater than 50% show a high degree of negative correlation while the other sensor node observations show a moderate degree of positive correlation. The model gives a good visual intuition of the network behavior. The efficiency of the supervised learning technique is studied over real dataset obtained from a WSN testbed. To achieve that, we examined packet traces from the 802.15.4 network. The technique has a good performance on link quality estimation accuracy and a precise anomaly detection of sensor nodes within the network.

Abstract licence: CC BY

References64

    64 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.