CN102970772A - Method for constructing industrial wireless network topological diagram based on improved genetic algorithm - Google Patents

Abstract

The invention relates to industrial wireless network system management and provides a method for constructing an industrial wireless network topological diagram based on an improved genetic algorithm. According to the method, nodes are divided into k-hop node sets by a system manager according to a hop number k (k= 0, 1, 2 to K); k-hop representative nodes are preliminarily placed on k-layer hexagons in the topological diagram according to a set correspondence relationship, and the sequence of IDs (Identities) of the nodes on the k-layer hexagons is adjusted by adopting the genetic algorithm so as to enable the neighbor relationship among k-hop nodes to be correct; the sequence of the IDs of the nodes on the k-layer hexagons is adjusted through a rotation/inversion-containing re-sequencing fine-adjusting process so as to enable the physical neighbor relationship of (k-1)-hop nodes and the nodes on the k-layer hexagons to be correct; and finally, the rest k-hop non-representative nodes are sequentially placed according to the neighbor relationship. The method has the advantages that relative physical coordinates between the nodes and the system manager have no need of being calculated, the construction of the topological diagram is completed directly through the neighbor relationship among the nodes, and the nodes are divided into the representative nodes and the non-representative nodes, so that the method provided by the invention has good extendibility.

Description

A kind of method that makes up the industry wireless network topological diagram based on the improved genetic algorithms method

Technical field

The present invention relates to network communications technology field, be specifically related to a kind of industry wireless network topological diagram construction method that reflects each internodal correct neighborhood in the industry wireless network.

Background technology

The global view of industry wireless network system is the precondition of system management, and topological structure is an important models of structure global view.Wherein, constructing network topology is exactly according to the existence information of the network node that obtains and the topological diagram that the linking relationship between them is drawn out whole network.In industrial application, constructing network topology just as the core of configuration management and the basis of fault management, has occupied critical role in the exploitation of whole network.

The algorithm of at present common topological structure all is to calculate the nodal exactness coordinate by linking relationship and father and son address of node, then shows.But these methods all need the relative coordinate of specific node and distance each other, and the topological structure that therefore draws is more accurate, require higher to algorithm.But in practical operation, because a variety of causes often can not obtain accurately node coordinate and distance.Moreover in the wireless industrial scene, in the not too high situation of required precision, those algorithms also not too meet the requirements, and these methods are for interpolation or the minimizing of node, and its expansion is perfect not, does not really embody the neighborhood between each node.

On July 15th, 2009, disclosed application number was 200810240386.8 Chinese patent application " the topological rendering algorithm of wireless self-organization network ", a kind of distributed network topology algorithm has been proposed, the node centre that neighbor node is maximum, all the other nodes are pressed the order of neighbor node number descending, the coordinate that calculates each node according to neighbor information is placed on the concentric circles, the connection of reproducing network topology.Adopt the method to have following problem: what be placed on topological center is not system administration manager but the maximum node of neighbor node number can not clearly be told the observer network configuration, so particularly for tree network.Secondly, each node of this algorithm will just can be calculated concrete coordinate according to previous definite node location, has caused waste in efficient and time.Although above-mentioned disclosed patent documentation has reproduced the connection of network topology according to neighborhood, can not really reflect the actual physics orientation of node, thereby affect network management.Secondly, the placement of this each node of algorithm will with reference to the position of separately neighbours and the same hop node of having placed, if the nodes number is more, then can increase the time complexity of algorithm.

Summary of the invention

The present invention is directed to prior art and make up the above-mentioned technical problem that exists in the industry wireless network topological diagram, a kind of network topological diagram construction method that simply, fast, effectively reflects position relationship between neighbor node that is applicable to comprise the industry wireless network of great deal of nodes is provided.

The technical scheme that the present invention solves the problems of the technologies described above is to propose a kind of method that makes up the industry wireless network topological diagram.Specifically comprise:

