2006 IEEE International Performance Computing and Communications Conference (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/.2006.1629410
F. Li , Media Lab., MIT, Cambridge, MA, USA
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the minimum energy cooperative path (MECP) routing problem, i.e., using cooperative radio transmission to find the best route with the minimum energy cost from a source node to a destination node, is NP-complete. We thus propose a cooperative shortest path (CSP) algorithm that uses the Dijkstra's algorithm as the basic building block and reflects the cooperative transmission properties in the relaxation procedure. Simulation results show that with more nodes added in the network, our approach achieves more energy saving compared to traditional non-cooperative shortest path algorithms. Another interesting observation is that the proposed algorithm achieves better fairness among different nodes with denser networks. Implementation issues are also discussed.
Dijkstra algorithm, energy-efficient cooperative routing, multihop wireless ad hoc network, minimum energy cooperative path, MECP, NP-complete problem, cooperative shortest path, CSP
A. Lippman, K. Wu and F. Li, "Energy-efficient cooperative routing in multi-hop wireless ad hoc networks," 2006 IEEE International Performance Computing and Communications Conference(PCC), Phoenix, AZ, USA, 2006, pp. 32.