Heuristic custering algorithms in ad hoc networks
| dc.authorid | 0000-0003-1949-2765 | en_US |
| dc.contributor.author | Aydın, Nevin | |
| dc.date.accessioned | 2023-02-07T07:13:12Z | |
| dc.date.available | 2023-02-07T07:13:12Z | |
| dc.date.issued | 2014 | |
| dc.department | AÇÜ, Hopa İktisadi ve İdari Bilimler Fakültesi, İşletme Bölümü | en_US |
| dc.description.abstract | 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. | |
| dc.identifier.citation | Aydın, N. (2014). Heuristic Clustering Algorithms in Ad hoc Networks. EMAJ: Emerging Markets Journal, 3(3), 77–80. | en_US |
| dc.identifier.doi | 10.5195/emaj.2014.39 | |
| dc.identifier.endpage | 80 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.startpage | 77 | en_US |
| dc.identifier.uri | https://dx.doi.org/10.5195/emaj.2014.39 | |
| dc.identifier.uri | https://hdl.handle.net/11494/4671 | |
| dc.identifier.volume | 3 | en_US |
| dc.institutionauthor | Aydın, Nevin | |
| dc.language.iso | en | en_US |
| dc.publisher | EMAJ | en_US |
| dc.relation.ispartof | Emerging Markets Journal | |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Clustering algorithms | en_US |
| dc.subject | Clusterhead, heuristics | en_US |
| dc.subject | Ad hoc networks | en_US |
| dc.title | Heuristic custering algorithms in ad hoc networks | en_US |
| dc.type | Article |
