Bimodal flooding scheme for mitigating contention and redundancy in relayed broadcast

Kim, Youngboo; Park, Kyung‐Joon

doi:10.1109/ictc.2017.8190762

Cited by 2 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to [10], its optimal value becomes a lower value when the topology is denser. We also verified that its performance was the best in most simulations when the threshold was 2).: As proposed in our previous work [11], this mechanism sets the transmission probability as inversely proportional to the number of adjacent nodes (i.e., 1/Ni). If a duplicate transmission is suppressed, this mechanism defers the transmission of the frame instead of dropping it to improve the reliability of flooding.: In this mechanism, each node rebroadcasts the received frames with three differentiated probabilities depending on the distance from the sender.…”

Section: Simulation Studysupporting

confidence: 66%

“…Simulation results showed that the proposed mechanism successfully delivered the data frame of a source node approximately 99% to all of the nodes and it significantly decreased the traffic dissemination time by up to 6-fold compared to the conventional flooding mechanism focusing on the transmission reliability. The notion of the duplication ratio was first proposed in our previous study [11]. In the present work, we significantly extend our previous study by investigating the characteristics of the duplication ratio in detail and using it in the re-queuing scheme, which was not considered in our previous work.…”

Section: Introductionmentioning

confidence: 69%

“…Subsequently, if a frame can be delivered to more adjacent nodes, it is preferentially transmitted. Similarly, the mechanism proposed in our previous work [11] sets the rebroadcast probability as inversely proportional to the number of adjacent nodes but unlike the conventional PBF, it does not drop the duplicate frame but defers the transmission to improve the reliability of flooding.…”

Section: Statement Of the Problemmentioning

confidence: 99%

“…: As proposed in our previous work [11], this mechanism sets the transmission probability as inversely proportional to the number of adjacent nodes (i.e., 1/Ni). If a duplicate transmission is suppressed, this mechanism defers the transmission of the frame instead of dropping it to improve the reliability of flooding.…”

Section: Simulation Studymentioning

confidence: 99%

See 3 more Smart Citations

An Efficient Relayed Broadcasting Based on the Duplication Estimation Model for IoT Applications

Kim

Park

2019

Sensors

Self Cite

View full text Add to dashboard Cite

In this paper, we consider relay-based broadcasting in wireless ad hoc networks, which can enable various emerging services in the Internet of Things (IoT). In this kind of traffic dissemination scheme, also known as flooding, all the nodes not only receive frames but also rebroadcast them. However, without an appropriate relay suppression, a broadcast storm problem arises, i.e., the transmission may fail due to severe collisions and/or interference, many duplicate frames are unnecessarily transmitted, and the traffic dissemination time increases. To mitigate the broadcast storm problem, we propose a reasonable criterion to restrict the rebroadcasting named the duplication ratio. Based on this, we propose an efficient mechanism consisting of duplication suppression and re-queuing schemes. The former discards duplicate frames proactively in a probabilistic manner to decrease the redundancy whereas the latter provides a secondary transmission opportunity reactively to compensate for the delivery failure. Moreover, to apply the duplication ratio practically, we propose a simple method to approximate it based on the number of adjacent nodes. The simulation study confirms that the proposed mechanism tightly ensured the reliability and decreased the traffic dissemination time by up to 6-fold compared to conventional mechanisms.

show abstract