With the system administration manager node as Centroid, each node is collected information of neighbor nodes and is sent to system administration manager, system administration manager calculates the minimum range of each node, the jumping figure of determining all nodes according to minimum range (comprises 0 ... K jumps), wherein 0 hop node is the management node that is positioned at the network topology center, and K jumps and to be jumping figure farthest.From the set of K hop node, choose representation node set N according to the similarity of neighbor node set _k, be N according to the representation node set of jumping figure j hop node _{K, j}(j=1,2 ..., k), respectively from 1 ... K jumps representation node set N _{K, j}Middle selection node is placed on Topology Architecture 1 successively ... on the hexagonal summit of K layer; Successively the representation node that is placed on the K layer hexagon vertex position is carried out the adjustment of position according to genetic algorithm, its neighborhood physical location neighborhood actual with it that satisfies between the representation node that is on the topological framework summit is matched.At last, according to the neighborhood information between non-representation node and representation node, will remain non-representation node and also all put into the topological diagram framework, thereby finish the drafting of topological diagram.

Representation node is adjusted the position to be specially: set up with jumping interior nodes neighborhood information table, arrange and set N of living in respectively in the relation information table _{K, i}Identical belongs to jumping location sets Q _{K, i}Interior a certain position element is to being positioned at any two positions element P of k layer _{K, i}With P _{K, j}, according to the position element in the relation information table in formula j=(i+k) mod6k or this layer of j=(i+2k) mod6k conversion, according to the fitness function formula Computing node x just when, when f (x)=12k, the node location adjustment is finished, wherein, E (x _i) number that satisfies physical neighborhood relation that in the topological diagram framework of current state, exists for node, k is node jumping figure of living in.

