Survivability and energy efficiency are two critical issues for broadcast and multicast routing in wireless ad hoc networks. Energy efficient routing has been extensively studied. However, survivability issues have not been well addressed in this field. In this paper, we jointly consider both issues and study energy efficient algorithms for survivable broadcast/multicast routing, which is resilient to single node failure. In particular, we propose the minimax survivable broadcasting/multicasting problems, which seek survivable broadcast/multicast trees in which the maximum node transmit power is minimized; and the minimum survivable broadcasting/multicasting problems, which seek survivable broadcast/multicast trees in which the total node transmit power is minimized. For the minimax problems, we present efficient optimal algorithms. For the minimum problems, we present effective heuristics. Preliminary simulation results are also presented.
展开▼
