Propagation and Leader Election in a Multihop Broadcast Environment

The paper addresses the problem of 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.

[1]  Moshe Sidi,et al.  Collision resolution algorithms in multistation packet-radio networks , 1989, IEEE Trans. Commun..

[2]  Shay Kutten,et al.  A sub-linear time distributed algorithm for minimum-weight spanning trees , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[3]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[4]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[5]  Marco Ajmone Marsan,et al.  Multichannel Local Area Network Protocols , 1983, IEEE J. Sel. Areas Commun..

[6]  Israel Cidon,et al.  Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[7]  Francis Y. L. Chin,et al.  An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  Imrich Chlamtac,et al.  The wave expansion approach to broadcasting in multihop radio networks , 1991, IEEE Trans. Commun..

[9]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[10]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[11]  Michalis Faloutsos,et al.  Optimal distributed algorithm for minimum spanning trees revisited , 1995, PODC '95.