Self-Stabilizing Global Optimization Algorithms for Large Network Graphsâ€

Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs and Pradip K. Srimani

International Journal of Distributed Sensor Networks, 2005, vol. 1, issue 3-4, 329-344

Abstract: The paradigm of self-stabilization provides a mechanism to design efficient localized distributed algorithms that are proving to be essential for modern day large networks of sensors. We provide self-stabilizing algorithms (in the shared-variable ID-based model) for three graph optimization problems: a minimal total dominating set (where every node must be adjacent to a node in the set) and its generalizations, a maximal k -packing (a set of nodes where every pair of nodes are more than distance k apart), and a maximal strong matching (a collection of totally disjoint edges).

Keywords: Self-stabilization; Optimization Alogrithms; k-packing (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1080/15501320500330745 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:1:y:2005:i:3-4:p:329-344

DOI: 10.1080/15501320500330745

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().