loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth International Conference on Computer and Information Technology (CIT'04)
A Double-Manager K-hop Clustering Algorithm in Mobile Ad Hoc Networks
Wuhan, China
September 14-September 16
ISBN: 0-7695-2216-5
Tsung-Chuan Huang, National Sun Yat-Sen University
Liang-Chen Shiu, Tung-Fang Institute of Technology
Han-Chun Ke, National Sun Yat-Sen University
IEEE 802.11 defined two types of wireless networks: infrastructure networks and ad hoc networks. Since ad hoc networks are kind of networks without access points, efficient routing is important 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 clusterhead but also can reduce the management overheads. Furthermore, this study devised maintenance and backup mechanisms to stabilize network performance in the face of network topology changes. The simulation results demonstrate that the proposed algorithm outperforms other clustering algorithm in terms of clusters, overhead of managers and cluster stability.
Index Terms:
ad hoc networks, hybrid routing, cluster
Citation:
Tsung-Chuan Huang, Liang-Chen Shiu, Han-Chun Ke, "A Double-Manager K-hop Clustering Algorithm in Mobile Ad Hoc Networks," cit, pp.640-645, Fourth International Conference on Computer and Information Technology (CIT'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.