Computer Engineering / Bilgisayar Mühendisliği

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

Browse

Filters

2005 - 2009182010 - 20124

Settings

Author: search.filters.author.Erciyeş, KayhanWoS Q: search.filters.wosQuartile.N/A

Search Results

Now showing 1 - 10 of 22
  • Conference Object
    Duyarga Ağları için Bir Γ Eşuyumcusu Tasarım ve Uygulaması
    (IEEE, 2008) Özsoyeller, Deniz; Erciyeş, Kayhan; Dağdeviren, Orhan
    Implementation of synchronous algorithms in distributed systems in general is less troublesome than the implementation of asynchronous algorithms. Synchronizers provide synchronous execution of an asynchronous algorithm in distributed systems. In this study, we propose a gamma synchronizer for Wireless Sensor Networks (WSNs). This synchronizer consists of a and beta synchronizers. In our work, the WSN is first divided into clusters and then these clusters are connected using a ring protocol. Synchronization is provided using the beta synchronizer in the cluster and a synchronizer among the clusters. We describe the clustering algorithm and the ring formation algorithm for the WSNs and give the results obtained so far.
  • Conference Object
    Citation - Scopus: 15
    Gezgin Tasarsız Ağlar için Taşırma Tabanlı Yönlendirme Yordamı
    (IEEE, 2008) Çokuslu, Deniz; Erciyeş, Kayhan
    Mobile Ad Hoc Networks (MANETs) are videly in use in rescue, military operations, scientific and business areas. Many studies are addressed in MANETs because of their need to long lasting liveness, fault tolerance, dynamic addressing, collusion prevention, mobility management and security. Especially, self clustering, backbone construction and routing are the most interesting academic and industrial research areas in MANETs. A wide range of studies addressed the routing problem in MANETs. Many previous studies address the clustering and routing problems as seperate subjects. However, rowing approaches which are specific to the clustering methodologies may have many advantages in terms of efficiency and availability. In this study, a flooding based routing algorithm is proposed. First, a detailed description of the algorithm is explained, then the analysis and test results using the ns2 simulator are given which show that the designed algorithm is scalable and has favorable performance.
  • Article
    Citation - Scopus: 24
    Resource Discovery in Grid Systems: a Survey
    (Inderscience Enterprises Ltd., 2010) Hameurlain, Abdelkader; Çokuslu, Deniz; Erciyeş, Kayhan
    Resource Discovery (RD) is one of the key issues in successful Grid systems. Yet, new methodologies for RD are constantly researched owing to the dynamicity, heterogeneity and large-scale characteristics of Grids. Recently, synergy and convergence between Grid, Agent and Peer-to-Peer (P2P) systems were pointed out clearly. This paper provides a survey and a qualitative comparison of the most promising approaches (P2P techniques and agent systems) for RD. Viability of Grid systems relies mainly on efficient integration of P2P techniques and mobile agent (MA) systems to bring scaling and decentralised control properties to Grids.
  • Conference Object
    Citation - Scopus: 2
    Resource Allocation Algorithm for a Relational Join Operator in Grid Systems
    (Association for Computing Machinery (ACM), 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan; Morvan, Franck
    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 manipulated data. This issue augments the importance of distributed query processing and causes researchers to port their underlying environment onto the grid systems. However the dynamicity, heterogeneity and large scale characteristics of grid systems pose new problems for the distributed query processing domain. Resource allocation for query processing in grid systems is one of these problems, which attracts many researchers' attention. In this paper, we propose a new resource allocation algorithm for one relational join operator in a query considering characteristics of the grid systems. We provide theoretical analyses of the proposed algorithm and we consolidate analyses with the simulations. Copyright © 2012 ACM.
  • Conference Object
    Citation - Scopus: 5
    A Distributed Wakening Based Target Tracking Protocol for Wireless Sensor Networks
    (Institute of Electrical and Electronics Engineers Inc., 2010) Alaybeyoğlu, Ayşegül; Dağdeviren, Orhan; Kantarcı, Aylin; Erciyeş, Kayhan
    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 constructs a spanning tree backbone of clusterheads rooted at the sink. At the upper layer, we propose a target tracking algorithm which wakes clusters of nodes by using the estimated trajectory beforehand, which is different from existing studies [3] in which target can be detected only when the nodes close to the target are awake. We provide the simulation results and show the effect of fore-waking operation by comparing error and miss ratios of existing approaches with our proposed target tracking algorithm. © 2010 IEEE.
  • Conference Object
    Citation - Scopus: 2
    A Maximum Degree Self-Stabilizing Spanning Tree Algorithm
    (Springer Verlag, 2010) Çokuslu, Deniz; Erciyeş, Kayhan; Hameurlain, Abdelkader
    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 construction algorithms which rely on classical and self stabilization approach. Then, we propose a new self-stabilizing spanning tree construction algorithm which uses maximum degree heuristic while choosing the root node. We show experimentally that our new algorithm provides smaller tree diameters than the two existing approaches with favorable run-times. © 2011 Springer Science+Business Media B.V.
  • Conference Object
    Citation - Scopus: 3
    Grid Resource Discovery Based on Web Services
    (Institute of Electrical and Electronics Engineers Inc., 2009) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan
    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 different approaches are proposed in literature for this problem. Grid resource discovery using web services is an important approach which has resulted in many tools to become de facto standards of today's grid resource management. In this paper, we propose a survey of recent grid resource discovery studies based on web services. We provide synthesis, analysis and evaluation of these studies by classification. We also give a comparative study of different classes proposed.
  • Conference Object
    Citation - WoS: 13
    Citation - Scopus: 14
    Performance Evaluation of Cluster-Based Target Tracking Protocols for Wireless Sensor Networks
    (Institute of Electrical and Electronics Engineers Inc., 2009) Alaybeyoğlu, Ayşegül; Dağdeviren, Orhan; Erciyeş, Kayhan; Kantarcı, Aylin
    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. Clustering is a fundamental technique to manage the scarce network resources [12-19]. The message complexity of an application can be significantly decreased when it is redesigned on top of a clustered network. Clustering has provided an efficient infrastructure in many existing studies [1-8]. The clusters can be constructed before the target enters the region which is called the static method [1-4] or clusters are created by using received signal strength (RSS) from target which is called the dynamic method [5-8]. In this paper we provide simulations of static and dynamic clustering algorithms against various mobility models and target speeds. The mobility models that we applied are Random Waypoint Model, Random Direct Model and Gauss Markov Model. We provide metrics to measure the tracking performance of both approaches. We show that the dynamic clustering is favorable in terms of tracking accuracy whereas the energy consumption of static clustering is significantly smaller. We also show that the target moving with Gauss Markov Model can be tracked more accurately than the other models.
  • 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 - WoS: 13
    Citation - Scopus: 12
    Distributed Algorithms To Form Cluster Based Spanning Trees in Wireless Sensor Networks
    (Springer Verlag, 2008) Erciyeş, Kayhan; Özsoyeller, Deniz; Dağdeviren, Orhan
    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 iteratively as subroot, intermediate or leaf nodes. At the end of this phase, the local spanning trees are formed, each having a unique subroot (clusterhead) node. The communication and data aggregation towards the sink by an ordinary node then is accomplished by sending data to the local subroot which routes data towards the sink. A modified version of the first algorithm is also provided which ensures that the obtained tree is a breadth-first search tree where a node can modify its parent to yield shorter distances to the root. Once the sub-spanning trees in the clusters are formed, a communication architecture such as a ring can be formed among the subroots. This hybrid architecture which provides co-existing spanning trees within clusters yields the necessary foundation for a two-level communication protocol in a sensor network as well as providing a structure for a higher level abstraction such as the γ synchronizer where communication between the clusters is performed using the ring similar to an α synchronizer and the intra cluster communication is accomplished using the sub-spanning trees as in the β synchronizers. We discuss the model along with the algorithms, compare them and comment on their performances.