Computer Engineering / Bilgisayar Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/10

Browse

Filters

20062

Settings

Author: search.filters.author.Çokuslu, DenizInstitution Author: search.filters.institutionAuthor.Erciyeş, Kayhan

Search Results

Now showing 1 - 2 of 2
  • Conference Object
    Citation - WoS: 6
    Citation - Scopus: 6
    A Merging Clustering Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan; Erciyeş, Kayhan; Çokuslu, Deniz; Dağdeviren, Orhan; 03.04. Department of Computer Engineering; 03. Faculty of Engineering; 01. Izmir Institute of Technology
    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
  • Conference Object
    Citation - WoS: 23
    Citation - Scopus: 31
    A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Çokuslu, Deniz; Erciyeş, Kayhan; Erciyeş, Kayhan; Dağdeviren, Orhan; Çokuslu, Deniz; 03.04. Department of Computer Engineering; 03. Faculty of Engineering; 01. Izmir Institute of Technology
    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.