A binary artificial bee colony algorithm for constructing spanning trees in vehicular ad hoc networks

To accomplish reliable and efficient information routing, strong paths connecting all nodes are required in vehicular ad hoc networks (VANETs). Classical algorithms in graphic theory could find only one minimum spanning tree (MST) in VANETs. Swarm intelligence paradigms are able to obtain several al...

Full description

Saved in:

Bibliographic Details
Published in:	Ad hoc networks Vol. 58; pp. 198 - 204
Main Authors:	Zhang, Xin, Zhang, Xiu
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2017
Subjects:	Artificial bee colony Binary representation Minimum spanning tree Vehicular ad hoc network Vehicular ad hoc network Artificial bee colony Binary representation Minimum spanning tree
ISSN:	1570-8705, 1570-8713
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!