Çokuslu, Deniz

Loading...
Name Variants
Cokuslu, Deniz
Job Title
Email Address
Main Affiliation
03.04. Department of Computer Engineering
Status
Current Staff
Website
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
2
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
Scopus data could not be loaded because of an error. Please refresh the page or try again later.
WoS data could not be loaded because of an error. Please refresh the page or try again later.
Scholarly Output

14

Articles

3

Views / Downloads

12024/6016

Supervised MSc Theses

1

Supervised PhD Theses

0

WoS Citation Count

80

Scopus Citation Count

110

Patents

0

Projects

0

WoS Citations per Publication

5.71

Scopus Citations per Publication

7.86

Open Access Source

12

Supervised Theses

1

JournalCount
Lecture Notes in Computer Science3
Applied and Computational Mathematics2
2008 Ieee 16Th Signal Processing, Communication And Applications Conference, Vols 1 And 21
Computer Systems Science and Engineering1
International Conference for Internet Technology and Secured Transactions, ICITST 20091
Current Page: 1 / 2

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Scholarly Output Search Results

Now showing 1 - 10 of 14
  • Conference Object
    Citation - WoS: 7
    Citation - Scopus: 16
    A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
    (Institute of Electrical and Electronics Engineers Inc., 2007) Çokuslu, Deniz; Erciyeş, Kayhan
    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) Algorithm [1]. We extended the levels of the CDS to two levels and improved functionality at each level by providing additional rules to make sure that every node belongs to a single cluster. In the first level of the algorithm, the elements of the CDS are formed, based on CDSC Algorithm heuristics with improved functionality. The second level of the algorithm is executed among the CDS elements to find the second level CDS where each element belonging to the set represents a group of CDS elements, therefore a group of clusters. We show that this approach is more scalable and simpler to implement than a single level algorithm and that it also provides more balanced two level clusters due to its distributed nature. We also show that the number of levels of the algorithm can be extended to more than two layers providing more populated clusters, therefore providing a level of cluster and group membership structure within the MANET. This hierarchical groups can be used for different application needs at each level such as multi-cast communication or security purposes in MANETs.
  • Article
    Citation - WoS: 1
    Citation - Scopus: 7
    Resource Allocation for Query Processing in Grid Systems: a Survey
    (CRL Publishing, 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan
    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 dynamicity, large size and heterogeneity, bring new problems to the query processing domain such as resource discovery and resource allocation. In this paper, we provide a survey related to resource allocation methods for query processing In data grid systems. We provide a classification for existing studies considering their approaches to the resource allocation problem. We provide a synthesis of the studies and propose evaluations and comparisons for the different classes of studies. ©2012 CRL Publishing Ltd.
  • 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.
  • Conference Object
    Citation - WoS: 6
    Citation - Scopus: 6
    A Merging Clustering Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, Deniz
    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 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 algorithms
  • Conference Object
    Citation - WoS: 23
    Citation - Scopus: 31
    A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Çokuslu, Deniz; Erciyeş, Kayhan; Dağdeviren, Orhan
    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 considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li's [14] algorithm especially in the case of dense networks.
  • Article
    Modıfıed Mergıng Clusterıng And Backbone Formatıon Algorıthms For Mobıle Ad Hoc Networks
    (Azerbaijan National Academy of Sciences, 2012) Dağdeviren, Orhan; Erciyes, Kayhan; Çokuslu, Deniz
    Clustering and backbone formation are widely used techniques to manage the routing operation in mobile ad hoc networks (MANET)s. In this work, we provide algorithms to form a backbone that is highly resilient to mobility and topology variations in mobile ad hoc networks. The first algorithm forms clusters of nodes in the mobile network each with a leader. The clusters are constructed in a balanced way to distribute the network load evenly. The second algorithm builds a ring network among the leaders of the clusters. The ring backbone is constructed in a fault tolerant and energy efficient way. These two algorithms are integrated in a communication architecture. To the best of our knowledge, our algorithms are the first attempts that construct balanced clusters with a ring backbone. We show the operation of the algorithms, analyze their proof of correctness, time and message complexities and provide the simulation results in ns2 environment against the density, number of clusters, and mobility of the network. We compare our proposed algorithms with the existing algorithms, and show that our algorithms create a controllable number of balanced clusters and robust ring backbone infrastructures while, providing low message count and run-time.
  • 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.
  • Book Part
    Citation - WoS: 2
    Modeling and Simulation Tools for Mobile Ad Hoc Networks
    (Taylor and Francis Ltd., 2012) Erciyes, Kayhan; Dağdeviren, Orhan; Çokuslu, Deniz; Yılmaz, Onur; Gümüş, Hasan
    [No abstract available]
  • 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.
  • Master Thesis
    A Dominating Set Based Communication Architecture for Distributed Applications in Mobile Ad Hoc Networks
    (Izmir Institute of Technology, 2007) Çokuslu, Deniz; Aytaç, İsmail Sıtkı
    In this thesis, we aim to design and implement algorithms in a distributed environment in order to solve clustering, backbone formation and efficient routing problems for mobile ad hoc networks(MANET)s. Our first goal is to find a connected dominating set (CDS), then construct clusters using the clusterhead information and extend this approach to multi-level clusters. We propose a new Connected Dominating Set based clustering algorithm for clustering in MANETs. Our algorithm is based on Wu and Li's algorithm, however we provide significant modifications and heuristics such as considering the degrees of the nodes during marking process. We also extend our algorithm in order to generate a hierarchy of clusters. Our second goal is to implement a flooding based routing mechanism on top of CDS based clusters. We propose a two level flooding mechanism by using the CDS members as the gateways of the clusters. We describe the algorithms, analyze their time and message complexities and measure their performance in the simulation environments.