Broadcast Algorithm Research Articles

Best effort broadcast under cascading failures in interdependent critical infrastructure networks

We present a novel study of reliable broadcast in interdependent networks, in which the failures in one network may cascade to another network. In particular, we focus on the interdependency between a communication network and a power grid network, where the power grid depends on the communication network for control and the communication network depends on the grid for power. In this paper, we propose a best effort broadcast algorithm to handle crash failures in the communication network that may cause cascading failures. We guarantee that all the correct nodes, which operate correctly according to the protocol and do not experience any software or hardware or network failures, eventually deliver the message if the sender is correct. We provide a centralized algorithm and a fully distributed algorithm for nodes to analyze and handle cascading failures. At the core of our work is the fully distributed algorithm which enjoys great performance and scalability. Our evaluation results show that the algorithm handles cascading failures with low overhead.

Multichannel Broadcast in Duty-Cycling WBANs via Channel Hopping

We formulate and study a broadcast problem arising in multichannel duty-cycling wireless body area networks (WBANs) which the sink needs to broadcast control information to all sensor nodes on or implanted in the human body. Despite its fundamental importance for the network configuration and secure key management, the multichannel broadcast problem is largely unaddressed in duty-cycling WBANs. In this paper, we devise novel 2-D scheduling specifying the rule of channel hopping and wake-up time slot selection, which achieves the order-minimal worst-case broadcast delay while guaranteeing the full broadcast diversity regardless of clock drifts and asymmetric duty cycles and channel perceptions. Specifically, we first employ the Chinese remainder theorem to design an effective multichannel broadcast (MCB) algorithm and further propose improved MCB that enhances the granularity of MCB in matching actual duty cycles and number of channels, reducing the theoretically worst-case broadcast delay of MCB by up to 75%. We demonstrate the performance of the proposed algorithms through theoretical analysis and extensive simulations.

Bloom filter–based efficient broadcast algorithm for the Internet of things

In the Internet of things, a large number of objects can be embedded over a region of interest where almost every device is connected to the Internet. This work scrutinizes the broadcast overhead problem in an Internet of things network, containing a very large number of objects. The work proposes a probabilistic structure (bloom filter)-based technique, which uses a new broadcast structure that attempts to reduce the number of duplicate copies of a packet at every node. This article utilizes a clustering concept to make the broadcast efficient in terms of memory space, broadcast overhead, and energy usage. The unique idea of a bloom-based network uses a filter to incorporate neighbor information when taking a forwarding decision to reduce broadcast overhead. The simulation results show that parallel broadcasting among different clusters and the use of a bloom filter can achieve a reduction in broadcast overhead from hundreds to ones and tens, when compared with a conventional non-bloom-based broadcast al...

Broadcasting strategies in 6TiSCH networks

We consider IPv6‐enabled networks that run on top of the time‐slotted channel hopping mode of IEEE802.15.4 (6TiSCH). The ongoing discussions in the standardization community concern the network formation process and the definition of a bootstrapping protocol by which a new mote is admitted into the network. Because the bootstrapping traffic uses the same shared slots as the network broadcasts, the key to the optimal performance of the network formation process lays in the optimization of the network broadcasting strategy. The problem boils down to the issue of stabilizing slotted Aloha. To do so, we adapt a broadcast algorithm to the specifics of 6TiSCH networks. By simulation, we evaluate the optimal broadcast transmission probability in the network. We answer the open questions in the IETF 6TiSCH standardization community that concern the performance of the network formation process for the optimal values of transmission probability. As the main contribution of the letter, we provide network administrators with a set of values that allow the formation of dense networks.

Throughput-Optimal Multi-Hop Broadcast Algorithms

