Efficient Broadcasting in Wireless Adhoc Network

Abstract

Broadcasting is a commonly used feature in wireless ad hoc networks. It is a common operation for route establishment and for sending control and emergency messages. The primary goal of broadcasting is to successfully reduce the number of transmissions that are required to achieve full delivery with energy consumption using local broadcast algorithm. In static approach, using the local topology information, the local algorithm determines the status of each node and also the priority function. Using this approach it is not possible to achieve the good approximation factor to the optimum solution. The hybrid local broadcast algorithm based on dynamic approach is proposed for guarantee with full delivery and successful approximation to the optimum solution without considering the node position. 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. The position information is the solution for getting good approximation factor. But in some applications it may not be possible to get position information because of the sheer nature of ad hoc networks that allow mobility cause dynamic, unpredicted and frequent topology changes. In those situations also the proposed local broadcast algorithm can achieve both full delivery and a constant approximation to the optimum solution in which the status of each node is decided “on-the-fly” (i.e. reactive protocol).