TY - GEN
T1 - Performance analysis of relayed-broadcasting with probabilistic flooding in WLANs
AU - Kim, Young Boo
AU - Park, Eun Chan
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/9
Y1 - 2016/8/9
N2 - In this paper, we consider a relayed-broadcasting mechanism in IEEE 802.11 wireless local area networks (WLANs), to broadcast data traffic beyond the coverage of a source node. For this purpose, we adopt a probabilistic flooding scheme with which each intermediate node rebroadcasts received frames in a probabilistic manner to restrict unnecessary broadcasting of duplicate frames, as well as to decrease frequent collisions or interference due to simultaneous transmissions. In the relayed-broadcasting, there occurs a fundamental and inevitable tradeoff between reliable broadcasting and fast dissemination. To deal with this tradeoff, we consider two schemes of probabilistic flooding, named as relay-oriented flooding and reception-oriented flooding. The former is devised to improve the reliability of broadcasting, while the latter is devised to decrease the dissemination time. Via a simple analysis and extensive simulations, we compare the performance of these two schemes of probabilistic flooding in various aspects. The simulation results reveal interesting results and drawbacks of probabilistic flooding, which can be a basis for developing an effective relayed-broadcasting mechanism as our future work.
AB - In this paper, we consider a relayed-broadcasting mechanism in IEEE 802.11 wireless local area networks (WLANs), to broadcast data traffic beyond the coverage of a source node. For this purpose, we adopt a probabilistic flooding scheme with which each intermediate node rebroadcasts received frames in a probabilistic manner to restrict unnecessary broadcasting of duplicate frames, as well as to decrease frequent collisions or interference due to simultaneous transmissions. In the relayed-broadcasting, there occurs a fundamental and inevitable tradeoff between reliable broadcasting and fast dissemination. To deal with this tradeoff, we consider two schemes of probabilistic flooding, named as relay-oriented flooding and reception-oriented flooding. The former is devised to improve the reliability of broadcasting, while the latter is devised to decrease the dissemination time. Via a simple analysis and extensive simulations, we compare the performance of these two schemes of probabilistic flooding in various aspects. The simulation results reveal interesting results and drawbacks of probabilistic flooding, which can be a basis for developing an effective relayed-broadcasting mechanism as our future work.
UR - http://www.scopus.com/inward/record.url?scp=84983268231&partnerID=8YFLogxK
U2 - 10.1109/ICUFN.2016.7537013
DO - 10.1109/ICUFN.2016.7537013
M3 - Conference contribution
AN - SCOPUS:84983268231
T3 - International Conference on Ubiquitous and Future Networks, ICUFN
SP - 181
EP - 186
BT - ICUFN 2016 - 8th International Conference on Ubiquitous and Future Networks
PB - IEEE Computer Society
T2 - 8th International Conference on Ubiquitous and Future Networks, ICUFN 2016
Y2 - 5 July 2016 through 8 July 2016
ER -