Jamming resistant communication mechanism is essential for reliable wireless communication. In this paper, we propose two channel hopping protocols using combinatorial designs for alleviating jamming attacks. One of these protocols is for unicast communication model find the other is aimed for multicast communication model. To the best of our knowledge, this is the first paper which uses combinatorial designs as a tool to solve the anti-jamming communication problem. Our protocols guarantee that the sender and receiver rendezvous within a finite amount of time to exchange information. In our protocol, each sender and receiver has a secret hopping sequence, instead of pair wise secret codes. Our unicast-communication protocol ensures that no two pairs of nodes collide over a single channel at the same time. Besides, the channels used by node-pairs for communication keep changing after every session making it infeasible for the adversary to anticipate the common channel to be used by a particular pair of nodes. We show these protocols using combinatorial designs performs better than existing anti-jamming protocol.
展开▼
