A Self-stabilizing Approximation for the Minimum Connected Dominating Set with Safe Convergence
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Probabilistic voting-theoretic strategies for resource allocation in heterogenous wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Cooperative leader election algorithm for master/slave mobile ad hoc networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Competition and equilibrium in multiuser networks with multiple service providers
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Election games for resource allocation in multicarrier multiuser wireless networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Slf-stabiliezing leader election in dynamic networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Introducing mobile devices into Grid systems: a survey
International Journal of Web and Grid Services
Trivial solution for a non-trivial problem in MANETs
ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence
Full reversal routing as a linear dynamical system
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Space-efficient fault-containment in dynamic networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
The classical definition of a self-stabilizing algorithm assumes generally that there are no faults in the system long enough for the algorithm to stabilize. Such an assumption cannot be applied to ad hoc mobile networks characterized by their highly dynamic topology. In this paper, we propose a self-stabilizing leader election algorithm that can tolerate multiple concurrent topological changes. By introducing the time interval-based computations concept, the algorithm ensures that a network partition can within a finite time converge to a legitimate state even if topological changes occur during the convergence time. Our simulation results show that our algorithm can ensure that each node has a leader over 99$\%$ of the time. We also give an upper-bound on the frequency at which network components merge to guarantee the convergence.