Distributed Algorithms in Multihop Broadcast Networks

Details Distributed Algorithms in Multihop Broadcast Networks Distributed Algorithms in Multihop Broadcast Networks

1999-09-08

arxiv.org/abs/cs/9909011v1

Computer Science

Distributed, Parallel, and Cluster Computing

Apeared at the 12th International Symposium on DIStributed Computing, (DISC98)

Scientific paper

Broadcast networks are often used in modern communication systems. A common broadcast network is a single hop shared media system, where a transmitted message is heard by all neighbors, such as some LAN networks. In this work we consider a more complex environment, in which a transmitted message is heard only by a group of neighbors, such as Ad-Hoc networks, satellite and radio networks, as well as wireless multistation backbone system for mobile communication. It is important to design efficient algorithms for such environments. 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 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 different from the known point-to-point model.

Affiliated with

Also associated with

No associations

Rating

Distributed Algorithms in Multihop Broadcast Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distributed Algorithms in Multihop Broadcast Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Algorithms in Multihop Broadcast Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-89037