IEEE/ICACT20260340 Slide.12        [Big Slide]       [YouTube] Oral Presentation
This concept is illustrated here. A source node moves and broadcasts an update. Its neighbors, N1, N2, N3, calculate their F will and F demand. N1 and N2, whose own neighbors—like those at angles theta1, theta2, theta3—are highly affected by the move, compute a high F demand. Even with moderate willingness, they decide to forward. N3, whose neighbors—like at theta4—are largely unaffected, has low demand and decides to drop the packet. This selective process efficiently propagates information to areas where it matters most.

[Go to Next Slide]
Select Voice: