An efficient group key establishment in location-aided mobile ad hoc networks
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Information Processing Letters
Self-stabilizing Cuts in Synchronous Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
A Self-stabilizing $\frac{2}{3}$-Approximation Algorithm for the Maximum Matching Problem
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Robust self-stabilizing weight-based clustering algorithm
Theoretical Computer Science
A new self-stabilizing maximal matching algorithm
Theoretical Computer Science
Nash Equilibria in Stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Journal of Parallel and Distributed Computing
A self-stabilizing algorithm for cut problems in synchronous networks
Theoretical Computer Science
A new self-stabilizing maximal matching algorithm
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A self-stabilizing weighted matching algorithm
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
SFS3: a simulation framework for self-stabilizing systems
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Robust self-stabilizing construction of bounded size weight-based clusters
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
A self-stabilizing minimal dominating set algorithm with safe convergence
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science
Robust self-stabilizing clustering algorithm
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Self-stabilizing weight-based clustering algorithm for ad hoc sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Self-stabilizing algorithm for maximal graph partitioning into triangles
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing consensus average algorithm in distributed sensor networks
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.01 |
We propose two distributed algorithms to maintain, respectively, a maximal matching and a maximal independent set in a given ad hoc network; our algorithms are fault tolerant (reliable) in the sense that the algorithms can detect occasional link failures and/or new link creations in the network (due to mobility of the hosts) and can readjust the global predicates. We provide time complexity analysis of the algorithms in terms of the number of rounds needed for the algorithm to stabilize after a topology change, where a round is defined as a period of time in which each node in the system receives beacon messages from all its neighbors. In any ad hoc network, the participating nodes periodically transmit beacon messages for message transmission as well as to maintain the knowledge of the local topology at the node; as a result, the nodes get the information about their neighbor nodes synchronously (at specific time intervals). Thus, the paradigm to analyze the complexity of the self-stabilizing algorithms in the context of ad hoc networks is very different from the traditional concept of an adversarydeamon used in proving the convergence and correctness of self-stabilizing distributed algorithms in general.