Node placement is specially at the hexagon vertex position: in per 1 layer of hexagon, begin to be followed successively by clockwise the position P that places the k-hop representation node from the upper right corner _{K, i}(i=1,2,3 ..., 6k), P _{K, i}Has the node ID value, position P _{K, i}Assign to set P _{K, j}In, wherein, $j=\left\{\begin{array}{cc}i\mathrm{mod}k,& i\≠\mathrm{nk}\\ k,& i=\mathrm{nk}\end{array}\right.$ I=1,2 ... 6k, Q _{K, j}(j=1,2 ..., k) be j node layer location sets.

For the node between the adjacent hop, be starting point from the system management node, make two rays through being positioned at the hexagonal arbitrary summit of ground floor respectively, so that the node that is positioned on adjacent two rays satisfies: E (p _{K, 1}, p _K+1,1)=, E (p _{K, 1+ (k)}, p _{(k+1), 1+ (k+1)})=1. (k=0,1,2 ... K), wherein, p _{K, i}Expression is positioned at k layer i position.The representation node of selecting specifically comprises: from all K hop node set Nr ₁, Nr ₂... Nr _KIn arbitrary set Nr _iIn choose maximum 6i nodes and consist of representation nodes set N ₁, N ₂... N _K, be specially, if set Nr _iIn node

, n _{K, j}∈ N _k, n so _{K, i}With n _{K, j}Neighbor node set nr _{K, i}, nr _{K, j}Common factor be nr _{K, i}⌒ nr _{K, i}Satisfy condition

Node as representation node.

Because this invention is adopted genetic algorithm and has been improved genetic manipulation, carries out the position adjustment by rotation/backout.Do not need to calculate all node coordinates, directly utilize neighborhood, the method simple, intuitive of the topological diagram of structure expression node neighborhood, neighborhood is accurate, can make the user draw quickly and easily the relative position of each node and the neighborhood between each node, directly finish the structure of topological diagram by internodal neighborhood, so that method of the present invention is with good expansibility, more help later network management.

Description of drawings

Fig. 1 topological diagram makes up flow chart;

Fig. 2 network topological diagram framework;

The concentric hexagon of Fig. 3 position adjustment figure;

Fig. 4 k-hop representation node utilizes improved genetic algorithm to adjust flow chart.

Embodiment

The industry wireless network topology discovery method that the present invention proposes reaches by reference to the accompanying drawings embodiment and is described in detail as follows.Be illustrated in figure 1 as topological diagram of the present invention and make up flow chart.

When new node networks system administration manager distribute one ID number, network finish after each node neighbor information is sent to manager, system administration manager is stored and is calculated above-mentioned information, gets egress to the jumping figure information of system administration manager.System administration manager divides into groups according to the similarity of each node neighbor node set to each hop neighbor node, and wherein the k-hop neighbor node of system administration manager can be divided at most 6k group.Each group selects a representation node to participate in the calculating of follow-up topological diagram at random.

Then manager is placed on the topological diagram center, 1 hop node is put on the position on 1 layer of hexagon summit of framework at random.Utilize genetic algorithm to adjust the node location of 1 hop neighbor node ID in 1 layer of hexagon according to the neighborhood of node, so that the layout realistic neighborhood of 1 hop neighbor node ID in 1 layer of hexagon.Then utilize the 1 hop neighbor node put well and the neighborhood between the 2 hop neighbor nodes that 2 hop nodes are classified, again 2 hop nodes are put into respectively on 2 layers of hexagon of topological diagram by the set rule of correspondence, continue to utilize the genetic algorithm adjustment, rotate subsequently 2 layers of hexagon or backward and reset node location in 2 layers of hexagon, so that the node physical neighborhood relation between 2 layers of hexagon and the 1 layer of hexagon is not all correctly yet.Repeat said process, until neighborhood is all correct between the node in each layer hexagon.At last all non-representation nodes are put into respectively framework according to its neighborhood separately, finish the topological diagram structure of industry wireless network.System if there is new node to add, then was placed on node in the topological diagram framework according to neighbor information after operation a period of time.

According to the neighbouring relations of neighbor node the k-hop neighbor node of system administration manager is divided at most the k group, selects at most 6 representation nodes for every group, remaining node is non-representation node.All are that the representation node of k all is presented on the hexagon that the length of side is 6kR apart from the Centroid jumping figure, and the placement location distance is 1 layer of hexagonal length of side for R(R between representation node), 1 of identical central node represents neighbor node to k-hop and consists of concentric hexagonal structure.The non-representation node of k-hop is placed on its corresponding representation node and its N Along ent place with hop neighbor representation node line.Utilize genetic algorithm according to the fitness function value, respectively the operation adjustment position relationship is carried out in k k-hop representation node set, the neighborhood physical location neighborhood actual with it between the representation node that is on the topological framework summit matched, when adjusting the position of adjacent layer hexagon intermediate node, only need to judge two rays take the display frame center as starting point and the neighborhood between the hexagonal intersection point of adjacent layer, and do not need to check all nodes.Be rotated/the backward adjustment when neighborhood is incorrect on the concentric hexagon of adjacent hop, the node on the k+1 layer hexagon that turn clockwise first, if invalid, then backward is reset the ID ordering that k+1 jumps representation node, the outer node layer of rotation is adjusted again.Rotation and backward stop after being adjusted at k-hop and the ordering correctly of k+1 jumping adjacent hop representation node, otherwise carry out loop iteration

At first in this constructing network topology, the improved genetic algorithms method that is placed on the representation node on the k layer hexagon that is used for sorting is defined as follows:

A) parameter coding.Set up with jumping interior nodes neighborhood information table, this table comprises and is in the hop node collection with present node and the nodal information of neighborhood is arranged, and networking information is encoded by table 1:

Table 1:

Self ID number

Adjacent 1ID number

Adjacent 2ID number

The position

The limit number

Wherein, ID number of obtaining when networking for each node of self ID number, adjacent 1ID number be respectively for adjacent 2ID number to be in the hop node collection with present node and the node ID number of neighborhood is arranged, the position is the position of present node on the network topological diagram framework, and the limit number then is to be in the hexagonal actual neighborhood number that satisfies of layer with present node in the topological diagram framework.

B) setting of initial population: the representation node that is in same number of hops is set to an initial population, and " position " in the parameter coding table is made as respectively and self set N of living in _{K, i}Identical belongs to the topological diagram framework with jumping location sets Q _{K, i}Interior a certain position element, but can not establish the position that had been set up.

