Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation

We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route selection and the transmit diversity was recently presented in A. Khandani et al. (2003). Several heuristic algorithms were also proposed in A. Khandani et al. (2003) to approximate the minimum energy cooperative path, while it has not been possible to judge the quality of the solutions with respect to the optimal. In this paper, we present an integer programming formulation of the MECP problem towards an optimal solution for a network where the locations of the nodes are known a priori and fixed