Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm | Zendy

Serap Ergün | Zendy; Sırma Zeynep Alparslan Gök | Zendy; Tuncay Aydoğan | Zendy; GerhardWilhelm Weber | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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,

GerhardWilhelm Weber

Publication year - 2018

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 , algorithm , suurballe's algorithm , node (physics) , k shortest path routing , yen's algorithm , path (computing) , wireless ad hoc network , shortest path faster algorithm , mobile ad hoc network , mathematical optimization , computer network , wireless , mathematics , theoretical computer science , network packet , graph , telecommunications , structural engineering , engineering

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research