Propagation and Leader Election in a Multihop Broadcast Environment

The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are di erent from the classic point to point model.

• Type: Conference
• Year: 1998
• Where: WDAG
• Authors: Israel Cidon, Osnat Mokryn
• Keywords: Algorithms, Broadcast Communication Networks, Leader Election Algorithm, Message Transmission Complexity, WDAG 1998