TL;DR Summary
Proposes the ISB algorithm, which leverages three-hop neighbor knowledge to reduce redundant rebroadcasts by up to 40% in ad-hoc wireless networks while maintaining high delivery coverage.
Research & Analysis
Improved Self-Pruning for Broadcasting in Ad Hoc Wireless Networks
Proposes the ISB (Improved Self-Pruning Based Broadcasting) algorithm — a reactive broadcasting technique that uses extended three-hop neighbour knowledge to dramatically reduce the number of forwarding nodes while keeping packet headers minimal.
✍ MD. Nazmus Sakib 📅 February 2017
Wireless Sensor NetworksBroadcasting AlgorithmsAd Hoc NetworksSelf-PruningISB AlgorithmNetwork Simulation
Abstract
Proposes the ISB (Improved Self-Pruning Based Broadcasting) algorithm — a reactive broadcasting technique that uses extended three-hop neighbour knowledge to dramatically reduce the number of forwarding nodes while keeping packet headers minimal. Simulation results show ISB outperforms both self-pruning and dominant pruning across all tested network densities.
Key Result
ISB reduced redundant rebroadcasts by up to 40% compared to classic self-pruning, while maintaining near-100% delivery coverage — demonstrating that three-hop knowledge is sufficient for near-optimal broadcast coverage in ad-hoc networks.