A Game-theoretic Approach to Self-Stabilizing Maximal Independent Set Algorithm
碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 102 === Given an undirected graph G = (V, E), S ⊆ V is an independent set if no nodes in S are adjacent to one another. An independent set S is maximal if no proper subset of S is an independent set. Maximal independent set problem is to find such a set S. This paper...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/61181248110066918608 |
| Summary: | 碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 102 === Given an undirected graph G = (V, E), S ⊆ V is an independent set if no nodes in S are adjacent to one another. An independent set S is maximal if no proper subset of S is an independent set. Maximal independent set problem is to find such a set S. This paper proposes a solution to this problem based on game theory. We turn the solution into a self-stabilizing algorithm running in distributed systems. The self-stability property ensures that system will enter legitimate system states in limited time regardless of initial configurations. We then convert the algorithm into a protocol for wireless networks. Simulation results indicate that the proposed approach performs better than previous work in terms of independent set size and convergence time.
|
|---|