A Study on the Min-Max Power-Aware Manycast Routing Problem in Static Ad Hoc Networks

Abstract

In manycast transmission, a number of servers provide the same type of services and resources. When a client wants to get services or resources, the manycast routing algorithm will arrange a set of suitable servers to it. In this paper, we will consider the problem of designing a manycast routing algorithm to efficiently arrange manycast transmission requirements such that the power consumption of each node is as even as possible to extend the network’s lifetime. In this paper, we will first show such a problem to be NP-complete. Next, based on Dijkstra’s algorithm, an efficient heuristic algorithm is developed for the difficult problem. Computer simulations verify that the lifetimes of networks generated by our power-balanced manycast routing algorithm are longer than those generated by our another shortest-path-based manycast routing algorithm.