DocumentCode :
1919461
Title :
A light-weight contention-based clustering algorithm for wireless ad hoc networks
Author :
Purtoosi, Reza ; Taheri, Hassan ; Mohammadi, Abbas ; Foroozan, Foroohar
Author_Institution :
Dept. of Electr. Eng., Amir Kabir Univ. of Technol., Tehran, Iran
fYear :
2004
fDate :
14-16 Sept. 2004
Firstpage :
627
Lastpage :
632
Abstract :
In this paper a new distributed clustering algorithm based on sending beacons has been proposed. In this algorithm, mobile nodes compete with each other to become cluster-head based on the number of neighbors. A simulation study has been conducted in a fully mobile network to investigate the performance of this algorithm. The results show scalability advantage of this algorithm in networks with a large number of mobile nodes based on the average number of generated clusters and stability of the created clusters. The comparison with other algorithms shows the flexibility and suitability of the new algorithm.
Keywords :
ad hoc networks; distributed algorithms; pattern clustering; telecommunication network routing; cluster stability; distributed clustering algorithm; fully mobile network; light-weight contention-based clustering algorithm; sending beacons; wireless ad hoc networks; Ad hoc networks; Bandwidth; Clustering algorithms; Law enforcement; Mobile ad hoc networks; Mobile communication; Routing; Scalability; Stability; Time division multiple access;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Information Technology, 2004. CIT '04. The Fourth International Conference on
Print_ISBN :
0-7695-2216-5
Type :
conf
DOI :
10.1109/CIT.2004.1357265
Filename :
1357265
Link To Document :
بازگشت