International Journal of Innovative Research in Science, Engineering and Technology (IJIRSET)
Local algorithms determine the status (forwarding/non forwarding) of each node proactively based on local topology information and a globally known priority function. In this paper, the authors first show that local broadcast algorithms based on the static approach cannot achieve a good approximation factor to the optimum solution (an NPhard problem). However, they show that a constant approximation factor is achievable if position information is available. In the dynamic approach, local algorithms determine the status of each node "On-the-fly" based on local topology information and broadcast state information.