Browsing by Author "Akram, Vahid Khalilpour"
Now showing items 1-9 of 9
-
An Asynchronous Distributed Algorithm for Minimum s - t Cut Detection in Wireless Multi-hop Networks
Akram, Vahid Khalilpour (Elsevier, 2020)Stable communication is a vital and challenging requirement in wireless multi-hop networks because nodes failure may disconnect other active nodes. Minimum s-t cuts can help to measure the reliability of a network regarding ... -
A Distributed depth first Search based algorithm for edge connectivity estimation
Uğurlu, Onur; Akram, Vahid Khalilpour; Eliiyi, Deniz Türsel (IEEE, 2020)The edge connectivity of a network is the minimum number of edges whose removal disconnect the network. The edge connectivity determines the minimum number of edge-disjoint paths between all nodes. Hence finding the edge ... -
Holistic Analysis of Reliability and Lifetime Tradeoff in Sensor Networks
Çobanlar, Muhammed; Tavli, Büent; Akram, Vahid Khalilpour; Dağdeviren, Orhan (IEEE, 2020)Network lifetime has been the most commonly employed metric for characterization of Wireless Sensor Networks (WSNs) in the literature. Network reliability is also an important aspect of WSNs, especially, deployed for ... -
Kapalı ortamlarda kişi tespitinde makine öğrenmesi algoritmalarının karşılaştırmalı başarım analizi
Günümüzde, iç mekan konumlandırma ve kişi takip sistemlerinin uygulama alanları her geçen gün artış göstermektedir. Özellikle, hasta, personel, cihaz ve müşteri takip sistemleri ile akıllı binalar ve kalabalık tahminleme ... -
A localized distributed algorithm for vertex cover problem
Akram, Vahid Khalilpour; Uğurlu, Onur (Elsevier B.V., 2022)Finding the minimum vertex cover of a given graph is a well-known NP-Hard problem that has many applications in various fields. In this paper, we propose a distributed localized algorithm for detecting vertex cover using ... -
Localized identification of malicious nodes in wireless sensor networks
Akram, Vahid Khalilpour; Erten, Yusuf Murat (IEEE, 2020)Securing a wireless sensor network against the various attacks with minimal energy consumption is a challenging task because the nodes usually have limited energy source, are distributed in harsh environments and communicate ... -
Parallel identification of central nodes in wireless multi-hop networks
Eliiyi, Deniz Türsel; Arslan, Hilal; Akram, Vahid Khalilpour; Uğurlu, Onur (IEEE, 2020)A wireless multi-hop network is a collection of nodes that communicate by message passing over multiple links. Sending a message to a remote node can consume some energy from all intermediary nodes. In a network, the nodes ... -
A progressive search algorithm for the minimum hitting set problem
Given a finite universe and a collection of the subsets of the universe, the minimum hitting set of thecollection is the smallest subset of the universe that has non-empty intersection with each set in thecollection. Finding ... -
Telsiz Duyarga Ağlarda Bizans Saldırılarının Topluluk Öğrenme-tabanlı Tespiti
Telsiz duyarga ağlar (TDA)’da düğümler arasında güvenilir iletişimin sağlanması ve doğru verilerintoplanması birçok açıdan hayati önem taşımaktadır. TDA’ların merkezi iletişim altyapısıolmadığından dolayı, bu ağlar çeşitli ...
