郝亚平,王伟.基于群组置换密码的无线保密通信网络安全分簇路由算法[J]. 微电子学与计算机,2024,41(7):46-55. doi: 10.19304/J.ISSN1000-7180.2023.0581
引用本文: 郝亚平,王伟.基于群组置换密码的无线保密通信网络安全分簇路由算法[J]. 微电子学与计算机,2024,41(7):46-55. doi: 10.19304/J.ISSN1000-7180.2023.0581
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

  • 摘要: 鉴于目前无线通信网络分簇路由算法对网络的保密性较低,提出了基于群组置换密码的无线保密通信网络安全分簇路由算法。首先,采用改进置换密钥矩阵加密算法(RKM)对无线通信网络的信息使用多米诺查表加字节变换,并在其中穿插特征变换因子进行多次变换完成无线通信网络加密;使用反向的多米诺查表和自己变换配合特征变换因子进行解密。然后,以加密后无线保密通信网络为基础,计算网络最佳簇头。采用引力算法通过以簇头为质点计算其对不同节点的引力完成分簇,并以低能耗作为遗传算法的适应度函数进行网络簇头选举,结合代价函数优化簇间跳转策略,挑选能量足、位置好的节点,作为优质的通信路由,实现网络安全、低能耗传输。实验结果表明:该算法的混乱性高、扩散性强可以保证无线通信数据不被他人破解;该算法可以选择出节点存活数量最高的簇头,且网络节点的剩余能量最高。

     

    Abstract: 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.

     

/

返回文章
返回