4.7 Article

Boundary Tracking of Continuous Objects Based on Binary Tree Structured SVM for Industrial Wireless Sensor Networks

Journal

IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 21, Issue 3, Pages 849-861

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TMC.2020.3019393

Keywords

Industrial wireless sensor networks; continuous objects; boundary tracking; binary tree; support vector machines

Funding

  1. National Key Research and Development Program [2017YFE0125300]
  2. Jiangsu Key Research and Development Program [BE2019648]
  3. Fundamental Research Funds for the Central Universities [B200201035]
  4. State Key Laboratory of Acoustics, Chinese Academy of Sciences [SKLA202004]
  5. project of shenzhen science and technology innovation committee [JCYJ20190809145407809]

Ask authors/readers for more resources

This article proposes an algorithm for continuous object boundary tracking in industrial wireless sensor networks. The algorithm utilizes the collective intelligence and machine learning capability within the sensor nodes. By determining the upper bound of the event region covered by continuous objects and performing a binary tree-based partition, the algorithm achieves boundary tracking. Simulation results show that the algorithm reduces the number of nodes required for boundary tracking by at least 50%.
Due to the flammability, explosiveness and toxicity of continuous objects (e.g., chemical gas, oil spill, radioactive waste) in the petrochemical and nuclear industries, boundary tracking of continuous objects is a critical issue for industrial wireless sensor networks (IWSNs). In this article, we propose a continuous object boundary tracking algorithm for IWSNs - which fully exploits the collective intelligence and machine learning capability within the sensor nodes. The proposed algorithm first determines an upper bound of the event region covered by the continuous objects. A binary tree-based partition is performed within the event region, obtaining a coarse-grained boundary area mapping. To study the irregularity of continuous objects in detail, the boundary tracking problem is then transformed into a binary classification problem; a hierarchical soft margin support vector machine training strategy is designed to address the binary classification problem in a distributed fashion. Simulation results demonstrate that the proposed algorithm shows a reduction in the number of nodes required for boundary tracking by at least 50 percent. Without additional fault-tolerant mechanisms, the proposed algorithm is inherently robust to false sensor readings, even for high ratios of faulty nodes (approximate to 9%).

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available