A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Self-Stabilizing Small k-Dominating Sets

2013
*
International Journal of Networking and Computing
*

In this paper, we give

doi:10.15803/ijnc.3.1_116
fatcat:64owzmdenvhkjpk26mlzk6khpy
*a*distributed asynchronous*silent**self*-*stabilizing**algorithm**for*finding*a**minimal**k*-*dominating**set*of at most n*k*+1 processes in an arbitrary identified network of size n. ...*A**self*-*stabilizing**algorithm*, after transient faults hit*the*system and place it in some arbitrary global state, causes*the*system to recover in finite time without external (e.g., human) intervention. ... Acknowledgments We are grateful to*the*anonymous reviewers*for*constructive feedback and insightful suggestions which greatly improved this article. ...##
###
Self-Stabilizing Small k-Dominating Sets

2011
*
2011 Second International Conference on Networking and Computing
*

In this paper, we give

doi:10.1109/icnc.2011.15
dblp:conf/ic-nc/DevismesHRDL11
fatcat:smbuulljebaehcdrmw3fkilo2u
*a*distributed asynchronous*silent**self*-*stabilizing**algorithm**for*finding*a**minimal**k*-*dominating**set*of at most n*k*+1 processes in an arbitrary identified network of size n. ...*A**self*-*stabilizing**algorithm*, after transient faults hit*the*system and place it in some arbitrary global state, causes*the*system to recover in finite time without external (e.g., human) intervention. ... Acknowledgments We are grateful to*the*anonymous reviewers*for*constructive feedback and insightful suggestions which greatly improved this article. ...##
###
Extending Lattice linearity for Self-Stabilizing Algorithms
[article]

2021
*
arXiv
*
pre-print

*The*extension – denoted as eventually lattice linear

*algorithms*– is performed with an example of

*the*service-demand based

*minimal*

*dominating*

*set*(SDDS)

*problem*, which is

*a*

*generalization*of

*the*

*dominating*... In this article, we focus on extending

*the*notion of lattice linearity to

*self*-

*stabilizing*programs. ... We begin with

*the*

*problem*of service-demand based

*minimal*

*dominating*

*set*(SDDS) which is

*a*

*generalization*of

*the*

*dominating*

*set*

*problem*. We devise

*a*

*self*-

*stabilizing*

*algorithm*

*for*SDDS. ...

##
###
Self-stabilizing Algorithm for Minimal α-Dominating Set
[article]

2020
*
arXiv
*
pre-print

*A*

*self*-

*stabilizing*

*algorithm*

*for*

*the*

*minimal*α-

*dominating*

*set*is proposed in this paper.

*The*α-

*domination*parameter has not used before in

*self*-

*stabilization*paradigm. ... Simulation tests and mathematical proofs show

*the*efficiency of

*the*

*algorithm*. ...

*Minimal*α-

*Dominating*

*Set*In this section, we present

*a*

*self*-

*stabilizing*

*algorithm*

*for*finding

*minimal*α-

*dominating*

*set*, we call α-MDS. ...

##
###
Distance-k Information in Self-stabilizing Algorithms
[chapter]

2006
*
Lecture Notes in Computer Science
*

In

doi:10.1007/11780823_27
fatcat:thsf3xctznfudat7hx7p6pkmly
*the*state-based*self*-*stabilizing**algorithmic*paradigm*for*distributed computing, each node has only*a*local view of*the*system (seeing its neighbors' states), yet in*a*finite amount of time*the*system ... We then apply*the*mechanism to graph*problems*in*the*areas of coloring and*domination*. ... In particular, one referee of*the*preliminary version [8] suggested*a*special case of*the*linear-time {*k*}-*domination**algorithm*, and one referee of*the*final version pointed out an improvement in*the*...##
###
Game-Theoretic Approach to Self-Stabilizing Distributed Formation of Minimal Multi-Dominating Sets

2014
*
IEEE Transactions on Parallel and Distributed Systems
*

This paper considers

doi:10.1109/tpds.2013.2297100
fatcat:bxj2x34lo5fm7a4symuovhf2uy
*a*more*general*multi-*dominating**problem*where each node i,*dominator*or dominatee, is required to have at least*k*i neighboring*dominators*, and different node can have different*k*... We first propose*a*game design toward this*problem*. This game is*self*-*stabilizing*(i.e., it always ends up with*a*legitimate state regardless of its initial configuration). ... Many*self*-*stabilizing**algorithms**for**the**minimal**dominating**set**problem*have been proposed in*the*literature. Due to space limitation, we present our literature review in Appendix*A*. ...##
###
Communication Efficiency in Self-Stabilizing Silent Protocols

2009
*
2009 29th IEEE International Conference on Distributed Computing Systems
*

Good candidates

doi:10.1109/icdcs.2009.24
dblp:conf/icdcs/DevismesMT09
fatcat:lk6nd5u4vjgebiy4pia7snywje
*for*admitting such interesting complexity solutions are*silent*protocols [10]:*a**silent*protocol is*a*selfstabilizing protocol that exhibits*the*additionnal property that after*stabilization*...*Self*-*stabilization*is*a**general*paradigm to provide forward recovery capabilities to distributed systems and networks. ... nicate*the*same information*for*every neighbor forever). We thus concentrate on lowering communication complexity requirements*for**silent**self*-*stabilizing*protocols. ...##
###
Competitive Self-Stabilizing k-Clustering

2012
*
2012 IEEE 32nd International Conference on Distributed Computing Systems
*

In this paper, we propose

