A Hybrid Approach Based Broadcast Algorithm In Wireless ADHOC Networks
To broadcast algorithms in wireless ad hoc networks, static and dynamic are two approaches. In the static
approach, local algorithms determine the status of each node “up to date” based on local topology information and a priority
function. In this paper, firstly show that local broadcast algorithms based on the static approach cannot achieve a good
approximation factor to the optimum solution. Then the proposed algorithm shows that a constant approximation factor is
achievable if position information is available. In the dynamic approach, local algorithms determinethe status of each node
“on-the-fly” based on local topology information and broadcast state information. It was recently shown that local broadcast
algorithms can achieve a constant approximation factor to the optimum solution when position information is available.
Using position information can simplify the problem. Therefore, we wish to know whether local broadcast algorithms based
on the dynamic approach can achieve a constant approximation factor without using position information.