CN109699091A - A kind of wireless sensor network system - Google Patents
A kind of wireless sensor network system Download PDFInfo
- Publication number
- CN109699091A CN109699091A CN201910084121.1A CN201910084121A CN109699091A CN 109699091 A CN109699091 A CN 109699091A CN 201910084121 A CN201910084121 A CN 201910084121A CN 109699091 A CN109699091 A CN 109699091A
- Authority
- CN
- China
- Prior art keywords
- chromosome
- node
- solution
- network
- complex
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0076—Distributed coding, e.g. network coding, involving channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
Abstract
A kind of wireless sensor network system, including node selection device and multiple sensor nodes；Node selection device is coupled with the multiple sensor node respectively；The node selection device, suitable for from the potential coding nodes in the sensor node in wireless sensor network selected part node as coding nodes；The potential coding nodes are that the quantity of emitting edge is greater than or equal to 2 and is emitted the sensor node of the quantity more than or equal to 1 on side；Selected coding nodes, suitable for acquiring corresponding monitoring data and carrying out coded transmission to corresponding next node；Other sensors node in addition to the coding nodes, suitable for acquiring corresponding monitoring data and being transmitted to corresponding next node.The data transmission efficiency of wireless sensor network can be improved in above-mentioned scheme, improves network throughput.
Description
Technical field
The present invention relates to fields of communication technology, more particularly to a kind of wireless sensor network system.
Background technique
Compared to wire net and internet, wireless sensor network is larger, it may be said that is ubiquitous.But
Wireless sensor network has the characteristics that energy constraint, computing capability be insufficient, the traditional networks such as in large scale do not have, this is to passing
The research and application of sensor network bring many difficulties.Lot of domestic and international colleges and universities, research institute are real by research in 10 years or so
It tramples, achieves a series of research achievement.
Multicast network in wireless sensor network is a kind of one-to-many network, in multicast network, an information source section
Point can send message to multiple information destination nodes.The concept of network code is to be proposed by Ahlswede R et al. and formally delivered
In 2000, theoretical research and experiment illustrated advantage of the network code in wireless sensor network, such as multicast network
The middle performance boost that can make its network throughput and robustness etc. using network code.
But the data transmission method in existing wireless sensor network, it there is a problem that data transmission efficiency is low.
Summary of the invention
Present invention solves the technical problem that being how to improve the data transmission efficiency of wireless sensor network, improves network and gulp down
The amount of spitting.
In order to achieve the above object, the present invention provides a kind of wireless sensor network system, including node selection device and
Multiple sensor nodes；Node selection device is coupled with the multiple sensor node respectively；
The node selection device, suitable for from the potential coding nodes in the sensor node in wireless sensor network
Selected part node is as coding nodes；The potential coding nodes are that the quantity of emitting edge is greater than or equal to 2 and is emitted side
Quantity is greater than or equal to 1 sensor node；
Selected coding nodes, suitable for acquiring corresponding monitoring data and carrying out coded transmission to corresponding next section
Point；
Other sensors node in addition to the coding nodes, suitable for acquiring corresponding monitoring data and being transmitted to correspondence
Next node.
Optionally, the node selection device, suitable for wireless sensor network is converted to digraph network, and using figure
Decomposition algorithm decomposes the digraph network；Based on the corresponding network code resource of digraph network struction after decomposition
Optimized mathematical model, and the optimal solution of the network code resource optimization mathematical model is solved, obtain selected coding nodes.
Optionally, the network code resource optimization mathematical model constructed by the node selection device are as follows:
And:
Wherein, Φ (GNCM) indicate the digraph network after decomposing coding side quantity, Min () indicates to solve minimum
Value, ξijIndicate that the j-th strip of i-th of potential coding nodes in the digraph network after decomposing exports side, when i-th of potential coding section
The j-th strip output side of point executes encoding operation, then ξ is arrangedij=1, conversely, ξ is then arrangedij=0；R (s, tk) indicate source sensor
Node s to purpose sensor node tkReachable multicast rate, OiIndicate the quantity on the outgoing side of i-th of potential coding nodes, pi
(s, tk) indicate source sensor node s to purpose sensor node t in digraph network after disassemblykThe i-th paths, γi
(s, tk)={ e | e ∈ pi(s, tk), indicate path pi(s, tk) all links set.
Optionally, the node selection device is suitable for initialization chromosome complex, obtains corresponding initial chromosome group；Institute
State the solution that the chromosome in chromosome complex respectively corresponds the network code resource optimization mathematical model；Based on current dyeing
The current location of chromosome in body group, calculates the fitness value of each chromosome；It is suitable based on each chromosome being calculated
Angle value is answered, the history optimal solution of history optimal solution and chromosome complex to each chromosome of current chromosome group is updated, and is obtained
Work as the corresponding chromosome complex of previous iteration to executing；To execution when the chromosome in the chromosome complex that previous iteration obtains executes choosing
It selects, intersect and mutation operation；Next iteration is executed, until the number of iterations reaches preset frequency threshold value, is exported corresponding every
The history optimal solution of a chromosome and the history optimal solution of chromosome complex, as the network code resource optimization mathematical model
Optimal solution.
Optionally, the node selection device, it is each in the chromosome complex for executing and obtaining when previous iteration suitable for calculating
The fitness numerical value of chromosome constructs the execution and works as the corresponding fitness array of chromosome complex that previous iteration obtains；Based on institute
The red maximum adaptation degree value of fitness array and minimum fitness numerical value are stated, the probability right of each chromosome is calculated；It is based on
The corresponding accumulation of chromosome complex executed when previous iteration obtains is calculated in the probability right for each chromosome being calculated
ProbabilityDistribution Vector；It is random to generate a random number between 0 to 1 of N and arranged according to sequence from small to large, process pair
The random vector answered；To corresponding position in the cumulative probability distribution vector and the random vector cumulative probability distribution vector
Numerical value is compared, and the numerical value of corresponding position is accumulated greater than the random vector in determining the cumulative probability distribution vector
In ProbabilityDistribution Vector when the numerical value of corresponding position, then X is seti(t+1)=Xi(t)。
Optionally, the node selection device, be suitable for before executing next iteration, from executes selection, intersection and change
Corresponding current solution is obtained in the chromosome in chromosome complex obtained after ETTHER-OR operation, and corresponding guiding solution is calculated；Institute
Current solution is stated to execute the optimal solution in the chromosome complex obtained after selection, intersection and mutation operation；Determine it is described it is current solution with
Difference bit between the guiding solution；It is solved along current solution to the guiding and carries out track search, after obtaining track search
Chromosome complex；During solving progress track search to the guiding along current solution, work as described in a difference bit correspondence
Preceding solution to it is described guiding solution it is primary mobile when, the current solution to it is described guiding solution each moving process in, generate pair
Corresponding optimal solution is found out in the new explanation for answering quantity from new explanation generated, and when determining corresponding optimal solution is better than executing choosing
Select, intersect and mutation operation after worst solution in obtained chromosome complex when, replace executing selection, friendship using corresponding optimal solution
The worst solution in chromosome complex obtained after fork and mutation operation, until being obtained when the current solution is moved to guiding solution
Chromosome complex after the track search.
Optionally, the node selection device, is suitable for one temporary position random chromosomal of setting, and the temporary position is random
The numerical value of all positions in chromosome is 1；It is random to generate the chromosome complex including N number of chromosome, it obtains corresponding initial
Chromosome complex；The chromosome of each position is the optimal chromosome of history of the position in the initial chromosome group；In sequence
Position in the temporary position random chromosomal is traversed, the current location traversed is obtained；By the temporary position
The numerical value of current location in random chromosomal is set as 0, and keeps the numerical value of other positions constant, generates new temporary position
Random chromosomal；When the fitness value for determining new temporary position random chromosomal generated is random greater than the temporary position
When the fitness value of chromosome, replaced in the initialization chromosome complex using new temporary position random chromosomal generated
The chromosome with worst fitness value, until traversal position quantity be greater than preset amount threshold, obtain final
Initial chromosome group.
Compared with prior art, the invention has the benefit that
Above-mentioned scheme, by node selection device from the potential coding in the sensor node in wireless sensor network
Selected part node is as coding nodes in node, and the smallest coding number of edges can be used, and to reach network code institute attainable most
Big network rate, so as to improve the network throughput of wireless sensor network, improve data transfer efficiency.
Detailed description of the invention
In order to more clearly explain the technical solutions in the embodiments of the present application, make required in being described below to embodiment
Attached drawing is briefly described, it should be apparent that, the drawings in the following description are only some examples of the present application, for
For those of ordinary skill in the art, without any creative labor, it can also be obtained according to these attached drawings
His attached drawing.
Fig. 1 is a kind of structural schematic diagram of wireless sensor network system of the embodiment of the present invention；
Fig. 2 is a kind of flow diagram of wireless sensor network data transmission method of the embodiment of the present invention；
Fig. 3 is in the potential coding nodes in the sensor node in the slave wireless sensor network in the embodiment of the present invention
Flow diagram of the selected part node as the method for coding nodes；
Fig. 4 is that potential coding nodes carry out decomposition diagram in the embodiment of the present invention；
Fig. 5 is the flow diagram of the chromosome complex algorithm progress population iteration in the embodiment of the present invention；
Fig. 6 is the example schematic of the local search algorithm in the embodiment of the present invention.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present application, technical solutions in the embodiments of the present application carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of embodiments of the present application, instead of all the embodiments.It is based on
Embodiment in the application, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall in the protection scope of this application.Related directionality instruction in the embodiment of the present invention (such as upper and lower, left and right,
It is forward and backward etc.) it is only used for the relative positional relationship explained under a certain particular pose (as shown in the picture) between each component, movement feelings
Condition etc., if the particular pose changes, directionality instruction is also correspondingly changed correspondingly.
In the prior art, wireless sensor network is in traditional wireless sensor network, and multicast router is using storage-
The mode of forwarding transmits data, this makes the handling capacity of wireless sensor network receive certain limitation.
The network code proposed by RudolfAhlswede, Li Shuoyan et al. in 2000, so that wireless sensor network can
To obtain theoretic maximum throughput, and network code can be with energy saving, the safety of improve data transfer.
However, network-encoding operation is related to complicated data operation, excessive coding can consume a large amount of computer
CPU and memory source, therefore, under the premise of guaranteeing multicast rate, how to reduce the number of network code reduce operation at
This, particularly important studies a question so that improve data transfer rate is one.
Technical solution of the present invention passes through node selection device from diving in the sensor node in wireless sensor network
Selected part node is as coding nodes in coding nodes, and the smallest coding number of edges can be used reaching network code can reach
The maximum network rate arrived, so as to improve the network throughput of wireless sensor network, improve data transfer efficiency.
It is understandable to enable above-mentioned purpose of the invention, feature and beneficial effect to become apparent, with reference to the accompanying drawing to this
The specific embodiment of invention is described in detail.
In order to make it easy to understand, carrying out letter to the structure of the wireless sensor network system in the embodiment of the present invention first below
The introduction wanted.
Fig. 1 is a kind of structural schematic diagram of wireless sensor network system of the embodiment of the present invention.Referring to Fig. 1, Yi Zhongwu
Line sensor network system may include node selection device 10 and multiple sensor nodes 111~11N.Wherein, node selection
Device 10 respectively with the multiple sensor node 111~11NCoupling.
The working principle of wireless sensor network system shown in FIG. 1 will be introduced below.
Fig. 2 is a kind of flow diagram of wireless sensor network data transmission method of the embodiment of the present invention.Referring to figure
2, a kind of wireless sensor network data transmission method can specifically include following step:
Step S201: node selection device is from the potential coding nodes in the sensor node in wireless sensor network
Selected part node is as coding nodes, so that reaching the attainable maximum web of network code institute using the smallest coding number of edges
Network rate.
In specific implementation, the quantity of the potential coding nodes to be in wireless sensor network be emitting edge is greater than or waits
Quantity in 2 and outgoing side is greater than or equal to 1 sensor node.
Step S202: selected coding nodes acquire corresponding monitoring data and carry out coded transmission under corresponding
One node.
In specific implementation, selected coding nodes are the biography for needing to encode itself monitoring data collected
Sensor node, therefore, when collecting corresponding monitoring data, which carries out the collected monitoring data of institute first
Coding, the next node being then then forwarded in corresponding routing.
Step S203: the other sensors node in addition to the coding nodes acquires corresponding monitoring data and is transmitted to
Corresponding next node.
In specific implementation, the other sensors node in addition to selected coding nodes is not necessarily to collected to itself
The sensor node that monitoring data are encoded, therefore, when collecting corresponding monitoring data, which will be acquired
To monitoring data be transmitted directly to the next node in corresponding routing.
Above-mentioned scheme, by node selection device from the potential coding in the sensor node in wireless sensor network
Selected part node is as coding nodes in node, and the smallest coding number of edges can be used, and to reach network code institute attainable most
Big network rate, so as to improve the network throughput of wireless sensor network, improve data transfer efficiency.
Below in conjunction with Fig. 3 to the node selection device in the embodiment of the present invention from the sensor in wireless sensor network
Selected part node is described in detail as the method for coding nodes in potential coding nodes in node.
Fig. 3 shows the potential coding section in the sensor node in the slave wireless sensor network in the embodiment of the present invention
Flow diagram of the selected part node as the method for coding nodes in point.Referring to fig. 2, one kind is from wireless sensor network
Sensor node in potential coding nodes in method of the selected part node as coding nodes, can specifically include:
Step S301: wireless sensor network is converted into digraph network, and will be described oriented using figure decomposition algorithm
Figure network is decomposed.
Firstly, the structure according to wireless sensor network is modeled, network code resource optimization problem is converted into generation
Number problem, giving a directed acyclic graph G=(V, E) indicates a wireless sensor network, and wherein V indicates network node collection
It closing, E indicates network link set, | V | and | E | respectively indicate number of nodes and number of links.One single source multicast network coding
It can be indicated by (G, s, T, R), wherein G is digraph, and s ∈ V is multicast source node,It is more
Destination node number is broadcast, R is up to multicast rate.Assuming that the output information of each node is to input the linear combination of information, it is located at
In multicast network G, the set of paths of source s to destination node be P (s, t1), P (s, t2) ..., P (s, tk) ..., P (s,
t|T|), P (s, tk) is indicated from source point s to the path set of destination node k, P (s, tk)={ p1(s, tk), p2(s, tk) ..., pR
(s, tk), if multicast tree interior joint has in (v) >=2 emitting edge, out (v) >=1 is emitted side, and such node v is known as latent
In coding nodes, outgoing is when being known as encoding.
Digraph is decomposed, in digraph, the node of in-degree in (v) >=2 and out-degree out (v) >=1, which is referred to as, to converge
Point (also known as potential coding nodes).Assuming that there is a meeting point that there is in (v) emitting edge and out (v) item outgoing side, then draw
Enter a input auxiliary node u of in (v)1..., ui..., uin(v)And out (v) respectively exports auxiliary node w1... wj...,
wout(v), then in every a pair of of node (ui, wj) between be added an inlet flow.
Referring to fig. 4, it is shown as in (v)=2, the decomposable process of the meeting point of out (v)=2.One node V has
The Node Decomposition then can be U1, U2, two outgoing node W1 of two incident nodes by two emitting edges and two outgoing sides,
W2.So meeting point V can be represented by vectors as [e11, e12, e21, e22], wherein the value of e is 0 or 1, is indicated for 0
The connection of this side is not connected to for 1 expression this side, if w1 or w2 receive the data simultaneously from u1 and u2,
Indicate that the meeting point carries out network-encoding operation.Then whether all meeting points perform the encoding operation the vector that can be constituted by one 0,1
To indicate may determine that how many node performs the encoding operation altogether in network by the vector.
Step S302: based on the corresponding network code resource optimization mathematical model of digraph network struction after decomposition, and
The optimal solution for solving the network code resource optimization mathematical model obtains selected coding nodes.
In specific implementation, digraph network after obtaining decomposition, NCRM problem optimization object function are as follows:
And:
Wherein, Φ (GNCM) indicate the digraph network after decomposing coding side quantity, Min () indicates to solve minimum
Value, ξijIndicate that the j-th strip of i-th of potential coding nodes in the digraph network after decomposing exports side, when i-th of potential coding section
The j-th strip output side of point executes encoding operation, then ξ is arrangedij=1, conversely, ξ is then arrangedij=0；R (s, tk) indicate source sensor
Node s to purpose sensor node tkReachable multicast rate, OiIndicate the quantity on the outgoing side of i-th of potential coding nodes, pi
(s, tk) indicate source sensor node s to purpose sensor node t in digraph network after disassemblykThe i-th paths, γi
(s, tk)={ e | e ∈ pi(s, tk), indicate path pi(s, tk) all links set.
Therefore, network code resource optimization problem is converted to by the optimal solution of solution formula (2) and solves the network
The algebra problem of the optimal solution of coding resource optimized mathematical model.
In an embodiment of the present invention, in the optimal solution for solving the network code resource optimization mathematical model, chromosome
Group's algorithm carries out population iteration, and the fitness function value by minimizing chromosome complex screens population, specifically can wrap
It includes:
Step S501: executing the initialization of chromosome complex, obtains corresponding initial chromosome group.
In specific implementation, the chromosome in the chromosome complex respectively corresponds the network code resource optimization mathematical modulo
One solution of type.
In an embodiment of the present invention, in order to improve iteration speed, using improved greedy initialization algorithm to chromosome
Group is initialized, and is specifically included:
Firstly, one temporary position random chromosomal X of settingtemp, the temporary position random chromosomal XtempIn all positions
The numerical value set is 1, i.e. random chromosomal XtempFor complete 1 vector.
Later, random to generate the chromosome complex including N number of chromosome, obtain corresponding initial chromosome group X=(X1,
X2..., Xi..., XN), i=1,2 ..., N；The chromosome of each position is going through for the position in the initial chromosome group
The optimal chromosome of history is usedIt indicates the optimal chromosome of the history of i-th of position, is arranged
Then, the position in the temporary position random chromosomal is traversed in sequence, obtains working as of traversing
Front position, i.e., since j=1；By the current location in the temporary position random chromosomal, i.e. the numerical value of jth position is set as
0, and keep the numerical value of other positions constant, generate new temporary position random chromosomal X 'temp；
Then, judge whether the fitness value of new temporary position random chromosomal generated is greater than the temporary position
The fitness value of random chromosomal, and when the fitness value of determining new temporary position random chromosomal generated is greater than described
When the fitness value of temporary position random chromosomal, using new temporary position random chromosomal X ' generatedtempReplacement institute
The chromosome with worst fitness value in initialization chromosome complex is stated, until the quantity of the position of traversal is greater than preset number
Threshold value is measured, i.e. when j > D, the initialization operation of chromosome complex terminates, and obtains final initial chromosome group.Wherein, the numerical value of D
It can be arranged according to the actual needs, such as 10, herein with no restrictions.
Using above-mentioned chromosome complex initialization algorithm, so that the dyeing position in the initial chromosome group that initialization obtains
It sets closer to final optimal location, so as to accelerate subsequent population iteration speed, saves calculation resources.
It should be pointed out that the chromosome complex that the last time iteration obtains is that is, described first when executing first time iteration
Beginning chromosome complex.
Step S502: the current location based on chromosome in current chromosome group calculates the fitness value of each chromosome.
In an embodiment of the present invention, the fitness value of each chromosome is calculated using following formula:
Wherein, F (y) indicates the fitness value of chromosome.
Step S503: the fitness value based on each chromosome being calculated, to each chromosome of current chromosome group
History optimal solution and the history optimal solution of chromosome complex be updated, obtain executing when the corresponding chromosome complex of previous iteration.
In specific implementation, using following formula to the history optimal solution and dyeing of each chromosome of current chromosome group
The history optimal solution of body group is updated:
Wherein, t indicates the number of iterations,The history optimal solution of i-th of chromosome is indicated, as from the 0th time to the t times
There is the chromosome of minimum fitness value, X in i-th of the chromosome that iteration obtainsgIndicate the history optimal solution of chromosome complex, i.e.,
There is in all optimal chromosomes of history from 1 into N the chromosome of minimum fitness value for i.
Step S504: selection, intersection and variation are executed to the chromosome worked as in the chromosome complex that previous iteration obtains is executed
Operation.
In an embodiment of the present invention, selection is being executed to the chromosome executed in the chromosome complex obtained when previous iteration
When operation, include the following steps:
1) the fitness numerical value fi executed when chromosome each in the chromosome complex that previous iteration obtains is calculated, building should
Execute the corresponding fitness array F=of chromosome complex [f1, f2 ..., fi ..., fN] when previous iteration obtains.
2) the maximum adaptation degree value f red based on the fitness arraymaxWith minimum fitness numerical value fmin, calculate each
The probability right of chromosome.In an embodiment of the present invention, it is weighed using the probability that each chromosome is calculated in following formula
Weight f 'i:
f′i=fi/Fs (7)
And:
3) dyeing executed when previous iteration obtains is calculated in the probability right based on each chromosome being calculated
The corresponding cumulative probability distribution vector of body group.In an embodiment of the present invention, it calculates to execute using following formula and change when previous
The corresponding cumulative probability distribution vector F ' of chromosome complex that generation obtains:
F '=[f '1, f '1+f′2..., f '1+…+f′i..., f '1+…+f′N] (9)
4) N number of random number between 0 to 1 is generated at random and is arranged according to sequence from small to large, and process is corresponding
Random vector r=[r1, r2..., ri..., rN]。
5) the random vector r and cumulative probability distribution vector F ' are compared, and are determining the cumulative probability point
In cloth vector in the numerical value of corresponding position i corresponding position numerical value (f '1+…+f′i) it is greater than corresponding position in the random vector r
The numerical value r of iiWhen, then X is seti(t+1)=Xi(t), until whole positions of the random vector r and cumulative probability distribution vector F '
It sets and all relatively completes.
Then, to the dye after execution selection operation until colour solid population executes crossover operation.Specifically, for chromosome i,
The x position of itself and i+1 chromosome is interchangeable operation.For example, position is 3, Xi=[1,0,1,0,0,1], Xi+1=
[0,1,1,1,0,0], the then chromosome x after exchangingi=[1,0,1,1,0,0], wherein i=1,2 ..., N-1.
Then, mutation operation is executed to the chromosome complex after execution crossover operation.Detailed process are as follows: one gene of setting is prominent
Then variable element p generates the random number between N number of 0~1, r=[r at random1, r2..., ri..., rN], for riIf its is small
In p, then mutation operation is carried out to the chromosome, otherwise the chromosome is done nothing.In an embodiment of the present invention,
The position and speed of the chromosome in chromosome complex after being made a variation using following formula:
Vid(t+1)=wXid(t)+F(Xrd1(t)-Xrd2(t)) (12)
Wherein, Xid(t+1) position of i-th of chromosome d dimension after indicating t+1 iteration, Vid(t+1) t+ is indicated
The speed of the d dimension of i-th of chromosome, w indicate weight of the t for chromosome, X after 1 iterationr1(t) indicate t for chromosome
The d of the item chromosome selected at random in group ties up position, Xr2(t) indicate in addition t is selected at random in chromosome complex
The d of item chromosome ties up position w, and F is preset coefficient, the random number of r1, r2 between 1~N, t expression the number of iterations, d
Indicate that the d in chromosome ties up position.
In an embodiment of the present invention, in order to further increase the iteration speed of chromosome complex, next iteration is being executed
Before, it to the chromosome complex execution local search algorithm obtained after selection, intersection and mutation operation is executed, is received with further increasing
Speed is held back, is specifically included:
(a) corresponding work as is obtained from the chromosome executed in the chromosome complex obtained after selection, intersection and mutation operation
Preceding solution, and corresponding guiding solution is calculated.Wherein, the current solution obtains after executing selection, intersection and mutation operation
Optimal solution in chromosome complex, the guiding solution are found out by following equation:
Sgui=(s (a1) ..., s (ad) ... s (aD)) (8)
Wherein, SguiIndicate guiding solution.
(b) the difference bit between the current solution and the guiding solution is determined.Wherein, the current solution and the guiding
Difference bit between solution refers to the number of the current solution numerical value different location that ought do not show identical as the guiding solution position
Amount.For example, when the numerical value for currently solving a certain position is 0, and when to be oriented to the numerical value in solution in this position be 1, then the position
A corresponding difference bit.
(d) it is solved along current solution to the guiding and carries out track search, the chromosome complex after obtaining track search.Wherein,
During solving progress track search to the guiding along current solution, a difference bit corresponds to the current solution Xiang Suoshu
Guiding solution it is primary mobile when, the current solution to it is described guiding solution each moving process in, generate the new of corresponding number
Solution finds out corresponding optimal solution from new explanation generated, and when determining corresponding optimal solution is better than executing selection, intersection and becomes
It when worst solution in the chromosome complex obtained after ETTHER-OR operation, replaces executing selection using corresponding optimal solution, intersect and the behaviour that makes a variation
Worst solution in the chromosome complex obtained after work, until obtaining the track when the current solution is moved to guiding solution and searching
Chromosome complex after rope.
In specific implementation, corresponding optimal new explanation X can be generated by executing above-mentioned local search algorithmnewIf optimal new explanation
XnewBetter than the worst solution X in chromosome complexg, then with optimal new explanation XnewOtherwise worst solution in replacement chromosome complex is then kept
Worst solution XgIt remains unchanged.In an embodiment of the present invention, in order to reduce algorithm operation time, as long as local search algorithm is searched for
The new explanation arrived is better than the globally optimal solution of chromosome complex, then this search terminates.
Referring to Fig. 6, if initial solution is Sini, guiding solution is Sgui, in SiniAnd SguiBetween there are 3 different bits
(bit), then three new explanations S1, S2, S3 are generated, then it is assessed, finds optimal solution, if S2, then in first time is mobile
It selects S2 to make second to take action, and so on, eventually point to guiding solution SguiIf the new explanation generated in moving process is better than dye
The worst solution of colour solid group then replaces the worst solution of chromosome complex with this optimal solution.
Step S505: judge whether the number of iterations reaches preset frequency threshold value；When the judgment result is yes, step is executed
S506；Conversely, can then execute step S507.
Step S506: the history optimal solution of the corresponding each chromosome of output and the history optimal solution of chromosome complex, as
The optimal solution of the network code resource optimization mathematical model.
After executing completion an iteration, if the number of iterations is not up to preset frequency threshold value, executes output and correspond to
Each chromosome history optimal solution and chromosome complex history optimal solution, namely obtain the network code resource optimization number
Learn the optimal solution of model.
Step S507: next iteration is executed.
In specific implementation, after executing completion an iteration, if the number of iterations is not up to preset frequency threshold value,
Next iteration is executed, namely restarts to execute from step S502, until the number of iterations reaches preset frequency threshold value.
The above-mentioned method in present invention implementation is described in detail, below will be to the above-mentioned corresponding system of method
It is introduced.
Using the above scheme in the embodiment of the present invention, by node selection device from the sensing in wireless sensor network
Selected part node can be used the smallest coding number of edges and reach net as coding nodes in potential coding nodes in device node
The attainable maximum network rate of network coding institute improves data so as to improve the network throughput of wireless sensor network
Efficiency of transmission.
The basic principles, main features and advantages of the present invention have been shown and described above.The technology of the industry
Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the above embodiments and description only describe this
The principle of invention, without departing from the spirit and scope of the present invention, various changes and improvements may be made to the invention, the present invention
Claimed range is delineated by the appended claims, the specification and equivalents thereof from the appended claims.
Claims (7)
1. a kind of wireless sensor network system, which is characterized in that including node selection device and multiple sensor nodes；Node
Selecting device is coupled with the multiple sensor node respectively；
The node selection device, suitable for being chosen from the potential coding nodes in the sensor node in wireless sensor network
Part of nodes is as coding nodes；The potential coding nodes are that the quantity of emitting edge is greater than or equal to 2 and is emitted the quantity on side
Sensor node more than or equal to 1；
Selected coding nodes, suitable for acquiring corresponding monitoring data and carrying out coded transmission to corresponding next node；
Other sensors node in addition to the coding nodes, suitable for acquire corresponding monitoring data and be transmitted to it is corresponding under
One node.
2. wireless sensor network system according to claim 1, which is characterized in that the node selection device is suitable for
Wireless sensor network is converted into digraph network, and is decomposed the digraph network using figure decomposition algorithm；Base
The corresponding network code resource optimization mathematical model of digraph network struction after decomposition, and solve the network code resource
The optimal solution of optimized mathematical model obtains selected coding nodes.
3. wireless sensor network system according to claim 2, which is characterized in that constructed by the node selection device
The network code resource optimization mathematical model are as follows:
And:
Wherein, Φ (GNCM) indicate decompose after digraph network coding side quantity, Min () indicate solve minimum value, ξij
Indicate that the j-th strip of i-th potential coding nodes in the digraph network after decomposing exports side, when i-th potential coding nodes
J-th strip exports side and executes encoding operation, then ξ is arrangedij=1, conversely, ξ is then arrangedij=0；R (s, tk) indicate source sensor node s
To purpose sensor node tkReachable multicast rate, OiIndicate the quantity on the outgoing side of i-th of potential coding nodes, pi(s,
tk) indicate source sensor node s to purpose sensor node t in digraph network after disassemblykThe i-th paths, γi(s,
tk)={ e | e ∈ pi(s, tk), indicate path pi(s, tk) all links set.
4. wireless sensor network system according to claim 3, which is characterized in that the node selection device is suitable for
Chromosome complex is initialized, corresponding initial chromosome group is obtained；Chromosome in the chromosome complex respectively corresponds the network
One solution of coding resource optimized mathematical model；Based on the current location of chromosome in current chromosome group, each dyeing is calculated
The fitness value of body；Based on the fitness value for each chromosome being calculated, each chromosome of current chromosome group is gone through
History optimal solution and the history optimal solution of chromosome complex are updated, and obtain executing when the corresponding chromosome complex of previous iteration；To holding
The chromosome in chromosome complex that trade previous iteration obtains executes selection, intersection and mutation operation；Next iteration is executed, directly
Reach preset frequency threshold value to the number of iterations, exports the history optimal solution of corresponding each chromosome and the history of chromosome complex
Optimal solution, the optimal solution as the network code resource optimization mathematical model.
5. wireless sensor network system according to claim 4, which is characterized in that the node selection device is suitable for
The fitness numerical value executed when chromosome each in the chromosome complex that previous iteration obtains is calculated, the execution is constructed and changes when previous
The corresponding fitness array of chromosome complex that generation obtains；It is suitable based on the red maximum adaptation degree value of the fitness array and minimum
Response numerical value calculates the probability right of each chromosome；Based on the probability right for each chromosome being calculated, it is calculated
Execute the corresponding cumulative probability distribution vector of chromosome complex when previous iteration obtains；It generates at random N number of between 0 to 1
Random number simultaneously arranges, the corresponding random vector of process according to sequence from small to large；To the cumulative probability distribution vector and institute
The numerical value for stating corresponding position in random vector cumulative probability distribution vector is compared, and determine the cumulative probability be distributed to
When the numerical value of corresponding position is greater than the numerical value of corresponding position in the random vector cumulative probability distribution vector in amount, then X is seti
(t+1)=Xi(t)。
6. wireless sensor network system according to claim 5, which is characterized in that the node selection device is suitable for
Before executing next iteration, from the chromosome executed in the chromosome complex obtained after selection, intersection and mutation operation
To corresponding current solution, and corresponding guiding solution is calculated；The current solution is to obtain after executing selection, intersection and mutation operation
To chromosome complex in optimal solution；Determine the difference bit between the current solution and the guiding solution；Along current solution to
The guiding solution carries out track search, the chromosome complex after obtaining track search；It is carried out being solved along current solution to the guiding
During track search, a difference bit correspond to the current solution to it is described guiding solution it is primary mobile when, work as described
Preceding solution generates the new explanation of corresponding number, finds out correspondence from new explanation generated into each moving process of the guiding solution
Optimal solution, and in the chromosome complex obtained after determining that corresponding optimal solution is better than and executes selection, intersection and mutation operation
When worst solution, replace executing using corresponding optimal solution worst in the chromosome complex obtained after selection, intersection and mutation operation
Solution, until when the current solution is moved to guiding solution, the chromosome complex after obtaining the track search.
7. according to the described in any item wireless sensor network systems of claim 4 to 6, which is characterized in that the node selection
Device, is suitable for one temporary position random chromosomal of setting, and the numerical value of all positions in the temporary position random chromosomal is equal
It is 1；It is random to generate the chromosome complex including N number of chromosome, obtain corresponding initial chromosome group；In the initial chromosome group
The chromosome of each position is the optimal chromosome of history of the position；In sequence in the temporary position random chromosomal
Position is traversed, and the current location traversed is obtained；By the numerical value of the current location in the temporary position random chromosomal
It is set as 0, and keeps the numerical value of other positions constant, generates new temporary position random chromosomal；It is generated new when determining
The fitness value of temporary position random chromosomal when being greater than the fitness value of the temporary position random chromosomal, using giving birth to
At new temporary position random chromosomal replace it is described initialization chromosome complex in the chromosome with worst fitness value,
Until the quantity of the position of traversal is greater than preset amount threshold, final initial chromosome group is obtained.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910084121.1A CN109699091B (en) | 2019-01-28 | 2019-01-28 | Wireless sensor network system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910084121.1A CN109699091B (en) | 2019-01-28 | 2019-01-28 | Wireless sensor network system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109699091A true CN109699091A (en) | 2019-04-30 |
| CN109699091B CN109699091B (en) | 2021-09-14 |
Family
ID=66234586
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910084121.1A Active CN109699091B (en) | 2019-01-28 | 2019-01-28 | Wireless sensor network system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109699091B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110224916A1 (en) * | 2008-03-31 | 2011-09-15 | Burns Daniel J | Fitness determination for DNA codeword searching |
| CN103297983A (en) * | 2013-05-06 | 2013-09-11 | 南京邮电大学 | Wireless sensor network node dynamic deployment method based on network flow |
| EP2659471A4 (en) * | 2010-12-30 | 2014-07-23 | Sensys Networks Inc | Wireless and wireline sensor nodes, micro-radar, networks and systems |
| CN104219154A (en) * | 2014-09-22 | 2014-12-17 | 西南交通大学 | Resource optimization method under network coding environment based on ant colony optimization algorithm |
| CN107294658A (en) * | 2017-07-03 | 2017-10-24 | 电子科技大学 | A kind of coding nodes choosing method in network control coding |
-
2019
- 2019-01-28 CN CN201910084121.1A patent/CN109699091B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110224916A1 (en) * | 2008-03-31 | 2011-09-15 | Burns Daniel J | Fitness determination for DNA codeword searching |
| EP2659471A4 (en) * | 2010-12-30 | 2014-07-23 | Sensys Networks Inc | Wireless and wireline sensor nodes, micro-radar, networks and systems |
| CN103297983A (en) * | 2013-05-06 | 2013-09-11 | 南京邮电大学 | Wireless sensor network node dynamic deployment method based on network flow |
| CN104219154A (en) * | 2014-09-22 | 2014-12-17 | 西南交通大学 | Resource optimization method under network coding environment based on ant colony optimization algorithm |
| CN107294658A (en) * | 2017-07-03 | 2017-10-24 | 电子科技大学 | A kind of coding nodes choosing method in network control coding |
Non-Patent Citations (3)
| Title |
|---|
| ALONG XU，LINGHUA ZHANG: "An Optimization Algorithm Based on GA for Multicast Network", 《2018 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION, ELECTRONICS AND ELECTRICAL ENGINEERING》 * |
| HUANLAI XING,FUHONG SONG: "On Minimizing Network Coding Resource: A Modified Particle Swarm Optimization Approach", 《2016 12TH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS (MSN)》 * |
| 李向峰，席志红，李爽: "基于遗传算法优化的WSN覆盖控制算法", 《无线电工程》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109699091B (en) | 2021-09-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khalil et al. | Energy-aware evolutionary routing protocol for dynamic clustering of wireless sensor networks | |
| Ebrahimnejad et al. | A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights | |
| CN104579964B (en) | A kind of quantum cryptography networks dynamic routing architecture system | |
| Guo et al. | A survey on intelligent routing protocols in wireless sensor networks | |
| CN100583900C (en) | Radio sensor network data convergence path planning method based on the intelligent agent | |
| Elsersy et al. | Joint optimal placement, routing, and flow assignment in wireless sensor networks for structural health monitoring | |
| Priolo et al. | A distributed algorithm for average consensus on strongly connected weighted digraphs | |
| CN102006237A (en) | Routing decision method for delay tolerant network | |
| CN109039886B (en) | Network dynamic route computing method, device and equipment | |
| CN112637806B (en) | Transformer substation monitoring system based on deep reinforcement learning and resource scheduling method thereof | |
| Shakshuki et al. | WSN in cyber physical systems: Enhanced energy management routing approach using software agents | |
| Basha et al. | Genetic-Chicken Swarm Algorithm for Minimizing Energy in Wireless Sensor Network. | |
| CN109699091A (en) | A kind of wireless sensor network system | |
| Kaur et al. | Comparative analysis of bio inspired optimization techniques in wireless sensor networks with GAPSO approach | |
| Wei et al. | A novel on-demand charging strategy based on swarm reinforcement learning in WRSNs | |
| Liao et al. | A multiutility framework with application for studying tradeoff between utility and lifetime in wireless sensor networks | |
| Okwori et al. | Energy efficient routing in wireless sensor network using ant colony optimization and firefly algorithm | |
| Cai et al. | Ant Colony Optimization Based on Adaptive Volatility Rate of Pheromone Trail. | |
| Jing et al. | An improved GAC routing algorithm based on SDN | |
| Yang et al. | Dynamic Mobile Sink Path Planning for Unsynchronized Data Collection in Heterogeneous Wireless Sensor Networks | |
| Shakshuki et al. | Mobile agent for efficient routing among source nodes in wireless sensor networks | |
| Vanitha | Taylor based Neuro-Genetic Algorithm for Secure and Energy aware multi hop routing protocol in WSN | |
| Gao et al. | A Scalable Two-Hop Multi-Sink Wireless Sensor Network for Data Collection in Large-Scale Smart Manufacturing Facilities. | |
| Singh et al. | A novel self‐adaptive hybrid slime mould naked mole‐rat algorithm for numerical optimization and energy‐efficient wireless sensor network | |
| Gao et al. | A genetic ant colony algorithm for routing in CPS heterogeneous network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |