Extracting Kernel Dataset from Big Sensory Data in Wireless Sensor Networks
Reads0
Chats0
TLDR
The novel concept of Kernel Dataset, which can represent the vast information carried by big sensory data with the information loss rate being less than $\epsilon$, and two distributed algorithms of maintaining the correlation coefficients among sensor nodes are developed are developed.Abstract:
The amount of sensory data manifests an explosive growth due to the increasing popularity of Wireless Sensor Networks (WSNs). The scale of sensory data in many applications has already exceeded several petabytes annually, which is beyond the computation and transmission capabilities of conventional WSNs. On the other hand, the information carried by big sensory data has high redundancy because of strong correlation among sensory data. In this paper, we introduce the novel concept of $\epsilon$ -Kernel Dataset , which is only a small data subset and can represent the vast information carried by big sensory data with the information loss rate being less than $\epsilon$ , where $\epsilon$ can be arbitrarily small. We prove that drawing the minimum $\epsilon$ -Kernel Dataset is polynomial time solvable and provide a centralized algorithm with $O(n^3)$ time complexity. Furthermore, a distributed algorithm with constant complexity $O(1)$ is designed. It is shown that the result returned by the distributed algorithm can satisfy the $\epsilon$ requirement with a near optimal size. Furthermore, two distributed algorithms of maintaining the correlation coefficients among sensor nodes are developed. Finally, the extensive real experiment results and simulation results are presented. The results indicate that all the proposed algorithms have high performance in terms of accuracy and energy efficiency.read more
Citations
More filters
Journal ArticleDOI
A Privacy Preserving Communication Protocol for IoT Applications in Smart Homes
TL;DR: In this paper, an improved energy-efficient, secure, and privacy-preserving communication protocol for the SHSs is proposed and message authentication codes are incorporated to guarantee data integrity and authenticity.
Journal ArticleDOI
A Robust Time Synchronization Scheme for Industrial Internet of Things
TL;DR: R-Sync is presented, a robust time synchronization scheme for IIoT that makes all the nodes get synchronized and gets the better performance in terms of accuracy and energy consumption, compared with three existing time synchronization algorithms TPSN, GPA, STETS.
Proceedings ArticleDOI
A Privacy Preserving Communication Protocol for IoT Applications in Smart Homes
TL;DR: This paper analyzes the differences of security and privacy issues that lie in the smart home systems, smart grid, and wireless sensor networks and proposes their own solutions that achieves privacy preservation during the communications between end sensors and appliances and the controller.
Journal ArticleDOI
Approximate Holistic Aggregation in Wireless Sensor Networks
TL;DR: In this paper, four holistic aggregation operations are investigated and the mathematical methods to construct their estimators and determine the optional sample size are proposed and the correctness of these methods is proved.
Journal ArticleDOI
A low redundancy data collection scheme to maximize lifetime using matrix completion technique
TL;DR: Simulation results demonstrate that a low redundancy data collection (LRDC) scheme can achieve better performance than the traditional strategy, and it can reduce the maximum energy consumption of the network and reduce the delay by 0.7–17.9%.
References
More filters
Book
Compressed sensing
TL;DR: It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing.
Journal ArticleDOI
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
Posted Content
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: In this article, it was shown that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal $f \in {\cal F}$ decay like a power-law, then it is possible to reconstruct $f$ to within very high accuracy from a small number of random measurements.
Journal ArticleDOI
An iteration method for the solution of the eigenvalue problem of linear differential and integral operators
TL;DR: In this article, a systematic method for finding the latent roots and principal axes of a matrix, without reducing the order of the matrix, has been proposed, which is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the process of minimized iterations.
Journal Article
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks.
Honghai Zhang,Jennifer C. Hou +1 more
TL;DR: A decentralized density control algorithm, Optimal Geographical Density Control (OGDC), is devised for density control in large scale sensor networks and can maintain coverage as well as connectivity, regardless of the relationship between the radio range and the sensing range.