Reliable broadcasting in product networks

Abstract

In this paper we study the reliable broadcasting in product networks. We suppose that the faulty nodes and faulty links may arbitrarily change the messages that pass through them, and may even fabricate messages.

Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs

“…The design of independent spanning trees (ISTs, for short) on graphs has important applications to the reliable communication protocols [1,11,16]. If a spanning tree rooted at the source node in a network is viewed as a broadcast channel for data communication, then fault-tolerant broadcasting can be achieved by sending k copies of a message along k ISTs on the network provided that there are at most k − 1 faulty nodes (other than the root) and/or faulty edges in the network.…”

Circular Dimensional-Permutations and Reliable Broadcasting for Hypercubes and Möbius Cubes

“…(1) >-path and < N a0 (u), v (2) >-path satisfy the conditions in Lemma 4, which implies that v (1) = v (2) . Thus, we can say that T 0 is a spanning tree rooted at N a0 (u) for X n ∈ {Q n , M n }.…”

“…After the n iterations, we have 1 + 2 0 + 2 1 + ... + 2 n−1 = 2 n nodes in tree T 0 . Choosing arbitrary two nodes v (1) and v (2) from T 0 , the < N a0 (u), v (1) >-path can be denoted by N a0 (u),…”

“…Independent spanning trees(ISTs for short) have been used in reliable broadcasting, secure message distribution [2], reliable communication protocols [17], one-to-all broadcasting [26], the multi-node broadcasting [3], and diagnosis [6]. Therefore, the problem to construct ISTs for a given network is becoming an important issue.…”

Towards the Independent Spanning Trees in Conditional BC Networks

“…Researchers have proved that ISTs has many applications such as reliable communication protocols [1], the multi-node broadcasting [5], one-to-all broadcasting [6], reliable broadcasting, and secure message distribution [7]. Nevertheless, there exists a key problem on ISTs in networks:…”