Huanhuan Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Huanhuan Song has a total of 58 co-authors. Here are the top co-authors by number of shared publications:
- Hong Wen
School of Aeronautics and Astronautics, University of Electronic Science and Technology of China, Chengdu 611731, China
19 shared publications - Jie Tang
School of Aeronautics and Astronautics, University of Electronic Science and Technology of China, Chengdu, China
10 shared publications Hong Wen
National Key Lab of Commun., University of Elec. Science and Tech. of China, Chengdu 610054, China
6 shared publications- Tengyue Zhang
School of Aeronautics and Astronautics, University of Electronic Science and Technology of China, Chengdu, China
5 shared publications Yixin Jiang
EPRI, China Southern Power Grid Co. Ltd., Guangzhou, China
5 shared publications- Feiyi Xie
National Key Laboratory of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu, China
4 shared publications
Latest Publications
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (4) , 3689-3706
An Information-Theoretic Approach to Distributed Detection for Mobile Wireless Sensor Networks Under Byzantine Attack in Entirely Unknown or Complicated Environment: Design, Analysis, and Evaluation of the Attack Strategy
The parallel distributed detection is studied for mobile wireless sensor networks (MWSNs) in the presence of Byzantine attacks in entirely unknown environment or complicated environment from the perspective of the information theory, where we pay most of our attention toward design, analysis, and evaluation of the attack strategy. In particular, the multihop relay network and the harsh wireless communication condition, e.g., the dynamic and entirely unknown channel, are taken into consideration in our configuration. Second, the conditions that the optimal attacking strategy should satisfy is analyzed and developed under different attacking scenarios. Third, the minimum attacking power is developed for the Byzantines to blind the fusion center (FC). Furthermore, the optimal attacking strategies are developed when no prior information of the system is known for the Byzantines. Finally, the traditional four typical attack strategies are evaluated, and we find that the fraction of Byzantines is the only factor that affects the reliable data fusion when the network size and the attacking strategy are fixed. The extensive simulation is conducted to verify our design, analysis, and evaluation of the attack strategy.
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (4) , 3689-3706
An Information-Theoretic Approach to Distributed Detection for Mobile Wireless Sensor Networks Under Byzantine Attack in Entirely Unknown or Complicated Environment: Design, Analysis, and Evaluation of the Attack Strategy
The parallel distributed detection is studied for mobile wireless sensor networks (MWSNs) in the presence of Byzantine attacks in entirely unknown environment or complicated environment from the perspective of the information theory, where we pay most of our attention toward design, analysis, and evaluation of the attack strategy. In particular, the multihop relay network and the harsh wireless communication condition, e.g., the dynamic and entirely unknown channel, are taken into consideration in our configuration. Second, the conditions that the optimal attacking strategy should satisfy is analyzed and developed under different attacking scenarios. Third, the minimum attacking power is developed for the Byzantines to blind the fusion center (FC). Furthermore, the optimal attacking strategies are developed when no prior information of the system is known for the Byzantines. Finally, the traditional four typical attack strategies are evaluated, and we find that the fraction of Byzantines is the only factor that affects the reliable data fusion when the network size and the attacking strategy are fixed. The extensive simulation is conducted to verify our design, analysis, and evaluation of the attack strategy.
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (3) , 4208-4220
Joint Secure Transmission and Interference Mitigation in Cooperative MIMO Systems: A Feasibility Study
To enhance physical layer security (PLS) and mitigate interference at legitimate receivers, artificial noise (AN) assisted interference alignment (IA) is explored in cooperative multiple-input multiple-output (MIMO) systems. The feasibility of traditional leakage minimization (LM) based IA is analyzed. We show that there exist two drawbacks which are not discussed in traditional LM based IA: 1) the necessary condition for the feasibility of IA is loose, and 2) the secret signal cancellation may occur at the desired receiver, which makes secure transmission infeasible. We analyze the reason and establish a condition under which either the secret signal cancellation is inevitable or IA is infeasible. Then a modified IA is proposed. Compared with the traditional LM based IA, a tighter necessary condition is established and the secret signal is protected against cancellation. Moreover, we prove that the proposed condition guarantees the properness of system, which is a rigorous characterization of necessary conditions for achieving IA. Under assumption that the modified IA is feasible, we provide a secrecy enhancing design to maximize the secrecy rate. subject to a secrecy outage constraint. We also establish a condition under which a positive secrecy rate is feasible. Numerical results validate the effectiveness of the proposed approach.
- 24 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (3) , 4208-4220
Joint Secure Transmission and Interference Mitigation in Cooperative MIMO Systems: A Feasibility Study
To enhance physical layer security (PLS) and mitigate interference at legitimate receivers, artificial noise (AN) assisted interference alignment (IA) is explored in cooperative multiple-input multiple-output (MIMO) systems. The feasibility of traditional leakage minimization (LM) based IA is analyzed. We show that there exist two drawbacks which are not discussed in traditional LM based IA: 1) the necessary condition for the feasibility of IA is loose, and 2) the secret signal cancellation may occur at the desired receiver, which makes secure transmission infeasible. We analyze the reason and establish a condition under which either the secret signal cancellation is inevitable or IA is infeasible. Then a modified IA is proposed. Compared with the traditional LM based IA, a tighter necessary condition is established and the secret signal is protected against cancellation. Moreover, we prove that the proposed condition guarantees the properness of system, which is a rigorous characterization of necessary conditions for achieving IA. Under assumption that the modified IA is feasible, we provide a secrecy enhancing design to maximize the secrecy rate. subject to a secrecy outage constraint. We also establish a condition under which a positive secrecy rate is feasible. Numerical results validate the effectiveness of the proposed approach.
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 6431-6444
Digital-Twin-Based Satellite Orbit Prediction for Internet of Things Systems
Satellites play a crucial role in Internet of Things (IoT) applications that require precise positioning. Satellite orbit prediction serves as the foundation for providing accurate terminal location services. However, traditional satellite orbit prediction faces challenges like measurement errors, estimation errors, and unmodeled orbit disturbances, leading to low prediction accuracy. To address this issue, this article introduces a groundbreaking satellite digital twin (DT) system based on container technology. This system facilitates real-time mirroring, monitoring, optimization, and control of satellite orbit prediction with low power consumption. Leveraging the advantages of container technology allows for convenient and efficient model updating. Furthermore, a new satellite orbit error prediction model is explored within this system. This model utilizes the seasonal-trend decomposition using locally weighted regression (STL) method and the temporal convolutional network (TCN) algorithm. By decomposing satellite orbit data into multiple components, the proposed model achieves enhanced future orbit Prediction by combining predicted values from each component. Different from existing machine learning (ML) orbit prediction models, our proposed model explores the variation patterns of satellite orbit data from a trend and cycle perspective, rather than relying solely on collecting more data and training larger models to improve prediction accuracy, which makes the novel prediction scheme get good performance while keeping low prediction complexity. Extensive experiments validate the effectiveness of the proposed method using two publicly available satellite orbit datasets (ILRS catalogue and TLE catalogue). The experimental results show that compared with traditional orbit prediction models, the novel DT system has less model update time and occupies less memory. The mean absolute error (MAE) value of the new model is lower than the five ML models in existing researches, which proves that the proposed STL-TCN model has higher prediction accuracy than existing ML orbit prediction models. In addition, we discussed the impact of atmospheric pressure density on the STL-TCN model, and experiments have shown that the correction of different atmospheric pressure density models has a very small impact on the prediction accuracy of the STL-TCN model. Finally, we further investigate the generalization ability of the STL-TCN model for other satellite orbits and future time orbits, and the results show that the novel model has satisfactory generalization ability.
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (6) , 6431-6444
Digital-Twin-Based Satellite Orbit Prediction for Internet of Things Systems
Satellites play a crucial role in Internet of Things (IoT) applications that require precise positioning. Satellite orbit prediction serves as the foundation for providing accurate terminal location services. However, traditional satellite orbit prediction faces challenges like measurement errors, estimation errors, and unmodeled orbit disturbances, leading to low prediction accuracy. To address this issue, this article introduces a groundbreaking satellite digital twin (DT) system based on container technology. This system facilitates real-time mirroring, monitoring, optimization, and control of satellite orbit prediction with low power consumption. Leveraging the advantages of container technology allows for convenient and efficient model updating. Furthermore, a new satellite orbit error prediction model is explored within this system. This model utilizes the seasonal-trend decomposition using locally weighted regression (STL) method and the temporal convolutional network (TCN) algorithm. By decomposing satellite orbit data into multiple components, the proposed model achieves enhanced future orbit Prediction by combining predicted values from each component. Different from existing machine learning (ML) orbit prediction models, our proposed model explores the variation patterns of satellite orbit data from a trend and cycle perspective, rather than relying solely on collecting more data and training larger models to improve prediction accuracy, which makes the novel prediction scheme get good performance while keeping low prediction complexity. Extensive experiments validate the effectiveness of the proposed method using two publicly available satellite orbit datasets (ILRS catalogue and TLE catalogue). The experimental results show that compared with traditional orbit prediction models, the novel DT system has less model update time and occupies less memory. The mean absolute error (MAE) value of the new model is lower than the five ML models in existing researches, which proves that the proposed STL-TCN model has higher prediction accuracy than existing ML orbit prediction models. In addition, we discussed the impact of atmospheric pressure density on the STL-TCN model, and experiments have shown that the correction of different atmospheric pressure density models has a very small impact on the prediction accuracy of the STL-TCN model. Finally, we further investigate the generalization ability of the STL-TCN model for other satellite orbits and future time orbits, and the results show that the novel model has satisfactory generalization ability.
- 10 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (4) , 6817-6829
Distributed Decision Fusion in Wireless Sensor Networks for Contextual Experience Sensing and Recommendation Forming in E-Commerce
The distributed decision fusion algorithm for Wireless Sensor Networks (WSNs) is proposed for contextual experience sensing and personalized recommendation in Ecommerce, wherein the multihop relay and Binary Adder Multiple-access Channel (BAMAC) are considered. Providing reliable services in consumer electronics relies on accurate fusion rules, however, with a large number of device nodes being accessed, reducing service latency by efficiently fusing data has undoubtedly become the preferred option to improve the user’s sense of experience. Specifically, we establish the optimum decision fusion rule based on the log-likelihood ratio (LLR) for independent and non-identically distributed multihop relay WSNs under the Binary Symmetric Channel (BSC). However the Channel State Information (CSI) of the multihop relays should be completely aware and the Poisson binomial distribution needs to complete the traversal of all possible received signals. Thus we accomplish the transformation from Poisson binomial distribution to Binomial distribution by using the average probability. Subsequently, we optimize the complexity of the fusion rule by fixing the local decision rule and obtain suboptimal fusion algorithms for the three cases, the ideal local channel, and the relay channel with small or large crossover probability, respectively. Firstly, the idea from the majority-based fusion statistics is successfully borrowed under the ideal local channel assumption. Secondly, the Chair-Varshney (CV) rule is achieved when the intermediate relay transmission link over the edge network is nearly perfect, i.e., the BSC’s crossover probability is sufficiently small. In particular, the majority-based fusion statistic is also obtained when the transmission probability of the local channel is symmetrically distributed. Thirdly, we assume that the relay BSC has a large crossover probability, and the majority-based decision fusion statistic is correspondingly derived. Furthermore, we develop the decision fusion algorithm under the BAMAC for independent identically distributed WSNs. The fusion performance is determined by both Monte Carlo simulation and theory analysis.
- 10 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Consumer Electronics
- Vol. 70 (4) , 6817-6829
Distributed Decision Fusion in Wireless Sensor Networks for Contextual Experience Sensing and Recommendation Forming in E-Commerce
The distributed decision fusion algorithm for Wireless Sensor Networks (WSNs) is proposed for contextual experience sensing and personalized recommendation in Ecommerce, wherein the multihop relay and Binary Adder Multiple-access Channel (BAMAC) are considered. Providing reliable services in consumer electronics relies on accurate fusion rules, however, with a large number of device nodes being accessed, reducing service latency by efficiently fusing data has undoubtedly become the preferred option to improve the user’s sense of experience. Specifically, we establish the optimum decision fusion rule based on the log-likelihood ratio (LLR) for independent and non-identically distributed multihop relay WSNs under the Binary Symmetric Channel (BSC). However the Channel State Information (CSI) of the multihop relays should be completely aware and the Poisson binomial distribution needs to complete the traversal of all possible received signals. Thus we accomplish the transformation from Poisson binomial distribution to Binomial distribution by using the average probability. Subsequently, we optimize the complexity of the fusion rule by fixing the local decision rule and obtain suboptimal fusion algorithms for the three cases, the ideal local channel, and the relay channel with small or large crossover probability, respectively. Firstly, the idea from the majority-based fusion statistics is successfully borrowed under the ideal local channel assumption. Secondly, the Chair-Varshney (CV) rule is achieved when the intermediate relay transmission link over the edge network is nearly perfect, i.e., the BSC’s crossover probability is sufficiently small. In particular, the majority-based fusion statistic is also obtained when the transmission probability of the local channel is symmetrically distributed. Thirdly, we assume that the relay BSC has a large crossover probability, and the majority-based decision fusion statistic is correspondingly derived. Furthermore, we develop the decision fusion algorithm under the BAMAC for independent identically distributed WSNs. The fusion performance is determined by both Monte Carlo simulation and theory analysis.
- 11 October 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12918, 44-193
Physical layer security verification system based on software defined radio
Compared with traditional encryption technology, physical layer security technology uses channel noise to realize the key with the same length as plaintext. Even if the eavesdropper has strong cracking computing power, it cannot decipher the confidential data without the key, which can truly realize “One-Time-Pad” and ensure the security of wireless communication. In this paper, we propose a physical layer security verification system based on software defined radio. In the system, base stations and legitimate users can obtain channel information efficiently, and eavesdroppers can use the powerful storage and computing resources of the cloud server to decrypt confidential signals without time constraints. Based on the system, this paper designs and verifies the physical layer security scheme with joint precoding and Artificial Noise, which fills the gap of the prototype verification platform of information-theoretic security and provides strong support for verifying the unconditional security features of the physical layer security technology.
- 11 October 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12918, 44-193
Physical layer security verification system based on software defined radio
Compared with traditional encryption technology, physical layer security technology uses channel noise to realize the key with the same length as plaintext. Even if the eavesdropper has strong cracking computing power, it cannot decipher the confidential data without the key, which can truly realize “One-Time-Pad” and ensure the security of wireless communication. In this paper, we propose a physical layer security verification system based on software defined radio. In the system, base stations and legitimate users can obtain channel information efficiently, and eavesdroppers can use the powerful storage and computing resources of the cloud server to decrypt confidential signals without time constraints. Based on the system, this paper designs and verifies the physical layer security scheme with joint precoding and Artificial Noise, which fills the gap of the prototype verification platform of information-theoretic security and provides strong support for verifying the unconditional security features of the physical layer security technology.
- 1 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (5) , 4462-4474
Secrecy Energy Efficiency Maximization for Distributed Intelligent-Reflecting-Surface-Assisted MISO Secure Communications
This article investigates energy-efficient secure communication design with the help of multiple phase-adjustable intelligent reflecting surfaces (IRSs). By creating desirable radiation patterns of wireless environment, the IRSs are used to significantly improve the number of bits securely delivered to the destination per energy consumption in Joule, also known as the secrecy energy efficiency (SEE). By manipulating the discrete reflecting coefficients of multiple IRSs and taking advantage of the active beamforming, this article develops an efficient alternating optimization algorithm based on successive convex approximation and penalty-based techniques to effectively fight against multiple eavesdroppers. Simulation results characterize the graceful tradeoff between conflicting performance metrics, i.e., total power consumption and secrecy rate in the multi-IRS-aided secure communication system, and corroborate that incorporating multiple IRSs is beneficial to both the SEE and secrecy rate enhancement compared to existing related benchmarks.
- 1 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (5) , 4462-4474
Secrecy Energy Efficiency Maximization for Distributed Intelligent-Reflecting-Surface-Assisted MISO Secure Communications
This article investigates energy-efficient secure communication design with the help of multiple phase-adjustable intelligent reflecting surfaces (IRSs). By creating desirable radiation patterns of wireless environment, the IRSs are used to significantly improve the number of bits securely delivered to the destination per energy consumption in Joule, also known as the secrecy energy efficiency (SEE). By manipulating the discrete reflecting coefficients of multiple IRSs and taking advantage of the active beamforming, this article develops an efficient alternating optimization algorithm based on successive convex approximation and penalty-based techniques to effectively fight against multiple eavesdroppers. Simulation results characterize the graceful tradeoff between conflicting performance metrics, i.e., total power consumption and secrecy rate in the multi-IRS-aided secure communication system, and corroborate that incorporating multiple IRSs is beneficial to both the SEE and secrecy rate enhancement compared to existing related benchmarks.
- 31 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (16) , 15228-15239
Sharing Secrets via Wireless Broadcasting: A New Efficient Physical Layer Group Secret Key Generation for Multiple IoT Devices
With the increasing demands for sharing confidential information among massive Internet of Things (IoT) devices in 5G and beyond wireless networks, many applications require the common secret key generation for a group of IoT devices. However, most of the existing works on physical layer secret key generation (PLKG) only focus on the pairwise key generation between two users, which is a low efficient and high cost to be extended to the scenarios of group key generation. In this work, we propose a new efficient multiple-input–multiple-output (MIMO) physical layer group secret key generation scheme to reduce the consumption of channel probing and improve the efficiency for group key generation. Different from current schemes, in the proposed scheme, the transmitter randomly generates the group secret key and directly broadcasts the downlink data symbols to the group users. At the receiver end, each group user can efficiently “observe” the common group key through the downlink broadcasting data symbols, while keeping perfect secrecy of the shared group key against eavesdroppers. The performance of reliability, security, and the group key generation rate is fully investigated, which shows the advantages of high efficiency, low consumption, and strong robustness of the proposed scheme. Extensive simulations are conducted to validate the effectiveness of the proposed scheme.
- 31 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (16) , 15228-15239
Sharing Secrets via Wireless Broadcasting: A New Efficient Physical Layer Group Secret Key Generation for Multiple IoT Devices
With the increasing demands for sharing confidential information among massive Internet of Things (IoT) devices in 5G and beyond wireless networks, many applications require the common secret key generation for a group of IoT devices. However, most of the existing works on physical layer secret key generation (PLKG) only focus on the pairwise key generation between two users, which is a low efficient and high cost to be extended to the scenarios of group key generation. In this work, we propose a new efficient multiple-input–multiple-output (MIMO) physical layer group secret key generation scheme to reduce the consumption of channel probing and improve the efficiency for group key generation. Different from current schemes, in the proposed scheme, the transmitter randomly generates the group secret key and directly broadcasts the downlink data symbols to the group users. At the receiver end, each group user can efficiently “observe” the common group key through the downlink broadcasting data symbols, while keeping perfect secrecy of the shared group key against eavesdroppers. The performance of reliability, security, and the group key generation rate is fully investigated, which shows the advantages of high efficiency, low consumption, and strong robustness of the proposed scheme. Extensive simulations are conducted to validate the effectiveness of the proposed scheme.
- 8 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (22) , 16256-16268
Multiagent Deep Reinforcement Learning for Task Offloading and Resource Allocation in Cybertwin-Based Networks
In this article, a hierarchical task offloading strategy is presented for delay-tolerant and delay-sensitive missions by integrating edge computing and artificial intelligence into Cybertwin-based network to guarantee user Quality of Experience (QoE), low latency, and ultrareliable services, which are huge challenges to the Internet of Things (IoT) due to diverse application requirements, heterogeneous multidimensional resources, and time-varying network environments. The novel scheme achieves faster task processing, dynamic real-time allocation, and lower overhead by taking advantages of a multiagent deep deterministic policy gradient (MADDPG). Moreover, federated learning is used to train the MADDPG model. Numerical results demonstrate that the proposed algorithm improves system processing efficiency and task completion ratio compared to the benchmark schemes.
- 8 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (22) , 16256-16268
Multiagent Deep Reinforcement Learning for Task Offloading and Resource Allocation in Cybertwin-Based Networks
In this article, a hierarchical task offloading strategy is presented for delay-tolerant and delay-sensitive missions by integrating edge computing and artificial intelligence into Cybertwin-based network to guarantee user Quality of Experience (QoE), low latency, and ultrareliable services, which are huge challenges to the Internet of Things (IoT) due to diverse application requirements, heterogeneous multidimensional resources, and time-varying network environments. The novel scheme achieves faster task processing, dynamic real-time allocation, and lower overhead by taking advantages of a multiagent deep deterministic policy gradient (MADDPG). Moreover, federated learning is used to train the MADDPG model. Numerical results demonstrate that the proposed algorithm improves system processing efficiency and task completion ratio compared to the benchmark schemes.
- Open Access
- 10 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 27287-27297
Adaptive Secure Transmission Strategy for Industrial Wireless Edge-Enabled CPS
For real-time industrial wireless edge-enabled cyber-physical systems, this paper proposes an adaptive secure transmission mechanism under the large scale path loss to fight against randomly distributed illegal sensing devices. According to changes in the communication environment, the proposed scheme adaptively obtains the corresponding optimal power allocations and wiretap code rates. Specifically, by injecting artificial noise, an edge controller provides confidential control information for a legitimate wireless sensing device and achieves non-confidential data service for a service subscriber, simultaneously. Considering whether the secrecy and non-confidential service rate constraints are met, a dynamic secrecy transmission mechanism is introduced to minimize secrecy outage probability (SOP) based on random channel realizations. The optimal power allocation for minimizing the SOP is derived through the efficient alternating optimization algorithm with numerical methods. Numerical results show that the proposed adaptive secure transmission strategy can efficiently utilize transmit power to achieve non-confidential information traffic without compromising the secrecy performance.
- 10 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 27287-27297
Open AccessAdaptive Secure Transmission Strategy for Industrial Wireless Edge-Enabled CPS
For real-time industrial wireless edge-enabled cyber-physical systems, this paper proposes an adaptive secure transmission mechanism under the large scale path loss to fight against randomly distributed illegal sensing devices. According to changes in the communication environment, the proposed scheme adaptively obtains the corresponding optimal power allocations and wiretap code rates. Specifically, by injecting artificial noise, an edge controller provides confidential control information for a legitimate wireless sensing device and achieves non-confidential data service for a service subscriber, simultaneously. Considering whether the secrecy and non-confidential service rate constraints are met, a dynamic secrecy transmission mechanism is introduced to minimize secrecy outage probability (SOP) based on random channel realizations. The optimal power allocation for minimizing the SOP is derived through the efficient alternating optimization algorithm with numerical methods. Numerical results show that the proposed adaptive secure transmission strategy can efficiently utilize transmit power to achieve non-confidential information traffic without compromising the secrecy performance.
- 19 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 17 (7) , 4999-5009
Cooperative Jamming Secure Scheme for IWNs Random Mobile Users Aided by Edge Computing Intelligent Node Selection
The cooperative physical layer security (PHY) scheme can enhance the communication security of industrial wireless nodes that are computing and energy limitation, which provides the light-weight security for future industrial wireless networks (IWNs). By aiding the edge computing device, the optimal cooperative jamming (CJ) node can be selected and employed to collaboratively transmit jamming signals to maximumly weaken the quality of the wiretap channel. For overcoming the drawback of the existing work that only studies the physical layer security in static scenes, we consider a practical scenario where legitimate user and eavesdropper move randomly. The ergodic secrecy capacity with CJ in random mobile scenes is derived. The edge computing device is employed to make intelligent selection of an optimal cooperative node. Test and verification are carried out in the industrial factory. The test results show that novel scheme can improve the secrecy of random mobile users in the IWNs.
- 19 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 17 (7) , 4999-5009
Cooperative Jamming Secure Scheme for IWNs Random Mobile Users Aided by Edge Computing Intelligent Node Selection
The cooperative physical layer security (PHY) scheme can enhance the communication security of industrial wireless nodes that are computing and energy limitation, which provides the light-weight security for future industrial wireless networks (IWNs). By aiding the edge computing device, the optimal cooperative jamming (CJ) node can be selected and employed to collaboratively transmit jamming signals to maximumly weaken the quality of the wiretap channel. For overcoming the drawback of the existing work that only studies the physical layer security in static scenes, we consider a practical scenario where legitimate user and eavesdropper move randomly. The ergodic secrecy capacity with CJ in random mobile scenes is derived. The edge computing device is employed to make intelligent selection of an optimal cooperative node. Test and verification are carried out in the industrial factory. The test results show that novel scheme can improve the secrecy of random mobile users in the IWNs.