Bilgilendirme: Sürüm Güncellemesi ve versiyon yükseltmesi nedeniyle, geçici süreyle zaman zaman kesintiler yaşanabilir ve veri içeriğinde değişkenlikler gözlemlenebilir. Göstereceğiniz anlayış için teşekkür ederiz.
 

Comparison of Ant Colony and Fastest Path Algorithms for Fixed and Variable Number of Nodes in Multi-Hop Networks

dc.contributor.author Şafak, A.
dc.contributor.author Preveze, B.
dc.contributor.authorID 17573 tr_TR
dc.contributor.other 06.03. Elektrik-Elektronik Mühendisliği
dc.contributor.other 06. Mühendislik Fakültesi
dc.contributor.other 01. Çankaya Üniversitesi
dc.date.accessioned 2022-03-24T12:06:18Z
dc.date.accessioned 2025-09-18T13:28:07Z
dc.date.available 2022-03-24T12:06:18Z
dc.date.available 2025-09-18T13:28:07Z
dc.date.issued 2010
dc.description.abstract In this study, the fastest path algorithm which is known as a routing method from source to destination and Ant colony method which is known to be adaptable to the dynamic changes in the network are compared for average hop counts, power consumption and packet arrival delays by implementing a mobile network simulation. Even the average hop counts for both algorithms reach to almost same value at the simulation results, since it is seen that the fastest path algorithm provides less packet delay and less power consumption with respect to Ant colony algorithm , it is thought that fastest path algorithm may be more useful than Ant colony algorithm for real time voice or video packet transmissions. ©2010 IEEE. en_US
dc.identifier.citation Preveze, Barbaros; Şafak, A. (2010). "Comparison of ant colony and fastest path algorithms for fixed and variable number of nodes in multi-hop networks", SIU 2010 - IEEE 18th Signal Processing and Communications Applications Conference,18th IEEE Signal Processing and Communications Applications Conference, SIU 201022 April 2010 through 24 April 2010, pp. 535-537. en_US
dc.identifier.doi 10.1109/SIU.2010.5651036
dc.identifier.isbn 9781424496716
dc.identifier.scopus 2-s2.0-78651457508
dc.identifier.uri https://doi.org/10.1109/SIU.2010.5651036
dc.identifier.uri https://hdl.handle.net/123456789/13149
dc.language.iso tr en_US
dc.relation.ispartof SIU 2010 - IEEE 18th Signal Processing and Communications Applications Conference -- 18th IEEE Signal Processing and Communications Applications Conference, SIU 2010 -- 22 April 2010 through 24 April 2010 -- Diyarbakir -- 83388 en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.title Comparison of Ant Colony and Fastest Path Algorithms for Fixed and Variable Number of Nodes in Multi-Hop Networks en_US
dc.title Comparison of ant colony and fastest path algorithms for fixed and variable number of nodes in multi-hop networks tr_TR
dc.type Conference Object en_US
dspace.entity.type Publication
gdc.author.institutional Preveze, Barbaros
gdc.author.scopusid 25961185200
gdc.author.scopusid 6603577027
gdc.description.department Çankaya University en_US
gdc.description.departmenttemp Preveze B., Elektronik ve Haberleşme Mühendisliǧi Bölümü, Çankaya Üniversitesi, Turkey; Şafak A., Elektrik ve Elektronik Mühendisliǧi Bölümü, Başkent Üniversitesi, Turkey en_US
gdc.description.endpage 537 en_US
gdc.description.publicationcategory Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı en_US
gdc.description.startpage 535 en_US
gdc.identifier.openalex W2157596691
gdc.openalex.fwci 0.0
gdc.openalex.normalizedpercentile 0.22
gdc.opencitations.count 0
gdc.plumx.mendeley 2
gdc.plumx.scopuscites 0
gdc.scopus.citedcount 0
relation.isAuthorOfPublication 9d5455fb-4b54-4fd4-9cee-322e4c22fe65
relation.isAuthorOfPublication.latestForDiscovery 9d5455fb-4b54-4fd4-9cee-322e4c22fe65
relation.isOrgUnitOfPublication a8b0a996-7c01-41a1-85be-843ba585ef45
relation.isOrgUnitOfPublication 43797d4e-4177-4b74-bd9b-38623b8aeefa
relation.isOrgUnitOfPublication 0b9123e4-4136-493b-9ffd-be856af2cdb1
relation.isOrgUnitOfPublication.latestForDiscovery a8b0a996-7c01-41a1-85be-843ba585ef45

Files