A Jamming-Resilient and Scalable Broadcasting Algorithm for Multiple Access Channel Networks
Open Access
- 27 January 2021
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 11 (3), 1156
- https://doi.org/10.3390/app11031156
Abstract
Multiple access channel (MAC) networks use a broadcasting algorithm called the Binary Exponential Backoff (BEB) to mediate access to the shared communication channel by competing nodes and resolve their collisions. While the BEB achieves fair throughput and average packet latency in jamming-free environments and relatively small networks, its performance noticeably degrades when the network is exposed to jamming or its size increases. This paper presents an alternative broadcasting algorithm called the K-tuple Full Withholding (KTFW), which significantly increases MAC networks’ resilience to jamming attacks and network growth. Through simulation, we compare the KTFW with both the BEB and the Queue Backoff (QB), an efficient and high-throughput broadcasting algorithm. We compare the three approaches against two different traffic injection models, each approximating a different environment type. Our results show that the KTFW achieves higher throughput and lower average packet latency against jamming attacks than both the BEB and the QB algorithms. The results also show that the KTFW outperforms the BEB for larger networks with or without jamming.Keywords
This publication has 32 references indexed in Scilit:
- Denial-of-Service attacks and countermeasures in IEEE 802.11 wireless networksComputer Standards & Interfaces, 2009
- Maximum throughput of multiple access channels in adversarial environmentsDistributed Computing, 2009
- Integration of product quality and tool degradation for reliability modelling and analysis of multi-station manufacturing systemsInternational Journal of Computer Integrated Manufacturing, 2009
- Jamming sensor networks: attack and defense strategiesIEEE Network, 2006
- On link layer denial of service in data wireless LANsWireless Communications and Mobile Computing, 2004
- Universal-stability results and performance bounds for greedy contention-resolution protocolsJournal of the ACM, 2001
- Adversarial queuing theoryJournal of the ACM, 2001
- Divergence measures based on the Shannon entropyIEEE Transactions on Information Theory, 1991
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- On Information and SufficiencyThe Annals of Mathematical Statistics, 1951