Green Sensing and Communication: A Step Towards Sustainable IoT Systems
01 Apr 2020-Journal of the Indian Institute of Science (Springer India)-Vol. 100, Iss: 2, pp 383-398
...read more
Citations
More filters
[...]
TL;DR: This article presents an adaptive multi-sensing framework for a network of densely deployed solar energy harvesting wireless nodes where each node is mounted with heterogeneous sensors to sense multiple cross-correlated slowly-varying parameters/signals.
Abstract: This article presents an adaptive multi-sensing (MS) framework for a network of densely deployed solar energy harvesting wireless nodes. Each node is mounted with heterogeneous sensors to sense multiple cross-correlated slowly-varying parameters/signals. Inherent spatio-temporal correlations of the observed parameters are exploited to adaptively activate a subset of sensors of a few nodes and turn-OFF the remaining ones. To do so, a multi-objective optimization problem that jointly optimizes sensing quality and network energy efficiency is solved for each monitoring parameter. To increase energy efficiency, network and node-level collaborations based multi-sensing strategies are proposed. The former one utilizes spatial proximity (SP) of nodes with active sensors (obtained from the MS) to further reduce the active sensors sets, while the latter one exploits cross-correlation (CC) among the observed parameters at each node to do so. A retraining logic is developed to prevent deterioration of sensing quality in MS-SP. For jointly estimating all the parameters across the field nodes using under-sampled measurements obtained from MS-CC based active sensors, a multi-sensor data fusion technique is presented. For this ill-posed estimation scenario, double sparsity due to spatial and cross-correlation among measurements is used to derive principal component analysis-based Kronecker sparsifying basis, and sparse Bayesian learning framework is then used for joint sparse estimation. Extensive simulation studies using synthetic (real) data illustrate that, the proposed MS-SP and MS-CC strategies are respectively $48.2\ (52.09)\%$ and $50.30\ (8.13)\%$ more energy-efficient compared to respective state-of-the-art techniques while offering stable sensing quality. Further, heat-maps of estimated field signals corresponding to synthetically generated and parsimoniously sensed multi-source parameters are also provided which may aid in source localization Internet-of-Things applications.
8 citations
Cites methods from "Green Sensing and Communication: A ..."
[...]
[...]
TL;DR: The developed AAPMD system consumes 10-times less energy while using 5G NB-IoT communication module, which makes it a very competitive candidate for massive deployment in highly polluted metro cities like Delhi and Kolkata, in India.
Abstract: We have designed a 5G-capable environmental sensing network (ESN) node prototype, called Advanced Air Pollution Monitoring Device (AAPMD). The developed prototype system measures concentrations of NO 2 , Ozone, carbon monoxide, and sulphur dioxide using semiconductor sensors. Further, the system gathers other environmental parameters like temperature, humidity, PM 1 , PM 2 . 5 , and PM 10 . The prototype is equipped with a GPS sub-system for accurate geo-tagging. The board communicates through Wi-Fi and NB-IoT. AAPMD is also implemented with energy harvesting power management, and is powered through solar energy and battery backup. Compared to the conventional designs with Wi-Fi-based connectivity, the developed system consumes 10-times less energy while using 5G NB-IoT communication module, which makes it a very competitive candidate for massive deployment in highly polluted metro cities like Delhi and Kolkata, in India. The system can provide updated measurements of pollutant levels with controllable time granularity.
4 citations
Cites background from "Green Sensing and Communication: A ..."
[...]
[...]
TL;DR: Novel channel prediction frameworks using stochastic modeling as well as data-driven learning of channel variability are proposed, which are complemented with an adaptive channel coding scheme to increase the transmission reliability of time-critical grid monitoring data over a wireless channel.
Abstract: This article presents a new paradigm for channel dynamics adaptive transmission of intermittent data in smart grid IoT communication networks, wherein novel channel prediction frameworks using stochastic modeling as well as data-driven learning of channel variability are proposed. A probing-based transmission is also proposed as a benchmark. These prediction frameworks are complemented with an adaptive channel coding scheme to increase the transmission reliability of time-critical grid monitoring data over a wireless channel. Through analyzing the prediction and packet loss performance at varying SNR and fading conditions, it is noted that the stochastic modeling framework is efficient when the fading correlation in the channel is high while the learning-based approach is more adaptive to channel dynamics as the correlation reduces. The proposed frameworks are easily implementable on low-cost end nodes, owing to the optimal selection of parameters for low runtime complexity. When compared to probing-based data transmission for a given fading in the channel, the packet loss probability of the learning-based transmission closely matches while with stochastic model loss probability is found to be 12.3% higher. However, their respective signaling overheads are 38% and 98% lower with respect to the probing-based approach, which is a significant gain at the cost of marginally additional computation complexity.
3 citations
Cites background from "Green Sensing and Communication: A ..."
[...]
[...]
TL;DR: This perspective paper concentrates on the “green AI” concept as an enabler of the smart city transformation, as it offers the opportunity to move away from purely technocentric efficiency solutions towards efficient, sustainable and equitable solutions capable of realizing the desired urban futures.
Abstract: Smart cities and artificial intelligence (AI) are among the most popular discourses in urban policy circles. Most attempts at using AI to improve efficiencies in cities have nevertheless either struggled or failed to accomplish the smart city transformation. This is mainly due to short-sighted, technologically determined and reductionist AI approaches being applied to complex urbanization problems. Besides this, as smart cities are underpinned by our ability to engage with our environments, analyze them, and make efficient, sustainable and equitable decisions, the need for a green AI approach is intensified. This perspective paper, reflecting authors’ opinions and interpretations, concentrates on the “green AI” concept as an enabler of the smart city transformation, as it offers the opportunity to move away from purely technocentric efficiency solutions towards efficient, sustainable and equitable solutions capable of realizing the desired urban futures. The aim of this perspective paper is two-fold: first, to highlight the fundamental shortfalls in mainstream AI system conceptualization and practice, and second, to advocate the need for a consolidated AI approach—i.e., green AI—to further support smart city transformation. The methodological approach includes a thorough appraisal of the current AI and smart city literatures, practices, developments, trends and applications. The paper informs authorities and planners on the importance of the adoption and deployment of AI systems that address efficiency, sustainability and equity issues in cities.
3 citations
Cites background from "Green Sensing and Communication: A ..."
[...]
[...]
TL;DR: Improved energy efficiency and network energy balance of the proposed framework over the existing closest competitive centralized and decentralized approaches are illustrated.
Abstract: This paper addresses the problem of decentralized sensor selection in an energy-constrained wireless sensor network-based Internet-of-Things, for monitoring a spatio-temporally varying process. To do so, an adaptive edge computing framework and its variants are proposed which distributedly optimize a critical trade-off between sensing quality and remaining energy of the sensor nodes (SNs). Unlike the existing distributed sensing approaches, the proposed one aims to maintain energy balance among the SNs. The original sensor selection problem is decoupled into multiple sub-problems, each solvable at an edge node elected as head of a coverage region containing a set of SNs. The sub-problem in each coverage region is adapted to variations of the underlying process. In each region, the process is estimated using PCA-SBL (principal component analysis-sparse Bayesian learning) on noisy signal measured by the respective active SNs. Further, to correctly adapt to the process and estimate the signal, a novel logic is designed that indicates requirement of network retraining in the next measurement cycle. The results from extensive simulation studies illustrate improved energy efficiency and network energy balance of the proposed framework over the existing closest competitive centralized and decentralized approaches. The proposed framework is tested on synthetic as well as real data-sets of a sensor network.
1 citations
Cites background from "Green Sensing and Communication: A ..."
[...]
References
More filters
Book•
[...]
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.
Abstract: Suppose x is an unknown vector in Ropfm (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible by transform coding with a known transform, and we reconstruct via the nonlinear procedure defined here, the number of measurements n can be dramatically smaller than the size m. Thus, certain natural classes of images with m pixels need only n=O(m1/4log5/2(m)) nonadaptive nonpixel samples for faithful recovery, as opposed to the usual m pixel samples. More specifically, suppose x has a sparse representation in some orthonormal basis (e.g., wavelet, Fourier) or tight frame (e.g., curvelet, Gabor)-so the coefficients belong to an lscrp ball for 0
18,593 citations
"Green Sensing and Communication: A ..." refers methods in this paper
[...]
Book•
[...]
01 Jan 1968
TL;DR: Detection, estimation, and modulation theory, Detection, estimation and modulation theorists, اطلاعات رسانی کشاورزی .
Abstract: Detection, estimation, and modulation theory , Detection, estimation, and modulation theory , مرکز فناوری اطلاعات و اطلاع رسانی کشاورزی
3,908 citations
"Green Sensing and Communication: A ..." refers methods in this paper
[...]
[...]
TL;DR: The presented analysis shows that in the noiseless setting, the proposed algorithm can exactly reconstruct arbitrary sparse signals provided that the sensing matrix satisfies the restricted isometry property with a constant parameter.
Abstract: We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and reconstruction accuracy of the same order as that of linear programming (LP) optimization methods. The presented analysis shows that in the noiseless setting, the proposed algorithm can exactly reconstruct arbitrary sparse signals provided that the sensing matrix satisfies the restricted isometry property with a constant parameter. In the noisy setting and in the case that the signal is not exactly sparse, it can be shown that the mean-squared error of the reconstruction is upper-bounded by constant multiples of the measurement and signal perturbation energies.
2,008 citations
Posted Content•
[...]
TL;DR: In this paper, the subspace pursuit algorithm was proposed for sparse signals with and without noisy perturbations, which has low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and reconstruction accuracy of the same order as that of LP optimization methods.
Abstract: We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and reconstruction accuracy of the same order as that of LP optimization methods. The presented analysis shows that in the noiseless setting, the proposed algorithm can exactly reconstruct arbitrary sparse signals provided that the sensing matrix satisfies the restricted isometry property with a constant parameter. In the noisy setting and in the case that the signal is not exactly sparse, it can be shown that the mean squared error of the reconstruction is upper bounded by constant multiples of the measurement and signal perturbation energies.
1,850 citations
[...]
TL;DR: This paper adapts SBL to the signal processing problem of basis selection from overcomplete dictionaries, proving several results about the SBL cost function that elucidate its general behavior and providing solid theoretical justification for this application.
Abstract: Sparse Bayesian learning (SBL) and specifically relevance vector machines have received much attention in the machine learning literature as a means of achieving parsimonious representations in the context of regression and classification. The methodology relies on a parameterized prior that encourages models with few nonzero weights. In this paper, we adapt SBL to the signal processing problem of basis selection from overcomplete dictionaries, proving several results about the SBL cost function that elucidate its general behavior and provide solid theoretical justification for this application. Specifically, we have shown that SBL retains a desirable property of the /spl lscr//sub 0/-norm diversity measure (i.e., the global minimum is achieved at the maximally sparse solution) while often possessing a more limited constellation of local minima. We have also demonstrated that the local minima that do exist are achieved at sparse solutions. Later, we provide a novel interpretation of SBL that gives us valuable insight into why it is successful in producing sparse representations. Finally, we include simulation studies comparing sparse Bayesian learning with basis pursuit and the more recent FOCal Underdetermined System Solver (FOCUSS) class of basis selection algorithms. These results indicate that our theoretical insights translate directly into improved performance.
1,119 citations
Related Papers (5)
[...]
[...]
[...]