Dynamic Adaptive Anti-Jamming via Controlled Mobility

He, Xiaofan; Dai, Huaiyu; Ning, Peng

doi:10.1109/twc.2014.2320973

Cited by 28 publications

(19 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, according to prior results on spectral graph theory [18], the max-flow of an undirected graph can be properly approximated by the so-called weighted Cheeger's constant. However, the graph G d in the considered problem is a directed one.…”

Section: The Proposed Schemementioning

confidence: 99%

“…By exploiting the underlying structure of the network topology, it is shown that the max-flow in this directed graph is equivalent to that of its undirected counterpart. Based on prior results from spectral graph theory [15]- [18], a direct consequence of this key finding is that the network throughput can be well approximated by the second smallest eigenvalue of the network Laplacian matrix, whose gradient can be readily computed. This in turn allows us to effectively increase the network eigenvalue (and thus approximately the throughput) by adjusting the IRS phase-shifts as well as the power and bandwidth allocation via the generic gradient descent method.…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Spectral Graph Theory Based Resource Allocation for IRS-Assisted Multi-Hop Edge Computing

Zhang

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

The performance of mobile edge computing (MEC) depends critically on the quality of the wireless channels. From this viewpoint, the recently advocated intelligent reflecting surface (IRS) technique that can proactively reconfigure wireless channels is anticipated to bring unprecedented performance gain to MEC. In this paper, the problem of network throughput optimization of an IRS-assisted multi-hop MEC network is investigated, in which the phase-shifts of the IRS and the resource allocation of the relays need to be jointly optimized. However, due to the coupling among the transmission links of different hops caused by the utilization of the IRS and the complicated multi-hop network topology, it is difficult to solve the considered problem by directly applying existing optimization techniques. Fortunately, by exploiting the underlying structure of the network topology and spectral graph theory, it is shown that the network throughput can be well approximated by the second smallest eigenvalue of the network Laplacian matrix. This key finding allows us to develop an effective iterative algorithm for solving the considered problem. Numerical simulations are performed to corroborate the effectiveness of the proposed scheme.

show abstract

Section: The Proposed Schemementioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

Spectral Graph Theory Based Resource Allocation for IRS-Assisted Multi-Hop Edge Computing

Zhang

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Using game theory, they modeled strategies to assign random access to MAC layers. He et al considered the single and multicommodity flow problems in the presence of mobile relays and single intelligent jammer. Considering that the other nodes, including the source and the destination nodes, are static, they tried to maximize the network flow, using spectral graph theory.…”

Section: Related Workmentioning

confidence: 99%

Topology control in the presence of jammers for wireless sensor networks

Bhavathankar

Mondal

Misra

2017

Int J Communication

View full text Add to dashboard Cite

In this paper, the problem of ensuring packet delivery ratio and high network lifetime in wireless sensor networks in the presence of single or multiple jammers is studied using single-leader-multiple-followers Stackelberg game theory. A topology control scheme is proposed, in which the sink node, which acts as the leader, identifies the set of jamming affected nodes. On the other hand, the sensor nodes, which act as followers, need to decide an optimum transmission power level, while ensuring an optimal set of neighbor nodes covered. A scheme, named TC-JAM, for ensuring packet delivery ratio, while avoiding jammers and increasing network lifetime in wireless sensor networks, is proposed. In existing literatures, the sensor nodes are envisioned to be equipped with multiple interfaces, while having access for multiple channels. However, in TC-JAM, the sensor nodes have simple hardware with single interface for communication, ie, the sensor nodes have single channel for communication. Additionally, in the proposed scheme, TC-JAM, each sensor node has a provision to vary its transmission power according to the chosen strategies. Using TC-JAM, the energy consumption of the overall network reduces by up to 62%, and the network lifetime increases by 56% to 73%. KEYWORDSDynamic transmission power level model, jammer, network lifetime, stackelberg game, topology control, wireless sensor network 1 Int J Commun Syst. 2017;30:e3289.wileyonlinelibrary.com/journal/dac

show abstract

“…Multipath routing provides a way to circumvent the jammer [26] [27]. Even the mobility of the nodes can in certain scenarios be exploited to avoid jamming [28].…”

Section: Introductionmentioning

confidence: 99%

United Against the Enemy: Anti-Jamming Based on Cross-Layer Cooperation in Wireless Networks

Zhang

Guan

Melodia

2016

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Denial-of-service (DoS) attacks launched by malicious jammers can pose significant threats to infrastructureless wireless networks without a centralized controller. While significant recent research efforts have dealt with such attacks and several possible countermeasures have been proposed, little attention has been paid to the idea of cooperative anti-jamming.Inspired by this observation, this paper proposes and studies a cooperative anti-jamming scheme designed to enhance the quality of links degraded by jammers. To achieve this objective, users are allowed to cooperate at two levels. First, they cooperate to optimally regulate their channel access probabilities so that jammed users gain a higher share of channel utilization. Second, users leverage multiple-input single-output cooperative communication techniques to enhance the throughput of jammed links. The problem of optimal cooperative anti-jamming is formulated as a distributed pricing-based optimization problem, and a best response algorithm is proposed to solve it in a distributed way. Simulations demonstrate that the proposed algorithm achieves considerable gains (compared to traditional non-cooperative antijamming) especially under heavy traffic or high jamming power. Furthermore, the proposed distributed algorithm is shown to achieve close-to-global optimality with moderate traffic load.

show abstract

Dynamic Adaptive Anti-Jamming via Controlled Mobility

Cited by 28 publications

References 33 publications

Spectral Graph Theory Based Resource Allocation for IRS-Assisted Multi-Hop Edge Computing

Spectral Graph Theory Based Resource Allocation for IRS-Assisted Multi-Hop Edge Computing

Topology control in the presence of jammers for wireless sensor networks

United Against the Enemy: Anti-Jamming Based on Cross-Layer Cooperation in Wireless Networks

Contact Info

Product

Resources

About