Results 321 to 330 of about 6,379,566 (372)
Some of the next articles are maybe not open access.
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.
A. Gopal, I. Gopal, S. Kutten
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.
A. Gopal, I. Gopal, S. Kutten
openaire +1 more source
Comparison of broadcasting techniques for mobile ad hoc networks
ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002Brad Williams, T. Camp
semanticscholar +1 more source
Broadcasting in wireless networks.
2009This work examines the problem of providing reliable broadcast delivery of messages with minimal communication overhead in wireless networks. We consider two types of communication for broadcasting: one-to-all (the classical form of broadcasting where each node forwards the message to all its neighbours with one transmission) and one-to-one (each ...
openaire +2 more sources
Hierarchical broadcast networks
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Broadcasting Delay-Constrained Traffic Over Unreliable Wireless Links With Network Coding
IEEE/ACM Transactions on Networking, 2015I.-Hong Hou
semanticscholar +1 more source
The Broadcast Television Networks
2003Television is a business. Most consumers view their television set as a source of diversion, information, and entertainment. The average viewer probably does not think much about the cost of programs or commercials. As a cultural force, television is a teacher, a companion, a babysitter, a means to procrastinate, and a steady stream of amusement.
openaire +1 more source
Bandwidth and energy efficiency of video broadcasting services over LTE/LTE-A
IEEE Wireless Communications and Networking Conference, 2013C. Khirallah +2 more
semanticscholar +1 more source
A Markov model of safety message broadcasting for vehicular networks
IEEE Wireless Communications and Networking Conference, 2013Niloofar Toorchi +3 more
semanticscholar +1 more source