A Merging Clustering Algorithm for Mobile Ad Hoc Networks
Loading...
Files
Date
2006
Authors
Dağdeviren, Orhan
Erciyeş, Kayhan
Çokuslu, Deniz
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms
Description
ICCSA 2006: International Conference on Computational Science and Its Applications; Glasgow; United Kingdom; 8 May 2006 through 11 May 2006
Keywords
Communication systems, Algorithms, Computational complexity, Problem solving, Computational complexity, Problem solving, Communication systems, Algorithms
Fields of Science
0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
Dağdeviren, O., Erciyeş, K., and Çokuslu, D. (2006). A merging clustering algorithm for mobile ad hoc networks. Lecture Notes in Computer Science, 3981 LNCS, 681-690. doi:10.1007/11751588_71
WoS Q
N/A
Scopus Q
Q3
OpenCitations Citation Count
4
Source
Lecture Notes in Computer Science
Volume
3981 LNCS
Issue
Start Page
681
End Page
690
PlumX Metrics
Citations
CrossRef : 4
Scopus : 6
Captures
Mendeley Readers : 7
Google Scholar™
