A Localized Algorithm for the Maximum Lifetime Broadcast Problem with Asymmetric Edge Costs

In this paper we present an algorithm for the Maximum Lifetime Broadcast (MLB) problem, i.e. the problem of extending network lifetime when a series of broadcast operations is executed. The algorithm, called DLMCA, is localized (it uses only 2-hop information) and supports asymmetric edge costs, i.e. those scenarios where the cost of sending a message from a node u to node v might be different from the cost of sending a message from v to u. Addressing asymmetry of edge costs is an important issue, as it arises in different scenarios, such as in heterogeneous networks or when overhearing costs are taken into consideration. According to our experiments, DLMCA outperformed alternative solutions to the problem. As far as we know, DLMCA is the first localized algorithm to the MLB problem with asymmetric edge costs.