Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm (Q2314471)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm |
scientific article |
Statements
Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra's algorithm (English)
0 references
23 July 2019
0 references
ad hoc networks
0 references
Dijkstra's algorithm
0 references
Dijkstra's algorithm with battery times
0 references
cooperative flow game algorithm
0 references
simulation
0 references
optimization
0 references
0.8691686
0 references
0.8570812
0 references
0.84886926
0 references
0.84348184
0 references
0.8426663
0 references