C) adopt hereditary computing and evolution computing adjustment to be arranged in the position of the node neighborhood information table coding of k layer hexagonal-shaped frame place node.Being illustrated in figure 4 as the k-hop representation node utilizes improved genetic algorithm to adjust flow chart.Wherein, crossing operation is exactly that two individualities in the population (are positioned at any two positions P of k layer hexagonal-shaped frame k layer _{K, i}With P _{K, j}), according to the position in the nodes encoding in j=(i+k) mod 6k or j=(i+2k) the mod 6k exchange same layer, thereby generation new population, the variation computing then comprises: after passing through a series of crossing operations, the neighborhood good according to the part adjusted is further divided into some sub-populations with population, then presses the again whole sub-population position of adjusting of neighborhood.

As shown in the table:

Table 2:

Upper table is the result after the two-layer hexagon node after utilizing crossing operation to adjust tiles, by the neighborhood of adjusting the double bounce representation node is divided into three sub-populations, then choose a sub-population wantonly, here choose sub-population 2, place it in after the sub-population 3 by neighborhood integral body, obtain result as shown in table 3:

Table 3:

Define Selecting operation in the evolution computing, the fitness function f (x) of the new population that namely judge to generate, obtain population just when, if should just when less than former population just when, the new population that then generates is eliminated, otherwise just selects new population to continue computing as genetic group.During this time, the computing of once evolving is once just carried out in hereditary computing operation.

D) fitness function.If x is certain population (node set), xi (i=1,2 ..., 6k) be individuality (node) among the population x, E (x _i) be population at individual x _iThe in esse number that satisfies physical neighborhood relation in the topological diagram framework under current state, f (x) be population x just when, k is the residing jumping figure of this population, then just when

$f\left(x\right)=\underset{i=1}{\overset{6k}{\mathrm{\Σ}}}E\left(x_i\right)$

Obviously, the span of f (x) is: f (x) ∈ [0,12k], when f (x)=12k, node location adjustment success is described then, and algorithm is ended, otherwise, stronger just when larger expression Population adaptation ability, just be selected the continuation computing.

2, the following placement that specifies node as an example of a kind of laying method example, the vertex position on the Topology Architecture and the network access node in the network are carried out following division:

Place the vertex position on the Topology Architecture.Be illustrated in figure 2 as the network topological diagram framework, therefrom outside the mind-set, be followed successively by k layer (k=0,1,2 ... K) hexagon, in per 1 layer of hexagon, beginning to turn clockwise from the upper right corner is followed successively by the position P that places the k-hop representation node _{K, i}(i=1,2,3 ..., 6k), P _{K, i}Have the node ID value and show in this position have radio node to exist.And the node location on these k layer hexagons is divided into k location sets Q _{K, j}(j=1,2 ..., K), position P _{K, i}Assign to set Q _{K, j}In.Wherein,

