Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/10719
Title: Modıfıed mergıng clusterıng and backbone formatıon algorıthms for mobıle ad hoc networks
Authors: Dağdeviren, Orhan
Erciyes, Kayhan
Çokuslu, Deniz
Keywords: Clustering
Backbone Formation
Mobile Ad Hoc Networks
Layered Architecture
Spanning Tree
Message Complexity
Time Complexity
Issue Date: 2012
Publisher: Azerbaijan National Academy of Sciences
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.
URI: https://hdl.handle.net/11147/10719
ISSN: 1683-3511
1683-6154
Appears in Collections:WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record



CORE Recommender

Page view(s)

114
checked on Mar 4, 2024

Google ScholarTM

Check





Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.