This paper presents an occupant localization technique that determines the location of individuals in indoor environments by analyzing the structural vibrations of the floor caused by their footsteps. Structural vibration waves are difficult to measure as they are influenced by various factors, including the complex nature of wave propagation in heterogeneous and dispersive media (such as the floor) as well as the inherent noise characteristics of sensors observing the vibration wavefronts. The proposed vibration-based occupant localization technique minimizes the errors that occur during the signal acquisition time. In this process, the likelihood function of each sensor-representing where the occupant likely resides in the environment-is fused to obtain a consensual localization result in a collective manner. In this work, it becomes evident that the above sources of uncertainties can render certain sensors deceptive, commonly referred to as "Byzantines." Because the ratio of Byzantines among the set sensors defines the success of the collective localization results, this paper introduces a Byzantine sensor elimination (BSE) algorithm to prevent the unreliable information of Byzantine sensors from affecting the location estimations. This algorithm identifies and eliminates sensors that generate erroneous estimates, preventing the influence of these sensors on the overall consensus. To validate and benchmark the proposed technique, a set of previously conducted controlled experiments was employed. The empirical results demonstrate the proposed technique's significant improvement (3~0%) over the baseline approach in terms of both accuracy and precision.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC10708826 | PMC |
http://dx.doi.org/10.3390/s23239309 | DOI Listing |
Sensors (Basel)
December 2024
School of Cyberspace Science and Technology, Beijing Jiaotong University, Beijing 100044, China.
Blockchain technology can be used in the IoT to ensure the data privacy collected by sensors. In blockchain systems, consensus mechanisms are a key technology for maintaining data consistency and correctness. Among the various consensus protocols, asynchronous Byzantine consensus protocols offer strong robustness as they do not rely on any network timing assumptions during design.
View Article and Find Full Text PDFSensors (Basel)
November 2024
James Watt School of Engineering, University of Glasgow, Glasgow G12 8QQ, UK.
Practical Byzantine Fault Tolerance (PBFT) is one of the most popular consensus mechanisms for the consortium and private blockchain technology. It has been recognized as a candidate consensus mechanism for the Internet of Things networks as it offers lower resource requirements and high performance when compared with other consensus mechanisms such as proof of work. In this paper, by considering the blockchain nodes are wirelessly connected, we model the network nodes distribution and transaction arrival rate as Poisson point process and we develop a framework for evaluating the performance of the wireless PBFT network.
View Article and Find Full Text PDFHeliyon
November 2024
Department of Mathematics and Statistics, The University of Lahore, Sargodha 40100, Pakistan.
This paper investigates the behavior of fractional-order nonlinear multi-agent systems subjected to Byzantine assaults, specifically focusing on the manipulations of both sensors and actuators. We employ weighted graphs, both directed and undirected, to illustrate the system's topology. Our methodology combines algebraic graph theory with fractional-order Lyapunov techniques to develop algebraic requirements for leader-following consensus, providing a robust framework for analyzing consensus dynamics in these complex systems.
View Article and Find Full Text PDFSensors (Basel)
August 2024
Guangzhou Institute of Software, Guangzhou 510006, China.
Recent Byzantine Fault-Tolerant (BFT) State Machine Replication (SMR) protocols increasingly focus on scalability and security to meet the growing demand for Distributed Ledger Technology (DLT) applications across various domains. Current BFT consensus algorithms typically require a single leader node to receive and validate votes from the majority process and broadcast the results, a design challenging to scale in large systems. We propose a fast-response consensus algorithm based on improvements to HotStuff, aimed at enhancing transaction ordering speed and overall performance of distributed systems, even in the presence of faulty copies.
View Article and Find Full Text PDFSensors (Basel)
December 2023
Department of Computer Engineering, Chungbuk National University, Cheongju 28644, Republic of Korea.
Blockchain is a distributed database technology that operates in a P2P network and is used in various domains. Depending on its structure, blockchain can be classified into types such as public and private. A consensus algorithm is essential in blockchain, and various consensus algorithms have been applied.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!