Byzantine-Tolerant Set-Constrained Delivery Broadcast

Set-Constrained Delivery Broadcast (SCD-broadcast), recently introduced at ICDCN 2018, is a high-level communication abstraction that captures ordering properties not between individual messages but between sets of messages. More precisely, it allows processes to broadcast messages and deliver sets of messages, under the constraint that if a process delivers a set containing a message m before a set containing a message m\u27, then no other process delivers first a set containing m\u27 and later a set containing m. It has been shown that SCD-broadcast and read/write registers are computationally equivalent, and an algorithm implementing SCD-broadcast is known in the context of asynchronous message passing systems prone to crash failures. This paper introduces a Byzantine-tolerant SCD-broadcast algorithm, which we call BSCD-broadcast. Our proposed algorithm assumes an underlying basic Byzantine-tolerant reliable broadcast abstraction. We first introduce an intermediary communication primitive, Byzantine FIFO broadcast (BFIFO-broadcast), which we then use as a primitive in our final BSCD-broadcast algorithm. Unlike the original SCD-broadcast algorithm that is tolerant to up to t<n/2 crashing processes, and unlike the underlying Byzantine reliable broadcast primitive that is tolerant to up to t<n/3 Byzantine processes, our BSCD-broadcast algorithm is tolerant to up to t<n/4 Byzantine processes. As an illustration of the high abstraction power provided by the BSCD-broadcast primitive, we show that it can be used to implement a Byzantine-tolerant read/write snapshot object in an extremely simple way

Achievable rate region for three user discrete broadcast channel based on coset codes

We present an achievable rate region for the general three user discrete memoryless broadcast channel, based on nested coset codes. We characterize 3-to-1 discrete broadcast channels, a class of broadcast channels for which the best known coding technique\footnote{We henceforth refer to this as Marton's coding for three user discrete broadcast channel.}, which is obtained by a natural generalization of that proposed by Marton for the general two user discrete broadcast channel, is strictly sub-optimal. In particular, we identify a novel 3-to-1 discrete broadcast channel for which Marton's coding is \textit{analytically} proved to be strictly suboptimal. We present achievable rate regions for the general 3-to-1 discrete broadcast channels, based on nested coset codes, that strictly enlarge Marton's rate region for the aforementioned channel. We generalize this to present achievable rate region for the general three user discrete broadcast channel. Combining together Marton's coding and that proposed herein, we propose the best known coding technique, for a general three user discrete broadcast channel.Comment: A non-additive 3-user discrete broadcast channel is identified for which achievable rate region based on coset codes is analytically proven to be strictly larger than that achievable using unstructured iid codes. This version is submitted to IEEE Transactions on Information Theor

Future transmitter/receiver diversity schemes in broadcast wireless networks

An open diversity architecture for a cooperating broadcast wireless network is presented that exploits the strengths of the existing digital broadcast standards. Different diversity techniques for broadcast networks that will minimize the complexity of broadcast systems and improve received SNR of broadcast signals are described. Resulting digital broadcast networks could require fewer transmitter sites and thus be more cost-effective with less environmental impact. Transmit diversity is particularly investigated since it obviates the major disadvantage of receive diversity being the difficulty of locating two receive antennas far enough apart in a small mobile device. The schemes examined here are compatible with existing broadcast and cellular telecom standards and can be incorporated into existing systems without change

The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise

We derive the capacity region for a broadcast channel with intersymbol interference (ISI) and colored Gaussian noise under an input power constraint. The region is obtained by first defining a similar channel model, the circular broadcast channel, which can be decomposed into a set of parallel degraded broadcast channels. The capacity region for parallel degraded broadcast channels is known. We then show that the capacity region of the original broadcast channel equals that of the circular broadcast channel in the limit of infinite block length, and we obtain an explicit formula for the resulting capacity region. The coding strategy used to achieve each point on the convex hull of the capacity region uses superposition coding on some or all of the parallel channels and dedicated transmission on the others. The optimal power allocation for any point in the capacity region is obtained via a multilevel water-filling. We derive this optimal power allocation and the resulting capacity region for several broadcast channel models

The Holland broadcast language

The broadcast language is a programming formalism devised by Holland in 1975, which aims at allowing Genetic Algorithms (GAs) to use an adaptable representation. A GA may provide an efficient method for adaption but still depends on the efficiency of the fitness function used. During long-term evolution, this efficiency could be limited by the fixed representation used by the GA to encode the problem. When a fitness function is very complex, it is desirable to adapt the problem representation employed by the fitness function. By adapting the representation, the broadcast language may overcome the deficiencies caused by fixed problem representation in GAs. This report describes an initial detailed specification and implementation of the broadcast language. Our first motivation is the fact that there is currently no published implementation of broadcast systems (broadcast language-based systems) available. Despite Holland presented the broadcast language in his book “Adaptation in Natural and Artificial systems”, he did not support this approach with experimental studies. Our second motivation is the affirmation made by Holland that broadcast systems could model biochemical networks. Indeed Holland also described how the broadcast language could provide a straightforward representation to a variety of biochemical networks (Genetic Regulatory Networks, Neural Networks, Immune system etc). As these biochemical models share many similarities with Cell Signaling Networks (CSNs), broadcast systems may also be considered to model CSNs. One of our goals, within the ESIGNET project, is to develop an evolutionary system to realize and evolve CSNs in Silico. Examining the broadcast language may provide us with valuable insights to the development of such a system. In this paper, we initially review the Holland broadcast language, we then propose a specification and implementation of the language which is later illustrated with an experiment: modeling different chemical reactions