An artificial bee colony algorithm for the minimum average routing path clustering problem in multi-hop underwater sensor networks

Abstract

Given a set of sensor nodes and a set of sinks placed randomly in an Euclidean plane, the minimum average routing path clustering problem (MARPCP) seeks a subset of sensors to function as cluster heads such that each sensor node is adjacent to at least one cluster head, and the expected hop distance from a node to its nearest sink in the clustering-based routing scheme is minimized. This problem is of particular concern in underwater sensor networks. This paper proposes a new approach to this problem based on Artificial Bee Colony (ABC) algorithm. Computational results show the effectiveness of our proposed approach. © 2012 Springer-Verlag.