Ahmed A. Jasim, Noor Riyadh Issa, Hisham A. Shehadeh, Fadhil Mukhlif ¡ 6 authors
Abstract The Wireless Sensor Networks (WSNs), which are deployed in harsh environments, are extremely susceptible to localized battery exhaustion as well as intelligent inside routing threats, especially sinkhole and data falsification attacks. In this paper, we present ECHVM (Enhanced Cluster Head selection by Voting and an ECC-based Blockchain Mechanism), a novel, secure, and energy-efficient routing framework to achieve an optimal trade-off between network security and hardware resource efficiency. We present the ECHVM protocol that combines Elliptic Curve Cryptography (ECC) with a lightweight, local distributed ledger to mitigate risks of centralized authority by transferring the verification of crucial network events from a single, highly vulnerable centralized alert sink node to a decentralized, voting-based consensus among neighboring nodes. In this study, a weighted voting algorithm based on node and distance proximity metrics is applied to cluster head selection, where a 51% neighbor consensus rule is leveraged to validate local ledger transactions against malicious acts. Moreover, a local energy density and topological communication geometry-oriented energy-efficient cluster head (CH) selection algorithm is crafted to ensure balanced CH distribution in the high-density areas of the network structure so as to avoid the premature energy hole problem. Using the standard first-order radio energy model, quantitative simulations performed in MATLAB show that ECHVM achieves a malicious node detection rate of 98.2% and extends the network lifetime by 30% compared to state-of-the-art protocols (e.g., ELSO and SEC-HDT) because of proactive topology defense and rapid node sleeping. The results of statistical validation using the Wilcoxon Signed-Rank test confirm that both the reduction in energy consumption and network longevity offered by ECHVM are highly significant ( p = 0.019), justifying ECHVM as a mathematically sound, permanent, scalable security framework suitable for resource-constrained, dense Internet of Things (IoT) and smart sensing applications for next-generation communication systems.
P. Thanalakshmi, V. G. Kiruthika, J. C. Gokul Abinash, P. Saravanan ¡ 6 authors
Wireless Sensor Networks (WSNs) are vulnerable to malicious nodes and sensor node failures, which compromise data integrity and network reliability. These threats result in incorrect decisions and reduce system trust. To address this, machine learning algorithms enable anomaly detection by identifying abnormal sensor nodes, while blockchain ensures secure and tamper-proof data storage. However, reliable consensus is essential before data validation in the blockchain. A hybrid framework combining ML, blockchain, and a modified HotStuff consensus algorithm with post-quantum cryptographic systems provides secure, fault-tolerant, and quantum-resistant consensus, ensuring trustworthy and resilient WSN operations.
Wireless Sensor Networks (WSNs) are widely used in critical applications such as environmental monitoring, healthcare, industrial automation, and military surveillance; however, their resource constraints, wireless communication, and unattended deployment make them highly vulnerable to node capture attacks.In such attacks, adversaries physically compromise sensor nodes to extract cryptographic keys and sensitive information, leading to key leakage, node impersonation, communication disruption, and large-scale network compromise.Existing key management schemes often rely on static key structures, they lack forward secrecy, and fail to identify structurally vulnerable nodes, resulting in weak resilience against progressive node capture attacks.To address these limitations, this paper proposes a threshold-based ECDHE-TSSS key management framework to detect vulnerable nodes and mitigate node capture attacks in WSNs.The proposed scheme introduces an attack matrix based on graph-theoretic metrics to identify high-risk nodes and provide adaptive protection through decentralized masking of secret shares.The Proposed Scheme integrates Elliptic Curve Diffie-Hellman Ephemeral (ECDHE) with Threshold Shamir Secret Sharing (TSSS) to achieve forward secrecy and strong resistance against node compromise while maintaining lightweight operations suitable for resource-constrained environments.A layered security architecture incorporating Schnorr-based Non-Interactive Zero-Knowledge Proof (NIZKP) authentication and distributed key revocation further enhances network resilience and secure communication.Simulation results demonstrate that the proposed scheme significantly reduces key compromise probability and improves overall network robustness compared with existing approaches.
Wireless sensor networks (WSNs) integrated with the internet of things (IoT) are hybrid technologies of interconnected systems. The IoT connects various devices, from sensors to smart gadget networks, and leverages a framework to provide secure solutions. This paper presents a lightweight adaptive proof-of-stake (APoS) blockchain framework design specifically for IoT-WSN. It focuses on efficient energy, scalability, and robust security. The proposed model integrates a hybrid APoS-delegated PoS (DPoS) consensus mechanism, trust-based routing, and a random forest (RF)-driven intrusion detection system (IDS). Extensive simulations of 100 to 10,000 nodes display energy usage of 0.018â0.019 mJ/node, breach of privacy rates of 0.02%, and throughput up to 9.92 tx/round for 1,000 nodes and 3.40 tx/round for GreenOrbs validation. The IDS achieves 94.21% accuracy for 1,000 nodes and 88.89% for GreenOrbs against distributed denial-of-service (DDoS), Sybil, and Jamming attacks. Validated using the GreenOrbs dataset, the framework ensures real-world applicability in resource-constrained WSNs. Future research has validated and verified the use of APoS and PoS hybrid models for broader decentralised IoTâWSN deployments.
Yenlik Begimbayeva, Temirlan Zhaxalykov, Amir Akhtanov, Ruslan Pashkevich ¡ 6 authors
This research focuses on enhancing the security of decentralized quantum key distribution (QKD) networks, where the absence of a central authority creates significant challenges such as malicious node infiltration, undetected key leakage, and unauthorized re-entry of revoked participants. Traditional authentication and trust models are insufficient for fully distributed QKD topologies, which remain highly vulnerable to insider threats and persistent compromise. To address these risks, letâs propose a layered security framework composed of three integrated components: Challenge-Response Authentication (CRA), Dynamic Trust Scoring (DTS), and Blockchain-Based Access Control (BBAC). CRA verifies node legitimacy through randomized quantum-state interactions, significantly reducing impersonation and quantum replay attacks. DTS implements real-time trust evaluation using anomaly detection to dynamically downgrade compromised nodes based on their behavioral deviations. BBAC maintains an immutable and tamper-proof trust ledger to block revoked nodes from re-entering under falsified identities and resists Sybil attacks using post-quantum cryptographic primitives. Simulation results confirm that the system improves detection rates of covert threats, ensures authentication latency under 10 ms, and reduces re-entry success to zero. The proposed architecture ensures long-term scalability and resilience, making it applicable to critical domains such as finance, national infrastructure, and military communication. This work contributes a novel, verifiable, and scalable solution to one of the most pressing open problems in distributed quantum networks
ABSTRACT The emergence of wireless technology brought about enhanced communication across various devices, resulting in the demand for efficient and reliable wireless networks, like wireless mesh networks (WMNs) and mobile Adâhoc Networks (MANETs). MANETs are known for their decentralized nature, rapid deployment, infrastructureâless operation, adaptability, and ease of use in several applications and outdoor events. Despite their flexibility, they often face challenges relating to security vulnerabilities, together with blackhole and grayhole attacks, and tradeâoffs in terms of performance relating to reliability and integrity. This paper proposes an improved, innovative routing protocol for Adâhoc OnâDemand Distance Vector (AODV) by infusion of blockchain's proof of stake (PoS) consensus mechanism named PoSAODV, whose objective is to enhance security, energyâefficiency, and adaptability while reducing packet loss rate, routing overheads, and increasing throughput. Smart contractâbased validator selection was utilized to ensure fairness and reduce blackhole and grayhole attacks. The result obtained through simulation demonstrates that PoSAODV outperforms the original AODV by reduced latency of 0.79 ms , average throughput of 45 Mbps , and packet delivery ratio of 80%â100% in both unsafe and safe environments. This makes PoSAODV suitable for resourceâconstrained adâhoc networks with dynamic topologies.
This paper introduces a novel architecture for a distributed ledger, commonly referred to as a "blockchain", which is organized in the form of directed acyclic graph (DAG) with UTXO transactions as vertices, rather than as a chain of blocks. Consensus on the state of ledger assets is achieved through the cooperative consensus: an profit-driven behavior of token holders themselves, which is viable only when they cooperate by following the "biggest ledger coverage rule", akin the "longest chain rule" of Bitcoin. The cooperative behavior is facilitated by enforcing purposefully designed UTXO transaction validity constraints. Token holders are the sole category of participants authorized to make amendments to the ledger, making participation completely permissionless - without miners, validators, committees or staking - and without any need of knowledge about the composition of the set of all participants in the consensus. The setup allows to achieve high throughput and scalability alongside with low transaction costs, while preserving key aspects of high decentralization, open participation, and asynchronicity found in Bitcoin and other proof-of-work blockchains, but without huge energy consumption. Sybil protection is achieved similarly to proof-of-stake blockchains, using tokens native to the ledger, yet the architecture operates in a leaderless manner without block proposers and committee selection.
Alexandr Kuznetsov, Emanuele Frontoni, Marco Arnesano, Kateryna Kuznetsova
Blockchain-based sensor networks offer promising solutions for secure and transparent data management in IoT ecosystems. However, efficient set membership proofs remain a critical challenge, particularly in resource-constrained environments. This paper introduces a novel OR-aggregation approach (where âORâ refers to proving that an element equals at least one member of a set without revealing which one) for zero-knowledge set membership proofs, tailored specifically for blockchain-based sensor networks. We provide a comprehensive theoretical foundation, detailed protocol specification, and rigorous security analysis. Our implementation incorporates optimization techniques for resource-constrained devices and strategies for integration with prominent blockchain platforms. Extensive experimental evaluation demonstrates the superiority of our approach over existing methods, particularly for large-scale deployments. Results show significant improvements in proof size, generation time, and verification efficiency. The proposed OR-aggregation technique offers a scalable and privacy-preserving solution for set membership verification in blockchain-based IoT applications, addressing key limitations of current approaches. Our work contributes to the advancement of efficient and secure data management in large-scale sensor networks, paving the way for wider adoption of blockchain technology in IoT ecosystems.
Transport Layer Security (TLS) protocol is a cryptographic protocol designed to secure communication over the internet. The TLS protocol has become a fundamental in secure communication, most commonly used for securing web browsing sessions. In this work, we investigate the TLSNotary protocol, which aim to enable the Client to obtain proof of provenance for data from TLS session, while getting as much as possible from the TLS security properties. To achieve such proofs without any Server-side adjustments or permissions, the power of secure multi-party computation (MPC) together with zero knowledge proofs is used to extend the standard TLS Protocol. To make the compliacted landscape of MPC as comprehensible as possible we first introduce the cryptographic primitives required to understand the TLSNotary protocol and go through standard TLS protocol. Finally, we look at the TLSNotary protocol in detail.
Wireless Sensor Networks (WSNs) play a crucial role in modern distributed systems, supporting applications such as smart cities, healthcare, and industrial automation. However, their decentralized and resource-constrained nature makes them highly vulnerable to malicious node attacks, including data manipulation, packet dropping, and routing disruption. Traditional detection techniques based on rule-based or statistical methods are inadequate for handling dynamic and complex attack patterns. Recent advancements in Artificial Intelligence (AI), particularly Vision Transformers (ViTs) with cross-attention mechanisms, have significantly improved malicious node detection by capturing global dependencies and contextual relationships in network data. Simultaneously, blockchain technology has emerged as a robust solution for secure, decentralized, and tamper-proof data storage in WSNs. Blockchain-based WSN architectures enhance data integrity, transparency, and trust through distributed ledgers and smart contracts. Studies show that blockchain-integrated detection frameworks can achieve near-perfect classification accuracy while ensuring secure data transmission. Furthermore, hybrid AI-blockchain systems combine intelligent detection with secure storage, improving resilience against attacks. This survey reviews recent methods, compares architectures, identifies research gaps, and highlights future directions for developing secure and scalable WSN systems.
Krzysztof Gogol, Benjamin Kraner, Malte Schlosser, Tao Yan ¡ 6 authors
Liquid staking has become the largest category of decentralized finance protocols in terms of total value locked. However, few studies exist on its implementation designs or underlying risks. The liquid staking protocols allow for earning staking rewards without the disadvantage of locking the capital at the validators. Yet, they are seen by some as a threat to the Proof-of-Stake blockchain security. This paper is the first work that classifies liquid staking implementations. It analyzes the historical performance of major liquid staking tokens in comparison to the traditional staking for the largest Proof-of-Stake blockchains. Furthermore, the research investigates the impact of centralization, maximum extractable value and the migration of Ethereum from Proof-of-Work to Proof-of-Stake on the tokens' performance. Examining the tracking error of the liquid stacking providers to the staking rewards shows that they are persistent and cannot be explained by macro-variables of the currency, such as the variance or return.
Wireless Sensor Networks (WSNs) are essential for data collection across various domains but face growing risks from replication attacks, which introduce new vulnerabilities and security challenges. To address this issue, we propose a novel hybrid approach that integrates Distributed Ledger Technology (DLT) with adaptive Machine Learning (ML) methods, aiming to bolster both security and trustworthiness within WSNs. Specifically, our approach utilizes DLT to secure voting records and manage rewards, while adaptive ML models detect replica nodes by analyzing network parameters, including location, signal strength, and transmission rate. We present and evaluate three ML-based models for detecting replication attacks: 1) Random Forest Model (RFM), 2) Adaptive Weighted Random Forest Model based on Predicted Replica Nodes (AWRFM-PRN), and 3) Adaptive Weighted Random Forest Model based on Predicted Good and Replica Nodes (AWRFM-PGRN). The AWRFM-PRN and AWRFM-PGRN models enhance detection accuracy through iterative weight adjustments based on previous predictions. Our simulations show that the hybrid approach significantly improves detection performance compared to traditional methods. We evaluated our models by increasing the dataset size with varying proportions of replica nodes across ten subsets. We found that the AWRFM-PGRN model achieved around 71% accuracy when replica nodes comprised 50% or more of the network. Meanwhile, the AWRFM-PRN model demonstrated high effectiveness with accuracy ranging from 80% to 99% for replica nodes constituting 15% to 40% of the network. Furthermore, all models delivered nearly 99.9% accuracy when the proportion of replica nodes was between 5% and 10%. This innovative integration of DLT with adaptive ML modeling establishes a benchmark for robust and tamper-proof security in WSNs, offering significant enhancements over traditional ML techniques such as RFM, particularly in scenarios with high replica node counts.
A system of zero-knowledge proofs on graph signatures has been proposed, where a graph can be signed, and the owner of the graph signature can prove a graph relation such as the connectivity and isolation of any two vertexes on the graph without disclosing all information about the graph. The correctness of the graph information is guaranteed by the signature. One of the applications is a virtualized infrastructure, where an infrastructure provider manages a distributed system, and each tenant is allocated a specific portion of this infrastructure for use. Tenants need to check with the provider that their resources are properly connected (connectivity) and that their resources are properly separated from the resources of other tenants (isolation). On the other hand, the provider cannot simply disclose the entire infrastructure topology to each tenant. Using the zero-knowledge proof system on graph signatures, both requirements can be addressed. Previously, an efficient zero-knowledge proof system on graph signatures using a bilinear-map accumulator has been proposed, where the verification time and the size of the proof data do not depend on the number of graph vertexes and edges. However, this system has two problems. First, since the proof does not include labels, it is not possible to prove the connectivity considering network bandwidth and cost. Second, since it assumes undirected graphs, it cannot handle applications on directed graphs such as network flows. In this paper, we extend the previous system and propose a zero-knowledge proof system of the connectivity for directed graphs where each edge has labels. We implemented our system on a PC using a pairing library and evaluate it by measuring the processing times. Compared to the conference version of this paper, we show the formal definitions and the security proofs of our proposed system, and add implementation-based evaluations reflecting the application to the virtualized infrastructure.
T. Gobinath, Sanjay Kumar Sonkar, Vinod N. Alone, C. Thiripurasundari
As a distributed and decentralized ledger that ensures secure and transparent transactions, blockchain technology has attracted considerable interest. In the context of wireless sensor networks (WSNs), where nodes with limited resources conduct transactions, ensuring efficient and trustworthy validation becomes a challenge. Using random forests, this paper proposes a novel method for enhancing blockchain transaction validation in WSNs. The proposed method enhances the accuracy and efficiency of transaction validation in WSNs by leveraging the ensemble-learning capabilities of random forests. The random forests model is trained with transaction content, originating node information, and network metrics extracted from WSN transactions. Experimental results indicate that the proposed method improves transaction validation precision and decreases validation time in comparison to conventional methods. In addition, the random forests model is resistant to multiple types of attacks, assuring the security and integrity of WSN transactions. The results demonstrate that random forests are a promising technique for improving blockchain transaction validation in wireless sensor networks.
Zahoor Ali Khan, Sana Amjad, Farwa Ahmed, Abdullah M. Almasoud ¡ 6 authors
Over the past few years, great importance has been given to wireless sensor networks (WSNs) as they play a significant role in facilitating the world with daily life services like healthcare, military, social products, etc. However, heterogeneous nature of WSNs makes them prone to various attacks, which results in low throughput, and high network delay and high energy consumption. In the WSNs, routing is performed using different routing protocols like low-energy adaptive clustering hierarchy (LEACH), heterogeneous gateway-based energy-aware multi-hop routing (HMGEAR), etc. In such protocols, some nodes in the network may perform malicious activities. Therefore, four deep learning (DL) techniques and a real-time message content validation (RMCV) scheme based on blockchain are used in the proposed network for the detection of malicious nodes (MNs). Moreover, to analyse the routing data in the WSN, DL models are trained on a state-of-the-art dataset generated from LEACH, known as WSN-DS 2016. The WSN contains three types of nodes: sensor nodes, cluster heads (CHs) and the base station (BS). The CHs after aggregating the data received from the sensor nodes, send it towards the BS. Furthermore, to overcome the single point of failure issue, a decentralized blockchain is deployed on CHs and BS. Additionally, MNs are removed from the network using RMCV and DL techniques. Moreover, legitimate nodes (LNs) are registered in the blockchain network using proof-of-authority consensus protocol. The protocol outperforms proof-of-work in terms of computational cost. Later, routing is performed between the LNs using different routing protocols and the results are compared with original LEACH and HMGEAR protocols. The results show that the accuracy of GRU is 97%, LSTM is 96%, CNN is 92% and ANN is 90%. Throughput, delay and the death of the first node are computed for LEACH, LEACH with DL, LEACH with RMCV, HMGEAR, HMGEAR with DL and HMGEAR with RMCV. Moreover, Oyente is used to perform the formal security analysis of the designed smart contract. The analysis shows that blockchain network is resilient against vulnerabilities.
This research aims to compare the performance between the Gated Recurrent Unit (GRU) and Long Short-Term Memory (LSTM) methods in predicting the Bitcoin exchange rate against the US Dollar (BTC-USD). The data used comes from Yahoo Finance for the period 2017-2022. Each model is built with a comparable architecture and evaluated using Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), coefficient of determination (R²), and prediction accuracy metrics. The results show that the LSTM model performed better on the test data with a MAPE of 3.80% and an accuracy of 96.20%, while the GRU model achieved a MAPE of 5.13% and an accuracy of 94.87%. Although the GRU model performed better on the training data, the LSTM model showed better generalization ability on the testing data. This research provides important insights into the selection of the optimal recurrent neural network architecture for Bitcoin exchange rate prediction which is known for its high volatility.
It is the expansion and use of the Industrial Internet of Things (IIoT) in various industrial sectors and applications that are referred to as the Industrial Internet of Things (IIoT). The Industrial Internet of Things includes industrial applications such as robots, medical devices, and softwareâdefined manufacturing processes. In terms of energy conservation, routing is extremely essential. The creation of an energy effectual steering procedure leads to a substantial rise in energy consumption. To minimize network traffic and increase network life, the article presented an Industrial IoT Fuzzy Logic EnergyâAware Routing Protocol (FLEAâRPL), which decreases network traffic as well as improves network life. The most suitable parent for data transfer is selected based on, among other things, the routing parameters charge, residual energy, and expected transmission count. Since the load routing metric is taken into consideration during the construction of the route, the data traffic is spread across the network. This increases networkâs lifetime while maintaining a high packet delivery ratio. The proposed work proposes a Multilayer EnergyâAware Aware RPL (MCEAâRPL) cluster for the Internet of Things to decrease network data traffic while increasing the lifetime of the network. It is split into three phases, each including the creation of network rings, intraring divisions, and intercluster routing. First and foremost, the virtual ring is created in the network. Secondly, each ring forms an identical cluster and chooses the CH node. Finally, it is responsible for the maintenance and performance of the DODAG. Data transfer from the lesser sheet to the DODAG root is known as data transfer. By using Blockchain technology, the lifetime of a network may be extended by reducing the number of identical data package transfers. This article offers Enhanced Mobility Support RPL (EMâRPL) in Industrial IoT which enhances mobility support with blockchain and spreads system generation. It comprises two processes: a collection of the parental static node and selection of the parent moving node. The static parent selection method uses routing metrics load and residual energy to identify the parent that is most suited for data transfer. Two phases of mobile parent selection must be distinguished: data transmission and route rediscovery. The mobile node utilizes furious logic to compute the handâoff value of the metric packet errors ratio and the signal strength indication received from the base station. If the handâoff value exceeds the threshold limit, the DODAG route has to be changed to work correctly. The EMâRPL thus increases the package delivery rate by reducing the amount of route interruption caused by mobility, while offering an efficient handling mechanism.
Adeel Ahmed, Saima Abdullah, Muhammad Bukhsh, Israr Ahmad ¡ 5 authors
The Internet of Things (IoT) is getting important and interconnected technologies of the world, consisting of sensor devices. The internet is smoothly changing from an internet of people towards an Internet of Things, which permits various objects to connect to another wirelessly. The energy consumption of the IoT routing protocol can affect the network life span. In addition, the high volume of data produced by IoT will result in transmission collision, security issues, and energy dissipation due to increased data redundancy because tiny sensors are usually hard to recharge after they are deployed. Generally, to save energy, data aggregation reduces data redundancy at each node by turning some nodes into sleep mode and others into wake mode. Therefore, it is important to group the nodes with high data similarity using the fuzzy matrix. Then, the data received from the member nodes at the Cluster Head (CH) are analyzed using a fuzzy similarity matrix for clustering. In the next step, after clustering, some nodes are chosen from all groups as redundant nodes. The sleep scheduling mechanism is then applied to reduce data redundancy, network traffic jamming, and transmission costs. We have proposed an Energy-Efficient Data Aggregation Mechanism (EEDAM) secured by blockchain, which uses a data aggregation mechanism at the cluster level to save energy. As edge computing is used to provide on-demand trusted services to IoT with minimum delay, blockchain is integrated inside a cloud server, so the edge is validated by the blockchain to provide secure services to IoT. Finally, we performed simulations to calculate the performance of the proposed mechanism and compared it with the conventional energy-efficient algorithms. The simulation results show that the proposed structural design can successfully reduce the amount of data, provide proper security to the IoT, and extend the wireless sensor network (WSN).
Wireless sensor networks (WSNs) and Internet of Things (IoT) have gained more popularity in recent years as an underlying infrastructure for connected devices and sensors in smart cities. The data generated from these sensors are used by smart cities to strengthen their infrastructure, utilities, and public services. WSNs are suitable for long periods of data acquisition in smart cities. To make the networks of smart cities more reliable for sensitive information, the blockchain mechanism has been proposed. The key issues and challenges of WSNs in smart cities is efficiently scheduling the resources; leading to extending the network lifetime of sensors. In this paper, a linear network coding (LNC) for WSNs with blockchain-enabled IoT devices has been proposed. The consumption of energy is reduced for each node by applying LNC. The efficiency and the reliability of the proposed model are evaluated and compared to those of the existing models. Results from the simulation demonstrate that the proposed model increases the efficiency in terms of the number of live nodes, packet delivery ratio, throughput, and the optimized residual energy compared to other current techniques.
Eryk Schiller, Elfat Esati, Sina Rafati Niya, Burkhard Stiller
This work develops an integration of Blockchains (BC) with the Internet-of-Things (IoT) using a highly constrained TelosB IoT platform based on the MSP430 processor family and CC2420 IEEE 802.15.4-compliant radio interfaces. The system is evaluated in an indoor office environment focusing on overhead and energy efficiency of BC transaction (TX) transmissions.
Speech is a natural user interface for the Internet of Things system. However, the presence of noise affects severely the performance of such system. With the deployment of smart devices with microphones, one can form a powerful acoustic sensor network to enhance the speech via beamforming techniques. On the other hand, reliability of data transmission also determines the beamforming performance, since faulty data will drift the beamformer steering location randomly. Currently, there is no protection scheme for acoustic data transmitted over the wireless network in order to keep steady beamforming performance. In this article, we design a compound distributed beamformer, where nodes are grouped and the system is embedded with blockchain technology to protect the data integrity during transmission. It attempts to provide more possible reliable connections between groups. Simulated experiments show that the distributed beamformer with blockchain protection is able to maintain steady beamforming performance.
PaweĹ ĹniataĹa, M. Hadi Amini, Kianoosh G. Boroojeni
Information fusion has been a topic of immense interest owing to its applicability in various applications. This brings to the fore the need for a flexible and accurate fusion algorithm that can be versatile. The BrooksâIyengar algorithm is one such fusion algorithm. It has since its inception found numerous applications that deal with the fusion of data from multiple sources. The uniqueness of the BrooksâIyengar algorithm is the ease with which the data from multiple sensors in a local system can be fused and also reach consensus in a distributed system with the added capability of fault tolerance. Blockchain has found its use as a distributed ledger and has successfully supported and fueled many crypto-currencies over the years. Information fusion with regard to blockchains is a topic of great research interest in the past couple of years. Since blockchain has no official node, the introduction of a decentralized network and a consensus algorithm is required in making the interactions and exchanges between multiple suppliers easier and thus leads to business being carried out without any hassles. In this paper, we attempt to understand and describe the deployment of multiple sensors to measure various aspects of the physical world. We discuss a novel technique of employing the BrooksâIyengar algorithm in the design of the system that would decentralize the data source from the corresponding measurements and thus ensure the integrity of the transactions in the blockchain. Finally, a theoretical analysis of the performance of the algorithm when used in a blockchain based decentralized environment is also discussed.
Open access
Distributed systems and fault tolerance
Distributed Sensor Networks and Detection Algorithms
A trusted routing scheme is very important to ensure the routing security and efficiency of wireless sensor networks (WSNs). There are a lot of studies on improving the trustworthiness between routing nodes, using cryptographic systems, trust management, or centralized routing decisions, etc. However, most of the routing schemes are difficult to achieve in actual situations as it is difficult to dynamically identify the untrusted behaviors of routing nodes. Meanwhile, there is still no effective way to prevent malicious node attacks. In view of these problems, this paper proposes a trusted routing scheme using blockchain and reinforcement learning to improve the routing security and efficiency for WSNs. The feasible routing scheme is given for obtaining routing information of routing nodes on the blockchain, which makes the routing information traceable and impossible to tamper with. The reinforcement learning model is used to help routing nodes dynamically select more trusted and efficient routing links. From the experimental results, we can find that even in the routing environment with 50% malicious nodes, our routing scheme still has a good delay performance compared with other routing algorithms. The performance indicators such as energy consumption and throughput also show that our scheme is feasible and effective.
The Internet of Things (IoT) has been widely used because of its high efficiency and real-time collaboration. A wireless sensor network is the core technology to support the operation of the IoT, and the security problem is becoming more and more serious. Aiming at the problem that the existing malicious node detection methods in wireless sensor networks cannot be guaranteed by fairness and traceability of detection process, we present a blockchain trust model (BTM) for malicious node detection in wireless sensor networks. First, it gives the whole framework of the trust model. Then, it constructs the blockchain data structure which is used to detect malicious nodes. Finally, it realizes the detection of malicious nodes in 3D space by using the blockchain smart contract and the WSNs' quadrilateral measurement localization method, and the voting consensus results are recorded in the blockchain distributed. The simulation results show that the model can effectively detect malicious nodes in WSNs, and it can also ensure the traceability of the detection process.