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

dc.contributor.author	Dokku, Venkateswara Rao
dc.contributor.author	Singh, Alok
dc.date.accessioned	2022-03-27T06:00:53Z
dc.date.available	2022-03-27T06:00:53Z
dc.date.issued	2012-09-07
dc.description.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.
dc.identifier.citation	Communications in Computer and Information Science. v.269 CCIS(PART I)
dc.identifier.issn	18650929
dc.identifier.uri	10.1007/978-3-642-29219-4_25
dc.identifier.uri	http://link.springer.com/10.1007/978-3-642-29219-4_25
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/9104
dc.subject	Artificial Bee Colony Algorithm
dc.subject	Clustering Based Routing Scheme
dc.subject	Swarm Intelligence
dc.subject	Underwater Sensor Networks
dc.title	An artificial bee colony algorithm for the minimum average routing path clustering problem in multi-hop underwater sensor networks
dc.type	Book Series. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1