Distributed Change Detection via Average Consensus over Networks

Distributed change-point detection has been a fundamental problem when performing real-time monitoring using sensor-networks. We propose a distributed detection algorithm, where each sensor only exchanges CUSUM statistic with their neighbors based on the average consensus scheme, and an alarm is raised when local consensus statistic exceeds a pre-specified global threshold. We provide theoretical performance bounds showing that the performance of the fully distributed scheme can match the centralized algorithms under some mild conditions. Numerical experiments demonstrate the good performance of the algorithm especially in detecting asynchronous changes.Comment: 15 pages, 8 figure

Distributed estimation over a low-cost sensor network: a review of state-of-the-art

Proliferation of low-cost, lightweight, and power efficient sensors and advances in networked systems enable the employment of multiple sensors. Distributed estimation provides a scalable and fault-robust fusion framework with a peer-to-peer communication architecture. For this reason, there seems to be a real need for a critical review of existing and, more importantly, recent advances in the domain of distributed estimation over a low-cost sensor network. This paper presents a comprehensive review of the state-of-the-art solutions in this research area, exploring their characteristics, advantages, and challenging issues. Additionally, several open problems and future avenues of research are highlighted

Bibliographic Review on Distributed Kalman Filtering

In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area

Asynchronous Distributed Averaging on Communication Networks

Distributed algorithms for averaging have attracted interest in the control and sensing literature. However, previous works have not addressed some practical concerns that will arise in actual implementations on packet-switched communication networks such as the Internet. In this paper, we present several implementable algorithms that are robust to asynchronism and dynamic topology changes. The algorithms are completely distributed and do not require any global coordination. In addition, they can be proven to converge under very general asynchronous timing assumptions. Our results are verified by both simulation and experiments on Planetlab, a real-world TCP/IP network. We also present some extensions that are likely to be useful in applications

Wireless indoor localisation within the 5G internet of radio light

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonNumerous applications can be enhanced by accurate and efficient indoor localisation using wireless sensor networks, however trade-offs often exist between these two parameters. In this thesis, realworld and simulation data is used to examine the hybrid millimeter wave and Visible Light Communications (VLC) architecture of the 5G Internet of Radio Light (IoRL) Horizon 2020 project. Consequently, relevant localisation challenges within Visible Light Positioning (VLP) and asynchronous sampling networks are identified, and more accurate and efficient solutions are developed. Currently, VLP relies strongly on the assumed Lambertian properties of light sources. However, in practice, not all lights are Lambertian. To support the widespread deployment of VLC technology in numerous environments, measurements from non-Lambertian sources are analysed to provide new insights into the limitations of existing VLP techniques. Subsequently, a novel VLP calibration technique is proposed, and results indicate a 59% accuracy improvement against existing methods. This solution enables high accuracy centimetre level VLP to be achieved with non- Lambertian sources. Asynchronous sampling of range-based measurements is known to impact localisation performance negatively. Various Asynchronous Sampling Localisation Techniques (ASLT) exist to mitigate these effects. While effective at improving positioning performance, the exact suitability of such solutions is not evident due to their additional processes, subsequent complexity, and increased costs. As such, extensive simulations are conducted to study the effectiveness of ASLT under variable sampling latencies, sensor measurement noise, and target trajectories. Findings highlight the computational demand of existing ASLT and motivate the development of a novel solution. The proposed Kalman Extrapolated Least Squares (KELS) method achieves optimal localisation performance with a significant energy reduction of over 50% when compared to current leading ASLT. The work in this thesis demonstrates both the capability for high performance VLP from non- Lambertian sources as well as the potential for energy efficient localisation for sequentially sampled range measurements.Horizon 202