Towards Optimal Adaptive UFH-Based Anti-Jamming Wireless Communication

Wang, Qian; Xu, Ping; Ren, Kui; Li, Xiangyang

doi:10.1109/jsac.2012.120103

Cited by 63 publications

(35 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For rest of the results, when PER is considered as the cost function (evaluated using ACK/NACK), then the jammer only needs to be synchronous with the victim on a per-packet basis. Similar assumptions have been made in the past [20]- [26]. However, if the jammer is not synchronized, then the jamming performance is degraded as discussed in [13].…”

Section: A Note On the Assumptionsmentioning

confidence: 71%

“…Although MAB algorithms have been used in the context of wireless communications to address the selection of a wireless channel in either cognitive radio networks [23]- [25] or in the presence of an adversary [26], or antenna selection in MIMO systems [27], these works only consider learning over a finite action set. In contrast, the proposed jamming algorithms in this paper enable the jammer to learn the optimal attack strategies against both static and adaptive victim transmitterreceiver pairs by simultaneously choosing actions from both finite and infinite arm sets (i.e., they can either come from a continuous or a discrete space), that are defined based on the physical layer parameters of the jamming signal.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Jamming Bandits—A Novel Learning Method for Optimal Jamming

Amuru

Tekin

Schaar

et al. 2016

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-Can an intelligent jammer learn and adapt to unknown environments in an electronic warfare-type scenario? In this paper, we answer this question in the positive, by developing a cognitive jammer that adaptively and optimally disrupts the communication between a victim transmitter-receiver pair. We formalize the problem using a multiarmed bandit framework where the jammer can choose various physical layer parameters such as the signaling scheme, power level and the on-off/pulsing duration in an attempt to obtain power efficient jamming strategies. We first present online learning algorithms to maximize the jamming efficacy against static transmitter-receiver pairs and prove that these algorithms converge to the optimal (in terms of the error rate inflicted at the victim and the energy used) jamming strategy. Even more importantly, we prove that the rate of convergence to the optimal jamming strategy is sublinear, i.e., the learning is fast in comparison to existing reinforcement learning algorithms, which is particularly important in dynamically changing wireless environments. Also, we characterize the performance of the proposed bandit-based learning algorithm against multiple static and adaptive transmitter-receiver pairs.

show abstract

Section: A Note On the Assumptionsmentioning

confidence: 71%

Section: Introductionmentioning

confidence: 99%

Jamming Bandits—A Novel Learning Method for Optimal Jamming

Amuru

Tekin

Schaar

et al. 2016

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…The decoding process in our protocol is online, i. e., the decoding can start as soon as fragments are arriving. Wang et al [20] model UFH transmissions as a multi-armed bandit problem. Since they assume the same verification schemes as proposed by Strasser et al [18,19], this scheme is vulnerable to reactive jamming due to long packets.…”

Section: Related Workmentioning

confidence: 99%

Enabling Short Fragments for Uncoordinated Spread Spectrum Communication

Ahmed

Pöpper

Čapkun

2014

Computer Security - ESORICS 2014

View full text Add to dashboard Cite

Abstract. Uncoordinated spread spectrum (USS) protocols have been proposed for anti-jamming communication in wireless settings without shared secrets. The existing USS protocols assume that fragments of hundreds of bits can be transmitted on different channels in order to identify fragments that belong to the same message. However, such long transmissions are susceptible to reactive jamming. To address this problem, we present a protocol that allows the use of short fragments of a few bits only. This makes our scheme resilient to a large class of reactive jammers. We prove that reassembling the fragmented message is not only feasible but also efficient: it can be completed in polynomial time in the size of the message, even if the jammer is computationally resourceful. We demonstrate the protocol efficiency by simulating the reassembly process at the link layer under different design parameters.

show abstract

“…There are a few recent attempts such as [4]- [13] to break the circular dependency between anti-jamming communications and spread-code establishment. The unique features of MANET neighbor discovery, however, make these elegant solutions unsuitable.…”

Section: Introductionmentioning

confidence: 99%

“…In particular, since node encounters are unpredictable in MANETs, each node must be always prepared to accept and validate potential neighbor discovery requests. The existing solutions [4]- [13] all depend on some publicly known communication strategies such as public spread-code sets. The adversary can thus use such public knowledge to inject arbitrary many neighbor discovery requests in the whole network, leading to a special Denial-of-Service (DoS) attack in which all nodes are forced to perform endless verifications of neighbor discovery requests (which often involve expensive digital signature verifications).…”

Section: Introductionmentioning

confidence: 99%

Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks

Zhang

Sun

Zhang

et al. 2015

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Secure neighbor discovery is fundamental to mobile ad hoc networks (MANETs) deployed in hostile environments and refers to the process in which two neighboring nodes exchange messages to discover and authenticate each other. It is vulnerable to the jamming attack in which the adversary intentionally transmits radio signals to prevent neighboring nodes from exchanging messages. Anti-jamming communications often rely on spread-spectrum techniques which depend on a spreading code common to the communicating parties but unknown to the jammer. The spread code is, however, impossible to establish before the communicating parties successfully discover each other. While several elegant approaches have been recently proposed to break this circular dependency, the unique features of neighbor discovery in MANETs make them not directly applicable. In this paper, we propose JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on Direct Sequence Spread Spectrum and random spread-code pre-distribution. JR-SND enables neighboring nodes to securely discover each other with overwhelming probability despite the presence of omnipresent jammers. Detailed theoretical and simulation results confirm the efficacy and efficiency of JR-SND.

show abstract

Towards Optimal Adaptive UFH-Based Anti-Jamming Wireless Communication

Cited by 63 publications

References 18 publications

Jamming Bandits—A Novel Learning Method for Optimal Jamming

Jamming Bandits—A Novel Learning Method for Optimal Jamming

Enabling Short Fragments for Uncoordinated Spread Spectrum Communication

Jamming-Resilient Secure Neighbor Discovery in Mobile Ad Hoc Networks

Contact Info

Product

Resources

About