Byzantine broadcast is a distributed primitive that allows a specific party (called “sender”) to consistently distribute a value v among n parties in the presence of potential misbehavior of up to t of the parties. Broadcast requires that correct parties always agree on the same value and if the sender is correct, then the agreed value is v. Broadcast without a setup (i.e., from scratch) is ach...

Capacity Region for a More General Class of Broadcast Channels Ghosheh Abed Hodtani Department of Electrical Engineering, Ferdowsi University of Mashhad, Mashhad, Iran [email protected] AbstractWe can categorize the broadcast channels with known capacity into two groups: One group consists of broadcast channels where the receivers have different capabilities (degraded, less noisy and more capab...

A d-broadcast primitive is a communication primitive that allows a sender to send a value from a domain of size d to a set of parties. A broadcast protocol emulates the d-broadcast primitive using only point-to-point channels, even if some of the parties cheat, in the sense that all correct recipients agree on the same value v (consistency), and if the sender is correct, then v is the value sen...

A wireless sensor network (WSN) is emerging as an innovative method for gathering information that will significantly improve the reliability and efficiency of infrastructure systems. Broadcast is a common method to disseminate information in WSNs. A variety of counter-based broadcast schemes have been proposed to mitigate the broadcast-storm problems, using the count threshold value and a rand...

Broadcast has been widely used in mobile ad hoc networks (MANETs) as a communication means to disseminate information to all reachable nodes. However, the conventional broadcast scheme that broadcast packets omni directionally suffers from several drawbacks: excessive amount of redundant traffic, exaggerated interference/contention among neighboring nodes, and limited coverage (as a result of c...

the objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a fibonacci hypercube structure. most of the popular algorithms for parallel matrix multiplication can not run on fibonacci hypercube structure, therefore giving a method that can be run on all structures especially fibonacci hypercube structure is necessary for parallel matr...