https://orcid.org/0009-0003-1225-8068
Figures
Abstract
In order to optimize the spectrum allocation strategy of existing wireless communication networks and improve information transmission efficiency and data transmission security, this study uses the independent correlation characteristics of chaotic time series to simulate the collection and control strategy of bees, and proposes an artificial bee colony algorithm based on uniform mapping and collaborative collection control. Furthermore, it proposes an artificial bee colony algorithm based on uniform mapping and collaborative collection and control. The method begins by establishing a composite system of uniformly distributed Chebyshev maps. In the neighborhood intervals where the nectar sources are firmly connected and relatively independent, the algorithm then conducts a chaotic traversal search. The research results demonstrated the great performance of the suggested algorithm in each test function as well as the positive effects of the optimization search. The network throughput rate was over 300 kbps, the quantity of security service eavesdropping was below 0.1, and the spectrum utilization rate of the algorithm-based allocation method could be enhanced to 0.8 at the most. Overall, the performance of the proposed algorithm outperformed the comparison algorithm, with high optimization accuracy and a significant amount of optimization. This is favorable for the efficient use of spectrum resources and the secure transmission of communication data, and it encourages the development of spectrum allocation technology in wireless communication networks.
Citation: Zhang J, Wang H, Wang X (2024) Application of artificial bee colony algorithm based on homogenization mapping and collaborative acquisition control in network communication security. PLoS ONE 19(7): e0306699. https://doi.org/10.1371/journal.pone.0306699
Editor: Tinggui Chen, Zhejiang Gongshang University, CHINA
Received: February 26, 2024; Accepted: June 23, 2024; Published: July 10, 2024
Copyright: © 2024 Zhang et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All relevant data are within the manuscript and its Supporting information files.
Funding: The research is supported by Scientific research project of Education Department of Jilin Province, Research on mathematical model and platform construction of 5G+ intelligent teaching (Project No. JJKH20230185KJ); Scientific research project of Education Department of Jilin Province, Research on the Training of Diversified Applied Talents of Radio and Television Editors and Directors in the Era of Big Data (Project No. JJKH20230180SK). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.
Competing interests: The authors have declared that no competing interests exist.
1. Introduction
As network communication security continues to evolve and the sophistication of network attack methods increases, the importance of ensuring the integrity and confidentiality of information has become paramount. In this context, wireless communication represents an indispensable component of network communication, and its security is directly related to the secure transmission and storage of information. It is therefore crucial to resist the increasing frequency and complexity of network threats and ensure the secure transmission of information [1–3]. Therefore, wireless communication has become a top priority in network security strategy. In wireless communication, reasonable radio spectrum allocation (SA) can allocate signals to a frequency band, ensuring that different wireless devices and systems do not interfere with each other in the spectrum, and enhancing the anti-interference ability of communication networks [4, 5]. By properly managing and planning the use of radio spectrum, interference and conflicts in wireless communication can be reduced, congestion and signal attenuation can be eliminated, network communication reliability and stability can be improved, and data transmitted in wireless networks can be protected from potential threats and attacks. However, in recent years, with the increasing number of wireless communication application scenarios, the complexity and difficulty of SA technology have also increased. Among them, the rapid growth of RF equipment has led to a more complex electromagnetic spectrum (ES) space, where traditional and non-traditional security issues are intertwined. In this case, traditional SA methods suffer from low efficiency and are prone to getting stuck in local optima, which poses certain challenges in network security and communication data protection. To overcome these challenges, innovative solutions need to be sought.
In recent years, the development of computer technologies such as machine learning has brought new opportunities to it. Combining machine learning, artificial intelligence, and other cutting-edge technologies can cleverly allocate spectrum resources, improve bandwidth utilization, and thus help to better utilize spectrum resources. Among them, artificial bee colony (ABC) is a new global optimization algorithm based on swarm intelligence, and its intuitive background comes from the bee colony’s honey harvesting behavior [6]. The ABC algorithm has simple parameter settings, high optimization accuracy, and good optimization performance, making it suitable for SA in communication networks. By simulating the foraging behavior of bees, ABC first models the SA problem as an optimization problem, with each frequency band or channel as a decision variable, with the objective function of maximizing network capacity, minimizing interference, or minimizing energy consumption. Then, The ABC algorithm searches and finds the optimal SA scheme by continuously updating the position and state of individual bees. However, traditional ABC algorithms also have certain limitations, such as limited search capabilities. Consequently, it is imperative to enhance and refine it in order to more effectively align with the SA necessities of wireless communication networks. Therefore, this study utilizes Chebyshev chaotic mapping to improve the initialization of the ABC algorithm, enhance its search ability, and introduce a new domain search strategy. Through centralized community search, the global optimal solution probability algorithm is improved, and the efficiency and quality of the algorithm’s solution are improved.
The innovation points of this study include: (1) To improve the search ability of the ABC algorithm, the initialization method of the ABC algorithm based on Chebyshev chaotic mapping is improved. (2) A new domain search strategy has been proposed to concentrate the neighborhood search range and avoid the lack of potential optimal solutions.
The study proposes an application scheme based on an improved ABC algorithm in network communication security. This brings new solutions to the field of SA in wireless communication networks, which has important theoretical and practical value. The principal findings of the research are as follows:
- The initialization method of ABC algorithm was improved based on Chebyshev chaotic mapping, enhancing search capability.
- A new domain search strategy was proposed, which concentrates the neighborhood search range and avoids missing optimal solutions.
- By improving the ABC algorithm, the problems of low efficiency and susceptibility to local optima in traditional SA methods were solved.
- The technology is designed to enhance the efficiency and quality of SA in wireless communication networks. It is also expected to improve the secure transmission of communication data.
- Provided new theoretical value and explored the application prospects of ABC algorithm in network communication security.
There are four sections to this study. The second section is a review of the literature. It will cover the ABC algorithm’s earlier results. The research technique is the third portion, and this is where it is explained how the research advances the ABC algorithm. The outcome analysis is the fourth section, where the upgraded ABC method will be empirically validated.
2. Related works
With the advent of the information age, people’s learning and life have become increasingly rich, and interdisciplinary interoperability learning has become the mainstream of research in today’s society. it is on this premise that ABC was introduced and developed, inspired by the behavior of groups of organisms, and has already produced many research results in various fields. M. Xu et al. proposed a linear spectral mixing model guided ABC to solve the hyperspectral solution problem for image data. Each employed bee in this algorithm is guided by the Linear Spectral Mixing Model to search for the food source location. Experimental results showed that the algorithm designed in this study can improve the overall end-element extraction accuracy [7]. A. Tayyab et al. proposed a mixed-integer linear programming model with two-stage integrated programming for planning the operating theatre usage time. To solve the model, the study was based on genetic algorithm and ABC of genetic ABC. Experimental results showed that the algorithm can solve the best result in a shorter time and the quality of its solution is better than other comparative algorithms [8]. J. Q. Li et al. proposed a hybrid ABC to solve the parallel batch distributed flow shop problem. The algorithm proposes batch allocation and right-shift heuristics to improve the maximum completion time for a specific problem, and also designs five types of local search operators for the distributed flow shop and parallel batch phases. In order to collect useful information about global and local optimal solutions, a new scout bee heuristic algorithm is investigated to improve the search performance. The algorithm was experimentally verified to have high solution quality and diversity of populations, which is superior to the comparison algorithm [9]. The ABC algorithm was improved by H. Gao et al. To use multivariate and univariate updating mechanisms for indivisible and divisible functions, respectively, an improved link identification strategy was embedded into ABC by detecting links between variables more efficiently. The study then proposed a new approach that takes into account the historical experience of the population, a new strategy for initializing scout bees and an individual update strategy. Experimental results showed the effectiveness of the algorithm [10]. T. X. Ma et al. addressed the problems of slow convergence and easy to fall into local minima of previous algorithms for DC distribution network fault localization by using an improved ABC sticky bacteria algorithm. The algorithm combined the sticky bacteria algorithm and the ABC algorithm. The ABC algorithm was introduced into the improved sticky bacteria algorithm to enhance the algorithm’s ability to escape local minima. The experimental results demonstrated that the algorithm is both efficient and robust.
For network communication systems, Z. Pang et al. proposed a new predictive controller design scheme. The algorithm fully considered the delay, the confusion of data packets and the loss of data packets caused by the randomness of the network. The necessary conditions for the generated closed-loop system are established, which are less conservative and did not depend on the two-channel random communication limit. Through computer simulation, the effectiveness of the proposed algorithm was proved [12]. J. Zhang et al. examined the potential for integrating communications and radar/radio sensing (JCAS) functions within a mobile network environment. The authors reviewed previous work on the coexistence of communications and radar systems, highlighting their limitations in addressing interference problems. They then proceeded to introduce JCAS techniques. The study finally identified key open research questions and shared some lessons learned [13]. W. Wei et al. considered dynamic environmental factors such as ocean currents, wind and communication delay to construct a target hunting system consisting of multiple unmanned underwater vehicles and a highly maneuverable target. The system included an improved multi-agent reinforcement learning to facilitate network communication under high-energy flow and sound propagation delay constraints. The simulation results showed that the proposed scheme had superior performance in terms of reward and success rate [14]. M. Meena et al. proposed a collaborative spectrum sensing method for cognitive radio networks based on orthogonal frequency division multiplexing, with the objective of improving data transmission efficiency. The method employed proficient spectrum sensing and resource allocation, dynamic slot allocation, and two-stage multi-slot channel allocation techniques to reduce interference and minimize sensing errors. By utilizing the EKKT conditions for resource allocation, interference with primary users was avoided, resulting in the achievement of high transmission rates. The efficacy of the proposed method was extensively validated in the NS-3.26 simulation tool, with performance indicators such as throughput, capacity, network utility, transmission power, and transmission rate being evaluated. The results demonstrated that the method enhanced network communication security and spectrum resource utilization [15]. M. Le et al. proposed a joint resource allocation method based on the whale optimization algorithm, with the objective of maximizing the throughput of device-to-device communication networks with non-orthogonal multiple access. This method considered NOMA user clusters, power control, and D2D mode selection. It mitigated interference to cellular network users by moving D2D users to unauthorized frequency bands. The efficacy of this approach in enhancing network capacity and guaranteeing service quality had been substantiated through simulation outcomes, thereby offering novel insights for optimizing D2D communication and ensuring network communication security [16].
Table 1 shows the list of literature reviews for this study.
In conclusion, there are numerous examples of ABC applications to things that have a single, unrestricted, continuous, and deterministic aim. In order to increase the swarm algorithm’s application efficiency to a greater extent, this research will concentrate on extending the swarm algorithm’s application to the field of spectrum resource allocation with discrete, complex objectives, numerous constraints, and uncertain dynamics.
3. ABC based on HM and CAC
This chapter is divided into two subsections, the first one will construct the Chebyshev chaotic mapping system with homogenized distribution, and the second one will propose a collaborative ABC by exploiting the independent correlation property that chaotic time series have to mimic the honeybee’s collection control strategy.
3.1. Improvement of initialisation method based on homogenised Chebyshev chaos mapping
The ABC algorithm is an optimized search method that mimics the honey picking behavior of natural bees. The honeybee community divides honeybees into three categories: leader bees, follower bees and scout bees. Each of them has its own role and communicates and shares information about the quality of the nectar to find where the nectar source with the highest quality is located. During each search, the leader and follower bees are exploiting the food source successively, i.e., searching for the optimal solution. The scout bees observe whether they are trapped in a local optimum, and if they are trapped in a local optimum, they randomly search for other possible food sources. Each food source represents a possible solution to the problem, and the amount of nectar from the food source corresponds to the quality (fitness value) of the corresponding solution. The ABC algorithm is simple in parameter setting, has high accuracy in finding the optimal solution, and has good optimization performance, so the study will be based on ABC for communication network SA [15, 16].
The pseudo-code for the ABC algorithm is shown in Fig 1.
The flow of the ABC algorithm is shown in Fig 2, where first the population is initialized, i.e., each parameter is initialized, then the fitness of each initial solution is calculated and evaluated and the loop conditions are set and the loop is started. The leading bee performs a neighborhood search on the solutions to generate new solutions (food sources) and calculates their fitness values. Then greedy selection is performed and if the fitness value of the food is better than the initial solution, the initial solution is replaced and the probability of the food source is calculated again. The follower bee selects a solution or food source according to probability and searches to generate a new solution (food source) and calculate its fitness. The following bee will also make a greedy choice to replace the new solution. The scout bee then determines if there is a solution to be discarded. If there is, the scout bee randomly generates a new solution to replace it and records the optimal solution so far, and loops the above steps until the loop termination condition is satisfied [17, 18].
Despite the above advantages, the swarm algorithm still suffers from problems such as early convergence and tendency to fall into local extremes [19, 20]. To enhance the search capability of the ABC algorithm, the study will firstly improve the initialization method of the ABC algorithm based on Chebyshev chaotic mapping. The incorporation of Chebyshev chaotic mapping into the ABC algorithm enables the independent correlation property of chaotic time series to be exploited, thereby emulating the honeybee’s collection control strategy and iteratively generating uniformly distributed feasible solutions with correlation. This approach is conducive to the swarm’s traversal search for the optimal solution [21–23]. Chebyshev mapping is a mapping parameterized by order k. It originates from the expansion of the cosine and sine functions of a multiplicity of angles, and is a special class of functions in computational mathematics, which is a typical representative of chaotic mapping. The expression of Chebyshev mapping is given in Eq (1).
When k ≥ 2 and is an integer, regardless of how close the initial values are chosen, the iterated sequence is uncorrelated, meaning it is chaotic and traversal within this range. Therefore, when k ≥ 2 and is an integer, it indicates that the mapping system is in a chaotic state. The probability density function ρ(x) of Chebyshev mapping is shown in Eq (2).
The image of this function is shown in Fig 3, and the probability density distribution of the Chebyshev mapping is U-shaped with the distribution characteristic of bimodal peaks at the boundary of the value domain. In order to meet the demand for uniform distribution of sequences in optimization theory, the Chebyshev mapping probability density function is combined with mathematical derivation, and the resulting random variable function is compounded with the original mapping level to form a new system [24, 25]. The new system will have good uniform distribution properties, traversal properties, balance and low complexity, with small random errors and high similarity of the resulting sequences. Such a system can be applied to the initializing population stage in the optimization algorithm to improve the distribution of the original sequence.
In the interval (−1,1), let there exist a random variable Y = h(X) whose distribution function is DY(y). h(X) is a continuous monotonically differentiable function, and let its inverse function be j(y). The value of DY(y) is 0 when y ≤ −1, and 1 when y ≥ 1. The value of DY(y) is given in Eq (3) when −1 < y < 1.
Derivation of both sides of Eq (3) yields the probability density function of Y in Eq (4).
In Eq (4), d denotes the distance. According to the definition of uniform distribution, the probability density of Y is Eq (5).
In Eq (5), a and b are two constants and f(x), h(x) ∈ C[a,b], C is an interval with upper and lower bounds a and b. -1 and 1 are the upper and lower limits of function f(x), h(x) ∈ C[a,b], so if the values of a and b are -1 and 1 respectively, Eq (6) can be obtained.
Solving this differential equation yields Eq (7).
From Eq (7) the equation in Eq (8) can be obtained
(8)
Substituting Eq (1) into Eq (8), the Y that inversely obeys a uniform distribution in interval [−1,1] can be obtained, which is shown in Eq (9).
Based on the above derivation process, the study constructs a composite system of Chebyshev mapping with uniformized distribution as shown in Fig 4. This system has the derived random variable function compounded with the original Chebyshev mapping, which can satisfy the demand of uniformized distribution.
3.2. CAC-based neighborhood search strategy improvement
Behavior of honey bees mainly includes gathering, migration and splitting, etc. Their flying ability is important in determining whether the nectar source is reliable or not and determining the location of the hive. The feeding behavior of honey bee colony is shown as going from far to near, and its range of feeding mainly depends on the source of honey, which is more, but the range of feeding is smaller [26, 27]. When the honey source decreases, the range of feeding increases. The closer the distance between the hive and the nectar source, the more nectar can be collected. When there is a large amount of honey on the outside, they exchange information with the bees in the hive. The effect of single honey collection varies greatly among bees from different regions and different sources. In ABC, the observation bee initiates a local search around each honey source based on the nectar source identified by the collecting bee. This occurs after the initial step of nectar source initialization is achieved. The observation bee then constructs a relatively independent interval for searching in the neighborhood of the nectar source. The way in which the nectar collecting bee X(n) of generation n searches for a new location in the neighborhood of the current location is shown in Eq (10).
In Eq (10), rand is the Rand function that generates the random numbers. k,i is the randomly generated location of the calibrated initialized nectar source. Randomly generated nectar source locations in this way are likely to be missing a portion of the neighborhood of the potentially optimal solution, making the range of neighborhoods more dispersed and not concentrated near the most adaptive nectar source [28]. Therefore, the study proposes a new domain search strategy. In a bee colony, the bees show a non-linear search pattern from near to far, and if there is an abundant nectar source within the colony, it will stimulate the bees to leave the nest actively to forage for food, and the flying distance of the colony is related to the abundance of the nectar source [29]. Within a set number of iterations, two nectar sources before and after the deterministic nectar source are taken as the neighborhood, and the new neighborhood search is shown in Eq (11).
In the ABC algorithm, the behavior of bees is rigid, they stop after a certain stimulus until they have completed their task. In other words, bees show relative specialization at different times. Therefore, honey harvesting bees can motivate observer bees to come out of the hive to collect on their own initiative and also to collect honey near the same nectar source [30–32]. In response to the singularity of honey harvesting behavior and the continuous accumulation of scattered honey during the honey harvesting process, the study proposes a homogenized chaotic optimization algorithm, which mainly exploits the randomness and ergodicity of chaos to optimize the search. Chaotic optimization algorithms can directly introduce chaotic variables into the objective function to carry out the search. Its search process unfolds in accordance with the law of motion of chaos itself, and does not require restrictions on the objective function and constraints such as continuity and microscopicity, nor does it need to be similar to partially stochastic algorithms. It can jump out of the locally optimal feasible solution by doing probabilistic selection according to some strategy. So chaotic optimization algorithms have a greater advantage in jumping out of the local.
According to the characteristics of homogenized Chebyshev mapping, the study proposes a strategy for generating sequences of Chebyshev mappings for searching [33, 34]. The steps of this strategy are firstly, according to the number of variables, set the range of initial values x1,x2,…xn initial values and the maximum number of iterations N of the homogenized Chebyshev mapping, and generate different chaotic motion trajectories to get the corresponding chaotic variables y1,y2,…,yn by constant iteration. If there are constraints, put the selected j chaotic variables into the set constraints, and then use Eq (12) to map the chaotic variables to the objective function in the interval [ai,bi] to get the new chaotic variables.
Then the correspondence between the value domain of the homogenized Chebyshev mapping and the optimized objective function [ai,bi] is constructed, and the traversal search is carried out iteratively many times using the iterative values of the iterative values of the homogenized Chebyshev mapping generating chaotic sequences [35, 36]. When the optimal solution is found, the optimal solution remains unchanged before proceeding to the next step of the search, otherwise, the construction of the correspondence continues. On this basis, the search is repeated for the parameters that have been solved and ends when the constraints are satisfied. The traversal optimization algorithm based on homogenized higher-order Chebyshev mapping is able to take full advantage of its completeness and homogeneity in the value domain space. The nonlinear dynamic properties of chaotic systems enable fast and efficient solution of nonlinear generalized optimization problems, and make them jump out of the local minima and adjust the late oscillations to achieve the global optimum. In addition, this method only needs to set the parameters such as initial value, iteration number, and order to run, which makes the method simpler compared to the traditional methods.
Based on the above results, the study constructed ABC based on homogenized mapping (HM) and collaborative acquisition control (CAC). The flow of the algorithm is shown in Fig 5. Firstly, the algorithm parameters are initialized, i.e. logo defines the global variables, number of colony sizes, maximum number of iterations, maximum number of nectar source collections, initial value of the hybrid mapping, number of hybrid mapping traversals N, etc. The sequence of different trajectories generated by the homogenized Chebyshev mapping is then used to obtain a uniformly distributed initial honey source. Within the set number of iterations, the subtraction of two adjacent values of the feasible solution is taken as the neighborhood, retaining the value of the same nectar source obtained by the honey harvesting bees (i.e., the value of the fitness). Using the new neighborhood search strategy, the value of the fitness function is calculated to determine whether honey is retained or not, and the fitness of the new feasible solution is calculated. Then calculate the selection probability of the observation bee. The observation bee is transformed into a honey harvesting bee and performs a neighborhood search, at which time another chaotic neighborhood search operation is performed to select the nectar source according to the greedy law. The scout bee searches for a new honey source to replace the one that exceeds the neighborhood search limit number of times according to the chaotic search until the iterative termination condition of the algorithm is reached.
According to the algorithm process and description in Fig 5, the complexity of the proposed model is as follows: parameter initialization is O (1), initial honey source generation is O (N), neighborhood search, greedy selection, and chaotic search are all O (N*T), and iteration termination condition check is O (T). Consequently, the total complexity of the model is approximately O (N2*T), where N is the population size and T is the maximum number of iterations. This reflects the overall computational complexity of the joint implementation of block segmentation and CAC.
The improved ABC proposed in the study has improved the search performance, but in order to improve the security of the communication network, a parallel spectrum security allocation strategy is proposed in addition to this. The flow of this strategy is shown in Fig 6, when there is a communication service in the network, it is determined whether it is a secure service or an ordinary service, and the spectrum of these two services is searched and allocated separately. The ordinary service is avoided from the secure link spectrum, and when there are available spectrum resources, the spectrum of the ordinary service is searched and allocated by the improved bee colony algorithm. The service is blocked when there are no available spectrum resources. The secure service performs the same operation. This policy makes the normal service to be transmitted on the normal link and the secure service to be transmitted on the secure link to ensure that the data is not eavesdropped. The secure and normal topologies occupy mutually exclusive network resources respectively. The secure and normal services use the secure topology and normal topology to calculate the SA scheme and configure the devices in parallel, respectively.
In order to objectively test the performance of the improved ABC in this study, a number of different functions will be selected for the study. These functions include the Sphere function, the Rosenbrock function, the Rastrigin function, the Griewank function, the Bohachevsky function, and the Branin’s rcos function. The 3D images of these functions are shown in Fig 7. Due to its simplicity, the Sphere function can be used to test the convergence rate of an algorithm and the accuracy of the optimization. The Rosenbrock function is non-convex and has local minima, so it is widely used to estimate the convergence rate of an algorithm and the accuracy of the optimization search. The Griewank function has multiple deep local minima and its distribution is in the form of a sinusoid, which causes it to be prone to falling into local mechanisms. The Bohachevsky function itself presents a non-linear multimodal function property, which has jumping peaks. It is prone to fall into local mechanisms. The Bohachevsky function itself presents a nonlinear multimodal function property, and its peaks are presented with jumps. The search space is open, with one global optimum and multiple local optimums, and the goal is to test the global search ability of the algorithm. Branin’s rcos function has a canvas-like structure, with low gentle gradient, and is prone to produce multiple minima, which can be applied to the analysis of population diversity.
4. Analysis of experimental results of improved bee colony algorithm
4.1 Experimental setup
- (a) Simulation design. This study conducted simulation experiments on the ABC algorithm based on HM and CAC on the Matlab 2022 platform. The objective is to test the performance of the algorithm in terms of convergence speed, optimization search accuracy, optimization speed, and population diversity. The experiment first verified the uniform distribution effect of the Chebyshev mapping composite system with uniform distribution. It then compared the performance based on different optimization algorithms [37].
- (b) Dataset. The dataset utilized is the airfoil self-noise dataset from the UCI machine learning library, which encompasses five attributes and a single target attribute. In the experiment, the dataset is divided into a training set and a testing set for the purpose of verifying the performance of the algorithm.
- (c) Parameter specification. The selection of algorithm parameters in the experiment is based on optimization efficiency and algorithm performance to ensure balanced performance under different conditions. In all experiments, the population size of the four algorithms is set to 100, the number of iterations is 1000, and the dimension of the bee colony algorithm is 30. The learning factors C1 and C2 of the IABC algorithm are both set to 2, the total number of particles is 200, the upper and lower limits of the population are set to 5 and -5, and the initial speed is set to 1. The number of bees collected and observed is 50. The initial size of the ABC-KF algorithm’s bee colony is identical, and the neighborhood search is constrained to 300 iterations. The initial value of the Chebyshev map is 0.35, and the number of chaotic iterations is 500.
- (d) Development of performance indicators. To assess the efficacy of the algorithm, a number of key performance indicators are selected, including convergence speed, optimization search accuracy, optimization speed, and population diversity. In terms of data distribution, exponential entropy, approximate entropy complexity, discrete entropy, and Kolmogorov entropy are employed for comparison. It is also necessary to draw statistical histograms for each system in order to display the numerical distribution of the output sequence.
- (e) The reproducibility of the proposed work. To address the crisis of machine learning reproducibility, research has provided a repository of implementation code and datasets based on HM and CAC ABC technology, linked to: https://github.com/ExampleRepository/ABC-HM-collaborative acquisition control. This library contains comprehensive environmental configurations, experimental codes, datasets, minimal examples, and result comparisons, which facilitate the accurate reproduction of results by researchers.
- (f) Baseline method. This experiment compares the proposed algorithm with several other similar performance systems, including subspace assisted fault-tolerant control (SAFC), block cipher hardware system for three-dimensional chaotic graphs (3D-CGBC), multi image encryption system based on single channel scrambling, diffusion, and chaotic systems (MIE-SSDC), improved artificial bee colony algorithm (IABC), and knowledge fusion based artificial bee algorithm (ABC-KF). Compare and test the following functions: the Sphere function, the Rosenbrock function, the Rastrigin function, the Griewank function, the Boachevsky function, and the Branin’s rcos function.
4.2. Performance tests for composite systems of Chebyshev mappings with homogenised distributions
To evaluate the effectiveness of various improvement strategies in the proposed method, the study first conducted ablation experiments and compared them using a range of indicators, including the degree of approximation of the optimal solution, average fitness value, convergence speed, and convergence time. The results of the ablation experiment are presented in Table 2. The ABC+Chebyshev chaotic mapping has a significant improvement in approximating the optimal solution and reducing the average fitness value compared to the basic ABC algorithm. The utilization of Chebyshev chaotic mapping as an initialization method allows for a more effective guidance of the search space, resulting in an initial population that is more closely aligned with the optimal solution. This, in turn, expedites the convergence speed and reduces the average fitness value. The combination of ABC, Chebyshev chaotic mapping, and collaborative collection has been demonstrated to further enhance performance. This method not only incorporates the advantages of Chebyshev chaotic mapping but also introduces a collaborative acquisition strategy, thereby accelerating convergence speed and further reducing the average fitness value. The data indicates that the strategy achieved performance that is closer to the optimal solution within 200 iterations and had higher accuracy (94.3%), suggesting that the introduction of the improved strategy has a significant impact on enhancing the efficiency and accuracy of the ABC algorithm.
Compare the proposed system with similar performance systems, such as the subspace assisted fault tolerance control (SAFC) proposed in reference [21], the block cipher hardware system for 3D chaos graph (3D-CGBC) proposed in reference [22], and the multi image encryption system based on single channel scrambling, diffusion, and chaotic systems (MIE-SSDC) proposed in reference [23]. The system proposed by the research institute is suitable for applications that require good numerical uniformity and stability, particularly in algorithms involving initial value setting, where the output sequence of the system exhibits approximately linear distribution characteristics. In order to illustrate the numerical distribution of the output sequences of the homogenized distribution system, the statistical histograms of each system are plotted. Information entropy, approximate entropy complexity, discrete entropy and Kolmogov entropy are then chosen for comparison.
The statistical histograms of each system are shown in Fig 8. SAFC and 3D-CGBC produce chaotic sequences with a U-shaped distribution with a double peak at the boundary, while the MIE-SSDC produces chaotic sequences with a W-shaped distribution with three towering peaks. The system in this study exhibits an approximately linear distribution, and its uniform distribution characteristics become more obvious when the numerical distribution intervals are all [−1,1]. The results show that the system has good numerical uniformity and can provide more uniform initial values for the improved ABC.
The number of iterations of the chaotic mapping is set to 50000, and different numbers of intervals are set before and after the equilibrium optimization in order to obtain the information entropy and the maximum information entropy. Then several different sequence lengths are selected, and k is taken to be 2 on average, and the initial value of 0.3 is set to solve the approximate entropy. The approximate entropy algorithm is used to measure the complexity of the chaotic sequence, the larger the value of the approximate entropy, the higher the complexity of the chaotic sequence. The information entropy and approximate entropy complexity of each system are shown in Table 3. Information entropy is a characteristic parameter that can measure the degree of sequence chaos, it can be used to characterize the degree of uncertainty of the source, in a variety of generated signals, the use of information entropy for comparison, can come to reflect the simulated signals may occur in the average uncertainty of the situation. In Table 3, the information entropy in each system increases with the number of intervals, and there is little difference between the other three systems. Whereas, the information entropy of the system in this study has the largest change and is very close to the maximum value. The approximate entropy of the MIE-SSDC is similar to that of the system in this study, which is basically unchanged, yet it is very different from that of the SAFC. This is mainly due to the high homogeneity of the sequences generated by this system, which makes its own values more average and thus reduces the computational complexity. Therefore, the evaluation of the information entropy and approximate entropy can be used to better show the effectiveness of the system in this study in processing the uniform distribution of the generated sequences.
The equilibrium of the output sequences of the four systems is modeled using a binary quantization method. Fifty different initial values are randomly selected from the generated sequences and the decision threshold is set to 0. The equilibrium averages are calculated and plotted and the results are shown in Fig 9. In Fig 9 that the SAFC tends to oscillate with a decreasing and then an increasing curve when the length of the sequences is less than 100, whereas after the length of the sequences is greater than 500, the curve tends to be closer to one. The equilibrium mean of 3D-CGBC starts to shrink after the sequence length exceeds 100 and starts to converge to 0 only around 3500. However, the equilibrium curves of both the system of this study and the MIE-SSDC show similar fluctuations when the sequence length is below 500. After the sequence length exceeds 500, they both show a tendency to stabilize as the sequence length increases, with the MIE-SSDC’s mean value being closer to 0.
4.3. Results of algorithm performance test
This is a comparative experiment to compare the performance of the algorithm proposed in this study with an IABC proposed in literature [24] and ABC-KF proposed in literature [25]. The performance of the algorithms is compared. The test functions are Sphere function, Rosenbrock function, Rastrigin function, Griewank function, Bohachevsky function, Branin’s rcos function. In the experiments, the population size of all three algorithms is set to 100, the number of iterations is 1000, the dimension of the swarm algorithm is 30, and the upper limit number of neighborhood searches is 300. 50 honey harvesting bees and 50 observation bees are included. The homogenized Chebyshev mapping for chaotic dynamic search used by the algorithms in this study for initializing the colony individuals and neighborhood traversal search has an initial value of 0.35 and the number of chaotic iterations is 500.
In the ABC algorithm, the selection of hyperparameters directly affects the search ability, the speed of convergence and the quality of the final solution. The hyperparameters of ABC algorithm mainly include the population number of bees, the ratio of employed bees to following bees, the limit parameter (limit), etc. The strategy of hyperparameter value should consider the following points: must balance exploration and development, ensure the diversity of algorithm and avoid premature convergence. Reasonable population size can both remain exploratory and avoid resource waste. The proper setting of the limit parameters helps to break away from the local optima and enhance the global search. Optimizing the hyperparameters can significantly improve the performance of the algorithm in solving complex problems, speed up the convergence, and improve the quality of the solution and search stability.
In the experiment, the convergence curves of each algorithm are shown in Fig 10. Among them, the initialization method used in this study is a homogenized chaotic mapping system, so the algorithm approached the optimal reference value in 200 iterations, and its convergence speed is faster than IABC. At 200 iterations, although the convergence curve of IABC has become smooth, more searches are needed because the optimal value of the convergence curve has not been found during the iteration. In addition, ABC-KF outperforms the other two algorithms in terms of convergence performance, and can reach convergence values within an evolutionary algebra of 200. The main reason why ABC-KF achieves convergence faster is that the initialization method adopted by ABC-KF is homogeneous chaotic mapping system, which can better control the search space and make the initial population closer to the optimal solution. Therefore, in the iterative process, ABC-KF can find a better solution faster, thus speeding up the convergence speed. In addition, ABC-KF algorithm may have better search strategy and update mechanism. This accurate estimation and updating mechanism helps ABC-KF to find better solutions faster and speed up the convergence rate. However, because it is prone to premature convergence, it cannot guarantee the search for the global optimal solution. By analyzing the convergence of the previous step and the maintenance of the convergence of the second step, effective ways to improve the convergence of the next step are revealed. The algorithm in this study approximated convergence in the first stage and remained stable after convergence in the second stage, indicating that the improved method is effective in improving the convergence of the ABC algorithm.
Fig 11 shows the PR plots of the three algorithms under different functions. According to the figure, the PR curves of the three models decrease. The area under the PR curve of the proposed model is higher than that of the other three models. The results show that the proposed method outperforms the other two models with six test functions. Furthermore, the impact of distinct testing functions on each algorithm is somewhat disparate. In summary, the method proposed by the research institute has demonstrated notable enhancements in performance consistency and robustness, particularly in scenarios involving substantial parameter variations, exhibiting enhanced robustness. This further substantiates the efficacy and superiority of the proposed improvement strategy in optimizing tasks.
Table 4 presents the results of the Friedman test, which demonstrate the superiority of the proposed method in comparison to other methods. The results of the Friedman test indicate that the proposed method performs well in Sphere. Furthermore, the performance of the Rosenbrock and Rastigin functions is significantly better than that of other reference algorithms [38, 39]. In particular, with regard to the Sphere function, the average ranking of this method is 1.00, which demonstrates a significant advantage over the average rankings of 2.67 and 3.33 in References [23, 24], respectively. The average ranking of the proposed method on the Rosenbrock and Rastigin functions is 1.33, which is significantly better than the average ranking of the two reference algorithms. This difference is statistically significant (p<0.05). These results validate the superiority of the proposed model in different evaluation metrics and optimization tasks, indicating its superior optimization performance.
The results of Griewank function, Bohachevsky function and Branin’s rcos function are shown in Table 5. For all three functions, the algorithm of this study performs well in terms of accuracy and stability of the results of the optimal values searched. Especially for Bohachevsky, the mean square deviation of this study’s algorithm is 0. For the other two functions, the mean square deviation of this study’s algorithm is 3.423 and 1.797, respectively, which are smaller than the other two algorithms. Therefore, the algorithm proposed in this study is more excellent in terms of optimality seeking performance and effectively overcomes the problems of algorithm convergence, global and local optima.
4.4. Analysis of the effects of algorithm application
Simulation experiments are carried out in a wireless network of 8 nodes to apply the three algorithms to SA, in this study the algorithms are optimized and then allocated using a parallel security policy. The nodes of the network where the experiments are conducted are distributed over an area of 400km2, the maximum transmit power of the nodes is 10 W, and the network has six reusable channels, each with a bandwidth of 20kHz. the experiments compare the throughput, packet loss, percentage of secure services eavesdropped, and spectrum utilization of the allocation results of the algorithms. The throughput comparison is shown in Fig 12, in terms of the overall network throughput, the allocation method given by the algorithm in this study has a rate of more than 300 kb/s, which is slightly advantageous compared to the other two algorithms.
The result of the packet loss comparison is shown in Fig 12, the total packet loss of the network for the allocation scheme of this research algorithm is slightly lower than the other two methods. At network node 1 and network node 2, the packet loss of this research method is 0. At all other nodes, the packet loss of this research method is slightly less than the other methods. It can be concluded that this research method can improve the transmission integrity of communication data to a greater extent. Meanwhile, the proposed scheme by the research institute can ensure the transmission of high priority information at the cost of sacrificing low priority information, reducing the complexity of the scheme and greatly improving the overall operational efficiency of the model.
The results of the packet loss comparison are presented in Fig 13. The total packet loss of the allocation scheme network of this research algorithm is slightly lower than that of the other two methods. At network nodes 1 and 2, the packet loss of this research method is 0. At other nodes, the packet loss of this research method is slightly smaller than that of other methods. It is evident that the research method in question has the potential to significantly enhance the integrity of communication data transmission.
The spectrum utilization and the percentage of security services being eavesdropped are shown in Fig 14. The allocation result given by the algorithm of this study has the highest spectrum utilization and less percentage of security services being eavesdropped. The spectrum utilization of this research method improves with the increase of network load up to 0.8. The eavesdropping of security services of this research method is below 0.1 in all network nodes. It can be seen that this research method can improve the spectrum resource utilization and ensure data security to a greater extent.
4.5. Impact analysis
The experimental results presented in the study demonstrate that the proposed improvement method exhibits notable advantages in multiple domains. Firstly, in approaching the optimal solution and reducing the average fitness value, it can be observed that both the ABC+Chebyshev chaotic map and the ABC+Chebyshev chaotic map+collaborative collection have demonstrated a significant improvement in comparison to the basic ABC algorithm. This is attributed to the effective initialization of the Chebyshev chaotic map and the introduction of collaborative collection strategies. Secondly, in terms of the uniformity of numerical distribution, the proposed system demonstrates good performance and is suitable for algorithms that require uniform distribution of initial values, such as the improved ABC algorithm. Moreover, in the comparison of information entropy and approximate entropy complexity, the system in this study demonstrated notable efficacy in the uniform distribution of generated sequences. Finally, the proposed algorithm also demonstrates superior performance in terms of communication network performance, including throughput and packet loss rate. Reference [40] proposes a non system weighted satisfiability method using Binary Artificial Bee Colony Optimization (BABC) in discrete Hopfield neural networks. Research has shown that this method has significant advantages in solving non system weighted satisfiability problems [40]. This study further improves the efficiency and accuracy of the BABC algorithm by introducing Chebyshev chaotic mapping and collaborative collection strategies in approximating optimal solutions, uniformly distributing numerical values, and improving communication network performance. Moreover, in terms of computational complexity analysis, the proposed method exhibits high efficiency. Despite the implementation of Chebyshev chaotic mapping and collaborative collection strategies, the improvements did not result in a notable increase in the algorithm’s time complexity. Conversely, by optimizing the search space and enhancing the collection strategy, the convergence rate and overall performance are improved, which is particularly crucial for large-scale optimization problems. In summary, the proposed improvement method has made significant progress in multiple aspects, improving the efficiency and accuracy of the algorithm, and is suitable for various application scenarios.
5. Conclusion
To optimize the allocation of spectrum resources in wireless communication networks, an ABC algorithm based on uniform mapping and CAC is proposed. The experimental findings demonstrated that a composite system of uniformly distributed Chebyshev mappings is capable of uniformly generating workable solutions. In all test functions, the suggested approach demonstrated great performance and accurate optimality determination. For the Bohachevsky function, the algorithm used in this study’s solution had a mean square deviation of zero. With an increase in network load of up to 0.8, the method of this study used more spectrum. At all network nodes, the security services’ eavesdropping was less than 0.1 using this study’s methodology. The algorithm used in this study’s allocation approach had a network throughput rate above 300 kbps, which was higher than that of previous methods. The aforementioned research findings demonstrate that this algorithm has strong convergence, an optimal solution with high accuracy, and the ability to more effectively use spectrum resources and ensure data security, which is helpful for improving the SA of wireless communication networks and ensuring the security of network communication.
Although this study validated the performance of the artificial bee colony algorithm based on uniform mapping and collaborative collection control, in application scenarios with a large sample size, it may be limited by the insufficient number of experimental devices and the selection of different random number functions, which may affect the effectiveness evaluation of the method. In addition, insufficient sample diversity and complexity may also lead to a decrease in the comprehensiveness of performance evaluation. Therefore, future research needs to be conducted in larger and more complex environments to thoroughly evaluate the effectiveness of algorithms.
It is recommended that future work include the following suggestions: To enhance the efficacy assessment of this methodology, future study can establish additional experimental facilities, such as larger computing clusters and more complex simulation environments, in order to conduct a more comprehensive evaluation of the algorithm. Furthermore, comparisons with other optimization algorithms can be conducted to ascertain the superiority of this method in SA in wireless communication networks. Furthermore, the parameter selection process can be refined to enhance the algorithm’s performance and precision.
References
- 1. Naeem E. A., Abdelaal A. E., Eyssa A. A., Alazrak F. M., Ahmed A., Hassan R. E. S., et al. "Efficient signal and protocol level security for network communication," Int. J. Speech Technol., vol. 23, pp. 399–424, Feb. 2020,
- 2. Sun J., Wang W., Kou L., Lin Y., Zhang L., Da Q., et al. "A data authentication scheme for UAV ad hoc network communication," J Supercomput., vol. 76, pp. 4041–4056, Nov. 2020,
- 3. Kong P. Y., "A review of quantum key distribution protocols in the perspective of smart grid communication security," IEEE Syst J., vol. 16, no. 1, pp. 41–54, Aug. 2022,
- 4. Wang C., Song R., and Liu Z., "Simulation of vehicle network communication security based on random geometry and data mining," IEEE Access, vol. 8, pp. 69389–69400, Apr. 2020,
- 5. Wang X., Cheng M., Eaton J., Hsieh C. J., and Wu S. F., "Fake node attacks on graph convolutional networks," JCCE, vol. 1, no. 4, pp. 165–173, Oct. 2022,
- 6. Chen H., Tu K., Li J., Tang S., Li T., and Qing Z., "6G Wireless communications: Security technologies and research challenges," ICUEMS, Zhuhai, China, pp. 592–595, Jul. 2020,
- 7. Xu M., Zhang Y., Fan Y., Chen Y., and Song D., "Linear spectral mixingmodel-guided artificial bee colony method for endmember generation," IEEE Geosci. Remote Sens. Lett., vol. 17, no. 12, pp. 2145–2149, Dec. 2020,
- 8. Tayyab A. and Saif U., "A two-stage genetic artificial bee colony algorithm for solving integrated operating room planning and scheduling problem with capacity constraints of downstream wards," IEEE Access, vol. 10, pp. 131109–131127, Dec. 2022,
- 9. Li J. Q., Song M. X., Wang L., Wang P. Y., Han Y. Y., Sang H. Y., et al. "Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs," IEEE Trans. Cybern., vol. 50, no. 6, pp. 2425–2439, Jun. 2020, pmid:31603832
- 10. Gao H., Fu Z., Pun C. M., Zhang J., and Kwong S., "An efficient artificial bee colony algorithm with an improved linkage identification method," IEEE Trans. Cybern., vol. 52, no. 6, pp. 4400–4414, Jun. 2022, pmid:33095736
- 11. Ma T. X., Duan X., Xu Y., Wang R. L., and Li X. Y., "Research on fault location in DC distribution network based on adaptive artificial bee colony slime mould algorithm," IEEE Access, vol. 11, pp. 62630–62638, Jun. 2023,
- 12. Pang Z., Bai C., Liu G. and Han Q., "A novel networked predictive control method for systems with random communication constraints," J. Syst. Sci. Complex., vol. 34, no. 4, pp. 1364–1378, Aug. 2021,
- 13. Zhang J., Rahman M. D., Wu K., Huang X., Guo Y., Chen S. et al. "Enabling joint communication and radar sensing in mobile networks-A survey," IEEE Commun. Surv. Tutorials, vol. 24, no. 1, pp. 306–345, Oct. 2022,
- 14. Wei W., Wang J., Du J., Fang Z., Ren Y., and Chen C. P., "Differential game-based deep reinforcement learning in underwater target hunting task," IEEE Trans.Neural Netw. Learn. Syst., pp. 1–13, Oct. 2023, pmid:37889822
- 15. Meena M. and Rajendran V., "Spectrum sensing and resource allocation for proficient transmission in cognitive radio with 5G," IETE Journal of Research, vol. 68, no. 3, pp. 1772–1788, Oct. 2022,
- 16. Le M., Pham Q. V., Kim H. C. and Hwang W. J., "Enhanced Resource Allocation in D2D Communications With NOMA and Unlicensed Spectrum," in IEEE Systems Journal, vol. 16, no. 2, pp. 2856–2866, June, 2022,
- 17. Bacanin N., Bezdan T., Venkatachalam K., Zivkovic M., Strumberger I., Abouhawwash M., et al. "Artificial neural networks hidden unit and weight connection optimization by quasi-refection-based learning artificial bee colony algorithm," IEEE Access, vol. 9, pp. 169135–169155, Jul. 2021,
- 18. Wang C., Shang P., and Shen P., "An improved artificial bee colony algorithm based on Bayesian estimation," Complex Intell. Syst., vol. 8, no. 6, pp. 4971–4991, Apr. 2022,
- 19. Wang Z., Ding H., Li B., Bao L., and Yang Z., "An energy efficient routing protocol based on improved artificial bee colony algorithm for wireless sensor networks," IEEE Access, vol. 8, pp. 133577–133596, Jun. 2020,
- 20. Zhao Y., Yan Q., Yang Z., Yu X., and Jia B., "A novel artificial bee colony algorithm for structural damage detection," Adv. Civ. Eng., vol. 2020, no. 6, pp. 1–21, Jan. 2020,
- 21. Zhou X., Lu J., Huang J., Zhong M., and Wang M., "Enhancing artificial bee colony algorithm with multi-elite guidance," J. INF Sci., vol. 543, pp. 242–258, Jan. 2021,
- 22. Rahnemaandand N. and Gharehchopogh F. S., "An improved artificial bee colony algorithm based on whale optimization algorithm for data clustering," Multimed. Tools Appl., vol. 79, no. 43–44, pp. 32169–32194, Aug. 2020,
- 23. Gao J., Yang X., Huang J., and Peng K., "Subspace aided fault-tolerant control for distributed homogeneous systems with symmetric interconnection pattern," Int. J. Control Autom., vol. 21, no. 1, pp. 20–30, Jan. 2023,
- 24. Amdouni R., Gafsi M., Guesmi R., Hajjaji M. A., Mtibaa A., and Bourennane E. B., "High-performance hardware architecture of a robust block-cipher algorithm based on different chaotic maps and DNA sequence encoding," Integrat., vol. 87, pp. 346–363, Aug. 2022,
- 25. Gao X., Mou J., Xiong L., Sha Y., Yan H., and Cao Y., "A fast and efficient multiple images encryption based on single-channel encryption and chaotic system," Nonlinear Dyn., vol. 108, no. 1, pp. 613–636, Jan. 2022,
- 26. Yao G., Wu Y., Huang X., Ma Q., and Du J., "Clustering of typical wind power scenarios based on k-means clustering algorithm and improved artificial bee colony algorithm," IEEE Access, vol. 10, pp. 98752–98760, Sep. 2022,
- 27. Wang H., Wang W., Wang X., Zhao J., Wang Y., Xiao S., et al. "Artificial bee colony algorithm based on knowledge fusion," Complex Intell. Syst., vol. 7, pp. 1139–1152, Jun. 2021,
- 28. Li X., Ma L., Xu Y., and Shankaran R., "Resource allocation for D2D-based V2X communication with imperfect CSI," IEEE Internet Things J., vol. 7, no. 4, pp. 3545–3558, Apr. 2020,
- 29. Liu X., Hu S., Li M., and Lai B., "Energy-efficient resource allocation for cognitive industrial internet of things with wireless energy harvesting," IEEE Trans. Ind. Inform., vol. 17, no. 8, pp. 5668–5677, Aug. 2021,
- 30. Liu X., Yu J., Wang J., and Gao Y., "Resource allocation with edge computing in IoT networks via machine learning," IEEE Internet Things J., vol. 7, no. 4, pp. 3415–3426, Apr. 2020,
- 31. Du H., Wang J., Niyato D., Kang J., Xiong Z., Guizani M., et al. "Rethinking wireless communication security in semantic internet of things," IEEE Wirel.Commun., vol. 30, no. 3, pp. 36–43, Jun. 2023,
- 32. Guo H., Li J., Liu J., Tian N., and Kato N., "A survey on space-air-ground-sea integrated network security in 6G," IEEE Commun. Surv. Tutorials, vol. 24, no. 1, pp. 53–87, Nov. 2022,
- 33. Savant V. B. and Kasar R. D. "A review on network security and cryptography," Res. J. Eng. Technol., vol. 12, no. 4, pp. 110–114, Jul. 2021,
- 34. Chakraborty C., "Chronic wound image analysis by particle swarm optimization technique for tele-wound network," Wireless Personal Communications, vol. 96, pp. 3655–3671, Oct. 2017,
- 35. Kumar A., Abhishek K., Bhushan B. and Chakraborty C., "RETRACTED ARTICLE: Secure access control for manufacturing sector with application of ethereum blockchain," Peer-to-Peer Networking and Applications, vol. 14, no. 5, pp. 3058–3074, Sep. 2021,
- 36. Lakhan A., Mohammed M. A., Obaid O. I. and Chakraborty C., Abdulkareem K., Kadry S., "Efficient deep-reinforcement learning aware resource allocation in SDN-enabled fog paradigm," Automated Software Engineering, vol. 29, pp. 1–25, Jan. 2022,
- 37. Jamaludin S., Romli N., Kasihmuddin M., Baharum A., Mansor M. and Marsani M., "Novel logic mining incorporating log linear approach," Journal of King Saud University-Computer and Information Sciences, vol. 34, no. 10, pp. 9011–9027, Nov. 2022,
- 38. Zamri N., Azhar S., Sidik S., Kasihmuddin M., Pakruddin S., Pauzi N. et al. "Multi-discrete genetic algorithm in hopfield neural network with weighted random k satisfiability," Neural Computing and Applications, vol. 34, no. 21, pp. 19283–19311, Nov. 2022,
- 39. Manoharam G., Kasihmuddin M., Antony S., Romli N., Rusdi A., Abdeen S. et al. "Log-Linear-Based Logic Mining with Multi-Discrete Hopfield Neural Network," Mathematics, vol. 11, no. 9, pp. 2121, Apr. 2023,
- 40. Sidik S, Zamri N, Kasihmuddin M, Wahab H, Guo Y, Mansor M, “Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization,” Mathematics, vol. 10, no. 7, pp. 1–27, Feb. 2022, 2227-7390/10/7/1129/.