Modıfıed Mergıng Clusterıng And Backbone Formatıon Algorıthms For Mobıle Ad Hoc Networks
No Thumbnail Available
Date
2012
Authors
Dağdeviren, Orhan
Erciyes, Kayhan
Çokuslu, Deniz
Journal Title
Journal ISSN
Volume Title
Publisher
Azerbaijan National Academy of Sciences
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
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.
Description
Keywords
Clustering, Backbone Formation, Mobile Ad Hoc Networks, Layered Architecture, Spanning Tree, Message Complexity, Time Complexity
Turkish CoHE Thesis Center URL
Fields of Science
Citation
WoS Q
Q1
Scopus Q
Q1
Source
Applied and Computational Mathematics
Volume
11
Issue
1
Start Page
46
End Page
73
Page Views
738
checked on Oct 11, 2025