$j=\left\{\begin{array}{cc}i\mathrm{mod}k,& i\≠\mathrm{nk}\\ k,& i=\mathrm{nk}\end{array}\right.$ ?(i=1,2,…6k)

For example, in the hexagon of k=3, node location has 18, i.e. P _3,1, P _3,2, P _3,3P _3,18, they assigned in three groups with set be expressed as respectively: Q _3,1={ P _3,1, P _3,4, P _3,7, P _3,10, P _3,11, P _3,13, P _3,16, Q _3,2={ P _3,2, P _3,5, P _3,8, P _3,11, P _3,14, P _3,17, Q _3,3={ P _3,3, P _3,6, P _3,9, P _3,12, P _3,15, P _3,18.

Divide network access node: after node all networks, system administration manager obtains the neighbor table information of each node, calculates each node to the minimum range of system administration manager node ID, according to distance, each node is divided into 1 hop node, 2 hop nodes ... the K hop node is expressed as Nr with the set form ₁, Nr ₂... Nr _K, K is the maximum hop count of nodal distance system administration manager node in the current network.From all K hop node set Nr ₁, Nr ₂... Nr _KIn arbitrary set Nr _iIn choose maximum 6i nodes and consist of representation nodes set N ₁, N ₂... N _KWherein, the representation node of selection satisfies following relation: if set Nr _iIn node

, n _{K, j}∈ N _k, n so _{K, i}With n _{K, j}Neighbor node set nr _{K, i}, nr _{K, j}Common factor be nr _{K, i}⌒ nr _{K, i}Satisfy condition

Node as representation node.The optimum span of parameter beta is 0≤β≤0.5.

3, jump representation node ID with 1 and randomly, repeatedly be not placed on 1 layer of hexagon summit of topological diagram framework, call genetic algorithm and adjust the position that these 1 jumping representation nodes ID places, make the physical neighborhood relation between them all correct.Then the position that all K jump representation node is placed and adjusted to recurrence as described below.

Suppose that at first current K jumps representation node n _{K, 1}～n _{K, 6k}Be placed in successively the hexagonal P of K layer _{K, 1}～P _{K, 6k}On the position, then K+1 jumping representation node just is divided into K+1 set.Check that K jumps the set n of representation node _{K, p}All K+1 hop neighbor nodes.When p mod k=1, find out neither n _{K, p-1}Neither n _{K, p+1}K+1 hop neighbor node, put it into the set N _{K+1, q}(q=p mod k); When p mod k ≠ 1, finding out is n _{K, p-1}Again n _{K, p}The K+1 hop neighbor, put it into the set N _{K+1, q}(q=p mod (k+1)), finding out is n _{K, p}Again n _{K, p+1}The K+1 hop neighbor, put it into the set N _{K+1, q}(q=(p mod (k+1))+1).Wherein, if p=1 then makes n _{K, p-1}Be n _{K, 6k}If p=6k then makes n _{K, p+1}Be n _{K, 1}According to this rule, after checking out all K and jumping representation nodes, then K+1 jumps representation node and just is divided into K+1 set.The same node point that occurs in each set is by a calculating.Then, K+1 is jumped the set N of representation node _{K, j}(j=1,2 ..., the node ID in k) is not repeatedly put into respectively relevant position set Q at random _{K, j}In position corresponding to certain element on.Then with each node location on the described genetic algorithm adjustment of the step 1 K+1 layer hexagon, the physical neighborhood relation that K+1 is jumped between the representation node is all coincide.

For example: the placement of 2 jumping representation nodes is as follows:

Suppose the node n that adjusts _1,1～n _1,6Be successively placed on 1 layer of hexagonal position P _1,1～P _1,6On, defined variable i is initialized as 1, is used for record grouping number, from position P _1,1Begin to P _1,6Check in turn the node in each position:

1) taking-up is positioned at P _1,1On node n _1,1, check n _1,1All 2 hop neighbor nodes, find out neither n _1,2Neither n _1,62 hop neighbors, put it into the set N _2,1Finding out is n _1,1Be again n _1,22 hop neighbors, put it into the set N _2,2

2) in like manner, inspection is positioned at position P _1,2On node n _1,2All 2 hop neighbor nodes, find out neither n _1,1Neither n _1,32 hop neighbors, put into the set N _2,1Finding out is n _1,2Be again n _1,32 hop neighbors, put into the set N _2,2

3) owing to be that 2 hop nodes are being classified, (2 hop nodes are gathered N so only need to be divided into two set _2,1, N _2,2).Copy 1) or 2), check out position P _1,1～P _1,6On the 2 hop nodes classification that just ID can be gathered among the N of all nodes finish.

