Results 251 to 260 of about 81,556 (279)
Adaptive Extended Kalman Prediction-Based SDN-FANET Segmented Hybrid Routing Scheme. [PDF]
Sun K, Liu M, Yin C, Wang Q.
europepmc +1 more source
Design and Modeling of a Terahertz Transceiver for Intra- and Inter-Chip Communications in Wireless Network-on-Chip Architectures. [PDF]
Paudel B, Li XJ, Seet BC.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Broadcasting on networks of workstations
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 2005Broadcasting and multicasting are fundamental operations. In this work we develop algorithms for performing broadcast and multicast in clusters of workstations. In this model, sending a message from one machine to another machine in the same cluster takes 1 time unit, and sending a message to a machine in a different cluster takes C time units ...
Yung-Chun Justin Wan+2 more
openaire +2 more sources
Randomized broadcast in networks
Random Structures & Algorithms, 1990AbstractIn this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.
David Peleg+3 more
openaire +2 more sources
Efficient secret broadcast in the broadcasting networks
IEEE Communications Letters, 2009One of the basic problems in the broadcasting networks is a secret broadcast problem. The problem is how to securely send a message to the receivers while guaranteeing consistency. Consistency means that each receiver can assure that all of the receivers have received the same message.
Jeong Ok Kwon+2 more
openaire +2 more sources
Scheduling in broadcast networks
Networks, 1998Broadcasting in a communications network has been the subject of many studies in recent years. The studies vary in their assumptions governing the behavior of the network and in their objectives with respect to the network. Almost all the work to date uses the unit transmission time assumption, that is, the message transmission times between all pairs ...
Jeffrey B. Sidney+2 more
openaire +2 more sources
On the construction of minimal broadcast networks
Networks, 1989AbstractBroadcast is the task of transmitting a message originated at a node in a network to all the other nodes. In this paper, we consider the problem of constructing minimal broadcast networks, that is, communication networks such that broadcast can be performed, from any node, in minimum time.
GARGANO, Luisa, VACCARO, Ugo
openaire +4 more sources
Multilevel Broadcast Networks [PDF]
This paper is eligible for the student paper award. We formulate a broadcast problem, where based on their quality of observations, outputs at various receivers are represented on a graph (called "degradation graph"). If receiver Z is a physically degraded version of receiver Y, then node Z is a child of node Y in this graph. This generalization of the
Mitchell Trott+2 more
openaire +1 more source