A novel minimum set cover routing plane construction approach for random wireless IP access networks.
Benyamin AbrishamchiMohammad Hassan FarhoudiAndrej MihailovicA. Hamid AghvamiPublished in: WCNC (2018)
Keyphrases
- set cover
- switched networks
- greedy algorithm
- approximation algorithms
- np hard
- mobile ad hoc networks
- greedy heuristics
- mobility management
- network flow
- wireless networks
- network layer
- minimum cost
- solution space
- greedy heuristic
- internet protocol
- wireless communication
- routing protocol
- multi hop
- wireless access networks
- ad hoc networks
- convex hull
- packet forwarding
- ip addresses
- mobile devices
- mobile users
- routing algorithm
- primal dual
- mobile networks
- cost function
- learning algorithm