TCS
2008
13 years 4 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal proces...
OPODIS
2004
13 years 5 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
SOFSEM
1997
Springer
13 years 8 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
IPPS
2000
IEEE
13 years 8 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
SSS
2009
Springer
13 years 8 months ago
2009
Springer
Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sustained research over last decades has produced multiple self-stabilizing algorithms for man...