Abstract
The authors propose an efficient distributed algorithm for finding a minimal connected dominating set of an asynchronous communication network. An asynchronous communication network can be modeled by a connected undirected graph G=(V, E) where the nodes correspond to the sites and the edges correspond to bidirectional communication links. No common memory is shared by the sites. Each node receives messages from its neighbors, performs some computation, and sends messages to its neighbors. Thus the distributed algorithms considered here are primarily message driven. Furthermore, each message sent by a node is assumed to be error free and to arrive in sequence to its neighbors after an unpredictable finite delay. The worst case message complexity of the algorithm is O(n/sup 2/), where n is the number of processors of the network. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
