Reducing Number of Nodes Transmissions in Wireless Adhoc Networks
Amit Kumar, Sri Shakthi · 2012
There are two main techniques, static and dynamic, to broadcast algorithms in wireless ad hoc networks. In the static technique, local algorithms determine the status of each node proactively based on local topology information. we show that a constant approximation factor is achievable if position information is available. In the dynamic technique, local algorithms determine the status of each node “on-the-fly” based on local topology information. Constant approximation factor compute minimum spanning tree of H and add the disks corresponding to its edges to D. The status of each node is determined “onthe-fly” during broadcast progress. “on-the-fly” improve the status of wireless links. The proposed algorithm based on dynamic approach can be extended to the case where nodes have different transmission ranges. Then by varying the number of nodes, speed and traffics patterns the performance comparison is done.