The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks.
Carla BechelaneAlexandre Salles da CunhaGeraldo Robson MateusPublished in: Electron. Notes Discret. Math. (2009)
Keyphrases
- minimum cost
- wireless sensor networks
- np hard
- approximation algorithms
- spanning tree
- energy efficient
- network flow problem
- sensor networks
- network flow
- capacity constraints
- minimum cost flow
- energy consumption
- network simplex algorithm
- sensor nodes
- routing algorithm
- routing protocol
- undirected graph
- dynamic environments
- scheduling problem
- network design problem
- multi hop
- search algorithm
- knapsack problem
- tree structure
- worst case