No abstract

Abstract-Wireless ad hoc networks are usually composed of autonomous nodes, which are powered by batteries only. The energy-efficiency is perhaps one of the most important factors for each operation in terms of networks. Broadcast, for example, is one of the fundamental operations in modern telecom networks. In this paper a broadcast tree, which is rooted at a source and spans all the destination nodes, has been constructed in a way that the total transmission energy consumption is minimized. This paper describes two polynomialtime heuristics for the energy-efficient broadcasting in static ad hoc wireless networks. Both of the developed approaches are on the basis of a fuzzy greedy evaluation function, which prioritize the network nodes. According to the prioritized order of the nodes, each new node is selected for incorporation in the construction of a solution. Computational experiments indicate that our algorithms improve the well-known Broadcast Link-based Minimum Spanning Tree (BLiMST) and Broadcast Least-Unicast-cost (BLU) heuristics. It will be seen that the BLiMST and the BLU methods are a special case of our more general heuristics.

In the originally published version the indexes of some variables in Section 4.1, including Constraints (4) and (5) of the model, include a wrong offset of one position. Some errors occurred in notations of variable indexes in Constraints (4) and (5) conditions of the model in Section 4.1, together with some ambiguities that may lead to misunderstanding for the reader. This was corrected in the updated version.The updated version of this chapter can be found at https://doi.