1,298 research outputs found
SimpleTrack:Adaptive Trajectory Compression with Deterministic Projection Matrix for Mobile Sensor Networks
Some mobile sensor network applications require the sensor nodes to transfer
their trajectories to a data sink. This paper proposes an adaptive trajectory
(lossy) compression algorithm based on compressive sensing. The algorithm has
two innovative elements. First, we propose a method to compute a deterministic
projection matrix from a learnt dictionary. Second, we propose a method for the
mobile nodes to adaptively predict the number of projections needed based on
the speed of the mobile nodes. Extensive evaluation of the proposed algorithm
using 6 datasets shows that our proposed algorithm can achieve sub-metre
accuracy. In addition, our method of computing projection matrices outperforms
two existing methods. Finally, comparison of our algorithm against a
state-of-the-art trajectory compression algorithm show that our algorithm can
reduce the error by 10-60 cm for the same compression ratio
Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications
Wireless sensor networks monitor dynamic environments that change rapidly
over time. This dynamic behavior is either caused by external factors or
initiated by the system designers themselves. To adapt to such conditions,
sensor networks often adopt machine learning techniques to eliminate the need
for unnecessary redesign. Machine learning also inspires many practical
solutions that maximize resource utilization and prolong the lifespan of the
network. In this paper, we present an extensive literature review over the
period 2002-2013 of machine learning methods that were used to address common
issues in wireless sensor networks (WSNs). The advantages and disadvantages of
each proposed algorithm are evaluated against the corresponding problem. We
also provide a comparative guide to aid WSN designers in developing suitable
machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial
Energy-efficient Compressive Data Gathering Utilizing Virtual Multi-input Multi-output
Data gathering is an attractive operation for obtaining information in wireless sensor networks (WSNs). But one of important challenges is to minimize energy consumption of networks. In this paper, an integration of distributed compressive sensing (CS) and virtual multi-input multi-output (vMIMO) in WSNs is proposed to significantly decrease the data gathering cost. The scheme first constructs a distributed data compression model based on low density parity check-like (LDPC-like) codes. Then a cluster-based dynamic virtual MIMO transmission protocol is proposed. The number of clusters, number of cooperative nodes and the constellation size are determined by a new established optimization model under the restrictions of compression model. Finally, simulation results show that the scheme can reduce the data gathering cost and prolong the sensor network’s lifetime in a reliable guarantee of sensory data recovery quality
Unbalanced Expander Based Compressive Data Gathering in Clustered Wireless Sensor Networks
© 2013 IEEE. CConventional compressive sensing-based data gathering (CS-DG) algorithms require a large number of sensors for each compressive sensing measurement, thereby resulting in high energy consumption in clustered wireless sensor networks (WSNs). To solve this problem, we propose a novel energy-efficient CS-DG algorithm, which exploits the better reconstruction accuracy of the adjacency matrix of an unbalanced expander graph. In the proposed CS-DG algorithm, each measurement is the sum of a few sensory data, which are jointly determined by random sampling and random walks. Through theoretical analysis, we prove that the constructedM×N sparse binary sensing matrix is the adjacency matrix of a (k; ") unbalanced expander graph whenM=D O(N=k) and t=D O.Nc=(kq) for WSNs with Nc clusters, where 0 ≤q≤1 and Nc > k. Simulation results show our proposed CS-DG has better performance than existing algorithms in terms of reconstruction accuracy and energy consumption. When hybrid energy-efficient distributed clustering algorithm is used, to achieve the same reconstruction accuracy, our proposed CS-DG can save energy by at least 27:8%
A Survey on Energy-Efficient Strategies in Static Wireless Sensor Networks
A comprehensive analysis on the energy-efficient strategy in static Wireless Sensor Networks (WSNs) that are not equipped with any energy harvesting modules is conducted in this article. First, a novel generic mathematical definition of Energy Efficiency (EE) is proposed, which takes the acquisition rate of valid data, the total energy consumption, and the network lifetime of WSNs into consideration simultaneously. To the best of our knowledge, this is the first time that the EE of WSNs is mathematically defined. The energy consumption characteristics of each individual sensor node and the whole network are expounded at length. Accordingly, the concepts concerning EE, namely the Energy-Efficient Means, the Energy-Efficient Tier, and the Energy-Efficient Perspective, are proposed. Subsequently, the relevant energy-efficient strategies proposed from 2002 to 2019 are tracked and reviewed. Specifically, they respectively are classified into five categories: the Energy-Efficient Media Access Control protocol, the Mobile Node Assistance Scheme, the Energy-Efficient Clustering Scheme, the Energy-Efficient Routing Scheme, and the Compressive Sensing--based Scheme. A detailed elaboration on both of the basic principle and the evolution of them is made. Finally, further analysis on the categories is made and the related conclusion is drawn. To be specific, the interdependence among them, the relationships between each of them, and the Energy-Efficient Means, the Energy-Efficient Tier, and the Energy-Efficient Perspective are analyzed in detail. In addition, the specific applicable scenarios for each of them and the relevant statistical analysis are detailed. The proportion and the number of citations for each category are illustrated by the statistical chart. In addition, the existing opportunities and challenges facing WSNs in the context of the new computing paradigm and the feasible direction concerning EE in the future are pointed out
Sparse Spectrum Sensing in Infrastructure-less Cognitive Radio Networks via Binary Consensus Algorithms
Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to
exploit the sparse nature of the occupation of the primary users. Also,
distributed spectrum sensing has been proposed to tackle the wireless channel
problems, like node or link failures, rather than the common (centralized
approach) for spectrum sensing. In this paper, we propose a distributed
spectrum sensing framework based on consensus algorithms where SU nodes
exchange their binary decisions to take global decisions without a fusion
center to coordinate the sensing process. Each SU will share its decision with
its neighbors, and at every new iteration each SU will take a new decision
based on its current decision and the decisions it receives from its neighbors;
in the next iteration, each SU will share its new decision with its neighbors.
We show via simulations that the detection performance can tend to the
performance of majority rule Fusion Center based CRNs
- …