Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms

@article{Li2008MinimumEC,
  title={Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms},
  author={Fulu Li and Kui Wu and Andrew Lippman},
  journal={Journal of Communications and Networks},
  year={2008},
  volume={10},
  pages={204-212}
}
We study the routing problem in all-wireless networks based on cooperative transmissions. We model the minimum-energy cooperative path (MECP) problem and prove that this problem is NP-complete. We hence design an approximation algorithm called cooperative shortest path (CSP) algorithm that uses Dijkstra's algorithm as the basic building block and utilizes cooperative transmissions in the relaxation procedure. Compared with traditional non-cooperative shortest path algorithms, the CSP algorithm… CONTINUE READING