Computer Engineering / Bilgisayar Mühendisliği

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

Browse

Filters

2005 - 20063

Settings

Author: search.filters.author.Dağdeviren, OrhanSubject: search.filters.subject.Algorithms

Search Results

Now showing 1 - 3 of 3
  • 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; Çokuslu, Deniz
    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: 8
    Citation - Scopus: 13
    A Distributed Backbone Formation Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan
    Construction of a backbone architecture is an important issue in mobile ad hoc networks(MANET)s to ease routing and resource management. We propose a new fully distributed algorithm for backbone formation in MANETs that constructs a directed ring architecture. We show the operation of the algorithm, analyze its message complexity and provide results in the simulation environment of ns2. Our results conform that the algorithm is scalable in terms of its running time and roundtrip delay against mobility, surface area, number of nodes and number of clusterheads.
  • Conference Object
    Citation - WoS: 4
    Citation - Scopus: 4
    Merging Clustering Algorithms in Mobile Ad Hoc Networks
    (Springer Verlag, 2005) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, Deniz
    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.