Minimum Cost Survivable Routing Algorithms for Generalized Diversity Coding.
Alija PasicPéter BabarcziJános TapolcaiErika R. Bérczi-KovácsZoltán KirályLajos RónyaiPublished in: IEEE/ACM Trans. Netw. (2020)
Keyphrases
- minimum cost
- routing algorithm
- wireless sensor networks
- np hard
- ad hoc networks
- shortest path
- approximation algorithms
- multipath
- network flow
- path selection
- network flow problem
- routing protocol
- coding scheme
- qos routing
- spanning tree
- routing problem
- network traffic
- energy consumption
- network design problem
- message overhead
- qos multicast routing
- sensor networks
- transmission range
- transmission delay
- computational complexity
- real time
- end to end
- multi hop
- quality of service
- worst case
- special case