Broadcast Protocol Research Articles

DC-SoC: Optimizing a Blockchain Data Dissemination Model Based on Density Clustering and Social Mechanisms

Due to its partially decentralized and highly scalable features, the consortium blockchain has currently overtaken other blockchain technologies as the one most frequently used and studied across various industries. However, performance issues such as low transaction efficiency and redundant communication processes continue to hinder the development of consortium blockchains. In the Hyperledger Fabric consortium blockchain system, transaction efficiency is largely influenced by the consensus protocol and broadcast protocol. This paper introduces a novel consortium blockchain network model, DC-SoC, focused on optimizing broadcast protocols. By incorporating the concept of density clustering, a stable propagation structure is established for the blockchain network, thus optimizing data dissemination in the Gossip protocol. Additionally, the concept of social networks is integrated, using trustworthiness scores and economic incentives to evaluate node security. The experimental results demonstrate that when DC-SoC is applied in a large-scale consortium blockchain environment, it significantly improves communication performance between nodes and ensures transmission reliability.

Proposed Supercluster-Based UMBBFS Routing Protocol for Emergency Message Dissemination in Edge-RSU for 5G VANET

Vehicular ad hoc networks (VANETs) can bolster road safety through the proactive dissemination of emergency messages (EMs) among vehicles, effectively reducing the occurrence of traffic-related accidents. It is difficult to transmit EMs quickly and reliably due to the high-speed mobility of VANET and the attenuation of the wireless signal. However, poor network design and high vehicle mobility are the two most difficult problems that affect VANET’s network performance. The real-time traffic situation and network dependability will also be significantly impacted by route selection and message delivery. Many of the current works have undergone studies focused on forwarder selection and message transmission to address these problems. However, these earlier approaches, while effective in forwarder selection and routing, have overlooked the critical aspects of communication overhead and excessive energy consumption, resulting in transmission delays. To address the prevailing challenges, the proposed solutions use edge computing to process and analyze data locally from surrounding cars and infrastructure. EDGE-RSUs are positioned by the side of the road. In intelligent transportation systems, this lowers latency and enhances real-time decision-making by employing proficient forwarder selection techniques and optimizing the dissemination of EMs. In the context of 5G-enabled VANET, this paper introduces a novel routing protocol, namely, the supercluster-based urban multi-hop broadcast and best forwarder selection protocol (UMB-BFS). The improved twin delay deep deterministic policy gradient (IT3DPG) method is used to select the target region for emergency message distribution after route selection. Clustering is conducted using modified density peak clustering (MDPC). Improved firefly optimization (IFO) is used for optimal path selection. In this way, all emergency messages are quickly disseminated to multiple directions and also manage the traffic in VANET. Finally, we plotted graphs for the following metrics: throughput (3.9 kbps), end-to-end delay (70), coverage (90%), packet delivery ratio (98%), packet received (12.75 k), and transmission delay (57 ms). Our approach’s performance is examined using numerical analysis, demonstrating that it performs better than the current methodologies across all measures.

Quantum broadcasting of the generalized GHZ state: quantum noise analysis using quantum state tomography via IBMQ simulation

This study focuses on the challenges posed by quantum noise to communication protocols, with a particular emphasis on the vulnerabilities of current quantum broadcast protocols. The research employs the generalized GHZ state, known for its multipartite entangled cluster state with real-value coefficients, as a diagnostic tool to understand and address the impact of quantum noise on transmitted information. Implementing two novel controlled quantum broadcast schemes on the IBM Quantum (IBMQ) Experience platform, using the Qiskit library and the QASM simulator, the investigation evaluates the effects of four different types of quantum noise through Kraus operator models. A notable aspect of the study is the pioneering use of quantum state tomography for a comprehensive analysis of quantum noise effects, providing novel insights into the resilience of quantum communication protocols.

TortoiseBFT: An asynchronous consensus algorithm for IoT system

Traditional partial synchronous Byzantine fault tolerant (BFT) protocols are confronted with new challenges when applied to large-scale networks like IoT systems, which bring about rigorous demand for the liveness and consensus efficiency of BFT protocols in asynchronous network environments. HoneyBadgerBFT is the first practical asynchronous BFT protocol, which employs a reliable broadcast protocol (RBC) to broadcast transactions and an asynchronous binary agreement protocol (ABA) to determine whether transactions should be committed. DumboBFT is a follow-up proposal that requires fewer instances of ABA and achieves higher throughput than HoneyBadgerBFT, but it does not optimize the communication overhead of HoneyBadgerBFT.In this paper, we propose TortoiseBFT, a high-performance asynchronous BFT protocol with three stages. We can significantly reduce communication overhead by determining the order of transactions first and requesting missing transactions after. Our two-phase transaction recovery mechanism enables nodes to recover missing transactions by seeking help from 2f+1 nodes. To improve the overall throughput of the system, we lower the verification overhead of threshold signatures in HoneyBadgerBFT, DumboBFT, and DispersedLedger from On3 to On2. We develop a node reputation model that selects producers with stable network conditions, which helps to reduce the number of random lotteries. Experimental results show that TortoiseBFT improves system throughput, reduces transaction delays, and minimizes communication overhead compared to HoneyBadgerBFT, DumboBFT, and DispersedLedger.

Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state

