Please use this identifier to cite or link to this item:
Title: Merging clustering algorithms in mobile Ad Hoc networks
Authors: Dağdeviren, Orhan
Erciyeş, Kayhan
Çokuslu, Deniz
Dağdeviren, Orhan
Erciyes, Kayhan
Çokuslu, Deniz
Izmir Institute of Technology. Computer Engineering
Keywords: Algorithms
Network protocols
Resource allocation
Mobile telecommunication systems
Minimum spanning tree(MST)
Mobile ad hoc networks (MANET)
Issue Date: 2005
Publisher: Springer Verlag
Source: Dağdeviren, O., Erciyeş, K., and Çokuslu, D. (2005). Merging clustering algorithms in mobile ad hoc networks. Lecture Notes in Computer Science, 3816 LNCS, 56-61. doi: 10.1007/11604655_9
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 first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose 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.
Description: 2nd International Conference on Distributed Computing and Internet Technology, ICDCIT 2005; Bhubaneswar; India; 22 December 2005 through 24 December 2005
ISSN: 0302-9743
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
1935.pdfConference Paper322.6 kBAdobe PDFThumbnail
Show full item record

CORE Recommender

Google ScholarTM



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