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...

Celý popis

Podrobná bibliografie

Vydáno v:	Ad hoc networks Ročník 58; s. 198 - 204
Hlavní autoři:	Zhang, Xin, Zhang, Xiu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.04.2017
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!