In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Consensus among the correct components can be reached by appropriately crafted communication protocols even in the presence of byzantine faults. Quantum-aided protocols built upon distributed entangled quantum states are worth considering, as they are more resilient than traditional ones. Based on earlier ideas, here we establish a parameter-dependent family of quantum-aided weak broadcast protocols. We compute upper bounds on the failure probability of the protocol, and define and illustrate a procedure that minimizes the quantum resource requirements. Following earlier work demonstrating the suitability of noisy intermediate scale quantum (NISQ) devices for the study of quantum networks, we experimentally create our resource quantum state on publicly available quantum computers. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.

I-SBA: an improved SBA broadcast protocol to minimize forwarding for wireless ad-hoc networks

I-SBA: an improved SBA broadcast protocol to minimize forwarding for wireless ad-hoc networks

Learning Broadcast Protocols

The problem of learning a computational model from examples has been receiving growing attention. For the particularly challenging problem of learning models of distributed systems, existing results are restricted to models with a fixed number of interacting processes. In this work we look for the first time (to the best of our knowledge) at the problem of learning a distributed system with an arbitrary number of processes, assuming only that there exists a cutoff, i.e., a number of processes that is sufficient to produce all observable behaviors. Specifically, we consider fine broadcast protocols, these are broadcast protocols (BPs) with a finite cutoff and no hidden states. We provide a learning algorithm that can infer a correct BP from a sample that is consistent with a fine BP, and a minimal equivalent BP if the sample is sufficiently complete. On the negative side we show that (a) characteristic sets of exponential size are unavoidable, (b) the consistency problem for fine BPs is NP hard, and (c) that fine BPs are not polynomially predictable.

Parameterized complexity of broadcasting in graphs

The task of the broadcast problem is, given a graph G and a source vertex s, to compute the minimum number of rounds required to disseminate a piece of information from s to all vertices in the graph. It is assumed that, at each round, an informed vertex can transmit the information to at most one of its neighbors. The broadcast problem is known to NP-hard. We show that the problem is FPT when parametrized by the size k of a feedback edge set, or by the size k of a vertex cover, or by k=n−t, where t is the input deadline for the broadcast protocol to complete.

Provable Secure and Lightweight Blockchain-Based V2I Handover Authentication and V2V Broadcast Protocol for VANETs

Provable Secure and Lightweight Blockchain-Based V2I Handover Authentication and V2V Broadcast Protocol for VANETs

Kadcast-NG: A Structured Broadcast Protocol for Blockchain Networks

Kadcast-NG: A Structured Broadcast Protocol for Blockchain Networks

Emergency message broadcasting scheme based on V2V and V2I

As an important part of the advanced Intelligent Traffic System (ITS) in the Internet of Vehicles (IoV), Vehicle to everything (V2X) communication technology provides reliable end-to-end connection and efficient packet transmission. Currently, the main challenge is design and implementation of the multi-hop broadcast protocol. In particular, the network topology is constantly changing because of the high-speed vehicle and diversified road structure, which troubles the selection of forward nodes. Therefore, we propose an Emergency Message Broadcast Protocol (EMBP). In this method, we select the optimal relay node according to the directionality and mobility, channel fading, and link connectivity and apply a suboptimal relay node selection mechanism to guarantee the reliability of broadcast. Simulation results show that EMBP is more efficient and stable than part classical protocols. Due to the complex communication environment of urban roads, to better improve the reliability of emergency message transmission, a broadcasting scheme Roadside Unit (RSU) Emergency Message Broadcast Protocol (REMBP), based on Vehicle to Vehicle (V2V) and Vehicle to Road (V2R) hybrid transmission of emergency messages is proposed on the basis of EMBP. Compared with EMBP, REMBP has better performance in terms of delivery rate, number of forwarding hops, end-to-end delay, average number of collisions, number of packet redundancy, and number of retransmissions.

An Adaptive Distributed Broadcast Protocol for Wireless Nanosensor Networks

