Çalışkan, Cafer

Çalışkan, Cafer

Name Variants

Çalışkan, Cafer
C.,Çalışkan
C. Çalışkan
Cafer, Çalışkan
Caliskan, Cafer
C.,Caliskan
C. Caliskan
Cafer, Caliskan
Cafer Çalışkan

Job Title

Doç. Dr.

Email Address

Cafer.calıskan@khas.edu.tr

Full item page

Scholarly Output

7

Articles

4

Citation Count

0

Supervised Theses

1 Scholarly Output Search Results

Now showing 1 - 7 of 7

A Novel Communication Method for Constrained Iot Devices
(Kadir Has Üniversitesi, 2022) Kocatekin, Tuğberk; Tamer Dağ; Cafer Çalışkan
Internet of Things (IoT) is becoming an established part of life by interconnecting billions of devices in diverse areas such as healthcare, smart homes, industries, etc. However, these devices are limited in memory, energy and computational capabilities. Being constrained prevents them from applying complex cryptographic encryption algorithms which leads to lack of security and therefore lack of privacy. As a solution, we propose a novel secret sharing scheme based on underlying protocols of visual cryptography to provide a low-cost and secure communication method for constrained IoT devices. Generally, when a device wants to communicate with an outer party, it does so by itself or by using a mediary such as a central hub or gateway; which leads to single point of failure. As a solution, we propose a method where devices collaborate each other and therefore divide the responsibility into multiple, instead of one. We propose two different models: n-out-of-n and k-out-ofn. In the first model, there is a complete graph where every device is connected to each other. Instead of the original sender, every other device work collaboratively to communicate with the outer party. In the second model, the network is realized as an n-regular graph where a single node has n number of neighbors, which collaborates with each other and here the responsibility is divided into n devices. Results show that this scheme is applicable to constrained devices.
Citation Count: 1
An Analysis for the Use of Compressed Sensing Method in Microwave Imaging
(IEEE, 2017) Yiğit, Enes; Tekbaş, Mustafa; Ünal, İlhami; Erdoğan, Sercan; Çalışkan, Cafer
One of the most important problems encountered in microwave imaging methods is intensive data processing traffic that occurs when high resolution and real time tracking is desired. Radar signals can be recovered without loss of data with a randomly selected subset of the measurement data by compression sensing (CS) method which has been popular in recent years. For this reason, in this study, the use and capabilities of the CS method were investigated for tracking moving human, and the target information was correctly determined for the data obtained much below the Nyquist sampling criterion. In this study, it was revealed that the CS method can be developed for target detection and tracking
Citation Count: 1
An Analysis For The Use Of Compressed Sensing Method İn Microwave İmaging [mikrodalga Görüntülemede Sıkıştırılmış Algılama Yönteminin Kullanımına Yönelik Bir Analiz]
(Institute of Electrical and Electronics Engineers Inc., 2017) Yiğit, Enes; Tekbaş, Mustafa; Ünal, İlhami; Erdogan, Sercan; Çalışkan, Cafer
One of the most important problems encountered in microwave imaging methods is intensive data processing traffic that occurs when high resolution and real time tracking is desired. Radar signals can be recovered without loss of data with a randomly selected subset of the measurement data by compression sensing (CS) method which has been popular in recent years. For this reason in this study the use and capabilities of the CS method were investigated for tracking moving human and the target information was correctly determined for the data obtained much below the Nyquist sampling criterion. In this study it was revealed that the CS method can be developed for target detection and tracking. © 2017 IEEE.
Citation Count: 1
Orthogonal Projection and Liftings of Hamilton-Decomposable Cayley Graphs on Abelian Groups
(Elsevier Science Bv, 2013) Alspach, Brian; Çalışkan, Cafer; Kreher, Donald L.
In this article we introduce the concept of (p alpha)-switching trees and use it to provide sufficient conditions on the abelian groups G and H for when CAY (G x H
Citation Count: 1
New Infinite Families of 2-Edge Graphs
(Wiley-Blackwell, 2014) Çalışkan, Cafer; Chee, Yeow Meng
A graph G of order n is called t-edge-balanced if G satisfies the property that there exists a positive for which every graph of order n and size t is contained in exactly distinct subgraphs of Kn isomorphic to G. We call the index of G. In this article we obtain new infinite families of 2-edge-balanced graphs.
Citation Count: 1
Partitioning 3-Arcs Into Steiner Triple Systems
(Wiley, 2017) Çalışkan, Cafer
In this article it is shown that there is a partitioning of the set of 3-arcs in a projective plane of order three into nine pairwise disjoint Steiner triple systems of order 13.
Citation Count: 0
New 2-Edge Graphs From Bipartite Graphs
(Wiley-Blackwell, 2016) Çalışkan, Cafer
Let G be a graph of order n satisfying that there exists lambda epsilon Z(+) for which every graph of order n and size t is contained in exactly. distinct subgraphs of the complete graph K-n isomorphic to G. Then G is called t-edge-balanced and. the index of G. In this article new examples of 2-edge-balanced graphs are constructed from bipartite graphs and some further methods are introduced to obtain more from old. (C) 2015 Wiley Periodicals Inc.