self-stabilizing global optimization algorithms for large network graphs稳定全局优化算法对于大型网络图.pdfVIP

International Journal of Distributed Sensor Networks, 1: 329–344, 2005 Copyright © Taylor Francis Inc. ISSN: 1550-1329 print/1550-1477 online DOI: 10.1080/15501320500330745 UDSNInternational Journal of Distributed Sensor Networks, Vol. 01, No. 3-4, October 2005: pp. 0–0International Journal of Distributed Sensor Networks15501477 Self-Stabilizing Global Optimization Algorithms for Large Network Graphs† Self-Stabilizing Global OptimizationSrimani et al. WAYNE GODDARD, STEPHEN T. HEDETNIEMI, DAVID P. JACOBS, and PRADIP K. SRIMANI Department of Computer Science, Clemson University, Clemson, SC 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 1. Introduction Most of the essential fundamental services for mobile networked distributed systems (ad hoc, wireless or sensor) involve maintaining a global predicate over the entire net- work (defined by some invariance relation on the global state of the network) by using local knowledge at each of the participating nodes. With the advent of large scale sen- sor networks, where a very large number of sensor nodes with limited computing and communication capabilities are involved to achieve a larger global task, scalability in coordinating the nod