TY - GEN
T1 - Bimodal flooding scheme for mitigating contention and redundancy in relayed broadcast
AU - Kim, Youngboo
AU - Park, Eun Chan
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/12/12
Y1 - 2017/12/12
N2 - This paper considers a relayed broadcast in IEEE 802.11 wireless local area (WLAN) networks. In the relayed broadcast, a source node intends to deliver data frames to many nodes beyond its coverage and all the nodes except the source node attempt to relay the received data frames in a contention-based and distributed manner. This traffic dissemination scheme, referred to as flooding, has several problems. As the number of nodes increases, the contention for channel access becomes intensified, resulting in a severe problem of collision and interference, and at the same time, many duplicate frames are unnecessarily transmitted. In order to mitigate contention and redundancy in the relayed broadcast, this paper proposes a bimodal flooding scheme combining two approaches. The first approach aims to relieve contention by deferring the transmission of data frames based on the number of neighbor nodes. Meanwhile, to suppress redundant transmission of data frames, the second approach introduces a novel index of duplication ratio, with which data frames are discarded probabilistically. In this way, the former contributes to the reliable transmission of broadcasting traffic and the latter is effective to decrease its dissemination time. Via simulation study, the performance of several flooding schemes are compared and analyzed in diverse aspects.
AB - This paper considers a relayed broadcast in IEEE 802.11 wireless local area (WLAN) networks. In the relayed broadcast, a source node intends to deliver data frames to many nodes beyond its coverage and all the nodes except the source node attempt to relay the received data frames in a contention-based and distributed manner. This traffic dissemination scheme, referred to as flooding, has several problems. As the number of nodes increases, the contention for channel access becomes intensified, resulting in a severe problem of collision and interference, and at the same time, many duplicate frames are unnecessarily transmitted. In order to mitigate contention and redundancy in the relayed broadcast, this paper proposes a bimodal flooding scheme combining two approaches. The first approach aims to relieve contention by deferring the transmission of data frames based on the number of neighbor nodes. Meanwhile, to suppress redundant transmission of data frames, the second approach introduces a novel index of duplication ratio, with which data frames are discarded probabilistically. In this way, the former contributes to the reliable transmission of broadcasting traffic and the latter is effective to decrease its dissemination time. Via simulation study, the performance of several flooding schemes are compared and analyzed in diverse aspects.
KW - broadcast
KW - flooding
KW - IEEE 802.11
KW - redundancy
KW - relay
KW - reliability
UR - http://www.scopus.com/inward/record.url?scp=85046908025&partnerID=8YFLogxK
U2 - 10.1109/ICTC.2017.8190762
DO - 10.1109/ICTC.2017.8190762
M3 - Conference contribution
AN - SCOPUS:85046908025
T3 - International Conference on Information and Communication Technology Convergence: ICT Convergence Technologies Leading the Fourth Industrial Revolution, ICTC 2017
SP - 714
EP - 719
BT - International Conference on Information and Communication Technology Convergence
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th International Conference on Information and Communication Technology Convergence, ICTC 2017
Y2 - 18 October 2017 through 20 October 2017
ER -