Efficient Local Broadcast Algorithms in Wireless Ad Hoc Networks Using Static and Dynamic Approaches
One of the fundamental operations in wireless ad hoc networks is broadcasting. To successfully reducing the number of transmissions of broadcast that are required to achieve full delivery with energy consumption using local broadcast algorithm. This broadcast algorithm is proposed for guarantee with full delivery and successful approximation to the optimum solution without considering the node position. There are two main approaches, static and dynamic, to broadcast algorithms in wireless ad hoc networks. Using the local topology information, the local algorithm determines the status of each node and also the priority function. In this paper the static approach in local broadcast algorithm is explained first. Using this approach it is not possible to achieve the good approximation factor to the optimum solution.