Research Article  Open Access
XiaoBing Hu, Ming Wang, Mark S. Leeson, "RippleSpreading Network Model Optimization by Genetic Algorithm", Mathematical Problems in Engineering, vol. 2013, Article ID 176206, 15 pages, 2013. https://doi.org/10.1155/2013/176206
RippleSpreading Network Model Optimization by Genetic Algorithm
Abstract
Smallworld and scalefree properties are widely acknowledged in many realworld complex network systems, and many network models have been developed to capture these network properties. The ripplespreading network model (RSNM) is a newly reported complex network model, which is inspired by the natural ripplespreading phenomenon on clam water surface. The RSNM exhibits good potential for describing both spatial and temporal features in the development of many realworld networks where the influence of a few local events spreads out through nodes and then largely determines the final network topology. However, the relationships between ripplespreading related parameters (RSRPs) of RSNM and smallworld and scalefree topologies are not as obvious or straightforward as in many other network models. This paper attempts to apply genetic algorithm (GA) to tune the values of RSRPs, so that the RSNM may generate these two most important network topologies. The study demonstrates that, once RSRPs are properly tuned by GA, the RSNM is capable of generating both network topologies and therefore has a great flexibility to study many realworld complex network systems.
1. Introduction
As is well known, many successful artificial intelligence technologies are actually inspired by certain natural systems or phenomena [1ā3]. For instance, genetic algorithms (GAs) are inspired by natural selection and evolutionary processes, artificial neural networks (ANNs) by the animal brain, particle swarm optimization (PSO) by the learning behavior within a population, ant colony optimization (ACO) by the foraging behavior of ants, and optimal structure design by the hexagonal cells of the honeycomb.
Following the common practice of learning from nature in the artificial intelligence domain, we have recently proposed a ripplespreading network model (RSNM) [4], which is inspired by the natural ripplespreading phenomenon. A ripplespreading process defined by some ripplespreading related parameters (RSRPs) is the central piece of the model. Basically, assuming that nodes of networks are distributed in a (real or artificial) space and that the distribution of nodes are fixed, some initial ripples are randomly generated in the space. As an initial ripple spreads out in the space, its point energy decays gradually, and it reaches every node one by one sooner or later. By comparing the point energy of an incoming ripple with some preset thresholds for a node, it can be determined whether this node will be activated by the incoming ripple to generate a new ripple, and whether this node will be connected to the node where the incoming ripple originates. When a node is activated to generate a new ripple, the initial energy of the new ripple will be a function of the point energy of the incoming ripple. New ripples are also able not only to activate other nodes to generate more ripples but also to establish new connections between nodes, as long as their point energy is above the relevant thresholds. As this ripplespreading process goes on for a while, a network topology will appear. Actually, the output topology will be largely determined by the values of RSRPs, such as the locations of the epicenters for initial ripples, the thresholds to tell whether a node will be activated or connected, the energy amplifying factor, and the coefficients to define the point energy decaying rate. Once the values for these RSRPs are given and fixed, then the output topology will be uniquely determined.
However, when compared with many existing network models such as those reported in [5, 6], there is a lack of obvious or straightforward relationships between the RSRPs and the network properties of RSNM topology. In particular, [4] listed it as one of the future works to study when and how the RSNM may generate two of the most important network topologies, smallworld and scalefree topologies. Therefore, based on the theoretical and conceptual results in [4], this paper focuses in particular on providing a practicable method to tune the RSRPs of RSNM, in order to generate preferable network topologies. To this end, the model in [4] will be modified into a more general form to ease the analysis on the properties of RSNM, and then an effective GA will be developed, in order to tune the RSNM to generate smallworld and scalefree network topologies.
The remainder of this paper is organized as follows. Section 2 gives some background knowledge of related work. Section 3 describes a mathematical model of the modified RSNM. The proposed GA will be explained in Section 4 for optimizing the values of RSRPs. Section 5 reports some simulation results. The paper ends with some conclusions and discussions on future work in Section 6.
2. Related Work on Complex Networks
Complex networks, that is, networks whose structure is irregular, complex, and dynamically evolving in time, describe a wide range of systems in nature and society and are all around us in our daily life [6, 7]. In the past few decades, many efforts have been made to model and analyze various complex networks. Most network models can be classified as stochastic models because they have a typical feature in common: a stochastic model abstracts one or a few network properties or parameters to capture in quantitative terms the underlying organizing principles of complex networks, and these network properties or parameters can estimate how the network appears but cannot guarantee an exact or unique topology. In other words, different network topologies may have exactly the same values for the specified properties or parameters. For instance, in classic random graph theory [5], the connection probability is the core parameter of the network model. In the generalized random graph model [8], a degree distribution following a power law is used as the input in order to be able to describe the scalefree character of real networks that the classic random graph model cannot capture. In the theory of evolving networks [9], the parameter known as the preferential attachment is often used to model scalefree real networks. In a recently reported spatially embedded random network model [10], the connection probability is formulated as a function of distance between nodes. In either of the above network models, even if the input is fixed, for example, the connection probability, power law for degree distribution or preferential attachment is fixed, the output of the model is enormous, and what the output topology exactly looks like is largely by chance. Therefore, they are all stochastic models. With the exception of those network properties which explicitly depend on the input parameters, the output topology of the models is largely unpredictable or uncertain in terms of other network properties. As a result, it is difficult to apply these models in network design, such as the topology optimization problem.
In contrast, the RSNM proposed in [4] is a deterministic complex network model. Unlike the stochastic models in [5, 8ā10], once the values of input are fixed, the output network topology will also be fixed and unique in the new model. Therefore, we can adjust these RSRPs in order to improve the network topology in terms of concerned network properties. Furthermore, there is great freedom and flexibility to modify and extend the RSNM. For instance, the proposed RSNM can easily be extended to a semideterministic version and a stochastic version. Basically, the RSNM can introduce randomness at two levels by RSRPs: (i) the random setup of nodes (e.g., the random spatial distribution of nodes and the random distribution of node thresholds and amplifying factors, if they are not constants); (ii) the random setup of initial stimulating ripples (e.g., locations, initial energy, and starting time). The first level of randomness is related to the internal factors of the system, and the second level of randomness is associated with external impacts to the system. The two levels of randomness in the RSNM make it very easy and natural for the RSNM to capture/reflect both internal and external factors in many realworld complex networks. For instance, the impact of earthquake through a risk chain and the breakout of plagues in a community can be described as evolving networks triggered by a few initial simulating ripples; the threshold of nodes is related to the vulnerability of infrastructure and the immunity of individuals and the amplifying factor of nodes to connectivity of infrastructure and the social activeness of individuals.
Any complex network model claimed to be practicable must illustrate the capability of generating network topologies that present in realworld systems, among which smallworld and scalefree topologies are two of the most important network topologies. It is widely recognized that many realworld complex network systems display some organizing principles, which often lead to either smallworld topology or scalefree topology [7, 11, 12]. The smallworld concept in simple terms describes the fact that despite their often large size, in most networks, there is a relatively short path between any two nodes. The distance between two nodes is defined as the number of edges along the shortest path connecting them. The most popular manifestation of small worlds is the āsix degrees of separationā concept, which concluded that there was a path of acquaintance with a typical length of about six between most pairs of people in the United States [13]. The smallworld property appears to characterize most complex networks, for instance, the actors in Hollywood are on average within three costars from each other or the chemicals in a cell are typically separated by three reactions. Another most important development in our understanding of complex networks was the discovery that for a large number of networks, including the World Wide Web [14], the Internet [15], or metabolic networks [16], the degree distribution has a powerlaw tail. Such networks are called scale free [17]. While some networks display an exponential tail, often the functional form of degree distribution still deviates significantly from the Poisson distribution expected for a random graph. The discoveries of smallworld and scalefree features have fundamentally reshaped the study of complex network systems. Therefore, to be able to better apply the RSNM in [4] to study realworld complex networks, it is crucial to understand how and when the RSNM will generate smallworld and scalefree network topologies, which is the focus of this paper.
3. Mathematical Description of RippleSpreading Network Model (RSNM)
3.1. The Basic Idea of RSNM
The RSNM was first reported in [4], where the basic idea was inspired by the natural ripplespreading phenomenon on calm water surfaces. Suppose that a collection of stakes is randomly distributed in a quiet pond. Then, suddenly a stone is thrown into the pond, and an initial ripple is generated and spreads out from the point where the stone hits the quiet water. When the ripple reaches a nearby stake, a new ripple is generated around the stake due to the reflection effect. For the sake of consistency, we call such a new ripple a responding ripple (or outgoing ripple), and the ripple which triggers the responding ripple as a stimulating ripple (or incoming ripple). Obviously, the initial energy of a responding ripple is determined by both the point energy of the stimulating ripple and the physical features of the stake (e.g., whether the stake is rigid or soft in material). A responding ripple may trigger new responding ripples around other stakes. As the initial stimulating ripple spreads out, more and more responding ripples are stimulated around stakes. However, since the point energy on the stimulating ripples decays as they spread out, those responding ripples triggered at a late phase could hardly be noticed. Therefore, we may say there is a threshold, and only when the point energy of a stimulating ripple is above this threshold will a responding ripple be generated. Furthermore, the reaction of stake to a stimulating ripple may be more than just generating a responding ripple. For instance, if the point energy of a stimulating ripple is above another threshold, the stake will shake noticeably to disturb a bird resting on the top of the stake. Once the bird on a stake is disturbed by the outgoing ripple of another stake, we set up an edge between the associated pair of nodes in a network. As the time elapses, the point energy of all ripples will decay to below the thresholds sooner or later, and after a long enough period of time, all ripples will disappear and no birds will be disturbed any more. Then, based on the established edges according to which bird has been disturbed by the outgoing ripple of which stake, we will get a network topology. Clearly there are some factors affecting the final network topology. For instance, how many stones hit the pond to generate initial stimulating ripples, where do they hit the pond, what is the mass of each stone (will determine the initial energy of the associated stimulating ripple), what are the preset values for the thresholds, and what is the amplifying factor of each stake to reflect a stimulating ripple? By mathematically formulating these factors and the relationships between them, we can get an effective model for complex networks. For more details of the basic idea of RSNM, readers may refer to [4].
3.2. Mathematical Model of Modified RSNM
The RSNMs proposed in [4] have an important concept: epicenter of initial stimulating ripple (EISR), which is associated with the point where the stone hit the water surface. Unlike normal nodes in network, an EISR is not connectable, which means no edge can be established between two EISRs or an EISR and a normal node. EISRs are useful to match and describe the initial cause of the development of a realworld network; for instance, in the study on the impact of earthquake on a transport network, the epicenter of earthquake is usually not located at any node of the transport network. However, the difference between EISRs and normal nodes makes it very difficult to conduct theoretical deduction of network properties. This partially explains why paper [4] failed to analyze the smallworld and scalefree properties of the RSNM. Without necessary theoretical analyses, the RSNM can hardly develop into a mature and practicable method. From a simulation point of view, a network model with EISRs can be mathematically equivalent to a model without EISRs, and the latter will be much easier to analyze and study. Therefore, in this paper, we will modify the models in [4] by removing EISRs and adding a new concept of selfgenerating ripple (SGR). Basically, in the modified RSNM all initial stimulating ripples will be selfgenerated by connectable nodes in the network, in other words, all initial stimulating ripples will directly come from connectable nodes. To this end, two new ripplespreading related parameters (RSRPs) need to be introduced to every node: initial energy of SGR and start time of SGR , , where is the total number of nodes in the network. By presetting and according to the impact of EISRs, one can easily see that the modified RSNM is equivalent to the models reported in [4]. Actually, the modified RSNM is a generalized model, as the models in [4] are just a subset of the new model. Obviously, only those nodes with matter in terms of EISRs, and we assume that there are such nodes.
Before we give the mathematical description of the modified RSNM, we need to define some other important ripplespreading related parameters (RSRPs) like in [4]. For the sake of simplicity but without loss of generality, unless explicitly specified, we suppose all nodes are distributed in a limited 2dimensional space in this paper. It is also assumed that the total number of nodes, , and their locations, , are already given and fixed. To get different topologies from this fixed set of nodes, we have another three RSRPs to each node: , , and , which are the amplifying factor, the threshold to generate a responding ripple, and the threshold to establish a link, for node , respectively.
With the above RSRPs, the modeling process of the modified RSNM can be mathematically described as follows.
Step 1. Initialize the current time instant, that is, . Initialize and for every node randomly or according to certain requirements. Since each node has no initial energy, that is, , therefore, its current point energy is
Assume that each node has a ripple with a current radius of 0, that is, .
Step 2. If the termination criteria are not satisfied, do as follows.
Substep 1. Let .
Substep 2. Check against . If , , and , then the selfgenerated ripple of node will start to spread, so set up the initial energy of the ripple starting from node as
Substep 3. If , , then update the current radius and point energy of the ripple starting from node where is the spreading speed of ripples, that is, the change in the radius of a ripple during one time instant, and is a function defining how the point energy decays as the ripple spreads out. A typical decaying function may be where is a coefficient and is the mathematical constant. Clearly has an important influence on the decaying speed of ripples and will therefore affect the final network topology. Basically, (3) show that the ripples have the same spreading speed and the same decaying function, just like in the natural world. However, this may be amendable in order to get a more complicated artificial model.
Substep 4. Check which new nodes are reached by the ripples. Suppose that is the distance between node and node . If and , then node is reached by the ripple generated by node . If , then node is activated by node and generates a responding ripple with
If , then a connection between node and node is established, that is, where is the adjacency matrix which records the network topology.
Different termination criteria may be used in Step 2. For instance, the current time instance is beyond a specific time window, no node has current point energy above any threshold, or the upper bound for the number of total links is reached.
Figure 1 gives a simple illustration of the development of network topology based on the modified RSNM, where the initial stimulating ripple directly comes from a connectable node in the network. From Figure 1, one may notice that since the threshold for triggering a responding ripple may differ from the threshold for establishing an edge, a responding ripple is not always accompanied by the establishment of an edge. For instance, the outgoing ripple of node 1 triggers a responding ripple at node 3 accompanied by the establishment of an edge to node 2, it only triggers a responding ripple at node 2, and it does nothing to node 4.
3.3. Some Important Conditions
We have previously presented some conditions for analyzing general network properties of the EISRbased RSNM [4], and here, we need to work out new conditions for the modified RSNM based on the concept of SGR. The proofs of new conditions are similar to those in [4], to which readers can refer to for details. Such new conditions will be very useful as heuristic rules in the application of GA to optimize the output network topology of RSNM.
For a network with nodes, the number of total potential edges between nodes is For each pair of nodes , let denote the length of the potential edge between node and node , that is, the direct distance between node and node , no matter whether or not there is an actual connection between the pair of nodes. Since all nodes are distributed in a limited space, we can assume that and are the maximal and minimal lengths in all potential edges, respectively, and the maximal and minimal values of all initial SGR energy and the maximal and minimal values of all activating threshold , and the maximal and minimal values of all connecting threshold , and and maximal and minimal values of all amplifying factor .
Condition 1 (completely connected graph). If the inequalities
hold, where
then the RSNM will generate a completely connected graph.
Equation (8) guarantees that the SGRs will trigger at least one responding ripple, and (9) guarantees that the responding ripple will cause a completely connected graph.
Condition 2 (all nodes connected). If (8) and the inequality hold, where denotes the maximum edge length in a shortest open travelling salesman problem (TSP) route, then the RSNM will generate a graph where all nodes are connected.
Condition 3 (all nodes activated). If (8) and the inequality
hold, then every node will generate an outgoing ripple under the RSNM.
The exact node degree can be counted as follows: for node , , its degree is
where is the adjacency matrix given in (9) and its entries are determined by the ripplespreading process described in Section 3.2. After the ripplespreading process terminates, one has
Please note that (13) and (14) are used to calculate the exact degree of each node after a network topology is generated by the RSNM. To roughly estimate node degree distribution from the RSRPs without even running the RSNM, we have the following proposition.
Proposition 1 (degree distribution estimation). Suppose that every node will generate an outgoing ripple; for example, Condition 3 is satisfied. For node , let be the value of Then, in the graph generated by the RSNM, the degree of node , , is not smaller than the number of nodes to which the direct distance is not larger than .
4. Genetic Algorithm (GA) to Optimize Network Topology
4.1. Optimize Network Topology by Evolving Model Parameters
The optimization of network topology has long been a challenging task [18], as it is widely acknowledged as an NPhard problem. As largescale parallel stochastic search and optimization algorithms, genetic algorithms (GAs), if properly designed, have the capability of producing high quality solutions to NPhard problems in an acceptable period of time [19]. Actually, GAs have already been used to optimize some network structures, for example, the topology optimization of CCS7 network [20], MPLS network [21] and airline route networks [22]. However, in such studies on network topology optimization, search is carried out by directly adding new links or removing existing links between nodes. The chromosome structure in such GAs is based on permutation representation of existing links. As is well known, permutation representation based GAs are often confronted with feasibility problems, which means random evolutionary operations, such as mutation and crossover, may generate some chromosomes whose associated solutions are invalid or infeasible against the underlying physical meaning of a realworld solution. For example, in the case of airline route network optimization, permutation representation based GA might establish a link between two very close cities, which is economically impracticable [22].
The RSNM makes it possible to discard permutation representation based GA, and to employ the very original binary representation based GA for network topology optimization. The original GA was developed with binary representation of valuebased solutions (see [1, 2]), and it was free of feasibility problems. From the modeling process proposed in Section 3.2, one can see that the network topology is largely determined by the RSRPs. Actually, every given set of values for the RSRPs will result in a unique topology, and given different values for the parameters, different topologies will be generated. Therefore, by evolving the values of RSRPs, one may find an optimal network topology in terms of particular considerations. Obviously, the very original binary representation based GA can be applied straightforwardly to evolve the RSRPs, just like in normal parameter optimization problems [2].
For the sake of simplicity, Figure 2 gives four examples about how the values of the RSRPs affect the output topology of the EISRbased RSNM. In the four networks in Figure 2, all other RSRPs have the same values, but the locations of the four EISRs are different. As a result, there are four different topologies. It should be pointed out that the feature that every given set of values for the model parameters will lead to a unique topology is distinct from other models of random networks, where the model parameters (e.g., the connection probability in the classic random graph theory and the preferential attachment in the theory of evolving networks) cannot uniquely determine network topology [5, 6].
(a)
(b)
(c)
(d)
One may argue that changing the values of RSRPs might never lead to every possible network topology. In other words, a certain topology might exist and no matter how the RSRPs are tuned, the RSNM cannot generate it to the nature of the ripplespreading process. Although this is true on the one hand, on the other, this feature of RSNM is not necessarily a disadvantage. In many applications of GAs, heuristic rules usually play a crucial role in delivering a good performance because they may filter out many infeasible or bad quality solutions and therefore narrow down the search space for GAs. The nature of the ripplespreading process may do the same good thing for network topology optimization. Suppose that the development of a realworld network system largely involves some ripplespreading effect (e.g., in the cases of disaster spreading and epidemic dynamics). Then, any network topology that cannot reflect such ripplespreading effect is hardly realistic from the realworld system point of view and therefore should be considered as a bad solution to topology optimization. This means, if the ripplespreading effect is concerned, then most network topologies missed out by the RSNM are possibly bad solutions. As demonstrated in [23], a ripplespreading process can focus the search on quality solutions to the aircraft sequencing problem. Similarly, the RSNM can focus on more realistic topologies, and therefore, evolving the RSRPs could still be an effective strategy to find a good or even optimal network topology. Further study based on some particular realworld systems are needed, which is however beyond the scope of this paper.
4.2. GA Design
In the practice of GA design, we usually need to determine chromosome structure, mutation, crossover, and heuristic rules. These four design steps are often highly problem dependent in a permutation representation based GA but quite simple and straightforward in a binary representation based GA, which is the case in this study as just explained in Section 4.1.
Traditionally, to apply GA to optimize network topology, a straightforward chromosome structure is based on the adjacent matrix or a vector of established edges, just as illustrated in Figures 3(b)ā3(e), and such a chromosome structure apparently belongs to permutation representation. Differently, with the RSNM, we can optimize network topology by evolving the values of RSRPs, and therefore, we can set the chromosome structure as a value based binary representation. Basically, the value of each RSRP can be represented as a binary string. We stick together all binary strings of a set of values for RSRPs, and then we get the associated chromosome (see Figure 3(f), e.g.). In the RSNM, a different node may have different , , and , that is, different amplifying factors, threshold to generate a responding ripple, and threshold to establish a link, and a different SGR may have a different . In this study, we assume that has a normal distribution within the range [,], within [,], within [,], and within [,]. Therefore, we need to use GA to tune the boundary values of the above 4 ranges, in other words, to use GA to optimize , , , , , , , and . As a result, a chromosome should be the integration of the binary strings of the above 8 boundary values. If we want to see what is the best topology, the RSNM could output with all nodes having the same value for certain RSRP, for example, demanding all nodes to have the same , then a chromosome will become simpler because . Furthermore, we may predetermine and fix certain RSRPs and use GA only to tune other RSRPs because, according to the conditions given in Section 3.3, one can see that it is not the absolute value of RSRPs, but the relative ratio between RSRPs that largely determine the output topology of the RSNM. This will further simplify the chromosome structure.
(a) āA network topology ( )
(b) Adjacency matrix
(c) Chromosome based on adjacency matrix
(d) Table of all potential edges
(e) Chromosome based on established edges and edge table
(f) Chromosome based on the value of RSRPs
Mutation aims to increase the diversity of chromosomes, so that the GA can explore the solution space as widely as possible in order to stand a better chance to hit a global optimum. For a binary representation based GA, the mutation operator randomly selects some genes in a chromosome with a certain probability and reverses their values, that is, changing a binary bit from 1 to 0, or from 0 to 1.
Crossover is used to identify, inherit, and protect common genes shared by fit chromosomes, and at the same time, to recombine noncommon genes searching for new solutions. Crossover is crucial for GAs to quickly locate optima or suboptima. The simplest crossover is onepoint crossover, where a split point is chosen randomly, each of the two parents split at the chosen point into two pieces, and piece 1 (or piece 2) from parent 1 is combined with piece 2 (or piece 1) from parent 2 to generate offspring. In this paper, we choose uniform crossover, mainly because it is more powerful in terms of exploiting all possibilities of recombining noncommon genes [24]. In uniform crossover, each gene in the offspring inherits the same gene from either parent 1 or parent 2 at a halftohalf chance. Actually, from Figure 4, one can see that uniform crossover is the ultimate multipoint crossover.
Problemspecific heuristic rules are used in GA to filter out bad/invalid/infeasible solutions and therefore to accelerate the converge speed. They are usually more useful and more important for permutation representation based GA rather than binary representation based GA. In the RSNM, although the ripplespreading process is supposed to rule out most unrealistic solutions, we can still introduce some heuristic rules based on those conditions given in Section 3.3. For example, when initializing a chromosome, the random setup of RSRP values may more or less refer to those ratio relationships between the RSRPs, in order to avoid such cases where many nodes are not connected or all nodes are completely connected.
In the GA, the population of chromosomes evolves based on their fitness through generations of evolutionary operations: selection, mutation, and crossover. Since the goal in this study is to tune the RSNM to generate certain desirable topologies, the fitness of a chromosome is basically measured by network properties of the topology associated with the chromosome. It is known that smallworld and scalefree topologies are mainly recognized by their node degree distribution pattern, average path length (APL) between connected nodes, and the clustering coefficient (CC). Basically, a smallworld network topology has a Poisson distribution, small APL, and large CC, while a scalefree network topology has a power law tailoff distribution, even smaller APL, and larger CC. To apply a GA to tune the RSNM to generate smallworld and scalefree topologies, we first need to use some wellknown network models to generate target network topologies. In this study, we use the WattsStrogatz model in [25] to generate smallworld network topologies and the BarabĆ”si and Albert model in [17] to generate scalefree topologies. Since these models are random models, every run of such models will generate a different topology but the associated network properties are similar between different runs. Therefore, for a given model parameter value, we need to run the models many times, each time we will get a different topology, and then we calculate the average network properties of all different topologies generated. We use such average network properties as targets to tune the RSNM. Before we run the GA, suppose that we have run the one of the models and then got the following average network properties as targets: , , and , that is, target APL, target CC, and target degree distribution. Please note that and are scalars, while is a vector which has entries, and entry () is the percentage of nodes whose degree is (), . With , , and , we can calculate the fitness of a chromosome as follows in this study: where , , are weights which determine the contribution of each network property to the fitness, , , and are the network properties of the topology associated with the chromosome, and defines a tolerable zone for the gap between and . indicates how similar the degree distribution associated with the chromosome is to the target one (see Figure 5 for illustration). From the definition of fitness function in (16), one can see that if the topology associated with the chromosome has similar network properties to those of target topology, then the chromosome will have a large fitness.
It should be pointed out that, if we assume that all nodes have the same , , and , and all SGR have the same , then we have , , , and , and a chromosome will output a unique topology, whose network properties can be used straightforwardly to calculate the fitness according to (16) and (17). However, in most cases when we tune the RSNM, we allow certain RSRP to have a normal distribution with a range, for example, allowing to vary within [, ], where . In such a case, although a chromosome gives values for and , the output of RSNM is not unique. Therefore, to calculate the fitness of a chromosome, we need to run the RSNM for many times and then use the average network properties of all generated topologies.
5. Simulation Results
5.1. Simulation Setup
In this section, we aim to investigate, when and how the RSNM may generate smallworld and scalefree network topologies. To this end, firstly, we need some models which can well generate such two categories of topologies, and as indicated in Section 4.2, we used established models from the literature [17, 25]. From the modeling process in Section 3.2, one can easily see that, even if all RSRPs are the same, the spatial distribution of nodes can largely affect the final output topology. Therefore, in this simulation, we consider 3 different types of node distribution: circle distribution, grid distribution, and random distribution. In circle distribution, all nodes are evenly distributed along a circle whose radius is 1000. In grid distribution, all nodes are evenly and regularly arranged in a rectangular area defined by two points: (ā1000, ā1000) and (1000, 1000). A random distribution is generated by introducing random disturbances to the location of nodes in a grid distribution.
The WattsStrogatz model [25] can generate lattice topology, smallworld network, and random graph by increasing the probability for randomly rewiring lattice edges, denoted as hereafter, from 0 to 1. In this simulation, we choose , 0.08 and 1, respectively. Then, combining a different node distribution and values, we have nine test scenarios for this model denoted from WS1 to WS9 as shown in Table 1.

