IEEE/ICACT20260340 Slide.16        [Big Slide]       [YouTube] Oral Presentation
Despite the best selection, routing voids can occur where no neighbor meets the criteria. Instead of costly recovery modes, our fourth mechanism uses simple packet buffering. The node stores the packet and waits. Crucially, while waiting, it gradually relaxes its angular constraints—the thresholds alpha and beta increase over time. This expands the forwarding zone, making it more likely that a passing node will qualify. The node re-runs the selection algorithm periodically or when new beacons arrive, forwarding the packet once a suitable neighbor is found.

[Go to Next Slide]
Select Voice: