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 polynomial-time 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Network and Information Security
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
