Please use this identifier to cite or link to this item:
Title: A dominating set based clustering algorithm for mobile ad hoc networks
Authors: Çokuslu, Deniz
Erciyeş, Kayhan
Dağdeviren, Orhan
Keywords: Mobile telecommunication systems
Computational methods
Computer networks
Heuristic methods
Issue Date: 2006
Publisher: Springer Verlag
Source: Çokuslu, D., Erciyeş, K., and Dağdeviren, O. (2006). A dominating set based clustering algorithm for mobile ad hoc networks. Lecture Notes in Computer Science, 3991 LNCS, 571-578. doi:10.1007/11758501_77
Abstract: We propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li's [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li's [14] algorithm especially in the case of dense networks.
Description: ICCS 2006: 6th International Conference on Computational Science; Reading; United Kingdom; 28 May 2006 through 31 May 2006
ISBN: 9783540343790
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 
2245.pdfConference Paper412.15 kBAdobe PDFThumbnail
Show full item record

CORE Recommender


checked on Oct 1, 2022

Page view(s)

checked on Oct 3, 2022


checked on Oct 3, 2022

Google ScholarTM



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