DocumentCode :
2719185
Title :
An Efficient K-Hop Weighted Domination Clustering Algorithm for Mobile Ad Hoc Networks Using Ranking
Author :
Janakiraman, T.N. ; Rani, J. Janet Lourds
Author_Institution :
NIT, Trichy
Volume :
4
fYear :
2007
fDate :
13-15 Dec. 2007
Firstpage :
322
Lastpage :
326
Abstract :
A mobile ad hoc is a kind of wireless communication network that does not rely on a fixed infrastructure. Clustering of MANET is a vital factor since it forms a virtual backbone of the network. A K-hop weighted dominated clustering algorithm is proposed in this paper. Weights of the nodes are calculated using ranking procedure. Simulation of the results show better clustering is achieved through the proposed algorithm.
Keywords :
ad hoc networks; mobile radio; pattern clustering; K-hop weighted domination clustering algorithm; MANET; mobile ad hoc networks; wireless communication network; Clustering algorithms; Collaboration; Computational intelligence; Euclidean distance; Mathematics; Mobile ad hoc networks; Mobile computing; Peer to peer computing; Spine; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Conference on Computational Intelligence and Multimedia Applications, 2007. International Conference on
Conference_Location :
Sivakasi, Tamil Nadu
Print_ISBN :
0-7695-3050-8
Type :
conf
DOI :
10.1109/ICCIMA.2007.39
Filename :
4426500
Link To Document :
بازگشت