Analytical Study of Incremental Approach for Information Dissemination in Wireless Networks
Andrey Belogaev, Evgeny Khorov, Artem Krasilon, Andrey Lyakhov

TL;DR
This paper analyzes incremental and cumulative methods for control information dissemination in wireless networks, demonstrating that incremental updates significantly reduce overhead while maintaining relevance, especially in static or low-mobility dense networks.
Contribution
The paper provides an analytical model and tuning algorithm for incremental dissemination, highlighting its efficiency over cumulative methods in specific network scenarios.
Findings
Incremental updates reduce control information volume.
Incremental approach maintains information relevance.
Best suited for static or low-mobility dense networks.
Abstract
In many scenarios, control information dissemination becomes a bottleneck, which limits the scalability and the performance of wireless networks. Such a problem is especially crucial in mobile ad hoc networks, dense networks, networks of vehicles and drones, sensor networks. In other words, this problem occurs in any scenario with frequent changes in topology or interference level on one side and with strong requirements on delay, reliability, power consumption, or capacity on the other side. If the control information changes partially, it may be worth sending only differential updates instead of messages containing full information to reduce overhead. However, such an approach needs accurate tuning of dissemination parameters, since it is necessary to guarantee information relevance in error-prone wireless networks. In the paper, we provide a deep study of two approaches for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
