Optimized Node Selection for Compressive Sleeping Wireless Sensor Networks

In this paper, we propose an active node selection framework for compressive sleeping wireless sensor networks (WSNs) in order to improve signal acquisition performance, network lifetime and the use of spectrum resources. While conventional compressive sleeping WSNs only exploit the spatial correlation of SNs, the proposed approach further exploits the temporal correlation by selecting active nodes using the support of the data reconstructed in the previous time instant. The node selection problem is framed as the design of a specialized sensing matrix, where the sensing matrix consists of selected rows of an identity matrix. By capitalizing on a genie-aided reconstruction procedure, we formulate the active node selection problem into an optimization problem, which is then approximated by a constrained convex relaxation plus a rounding scheme. Simulation results show that our proposed active node selection approach leads to an improved reconstruction performance, network lifetime and spectrum usage in comparison to various node selection schemes for compressive sleeping WSNs.This is the accepted manuscript. The final published version is available from IEEE at http://dx.doi.org/10.1109/TVT.2015.2400635

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

Compressed sensing signal and data acquisition in wireless sensor networks and internet of things

The emerging compressed sensing (CS) theory can significantly reduce the number of sampling points that directly corresponds to the volume of data collected, which means that part of the redundant data is never acquired. It makes it possible to create standalone and net-centric applications with fewer resources required in Internet of Things (IoT). CS-based signal and information acquisition/compression paradigm combines the nonlinearreconstruction algorithm and random sampling on a sparsebasis that provides a promising approach to compress signal and data in information systems. This paper investigates how CS can provide new insights into data sampling and acquisition in wireless sensor networks and IoT. First, we briefly introduce the CS theory with respect to the sampling and transmission coordination during the network lifetime through providing a compressed sampling process with low computation costs. Then, a CS-based framework is proposed for IoT, in which the end nodes measure, transmit, and store the sampled data in the framework. Then, an efficient cluster-sparse reconstruction algorithm is proposed for in-network compression aiming at more accurate data reconstruction and lower energy efficiency. Performance is evaluated with respect to network size using datasets acquired by a real-life deployment

Low-power distributed sparse recovery testbed on wireless sensor networks

Recently, distributed algorithms have been proposed for the recovery of sparse signals in networked systems, e.g. wire- less sensor networks. Such algorithms allow large networks to operate autonomously without the need of a fusion center, and are very appealing for smart sensing problems employing low-power devices. They exploit local communications, where each node of the network updates its estimates of the sensed signal also based on the correlated information received from neighboring nodes. In the literature, theoretical results and numerical simulations have been presented to prove convergence of such methods to accurate estimates. Their implementation, however, raises some concerns in terms of power consumption due to iterative inter- node communications, data storage, computation capabilities, global synchronization, and faulty communications. On the other hand, despite these potential issues, practical implementations on real sensor networks have not been demonstrated yet. In this paper we fill this gap and describe a successful implementation of a class of randomized, distributed algorithms on a real low-power wireless sensor network testbed with very scarce computational capabilities. We consider a distributed compressed sensing problem and we show how to cope with the issues mentioned above. Our tests on synthetic and real signals show that distributed compressed sensing can successfully operate in a real-world environment

Variational Bayesian algorithm for distributed compressive sensing

Distributed compressive sensing (DCS) concerns the reconstruction of multiple sensor signals with reduced numbers of measurements, which exploits both intra- and inter-signal correlations. In this paper, we propose a novel Bayesian DCS algorithm based on variational Bayesian inference. The proposed algorithm decouples the common component, that characterizes inter-signal correlation, from innovation components, that represent intra-signal correlation. Such an operation results in a computational complexity of reconstruction which is linear with the number of signals. The superior performance of the algorithm, in terms of the computing time and reconstruction quality, is demonstrated by numerical simulations in comparison with other existing reconstruction methods.This work is supported by EPSRC Research Grant (EP/K033700/1); the Natural Science Foundation of China (61401018, U1334202); the State Key Laboratory of Rail Traffic Control and Safety (RCS2014ZT08), Beijing Jiaotong University; the Fundamental Research Funds for the Central Universities (2014JBM149); the Key Grant Project of Chinese Ministry of Education (313006); the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education MinistryThis is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/ICC.2015.724909