Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

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

Browse

Search Results

Now showing 1 - 3 of 3
  • Conference Object
    Citation - WoS: 12
    Citation - Scopus: 20
    A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
    (Springer Verlag, 2008) Dağdeviren, Orhan; Erciyeş, Kayhan
    Leader Election is an important problem in mobile ad hoc networks and in distributed computing systems. In this study, we propose a hierarchical, cluster based protocol to elect a leader in a mobile ad hoc network. The initial phase of the protocol employs a clustering algorithm to group nodes of the network after which a leader for a cluster(clusterhead) is elected. The second phase is performed by forming a connected ring of these leaders using the Ring Formation Algorithm. Finally, Chang Roberts Leader Election Algorithm for rings is employed in the final phase to elect the super-leader among the clusterheads. We provide performance results of this protocol for various mobility parameters and analyze its time and message complexities.
  • Conference Object
    Citation - Scopus: 1
    A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks
    (Springer Verlag, 2007) Dağdeviren, Orhan; Erciyeş, Kayhan
    We propose a three layer software architecture for shared resource management in mobile ad hoc networks(MANETs). At the lowest layer, the Merging Clustering Algorithm(MCA)[ll] partitions the MANET into a number of balanced clusters periodically. At the second layer, the Backbone Formation Algorithm(BFA) provides a virtual ring using the clusterheads found by MCA. Finally, an example resource management protocol which is a modified and scaled version of the Ricart-Agrawala algorithm implemented using the virtual ring structure is presented with the performance results.
  • Conference Object
    Implementation of a Cluster Based Routing Protocol for Mobile Networks
    (Springer Verlag, 2005) Marshall, Geoffrey; Erciyeş, Kayhan
    We show the implementation and the simulation results of a hierarchical, cluster based routing protocol for mobile ad hoc networks using Parallel Virtual Machine (PVM). The network represented by a graph is partitioned into clusters by a graph partitioning algorithm and the shortest routes are first calculated locally in each cluster in the first srep. The simplified network which consists only of the nodes that have connections to other clusters called the neighbor nodes is then formed and the shortest routes are calculated for this simple network as the second step. A complete route between the two nodes of different clusters is formed by the union of intra-cluster and inter-cluster routes. We show the implementation results using PVM where a workstation represents a cluster and each node is a PVM process. The results obtained support the theoretical considerations where the efficiency increases by the number of clusters in use.