The wave expansion approach to broadcasting in multihop radio networks

An algorithm for efficient communication between neighbours in multihop radio networks is proposed. The algorithm guarantees a bound on the transmission efficiency in a radio channel for arbitrary topology. The algorithm can be embedded in protocols for solving basic network problems such as broadcast, multicast, leader election, or finding shortest paths. The problem of bounded-time broadcasting utilizing the proposed algorithm is addressed. A polynomial solution in which the process of spreading information over the network is viewed as the expansion of a wave caused by a point of disturbance is presented. The broadcast originates at a source node and is accomplished in repeated transmission periods, emulating a wave progressing away from the source. The algorithm is used to select a subset of potential transmitters in each period, so that a tightly bound proportion of potential receivers receive the transmission without collisions, guaranteeing a high level of spatial reuse in the broadcast process