An Adaptive Distributed Broadcast Protocol for Wireless Nanosensor Networks

A timestamp-based projected gradient play for distributed Nash equilibrium seeking in monotone games

In this paper, a timestamp-based projected gradient play is proposed for Nash equilibrium seeking over communication networks for strongly monotone games. Its difference from the well-known consensus-based Nash equilibrium seeking method is that each player’s local estimate of other players’ actions is updated through a timestamp-based broadcasting protocol instead of typical consensus protocols. We show that the proposed timestamp-based projected gradient play is indeed a projected gradient play with time delay, which can be further transformed into a disturbed full-information projected gradient play. Hence, we prove its convergence to the Nash equilibrium in the case of diminishing step-size and to the ϵ-approximation Nash equilibrium in the case of fixed step-size. Both convergence results are established on jointly strongly connected networks. The major advantage of the proposed approach is that it is intrinsically flexible to communication delay, disturbance, and asynchronization. Furthermore, its convergence rate is empirically comparable to the full-information projected gradient play with the same step-sizes. Illustrative numerical simulations are presented for distributed Nash equilibrium seeking in both quadratic and non-quadratic Nash–Cournot games over different types of communication networks.

An RSU-Assisted Hybrid Emergency Message Broadcasting Protocol for VANETs

In vehicular ad hoc networks (VANETs), emergency messages broadcasting has been considered as one of the important parts for safety related applications. The efficiency and reliability of the emergency message broadcasting are severely affected by the network structure, message redundancy, channel contention, etc. To address this problem, in this paper, we propose an RSUs-assisted hybrid emergency message broadcasting (RA-HEMB) protocol for two-way grid roads in urban VANETs. In doing so, the broadcasting target region is first generated based on the instantaneous traffic status and types of the emergency messages. To balance the deliver latency and the reliability, an adaptive forwarding nodes selection scheme based on position is proposed to dynamically determine the forwarding area according to different vehicle densities and vehicle-to-vehicle (V2V) communication ranges. Then, based on the forwarding nodes selection scheme and roadside unit (RSU) deployment, an RA-HEMB protocol is established by properly utilizing both the wired links via RSUs and the wireless links to broadcast the emergency message in hybrid vehicular networks. Simulation results show that the proposed RA-HEMB can greatly shorten the broadcasting time needed to notice the nodes within the target region performance compared to the benchmark protocols.

Decentralized piggybacking-based dissemination of Cooperative Awareness Messages in vehicular ad-hoc networks

Vehicle-to-Vehicle (V2V) communication has shown great promise to improve road safety and traffic efficiency via the periodic broadcasting of Cooperative Awareness Messages (CAMs), in which traffic information could be exchanged among adjacent vehicles. Since each CAM contains local-observed traffic information such as geolocation, speed, and safety alerts, frequent CAM losses will decrease the reliability on avoiding crashes and injuries on the road. Existing solutions tend to recover the lost CAMs through either source-based re-transmission or neighbor-based forwarding, which may suffer from significant performance degradation due to the fast movement of vehicles and high dynamic network topology. In this paper, we develop a decentralized cooperative broadcasting protocol for CAM dissemination, where each vehicle can piggyback some received CAMs in its routine broadcasting to help others recover their lost CAMs. To promote cooperation of CAM piggybacking, a new data structure called bitmap is introduced to record the packet receiving status at each vehicle, based on which time slots could be allocated to vehicles with low data collisions, lost CAMs could be detected only using each vehicle’s local information, and the qualities of wireless links could be estimated dynamically. Then, we propose two piggybacking schemes, Benefit-based Piggybacking (BP) and Suggestion-based Piggybacking (SP), aiming to maximize the average CAM delivery ratio. We evaluate the proposed schemes in simulations with realistic vehicle mobility traces and channel models. Simulation results show that our bitmap-based lost CAM detection has superior performance than traditional request-based solutions. In comparison with forwarding-based schemes, our schemes can achieve much higher CAM broadcast reliability with short time delay and small communication overhead.

The Effectiveness of Dynamic Probabilistic Flooding in On-Demand Routing Protocols for MANETs was Assessed Through a Performance Analysis

In mobile ad hoc networks (MANET), broadcasting is widely used in route discovery and many other network services. The efficiency of broadcasting protocol can affect the performance of the entire network. As such, the simple flooding algorithm aggravates a high number of unnecessary packet rebroadcasts, causing contention and packet collisions. Proper use of probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve high save rebroadcast and low collision. In this paper, we propose a dynamic probabilistic approach when nodes move according to way point mobility and compare it with simple flooding AODV and fixed probabilistic scheme. Our approach dynamically set the rebroadcasting probability according to the number of nieghbors nodes distributed in the ad hoc network. Simulation results show our approach performs better than both simple flooding and fixed probabilistic flooding.

