Cast Ension

We consider the broadcasting problem for one-dimensional grid graphs with a given neighborhood template. There are two different models that have been considered-shouting (a node informs all of its neighbors in one step) and whispering (a node informs a single neighbor in one step). Let a(t) (respectively a(t)) denote the maximum number of nodes that can be reached in t steps by shouting (respectively whispering) broadcast from a single source. We obtain detailed information about the benefits of shouting over whispering. We prove for the one-dimensional case a conjecture by Stout that o(t) eventually becomes a polynomial. In particular, we show that there exist constants i and to such that a(t) = a(t) i for all tz to. When the broadcast only goes in one direction (i.e., when all elements of the template are positive), we also determine that i= d1 and tool 3d for a neighborhood template with the furthest neighbor at distance d.