| Summary: | 碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 103 === Graph coloring which is a method to use as few colors as possible for painting the vertices (or edges) of a given graph and making sure there is no two adjacent vertices share the same color. Graph coloring can be viewed as a simplification of resource allocation problems. In reality, the resources is definitely finite in distributed systems. It is NP-complete problem to decide whether a given graph can be colored by using k colors. On the basis of graph coloring problem, this paper is concerning about the Minimal Color Conflict problem of using finite colors and allows adjacent vertices using the same color, called conflicts. This paper adopts the graphical congestion game theory to reduce the number of color conflicts, and converting it into a distributed self-stabilizing algorithm under locally central daemon. Furthermore, we adapts this algorithm into a distributed protocol which can be implemented on the Mobile Ad-Hoc Networks.
|
|---|
