scholarly journals Secrecy Rate of Resource-Constrained Mobile Relay Model under Two-Way Wiretap Channel

2021 ◽  
Vol 11 (21) ◽  
pp. 9866
Author(s):  
Hongmei Wang ◽  
Yinchun Wang ◽  
Meng Wu
Keyword(s):  
Communication Systems ◽  
Optimal Solution ◽  
Mobility Model ◽  
Mixed Integer ◽  
Resource Constrained ◽  
Secrecy Rate ◽  
Long Distance ◽  
Wiretap Channel ◽  
Local Optimal Solution ◽  
Mobile Relay

Relay communication is emerging as a promising solution to improving the reliability of long-distance communication systems. However, transmitting data in a secure way is challenging due to the possibility of eavesdroppers wiretapping such systems. To address the challenge, this paper proposes a joint secure transmission and graph mobility model. With the proposed model, the secrecy rate of the resource-constrained two-way wiretap channel mobile relay system is formulated as a mixed integer nonlinear programming (MINLP) problem. Furthermore, efficient algorithms that achieve a local optimal solution are derived. Numerical results are provided to validate the performance of the proposed algorithms.

scholarly journals Spectrum-Efficient Resource Allocation in Multi-Radio Multi-Hop Cognitive Radio Networks

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4493 ◽  
Author(s):  
Bin Han ◽  
Ying Luo ◽  
Min Zeng ◽  
Hong Jiang
Keyword(s):  
Cognitive Radio ◽  
Simulation Analysis ◽  
Computational Cost ◽  
Optimal Solution ◽  
Primary User ◽  
Spectrum Efficiency ◽  
Mixed Integer ◽  
Spectrum Utilization ◽  
Long Distance ◽  
Average Spectrum

The multi-hop cognitive radio network (CRN) has attracted much attention in industry and academia because of its seamless wireless coverage by forming multi-hop links and high spectrum utilization of cognitive radio (CR) technology. Using multi-slot statistical spectrum status information (SSI), this work investigates the average spectrum efficiency (SE) of a multi-radio multi-hop (MRMH) CRN where each hop is permitted to use different spectra and long-distance hops can reuse the same idle primary user (PU) spectrum. Faced with the modeled SE problem, which is a complex non-convex fractional mixed integer nonlinear programming (MINLP) problem, the optimal spectrum and power allocation for multi-hop links in multi-slot and multi-channel scenarios can be obtained with the proposed successive multi-step convex approximation scheme (SMCA). As shown through computational complexity and simulation analysis, SMCA can obtain an approximate lower bound of the optimal solution for the modeled SE problem with a lower computational cost. Furthermore, some potential relationships between network performance and spectrum idle rate can be easily discussed with SMCA, which can provide some sensible deployment strategies for the MRMH CRN in future multi-slot scenarios.

On the Optimal Precoder Design for Energy-Efficient and Secure MIMO Systems

2017 ◽  
Vol 3 (1) ◽  
pp. 1
Author(s):  
Tung T. Vu ◽  
Ha Hoang Kha
Keyword(s):  
Energy Efficiency ◽  
Mimo Systems ◽  
Search Algorithm ◽  
Multiple Input Multiple Output ◽  
Research Work ◽  
Computational Cost ◽  
Optimal Solution ◽  
Secrecy Rate ◽  
Highly Nonlinear ◽  
Precoder Design

In this research work, we investigate precoder designs to maximize the energy efficiency (EE) of secure multiple-input multiple-output (MIMO) systems in the presence of an eavesdropper. In general, the secure energy efficiency maximization (SEEM) problem is highly nonlinear and nonconvex and hard to be solved directly. To overcome this difficulty, we employ a branch-and-reduce-and-bound (BRB) approach to obtain the globally optimal solution. Since it is observed that the BRB algorithm suffers from highly computational cost, its globally optimal solution is importantly served as a benchmark for the performance evaluation of the suboptimal algorithms. Additionally, we also develop a low-complexity approach using the well-known zero-forcing (ZF) technique to cancel the wiretapped signal, making the design problem more amenable. Using the ZF based method, we transform the SEEM problem to a concave-convex fractional one which can be solved by applying the combination of the Dinkelbach and bisection search algorithm. Simulation results show that the ZF-based method can converge fast and obtain a sub-optimal EE performance which is closed to the optimal EE performance of the BRB method. The ZF based scheme also shows its advantages in terms of the energy efficiency in comparison with the conventional secrecy rate maximization precoder design.

AO-BBO: A Novel Optimization Algorithm and Its Application in Plant Drug Extraction

2019 ◽  
Vol 19 (2) ◽  
pp. 139-145 ◽  
Author(s):  
Bote Lv ◽  
Juan Chen ◽  
Boyan Liu ◽  
Cuiying Dong
Keyword(s):  
Optimization Algorithm ◽  
Learning Strategy ◽  
Optimal Solution ◽  
Population Diversity ◽  
Global Optimal Solution ◽  
Plant Medicine ◽  
Suitability Index ◽  
Sensing Model ◽  
Local Optimal Solution ◽  
Global Optimal

<P>Introduction: It is well-known that the biogeography-based optimization (BBO) algorithm lacks searching power in some circumstances. </P><P> Material & Methods: In order to address this issue, an adaptive opposition-based biogeography-based optimization algorithm (AO-BBO) is proposed. Based on the BBO algorithm and opposite learning strategy, this algorithm chooses different opposite learning probabilities for each individual according to the habitat suitability index (HSI), so as to avoid elite individuals from returning to local optimal solution. Meanwhile, the proposed method is tested in 9 benchmark functions respectively. </P><P> Result: The results show that the improved AO-BBO algorithm can improve the population diversity better and enhance the search ability of the global optimal solution. The global exploration capability, convergence rate and convergence accuracy have been significantly improved. Eventually, the algorithm is applied to the parameter optimization of soft-sensing model in plant medicine extraction rate. Conclusion: The simulation results show that the model obtained by this method has higher prediction accuracy and generalization ability.</P>

