scholarly journals Bi-Layer Shortest-Path Network Interdiction Game for Internet of Things

Sensors ◽  
2020 ◽  
Vol 20 (20) ◽  
pp. 5943
Author(s):  
Jingwen Yan ◽  
Kaiming Xiao ◽  
Cheng Zhu ◽  
Jun Wu ◽  
Guoli Yang ◽  
...  
Keyword(s):  
Internet Of Things ◽  
Shortest Path ◽  
Benders Decomposition ◽  
Random Search ◽  
Single Layer ◽  
Economic Loss ◽  
Physical Layer ◽  
Network Interdiction ◽  
Objective Functions ◽  
Target Node

Network security is a crucial challenge facing Internet-of-Things (IoT) systems worldwide, which leads to serious safety alarms and great economic loss. This paper studies the problem of malicious interdicting network exploitation of IoT systems that are modeled as a bi-layer logical–physical network. In this problem, a virtual attack takes place at the logical layer (the layer of Things), while the physical layer (the layer of Internet) provides concrete support for the attack. In the interdiction problem, the attacker attempts to access a target node on the logical layer with minimal communication cost, but the defender can strategically interdict some key edges on the physical layer given a certain budget of interdiction resources. This setting generalizes the classic single-layer shortest-path network interdiction problem, but brings in nonlinear objective functions, which are notoriously challenging to optimize. We reformulate the model and apply Benders decomposition process to solve this problem. A layer-mapping module is introduced to improve the decomposition algorithm and a random-search process is proposed to accelerate the convergence. Extensive numerical experiments demonstrate the computational efficiency of our methods.

scholarly journals A Decomposition Approach for Stochastic Shortest-Path Network Interdiction with Goal Threshold

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 237 ◽  
Author(s):  
Xiangyu Wei ◽  
Kai Xu ◽  
Peng Jiao ◽  
Quanjun Yin ◽  
Yabing Zha
Keyword(s):  
Shortest Path ◽  
Real World ◽  
Benders Decomposition ◽  
Research Problem ◽  
Resource Consumption ◽  
Network Interdiction ◽  
Master Problem ◽  
Decomposition Approach ◽  
Stochastic Shortest Path ◽  
T Path

Shortest-path network interdiction, where a defender strategically allocates interdiction resource on the arcs or nodes in a network and an attacker traverses the capacitated network along a shortest s-t path from a source to a terminus, is an important research problem with potential real-world impact. In this paper, based on game-theoretic methodologies, we consider a novel stochastic extension of the shortest-path network interdiction problem with goal threshold, abbreviated as SSPIT. The attacker attempts to minimize the length of the shortest path, while the defender attempts to force it to exceed a specific threshold with the least resource consumption. In our model, threshold constraint is introduced as a trade-off between utility maximization and resource consumption, and stochastic cases with some known probability p of successful interdiction are considered. Existing algorithms do not perform well when dealing with threshold and stochastic constraints. To address the NP-hard problem, SSPIT-D, a decomposition approach based on Benders decomposition, was adopted. To optimize the master problem and subproblem iteration, an efficient dual subgraph interdiction algorithm SSPIT-S and a local research based better-response algorithm SSPIT-DL were designed, adding to the SSPIT-D. Numerical experiments on networks of different sizes and attributes were used to illustrate and validate the decomposition approach. The results showed that the dual subgraph and better-response procedure can significantly improve the efficiency and scalability of the decomposition algorithm. In addition, the improved enhancement algorithms are less sensitive and robust to parameters. Furthermore, the application in a real-world road network demonstrates the scalability of our decomposition approach.

Beyond Crypto: Physical-Layer Security for Internet of Things Devices

2020 ◽  
Vol 12 (4) ◽  
pp. 66-78
Author(s):  
Rabia Tugce Yazicigil ◽  
Phillip M. Nadeau ◽  
Daniel D. Richman ◽  
Chiraag Juvekar ◽  
Saurav Maji ◽  
...  
Keyword(s):  
Internet Of Things ◽  
Physical Layer Security ◽  
Physical Layer

Grid patterns optimization for single-layer latticed domes

2020 ◽  
pp. 136943322095681
Author(s):  
Masaki Teranishi ◽  
Koichiro Ishikawa
Keyword(s):  
Mechanical Properties ◽  
Single Layer ◽  
Objective Functions ◽  
Imperfection Sensitivity ◽  
Grid Pattern ◽  
Geometric Imperfection ◽  
Design Variables ◽  
Geometrical Constraints ◽  
Nodal Coordinates ◽  
Superior Mechanical Properties

In previous studies on optimized single-layer latticed domes, the inner space and external shape of the optimized dome is different from those of the initial dome. This difference may result in loss of structural functionality and aesthetics intended by the designers, making it difficult to separately evaluate the mechanical properties of the grid patterns and shape of the surface. In this study, 64 types of single-layer latticed domes having different geometric properties are optimized to obtain mechanically effective grid patterns. Six types of objective functions are employed. The nodal coordinates of the domes serve as the design variables under geometrical constraints, where the nodes of the domes can be shifted on the surface area. The geometric and mechanical properties of the optimized grid patterns are evaluated quantitatively against the objective functions. Moreover, interactions between the geometric and mechanical properties are investigated. The results show that the optimized grid pattern has superior mechanical properties and geometric imperfection sensitivity. This optimization scheme can be applied for designing mechanically effective grid patterns for single-layer latticed domes.

Sign in / Sign up

Export Citation Format

Share Document