DocumentCode
2932472
Title
Clustering Algorithms in Mobile Ad Hoc Networks
Author
Akbari, Abolfazle ; Khosrozadeh, Ali ; Lasemi, Naser
Author_Institution
Dept. of Comp. Eng, Ayatollah Amoli Branch Islamic Azad Univ., Amol, Iran
fYear
2009
fDate
24-26 Nov. 2009
Firstpage
1509
Lastpage
1513
Abstract
Clustering of nodes provides an efficient means of establishing a hierarchical structure in mobile ad hoc networks. In mobile ad hoc networks, the movement of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance; the clustering schemes for mobile ad hoc networks therefore aim at handling topology maintenance, managing node movement or reducing overhead. This paper presents the reasons for clustering algorithms in ad hoc networks, as well as a short survey of the basic ideas and priorities of existing clustering algorithms.
Keywords
ad hoc networks; mobile radio; telecommunication network topology; telecommunication transmission lines; clustering algorithms; hierarchical structure; mobile ad hoc networks; node movement; overhead message; topology maintenance; Ad hoc networks; Clustering algorithms; Computer networks; Information technology; Large-scale systems; Mobile ad hoc networks; Mobile communication; Network topology; Resource management; Routing protocols; clusteiheed; clustring; member cluster; mobile ad hoc networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Sciences and Convergence Information Technology, 2009. ICCIT '09. Fourth International Conference on
Conference_Location
Seoul
Print_ISBN
978-1-4244-5244-6
Electronic_ISBN
978-0-7695-3896-9
Type
conf
DOI
10.1109/ICCIT.2009.195
Filename
5370316
Link To Document