scholarly journals Physical-Layer Security Improvement with Reconfigurable Intelligent Surfaces for 6G Wireless Communication Systems

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1439
Author(s):  
Janghyuk Youn ◽  
Woong Son ◽  
Bang Chul Jung
Keyword(s):  
Wireless Communication ◽  
Physical Layer Security ◽  
Communication Systems ◽  
Low Cost ◽  
Physical Layer ◽  
Base Station ◽  
Wireless Communication Systems ◽  
Secrecy Rate ◽  
Pilot Signal ◽  
Time Division

Recently, reconfigurable intelligent surfaces (RISs) have received much interest from both academia and industry due to their flexibility and cost-effectiveness in adjusting the phase and amplitude of wireless signals with low-cost passive reflecting elements. In particular, many RIS-aided techniques have been proposed to improve both data rate and energy efficiency for 6G wireless communication systems. In this paper, we propose a novel RIS-based channel randomization (RCR) technique for improving physical-layer security (PLS) for a time-division duplex (TDD) downlink cellular wire-tap network which consists of a single base station (BS) with multiple antennas, multiple legitimate pieces of user equipment (UE), multiple eavesdroppers (EVEs), and multiple RISs. We assume that only a line-of-sight (LOS) channel exists among the BS, the RISs, and the UE due to propagation characteristics of tera-hertz (THz) spectrum bands that may be used in 6G wireless communication systems. In the proposed technique, each RIS first pseudo-randomly generates multiple reflection matrices and utilizes them for both pilot signal duration (PSD) in uplink and data transmission duration (DTD) in downlink. Then, the BS estimates wireless channels of UE with reflection matrices of all RISs and selects the UE that has the best secrecy rate for each reflection matrix generated. It is shown herein that the proposed technique outperforms the conventional techniques in terms of achievable secrecy rates.

scholarly journals Allocation and Scheduling of Handling Resources in the Railway Container Terminal Based on Crossing Crane Area

2021 ◽  
Vol 13 (3) ◽  
pp. 1190
Author(s):  
Gang Ren ◽  
Xiaohan Wang ◽  
Jiaxin Cai ◽  
Shujuan Guo
Keyword(s):  
Programming Model ◽  
Container Terminal ◽  
Simultaneous Optimization ◽  
Mixed Integer ◽  
Gantry Crane ◽  
Optimization Scheme ◽  
Long Distance ◽  
Proposed Model ◽  
Hybrid Heuristic Algorithm ◽  
Searching Ability

The integrated allocation and scheduling of handling resources are crucial problems in the railway container terminal (RCT). We investigate the integrated optimization problem for handling resources of the crane area, dual-gantry crane (GC), and internal trucks (ITs). A creative handling scheme is proposed to reduce the long-distance, full-loaded movement of GCs by making use of the advantages of ITs. Based on this scheme, we propose a flexible crossing crane area to balance the workload of dual-GC. Decomposing the integrated problem into four sub-problems, a multi-objective mixed-integer programming model (MIP) is developed. By analyzing the characteristic of the integrated problem, a three-layer hybrid heuristic algorithm (TLHHA) incorporating heuristic rule (HR), elite co-evolution genetic algorithm (ECEGA), greedy rule (GR), and simulated annealing (SA) is designed for solving the problem. Numerical experiments were conducted to verify the effectiveness of the proposed model and algorithm. The results show that the proposed algorithm has excellent searching ability, and the simultaneous optimization scheme could ensure the requirements for efficiency, effectiveness, and energy-saving, as well as the balance rate of dual-GC.

scholarly journals An Artificial-Noise-Based Approach for the Secrecy Rate Maximization of MISO VLC Wiretap Channel With Multi-Eves

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 651-659
Author(s):  
Ge Shi ◽  
Yong Li ◽  
Wei Cheng ◽  
Xiang Gao ◽  
Wenjie Zhang
Keyword(s):  
Artificial Noise ◽  
Secrecy Rate ◽  
Wiretap Channel ◽  
Rate Maximization

Well Placement Technique and Production Optimization for Mature Field - A Case Study of L-X Field

2020 ◽  
Vol 46 ◽  
pp. 168-179
Author(s):  
Patrick Nwafor ◽  
Kelani Bello
Keyword(s):  
Oil And Gas ◽  
Optimization Technique ◽  
Optimal Solution ◽  
Oil And Gas Industry ◽  
Optimization Method ◽  
Simulation Software ◽  
Production Optimization ◽  
Direct Optimization ◽  
Well Placement ◽  
Local Optimal Solution

A Well placement is a well-known technique in the oil and gas industry for production optimization and are generally classified into local and global methods. The use of simulation software often deployed under the direct optimization technique called global method. The production optimization of L-X field which is at primary recovery stage having five producing wells was the focus of this work. The attempt was to optimize L-X field using a well placement technique.The local methods are generally very efficient and require only a few forward simulations but can get stuck in a local optimal solution. The global methods avoid this problem but require many forward simulations. With the availability of simulator software, such problem can be reduced thus using the direct optimization method. After optimization an increase in recovery factor of over 20% was achieved. The results provided an improvement when compared with other existing methods from the literatures.

Sign in / Sign up

Export Citation Format

Share Document