An optimisation for a two‐round good‐case latency protocol

AbstractByzantine broadcast is a fundamental primitive in distributed computing. A highly efficient Byzantine broadcast protocol, motivated by the real‐world performance of practical state machine replication protocols, is increasingly needed. This article focuses on the state‐of‐the‐art partially synchronous Byzantine broadcast protocol proposed by Abraham et al. (PODC’21), which achieves optimal good‐case latency of two rounds and optimal resilience of n ≥ 5f − 1 in this setting. Each step of the protocol is analysed, and then improved by cutting down the number of messages required to be collected and transmitted in the heaviest step of the protocol by about half, without adding any extra cost. This benefits from a new property, named “spread”, that we identify and extract from the original protocol. It helps us to eliminate non‐essential work in its view‐change procedure. The authors also show that no further reduction is possible without violating security. A prototype is implemented and the performances of improved and original protocols are evaluated in the same environment. The results show that our improvement can achieve about 50% lower communication cost and 40% shorter latency at a scale of 100 replicas. The latency gap becomes wider as the scale further increases.

A new delay-based broadcast suppression mechanism for efficient emergency messages dissemination in CAVs environment

Network congestion is a major issue affecting communications in Connected and Autonomous Vehicles (CAVs) under high vehicle density scenarios. The common idea used by emergency message broadcast protocols to overcome this challenge is to reduce the number of retransmissions. This is achieved by suppressing redundant retransmissions while maintaining broadcast reliability. In this paper, we analyze the problem of inaccurate suppression of redundant retransmissions in delay-based broadcast protocols and propose uHBS (unHurried Broadcast Suppression), a new more efficient broadcast suppression mechanism. uHBS avoids inaccurate decisions to suppress or forward an emergency message by considering the occurrence of duplicate receptions of this message and using an indication about the channel’s busy status. Next, we use the proposed uHBS mechanism as a basis for designing uHBS-DP (uHBS based Dissemination Protocol), a novel delay-based protocol for broadcasting emergency messages in urban vehicular networks. The simulation results show that uHBS-DP, using the proposed broadcast suppression mechanism, significantly improves the efficiency of emergency message broadcasting by ensuring high reliability with low broadcasting overhead, compared to two other variants of uHBS-DP that use conventional suppression mechanisms. Furthermore, the results show a substantial improvement, compared to a well known protocol, in terms of reduced collision ratio (up to 36.57%), lower dissemination delay (up to 19.17%) and reduced broadcast overhead (up to 19.28%).

Broadcasting single-qubit and multiqubit entangled states: Authentication, cryptography, and distributed quantum computation

Quantum entanglement assisted with measurements provides various pathways to communicate information to parties within a network. In this work, we generalize a previous broadcasting protocol and present schemes to broadcast product and multipartite entangled quantum states, where in the latter case the sender can remotely add phase gates or abort distributing the states. We first focus on the broadcasting of product quantum states in a network, and generalize the basic protocol to include an arbitrary basis rotation and allow for multiple receivers and senders. We show how to add and delete senders from the network. The generalization also includes the case where a phase to be applied to the broadcast states is not known in advance but is provided to a sender encoded in another quantum state. Applications of broadcasting product states include authentication and three-state quantum cryptography. In the second part, we study the distribution of a single multiqubit state shared among several receivers entangled with multiqubit phase gates, which includes the graph states as an example. We show that by coordinating with the sender, the receivers can assist in performing remote, distributed measurement-based quantum computation with the Pauli-$X$ basis measurement alone. As another application of this, we discuss the distribution of the multiqubit Greenberger-Horne-Zeilinger state.

An energy-efficient command broadcast protocol in dynamic WSNs

In wireless sensor networks (WSNs), a sink must broadcast periodically a command message to a group of nodes or all nodes to control the operation of the network. However, the sparse distribution and limited resources of nodes bring difficulties for efficient broadcasting. In this paper, we propose an energy-efficient command broadcast protocol based on the construction of a spanning tree which includes maximizing the number of leaf nodes, and the allocation of one sharable slot to each tree level. The sharable slot that allocates to tree level will be divided into multiple mini slots, and non-leaf nodes at the same level will compete for broadcasting; in this way, collision can be reduced. Moreover, a node that moves to another level can use the sharable slot allocated to the new level without reallocating the slots. Extensive simulations prove that this approach not only achieves high reliability of message delivery but also energy efficiency.