Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7755
Browse
7 results
Search Results
Conference Object Citation - Scopus: 2Resource Allocation Algorithm for a Relational Join Operator in Grid Systems(Association for Computing Machinery (ACM), 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan; Morvan, FranckGrid 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.Article Citation - WoS: 14Citation - Scopus: 21A Survey of Agent Technologies for Wireless Sensor Networks(Medknow Publications and Media, 2011) Dagdeviren, Orhan; Korkmaz, İlker; Tekbacak, Fatih; Erciyeş, KayhanWireless sensor networks (WSNs) do not have a fixed infrastructure and consist of sensor nodes that perform sensing and communicating tasks. The WSNs have large application spectrum such as habitat monitoring, military surveillance, and target tracking, where sensor nodes may operate distributed in highly dynamic environments. Battery-constrained sensor nodes may aggregate the sensed data, localize themselves, and route the packets in an energy-efficient and decentralized manner to enable running the applications. Agents are capable of independent and autonomous action, so that they can successfully carry out tasks that have been delegated to them, thus agent-based approaches are very suitable to apply as the solution of the problems occurring in WSNs. So far many agent-based approaches were proposed for WSNs. This paper surveys the agent technologies for sensor networks by providing a classification, objectives and costs of these approaches with the open research problems. To the best of our knowledge, this is the first study that covers the intersection of the agent technology and sensor networks from a wide perspective.Conference Object Citation - Scopus: 2A Maximum Degree Self-Stabilizing Spanning Tree Algorithm(Springer Verlag, 2010) Çokuslu, Deniz; Erciyeş, Kayhan; Hameurlain, AbdelkaderSpanning 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.Article Citation - WoS: 13Citation - Scopus: 18Graph Matching-Based Distributed Clustering and Backbone Formation Algorithms for Sensor Networks(Oxford University Press, 2010) Dağdeviren, Orhan; Erciyeş, KayhanClustering 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 WSNs that use a weighted matching method for selecting strong links. To the best of our knowledge, our algorithms are the first attempts that use graph matching for clustering. The first algorithm is divided into rounds; extended weighted matching operation is executed by nodes in each round; thus the clusters are constructed synchronously. The second algorithm is the enhanced version of the first algorithm, which provides not only clustering but also backbone formation in an energy-efficient and asynchronous manner. We show the operation of the algorithms, analyze them, provide the simulation results in an ns2 environment. We compare our proposed algorithms with the other graph-theoretic clustering algorithms and show that our algorithms select strong communication links and create a controllable number of balanced clusters while providing low-energy consumptions. We also discuss possible applications that may use the structure provided by these algorithms and the extensions to the algorithms. © The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.Conference Object Citation - WoS: 7Citation - Scopus: 12Time Synchronization Algorithms Based on Timing-Sync Protocol in Wireless Sensor Networks(Institute of Electrical and Electronics Engineers Inc., 2008) Kulaklı, Ali Burak; Erciyeş, KayhanWireless Sensor Networks(WSN) are large scale networks of sensors running on wireless environment. For an application running on a WSN, gathered data by the sensors are time critical in most of the cases. However, almost all the nodes suffer from a problem named clock drift. This problem causes clock difference among nodes as time goes because the processors do not run exactly at the same speed. There are many proposed solutions to remedy this problem. TPSN (Timing-sync Protocol for Sensor Networks) is one of the effective protocols proposed to synchronize sensor networks. In this paper, we propose enhancements over TPSN to synchronize nodes in a wireless sensor network more effectively with a lower message complexity and higher precision.Conference Object Citation - WoS: 6Citation - Scopus: 6A Merging Clustering Algorithm for Mobile Ad Hoc Networks(Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, DenizClustering 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 algorithmsConference Object Citation - WoS: 8Citation - Scopus: 13A Distributed Backbone Formation Algorithm for Mobile Ad Hoc Networks(Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, KayhanConstruction 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.