Please use this identifier to cite or link to this item:
Title: A merging clustering algorithm for mobile ad hoc networks
Authors: Dağdeviren, Orhan
Erciyeş, Kayhan
Çokuslu, Deniz
Dağdeviren, Orhan
Erciyeş, Kayhan
Çokuslu, Deniz
Izmir Institute of Technology. Computer Engineering
Keywords: Communication systems
Computational complexity
Problem solving
Issue Date: 2006
Publisher: Springer Verlag
Source: Dağdeviren, O., Erciyeş, K., and Çokuslu, D. (2006). A merging clustering algorithm for mobile ad hoc networks. Lecture Notes in Computer Science, 3981 LNCS, 681-690. doi:10.1007/11751588_71
Abstract: Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms
Description: ICCSA 2006: International Conference on Computational Science and Its Applications; Glasgow; United Kingdom; 8 May 2006 through 11 May 2006
ISBN: 9783540340720
ISSN: 0302-9743
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
2255.pdfConference Paper378.49 kBAdobe PDFThumbnail
Show full item record

CORE Recommender


checked on Sep 18, 2021

Page view(s)

checked on Sep 23, 2021


checked on Sep 23, 2021

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.