Merging clustering algorithms in mobile ad hoc networks
Makaleler > Tam Makale · 2005
Yazarlar: Orhan DAĞDEVİREN, K Erciyes, D Cokuslu
DISTRIBUTED COMPUTING AND INTERNET TECHNOLOGY, PROCEEDINGS, SCI Expanded İndekslerine Giren Dergi, Uluslararası, 2005, cilt 3816, ss 56-61
Özet
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 first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose 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.