Akcan, Hüseyin
Loading...
Profile URL
Name Variants
Akcan, Hueseyin
Job Title
Email Address
huseyin.akcan@ieu.edu.tr
Main Affiliation
05.04. Software Engineering
Status
Current Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Sustainable Development Goals
1NO POVERTY
0
Research Products
2ZERO HUNGER
0
Research Products
3GOOD HEALTH AND WELL-BEING
0
Research Products
4QUALITY EDUCATION
0
Research Products
5GENDER EQUALITY
0
Research Products
6CLEAN WATER AND SANITATION
0
Research Products
7AFFORDABLE AND CLEAN ENERGY
1
Research Products
8DECENT WORK AND ECONOMIC GROWTH
0
Research Products
9INDUSTRY, INNOVATION AND INFRASTRUCTURE
2
Research Products
10REDUCED INEQUALITIES
0
Research Products
11SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
12RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
13CLIMATE ACTION
0
Research Products
14LIFE BELOW WATER
0
Research Products
15LIFE ON LAND
0
Research Products
16PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
17PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents
16
Citations
209
h-index
8
Documents
0
Citations
0
Scholarly Output
14
Articles
9
Views / Downloads
18/314
Supervised MSc Theses
3
Supervised PhD Theses
0
WoS Citation Count
78
Scopus Citation Count
105
Patents
0
Projects
1
WoS Citations per Publication
5.57
Scopus Citations per Publication
7.50
Open Access Source
7
Supervised Theses
3
| Journal | Count |
|---|---|
| Ieee Communıcatıons Letters | 2 |
| Applıed Soft Computıng | 2 |
| Computer Communıcatıons | 1 |
| Journal of Heurıstıcs | 1 |
| Journal of Parallel And Dıstrıbuted Computıng | 1 |
Current Page: 1 / 2
Scopus Quartile Distribution
Competency Cloud
14 results
Scholarly Output Search Results
Now showing 1 - 10 of 14
Research Project Mobil Kablosuz Ağlarda Üç Boyutta Konum Tespiti Algoritmalarının Geliştirilmesi ve Analizi(2014) Evrendilek, Cem; Akcan, Hüseyin; Unay, Ali Teoman; Çağırıcı, Onur[Abstract Not Available]Master Thesis All Colors Shortest Path Problem on Trees [master Thesis](İzmir Ekonomi Üniversitesi, 2015) Akçay, Mehmet Berkehan; Akcan, Hüseyin; Evrendilek, CemAğaç Yapılarında Tüm Renkleri İçeren En Kısa Yolu Bulma (TREKY-a) problemi, V kümesi içinde bulunan r düğümünde kökleşmiş bir T = (V;E) ağacı verilip, ağaçtaki her bir düğüme C = {1,2,...,k} kümesinden bir renk atandığında, r düğümünden başlayarak, her bir farklı renkten en az bir düğüm içeren en kısa yolu bulma problemidir. Biz TREKY-a probleminin NP-Zor olduğunu gösteriyoruz. Ayrıca, TREKY-a için sabit faktörlü bir yakınsama algoritmasının olmadığını kanıtlıyoruz. TREKY-a problemi için tamsayı lineer programlama formülü veriyoruz. Bu formülün lineer programlama gevşetmesini temel alarak çeşitli sezgisel çözüm yöntemleri öneriliyor. Bu tez ayrıca TREKY-a için Genetik ve Tabu Arama algoritmalarını temel alan alternatif sezgisel çözüm yöntemleri de geliştirmektedir. Önerilen bütün sezgisel yöntemlerin performansı çeşitli parametrik tipte ağaçlarla deneysel olarak değerlendirilmektedir.Article Citation - WoS: 8Citation - Scopus: 8On the Complexity of Energy Efficient Pairwise Calibration in Embedded Sensors(Elsevier Science Bv, 2013) Akcan, HüseyinTechnological advances in nanotechnology enabled the use of microelectromechanical systems (MEMS) in various application areas. With the integration of various sensor devices into MEMS, autonomously calibrating these sensors become a major research problem. When performing calibration on real-world embedded sensor network deployments, random errors due to internal and external factors alter the calibration parameters and eventually effect the calibration quality in a negative way. Therefore, during autonomous calibration, calibration paths which has low cost and low error values are preferable. To tackle the calibration problem on embedded wireless sensor networks, we present an energy efficient and minimum error calibration model, and also prove that due to random errors the problem turns into an NP-complete problem. To the best of our knowledge this is the first time a formal proof is presented on the complexity of an iterative calibration based problem when random errors are present in the measurements. We also conducted heuristic tests using genetic algorithm to solve the optimization version of the problem, on various graphs. The NP-completeness result also reveals that more research is needed to examine the complexity of calibration in a more general framework in real-world sensor network deployments. (C) 2013 Elsevier B. V. All rights reserved.Article Citation - WoS: 8Citation - Scopus: 9Complexity of Energy Efficient Localization With the Aid of a Mobile Beacon(IEEE-Inst Electrical Electronics Engineers Inc, 2018) Akcan, Hüseyin; Evrendilek, CemLocalization is an essential service in wireless sensor networks. Trilateration is a commonly used solution to range-based localization for providing such services. It might be, however, impossible to localize the entire network at once using trilateration due to low connectivity on sparse deployments. In such scenarios, a mobile beacon with a known position is used to move among and locate the nodes with low connectivity to aid trilateration. Given a network graph, finding a minimum energy route traveled by the mobile beacon is a key problem in many real-world applications. We prove in this letter that this problem called mobile assisted trilateration based energy optimum localization is NP-hard. To the best of our knowledge, this is the first such result in an attempt to computationally classify this important problem. We also provide a compact integer linear programming formulation for the problem.Article Citation - WoS: 4Citation - Scopus: 4All Colors Shortest Path Problem on Trees(Springer, 2018) Akcay, Mehmet Berkehan; Akcan, Hüseyin; Evrendilek, CemGiven an edge weighted tree T(V, E), rooted at a designated base vertex , and a color from a set of colors assigned to every vertex , All Colors Shortest Path problem on trees (ACSP-t) seeks the shortest, possibly non-simple, path starting from r in T such that at least one node from every distinct color in C is visited. We show that ACSP-t is NP-hard, and also prove that it does not have a constant factor approximation. We give an integer linear programming formulation of ACSP-t. Based on a linear programming relaxation of this formulation, an iterative rounding heuristic is proposed. The paper also explores genetic algorithm and tabu search to develop alternative heuristic solutions for ACSP-t. The performance of all the proposed heuristics are evaluated experimentally for a wide range of trees that are generated parametrically.Master Thesis Mobile Assisted Range-Based Localization in Multi-Storey Buildings(İzmir Ekonomi Üniversitesi, 2015) Unay, Ali Teoman; Akcan, Hüseyin; Evrendilek, CemKonumlama; sağlık hizmetleri, habitat gözlemleme, arama-kurtarma çalışmaları gibi bir çok uygulamada kullanılan bir hizmettir. Bu uygulamalarda konum bilgisi; toplanılan verinin sınıflandırılması, bina içi hareket planlarının ya da tahliye planlarının kurgulanması gibi amaçlar için kullanılır. Küresel konumlandırma sistemleri (GPS) konumlama hizmeti için genel tercih olsa da bu sistemler kapalı alanlarda çalışmaz. Bununla birlikte, kapalı ortam, quadrilaterasyon gibi konumlama algoritmaları için de pek çok sorun teşkil eder. Bu çalışmada, quadrilaterasyonun çok katlı binalardaki zayıflıklarının analizini yaptık ve quadrilaterasyon algoritmasını iyileştirmek için özgün metodlar geliştirdik. Bu metodlarda, ihtiyaç duyulan zamanlarda bir gezgin birimin yardımını aldık. Ayrıca, bu gezgin birimin kullanımını en aza indirirken, konumlanan birim sayısını maksimuma çıkarmayı da amaçladık. Bu tezde, spesifik olarak çok katlı binalar için tasarlanmış, özgün, uzaklık ölçümüne dayalı bir konumlama algoritması sunuyoruz. Algoritmamız, Pasif Konumlama ve Gezgin Yardımlı Konumlama safhalarından oluşuyor ve gezgin müdahalesinin gereksinimini olabildiğince en aza indirmeyi hedefliyor.Article Citation - WoS: 6Citation - Scopus: 6A Genetic Algorithm Based Solution To the Minimum-Cost Bounded-Error Calibration Tree Problem(Elsevier Science Bv, 2018) Akcan, HüseyinSensors in wireless sensor networks are required to be self-calibrated periodically during their prolonged deployment periods. In calibration planning, employing intelligent algorithms are essential to optimize both the efficiency and the accuracy of calibration. The Minimum-Cost Bounded-Error Calibration Tree (MBCT) problem is a spanning tree problem with two objectives, minimizing the spanning tree cost and bounding the maximum post-calibration skew. The decision version of the MBCT problem is proven to be NP-Complete. In this paper, the GAWES algorithm is presented as a novel genetic algorithm based solution to the optimization version of the MBCT problem. GAWES adopts extreme efficient solution generation within the genetic algorithm to improve the search quality. It is demonstrated through experimentation that GAWES is superior to the existing state of the art algorithm, both in energy efficiency and calibration accuracy. (C) 2018 Elsevier B.V. All rights reserved.Article Citation - WoS: 4Citation - Scopus: 6Alleviating the Topology Mismatch Problem in Distributed Overlay Networks: a Survey(Elsevier Science Inc, 2016) Moustakas, Vassilis; Akcan, Hüseyin; Roussopoulos, Mema; Delis, AlexPeer-to-peer (P2P) systems have enjoyed immense attention and have been widely deployed on the Internet for well over a decade. They are often implemented via an overlay network abstraction atop the Internet's best-effort IP infrastructure. P2P systems support a plethora of desirable features to distributed applications including anonymity, high availability, robustness, load balancing, quality of service and scalability to name just a few. Unfortunately, inherent weaknesses of early deployments of P2P systems, prevented applications from leveraging the full potential of the paradigm. One major weakness, identified early on, is the topology mismatch problem between the overlay network and the underlying IP topology. This mismatch can impose an extraordinary amount of unnecessary stress on network resources and can adversely affect both the scalability and efficiency of the operating applications. In this paper, we survey over a decade's worth of research efforts aimed at alleviating the topology mismatch problem in both structured and unstructured P2P systems. We provide a fine-grained categorization of the suggested solutions by discussing their novelty, advantages and weaknesses. Finally, we offer an analysis as well as pictorial comparisons of the reviewed approaches since we aim to offer a comprehensive reference for developers, system architects and researchers in the field. (C) 2015 Published by Elsevier Inc.Article Citation - WoS: 18Citation - Scopus: 24Gps-Free Directional Localization Via Dual Wireless Radios(Elsevier, 2012) Akcan, Hüseyin; Evrendilek, CemLocation discovery, especially in mobile environments, has recently become the key component of many applications. Accurate location discovery, particularly in safety critical applications using autonomous robots or unmanned vehicles, however, is still an open problem. Existing popular methods either heavily rely on the use of global positioning systems (GPS) which do not readily lend themselves for use for the majority of applications where precision is of primary concern or are not suitable for ad-hoc deployments. In this paper, we propose a novel directional localization algorithm, called dual wireless radio localization (DWRL), which performs accurate node localizations in the plane using only distances between nodes, without the use of a GPS or nodes with known positions (anchors). The main novelty of DWRL is the use of an additional radio per node to support directional localization in static networks. To the best of our knowledge, this is the first time dual radios are employed in a localization setting. Existence of the dual radios on board enables DWRL algorithm to perform directional localization, which is not possible with existing single radio systems in static networks. We present the practical and theoretical benefits of the use of an additional radio per node in detail, test our algorithm under excessive synthetic and real-world noise scenarios, and show that DWRL algorithm is robust enough to perform directional localization even in high noise environments. (C) 2011 Elsevier B.V. All rights reserved.Article Citation - WoS: 1Citation - Scopus: 1Virtual Body Anthropomorphism Increases Drift in Self-Location: Further Support for the Humanoid Shape Rule(Wiley, 2022) Tekgun, Ege; Uludagli, Muhtar C.; Akcan, Hüseyin; Erdeniz, BurakPrevious studies on bodily self-consciousness (BCS) have shown that self-location and body ownership are prone to changes based on the perceptual appearances of the fake virtual body. In the current study with 36 participants, we assessed the influence of virtual avatar anthropomorphism and the synchronicity of the visuo-tactile stimulation on self-location using a virtual reality full-body illusion experiment. During the experiment, half of the participants observed a gender-matched full-body humanoid avatar from a first-person perspective (1PP) and the other half observed a less anthropomorphic full-body cubical avatar from 1PP while they were receiving synchronous and asynchronous visuo-tactile stimulation. Results showed a significant main effect of the synchronicity of the visuo-tactile stimulation and avatar body type on self-location but no significant interaction was found between them. Moreover, the results of the self-report questionnaire provide additional evidence showing that participants who received synchronous visuo-tactile stimulation, experienced not only greater changes in the feeling of self-location, but also, increased ownership, and referral of touch. Our results provided further support for the previous findings that showed evidence for the effect of virtual avatar appearance on BCS.