Analysis and optimization on jamming-resistant collaborative broadcast in large-scale networks

Uncoordinated Frequency Hopping (UFH) is a viable anti-jamming solution without dependency on pre-shared secret keys, which nonetheless suffers from low communication efficiency. The Collaborative UFH (CUFH) scheme proposed recently in dramatically improves both communication efficiency and jamming resistance of UFH with the help of relays. In this paper we study CUFH in a large scale broadcast network, with the number of nodes (much) larger than that of channels. In particular the optimal number of relays is derived and the trade-off on the number of packets a message is divided into is investigated, with respect to the network broadcast delay. In addition both upper and lower bounds of the average network broadcast delay are evaluated. Our analytical results are substantiated by simulations.