
Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm
Author(s) -
Serap Ergün,
Sırma Zeynep Alparslan Gök,
Tuncay Aydoğan,
Gerhard Weber
Publication year - 2017
Publication title -
journal of industrial and management optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.325
H-Index - 32
eISSN - 1553-166X
pISSN - 1547-5816
DOI - 10.3934/jimo.2018086
Subject(s) - dijkstra's algorithm , computer science , shortest path problem , node (physics) , algorithm , suurballe's algorithm , wireless ad hoc network , mobile ad hoc network , k shortest path routing , path (computing) , yen's algorithm , shortest path faster algorithm , mathematical optimization , computer network , wireless , mathematics , theoretical computer science , network packet , engineering , graph , telecommunications , structural engineering