We study distributed broadcasting protocols with few transmissions (‘shots’) in radio networks where the topology is unknown. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. Initially, we focus on oblivious algorithms for k-shot broadcasting, that is, algorithms where each node decides whether to transmit o...

Broadcasting also called as flooding is one of the earliest research interests in mobile ad hoc networking. The main objective of broadcasting scheme is to avoid broadcast storm problem, provide good network performance and scalability. Existing probabilistic scheme consider only one parameter such as network density, node location or counter value in calculating probability value for broadcast...

697 Soil Sci. Soc. Am. J. 74:697–705 Published online 19 Mar. 2010 doi:10.2136/sssaj2009.0017 Received 10 Jan. 2009. *Corresponding author ([email protected]). © Soil Science Society of America, 5585 Guilford Rd., Madison WI 53711 USA All rights reserved. No part of this periodical may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recordi...

Soil Sci. Soc. Am. J. 76:915–924 doi:10.2136/sssaj 2011.0288 Received 15 Aug. 2011 *Corresponding author ([email protected]) © Soil Science Society of America, 5585 Guilford Rd., Madison WI 53711 USA All rights reserved. No part of this periodical may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or any informat...

We investigate the problem of broadcasting information in a given undirected network. At the beginning information is given at some processors, called sources. Within each time unit step every informed processor can inform only one neighboring processor. The broadcasting problem is to determine the length of the shortest broadcasting schedule for a network, called the broadcasting time of the n...

Due to the advancement of network technology, video-on-demand (VoD) services are growing in popularity. However, individual stream allocation for client requests easily causes a VoD system overload; when its network and disk bandwidth cannot match client growth. This study thus presents a fundamentally different approach by focusing solely on a class of applications identified as latency tolera...

We propose broadcasting algorithms for line digraphs in the telephone model. The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph L k (G), the graph obtained by applying k times, the line digraph operation to G. As a consequence improved bounds for the broadcasting time in De Bruijn, Kautz and Wrapped Butterry digraphs are obtained.