Energy-efficient cooperative routing in multi-hop wireless ad hoc networks

• Published in: 2006 IEEE International Performance Computing and Communications Conference pp. 8 pp. - 222
• Main Authors: Li, F., Wu, K., Lippman, A.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2006
• Subjects: Ad hoc networks; Energy efficiency; Intelligent networks; Laboratories; Mobile ad hoc networks; RAKE receivers; Routing; Spread spectrum communication; Transmitting antennas; Wireless networks
• ISBN: 1424401984; 9781424401987
• ISSN: 1097-2641
• DOI: 10.1109/.2006.1629410

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