Return to search

A Double-Manager K-hop Clustering Algorithm in Mobile Ad Hoc Networks

With rapidly development of wireless network technology in the past few years, hand-held devices can connect to Internet everywhere conveniently by equipped with wireless card. IEEE 802.11 defined two types of wireless networks: infrastructure networks and ad hoc networks. Since ad hoc networks are a kind of networks without access points, efficient routing is an important issue for these networks. A more efficient routing approach involves dividing the network into several clusters by using a clustering algorithm.
The purpose of this paper is to investigate a hybrid cluster routing algorithm in mobile ad hoc networks. This investigation proposed a double-manager K-hop clustering algorithm based on the link evaluation. This algorithm not only can elect a more suitable node as the cluster head but also can reduce the overhead of the managers. Furthermore, this study devised maintenance and backup mechanisms to stabilize network performance in the face of network topology changes. The simulation results demonstrate that our proposed algorithm outperforms other clustering algorithm in terms of number of clusters, routing overhead of managers and cluster stability.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0902104-171955
Date02 September 2004
CreatorsKe, Han-Chun
ContributorsTsung-Chuan Huang, C. R. Dow, Y. M. Huang, T. W. Hou, C. S. Yang
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageCholon
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902104-171955
Rightsrestricted, Copyright information available at source archive

Page generated in 0.0017 seconds