Fast, silent self-stabilizing distance-k independent dominating set construction

We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is established for any computation under the unfair distributed scheduler. The protocol FID reaches a terminal (also legitimate) configuration in at mo...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 114; no. 10; pp. 551 - 555
Main Author:	Johnen, Colette
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.10.2014 Elsevier Sequoia S.A Elsevier
Subjects:	Computation Computer Science Construction Convergence Data processing Distance-k dominating set Distance-k independent dominating set Distance-k independent set Distributed computing Distributed, Parallel, and Cluster Computing Fault tolerance Graph theory Networking and Internet Architecture Networks Protocol Self-stabilization Studies Terminals Self-stabilization Fault tolerance Distance-k independent dominating set Distance-k independent set Distance-k dominating set Distributed computing
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!