Özsoyeller, Deniz

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/7280
Name Variants
Ozsoyeller, Deniz
Job Title
Email Address
denizozsoyeller@gmail.com
Main Affiliation
05.11. Mechatronics Engineering
Status
Former Staff
Website
ORCID ID
0000-0001-5406-4024
Scopus Author ID
24476826900
Turkish CoHE Profile ID
2809AE693BAA5B95
Google Scholar ID
WoS Researcher ID
DLE-4336-2022

Sustainable Development Goals

SDG data is not available
Documents

15

Citations

68

h-index

5

Go to Scopus profile
Documents

0

Citations

0

Go to WoS profile
Scholarly Output

6

Articles

0

Views / Downloads

0/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

50

Scopus Citation Count

12

WoS h-index

2

Scopus h-index

1

Patents

0

Projects

0

WoS Citations per Publication

8.33

Scopus Citations per Publication

2.00

Open Access Source

1

Supervised Theses

0

JournalCount
2008 23rd International Symposium on Computer and Information Sciences, ISCIS 20081
2008 IEEE 16th Signal Processing, Communication and Applications Conference, SIU1
2008 Ieee 16Th Sıgnal Processıng, Communıcatıon And Applıcatıons Conference, Vols 1 And 21
23Rd Internatıonal Symposıum on Computer And Informatıon Scıences1
Applıed And Computatıonal Mathematıcs1
Current Page: 1 / 2

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

2007 - 20086
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 6 of 6
  • Thumbnail Image
    Conference Object
    A Hierarchical Architecture To Implement a ? Synchronizer in Wireless Sensor Networks
    (2008) Ozsoyeller D.; Erciyes K.
    A synchronizer provides synchronous execution of asynchronous algorithms in an asynchronous network. We provide an architecture for a ? synchronizer in a wireless sensor network. The sensor network is partitioned into clusters of connected sub-spanning trees by an algorithm described in[1] in the first phase. Once the sub-spanning trees in the clusters are formed, the Ring Formation Algorithm provides bands of rings among the clusterheads of the same levels. This structure provides the necessary architecture for the ? synchronizer where communication between the clusters is performed using the ring similar to a ? synchronizer and the intra cluster communication is accomplished using the sub-spanning tree as in ? synchronizers. We discuss the model along with the algorithms and show that this architecture provides scalable operation of a ? synchronizer in a sensor network of significant size. © 2008 IEEE.
  • Thumbnail Image
    Conference Object
    Design and Implementation of a ? Synchronizer for Sensor Networks
    (2008) Özsoyeller, Deniz; Erciyeş K.; Da?deviren O.
    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 ? synchronizer for Wireless Sensor Networks (WSNs). This synchronizer consists of ? and ? 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 ? synchronizer in the cluster and ? synchronizer among the clusters. We describe the clustering algorithm and the ring formation algorithm for the WSNs and give the results obtained so far. ©2008 IEEE.
  • Thumbnail Image
    Conference Object
    Design and Implementation of a Gamma Synchronizer for Sensor
    (IEEE, 2008) Ozsoyeller, Deniz; Erciyes, Kayhan; Dagdeviren, 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.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 37
    Graph Theoretic Clustering Algorithms in Mobile Ad Hoc Networks and Wireless Sensor Networks (survey)
    (Ministry Communications & High Technologies Republic Azerbaijan, 2007) Erciyes, Kayhan; Dagdeviren, Orhan; Cokuslu, Deniz; Ozsoyeller, Deniz
    Clustering in mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs) is an important method to ease topology management and routing in such networks. Once the clusters are formed, the leaders (coordinators) of the clusters may be used to form a backbone for efficient routing and communication purposes. A set of clusters may also provide the underlying physical structure for multicast communication for a higher level group communication module which may effectively be used for fault tolerance and key management for security purposes. We survey graph theoretic approaches for clustering in MANETs and WSNS and show that although there is a wide range of such algorithms, each may be suitable for a different cross-layer design objective.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 13
    Citation - Scopus: 12
    Distributed Algorithms To Form Cluster Based Spanning Trees in Wireless Sensor Networks
    (2008) Erciyes K.; Ozsoyeller D.; Dagdeviren O.
    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. © 2008 Springer-Verlag Berlin Heidelberg.
  • Thumbnail Image
    Conference Object
    A Hierarchical Architecture To Implement a Gamma Synchronizer in Wireless Sensor Networks
    (IEEE, 2008) Ozsoyeller, Deniz; Erciyes, Kayhan
    A synchronizer provides synchronous execution of asynchronous algorithms in an asynchronous network. We provide an architecture for a gamma synchronizer in a wireless sensor network. The sensor network is partitioned into clusters of connected sub-spanning trees by an algorithm described in [1] in the first phase. Once the sub-spanning trees in the clusters are formed, the Ring Formation Algorithm provides bands of rings among the clusterheads of the same levels. This structure provides the necessary architecture for the gamma synchronizer where communication between the clusters is performed using the ring similar to a alpha synchronizer and the intra cluster communication is accomplished using the sub-spanning tree as in beta synchronizers. We discuss the model along with the algorithms and show that this architecture provides scalable operation of a gamma synchronizer in a sensor network of significant size.