| Summary: | 碩士 === 逢甲大學 === 資訊工程所 === 96 === In 1974, Dijkstra proposed the concept of self-stabilization systems. Today, the concept of self-stabilization has been widely used in many technologies. A self-stabilizing system didn’t need any initialization; it can automatically converge to the legitimate system states, as long as the system has no transient fault. After then, the system will remain in the legitimate states.
The convergence and closure properties of a self-stabilizing algorithm can provide self-configuration and self-healing abilities. It is very desirable in a mobile ad hoc network. In this thesis, we propose a self-stabilizing clustering algorithm. Many researches have proved that the clustering is good for scalability in a large mobile ad hoc network. The proposed self-stabilizing clustering algorithm has better fault-tolerance capability. We also make some experiments based on NS-2. From the experiments, we show the proposed algorithm has good performance in scalability and stability.
|
|---|
