Two channel hopping schemes for jamming resistant wireless communication
Samiran Bag, Bimal Kumar Roy · 2013
Jamming resistance is crucial for reliable wireless communication. Most of the existing schemes offering counter-measures of jamming depend on the use of a secret key shared between the communicating devices. This secret key is used to generate a random hopping sequence. The message-sender and the message-receiver hop over different wireless channels depending upon this generated sequence. But such anti-jamming mechanisms fail in broadcast communication scenarios where the number of receivers do not remain the same. There are other strategies like Uncoordinated Frequency Hopping (UFH). But this scheme has a major disadvantage that under this scheme a sender and a receiver need to hop randomly over a number of channels and they can only communicate a message only if they meet over the same channel at any instant. This limitation makes communication under UFH very slow. We propose two schemes for unicast wireless communication in presence of a jammer. Our scheme is applicable to such scenarios where one party sends messages to one recipients through wireless channels. This scheme does not require any secret keys shared between the communicating devices or users. Despite that, the communicating parties can hop over the available wireless channels and thus evading the jammer. We used combinatorial design for designing these channel hopping schemes. These schemes guaranty that in any time slot the sender and the receiver must meet on some channel every time.