Dağdeviren, Orhan

Profile URL
https://hdl.handle.net/11147/16130
Name Variants
Dagdeviren, Orhan
Job Title
Email Address
Main Affiliation
03.04. Department of Computer Engineering
Status
Current Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
0
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
0
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
0
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
1
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
0
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
0
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
0
Research Products
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

21

Articles

4

Views / Downloads

16594/9376

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

161

Scopus Citation Count

209

Patents

0

Projects

0

WoS Citations per Publication

7.67

Scopus Citations per Publication

9.95

Open Access Source

18

Supervised Theses

1

JournalCount
Lecture Notes in Computer Science8
Applied and Computational Mathematics2
24th International Symposium on Computer and Information Sciences, ISCIS 20091
2nd International Conference on Sensor Technologies and Applications, SENSORCOMM 20081
9th International Symposium on Parallel and Distributed Computing, ISPDC 20101
Current Page: 1 / 3

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2005 - 2009142010 - 20137

Settings

search.filters.applied.f.isAuthorOfPublication: search.filters.isAuthorOfPublication.e87bc1f6-ec7e-4dc2-8bd7-a689114c6248

Scholarly Output Search Results

Now showing 1 - 10 of 21
  • Master Thesis
    A Cluster Based Communication Architecture for Distributed Applications in Mobile Ad Hoc Networks
    (Izmir Institute of Technology, 2006) Dağdeviren, Orhan; Erciyes, Kayhan
    In this thesis, we aim to design and implement three protocols on a hierarchical architecture to solve the balanced clustering, backbone formation and distributed mutual exclusion problems for mobile ad hoc network(MANET)s. Our ¯rst goal is to cluster the MANET into balanced partitions. Clustering is a widely used approach to ease implemen-tation of various problems such as routing and resource management in MANETs. We propose the Merging Clustering Algorithm(MCA) for clustering in MANETs that merges clusters to form higher level of clusters by increasing their levels. Secondly, we aim to con-struct a directed ring topology across clusterheads which were selected by MCA. Lastly, we implement the distributed mutual exclusion algorithm based on Ricart-Agrawala algo-rithm for MANETs(Mobile RA). Each cluster is represented by a coordinator node on the ring which implements distributed mutual exclusion algorithm on behalf of any member in the cluster it represents. We show the operations of the algorithms, analyze their time and message complexities and provide results in the simulation environment of ns2.
  • 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.
  • Article
    Citation - WoS: 15
    Citation - Scopus: 21
    Tracking Fast Moving Targets in Wireless Sensor Networks
    (Institution of Electronics and Telecommunication Engineers, 2010) Alaybeyoğlu, Ayşegül; Erciyeş, Kayhan; Kantarcı, Aylin; Dağdeviren, Orhan
    We propose a dynamic distributed algorithm for tracking objects that move fast in a sensor network. In the earlier efforts in tracking moving targets, the current leader node at time t predicts the location only for time t + 1 and if the target moves in high speed, it can pass by a group of nodes very fast without being detected. Therefore, as the target increases its speed, the probability of missing that target also increases. In this study, we propose a target tracking system that predicts future k locations of the target and awakens the -corresponding leader nodes so that the nodes along the trajectory self organize to form the clusters to collect data related to the target in advance and thus reduce the target misses. The algorithm first -provides detection of the target and forms a cluster with the neighboring nodes around it. After the selection of the cluster leader, the coordinates of the target is estimated using localization methods and cooperation -between the cluster nodes under the control of the leader node. The coordinates and the speed of the target are then used to estimate its trajectory. This information in turn provides the location of the nodes along the estimated trajectory which can be awaken, hence providing tracking of the moving object. We describe the algorithm, analyze its efficiency and show by simulations that it performs well to track very fast moving objects with speeds much higher than reported in literature.
  • Article
    Citation - WoS: 13
    Citation - Scopus: 18
    Graph Matching-Based Distributed Clustering and Backbone Formation Algorithms for Sensor Networks
    (Oxford University Press, 2010) Dağdeviren, Orhan; Erciyeş, Kayhan
    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 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 - 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
    Citation - Scopus: 38
    On the Ieee 802.15.4 Mac Layer Attacks: Gts Attack
    (Institute of Electrical and Electronics Engineers Inc., 2008) Sokullu, Radosveta; Dağdeviren, Orhan; Korkmaz, İlker
    In the last several years IEEE 802.15.4 [1] has been accepted as a major MAC layer protocol for wireless sensor networks (WSNs) and has attracted the interest of the research community involved in security issues as the increased range of application scenarios bring out new possibilities for misuse and taking improper advantage of sensor nodes and their operation. As these nodes are very resource restrained such possible attacks and their early detection must be carefully considered. This paper surveys the known attacks on wireless sensor networks, identifies and investigates a new attack, Guaranteed Time Slot (GTS) attack, taking as a basis the IEEE 802.15.4 MAC protocol for WSN. The GTS Attack is simulated with different scenarios using ns-2 and the results are evaluated both from the point of view of the attacked and the attacker.
  • Conference Object
    Citation - Scopus: 2
    Telsiz Duyarga Ağlarında Hızlı Hareket Eden Hedefler için Küme Tabanlı Hedef İzleme Algoritması
    (Institute of Electrical and Electronics Engineers Inc., 2009) Alaybeyoğlu, Ayşegül; Dağdeviren, Orhan; Kantarcı, Aylin; Erciyes, Kayhan
    Kablosuz iletişim teknolojilerindeki ilerlemelerle birlikte telsiz duyarga ağları (TDA) birçok sivil ve askeri uygulamalarda özellikle de hareketli hedefin takibi gibi konularda yaygın olarak kullanılmaya başlanmıştır. Bu çalışmada da TDA’da hızlı hareket eden nesneler için küme tabanlı bir hedef izleme algoritması önerilmiştir. Literatürde bulunan mevcut çalışmalarda lider düğüm, hedefin sadece t+1 anında yaklaşacağı konumu tahminleyerek bu konuma en yakın düğümü uyandırır. Hedefin çok hızlı hareket etmesi durumunda ise hedefin kısa süre içerisinde bir grup düğümün yakınlarından algılanmadan geçip gitmesi söz konusudur. Önermiş olduğumuz algoritma ile hedefin hızına bağlı olarak, hedefin tahmini gideceği yöndeki düğümler önceden uyandırılarak, kümeler önceden oluşturulmaktadır. Böylece hedefin ani hızlanması durumunda, önceden oluşturmuş olduğumuz kümeler sayesinde hedefin kaybolma riskini azaltmış bulunmaktayız.
  • 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: 1
    Citation - Scopus: 1
    Performance Evaluation of Group Communication Architectures in Large Scale Systems Using Mpi
    (Springer Verlag, 2006) Erciyeş, Kayhan; Dağdeviren, Orhan; Payli, Reşat Ümit
    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, investigate the theoretical performance bounds of these architectures and evaluate their experimental performances using MPI group communication primitives. We first derive time bounds for multicast message deliveries in these architectures and then provide tests to measure the times taken for the same operation. The multicast message delivery times are tested against the number of clusters within a group and the size of the multicast message. We conclude that daisy architecture is favorable both in terms of delivery times and message sizes theoretically and experimentally.
  • 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.