Yasin Yigit
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yasin Yigit has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Orhan Dagdeviren
Department of Computer Engineering, Ege University, Izmir 35100, Turkey
3 shared publications - Can Umut Ileri
International Computer Institute, Ege University, Izmir, Turkey
2 shared publications Orhan Dagdeviren
Ege University, Turkey & International Computer Institute, Turkey
2 shared publications- Vahid Khalilpour Akram
International Computer Institute, Ege University, Izmir, Turkiye
2 shared publications Hüseyin Tolga Evcimen
Ege University, Turkey & International Computer Institute, Turkey
1 shared publicationMetin Süvari̇
Vestel
1 shared publication
Latest Publications
- Open Access
Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks
Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems. Therefore, the utilization of self-stabilization, which is one of the fault-tolerance techniques, brings the network back to its legitimate state when the topology is changed due to node leaves. In this technique, a scheduler decides on which nodes could execute their rules regarding spatial and temporal properties. A useful graph theoretical structure is the vertex cover that can be utilized in various WSN applications such as routing, clustering, replica placement and link monitoring. A capacitated vertex cover is the generalized version of the problem which restricts the number of edges covered by a vertex by applying a capacity constraint to limit the covered edge count. In this paper, we propose two self-stabilizing capacitated vertex cover algorithms for WSNs. To the best of our knowledge, these algorithms are the first attempts in this manner. The first algorithm is stabilized under an unfair distributed scheduler (that is, the scheduler which does not grant all enabled nodes to make their moves but guarantees the global progress of the system) at most step, where n is the count of nodes. The second algorithm assumes 2-hop (degree 2) knowledge about the network and runs under the unfair scheduler, which subsumes the synchronous and distributed fair scheduler and stabilizes itself after moves in step, which is acceptable for most WSN setups. We theoretically analyze the algorithms to provide proof of correctness and their step complexities. Moreover, we provide simulation setups by applying IRIS sensor node parameters and compare our algorithms with their counterparts. The gathered measurements from the simulations revealed that the proposed algorithms are faster than their competitors, use less energy and offer better vertex cover solutions.Open AccessSelf-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks
Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems. Therefore, the utilization of self-stabilization, which is one of the fault-tolerance techniques, brings the network back to its legitimate state when the topology is changed due to node leaves. In this technique, a scheduler decides on which nodes could execute their rules regarding spatial and temporal properties. A useful graph theoretical structure is the vertex cover that can be utilized in various WSN applications such as routing, clustering, replica placement and link monitoring. A capacitated vertex cover is the generalized version of the problem which restricts the number of edges covered by a vertex by applying a capacity constraint to limit the covered edge count. In this paper, we propose two self-stabilizing capacitated vertex cover algorithms for WSNs. To the best of our knowledge, these algorithms are the first attempts in this manner. The first algorithm is stabilized under an unfair distributed scheduler (that is, the scheduler which does not grant all enabled nodes to make their moves but guarantees the global progress of the system) at most step, where n is the count of nodes. The second algorithm assumes 2-hop (degree 2) knowledge about the network and runs under the unfair scheduler, which subsumes the synchronous and distributed fair scheduler and stabilizes itself after moves in step, which is acceptable for most WSN setups. We theoretically analyze the algorithms to provide proof of correctness and their step complexities. Moreover, we provide simulation setups by applying IRIS sensor node parameters and compare our algorithms with their counterparts. The gathered measurements from the simulations revealed that the proposed algorithms are faster than their competitors, use less energy and offer better vertex cover solutions. - 1 July 2021
- Published by Elsevier in Computer Networks
- Vol. 194
Breadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networks
- 1 July 2021
- Published by Elsevier in Computer Networks
- Vol. 194
Breadth-first search tree integrated vertex cover algorithms for link monitoring and routing in wireless sensor networks
- 1 January 2019
- Published by IGI Global Scientific Publishing
- p. 347-382
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
Main components of internet of things such as wireless sensor networks (WSNs) are generally modeled as graphs. Matching, dominating set, spanning tree, and vertex cover are fundamental graph theoretical structures which are widely used to solve backup assignment, clustering, backbone formation, routing, link monitoring, and other important problems in WSNs. Capacitated versions of these graph theoretical problems restrict at least one feature of the original problem such as a capacity value assignment to restrict the number of cluster member that a cluster head can serve in capacitated dominating set problem, limiting the number of nodes in each subtree connected to the root in capacitated minimum spanning tree problem, etc. The general aim of these operations is to provide energy efficiency by balancing the load evenly across the nodes. In this chapter, the authors introduce important capacitated graph theoretical problems and explain both central (sequential) and distributed algorithms for constructing these structures. The operations of the algorithms are demonstrated by sample topologies.
- 1 January 2019
- Published by IGI Global Scientific Publishing
- p. 347-382
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
Main components of internet of things such as wireless sensor networks (WSNs) are generally modeled as graphs. Matching, dominating set, spanning tree, and vertex cover are fundamental graph theoretical structures which are widely used to solve backup assignment, clustering, backbone formation, routing, link monitoring, and other important problems in WSNs. Capacitated versions of these graph theoretical problems restrict at least one feature of the original problem such as a capacity value assignment to restrict the number of cluster member that a cluster head can serve in capacitated dominating set problem, limiting the number of nodes in each subtree connected to the root in capacitated minimum spanning tree problem, etc. The general aim of these operations is to provide energy efficiency by balancing the load evenly across the nodes. In this chapter, the authors introduce important capacitated graph theoretical problems and explain both central (sequential) and distributed algorithms for constructing these structures. The operations of the algorithms are demonstrated by sample topologies.
- 30 October 2018
- Published by International Journal of Informatics Technologies in Bilişim Teknolojileri Dergisi
- Vol. 11 (4) , 321-332
Gömülü Sistemler İçin Android Tabanlı Bir Mikroişlemci Programlama Yazılımı ve Arayüzü
Gömülü sistemler belirli görevleri yerine getirmek amacıyla tasarlanıp beyaz eşya, trafik ışıkları, akıllı fabrikalar, ofis cihazları ve nesnelerin interneti gibi alanlarda kullanılır. Farklı gömülü sistemlerinin programlanması için farklı elektronik kartlar ve bilgisayar desteği gerekebilir. Böyle durumda bazı üreticilerin gömülü sistemlere yazılım yükleme işini dış sağlayıcılardan alınan hazır programlama cihazları ile yaptıkları görülmüştür. Bu cihazlarda paralel programlama imkânı olmadığından yazılım yükleme işi ancak sırayla yapılabilmektedir. Bu cihazlara firma içinde birçok birim aynı anda ihtiyaç duyabilir. Tüm bunlar maliyeti yükseltmekte ve performansı düşürmektedir. Diğer yandan, birçok durumda teknik servis ekipleri müşterilere giderken operasyonel nedenlerle bilgisayar taşımamaktadır. Dolayısıyla, bilgisayar kullanılmadan, tablet veya cep telefonu üzerinden gömülü sistem kartlarına yazılım yükleme işleminin yapılması uygun bir strateji olabilir. Android işletim sistemi günümüzde akıllı telefon ve tabletlerin ötesinde yaygın bir kullanım alanına sahip olmuştur. Öyle ki, gömülü sistemler ve bunları programlamaya yarayan cihazlarda dahi Android kullanılabilmektedir. Tablet ve cep telefonlarının maliyet, kullanım kolaylığı ve taşınabilirlik avantajlarından dolayı kişisel bilgisayarlara göre daha fazla kullanım alanı bulunmaktadır. Bu çalışmada Vestel Beyaz Eşya AŞ için ürünlere özgü farklı konsept işlemcileri destekleyen, paralel programla yapabilen ve üretim ortamına-koşullarına uygun bir yazılım yükleme cihazı tasarlanması ve gerçeklenmesi yapılmıştır. Üzerinde çalışılan gömülü sistem beyaz eşya olmasına karşın, tasarlanan sistem farklı gömülü sistemlerde de etkin olarak kullanılabilir.
- 30 October 2018
- Published by International Journal of Informatics Technologies in Bilişim Teknolojileri Dergisi
- Vol. 11 (4) , 321-332
Gömülü Sistemler İçin Android Tabanlı Bir Mikroişlemci Programlama Yazılımı ve Arayüzü
Gömülü sistemler belirli görevleri yerine getirmek amacıyla tasarlanıp beyaz eşya, trafik ışıkları, akıllı fabrikalar, ofis cihazları ve nesnelerin interneti gibi alanlarda kullanılır. Farklı gömülü sistemlerinin programlanması için farklı elektronik kartlar ve bilgisayar desteği gerekebilir. Böyle durumda bazı üreticilerin gömülü sistemlere yazılım yükleme işini dış sağlayıcılardan alınan hazır programlama cihazları ile yaptıkları görülmüştür. Bu cihazlarda paralel programlama imkânı olmadığından yazılım yükleme işi ancak sırayla yapılabilmektedir. Bu cihazlara firma içinde birçok birim aynı anda ihtiyaç duyabilir. Tüm bunlar maliyeti yükseltmekte ve performansı düşürmektedir. Diğer yandan, birçok durumda teknik servis ekipleri müşterilere giderken operasyonel nedenlerle bilgisayar taşımamaktadır. Dolayısıyla, bilgisayar kullanılmadan, tablet veya cep telefonu üzerinden gömülü sistem kartlarına yazılım yükleme işleminin yapılması uygun bir strateji olabilir. Android işletim sistemi günümüzde akıllı telefon ve tabletlerin ötesinde yaygın bir kullanım alanına sahip olmuştur. Öyle ki, gömülü sistemler ve bunları programlamaya yarayan cihazlarda dahi Android kullanılabilmektedir. Tablet ve cep telefonlarının maliyet, kullanım kolaylığı ve taşınabilirlik avantajlarından dolayı kişisel bilgisayarlara göre daha fazla kullanım alanı bulunmaktadır. Bu çalışmada Vestel Beyaz Eşya AŞ için ürünlere özgü farklı konsept işlemcileri destekleyen, paralel programla yapabilen ve üretim ortamına-koşullarına uygun bir yazılım yükleme cihazı tasarlanması ve gerçeklenmesi yapılmıştır. Üzerinde çalışılan gömülü sistem beyaz eşya olmasına karşın, tasarlanan sistem farklı gömülü sistemlerde de etkin olarak kullanılabilir.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Movement based connectivity restoration system for wireless sensor and actor networks
A k-connected wireless sensor and actor network (WSAN) has k independent paths to route between each node pair. Having high k value for a network is important in terms of fault tolerance and reliability. When a node in a network fails, k value can be kept constant by moving existing active nodes to desired locations. The aim of the k-connectivity restoration process is to maintain the current k value of the network at a constant value. In this study, a movement based restoration system is developed using IRIS nodes and Kobuki robots. The general architecture of the system is given, software and communication design are presented. The proposed system can be used as an infrastructure in various WSAN applications.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Movement based connectivity restoration system for wireless sensor and actor networks
A k-connected wireless sensor and actor network (WSAN) has k independent paths to route between each node pair. Having high k value for a network is important in terms of fault tolerance and reliability. When a node in a network fails, k value can be kept constant by moving existing active nodes to desired locations. The aim of the k-connectivity restoration process is to maintain the current k value of the network at a constant value. In this study, a movement based restoration system is developed using IRIS nodes and Kobuki robots. The general architecture of the system is given, software and communication design are presented. The proposed system can be used as an infrastructure in various WSAN applications.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Evaluation of fault tolerant link monitoring algorithms for wireless sensor networks
Wireless sensor networks are ad-hoc networks that operate with limited capacity and energy. In wireless sensor networks, it may be desirable to monitor the traffic on the network by checking the links for the security of the system. For such a scenario, the vertex cover problem, which is the well-known problem in the graph theory, can be used. The problem is covering of links on the graph by selecting the minimum number of nodes. Thus, all connections on the network can be controlled using as few devices as possible. Self-stabilizing algorithms are algorithms that stabilize the system without external intervention from a random initial state. At this point, the system guarantees a stabilization after a limited time against possible faults. In this study evaluation of vertex cover algorithms for fault tolerant link monitoring in wireless sensor network is made and it is shown that Kiniwa's algorithm performs better than the other algorithms.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Evaluation of fault tolerant link monitoring algorithms for wireless sensor networks
Wireless sensor networks are ad-hoc networks that operate with limited capacity and energy. In wireless sensor networks, it may be desirable to monitor the traffic on the network by checking the links for the security of the system. For such a scenario, the vertex cover problem, which is the well-known problem in the graph theory, can be used. The problem is covering of links on the graph by selecting the minimum number of nodes. Thus, all connections on the network can be controlled using as few devices as possible. Self-stabilizing algorithms are algorithms that stabilize the system without external intervention from a random initial state. At this point, the system guarantees a stabilization after a limited time against possible faults. In this study evaluation of vertex cover algorithms for fault tolerant link monitoring in wireless sensor network is made and it is shown that Kiniwa's algorithm performs better than the other algorithms.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 423-427
Fault tolerance performance of self-stabilizing independent set algorithms on a covering-based problem: The case of link monitoring in WSNs
Vertex cover (VC) is one of the most fundamental graph-theoretical problems and has been widely used in wireless sensor networks (WSNs), particularly for the link monitoring problem. It is well known that a solution to the independent set problem (IS), which is another fundamental graph-theoretical problem, is complement of a VC. Self- stabilization is an important concept for designing fault tolerance systems. There have been many self-stabilizing VC and IS algorithms in the field. Even though a self-stabilizing IS algorithm can provide VC solutions, it does not give a theoretical guarantee on approximation ratio. In this work, we focus on practical fault tolerance performance of self- stabilizing IS algorithms in case of a vertex cover problem, particularly link monitoring in WSNs. We implement all existing self-stabilizing VC and IS algorithms and make simulations assuming a WSN in which nodes run synchronously. Results show that self-stabilizing IS algorithms in general are able to find better covers than VC algorithms, as they provide roughly 15% smaller solution sets. Furthermore, IS algorithms that run under distributed scheduler converges to a desired configuration in considerably less number of rounds than VC algorithms.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 423-427
Fault tolerance performance of self-stabilizing independent set algorithms on a covering-based problem: The case of link monitoring in WSNs
Vertex cover (VC) is one of the most fundamental graph-theoretical problems and has been widely used in wireless sensor networks (WSNs), particularly for the link monitoring problem. It is well known that a solution to the independent set problem (IS), which is another fundamental graph-theoretical problem, is complement of a VC. Self- stabilization is an important concept for designing fault tolerance systems. There have been many self-stabilizing VC and IS algorithms in the field. Even though a self-stabilizing IS algorithm can provide VC solutions, it does not give a theoretical guarantee on approximation ratio. In this work, we focus on practical fault tolerance performance of self- stabilizing IS algorithms in case of a vertex cover problem, particularly link monitoring in WSNs. We implement all existing self-stabilizing VC and IS algorithms and make simulations assuming a WSN in which nodes run synchronously. Results show that self-stabilizing IS algorithms in general are able to find better covers than VC algorithms, as they provide roughly 15% smaller solution sets. Furthermore, IS algorithms that run under distributed scheduler converges to a desired configuration in considerably less number of rounds than VC algorithms.