Offering New Routing Method in Ad hoc Networks using Ant Colony Algorithm

The aim of this study is to provide a novel method routing in ad hoc networks using ant colony algorithm. Hence for this study the researcher attempts to discover and create routes with less number of crossings, nodes sustainable and less energy transfer, to reduce latency end-to-end, save bandwidth and to extend the life and increase the lifetime of the network nodes. Research methodology for simulation algorithm has been OPNET software. Therefore, the proposed algorithm's performance was compared with one of the most routing algorithms in mobile ad hoc networks Ant Hoc Net. The results showed that the proposed algorithm compared with Ant Hoc Net has more end-to-end delay, more package shipping, and less routing overhead can reduce energy consumption and thus increases the lifetime of the network nodes. The results of this study indicate that the latency end-to-end, saving bandwidth and increasing lifetime of nodes and network lifetime can be predicted by the proposed algorithm. © 2022 IEEE.

Erişime Açık
Görüntülenme
119
27.02.2023 tarihinden bu yana
İndirme
1
27.02.2023 tarihinden bu yana
Son Erişim Tarihi
17 Temmuz 2024 06:19
Google Kontrol
Tıklayınız
Tam Metin
Tam Metin İndirmek için tıklayın Ön izleme
Detaylı Görünüm
Eser Adı
(dc.title)
Offering New Routing Method in Ad hoc Networks using Ant Colony Algorithm
Yazar
(dc.contributor.author)
Aref Yelghı
Yayın Yılı
(dc.date.issued)
2022
Yayıncı
(dc.publisher)
Conference Proceedings
Tür
(dc.type)
Makale
Açık Erişim Tarihi
(dc.date.available)
2022-10-01
Özet
(dc.description.abstract)
The aim of this study is to provide a novel method routing in ad hoc networks using ant colony algorithm. Hence for this study the researcher attempts to discover and create routes with less number of crossings, nodes sustainable and less energy transfer, to reduce latency end-to-end, save bandwidth and to extend the life and increase the lifetime of the network nodes. Research methodology for simulation algorithm has been OPNET software. Therefore, the proposed algorithm's performance was compared with one of the most routing algorithms in mobile ad hoc networks Ant Hoc Net. The results showed that the proposed algorithm compared with Ant Hoc Net has more end-to-end delay, more package shipping, and less routing overhead can reduce energy consumption and thus increases the lifetime of the network nodes. The results of this study indicate that the latency end-to-end, saving bandwidth and increasing lifetime of nodes and network lifetime can be predicted by the proposed algorithm. © 2022 IEEE.
DOI
(dc.identifier.doi)
10.1109/ICTACSE50438.2022.10009849
ISBN
(dc.identifier.isbn)
979-835033162-2
Orcid
(dc.identifier.orcid)
0000-0003-0683-7218
Dil
(dc.language.iso)
En
Konu Başlıkları
(dc.subject)
Ad hoc networks
Konu Başlıkları
(dc.subject)
Ant colony algorithm
Konu Başlıkları
(dc.subject)
Component
Konu Başlıkları
(dc.subject)
Formatting
Konu Başlıkları
(dc.subject)
Insert (key words)
Konu Başlıkları
(dc.subject)
Routing
Konu Başlıkları
(dc.subject)
Simulation
Konu Başlıkları
(dc.subject)
Style
Konu Başlıkları
(dc.subject)
Styling
Esere Katkı Sağlayan
(dc.contributor.other)
Yelghi, Aref
Esere Katkı Sağlayan
(dc.contributor.other)
Darafshani, Mahsa Samadi
Esere Katkı Sağlayan
(dc.contributor.other)
Tavangari, Shirmohammad
Kitap Adı
(dc.identifier.kitap)
2022 International Conference On Theoretical And Applied Computer Science And Engineering (Ictasce)
Department
(dc.contributor.department)
Bilgisayar Mühendisliği
wosauthorid
(dc.contributor.wosauthorid)
CHZ-0386-2022
Wos No
(dc.identifier.wos)
WOS:000932842500025
Bitiş Sayfası
(dc.identifier.endpage)
147
Başlangıç Sayfası
(dc.identifier.startpage)
142
Veritabanları
(dc.source.platform)
Wos
Veritabanları
(dc.source.platform)
Scopus
Analizler
Yayın Görüntülenme
Yayın Görüntülenme
Erişilen ülkeler
Erişilen şehirler
6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.
Tamam

creativecommons
Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.
Platforms