Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction
In this paper, we consider the problem of computing a k-independent dominating set in a self-stabilizing manner in case where k > 1. A nodes set is a k-independent dominating set (also called maximal k-independent set) if and only if this set is a k-independent set and a k-dominating set. A set of nodes, I is k-independent if the distance between any pair of I’s nodes is at least k + 1. A set of nodes D is k-dominating if every node is within distance k of a node of D.
Unable to display preview. Download preview PDF.
- 1.Datta, A., Devismes, S., Larmore, L.: A self-stabilizing o(n)-round k-clustering algorithm. In: 28th IEEE Symposium on Reliable Distributed Systems (SRDS 2009), pp. 147–155 (2009)Google Scholar
- 2.Datta, A.K., Larmore, L.L., Devismes, S., Heurtefeux, K., Rivierre, Y.: Competitive self-stabilizing k-clustering. In: IEEE 32nd International Conference on Distributed Computing (ICDCS 2012), pp. 476–485 (2012)Google Scholar
- 3.Datta, A.K., Larmore, L.L., Devismes, S., Heurtefeux, K., Rivierre, Y.: Self-stabilizing small k-dominating sets. International Journal of Networking and Computing 3(1), 116–136 (2013)Google Scholar
- 4.Johnen, C.: Memory efficient self-stabilizing k-independant dominating set construction. Technical Report RR-1473-13, Univ. Bordeaux, LaBRI, UMR 3800, F-33400 Talence, France (June 2013)Google Scholar