Results 201 to 210 of about 1,869 (260)
Sustainable Development Strategies for RIS-Assisted Mobile Networks. [PDF]
Sensors (Basel)Ibrahim AH.
europepmc +1 more source
Does the unavailability of social media affect online gambling behavior? A behavioral tracking data study before and after the October 2021 Facebook outage. [PDF]
Addict Behav RepCzakó A +6 more
europepmc +1 more source
A Robust Routing Protocol in Cognitive Unmanned Aerial Vehicular Networks. [PDF]
Sensors (Basel)Rozario A, Ahmed E, Mansoor N.
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, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller +2 more
openaire +1 more source
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.
Ik Rae Jeong +2 more
openaire +1 more source
Scheduling in broadcast networks
Networks, 1998Summary: Broadcasting 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 ...
Nicholas G. Hall +2 more
openaire +2 more sources
2007 IEEE International Symposium on Information Theory, 2007
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
Shashi Borade +2 more
openaire +1 more source
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
Shashi Borade +2 more
openaire +1 more source
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.
Uriel Feige +3 more
openaire +1 more source
Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration, 2002
The current trend in network technology is to implement as much of the switching function as possible directly in specialized high-speed hardware. A broadcast algorithm for such a network that is tolerant of failures in the form of message loss is presented. The model used is based on the one introduced by Cidon et al. (see Proc.
Ajei S. Gopal +2 more
openaire +1 more source
The current trend in network technology is to implement as much of the switching function as possible directly in specialized high-speed hardware. A broadcast algorithm for such a network that is tolerant of failures in the form of message loss is presented. The model used is based on the one introduced by Cidon et al. (see Proc.
Ajei S. Gopal +2 more
openaire +1 more source
Broadcasting in Heterogeneous Networks
Algorithmica, 2007In this paper we study a well-known broadcasting heuristic for heterogeneous networks of workstations, called fastest node first. We show that this heuristic produces an optimal solution for minimizing the sum of all completion times and, in addition, produces a 1.5 approximation for the problem of minimizing the maximum completion time.
Samir Khuller, Yoo Ah Kim
openaire +1 more source