We design throughput-optimal dynamic broadcast algorithms for multi-hop networks with arbitrary topologies. Most of the previous broadcast algorithms route packets along spanning trees. For large time-varying networks, computing and maintaining a set of spanning trees is not efficient, as the network-topology may change frequently. In this paper, we design a class of dynamic algorithms, which make simple packet-by-packet scheduling and routing decisions, and hence obviate the need for maintaining any global topological structures, such as spanning trees. Our algorithms may be conveniently understood as a non-trivial generalization of the familiar back-pressure algorithm for unicast traffic, which performs packet routing and scheduling based on queue lengths. However, in the broadcast setting, due to packet duplications, it is difficult to define appropriate queuing structures. We design and prove the optimality of a virtual queue-based algorithm, where virtual queues are defined for subsets of nodes. We then propose a multi-class broadcast policy, which combines the above scheduling algorithm with in-class-in-order packet forwarding, resulting in significant reduction in complexity. Finally, we evaluate the performance of the proposed algorithms via extensive numerical simulations.

STFDR: Architecture of Competent Protocol for Efficient Route Discovery and Reliable Transmission in CEAACK MANETs

Efficiency can be achieved in CEAACK MANETs by implementing clustering technique into the network. Using this strategy the cluster head can monitor the members and also take the responsibility of routing the data packets to their destination. The cluster head has to coordinate with the base station for packet transmission. Generally route maintenance and route discovery is a very important mechanism for maintaining route life. In a route discovery, normally we are using flooding scheme for sending and receiving the route request and route reply message. Based on the route discovery, the routing methods are categorized into Proactive and Reactive methods. Reactive Routing Protocol is also called On Demand Routing Protocol like AODV and DSR. These two protocols help to reduce the overhead involved in routing. We propose a novel protocol STFDR (Secure Three Fish Dynamic Routing), which provides an efficient route discovery technique along with a competent dynamic broadcast algorithm. The overhead in routing can further be reduced by gaining knowledge about the neighbouring nodes. The proposed algorithm will help fix a route for packet forwarding and also utilize the information of the neighbouring nodes effectively. This algorithm is a unique dynamic routing protocol that provides a secure and a reliable network environment. The aim of our proposed protocol is to provide an environment where only the trusted nodes participate in route discovery and secure packet transmission.

Pseudo-Bayesian Broadcasting Algorithm for Opportunistic Splitting Scheduling Systems

The opportunistic splitting algorithm (OSA) is known as an efficient algorithm that can exploit multiuser diversity in a distributed manner. However, the conventional OSA (C-OSA) is designed for the systems where users are always backlogged, i.e., always have packets to transmit. In this paper, to accommodate the time-varying nature of the backlog size of the practical systems, we first investigate an ideal OSA (I-OSA), which assumes that the backlog size is exactly known so that it can optimally control the request transmissions from the users to select the best user. I-OSA can give us a guideline on the upper-bound performance of OSA. Second, to realize the concept of I-OSA in practice, we further propose a pseudo-Bayesian broadcast algorithm for OSA (PBB-OSA), which recursively estimates the mean backlog size based on the outcomes of the channel contention among users, such as idle, collision, and success events, and controls the request transmissions. Numerical results show that compared to C-OSA, PBB-OSA needs fewer minislots to find the best user and shows a smaller scheduling outage probability. In addition, it is also shown that the performance of PBB-OSA is close to that of I-OSA.

Selective epidemic broadcast algorithm to suppress broadcast storm in vehicular ad hoc networks

Broadcasting in Vehicular Ad Hoc Networks is the best way to spread emergency messages all over the network. With the dynamic nature of vehicular ad hoc networks, simple broadcast or flooding faces the problem called as Broadcast Storm Problem (BSP). The issue of the BSP will degrade the performance of a message broadcasting process like increased overhead, collision and dissemination delay. The paper is motivated to solve the problems in the existing Broadcast Strom Suppression Algorithms (BSSAs) like p-Persistence, TLO, VSPB, G-SAB and SIR. This paper proposes to suppress the Broadcast Storm Problem and to improve the Emergency Safety message dissemination rate through a new BSSA based on Selective Epidemic Broadcast Algorithm (SEB). The simulation results clearly show that the SEB outperforms the existing algorithms in terms of ESM Delivery Ratio, Message Overhead, Collision Ratio, Broadcast Storm Ratio and Redundant Rebroadcast Ratio with decreased Dissemination Delay.

