Modıfıed Mergıng Clusterıng And Backbone Formatıon Algorıthms For Mobıle Ad Hoc Networks

dc.contributor.author Dağdeviren, Orhan
dc.contributor.author Erciyes, Kayhan
dc.contributor.author Çokuslu, Deniz
dc.date.accessioned 2021-01-24T18:47:38Z
dc.date.available 2021-01-24T18:47:38Z
dc.date.issued 2012
dc.description.abstract Clustering and backbone formation are widely used techniques to manage the routing operation in mobile ad hoc networks (MANET)s. In this work, we provide algorithms to form a backbone that is highly resilient to mobility and topology variations in mobile ad hoc networks. The first algorithm forms clusters of nodes in the mobile network each with a leader. The clusters are constructed in a balanced way to distribute the network load evenly. The second algorithm builds a ring network among the leaders of the clusters. The ring backbone is constructed in a fault tolerant and energy efficient way. These two algorithms are integrated in a communication architecture. To the best of our knowledge, our algorithms are the first attempts that construct balanced clusters with a ring backbone. We show the operation of the algorithms, analyze their proof of correctness, time and message complexities and provide the simulation results in ns2 environment against the density, number of clusters, and mobility of the network. We compare our proposed algorithms with the existing algorithms, and show that our algorithms create a controllable number of balanced clusters and robust ring backbone infrastructures while, providing low message count and run-time. en_US
dc.identifier.issn 1683-3511
dc.identifier.issn 1683-6154
dc.identifier.uri https://hdl.handle.net/11147/10719
dc.language.iso en en_US
dc.publisher Azerbaijan National Academy of Sciences en_US
dc.relation.ispartof Applied and Computational Mathematics en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.subject Clustering en_US
dc.subject Backbone Formation en_US
dc.subject Mobile Ad Hoc Networks en_US
dc.subject Layered Architecture en_US
dc.subject Spanning Tree en_US
dc.subject Message Complexity en_US
dc.subject Time Complexity en_US
dc.title Modıfıed Mergıng Clusterıng And Backbone Formatıon Algorıthms For Mobıle Ad Hoc Networks en_US
dc.type Article en_US
dspace.entity.type Publication
gdc.author.institutional Çokuslu, Deniz
gdc.coar.access metadata only access
gdc.coar.type text::journal::journal article
gdc.description.department İzmir Institute of Technology. Computer Engineering en_US
gdc.description.departmenttemp [Dagdeviren, Orhan; Erciyes, Kayhan] Izmir Univ, Comp Eng Dept, TR-35350 Izmir, Turkey; [Cokuslu, Deniz] Izmir Inst Technol, Comp Eng Dept, TR-35430 Izmir, Turkey en_US
gdc.description.endpage 73 en_US
gdc.description.issue 1 en_US
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
gdc.description.scopusquality Q1
gdc.description.startpage 46 en_US
gdc.description.volume 11 en_US
gdc.description.wosquality Q1
gdc.identifier.wos WOS:000300919600005
gdc.index.type WoS
gdc.wos.citedcount 0
relation.isAuthorOfPublication.latestForDiscovery 20d6f698-0f58-4006-a48e-f046f5d60344
relation.isOrgUnitOfPublication.latestForDiscovery 9af2b05f-28ac-4014-8abe-a4dfe192da5e

Files