Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
An Artificial Bee Colony Algorithm for the Minimum Average Routing Path Clustering Problem in Multi-hop Underwater Sensor Networks
verfasst von : Venkateswara Rao Dokku, Alok Singh
Erschienen in: Global Trends in Computing and Communication Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.