In the BarabĆ”si and Albert model [17], the probability for preferential attachment (denoted by hereafter) plays a crucial role in generating scalefree topology. In this simulation, for node , the is formulated as Basically, the coefficient determines the power law of the resulted scalefree network. Obviously, if , then one has an almost random graph, whilst if is too large, say, , then a winnertakesall network topology is likely to emerge. Here, we will use nine BarabĆ”si and Albert test scenarios, denoted as from BA1 to BA9, with different and node distribution, as shown in Table 2.

Different sets of values for RSRPs in the RSNM might lead to similar topologies. Therefore, in the simulation, by referring to the key network properties of the associated target topology, we use the reported GA to generate six different sets of RSRP values in order to compare with the WS model, and 10 different sets of RSRP values for comparing with the BA model. Each set of RSRP values determines a specific RSNM scenario, and these 16 RSNM test scenarios are denoted as from RSNM1 to RSNM16, as listed in Tables 1 and 2. To tune the RSRP values in each RSNM test scenario, the reported GA has a population of 100, a maximal generation of 200, a mutation probability of 0.1, and a crossover probability of 0.4. For the fitness function defined by (16) and (17), we set , , , and . For the set of RSRP values given by a chromosome, the RSNM is run to generate 20 network topologies, and then the average values of the associated key network properties are used to calculate the fitness of that chromosome. The populations of chromosomes compete and evolve through generations according to their fitness. Then, the fittest chromosome in the last generation of a GA run determines the set of RSRP values for the associated RSNM test scenario. The RSRP values tuned by the reported GA for each of the 16 RSNM test scenarios are given in Tables 1 and 2. In some test scenarios, some RSRPs are assumed to be the same for all nodes, that is, have the same lower bound as the upper bound, while other RSRPs are assumed to have a normal distribution within certain ranges. For example, in RSNM1, , , and are the same for all nodes, while may vary within a range. Then, in RSNM, we use GA to tune , , , and the boundary values for .
For each test scenario, the associated network model runs for 100 times, and the average values of five important network properties, that is, the average path length (APL) between connected nodes, the average distance of established edges (ADEE), the clustering coefficient (CC), the assortativity (ASSO), and the degree distribution (DD), are calculated and analyzed. Please note the difference between APL and ADEE: APL is measured as the number of intermediate nodes, while ADEE is defined as physical distance.
All models are coded and all tests are conducted in a MATLAB environment on a personal computer with a 2.6āGHz CPU, 4āGB memory, and the Windows 7 operating system.
5.2. Simulation Results for the SmallWorld Topology
In this subsection, we have nodes in each test of the simulation and then use a certain network model to establish edges between nodes to get a network topology. The number of SGR is always set as for the RSNM. The simulation results of WS1 to WS9 and RSNM1 to RSNM6 are given in Table 1 and Figure 6, and some topology examples generated during the simulation are given in Figure 7. From the table and figures, one may have the following observations.(i)Firstly, the data of WS1 to WS9 in Table 1 show that, compared with lattices (when ) and random networks (when ), a distinctive feature of smallworld networks, as analyzed in [12], is that they have relatively smaller APL (compared with the associated lattices) and larger CC (compared with the associated random networks). Therefore, the first aim of this simulation is to test whether the reported GA can tune RSRPs properly to make the RSNM to generate networks with the same feature.(ii)From the data of RSNM2, RSNM4, RSNM5, and RSNM6, one can see that the RSNM is indeed capable of generating topologies with the above smallworld network feature. (iii)Compared with the smallworld networks generated by the WS, Table 1 also shows that the smallworld networks generated by the RSNM usually have larger APL and CC (e.g., compare WS2 with RSNM2, WS5 with RSNM4, and WS8 with RSNM5 and RSNM6). This is understandable, because the process of rewiring lattice edges in the WS is purely random, regardless of spatial distance between nodes. Due to such a random process, the WS has more edges established between spatially far away nodes, which help to reduce APL more significantly than the RSNM. Random rewiring lattice edges also lead to smaller CC when compared with the RSNM because the ripplespreading process in the RSNM is more likely to establish edges within neighbourhood, which usually causes large CC.(iv)Also because of the difference between the random rewiring process in the WS and the ripplespreading process in the RSNM, the smallworld networks of RSNM usually have smaller ADEE. An interesting finding is that, when multiplying APL with ADEE, the smallworld networks generated by the RSNM generally have the smaller travelling distance between two randomly chosen nodes than those of the WS actually than all networks generated by the WS including lattices and random networks. (v)When comparing the data of WS1 and WS4, that is, two lattice cases, with those of RSNM1 and RSNM3, one can see that the RSNM can also generate exactly the same lattices if the RSRPs are set properly. The WS initializes lattice with the spatial information of neighborhood; this explains when the RSNM can also generate lattices (the RSNM is particularly good at using spatial information to generate networks). (vi)Figure 6 compares the degree distribution of different models, except WS1, WS4, RSNM1, and RSNM3 (they are lattices and their degree distribution is simply a singleton). Basically, in the WS, the smaller the value of , the sharper the degree distribution, in other words, the less diversified the node degree. Overall, no matter whether we consider lattice, smallworld topology, or random network, the degree distribution is similar to a Poisson distribution. In general, the degree distribution of smallworld networks generated by the RSNM is more diversified than that of WS smallworld networks. This is probably because the ripplespreading process is more complicated than the random rewiring process, and therefore the node degree is less precisely managed in the RSNM than in the WS. Actually, the degree distribution of RSNM smallworld networks is more like that of WS random networks (WS3, WS6, and WS9). (vii)Figure 7 gives some examples of small world networks generated by the WS and the RSNM (for the sake of comparison, Figure 7(d) is a random network, and Figure 7(h) is a network where edges are only established between neighborhood nodes). From Figure 7, one can see clearly that longdistance jump edges in the WS are completely random, whilst in the RSNM, they are mainly established around a few hublike nodes. This feature, along with the degree distribution of RSNM4 in Figure 6, which is the least Poissondistributionlike, may imply that the RSNM is more likely a natural scalefree network model. This will be further investigated in the next section.(viii)In realworld networks, a node may not connect to its neighborhood nodes but some far away nodes. Figures 7(e)ā7(g) clearly show that this is achievable in the RSNM, for instance, when closer nodes have large , while some far away nodes have small enough . However, the structure of connecting far away nodes rather than closer ones does not emerge as often in the RSNM as in the WS.(ix)The random network Figure 7(d) is generated by the WS. In this study, we have realized that it is very difficult to tune the RSRPs in order to generate purely random networks. Basically, because spatial distance plays a crucial role in the RSNM, we assume that it is impossible for the RSNM to generate purely random networks like Figure 7(d).
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
5.3. Simulation Results about ScaleFree Topology
In this subsection, we again have nodes in each test of the simulation, the number of established edges in the RSNM may vary depending on how fast ripple energy decays, and then the comparative BA model is required to generate a network with the same edge number. The number of SGR is always set as for RSNM7 to RSNM12 and for RSNM13 to RSNM16. As discussed in Section 3.2, it is the ratio relationships between the RSRPs that largely determine the output topology; therefore, in this subsection, we preset for RSNM7 to RSNM9 and RSNM13 to RSNM16 and preset for RSNM10 to RSNM12. The simulation results of BA1 to BA9 and RSNM7 to RSNM16 are given in Table 2 and Figures 8 and 9, from which one may make the following observations.(i)Firstly, let us analyze the networks generated by the classical scalefree model. From the data of BA1 to BA9 in Table 2, one can see clearly that, as goes up from 0 to 2, the APL decreases whilst both the CC and the ASSO increases. Compared with lattices, smallworld networks and random networks, such as WS1 to WS9 in Section 5.2, and scalefree networks in general have much smaller APL and larger CC and ASSO. Hub nodes in scalefree networks contribute a lot to smaller APL. In a winnertakesall network, for example, when , a major hub node may connect to all other nodes, which means that the APL is less than 2. The large CC results from the fact that, in a scalefree network, two connected nonhub nodes are likely to connect to the same hub node, and therefore a threenode cluster is formed. In a winnertakesall network, any two nonhub nodes connect to the hub, so the associated CC is very large. Since the ASSO is an index to indicate the preference for a network node to attach to others that are similar or different in any way [26], it of course goes up with the number of preferential attachments, which is determined by .(ii)With properly tuned RSRPs by the reported GA, Table 2 shows that the RSNM can generate scalefree networks indeed, as the RSNM networks share the same features as the BA scalefree networks, that is, small APL and large CC and ASSO. It should be noted that, in the BA experiments, the only parameter is increased gradually in order to reveal the change trend in network properties, while in the RSNM experiments, the changes in RSRPs are not continuous or even associated, and they are just tuned with purpose by referring to the BA scalefree networks.(iii)Table 2 also shows that, in general, the RSNM networks have much smaller ASSO than the associated BA networks. This is reasonable because the BA model does not consider spatial distance at all when establishing an edge. By multiplying the APL and ASSO, one can see again that the RSNM networks are more efficient in terms of overall travelling distance between two randomly chosen nodes. As is well known, under restricted resources, scalefree networks are highly appreciated because they are efficient in terms of overall travelling distance. For instance, given limited aircraft and staff, most airline companies now operate on hubandspoke airline route networks, which is an engineering version of scalefree network [27]. Compared with the BA, the RSNM can make more of this advantage of scalefree works.(iv)Figure 8(a) shows how the degree distribution changes when increases from 0 to 2.5 in the BA. Basically, for a scalefree network, the main part of the right side slope of the degree distribution appears linear in a loglog plot, and the slope becomes sharper as increases. Figure 8(b) gives the degree distribution of RSNM7 to RSNM16, from which one can clearly see they have approximately linear right side slope with a different sharpness. This further confirms that the RSNM can generate scalefree networks, given that the RSRPs are properly tuned. (v)Figure 9 gives some examples of scalefree networks generated by the BA and the RSNM. Apparently, the BA scalefree networks are more spatially chaotic, whilst the RSNM networks are much better organized in terms of spatial view. (vi)One may notice that, in Table 2, the APL of RSNM10 and RSNM13 is much larger than others. This is mainly because of the circle node distribution used. In a scalefree network, it often needs to pass a hub node to travel between two nodes. In the RSNM, even a hub node tends to establish edges locally. Therefore, in the case of circle node distribution, sometimes it may need to pass through quite a few hub nodes around the circle to travel between two nodes.
(a)
(b)
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
6. Conclusions and Future Work
This paper is concerned with how to apply a genetic algorithm (GA) to tune the parameters of ripplespreading network model (RSNM), in order to generate smallworld and scalefree network topologies. As a newly reported complex network model, the RSNM may well describe the development of many realworld network systems where the ripplespreading effect of some local eventsā influence plays an important role. However, a demerit is that those ripplespreading related parameters (RSRPs) of RSNM have no obvious or simple relationship with the network properties of output topology. In particular, since smallworld and scalefree topologies are two of the most important features of many realworld complex network systems, it is crucial to understand, when and how the RSNM can generate these two categories of network topologies. This paper develops an effective GA to tune the RSRPs in the RSNM, and the simulation shows that the RSNM has a great flexibility in generating various network topologies. The reported work further verifies the theoretical potential of RSNM. Therefore, future work should pay more attention to real applications of the RSNM (such as in the study of disaster management and epidemic dynamics), and the GA developed in this paper can then be easily extended to tune model parameters, which will play an important role in simulating a realworld system. For example, when applying the RSNM to study a specific realworld network system, comparison should be conducted between the reported GA and existing relevant methods for that specific system in terms of time performance and scalability.
Acknowledgments
This work was supported in part by the China ā973ā Project under Grant 2012CB955404, the Project Grant 2012RC02 from Beijing Normal University, China, and the Seventh Framework Programme (FP7) of the European Union under Grant PIOFGA2011299725.
References
 J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Mich, USA, 1975. View at: MathSciNet
 S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, New York, NY, USA, 3rd edition, 2010.
 T. Back, U. Hammel, and H.P. Schwefel, āEvolutionary computation: comments on the history and current state,ā IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 3ā17, 1997. View at: Publisher Site  Google Scholar
 X.B. Hu, M. Wang, M. S. Leeson, E. L. Hines, and E. Di Paolo, āDeterministic ripplespreading model for complex networks,ā Physical Review E, vol. 83, no. 4, Article ID 046123, 14 pages, 2011. View at: Publisher Site  Google Scholar
 P. Erdős and A. Rényi, āOn random graphs. I,ā Publicationes Mathematicae Debrecen, vol. 6, pp. 290ā297, 1959. View at: Google Scholar  MathSciNet
 F. Liljeros, C. R. Edling, L. A. Nunes Amaral, H. E. Stanley, and Y. Åberg, āSocial networks: the web of human sexual contacts,ā Nature, vol. 411, no. 6840, pp. 907ā908, 2001. View at: Publisher Site  Google Scholar
 I. Frommer and G. Pundoor, āSmallworlds: a review of recent books,ā Networks, vol. 41, no. 3, pp. 174ā180, 2003. View at: Google Scholar
 W. Aiello, F. Chung, and L. Lu, āA random graph model for massive graphs,ā in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 171ā180, ACM, New York, NY, USA, 2000. View at: Publisher Site  Google Scholar  MathSciNet
 M. E. J. Newman, āClustering and preferential attachment in growing networks,ā Physical Review E, vol. 64, no. 2, Article ID 025102(R), 4 pages, 2001. View at: Publisher Site  Google Scholar
 L. Barnett, E. Di Paolo, and S. Bullock, āSpatially embedded random networks,ā Physical Review E, vol. 76, no. 5, Article ID 056115, 18 pages, 2007. View at: Publisher Site  Google Scholar  MathSciNet
 S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.U. Hwang, āComplex networks: structure and dynamics,ā Physics Reports, vol. 424, no. 45, pp. 175ā308, 2006. View at: Publisher Site  Google Scholar  MathSciNet
 R. Albert and A.L. Barabási, āStatistical mechanics of complex networks,ā Reviews of Modern Physics, vol. 74, no. 1, pp. 47ā97, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 M. Kochen, Ed., The Small World, Ablex, Norwood, NJ, USA, 1989.
 R. Albert, H. Jeong, and A.L. Barabási, āDiameter of the worldwide web,ā Nature, vol. 401, no. 6749, pp. 130ā131, 1999. View at: Publisher Site  Google Scholar
 M. Faloutsos, P. Faloutsos, and C. Faloutsos, āOn powerlaw relationships of the internet topology,ā Computer Communication Review, vol. 29, p. 251, 1999. View at: Google Scholar
 H. Jeong, B. Tombor, R. Albert, Z. N. Oltval, and A.L. Barabásl, āThe largescale organization of metabolic networks,ā Nature, vol. 407, no. 6804, pp. 651ā654, 2000. View at: Publisher Site  Google Scholar
 A.L. Barabási and R. Albert, āEmergence of scaling in random networks,ā Science, vol. 286, no. 5439, pp. 509ā512, 1999. View at: Publisher Site  Google Scholar  MathSciNet
 M. Minoux, āNetwork synthesis and optimum network design problems: models, solution methods and applications,ā Networks, vol. 19, no. 3, pp. 313ā360, 1989. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 A. E. Eiben and M. Schoenauer, āEvolutionary computing,ā Information Processing Letters, vol. 82, no. 1, pp. 1ā6, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 Z.H. Xin and H.J. Zhang, āNeural network and genetic algorithms for topology optimization of the CCS7 network,ā International Transactions in Operational Research, vol. 9, no. 4, pp. 427ā436, 2002. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 E.S. M. ElAlfy, āMPLS network topology design using genetic algorithms,ā in Proceedings of IEEE International Conference on Computer Systems and Applications, pp. 1059ā1065, March 2006. View at: Google Scholar
 H. Liu, X.B. Hu, S. Yang, K. Zhang, and E. Di Paolo, āApplication of complex network theory and genetic algorithm in airline route networks,ā Transportation Research Record, vol. 2214, pp. 50ā58, 2011. View at: Publisher Site  Google Scholar
 X.B. Hu and E. A. di Paolo, āA ripplespreading genetic algorithm for the aircraft sequencing problem,ā Evolutionary Computation, vol. 19, no. 1, pp. 77ā106, 2011. View at: Publisher Site  Google Scholar
 J. Page, P. Poli, and W. B. Langdon, āSmooth uniform crossover with smooth point mutation in genetic programming: a preliminary study,ā in Proceedings of the 2nd European Workshop on Genetic Programming (EuroGP '99), Göteborg, Sweden, May 1999. View at: Google Scholar
 D. J. Watts and S. H. Strogatz, āCollective dynamics of “smallworld” networks,ā Nature, vol. 393, no. 6684, pp. 440ā442, 1998. View at: Google Scholar
 M. E. J. Newman, āAssortative mixing in networks,ā Physical Review Letters, vol. 89, no. 20, Article ID 208701, 4 pages, 2002. View at: Publisher Site  Google Scholar
 G. Burghouwt, J. Hakfoort, and J. R. van Eck, āThe spatial configuration of airline networks in Europe,ā Journal of Air Transport Management, vol. 9, no. 5, pp. 309ā323, 2003. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 XiaoBing Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.