1,121 research outputs found

    D-SLATS: Distributed Simultaneous Localization and Time Synchronization

    Full text link
    Through the last decade, we have witnessed a surge of Internet of Things (IoT) devices, and with that a greater need to choreograph their actions across both time and space. Although these two problems, namely time synchronization and localization, share many aspects in common, they are traditionally treated separately or combined on centralized approaches that results in an ineffcient use of resources, or in solutions that are not scalable in terms of the number of IoT devices. Therefore, we propose D-SLATS, a framework comprised of three different and independent algorithms to jointly solve time synchronization and localization problems in a distributed fashion. The First two algorithms are based mainly on the distributed Extended Kalman Filter (EKF) whereas the third one uses optimization techniques. No fusion center is required, and the devices only communicate with their neighbors. The proposed methods are evaluated on custom Ultra-Wideband communication Testbed and a quadrotor, representing a network of both static and mobile nodes. Our algorithms achieve up to three microseconds time synchronization accuracy and 30 cm localization error

    An Exploratory Analysis Of A Time Synchronization Protocol For UAS

    Get PDF
    This dissertation provides a numerical analysis of a Receiver Only Synchronization (ROS) protocol which is proposed for use by Unmanned Aircraft Systems (UAS) in Beyond Visual Line of Sight (BVLOS) operations. The use of ROS protocols could reinforce current technologies that enable transmission over 5G cell networks, decreasing latency issues and enabling the incorporation of an increased number of UAS to the network, without loss of accuracy. A minimum squared error (MSE)-based accuracy of clock offset and clock skew estimations was obtained using the number of iterations and number of observations as independent parameters. Although the model converged after only four iterations, the number of observations needed was considerably large, of no less than about 250. The noise, introduced in the system through the first residual, the correlation parameter and the disturbance terms, was assumed to be autocorrelated. Previous studies suggested that correlated noise might be typical in multipath scenarios, or in case of damaged antennas. Four noise distributions: gaussian, exponential, gamma and Weibull were considered. Each of them is adapted to different noise sources in the OSI model. Dispersion of results in the first case, the only case with zero mean, was checked against the Cramér-Rao Bound (CRB) limit. Results confirmed that the scheme proposed was fully efficient. Moreover, results with the other three cases were less promising, thus demonstrating that only zero mean distributions could deliver good results. This fact would limit the proposed scheme application in multipath scenarios, where echoes of previous signals may reach the receiver at delayed times. In the second part, a wake/sleep scheme was imposed on the model, concluding that for wake/sleep ratios below 92/08 results were not accurate at p=.05 level. The study also evaluated the impact of noise levels in the time domain and showed that above -2dB in time a substantial contribution of error terms disturbed the initial estimations significantly. The tests were performed in Matlab®. Based on the results, three venues confirming the assumptions made were proposed for future work. Some final reflections on the use of 5G in aviation brought the present dissertation to a close

    Mobility Prediction Based Neighborhood Discovery for Mobile Ad Hoc Networks

    Get PDF
    Hello protocol is the basic technique for neighborhood discovery in wireless ad hoc networks. It requires nodes to claim their existence/aliveness by periodic `hello' messages. Central to any hello protocol is the determination of `hello' message transmission rate. No fixed optimal rate exists in the presence of node mobility. The rate should in fact adapt to it, high for high mobility and low for low mobility. In this paper, we propose a novel mobility prediction based hello protocol, named ARH ({\em Autoregressive Hello protocol}). In this protocol, each node predicts its own position by an ever-updated autoregression-based mobility model, and neighboring nodes predict its position by the same mobility model. The node transmits `hello' message (for location update) only when the predicted location is too different from the true location (causing topology distortion), triggering mobility model correction on both itself and each of its neighbors. ARH evolves along with network dynamics, and seamlessly tunes itself to the optimal configuration on the fly using local knowledge only. Through extensive simulation, we demonstrate the effectiveness and efficiency of ARH, in comparison with the best known competitive protocol TAP (Turnover based Adaptive hello Protocol). It comes out that ARH achieves the same high neighborhood discovery performance as TAP with dramatically less message overhead (about 50% lower `hello' rate)

    Real-Time Management of Multimodal Streaming Data for Monitoring of Epileptic Patients

    Get PDF
    This is the Accepted Manuscript version of the following article: I. Mporas, D. Triantafyllopoulos, V. Megalooikonomou, “Real-Time Management of Multimodal Streaming Data for Monitoring of Epileptic Patients”, Journal of Medical Systems, Vol. 40(45), December 2015. The final published versions is available at: https://link.springer.com/article/10.1007%2Fs10916-015-0403-3 © Springer Science+Business Media New York 2015.New generation of healthcare is represented by wearable health monitoring systems, which provide real-time monitoring of patient’s physiological parameters. It is expected that continuous ambulatory monitoring of vital signals will improve treatment of patients and enable proactive personal health management. In this paper, we present the implementation of a multimodal real-time system for epilepsy management. The proposed methodology is based on a data streaming architecture and efficient management of a big flow of physiological parameters. The performance of this architecture is examined for varying spatial resolution of the recorded data.Peer reviewedFinal Accepted Versio

    A Sensor Network with Embedded Data Processing and Data-to-Cloud Capabilities for Vibration-Based Real-Time SHM

    Get PDF
    This work describes a network of low power/low-cost microelectromechanical- (MEMS-) based three-axial acceleration sensors with local data processing and data-to-cloud capabilities. In particular, the developed sensor nodes are capable to acquire acceleration time series and extract their frequency spectrum peaks, which are autonomously sent through an ad hoc developed gateway device to an online database using a dedicated transfer protocol. The developed network minimizes the power consumption to monitor remotely and in real time the acceleration spectra peaks at each sensor node. An experimental setup in which a network of 5 sensor nodes is used to monitor a simply supported steel beam in free vibration conditions is considered to test the performance of the implemented circuitry. The total weight and energy consumption of the entire network are, respectively, less than 50 g and 300 mW in continuous monitoring conditions. Results show a very good agreement between the measured natural vibration frequencies of the beam and the theoretical values estimated according to the classical closed formula. As such, the proposed monitoring network can be considered ideal for the SHM of civil structures like long-span bridges

    Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks

    Get PDF
    Copyright © 2014 Derui Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

    Identification of Distributed Parameter Systems Based on Sensor Networks

    Get PDF

    The Public Service Media and Public Service Internet Manifesto

    Get PDF
    This book presents the collectively authored Public Service Media and Public Service Internet Manifesto and accompanying materials.The Internet and the media landscape are broken. The dominant commercial Internet platforms endanger democracy. They have created a communications landscape overwhelmed by surveillance, advertising, fake news, hate speech, conspiracy theories, and algorithmic politics. Commercial Internet platforms have harmed citizens, users, everyday life, and society. Democracy and digital democracy require Public Service Media. A democracy-enhancing Internet requires Public Service Media becoming Public Service Internet platforms – an Internet of the public, by the public, and for the public; an Internet that advances instead of threatens democracy and the public sphere. The Public Service Internet is based on Internet platforms operated by a variety of Public Service Media, taking the public service remit into the digital age. The Public Service Internet provides opportunities for public debate, participation, and the advancement of social cohesion. Accompanying the Manifesto are materials that informed its creation: Christian Fuchs’ report of the results of the Public Service Media/Internet Survey, the written version of Graham Murdock’s online talk on public service media today, and a summary of an ecomitee.com discussion of the Manifesto’s foundations
    • …
    corecore