Location aided probabilistic broadcast algorithm for mobile Ad-hoc network routing

On-demand routing protocols are widely used in mobile Ad-hoc network (MANET). Flooding is an important dissemination scheme in routing discovering of on-demand routing protocol. However, in high-density MANET redundancy flooding packets lead to dramatic deterioration of the performance which calls broadcast storm problem (BSP). A location-aided probabilistic broadcast (LAPB) algorithm for routing in MANET is proposed to reduce the number of routing packets produced by flooding in this paper. In order to reduce the redundancy packets, only nodes in a specific area have the probability, computed by location information and neighbor knowledge, to propagate the routing packets. Simulation results demonstrate that the LAPB algorithm can reduce the packets and discovery delay (DD) in the routing discovery phase.

Ring Paxos: High-Throughput Atomic Broadcast†

Atomic broadcast is an important communication primitive often used to implement state-machine replication. Despite the large number of atomic broadcast algorithms proposed in the literature, few papers have discussed how to turn these algorithms into efficient executable protocols. This paper focuses on a class of atomic broadcast algorithms based on Paxos, with its corresponding desirable properties: safety under asynchrony assumptions, liveness under weak synchrony assumptions, and resiliency-optimality. The paper presents two protocols, M-Ring Paxos and U-Ring Paxos, derived from Paxos. The protocols inherit the properties of Paxos and can be implemented very efficiently. We report a detailed performance analysis of M-Ring Paxos and U-Ring Paxos and compare them to other atomic broadcast protocols.

Failure detector-Ring Paxos-based atomic broadcast algorithm

An atomic broadcast problem constitutes an essential component in fault-tolerant distributed systems. an atomic broadcast algorithm ensures that all processes deliver the same messages sequence. Many algorithms solving the atomic broadcast problem have been published. Recently, a new Paxos-based atomic broadcast algorithm has been proposed for clustered systems, named Ring Paxos. It inherits many of Paxos characteristics: safe under asynchronous assumptions, live under weak synchronous assumptions, and requires a majority of non-faulty processes to ensure progress. However, the proposed algorithm relies on strong assumptions, and uses the group membership for faults tolerance. Recently, a new failure detector Ring Paxos-based atomic broadcast algorithm (FD-RP) for asynchronous distributed systems have been proposed. It inherits some of Ring Paxos characteristics and uses failure detectors to tolerate failures instead of a membership service. The aim of this paper is to complete the work done in our previous work by evaluating the performance of the FD-RP protocol by simulation and compare it with the Ring Paxos protocol, results show that the proposed protocol performs better than the Ring Paxos protocol in some situation and is recommended in applications with low latencies.

IoT 응용을 위한 퍼지 논리 기반 멀티홉 방송 알고리즘의 설계 및 평가

IoT 응용을 위한 퍼지 논리 기반 멀티홉 방송 알고리즘의 설계 및 평가

Trading off t-Resilience for Efficiency in Asynchronous Byzantine Reliable Broadcast

This paper presents a simple and efficient reliable broadcast algorithm for asynchronous message-passing systems made up of n processes, among which up to [Formula: see text] may behave arbitrarily (Byzantine processes). This algorithm requires two communication steps and n2 − 1 messages. When compared to Bracha’s algorithm, which is resilience optimal ([Formula: see text]) and requires three communication steps and [Formula: see text] messages, the proposed algorithm shows an interesting tradeoff between communication efficiency and t-resilience.

Energy-efficient broadcasting in ad hoc wireless networks

