Results 21 to 30 of about 174,410 (300)

ON BROADCASTING TIME

open access: yesParallel Processing Letters, 1999
Broadcasting is an information dissemination problem in which a particular node in a network must transmit an item of information to all the other nodes. In this work we present new lower bounds for the time needed to complete this process in arbitrary graphs. In particular we generalize a result of P. Fraigniaud and E.
Dimakopoulos, V. V., Dimopoulos, N. J.
openaire   +2 more sources

Sharp bounds for the Sándor–Yang means in terms of arithmetic and contra-harmonic means

open access: yesJournal of Inequalities and Applications, 2018
In the article, we provide several sharp upper and lower bounds for two Sándor–Yang means in terms of combinations of arithmetic and contra-harmonic means.
Hui-Zuo Xu, Yu-Ming Chu, Wei-Mao Qian
doaj   +1 more source

Reliable broadcasting

open access: yesDiscrete Applied Mathematics, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GARGANO, Luisa   +3 more
openaire   +3 more sources

Neighbourhood-aware counter-based broadcast scheme for wireless ad hoc networks [PDF]

open access: yes, 2008
Broadcasting is a vital operation in mobile ad hoc networks (MANETs) and it is crucial to enhance its efficiency to ensure successful deployment. Although flooding is ideal for broadcast operations due to its simplicity and high reachability it ...
Jamaldeen Abdulai   +5 more
core   +1 more source

A Unified Analysis on ARQ-Based Broadcast: A Road to the Optimum

open access: yesIEEE Access, 2021
This paper presents a unified framework for Automatic Repeat reQuest (ARQ)-based retransmission schemes in multi-user broadcast environments. Two perspectives, namely, coded packet design and the enhancement of the ARQ protocol, are used to establish the
Sang Won Choi, Jae Hee Kim
doaj   +1 more source

On the performance of broadcast algorithms in interconnection networks [PDF]

open access: yes, 2005
Broadcast Communication is among the most primitive collective capabilities of any message passing network. Broadcast algorithms for the mesh have been widely reported in the literature.
Ould-Khaoua, M.   +3 more
core   +1 more source

Semi-automated creation of converged iTV services: From macromedia director simulations to services ready for broadcast [PDF]

open access: yes, 2006
While sound and video may capture viewers’ attention, interaction can captivate them. This has not been available prior to the advent of Digital Television.
Tsekleves, Emmanuel   +3 more
core   +6 more sources

Enhancing Reliability in 5G NR V2V Communications Through Priority-Based Groupcasting and IR-HARQ

open access: yesIEEE Access, 2023
Vehicle-to-vehicle (V2V) communication is a technology that can wirelessly exchange information on the speed and position of nearby vehicles, helping to avoid collisions, to alleviate traffic congestion, and to improve the environment. The 3rd Generation
Sanghoon An, Kyunghi Chang
doaj   +1 more source

Improvement to efficient counter-based broadcast scheme through random assessment delay adaptation for MANETs [PDF]

open access: yes, 2008
Flooding, the process in which each node retransmits every uniquely received packet exactly once is the simplest and most commonly used mechanism for broadcasting in mobile ad hoc networks (MANETs). Despite its simplicity, it can result in high redundant
Ould-Khaoua, M.   +5 more
core   +1 more source

Sharp bounds for a special quasi-arithmetic mean in terms of arithmetic and geometric means with two parameters

open access: yesJournal of Inequalities and Applications, 2017
In the article, we present the best possible parameters λ = λ ( p ) $\lambda=\lambda (p)$ and μ = μ ( p ) $\mu=\mu(p)$ on the interval [ 0 , 1 / 2 ] $[0, 1/2]$ such that the double inequality G p [ λ a + ( 1 − λ ) b , λ b + ( 1 − λ ) a ] A 1 − p ( a , b )
Wei-Mao Qian, Yu-Ming Chu
doaj   +1 more source

Home - About - Disclaimer - Privacy