Improvised Broadcast Algorithm for Wireless Networks
Ashima Goel, Debasis Das

TL;DR
This paper proposes an improvised broadcast algorithm designed to address the broadcast storm and disconnected network problems in dynamic wireless networks, improving reliability and efficiency.
Contribution
The paper introduces a novel broadcast algorithm specifically tailored for high-mobility, dense wireless networks to mitigate storm and disconnection issues.
Findings
Reduces broadcast storm occurrences
Improves network connectivity in high mobility scenarios
Enhances overall broadcast reliability
Abstract
Broadcasting problem is an important issue in the wireless networks, especially in dynamic wireless networks. In dynamic wireless networks the node density and mobility is high, due to several problems which arise during broadcasting. Two major problems faced are namely, Broadcast Storm Problem and Disconnected network problem. In a highly dense network, if information is being flooded in a loop, it could lead to broadcast storm. The broadcast storm may eventually crash the entire network and lead to loss of information. Mobility of the nodes may lead to the problem of Disconnected Network. If the two nodes sending and receiving information are mobile with different speeds, it could lead to a disconnection between them as soon as the receiver moves out of the communication range. In this paper, we are trying to solve both the problems based on our proposed algorithms.
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.