doi:10.1109/icdcs.2012.72
dblp:conf/icdcs/DattaLDHR12
fatcat:x2ijwcajq5ckhcgjnzqrgvoc7m
*a**silent**self*-*stabilizing*asynchronous distributed*algorithm**for*constructing*a*kclustering of any connected network with unique IDs. ... Our solution is based on*the**self*-*stabilizing*construction of*a*data structure called*the*MIS Tree,*a*spanning tree of*the*network whose processes at even levels form*a*maximal independent*set*of*the*network ... In [6] , an asynchronous*silent**self*-*stabilizing**algorithm*that computes*a**k*-*dominating**set*of at most n*k*+1 processes is given. ...##
###
Competitive self-stabilizing k -clustering

2016
*
Theoretical Computer Science
*

In this paper, we propose

doi:10.1016/j.tcs.2016.02.010
fatcat:xfwpfcfsq5citglaybwnkpe7iu
*a**silent**self*-*stabilizing*asynchronous distributed*algorithm**for*constructing*a*kclustering of any connected network with unique IDs. ... Our solution is based on*the**self*-*stabilizing*construction of*a*data structure called*the*MIS Tree,*a*spanning tree of*the*network whose processes at even levels form*a*maximal independent*set*of*the*network ... In [6] , an asynchronous*silent**self*-*stabilizing**algorithm*that computes*a**k*-*dominating**set*of at most n*k*+1 processes is given. ...##
###
Self-stabilizing (f,g)-Alliances with Safe Convergence
[chapter]

2013
*
Lecture Notes in Computer Science
*

Given two functions f and g mapping nodes to non-negative integers, we give

doi:10.1007/978-3-319-03089-0_5
fatcat:elqutbmyyvbh5el6ebi6mkzu5u
*a**silent*selfstabilizing*algorithm*that computes*a**minimal*(f, g)-alliance in an asynchronous network with unique node IDs, assuming ... to*a**minimal*one in at most 5n + 4 additional rounds, where n is*the*size of*the*network. ... Conclusion and Perspectives We have given*a**silent**self*-*stabilizing**algorithm*, MA(f, g), that computes*a**minimal*(f, g)-alliance in an asynchronous network with unique node IDs, assuming that f ≥ g and ...##
###
A Self-Stabilizing O(k)-Time k-Clustering Algorithm

2009
*
Computer journal
*

*A*

*silent*

*self*-

*stabilizing*asynchronous distributed

*algorithms*is given

*for*constructing

*a*kdominating

*set*, and hence

*a*

*k*-clustering, of

*a*connected network of processes with unique IDs and no designated ...

*The*

*algorithm*is comparison-based, takes O(

*k*) time and uses O(

*k*log n) space per process, where n is

*the*size of

*the*network. It is known that finding

*a*

*minimal*

*k*-

*dominating*

*set*is N P-hard. ... Conclusion In this paper, we present

*a*

*self*-

*stabilizing*asynchronous distributed

*algorithms*

*for*construction of

*a*

*k*-

*dominating*

*set*, and hence

*a*

*k*-clustering,

*for*

*a*given

*k*,

*for*any network with unique ...

##
###
Distributed Computation of Connected Dominating Set for Multi-Hop Wireless Networks

2015
*
Procedia Computer Science
*

In such

doi:10.1016/j.procs.2015.08.372
fatcat:tictho4t7jdrvh534kxkqfb7wm
*a*scenario, finding smallest*set*of*dominant*nodes*for*forwarding packets would be*a*good approach*for*better communication. ... This paper discusses*the*design and implementation of*a*distributed*algorithm*to compute connected*dominating**sets*in*a*wireless network with*the*help of network spectral properties. ... This paper also provides polynomial*self**stabilizing**algorithms**for**the**minimal*total*k*-*dominating**set*. ...##
###
Self-Stabilizing Distributed Cooperative Reset

2019
*
2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)
*

Our approach is

doi:10.1109/icdcs.2019.00045
dblp:conf/icdcs/DevismesJ19
fatcat:ysqlfy43xfdqldkmpyogehk4d4
*general*since our reset*algorithm*allows to build*self*-*stabilizing*solutions*for*various*problems*and*settings*. ... of*the**dominating**set**problem*) in identified networks and*the*unison*problem*in anonymous networks. ...*A*safely converging*self*-*stabilizing**algorithm*is given in [35]*for*computing*a**minimal**dominating**set*. ...##
###
Communication Efficiency in Self-stabilizing Silent Protocols
[article]

2008
*
arXiv
*
pre-print

*Self*-

*stabilization*is

*a*

*general*paradigm to provide forward recovery capabilities to distributed systems and networks. ... , and maximal independent

*set*such that

*a*fraction of

*the*participants communicates with exactly one neighbor in

*the*

*stabilized*phase. ... nicate

*the*same information

*for*every neighbor forever). We thus concentrate on lowering communication complexity requirements

*for*

*silent*

*self*-

*stabilizing*protocols. ...

##
###
Self-Stabilizing Distributed Cooperative Reset
[article]

2019
*
arXiv
*
pre-print

Our approach is

arXiv:1901.03587v4
fatcat:gz2ltdg6nfaehfyc53ma7wsvhi
*general*since our reset*algorithm*allows to build*self*-*stabilizing*solutions*for*various*problems*and*settings*. ... As*a*matter of facts, we show that it applies to both static and dynamic specifications since we propose efficient*self*-*stabilizing*reset-based*algorithms**for**the*(1-*minimal*) f,g)-alliance (*a**generalization*...*A*safely converging*self*-*stabilizing**algorithm*is given in [35]*for*computing*a**minimal**dominating**set*. ...
« Previous

*Showing results 1 — 15 out of 5,598 results*