Browsing by Author "Erciyeş, Kayhan"
Now showing items 1-20 of 23
-
A cluster-based dynamic load balancing middleware protocol for grids
Erciyeş, Kayhan; Payli, Reşat Ümit (Springer, 2005)We describe a hierarchical dynamic load balancing protocol for Grids. The Grid consists of clusters and each cluster is represented by a coordinator. Each coordinator first attempts to balance the load in its cluster and ... -
Distributed algorithms to form cluster based spanning trees in wireless sensor networks
Erciyeş, Kayhan; Özsoyeller, Deniz; Dağdeviren, Orhan (Springer, 2008)We propose two algorithms to form spanning trees in sensor networks. The first algorithm forms hierarchical clusters of spanning trees with a given root, the sink. All of the nodes in the sensor network are then classified ... -
A distributed backbone formation algorithm for mobile ad hoc networks
Dağdeviren, Orhan; Erciyeş, Kayhan (Springer, 2006)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 ... -
A distributed wakening based target tracking protocol for wireless sensor networks
Alaybeyoğlu, Ayşegül; Dağdeviren, Orhan; Kantarcı, Aylin; Erciyeş, Kayhan (IEEE, 2010)We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into clusters with controllable diameter and ... -
A dominating set based clustering algorithm for mobile ad hoc networks
Çokuslu, Deniz; Erciyeş, Kayhan; Dağdeviren, Orhan (Springer, 2006)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 ... -
Graph matching-based distributed clustering and backbone formation algorithms for sensor networks
Dağdeviren, Orhan; Erciyeş, Kayhan (Oxford University Press, 2010-12)Clustering is a widely used technique to manage the essential operations such as routing and data aggregation in wireless sensor networks (WSNs). We propose two new graph-theoretic distributed clustering algorithms for ... -
Grid resource discovery based on web services
Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan (IEEE, 2009)The size of grid systems has increased substantially in the last decades. Resource discovery in grid systems is a fundamental task which provides searching and locating necessary resources for a given process. Various ... -
A hierarchical connected dominating set based clustering algorithm for mobile ad hoc networks
Çokuslu, Deniz; Erciyeş, Kayhan (IEEE, 2007)We 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) ... -
A hierarchical leader election protocol for mobile ad hoc networks
Dağdeviren, Orhan; Erciyeş, Kayhan (Springer, 2008)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 ... -
Implementation of a cluster based routing protocol for mobile networks
Marshall, Geoffrey; Erciyeş, Kayhan (Springer, 2005)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 ... -
A maximum degree self-stabilizing spanning tree algorithm
Çokuslu, Deniz; Erciyeş, Kayhan; Hameurlain, Abdelkader (Springer, 2010)Spanning trees are fundamental topological structures in distributed environments which ease many applications that require frequent communication between nodes. In this paper, we examine and compare two spanning tree ... -
A merging clustering algorithm for mobile ad hoc networks
Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, Deniz (Springer, 2006)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 ... -
Merging clustering algorithms in mobile Ad Hoc networks
Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, Deniz (Springer, 2005)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 ... -
Multilevel static real-time scheduling algorithms using graph partitioning
Erciyeş, Kayhan; Soysert, Zehra (Springer, 2005)We propose static task allocation algorithms for the periodic tasks of a distributed real-time system. The cyclic task consists of task threads which may communicate and share resources. A graph partitioning process and a ... -
Performance evaluation of cluster-based target tracking protocols for wireless sensor networks
Alaybeyoğlu, Ayşegül; Dağdeviren, Orhan; Erciyeş, Kayhan; Kantarcı, Aylin (IEEE, 2009)Target tracking is an important application type for wireless sensor networks (WSN). Recently, various approaches [1-11] are proposed to maintain the accurate tracking of the targets as well as low energy consumption. ... -
Performance evaluation of group communication architectures in large scale systems using MPI
Erciyeş, Kayhan; Dağdeviren, Orhan; Payli, Reşat Ümit (Springer, 2006)Group communication is an important paradigm for fault tolerance in large scale systems. We describe various group architectures as pipelined, hierarchical, daisy and hypercube groups each consisting of separate clusters, ... -
A replication-based fault tolerance protocol using group communication for the grid
Erciyeş, Kayhan (Springer, 2006)We describe a replication-based protocol that uses group communication for fault tolerance in the Computational Grid. The Grid is partitioned into a number of clusters and each cluster has a designated coordinator that ... -
Resource allocation algorithm for a relational join operator in grid systems
Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan; Morvan, Franck (Association for Computing Machinery, 2012)Grid systems become very popular during the last decade because of their rapidly increasing computational capabilities. On the other hand, the advances on different domains cause enormous increase in the scale of the ... -
Resource allocation for query processing in grid systems: A survey
Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan (CRL Publishing, 2012-07)Grid systems are very useful platforms for distributed databases, especially in some situations in which the scale of data sources and user requests is very high. However, the main characteristics of grid systems such as ... -
Serial and parallel multilevel graph partitioning using fixed centers
Erciyeş, Kayhan; Alp, Ali; Marshall, Geoffrey (Springer, 2005)We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes ...
