1,011 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
Towards Energy Neutrality in Energy Harvesting Wireless Sensor Networks: A Case for Distributed Compressive Sensing?
This paper advocates the use of the emerging distributed compressive sensing
(DCS) paradigm in order to deploy energy harvesting (EH) wireless sensor
networks (WSN) with practical network lifetime and data gathering rates that
are substantially higher than the state-of-the-art. In particular, we argue
that there are two fundamental mechanisms in an EH WSN: i) the energy diversity
associated with the EH process that entails that the harvested energy can vary
from sensor node to sensor node, and ii) the sensing diversity associated with
the DCS process that entails that the energy consumption can also vary across
the sensor nodes without compromising data recovery. We also argue that such
mechanisms offer the means to match closely the energy demand to the energy
supply in order to unlock the possibility for energy-neutral WSNs that leverage
EH capability. A number of analytic and simulation results are presented in
order to illustrate the potential of the approach.Comment: 6 pages. This work will be presented at the 2013 IEEE Global
Communications Conference (GLOBECOM), Atlanta, US, December 201
Distributed Compressed Sensing for Sensor Networks with Packet Erasures
We study two approaches to distributed compressed sensing for in-network data
compression and signal reconstruction at a sink in a wireless sensor network
where sensors are placed on a straight line. Communication to the sink is
considered to be bandwidth-constrained due to the large number of devices. By
using distributed compressed sensing for compression of the data in the
network, the communication cost (bandwith usage) to the sink can be decreased
at the expense of delay induced by the local communication necessary for
compression. We investigate the relation between cost and delay given a certain
reconstruction performance requirement when using basis pursuit denoising for
reconstruction. Moreover, we analyze and compare the performance degradation
due to erased packets sent to the sink of the two approaches.Comment: Paper accepted to GLOBECOM 201
Compressed Sensing based Dynamic PSD Map Construction in Cognitive Radio Networks
In the context of spectrum sensing in cognitive radio networks, collaborative spectrum sensing has been proposed as a way to overcome multipath and shadowing, and hence increasing the reliability of the sensing. Due to the high amount of information to be transmitted, a dynamic compressive sensing approach is proposed to map the PSD estimate to a sparse domain which is then transmitted to the fusion center. In this regard, CRs send a compressed version of their estimated PSD to the fusion center, whose job is to reconstruct the PSD estimates of the CRs, fuse them, and make a global decision on the availability of the spectrum in space and frequency domains at a given time. The proposed compressive sensing based method considers the dynamic nature of the PSD map, and uses this dynamicity in order to decrease the amount of data needed to be transmitted between CR sensors’ and the fusion center. By using the proposed method, an acceptable PSD map for cognitive radio purposes can be achieved by only 20 % of full data transmission between sensors and master node. Also, simulation results show the robustness of the proposed method against the channel variations, diverse compression ratios and processing times in comparison with static methods
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
An ACO and Mobile Sink based Algorithm for Improvement of ML-MAC for Wsns using Compressive Sensing
WSN is becoming key subject of research in computational basic principle because of its great deal of applications. ACO( Ant Colony Optimization) constructs the redirecting or routing tree via a method by which, for every single circular or round, Base Station (BS) chooses the root node in addition to shows the following substitute for every node. In order to prevail over the actual constraints with the sooner work a new increased method proposed in this research work. The proposed method has the capacity to prevail over the constraints of ACO routing protocol using the principle with reactivity, mobile sink and also the compressive sensing technique. In this paper we measure the main parameters that affect the wsn that are network lifetime, packets dropped, throughput, end to end delay and remaining energy for proposed algorithm and simulation results have shown that the proposed algorithm is highly effective
- …