A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning

This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a broad range of cost functions, and given various constraints, in directed and weighted graphs. Specifically, we motivate the distributed partitioning (self-partitioning) problem, introduce the stochastic automaton-based partitioning algorithm, and show that the algorithm finds the optimal partition with probability 1 for a large class of partitioning tasks. Also, a discussion of why the algorithm can be expected to find good partitions quickly is included, and its performance is further illustrated through examples. Finally, applications to mobile/sensor classification in ad hoc networks, fault-isolation in electric power systems, and control of autonomous vehicle teams are pursued in detail.

• Type: Journal
• Year: 2008
• Where: IJDSN
• Authors: Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieutre
• Keywords: Algorithm, Automaton-based Partitioning Algorithm, IJDSN 2006, IJDSN 2008, Stochastic Automaton-based Network