We study energy-efficient broadcasting in wireless networks of unknown topology (ad hoc). We measure energy efficiency by the maximum number of transmissions (‘shots’) allowed to any node in the network. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. Initially, we focus on oblivious algorithms for k-shot broadcasting, that is, algorithms where at each step each node decides whether to transmit or not with no consideration of the transmission history. Our main contributions are (a) a lower bound of Ω(n2/k) on the broadcasting time of any oblivious k-shot broadcasting algorithm, and (b) an oblivious broadcasting protocol that achieves a matching upper bound, namely O(n2/k), for every k≤n and an upper bound of O(n3/2) for every k>n. We also study the general case of adaptive broadcasting protocols where nodes decide whether to transmit based on all the available information, namely the transmission history known to each. We prove a lower bound of Ω(n1+kk) on the broadcasting time of any protocol by introducing the transmission tree construction which generalizes previous approaches.

Higher dimensional Eisenstein–Jacobi networks

An efficient interconnection topology called Eisenstein–Jacobi (EJ) network has been proposed in Martínez et al. (2008). In this paper this concept is generalized to higher dimensions. Important properties such as distance distribution and the decomposition of higher dimensional EJ networks into edge-disjoint Hamiltonian cycles are explored in this paper. In addition, an optimal shortest path routing algorithm and a one-to-all broadcast algorithm for higher dimensional EJ networks are given. Further, we give comparisons between higher EJ networks and Generalized Hypercube (GHC) networks and we show that higher EJ networks cost less and have more nodes than GHC networks.

Energy and Delay Efficient Dynamic Cluster Formation Using Improved Ant Colony Optimization Algorithm in EAACK MANETs

A MANET is a wireless ad hoc network with neither a fixed infrastructure nor an administrator to monitor the network operations. Clustering the network helps manage the network better. MANETs are networks that are ad hoc in nature. This nature gives rise to issues like loss of packets, security etc. which needs to be addressed in order to make the network more efficient. One major problem in clustering is the delay involved in cluster formation and in the selection of a suitable cluster head. We have proposed an improved version of the ant colony algorithm that employs two strategies to deduce the movement of the nodes and use this information to reduce the overheads in communication. The first phase helps to dynamically determine the heuristic parameters of the network in order to select the appropriate nodes for the cluster. The second phase helps form clusters faster and selects the cluster head without any delay. A distinct dynamic broadcast algorithm is employed to transmit the node status throughout the network. This algorithm also helps the network to sustain the changes in the network with no hindrance to data transmission. This technique helps in reducing the communication overheads and also improves the efficiency of transmission in the network. The proposed algorithm exploits the features of the ant colony algorithm and improvises it to achieve maximum delivery of packets with minimal delay possible. The proposed algorithm also focuses on reducing the time delay usually associated with cluster formation and cluster head selection. The node information helps in reducing this delay and helps the network focus on data transmission. The advantage of this algorithm is that the cluster head is determined based on the node movement and is immediately selected when the cluster is formed.

Higher Dimensional Gaussian Networks

Gaussian interconnection networks have been introduced as a useful alternative to the classical toroidal networks, and in this paper this concept is generalized to higher dimensions. We also explore many important properties of this new topology, including distance distribution and the decomposition of higher dimensional Gaussian networks into edge-disjoint tori and Hamiltonian cycles. In addition, an optimal shortest path routing algorithm and a one-to-all broadcast algorithm for higher dimensional Gaussian networks are given. Simulation results show that the routing algorithm proposed for higher dimensional Gaussian networks outperforms the routing algorithm of the corresponding torus network of the same node-degree and the same number of nodes.

Analytical modeling of self-pruning and an improved probabilistic broadcast for wireless multihop networks

