654 research outputs found
Graph Signal Processing: Overview, Challenges and Applications
Research in Graph Signal Processing (GSP) aims to develop tools for
processing data defined on irregular graph domains. In this paper we first
provide an overview of core ideas in GSP and their connection to conventional
digital signal processing. We then summarize recent developments in developing
basic GSP tools, including methods for sampling, filtering or graph learning.
Next, we review progress in several application areas using GSP, including
processing and analysis of sensor network data, biological data, and
applications to image processing and machine learning. We finish by providing a
brief historical perspective to highlight how concepts recently developed in
GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE
Energy-efficient information inference in wireless sensor networks based on graphical modeling
This dissertation proposes a systematic approach, based on a probabilistic graphical model, to infer missing observations in wireless sensor networks (WSNs) for sustaining environmental monitoring. This enables us to effectively address two critical challenges in WSNs: (1) energy-efficient data gathering through planned communication disruptions resulting from energy-saving sleep cycles, and (2) sensor-node failure tolerance in harsh environments. In our approach, we develop a pairwise Markov Random Field (MRF) to model the spatial correlations in a sensor network. Our MRF model is first constructed through automatic learning from historical sensed data, by using Iterative Proportional Fitting (IPF). When the MRF model is constructed, Loopy Belief Propagation (LBP) is then employed to perform information inference to estimate the missing data given incomplete network observations. The proposed approach is then improved in terms of energy-efficiency and robustness from three aspects: model building, inference and parameter learning. The model and methods are empirically evaluated using multiple real-world sensor network data sets. The results demonstrate the merits of our proposed approaches
Topology control and data handling in wireless sensor networks
Our work in this thesis have provided two distinctive contributions to WSNs in the
areas of data handling and topology control.
In the area of data handling, we have demonstrated a solution to improve the
power efficiency whilst preserving the important data features by data compression
and the use of an adaptive sampling strategy, which are applicable to the specific
application for oceanography monitoring required by the SECOAS project. Our work
on oceanographic data analysis is important for the understanding of the data we are
dealing with, such that suitable strategies can be deployed and system performance
can be analysed. The Basic Adaptive Sampling Scheduler (BASS) algorithm uses
the statistics of the data to adjust the sampling behaviour in a sensor node according
to the environment in order to conserve energy and minimise detection delay.
The motivation of topology control (TC) is to maintain the connectivity of the
network, to reduce node degree to ease congestion in a collision-based medium access
scheme; and to reduce power consumption in the sensor nodes. We have developed
an algorithm Subgraph Topology Control (STC) that is distributed and does not
require additional equipment to be implemented on the SECOAS nodes. STC uses
a metric called subgraph number, which measures the 2-hops connectivity in the
neighbourhood of a node. It is found that STC consistently forms topologies that
have lower node degrees and higher probabilities of connectivity, as compared to k-Neighbours, an alternative algorithm that does not rely on special hardware on sensor
node. Moreover, STC also gives better results in terms of the minimum degree in the
network, which implies that the network structure is more robust to a single point
of failure. As STC is an iterative algorithm, it is very scalable and adaptive and is
well suited for the SECOAS applications
Data Compression in Multi-Hop Large-Scale Wireless Sensor Networks
Data collection from a multi-hop large-scale outdoor WSN deployment for environmental monitoring is full of challenges due to the severe resource constraints on small battery-operated motes (e.g., bandwidth, memory, power, and computing capacity) and the highly dynamic wireless link conditions in an outdoor communication environment. We present a compressed sensing approach which can recover the sensing data at the sink with good accuracy when very few packets are collected, thus leading to a significant reduction of the network traffic and an extension of the WSN lifetime. Interplaying with the dynamic WSN routing topology, the proposed approach is efficient and simple to implement on the resource-constrained motes without motes storing of a part of random measurement matrix, as opposed to other existing compressed sensing based schemes. We provide a systematic method via machine learning to find a suitable representation basis, for the given WSN deployment and data field, which is both sparse and incoherent with the measurement matrix in the compressed sensing. We validate our approach and evaluate its performance using our real-world multi-hop WSN testbed deployment in situ in collecting the humidity and soil moisture data. The results show that our approach significantly outperforms three other compressed sensing based algorithms regarding the data recovery accuracy for the entire WSN observation field under drastically reduced communication costs. For some WSN scenarios, compressed sensing may not be applicable. Therefore we also design a generalized predictive coding framework for unified lossless and lossy data compression. In addition, we devise a novel algorithm for lossless compression to significantly improve data compression performance for variouSs data collections and applications in WSNs. Rigorous simulations show our proposed framework and compression algorithm outperform several recent popular compression algorithms for wireless sensor networks such as LEC, S-LZW and LTC using various real-world sensor data sets, demonstrating the merit of the proposed framework for unified temporal lossless and lossy data compression in WSNs
Recommended from our members
Employing Information and Communications Technologies in Homes and Cities for the Health and Well-Being of Older People
YesHe X and Sheriff RE (Eds.) Employing ICT in Homes and Cities for the Health and Well-Being of Older People. Workshop Proceedings of ICT4HOPâ16. 15-17 Aug 2016. Sichuan University, Chengdu, China.British Council, Researcher Links, Newton Fund, NSF
A Sensor Network Data Compression Algorithm Based on Suboptimal Clustering and Virtual Landmark Routing Within Clusters
A kind of data compression algorithm for sensor networks based on suboptimal clustering and virtual landmark routing within clusters is proposed in this paper. Firstly, temporal redundancy existing in data obtained by the same node in sequential instants can be eliminated. Then sensor networks nodes will be clustered. Virtual node landmarks in clusters can be established based on cluster heads. Routing in clusters can be realized by combining a greedy algorithm and a flooding algorithm. Thirdly, a global structure tree based on cluster heads will be established. During the course of data transmissions from nodes to cluster heads and from cluster heads to sink, the spatial redundancy existing in the data will be eliminated. Only part of the raw data needs to be transmitted from nodes to sink, and all raw data can be recovered in the sink based on a compression code and part of the raw data. Consequently, node energy can be saved, largely because transmission of redundant data can be avoided. As a result the overall performance of the sensor network can obviously be improved
Evaluation of Tunable Data Compression in Energy-Aware Wireless Sensor Networks
Energy is an important consideration in wireless sensor networks. In the current compression evaluations, traditional indices are still used, while energy efficiency is probably neglected. Moreover, various evaluation biases significantly affect the final results. All these factors lead to a subjective evaluation. In this paper, a new criterion is proposed and a series of tunable compression algorithms are reevaluated. The results show that the new criterion makes the evaluation more objective. Additionally it indicates the situations when compression is unnecessary. A new adaptive compression arbitration system is proposed based on the evaluation results, which improves the performance of compression algorithms
Recommended from our members
ReSCon '09, Research Student Conference: Book of Abstracts
The second SED Research Student Conference (ReSCon2009) was hosted over three days, 22-24 June 2009, in the Lecture Centre at Brunel University. The conference consisted of technical presentations, a poster session and social events. The abstracts and presentations were the result of ongoing research by postgraduate research students from the School of Engineering and Design at Brunel University. The conference is held annually, and ReSCon plays a key role in contributing to research and innovations within the School
Applications of Prediction Approaches in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) collect data and continuously monitor ambient data such as temperature, humidity and light. The continuous data transmission of energy constrained sensor nodes is a challenge to the lifetime and performance of WSNs. The type of deployment environment is also and the network topology also contributes to the depletion of nodes which threatens the lifetime and the also the performance of the network. To overcome these challenges, a number of approaches have been proposed and implemented. Of these approaches are routing, clustering, prediction, and duty cycling. Prediction approaches may be used to schedule the sleep periods of nodes to improve the lifetime. The chapter discusses WSN deployment environment, energy conservation techniques, mobility in WSN, prediction approaches and their applications in scheduling the sleep/wake-up periods of sensor nodes
- âŠ