A Jamming-Resilient and Scalable Broadcasting Algorithm for Multiple Access Channel Networks

Multiple access channel (MAC) networks use a broadcasting algorithm called the Binary Exponential Backoff (BEB) to mediate shared communication by competing nodes and resolve their collisions. While BEB achieves fair throughput average packet latency in jamming-free environments relatively small networks, its performance noticeably degrades when network is exposed jamming or size increases. This paper presents an alternative K-tuple Full Withholding (KTFW), which significantly increases MAC networks’ resilience attacks growth. Through simulation, we compare KTFW with both Queue (QB), efficient high-throughput algorithm. We three approaches against two different traffic injection models, each approximating environment type. Our results show that higher lower than QB algorithms. The also outperforms for larger without jamming.