According to above-mentioned 2 hop nodes classification set N _2,1, N _2,2, belong to set N _{2, i}Node can only be placed at random relevant position set Q _2iCertain position on, and node and position are one to one.Such as 2 hop node n ₃Be assigned to set N _2,2In, so this moment, it just is placed on 2 layers of hexagonal location sets Q of framework at random _2,2={ P _2,2, P _2,4, P _2,6, P _2,10, P _2,12In certain position P _{2, i}, according to this rule, put 2 all hop nodes well.Again 2 hop nodes are carried out the position adjustment.

4, above process has just been adjusted the position between the single-hop internal node, and the relation of node also may be incorrect between the adjacent hop, and the position relationship of node also need be adjusted between namely k-hop and k+1 jumped.In order to make the node neighborhood between each the concentric hexagon in the topological diagram framework also correct, be in the locational node of each layer hexagon in the topological diagram framework or backward by turning clockwise and reset the node of respectively jumping the position, (two ray is take the system management node as the summit so that be arranged in two rays of Fig. 3, then every ray gets final product through some hexagonal summits of ground floor that is positioned at, here distinguishingly getting two shown in Figure 3 is the example explanation) on node between neighborhood correct, i.e. E (p _{K, 1}, p _K+1,1)=1, E (p _{K, 1+ (k)}, p _{(k+1), 1+ (k+1)})=1. (k=0,1,2 ... K). wherein, p _{K, i}Expression is positioned at the i position of k layer, E (p _{K, i}, p _{K+1, j}) expression is positioned at concentric hexagon p _{K, i}And p _{K+1, i}Actual physics neighborhood between the two positions representing node, if these two nodes are neighbours in actual physics, E (p so _{K, 1}, p _K+1,1) equal 1, otherwise equal 0.

A) adjust first 1 jump and 2 layers of hexagon node between relation.Check 1 layer of hexagonal position P _1,1On node (be assumed to be n _1,1), see it whether with 2 layers of hexagonal position P _2,1On node (be assumed to be n _2,1) be neighbours, i.e. E (p _1,1, p _2,1Whether set up)=1, if be false, then each node on the 2 layers of hexagon that then turn clockwise continue to check whether neighbours of these two locational nodes, until they are neighbours, then forwards B to); If set up, then directly forward B to).

B) check 1 layer of hexagonal position P _1,2On node, see it whether with 2 layers of hexagonal position P _2,3On node be neighbours, if E (p _1,2, p _2,3Set up)=1, illustrates that then the node location adjusted between 1 layer of hexagon and the 2 layers of hexagon is good, forwards C to); If be false, then with the node on 2 layers of hexagon from P _2,1The position begins backward and resets (such as, original 2 layers of hexagonal position P _2,1～P _2,12On node be followed successively by n _2,1～n _2,12, after backward is arranged now, P _2,1～P _2,12On node be followed successively by n _2,1, n _2,12, n _2,11, n _2,10, n _2,9, n _2,8, n _2,7, n _2,6, n _2,5, n _2,4, n _2,3, n _2,2), the node location between such two hexagons has just been adjusted, and then forwards C to).

C) copy A) and B), adjust the node location between 2 layers of hexagon and the three layers of hexagon.Different is to check specifically E (p _1,2, p _2,3) and E (p _2,3, p _3,4).

D) adjust successively the position of node between all K layer hexagons, make up and finish network topological diagram.

5, because the vertex position in the topological diagram is limited, inevitable inconsistent with physical node quantity, when remaining node occurring, in order to allow network topological diagram have extensibility, also need non-representation node is also added among the figure according to the following rules.

When remaining node occurring, if a node n who locates with the k-hop summit in k-hop node to be put into and the framework _{K, i}Identical neighborhood is arranged, and then node to be put into just is placed on node n _{K, i}The k-1 hop node n that is adjacent _{K-1, i}On the line segment that the position is connected; Setting tool has the node of this neighborhood to add up to N, and then node is placed respectively on the N Along ent of line segment.

If in k-hop node to be put into and the framework with two adjacent node n on the k-hop summit _{K, i}And n _{K, i+1}Be neighborhood, then this node is placed on by node n _{K, i}n _{K, i+1}N Along ent place on the connecting line segment of position.

B) if k-hop node to be put into (is made as n with two adjacent nodes on the k-hop summit with being placed in the framework _{K, i}And n _{K, i+1}) be neighborhood, then this node is placed on line segment n _{K, i}n _{K, i+1}On N Along ent place.

Can draw out effectively by the design that reflection network node neighbours connect, neighbours do not connect and the topological diagram of relative position, thereby can construct the global view of industry wireless network system, more reduced the danger of the operation under hazardous environment that in optimized network, reduces a staff, for configuration management and fault management are laid a good foundation.

