Heuristic custering algorithms in ad hoc networks
Yükleniyor...
Dosyalar
Tarih
2014
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
EMAJ
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
The clustering allows the geographical region to be covered into small zones in which each zone can be handled with a powerful node called clusterhead. The clusterheads have direct communication link with each of its members whereas the member nodes of a cluster must go through the clusterhead to communicate with each other. Since choosing clusterheads optimally is an NP-hard problem, existing solutions to this problem are based on heuristic (mostly greedy) approaches. In this paper, we present three well-known heuristic clustering algorithms: the Lowest-ID, the Highest-Degree, and the Node-Weight.
Açıklama
Anahtar Kelimeler
Clustering algorithms, Clusterhead, heuristics, Ad hoc networks
Kaynak
Emerging Markets Journal
WoS Q DeÄŸeri
Scopus Q DeÄŸeri
Cilt
3
Sayı
3
Künye
Aydın, N. (2014). Heuristic Clustering Algorithms in Ad hoc Networks. EMAJ: Emerging Markets Journal, 3(3), 77–80.