The first wave of broadcasting algorithms exploit neighbor knowledge to reduce redundant retransmissions in mobile ad hoc wireless networks (MANETs). Self-pruning is one of such broadcast algorithm that received much attention from the research community. In self-pruning, only a subset of nodes forward the message based on certain forwarding rule. Moreover, it belongs to one of the reliable broadcasting algorithm category where a broadcast message is guaranteed (at least algorithmically) to reach all the nodes in the network. Despite its exclusive feature, so far the evaluation of self-pruning is mainly based on experiments and lacks detailed theoretical analysis. In this paper, we develop an analytical model for self-pruning to determine expected number of forwarding nodes required to complete a broadcast in the network. The derived expression is a function of various network parameters (such as, network density and distance between nodes) and radio transceiver parameters (such as transmission range). Moreover, the developed mathematical expression provides us a better understanding of the highly complex packet forwarding pattern of self-pruning and a valuable insight to design a new broadcasting heuristic. After careful analysis, we propose a new heuristic dubbed as dynamic probabilistic broadcast where the rebroadcast probability of each node is dynamically determined from a developed mathematical expression. Extensive simulation experiments have been conducted to validate the accuracy of the analytical model, as well as, to evaluate the efficiency of the proposed heuristic. Performance analysis shows that the proposed heuristic outperforms its static counterpart.

Revisiting XOR-based network coding for energy efficient broadcasting in mobile ad hoc networks

Network coding is commonly used to improve the energy efficiency of network-wide broadcasting in wireless multi-hop networks. In this work, we focus on XOR-based broadcasting in mobile ad hoc networks with multiple sources. We make the observation that the common approach, which is to benefit from the synergy of XOR network coding with a CDS-based broadcast algorithm, suffers performance breakdowns. After delving into the details of this synergy, we attribute this behavior to an important mechanism of the underlying broadcast algorithm, known as the “termination criterion”. To tackle the problem, we propose a termination criterion that is fully compatible with XOR coding. In addition to that, we revisit the internals of XOR coding. We first enhance the synergy of XOR coding with the underlying broadcast algorithm by allowing each mechanism to benefit from information available by the other. In this way, we manage to improve the pruning efficiency of the CDS-based algorithm while at the same time we come up with a method for detecting coding opportunities that has minimal storage and processing requirements compared to current approaches. Then, for the first time, we use XOR coding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. We validate the effectiveness of our proposed algorithm through extensive simulations on a diverse set of scenarios.

Reliable broadcast with respect to topology knowledge

We study the Reliable Broadcast problem in incomplete networks against a Byzantine adversary. We examine the problem under the locally bounded adversary model of Koo (Proceedings of the 23rd annual ACM symposium on principles of distributed computing, PODC '04, St. John's, Newfoundland, Canada, 25---28 July 2004, ACM New York pp 275---282, 2004) and the general adversary model of Hirt and Maurer (Proceedings of the 16th annual ACM symposium on principles of distributed computing, PODC '97, Santa Barbara, California, USA, August 21---24, 1997 ACM, New York pp 25---34, 1997) and explore the tradeoff between the level of topology knowledge and the solvability of the problem. In order to explore this tradeoff we introduce the partial knowledge model which captures the situation where each player has arbitrary topology knowledge. We refine the local pair-cut technique of Pelc and Peleg (Inf Process Lett 93(3):109---115, 2005) in order to obtain impossibility results for every level of topology knowledge and any type of corruption distribution. On the positive side we devise protocols that match the obtained bounds, and thus, exactly characterize the classes of graphs in which Reliable Broadcast is possible. Among others, we show that Koo's Certified Propagation Algorithm (CPA) is unique, against locally bounded adversaries in ad hoc networks, among all safe algorithms, i.e., algorithms which never cause a node to decide on an incorrect value. This means that CPA can tolerate as many local corruptions as any other safe algorithm; this settles an open question posed by Pelc and Peleg. We also provide an adaptation of CPA achieving reliable broadcast against general adversaries and prove that this algorithm too is unique under this model. To the best of our knowledge this is the first optimal algorithm for Reliable Broadcast in generic topology ad hoc networks against general adversaries.