A Two-Phase Constructive Heuristic for Minimum Energy Broadcasting in Wireless Ad Hoc Networks
Nastaran Rahmani, Kaveh Sheibani · International Journal of Computer Network and Information Security · 2010
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.