Preprint Review Version 1 This version is not peer-reviewed

A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks

Version 1 : Received: 15 September 2018 / Approved: 18 September 2018 / Online: 18 September 2018 (05:56:39 CEST)

How to cite: Parsapoor, M.; Bilstrup, U. A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks. Preprints 2018, 2018090329 (doi: 10.20944/preprints201809.0329.v1). Parsapoor, M.; Bilstrup, U. A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks. Preprints 2018, 2018090329 (doi: 10.20944/preprints201809.0329.v1).

Abstract

Forming a clustered network structure has been proposed as a solution to increase network performance, scalability, stability and manageability in an ad hoc network. A good clustering algorithm aims to select cluster heads among available nodes so that a number of specific constraints are satisfied; thus the cluster head selection problem is a multiobjective optimization problem. This paper proposes an algorithm on the basis of ant colony optimization (ACO) to be used to solve this problem. The proposed algorithm is a simple, one hop cluster formation algorithm, to form a clustered structure with the minimum number of clusters. The centralized ACO-based clustering algorithm is evaluated and compared with other clustering algorithms in ad hoc networks in terms of cluster density.

Subject Areas

Ad hoc networks; ant colony optimization; clusterformation

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.