HAO Y P,WANG W. Secure cluster routing algorithm for wireless secure communication networks based on group permutation cipher[J]. Microelectronics & Computer,2024,41(7):46-55. doi: 10.19304/J.ISSN1000-7180.2023.0581
Citation: HAO Y P,WANG W. Secure cluster routing algorithm for wireless secure communication networks based on group permutation cipher[J]. Microelectronics & Computer,2024,41(7):46-55. doi: 10.19304/J.ISSN1000-7180.2023.0581

Secure cluster routing algorithm for wireless secure communication networks based on group permutation cipher

  • Considering the low confidentiality of wireless communication network clustering routing algorithms, a secure cluster routing algorithm based on group permutation password is proposed for wireless secure communication networks. Firstly, the improved permutation key matrix encryption algorithm (RKM) is used, the information in the wireless communication network is encrypted using a domino lookup table and byte transformation, and feature transformation factors are interspersed for multiple transformations to complete the wireless communication network encryption. The reverse domino lookup table and self transformation are used to match the feature transformation factors for decryption. Then, based on the encrypted wireless secure communication network, the best cluster head of the network is calculated, and the gravity algorithm is used to calculate the gravity of the cluster head to different nodes by using the cluster head as the particle to complete clustering. The low energy consumption is used as the fitness function of the genetic algorithm to conduct network cluster head election. The cost function is used to optimize the inter cluster jump strategy, select nodes with sufficient energy and good location as high-quality communication routes, and achieve network security and low energy transmission. The experimental results show that the algorithm has high chaos and strong diffusion, which can ensure that wireless communication data is not cracked by others. The algorithm can select the cluster head with the highest number of surviving nodes, and the remaining energy of the network nodes is the highest.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return