The above is to specific embodiments of the invention, does not limit the present invention, and is within the spirit and principles in the present invention all, any modification of making, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (6)

1. method that makes up the industry wireless network topological diagram, it is characterized in that, as Centroid, system administration manager is divided into K according to the minimum range with each node with all nodes jumps, and chooses representation node set N according to similarity from the set of K hop node with the system administration manager node _k, respectively from 1 ... K jumps in the representation node set and selects node to be placed on successively Topology Architecture 1 ... the place, hexagon summit of K layer; Call genetic algorithm and successively the representation node that is placed on the K layer hexagon vertex position is adjusted the position, the neighborhood physical location neighborhood actual with it between the representation node that is on the topological framework summit matched, according to the neighborhood information between non-representation node and representation node, to remain non-representation node and all put into the topological diagram framework, thereby finish the drafting of topological diagram.

2. method according to claim 1 is characterized in that, representation node is adjusted the position be specially: set up with jumping interior nodes neighborhood information table, arrange and set N of living in respectively in the relation information table _{K, i}Identical belongs to jumping location sets Q _{K, i}Interior a certain position element is to being positioned at any two positions element P of k layer _{K, i}With P _{K, j}, according to the position element in the relation information table in formula j=(i+k) mod 6k or this layer of j=(i+2k) mod 6k conversion, according to the fitness function formula

Computing node x just when, when f (x)=12k, the node location adjustment is finished, wherein, E (x _i) number that satisfies physical neighborhood relation that in the topological diagram framework of current state, exists for node, k is node jumping figure of living in.

3. method according to claim 1 is characterized in that, node placement is specially at the hexagon vertex position: in per 1 layer of hexagon, begin to be followed successively by clockwise the position P that places the k-hop representation node from the upper right corner _{K, i}(i=1,2,3 ..., 6k), P _{K, i}Has the node ID value, position P _{K, i}Assign to set Q _{K, j}In, wherein,

I=1,2 ... 6k, Q _{K, j}(j=1,2 ..., k) be j node layer location sets.

4. method according to claim 1, it is characterized in that, for the node between the adjacent hop, be starting point from the system management node, make two rays through being positioned at the hexagonal arbitrary summit of ground floor respectively, satisfy so that be positioned at two adjacent nodes on the ray: E (p _{K, 1}, p _K+1,1)=1, E (p _{K, 1+k}, p _{(k+1), 1+ (k+1)})=1. (k=0,1,2 ... K), wherein, p _{K, i}Expression is positioned at k layer i position, E (p _{K, i}, p _{K+1, j}) expression is positioned at concentric hexagon p _{K, i}And p _{K+1, j}Actual physics neighborhood between the two positions representing node, if these two nodes are neighbours in actual physics, E (p so _{K, i}, p _{K+1, j}) equal 1, otherwise equal 0.

5. method according to claim 1 is characterized in that, the representation node of selection specifically comprises: from all K hop node set Nr ₁, Nr ₂... Nr _KIn arbitrary set Nr _iIn choose maximum 6i nodes and consist of representation nodes set N ₁, N ₂... N _K, be specially, if set Nr _iIn node

, n _{K, j}∈ N _k, n so _{K, i}With n _{K, j}Neighbor node set nr _{K, i}, nr _{K, j}Common factor be nr _{K, i}⌒ nr _{K, i}Satisfy condition

Node as representation node, the optimum span of parameter beta is 0≤β≤0.5.

6. method according to claim 1 is characterized in that, when remaining node occurring, if a node n who locates with the k-hop summit in k-hop node to be put into and the framework _{K, i}Identical neighborhood is arranged, and then node to be put into just is placed on node n _{K, i}The k-1 hop node n that is adjacent _{K-1, i}On the line segment that the position is connected; If in k-hop node to be put into and the framework with two adjacent node n on the k-hop summit _{K, i}And n _{K, i+1}Be neighborhood, then this node is placed on by node n _{K, i}n _{K, i+1}N Along ent place on the connecting line segment of position.

Images