Design and Simulation of A Reliable Clustering Algorithms in Ad Hoc Networks

• Main Authors: Tien-Chu Hsu, 許天助
• Other Authors: Ting-Chao Hou
• Format: Others
• Language: en_US
• Published: 1999
• Online Access: http://ndltd.ncl.edu.tw/handle/56284173171762544339

碩士 === 國立中正大學 === 電機工程研究所 === 87 === An ad hoc network is the cooperative engagement of a collection of mobile hosts without the required intervention of any centralized access point or wired base stations. As the population of mobile hosts increases, the problem of routing discovery becomes complicated. Clustering mobile hosts allows the formation of a two-level hierarchical architecture for an ad hoc network to resolve the routing scalability problem. We first design a basic clustering algorithm (BCA) to construct the cluster structure. In the initialization of an ad hoc network, mobile hosts are organized into non-overlapping clusters. Clusterheads are elected to form the upper level backbone; others are in the lower level. As mobile hosts move around, a simple strategy is adopted to update the cluster structure. In order to provide a fair channel assignment to each cluster in the ad hoc network, we next propose a limited size clustering algorithm (LSCA) which sets an upper bound on the cluster members of each cluster. The performance of the two clustering algorithms are evaluated by simulations when the underlying channels are either reliable or unreliable.