Decentralized Random Access Of Frequency-Hopping Channel

Abstract

A decentralized transmission policy that rejects a blocked packet that has been retransmitted a number of times is analyzed for the frequency-hopping channel. For stability considerations and for channel throughput increase the information packet is encoded by a ReedSolomon code. The region of code rate and number of transmission attempts pairs that guarantees the network stability is investigated.