An Energy-Efficient Distributed Cut Vertex Detection Algorithm for Wireless Sensor Networks

Dağdeviren, Orhan; Akram, Vahid Khalilpour

doi:10.1093/comjnl/bxt128

Cited by 20 publications

(10 citation statements)

References 25 publications

(71 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Centrality 49,50,51 Centralized 37,40,44 Distributed 20,41,42,43 Data transmission 39 Energy 38,51 k-connected graph 14,45,46,47 F I G U R E 2 Classification of critical nodes variants on WSN…”

Section: Cut Vertexmentioning

confidence: 99%

“…37,40 The cut vertex detection algorithms available in the literature can be divided into two categories: distributed algorithms 20,[41][42][43] and centralized algorithms. 37,40,44 In Reference 14, the authors consider a k-connected graph where a graph (G) has k connectivity if the minimum vertex cut of G has at least k vertices, that is, it remains whenever fewer than k vertices are removed. Decreasing the k value of the network can have a significant impact on the performance of the network.…”

Section: Cut Vertexmentioning

confidence: 99%

See 1 more Smart Citation

Fault‐tolerance based on augmenting approach in wireless sensor networks

Belkadi

Lehsaini

Tahraoui

2022

Concurrency and Computation

View full text Add to dashboard Cite

A critical node is a sensor whose failure causes loss of connectivity and network fragmentation. In wireless sensor networks, the failure of a critical node, like the failure of all sensor nodes, can be caused by energy depletion or physical failure. To overcome the problem of failure of such nodes, this article proposes a fault-tolerant strategy that allows a routing protocol to tolerate the failure of a critical node. The proposed strategy is carried out in two phases. In the first phase, a hybrid genetic algorithm with a local search heuristic called genetic algorithm-critical node problem (GA-CNP) is used to select the critical nodes and in the second phase, an algorithm called Aug-CNP is involved to deal with the augmentation problem by deploying additional wireless edges to preserve network connectivity in case of critical node failure. Our proposal has been developed using the OMNET++ simulator, evaluated, and compared to the AODV protocol. The simulation results showed that the GA-CNP algorithm selects the critical nodes whose failure can degrade the network lifetime with a rate of 40%. Moreover, the Aug-CNP algorithm applied to the AODV protocol brings improvements in terms of network lifetime which reaches 22% compared to the traditional AODV protocol.

show abstract

Section: Cut Vertexmentioning

confidence: 99%

Section: Cut Vertexmentioning

confidence: 99%

Fault‐tolerance based on augmenting approach in wireless sensor networks

Belkadi

Lehsaini

Tahraoui

2022

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…While it is certainly not the case that every connected graph contains a cut-point, graphs with cutpoints certainly arise in applied settings. For instance there is an interest in the existence and location of cut-points in wireless networks, and there are a number of algorithms for identifying cut-points in such networks (see, for example Dagdeviren and Akram, 2014;Stojmenovic et al, 2011;Xiong and Li, 2010). Similarly, connected scale-free networks contain large numbers of low degree vertices, and are likely to have many vertices of degree 1, which are necessarily adjacent to cut-points.…”

Section: Random Walk Centrality In the Presence Of A Cut-pointmentioning

confidence: 99%

Estimating random walk centrality in networks

Johnson

Kirkland

2019

Computational Statistics & Data Analysis

View full text Add to dashboard Cite

In this paper the random walk centrality (equivalently, the accessibility index) for the states of a time-homogenous irreducible Markov chain on a finite state space is considered. It is known that the accessibility index for a particular state can be written in terms of the first and second moments of the first return time to that state. Based on that observation, the problem of estimating the random walk centrality of a state is approached by taking realizations of the Markov chain, and then statistically estimating the first two moments of the corresponding first return time. In addition to the estimate of the random walk centrality, this method also yields the standard error, the bias and a confidence interval for that estimate. For the case that the directed graph of the transition matrix for the Markov chain has a cut-point, an alternate strategy for computing the random walk centrality is outlined that may be of use when the centrality values are of interest for only some of the states. In order to illustrate the effectiveness of the results, estimates of the random walk centrality arising from random walks for several directed and undirected graphs are discussed.

show abstract

“…Nesnelerin interneti Endüstri 4.0 ile birlikte ön plana çıkmış olup akıllı fabrikalarda kullanılmaktadır [9]. Telsiz duyarga ağlarında kritik düğümlerin tespiti için geliştirilen algoritma gömülü sistemler üzerinde uygulanmıştır [10].…”

Section: Gi̇ri̇ş (Introduction)unclassified

Gömülü Sistemler İçin Android Tabanlı Bir Mikroişlemci Programlama Yazılımı ve Arayüzü

Cabuk

Dağdeviren

Yiğit³

et al. 2018

Bilişim Teknolojileri Dergisi

View full text Add to dashboard Cite

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, farklı ürünlere özgü farklı konsept işlemcileri destekleyen, paralel programla yapabilen ve üretim ortamına-koşullarına uygun bir programlama cihazı tasarlanmış ve gerçeklenmiştir. Ayrıca, cihazın kontrol edilmesini sağlayan Windows ve Android uygulamaları da yazılmıştır. Üzerinde çalışılan gömülü sistem beyaz eşya odaklı olmasına karşın, tasarlanan sistem farklı gömülü sistemlerde de etkin olarak kullanılabilir.

show abstract

An Energy-Efficient Distributed Cut Vertex Detection Algorithm for Wireless Sensor Networks

Cited by 20 publications

References 25 publications

Fault‐tolerance based on augmenting approach in wireless sensor networks

Fault‐tolerance based on augmenting approach in wireless sensor networks

Estimating random walk centrality in networks

Gömülü Sistemler İçin Android Tabanlı Bir Mikroişlemci Programlama Yazılımı ve Arayüzü

Contact Info

Product

Resources

About