Loading...
Office

Table of Content

    20 October 2024 Volume 51 Issue 5
      
    Information and Communications Engineering
    GaN-based LLC resonant converter with a 2.5 MHz resonant frequency
    ZHANG Runyu, HE Yunlong, ZHENG Xuefeng, ZHANG Junjie, ZHOU Xiang, MA Xiaohua, HAO Yue
    Journal of Xidian University. 2024, 51(5):  1-8.  doi:10.19665/j.issn1001-2400.20240910
    Abstract ( 371 )   HTML ( 67 )   PDF (2926KB) ( 251 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The DC-DC converter plays a pivotal role in secondary power supplies for aerospace applications.The ongoing development trend for aerospace power supply converters emphasizes compact size,lightweight,and high-power output.To achieve these goals,enhancing the “power-to-weight ratio” and increasing the switching frequency are critical strategies.Notably,the pursuit of higher frequencies is a significant focus for future DC-DC converters.In this paper,GaN(Gallium Nitride) based HEMTs(High Electron Mobility Transistors) is employed as a switching device to investigate the impact of device characteristics on the maximum achievable operating frequency when the LLC resonant converter operates in the soft-switching mode.It is found that reducing the output capacitance of GaN devices leads to higher switching frequencies.However,it is essential to consider the tradeoff between frequency and power losses.To address this problem,we establish an accurate loss model for GaN devices,providing valuable insights for optimizing efficiency.Finally,a 200W 270 V~28 V LLC resonant converter is realized and the detailed analysis is carried out.By utilizing GaN devices as a switching component,a high-frequency converter operating at 2.5 MHz is achieved.The resulting power-to-weight ratio reaches 3.1 kW/kg,with a peak conversion efficiency of 92.8%.Our prototype validates the feasibility of designing higher-frequency LLC converters,and provides a design reference for the future production of a high-frequency converter.

    Survey of routing technologies for the satellite Internet
    WEI Wenting, FU Liying, WANG Kun, LU Xueyu, ZHOU Zhaojun
    Journal of Xidian University. 2024, 51(5):  9-23.  doi:10.19665/j.issn1001-2400.20240503
    Abstract ( 369 )   HTML ( 44 )   PDF (2816KB) ( 174 )   Save
    Figures and Tables | References | Related Articles | Metrics

    With its evolution of global coverage,flexible access,and reliable transmission,the satellite Internet is the key to constructing a space-air-ground integrated information network.Due to the rapid expansion of constellation scale,complex network topology and diverse service requirements,there is increasing pressure on transmission over the satellite Internet.Routing is responsible for path selection and data forwarding between satellites,which is important to improving the efficiency of inter-satellite transmission and ensuring the quality of service.By considering inter-satellite routing,first,the basic structure and working mechanisms of the satellite Internet are reviewed.According to the challenges of inter-satellite networking,routing technologies are systematically reviewed from the perspectives of dynamic information perception,network failures model,and cross-layer hybrid networking.In addition,the research on routing technologies in different scenarios is analyzed,with the applicability of various existing solutions studied when the on-board computing and storage capabilities are limited.Finally,by combining the bottlenecks of current satellite Internet routing and emerging network technology,future research hotspots are prospected.

    Collaborative resource allocation method for multiple jammers in formation penetration
    YAN Junkun, ZHANG Congrui, LI Wanping, DAI Jinhui, ZHANG Peng, LIU Hongwei
    Journal of Xidian University. 2024, 51(5):  24-34.  doi:10.19665/j.issn1001-2400.20240501
    Abstract ( 173 )   HTML ( 9 )   PDF (2291KB) ( 91 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The essence of jamming countermeasure is competition in the resource dimension.The single node with limited jamming resources is no longer able to meet practical needs.Multi node collaborative jamming can introduce higher dimensional jamming resources,which has become an important form of combat in the future.However,in traditional collaborative jamming scenarios,the use of preset transmission modes by each node can lead to redundant configuration of jamming resources,resulting in poor jamming effects in the context of formation penetration.In response to the above issues,a performance-driven method for collaborative resource allocation of multiple jammers is proposed.Its core is to allocate the transmission resources of multiple jammers in real time,so as to reduce the tracking accuracy of enemy radars on our penetration targets under the same resource consumption.First,this article derives the Bayesian Cramér-Rao Lower Bound for tracking penetration targets in jamming scenarios and evaluates the performance of multi jammer collaborative jamming; Then,based on the resource constraints of our jammers,a multi jammer collaborative resource optimization model including dwell time variables is established,which proves to be a convex optimization problem.The Augmented Lagrangian Multiplier Method is used for fast optimization and solution.Simulation results show that compared to other benchmark methods,the proposed jamming resource allocation method can effectively suppress enemy networked radars,reduce their tracking accuracy towards our penetration targets,and still have a good jamming effect and a fast solving ability under the constraint of a limited number of beams.

    Novel artificial noise generation and suppression method for unmanned aerial vehicle networking
    LIN Lang, ZHAO Hongzhi, SHAO Shihai, TANG Youxi
    Journal of Xidian University. 2024, 51(5):  35-45.  doi:10.19665/j.issn1001-2400.20240803
    Abstract ( 173 )   HTML ( 7 )   PDF (2121KB) ( 70 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Wireless communication faces the risk of eavesdropping due to the natural characteristics of the broadcast channel.Aiming at the physical layer security of the unmanned aerial vehicle(UAV) networks,and considering that UAV platforms are limited in signal processing capability due to their limited size and power consumption,a novel artificial noise(AN) generation and suppression method adapted to UAV platforms is proposed.The transmitter takes the desired signal as a reference,and uses the phase information of the symbols in the past signal segments to construct the multiplicative artificial noise of the current signal segment.And the past signal segments are superimposed with different weights to construct the additive artificial noise of the current signal segment.The artificial noise is suppressed at the authorized receiver by phase compensation and differential operation.The two artificial noises can be designed either jointly or independently,and the appropriate AN waveforms are selected according to channel environments.Theoretical analysis and simulation show that the method has a low algorithm complexity,and that it can effectively deteriorate the signal-to-noise ratio of the eavesdropping channel,improve the security capacity of the system,and enhance the physical layer security.This method can also be applied to other large-scale networking systems whose nodes are limited in signal processing capacity and provide a means of secure transmission at the physical layer.

    EVD clutter suppression method based on the self-organizing neural network
    SHI Jiaqi, YANG Minglei, LIAN Hao, YE Zhou, XU Guanghui
    Journal of Xidian University. 2024, 51(5):  46-57.  doi:10.19665/j.issn1001-2400.20240602
    Abstract ( 165 )   HTML ( 16 )   PDF (5420KB) ( 86 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The subspace decomposition method is a common method for clutter suppression of slow moving targets in strong clutter environment.But the traditional subspace decomposition method has a poor adaptability.The SVD clutter suppression algorithm based on K-means clustering makes up for the above defects,but when the slow-moving target is close to the clutter Doppler or aliasing,the feature set discrimination decreases and the clustering results are unstable.Therefore,an eigenvalue-decomposition(EVD) clutter suppression algorithm based on self-organizing neural networks is proposed,with the differences between targets,clutter and noise analyzed deeply,and the features with high differentiation between slow-moving targets and clutter extracted to construct the feature set.Then,the self-organizing neural network,which is less affected by the initial value and has stable clustering results,is used for clustering,adaptive selection of clutter basis to construct clutter subspace.Finally,the clutter is suppressed by orthotropic subspace projection.Simulation and measured data are used to verify the performance of the algorithm.By combining with the target tracking algorithm,it is further verified that the algorithm has strong robustness and engineering practicability.

    Knowledge graph assisted spectrum resource optimization algorithm for UAVs
    WANG Yulai, LIAO Xiaomin, HE Haiguang, YE Guojun
    Journal of Xidian University. 2024, 51(5):  58-70.  doi:10.19665/j.issn1001-2400.20240505
    Abstract ( 174 )   HTML ( 8 )   PDF (1793KB) ( 85 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In response to the scarcity of available spectrum resources in UAV swarms and the difficulties in solving multi-objective optimization problems,as well as the challenges of obtaining complete channel information and poor real-time performance during the resource optimization process,a knowledge graph-assisted spectrum resource optimization algorithm for UAV swarms is proposed.Firstly,a relation-aware graph multi-head attention network(RGMAN) encoder is constructed to aggregate communication parameters,performance parameters,and electromagnetic environment information of the UAV swarm,and allocate different weights to neighbor information based on the importance of the nodes.Then,an improved layer-attention-based InteractE(SE-IE) model is developed to predict the channel access and transmit power for the UAVs,which utilizes a squeeze-and-excitation module to obtain layer attention information and extracts deep-level interactive information from the results of circular convolutions.The simulation results indicate that the proposed algorithm exhibits rapid convergence capability,excellent performance in link prediction,and notable stability and robustness on public datasets.Additionally,on the dataset for UAV swarm spectrum management,the proposed algorithm can generate an approximately optimal spectrum resource optimization scheme for UAV swarms,in the premise of channel distribution information and partial environmental information.

    Set associativity adaptively extended cache architecture and performance analysis
    ZHOU Yu, YU Zongguang, GAO Yang, SHAO Jian, LUO Qing
    Journal of Xidian University. 2024, 51(5):  71-81.  doi:10.19665/j.issn1001-2400.20240101
    Abstract ( 105 )   HTML ( 4 )   PDF (1526KB) ( 44 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In modern processor architectures,caching is an important method to solve the bottleneck of the memory wall.However,the requirement of cache access changes with the switching of the program or even a program fragment,which makes it difficult for traditional fixed-parameter configuration cache architectures to maintain a stable and efficient performance for a long time or between programs.This paper proposes an adaptively extended method for cache set associativity,which can use a short-term inactive cache set to expand the number of set associations of the current active cache set while the program is running,dynamically adjust the extended interconnection relationship between cache sets in real-time,and effectively improve the overall utilization efficiency of cache storage space.In this paper,the proposed cache architecture is simulated by Gem5 software,and the performance test is carried out based on the SPEC CPU 2017 benchmark.Simulation results show that the proposed method significantly improves the uniformity of cache set access with a maximum rate of about 23.14% for a typical program,and improves the reduction in missing ratio to a maximum of 54.2%.Hardware implementation and simulation results show that compared to low-power reconfigurable cache architectures such as HY-Way architecture,the proposed cache architecture reduces resource consumption by more than 7.66%,which has a significant application value in embedded processor designs.

    Computer Science and Technology & Cyberspace Security
    Subspace andmemory bank for cross-domain few-shot classification of hyperspectral images
    MU Caihong, ZHANG Fugui, YAN Xiangrong, LIU Yi
    Journal of Xidian University. 2024, 51(5):  82-96.  doi:10.19665/j.issn1001-2400.20240310
    Abstract ( 99 )   HTML ( 7 )   PDF (5219KB) ( 58 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In response to the challenges in the field of cross-domain few-shot classification of hyperspectral images,such as low classification accuracy and limited generalization capability,this study proposes a novel hyperspectral image classification method based on the subspace and memory bank of cross-domain few-shot learning(SMB-CFSL).A feature extractor is improved that integrates the channel attention mechanism and the spectral-spatial attention mechanism to fully extract the spectral spatial information on original hyperspectral images.By employing the contrastive learning mechanism to analyze the diversity and differences among small samples,the discriminative power and generalization performance of the model are enhanced under the few-shot scenario.Additionally,the prototype network is improved by utilizing adaptive subspace to enhance the utilization of embedding features,leading to improved accuracy in image classification.Finally,a memory bank module is introduced to achieve cross-domain alignment and enhance the classification performance of the model under cross-domain conditions.Through iterative training and continuous optimization,the optimized feature extractor is employed for classification on the testing set.We compare our proposed method with state-of-the-art approaches for cross-domain few-shot classification of hyperspectral images using four widely adopted datasets.Experimental results demonstrate that our method outperforms several existing methods in classification while also exhibiting excellent generalization capability and robustness.

    Popularity-aware cloud-edge collaborative caching strategy for wireless video
    TANG Hanqin, ZHAO Hui, NING Jingyou, WANG Jing, WAN Bo, WANG Quan
    Journal of Xidian University. 2024, 51(5):  97-109.  doi:10.19665/j.issn1001-2400.20240309
    Abstract ( 103 )   HTML ( 5 )   PDF (1971KB) ( 48 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Mobile edge caching technology caches videos at edge servers closer to users,thereby providing users with more convenient services.Current video caching methods rely primarily on overall video popularity,ignoring the spatial and temporal variations in video popularity.As a result,they fail to fully utilize the wide geographical distribution characteristics of edge servers,thereby impacting the effectiveness of video caching in the cloud-edge environment.In order to address this issue,we propose a wireless video cloud edge caching strategy based on popularity perception.First,based on the cloud-edge collaborative architecture,we establish a cloud-edge video caching model that takes into account the spatial and temporal variations in video popularity.This model combines video segmentation and video segment popularity,and aims to minimize the average delay for all videos requested and maximize the total cache hit rate.Second,considering the limited computational and caching resources of edge servers,we propose a caching strategy called Global Value Evaluation(GVE).This strategy quantifies the ability of a video segment to fulfill user requests as its caching value and incorporates a caching value penalty mechanism to dynamically assess the value of cached content,enabling efficient caching of video segments.Finally,simulation experiments demonstrate that the proposed strategy can significantly reduce the average transmission delay and backhaul traffic load,and improve the cache hit rate of requested videos.

    Image texture-guided iterative watermarking model
    WU Xinting, HUANG Ying, NIU Baoning, GUAN Hu, LAN Fangpeng, LIU Jie
    Journal of Xidian University. 2024, 51(5):  110-121.  doi:10.19665/j.issn1001-2400.20240601
    Abstract ( 102 )   HTML ( 4 )   PDF (2815KB) ( 57 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Deep neural networks have been successfully used in the field of digital watermarking in recent years.An encoder that embeds the watermark,a noise layer that simulates the attacks,and a decoder that retrieves the watermark make up a typical deep learning watermarking model.The commonly used end-to-end training approach requires that the attacks involved in training should be conductible,and this requirement limits the robustness capability of watermarking models in the face of real differentiable attacks.In addition,in a complete image,which usually contains both smooth and rough textures,current watermarking models seldom utilize the texture information directly to realize the embedding process of the watermark.To address the above problem,this paper proposes an iterative watermarking model guided by the image texture.An image texture attention module is introduced so that the model can guide the embedding process of the watermark,and according to the roughness of the image texture it can improve the imperceptibility of the watermark.To make the learning of unguided attacks,a two-stage iterative training approach is adopted.In order to optimize the imperceptibility of the model,the first stage involves conducting joint end-to-end encoder-decoder training without attacks,along with the inclusion of the image texture attention module.In the second stage,the decoder involved in differentiable attacks is trained independently,and the decoder with strong robustness is built by learning from any real attack distribution.Through cooperative training of encoders and decoders,which realizes a superior balance of watermarking imperceptibility and robustness,the two-stage training is eventually carried out repeatedly to the model's global optimum.According to experimental findings,the proposed approach outperforms popular deep learning watermarking techniques in terms of both imperceptibility and robustness.

    Hyperspectral image denoising based on superpixel segmentation and band segmentation
    LI Huajun, JIANG Junzheng, ZHOU Fang, QUAN Yinghui
    Journal of Xidian University. 2024, 51(5):  122-135.  doi:10.19665/j.issn1001-2400.20240502
    Abstract ( 156 )   HTML ( 3 )   PDF (5826KB) ( 56 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Existing hyperspectral image denoising algorithms adopt a band-by-band or full-band approach to denoising,which fails to make full use of the similarity of hyperspectral image bands.To address this problem,this paper proposes a hyperspectral image denoising algorithm based on superpixel segmentation and band segmentation.In this paper,we construct a two-layer graph,including the upper and lower layer graphs.First,superpixel segmentation is applied to the hyperspectral image to obtain a series of superpixels.In order to utilize the spatial information on the hyperspectral image and retain the boundary information,the pixels within the superpixels are modeled as nodes with the pixels connected with edges to construct a series of lower layer graphs.In order to utilize the band similarity of the hyperspectral image,superpixel volumes are formed by segmenting along the band dimension based on the superpixel segmentation results with the superpixel volumes modeled as nodes,and the superpixel volumes connected with edges to construct an upper layer graph.Based on the graph structure and graph segmentation,the hyperspectral image denoising problem is reduced to a series of optimization problems,in which the graph Laplacian regularization is redefined using the Kronecker graph product.Finally,experimental results show that the proposed algorithm has a higher mean signal-to-noise ratio,mean structural similarity index measure and erreur relative globale adimensionnelle de synthese compared with the existing algorithms.

    Image hashing combining adaptive grid descriptor and image energy
    SUN Feifan, ZHAO Yan
    Journal of Xidian University. 2024, 51(5):  136-148.  doi:10.19665/j.issn1001-2400.20240504
    Abstract ( 121 )   HTML ( 3 )   PDF (1764KB) ( 43 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Traditional image segmentation methods perform non overlapping segmentation on images.The image hashing algorithm can only extract features from the pixels inside the image block.However,the simple linear iterative clustering superpixel segmentation algorithm can extract additional shape features while aggregating similar pixels.Therefore,this paper proposes an image hashing algorithm that combines an adaptive grid descriptor and image energy based on simple linear iterative clustering.First,the input image is preprocessed through bilinear interpolation and Gaussian low-pass filtering.Then,simple linear iterative clustering is used to perform superpixel segmentation on the preprocessed image,and an adaptive grid descriptor is applied to extract shape features from the superpixels.Second,pixels within the superpixels have similar brightness characteristics,so the energy values of each superpixel region are calculated based on brightness as the energy feature of the image.Finally,the shape feature sequence and the energy feature sequence are connected.The final hash sequence is obtained by encrypting the connected sequence.Experiments show that the proposed algorithm achieves a good balance between robustness and discrimination.The average operation time and hash length of the algorithm are 0.128 s and 467 bits respectively,which leads to a fast operational speed and a compact hash sequence.In terms of classification performance,when the false positive rate is 0,the true positive rate reaches 0.999 9.In terms of copy detection,both recall and precision are above 95%.In addition,compared with some similar algorithms,the proposed algorithm also has advantages in classification performance and copy detection.

    Fall detection algorithm based on the improved YOLOv8 combined with key points
    WANG Xiaopeng, SHI Huan
    Journal of Xidian University. 2024, 51(5):  149-164.  doi:10.19665/j.issn1001-2400.20240403
    Abstract ( 250 )   HTML ( 8 )   PDF (7965KB) ( 87 )   Save
    Figures and Tables | References | Related Articles | Metrics

    To solve the problems of insufficient feature extraction,a single fall detection method,and weak real-time performance of traditional fall detection algorithms,an improved YOLOv8 fall detection algorithm combined with human skeleton key points is proposed.First,the backbone network of YOLOv8 is replaced by a ShuffleNetV2 network,and the mixed attention mechanism(Shuffle Attention,SA) is added in the neck,so that the model can extract the behavioral characteristics better and realize the static posture matching of a human body.Second,by analyzing the information on position change of skeletal key points,the decline speed of the center of mass,the angle speed between the trunk and the ground and height-to-width ratio of the body are taken as the basis of the fall behavior to improve the accuracy of fall judgment.Experimental results show that the algorithmic accuracy,F1 value,and mAP50 value on COCO Key Points datasets are 78.3%,67.9%,and 70.0% respectively,that the algorithmic accuracy is 95.85%,92.8% and 96.52% on UR Fall Detection,Fall Detection Datasets and self-built datasets,and that the proposed algorithm outperforms the traditional algorithm in distinguishing daily life behavior and falling behavior.

    Aspect-based sentiment analysis of syntactic perception and knowledge enhancement
    CHEN Kejia, ZHANG Yupeng, LIN Hongxi
    Journal of Xidian University. 2024, 51(5):  165-178.  doi:10.19665/j.issn1001-2400.20240701
    Abstract ( 103 )   HTML ( 2 )   PDF (2337KB) ( 44 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In the aspect-based sentiment analysis task,the syntactic dependency parsing of the text is required first,which is highly dependent on the quality of the dependency parsing and does not take into account the lack of correlation between dependency parsing and semantic knowledge.Therefore,a two-channel graph convolution model based on syntactic perception and knowledge enhancement is proposed for the aspect-based sentiment analysis task.Syntax-perception mechanisms are used to learn sentence dependencies in one channel,and knowledge enhancement is performed in the other channel through a knowledge graph,with the outputs of the two channels correlated through an information interaction mechanism,which allows the model to pay more syntactic and semantic attention to important words associated with aspectual words.In addition,a positional attention mechanism is introduced to adjust the score weights of words with respect to the position,which in turn improves the performance of the aspect-based sentiment analysis task.Experiments are conducted on three public datasets,Rest14,Lap14 and Twitter.Compared to other aspect-based sentiment analysis models,this paper’s model shows a more significant improvement in both accuracy and F1 value.Experiments show that syntactic perception and knowledge enhancement can guide the graph convolutional model to perform deeper semantic learning and reasonable weight allocation,thus improving the performance of aspect-based sentiment analysis tasks.

    Cube attack on round-reduced Enhanced-Bivium
    YANG Zelin, DONG Lihua, ZENG Yong
    Journal of Xidian University. 2024, 51(5):  179-188.  doi:10.19665/j.issn1001-2400.20240401
    Abstract ( 88 )   HTML ( 3 )   PDF (827KB) ( 47 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The Trivium Stream cipher is one of the lightweight synchronous stream ciphers that won the eSTREAM project in Europe,which is a simplified version of the Trivium stream cipher for RIFD systems.The designers believe that the Enhanced-Bivium stream cipher algorithm is more secure than the Trivium stream cipher algorithm with the same number of initialization rounds.This article proposes a new cube attack method by introducing an algebraic degree evaluation method in the offline preprocessing stage and a cube attack based on monomial prediction in the online computing stage.With the new method,we can reduce the time complexity of the cube attack on the Enhanced-Bivium stream cipher with 464 initial rounds from 255 to 250.3.At the same time,the number of initialization rounds of successful key recovery attack can be increased from 464 to 601 with the improved cube attack method,and the time complexity is 277.8.Also with the same time complexity,the initial rounds number of successful cube attacks on Trivium stream ciphers can be increased from 799 to 840,which proves that Enhanced-Bivium stream ciphers have better resistance to cube attack than the Trivium stream cipher.

    Special Topic on Collaboration of Communication Resource and Security
    Design and measurement of reconfigurable intelligent surface-aided millimeter-wave coverage enhancement with wide beam
    TENG Xiaokun, MENG Shengguo, CHEN Weicong, TANG Wankai, JIN Shi
    Journal of Xidian University. 2024, 51(5):  189-200.  doi:10.19665/j.issn1001-2400.20241002
    Abstract ( 288 )   HTML ( 6 )   PDF (5137KB) ( 68 )   Save
    Figures and Tables | References | Related Articles | Metrics

    To address the issue of weak signal coverage of the millimeter-wave in wireless communication systems,the method for using the reconfigurable intelligent surface(RIS) to reflect wide beams is proposed,which enhances the signal strength in weak coverage areas.First,an RIS is introduced between the transmitter and receiver,with no direct line-of-sight path between them,to enhance the received signal strength in weak coverage areas.A general electromagnetic wave propagation model for RIS-aided millimeter-wave communication is established,with an analytical expression for the received signal power derived.Subsequently,based on different levels of prior information about the area,a general design framework for the reflection phase shift of RIS is proposed.For the optimization problem of discrete phase shifts of RIS,a heuristic algorithm is employed for efficient optimization.Simulation results demonstrate that the proposed algorithm can synthesize reflection beams with any width based on RIS.Additionally,further optimization based on specific information about the area shape can further improve the millimeter-wave signal coverage performance in the target area.Finally,a radiation pattern measurement system and a RIS-based millimeter-wave communication prototype system are set up.Measurement campaigns are conducted in the 35 GHz frequency band,yielding results that match those in the simulations.Radiation pattern measurement results in an anechoic chamber validate the effectiveness of the wide beam synthesis algorithm.In real-world signal coverage measurements,the signal coverage rate is improved from 1.5% to 90% after deploying RIS and the proposed algorithm,as compared to the scenario without RIS.

    Secure command delivery protocol for drone networks in emergency scenarios
    LIU Luyao, ZHOU Yuchen, CAO Jin, MA Ruhui, YOU Wei, LI Hui
    Journal of Xidian University. 2024, 51(5):  201-216.  doi:10.19665/j.issn1001-2400.20241007
    Abstract ( 199 )   HTML ( 3 )   PDF (2831KB) ( 57 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Drones play an increasingly important role in emergency scenarios.When drones perform long-distance missions,the flight distance is long,which makes it impossible for the ground control center to communicate directly with the drones.Emergency scenarios such as sudden fires and earthquakes require timely instructions to respond.Aiming at the scenario of secure issuance of drone network data instructions in emergency scenarios,a command authority issuance mechanism based on a multi-receiver encryption protocol and a secure instruction issuance mechanism based on proxy signcryption are designed.When the ground control center issues command authority,it issues command authority to several mobile command centers through a multi-receiver encryption protocol and dispatches them to the emergency site.When the instruction is securely issued,the mobile command center sends the signed instruction to the aerial platform which verifies the identity and command authority of the mobile command center and sends the signed instruction to the drone.The drones in the network are pre-configured under the jurisdiction of the aerial platform.The drone verifies the identity of the aerial platform,decrypts and executes the instruction.A security analysis of the scheme is carried out using a variety of methods such as the formal verification tool Scyther,BAN logic and informal security analysis.The results show that the proposed scheme can meet the necessary security requirements.Compared with multiple schemes,the results show that the proposed scheme has a good performance.