Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
4 results
Search Results
Conference Object Citation - WoS: 6Citation - Scopus: 6A Merging Clustering Algorithm for Mobile Ad Hoc Networks(Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, DenizClustering 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 algorithmsConference Object Citation - WoS: 23Citation - Scopus: 31A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks(Springer Verlag, 2006) Çokuslu, Deniz; Erciyeş, Kayhan; Dağdeviren, OrhanWe 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.Conference Object Citation - WoS: 7Citation - Scopus: 16A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks(Institute of Electrical and Electronics Engineers Inc., 2007) Çokuslu, Deniz; Erciyeş, KayhanWe propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connected Dominating Set Based Clustering (CDSC) Algorithm [1]. We extended the levels of the CDS to two levels and improved functionality at each level by providing additional rules to make sure that every node belongs to a single cluster. In the first level of the algorithm, the elements of the CDS are formed, based on CDSC Algorithm heuristics with improved functionality. The second level of the algorithm is executed among the CDS elements to find the second level CDS where each element belonging to the set represents a group of CDS elements, therefore a group of clusters. We show that this approach is more scalable and simpler to implement than a single level algorithm and that it also provides more balanced two level clusters due to its distributed nature. We also show that the number of levels of the algorithm can be extended to more than two layers providing more populated clusters, therefore providing a level of cluster and group membership structure within the MANET. This hierarchical groups can be used for different application needs at each level such as multi-cast communication or security purposes in MANETs.Conference Object Citation - WoS: 4Citation - Scopus: 4Merging Clustering Algorithms in Mobile Ad Hoc Networks(Springer Verlag, 2005) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, DenizClustering 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.