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. If the position information is available, the constant approximation factor is got. But in dynamic approach the position of the node is determined “on-the-fly” based on local topology information. So, it is possible to get the good approximation factor to the optimum solution in dynamic approach of local broadcast algorithm. The position information is the solution for getting good approximation factor. But in some applications it may not be possible to get position information. Therefore, it is need to know whether local broadcast algorithms can achieve a constant approximation factor without using position information based on dynamic approach. To simplifying this problem, a local broadcast is designed in which the status of each node is decided “on-the-fly” (i.e. reactive protocol) and proves that the algorithm can achieve both full delivery and a constant approximation to the optimum solution.