CN102098687A - Multi-object optimized deployment method for industrial wireless sensor network - Google Patents
Multi-object optimized deployment method for industrial wireless sensor network Download PDFInfo
- Publication number
- CN102098687A CN102098687A CN2011100490257A CN201110049025A CN102098687A CN 102098687 A CN102098687 A CN 102098687A CN 2011100490257 A CN2011100490257 A CN 2011100490257A CN 201110049025 A CN201110049025 A CN 201110049025A CN 102098687 A CN102098687 A CN 102098687A
- Authority
- CN
- China
- Prior art keywords
- harmony
- sensor node
- new
- expression
- bunch
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
The invention discloses a multi-object optimized deployment method for an industrial wireless sensor network, comprising the following steps: (1) dividing a monitoring region into three-dimensional grids, and arranging sensor nodes, cluster heads and base stations on cross points of the grids; (2) generating obstacle matrixes; (3) representing harmony individuals; (4) setting algorithm control parameters; (5) setting communication radiuses of the sensor and the cluster heads; (6) judging whether the communication between the sensor nodes and the cluster heads satisfies the conditions; (7) judging whether the hop number of communication between the sensor nodes and the base stations satisfies the conditions; (8) initializing harmony matrixes by using a heuristic strategy; (9) calculating an objective function value of each harmony; (10) finding out the optimized harmony; (11) generating a new harmony; (12) comparing the quality of the new harmony with the quality of the corresponding harmony in a harmony memory vault; (13) updating the optimized harmony; and (14) judging whether the stopping conditions are satisfied or not. The method can realize multi-object optimization for system reliability, and real-time performance, sensor node deployment cost and maintenance cost of the industrial wireless sensor network, and can satisfy the industrial actual requirements.
Description
Technical field
The present invention relates to industrial wireless sensor network and intelligence computation two big fields, be specifically related to the optimum method of disposing of a kind of industrial wireless sensor network multiple target.
Background technology
Along with industrial system constantly maximize, complicated, the scale of industrial control system constantly enlarges, its installation, wiring cost also constantly increase.The industrial transducer market share is 11,000,000,000 dollars calendar year 2001 according to statistics, and its cost of installation and use (mainly being wiring cost) is above 1,000 hundred million dollars.Therefore, wireless sensor network (Wireless Sensor Networks, WSNs) low cost, feature such as easy-to-use have caused the extensive concern of industrial quarters, the world well-known control system company, industrial wireless sensor network (Industrial Wireless Sensor Networks, IWSNs) research and development of technology have all been carried out as Emerson, Honeywell, General Electric etc.IWSNs constitutes, is deployed in the industry spot environment for certain commercial Application provides the self-organization distribution network intelligence system of solution by the sensor node with wireless telecommunications and computing capability, is a hot spot technology of industrial control field after field bus technique.IWSNs can reduce the industry measurement and control system cost, improves industry measurement and control system range of application and reliability.Emerson company confirms that in the result of North America and European several field tests the reliability that adopts the transmission of wireless industrial technical data is more than 99%, and installation cost is than equal wired solution low 90%.Huge prospect at the wireless industrial technology, USDOE points out in " the futurity industry plan " of issue in 2004: this low-cost TT﹠C system based on the wireless industrial technology is to be implemented to the main means that the year two thousand twenty U.S. whole energy consumption of industry reduces by 5% target, is representing the developing direction of industrial automation system technology.
Based on comprising two category nodes among the cluster structured IWSNs usually
:Sensor node and bunch head, wherein sensor node is responsible for the collection of field data, and a bunch data that the receiving sensor node sends over are also integrated data and are sent to the base station.Though the chief component of IWSNs also is a wireless sensor node, but it is different with general non-industrial IWSNs, the sensor node deployment of IWSN is relevant with industrial environment, need manually be installed on the industrial equipment that needs to detect, and emphasizes the reliable Detection to specified point.Than traditional cable network, on the one hand, IWSNs is easier to be subjected to the influence of factors such as network topology, environment and to break down, and fault is also inevitable in the practical application.On the other hand, the communication modes of IWSNs multi-hop also causes system real time to descend, and shows in the industrial experiment that the real-time of data when the leapfrog number surpasses 6 can not guarantee.IWSN will directly influence product quality in case its reliability and real-time can not get assurance, even produce serious accident as the important component part of control system, cause the tremendous economic loss.Therefore for large-scale industrial application, particularly closed-loop control is used, and reliability and the real-time of IWSN are most important.
In addition, sensor node generally all adopts powered battery, finite energy, and the system in process industry in case node energy exhausts, must change battery.If it is improper to dispose design, the battery loss difference of different nodes, bunch head is excessive, and unified replacing can cause unnecessary waste, then will cause carrying out continually battery altering according to actual electric weight, and this obviously can increase the workload of network operation.
For the ease of management, improve real-time, IWSN adopts cluster structured usually, make bunch inner sensor node only with this bunch bunch communication, bunch head is collected data that bunch interior nodes sends and is sent to the base station by all the other bunches head in the mode of multi-hop.In order to ensure possibility, need be the redundant bunch head of node configuration, make each node can communicate by letter with two bunches of heads (the using and the reserved), when a bunch of head breaks down, can switch to the spare cluster head fast and make system's operate as normal, guarantee the reliability of system, simultaneously, system in commercial Application, system in the particularly extensive process industry needs detection variable numerous, often reaches points up to ten thousand, therefore, need to optimize and dispose bunch head, simplify network configuration, be convenient to administer and maintain to reduce cost of investment.The space that hold facility in the actual industrial scene is certain, also there are other barriers such as wall, these barriers all can influence the communication between node and bunch head, so the optimum deployment issue of IWSNs is actually and relates to a multi-objective optimization question with multiple constraint, promptly
,IWSNs is satisfying, under the constraint of optimization system reliability and real-time, is realizing minimizing of system constructing cost and maintenance cost.The optimum dispositions method of large-scale industry wireless sensor network is a class np hard problem, and traditional certainty optimization method can not be realized efficiently finding the solution this class problem.In recent years, intelligent optimization algorithm embodies when finding the solution np hard problem than the bigger advantage of traditional certainty optimization method, (Harmony Search, HS) the good ability of searching optimum of algorithm has caused researcher's extensive concern with the characteristics that are simple and easy to realize in wherein harmony search.The harmony searching algorithm is a kind of new intelligent optimization algorithm that proposed in recent years, the basic thought of HS: from the harmony data base that produces at random, by to the thinking of harmony data base, select tone and tone to regulate at random to produce candidate solution, upgrade the harmony data base by the poorest the separating in contrast candidate solution and the data base then.
Yet, what basic HS algorithm adopted is real number or discrete coding, be mainly used in the optimization problem of continuous space and discrete space, for IWSNs layout optimization problem, binary coding optimization problem, basic harmony searching algorithm tone is regulated operation with degradation failure, therefore, the algorithm of basic HS is not suitable for the binary coding optimization problem.
Summary of the invention
The objective of the invention is to problem at the prior art existence, provide a kind of industrial wireless sensor network multiple target optimum method of disposing, this method adopts heuristic binary system harmony searching algorithm that the node deployment model is optimized, guaranteeing further to reduce system maintenance cost and system constructing cost on the basis that system reliability and real-time require.
For achieving the above object, the present invention adopts following technical proposals:
The optimum method of disposing of a kind of industrial wireless sensor network multiple target is characterized in that the concrete steps of this method are as follows:
(1), at first according to industry spot real space, barrier size and location, wireless senser power, required precision, the monitored area is divided into
Three-dimensional grid,
R,
S,
TDivide hop count on corresponding horizontal respectively, vertical, the ordinate, sensor node, bunch head and base station all are deployed in respectively on the grid intersection, and according to industrial requirements, sensor node is divided into two classes, and a class is general sensor node, and another kind of is the key sensor node; According to the actual process design requirement, have in the industry spot real space
Individual sensor node is vacant
Individual grid point deploy bunch head and base station;
(2), exist according to on-the-spot physical device
Position dyspoiesis thing matrix in the three-dimensional network coordinate
B, the barrier matrix
BSize is
, grid represents that barrier is arranged on this grid for " 1 ", if grid is for " 0 " then represent do not have barrier on this grid
,Can't communicate with one another between this two sensors node if having barrier in the straight line path between any 2 then think;
(3), the harmony individuality expression of separating:
,
(4) each Control Parameter of the heuristic binary system harmony searching algorithm of setting, the Control Parameter of heuristic binary system harmony searching algorithm comprises the creation number of times
NI ,Harmony data base size
, harmony data base thinking probability
With tone fine setting probability
, and random initializtion harmony data base
HM
(5), the communication radius of setting sensor node is
, the communication radius of bunch head is
, judge between sensor node and bunch head distance whether smaller or equal to
, if the distance between sensor node and bunch head smaller or equal to
, and when not having barrier between both communication links, then think the communication of sensor node and this bunch, with the load of sensor node as this bunch head, otherwise think sensor node can not with this bunch communication; Judge between two bunches of heads distance whether smaller or equal to
, if the distance between two bunches of heads smaller or equal to
, and the communication link between two bunches of heads is then thought to communicate with one another between these two bunches of heads when not having barrier; The total load of bunch head be bunch inner sensor node number and with bunch number sum of its communication;
(6), judge whether each general sensor node at least with 2 bunches communications, if each general sensor node can not be at least and 2 bunches communications, think that then sensor node is discontented with the pedal system reliability requirement, then calculate all general sensor nodes
Penalty value
Otherwise think that general sensor node satisfies the system reliability requirement, do not calculate the penalty value that general transducer is put successively, judge the key sensor node whether can with more than or equal to 3 bunches communications, if can not with more than or equal to 3 bunches communications, then calculate all key sensor nodes
Penalty value
, otherwise think that the key sensor node satisfies the system reliability requirement, does not calculate the penalty value of key node;
(7), be set in the monitored area and have
N BASE Individual base station is designated as
N BASE , sensor node
iBy bunch head and the nearest required jumping figure of base station communication be
H i ,Consider the real-time of industrial wireless sensor network, require the no more than Smax of jumping figure of sensor node arrival base station, judge the jumping figure of each sensor node and each base station communication
H i Whether satisfy and be less than maximum hop count Smax, if the jumping figure of each sensor node and each base station communication
H i Can not satisfy and be less than maximum hop count Smax, then think not requirement of real time of sensor node, then calculate all the sensors node
Penalty value
, otherwise think the sensor node requirement of real time, do not calculate the penalty value of sensor node;
(8), adopt heuristic strategies initialization harmony matrix, adjust random value according to each sensor node distribution density, have tendency to produce the harmony matrix, the size of this harmony matrix is designated as HMS; In order to ensure not losing possible separating, produce the harmony of one complete " 1 " simultaneously;
(9), calculate each harmony
xTarget function value, target function is:
Wherein, min
f(x) expression target function,
,
,
It is respectively subfunction
,
,
Weights;
An expression bunch quantity,
The quantity of expression base station,
The standard deviation of an expression bunch load;
(10), find best harmony in initialization and in the sound memory storehouse
h g
Best harmony definition: the harmony of target function value minimum in the harmony matrix;
(11), generate new harmony;
(12), newer harmony
With harmony corresponding in the harmony data base
Quality; If new harmony
Than harmony corresponding in the harmony data base
Excellent, then use new harmony
Replace harmony corresponding in the harmony data base
, otherwise the harmony matrix is constant;
(13), upgrade optimum harmony
h g
(14), judge whether the new harmony number that produces is less than HMS, if the new harmony number that produces is less than HMS, returns step (11) and continue to produce new harmony, if the new harmony number that produces is not to be less than HMS, and algorithm has reached maximum iteration time, then stops iteration, generates optimum harmony
h g ,Otherwise return step (11) and continue iteration.
The new harmony of generation described in the above-mentioned steps (11), it is specific as follows:
(11-1), with probability
HMCRIn the harmony data base, search for new explanation, with probability 1
-HMCRBut in the energy gap of variable, search for
,Its search formula is:
Wherein, the random number between the rand () expression 0 to 1,
N ij
The new harmony individuality that produces of expression, HM
IjI in expression harmony matrix is individual,
In in the harmony data base, searching for, a kind of new individual search strategy of parallel correspondence has been proposed, corresponding harmony data base generates a plurality of new explanations in new iteration of parallel individual search strategy, this strategy can effectively prevent the algorithm precocity for large-scale industry wireless sensor network disposition optimization problem, improve the global optimization performance of algorithm, separating and may propose a kind of new heuristic strategies, heuristic strategies during domain search: supposition has
Individual sensor node, wherein
kIndividual general sensor node, bunch number that need this moment is at least
Individual bunch of head
(In other words, the number that wherein produces bit in the new harmony " 1 " be no less than for
,
)Therefore, adjust the probability that produces " 1 " at random, the probability calculation formula of its " 1 " is:
Wherein, k is lax operator, and desirable 1.2-1.5 produces 0 or 1 formula at random and is:
Wherein, N
IjThe new harmony individuality that produces of expression, the random number between the rand () expression 0 to 1
,This heuristic strategies can effectively be estimated and separate, thereby improves the search efficiency and the search quality of algorithm;
(11-2) be different from other and be applied to binary-coded binary system harmony searching algorithm, adopt a kind of new tone fine setting operation operator based on didactic binary system harmony searching algorithm
(In other words, if wherein new harmony from the harmony data base, then new harmony is carried out the fine setting of global optimization tone with probability P AR
),Its tone fine setting operation operator calculating formula is
Wherein,
N Ij The new harmony individuality that produces of expression,
Optimum harmony individuality in the expression harmony matrix,
HM Ij I individuality in the expression harmony matrix.
Newer harmony described in the above-mentioned steps (12)
With harmony corresponding in the harmony data base
Quality, select the more excellent harmony data base that enters of adaptive value to be:
Wherein, HM
iI individuality in the expression harmony data base,
N i The new harmony individuality that produces of expression.。
The optimum method of disposing of a kind of industrial wireless sensor network multiple target of the present invention has following conspicuous outstanding substantive distinguishing features and remarkable advantage compared with prior art:
At first, this method directly adopts binary coding, and the harmony individuality is expressed as binary string, according to the numerical value of two close bits in the individual vector determine its
What the correspondence position in the three-dimensional grid was arranged is bunch head or base station, algorithm is realized simple, and it is very directly perceived, operand is little, speed is fast, and new harmony data base selection operation and tone fine setting operation replaces the origin operation in the continuous space and discrete space in the prior art, makes binary system harmony searching algorithm be applicable to complicated binary coding optimization problem, proposed a kind of heuristic operation and made this efficiency of algorithm height, it is good to optimize performance.
Secondly, this method when making up IWSN, guarantee each sensor node at least with 2 bunches communications, guarantee when bunch head of work breaks down, to switch to rapidly a redundant bunch head it is worked on, satisfied the system redundancy demand, guaranteed, optimized the reliability of system.Simultaneously, this method guarantees by signal post between sensor node and the base station being needed the restriction of jumping figure
,The real-time of optimization system.This method is that system reliability, real-time, sensor node deployment cost and the maintenance cost of industrial wireless sensor network realizes multiple-objection optimization, utilize new being optimized of proposing based on the position and the quantity of didactic binary system harmony search to bunch head and base station, solve the single goal optimization problem of belt restraining in the prior art, than consideration reliability or cost are more comprehensive merely, thereby really satisfy the actual demand in the commercial Application.
Description of drawings
Fig. 1 is the deployment schematic diagram in the optimum method of disposing of a kind of industrial wireless sensor network multiple target of the present invention;
Fig. 2 is the flow chart of the optimum method of disposing of a kind of industrial wireless sensor network multiple target of the present invention.
Embodiment
Below in conjunction with accompanying drawing preferred implementation of the present invention is described in further detail.
Referring to Fig. 1, the optimum method of disposing of a kind of industrial wireless sensor network multiple target of the present invention, its operating procedure is as follows:
(1), at first according to industry spot real space, barrier size and location, wireless senser power, required precision, the monitored area is divided into
Three-dimensional grid,
R,
S,
TDivide hop count on corresponding horizontal respectively, vertical, the ordinate, sensor node, bunch head and base station all are deployed in respectively on the grid intersection, and according to industrial requirements, sensor node is divided into two classes, and a class is general sensor node, and another kind of is the key sensor node; According to the actual process design requirement, have in the industry spot real space
Individual sensor node is vacant
Optimize on the individual grid point and dispose bunch head and base station, with reliability and the real-time of guaranteeing industry measurement and control system, as shown in Figure 1, among the figure, DH represents a bunch head, and N represents sensor node, and B represents the base station, R
ChThe communication radius of expression bunch head, R
nThe communication radius of expression sensor node, this node of double-head arrow explanation transducer and a bunch mutual communication from sensor node to bunch head, the double-head arrow explanation bunch head between bunch head and the base station and the intercommunication of base station;
(2), exist according to on-the-spot physical device
Position dyspoiesis thing matrix in the three-dimensional network coordinate
B, barrier matrix B size is
, grid represents that there is barrier at this place for " 1 ", if grid for " 0 " then represent there is not barrier on this grid, can't communicate with one another between this two sensors node if having barrier in the straight line path between any 2 then think;
(3), the harmony individuality expression of separating:
,
, vacant
Arrange on the grid point and gather head and base station,
, wherein, n represents to be used for disposing the grid sum of bunch head and base station,
Be illustrated in
jIndividual abortive haul lattice point is vacant,
Be illustrated in
jIndividual abortive haul lattice point deploy transducer bunch head,
Expression the
jIndividual abortive haul lattice point deploy base station;
(4), set each Control Parameter of heuristic binary system harmony searching algorithm, the Control Parameter of heuristic binary system harmony searching algorithm comprises the creation number of times
NI ,Harmony data base size
, harmony data base thinking probability
With tone fine setting probability
, and random initializtion harmony data base
HM
(5), the communication radius of setting sensor node is
, the communication radius of bunch head is
, judge between sensor node and bunch head distance whether smaller or equal to
, if the distance between sensor node and bunch head smaller or equal to
, and when not having barrier between both communication links, then think the communication of sensor node and this bunch, with the load of sensor node as this bunch head, otherwise think sensor node can not with this bunch communication; Judge between two bunches of heads distance whether smaller or equal to
, if the distance between two bunches of heads smaller or equal to
, and the communication link between two bunches of heads is then thought to communicate with one another between these two bunches of heads when not having barrier; The total load of bunch head be bunch inner sensor node number and with bunch number sum of its communication;
(6), judge whether each general sensor node at least with 2 bunches communications, if each general sensor node can not be at least and 2 bunches communications, think that then sensor node is discontented with the pedal system reliability requirement, then calculate all general sensor nodes
Penalty value
,
, wherein
Kp 1It is penalty coefficient; Judge the key sensor node whether can with more than or equal to 3 bunches communications, if can not with more than or equal to 3 bunches communications, then calculate all key sensor nodes
Penalty value
,
Kp 2 It is penalty coefficient;
(7), be set in the monitored area and have
N BASE Individual base station (
N BASE Represent the base station), node
iBy bunch head and the nearest required jumping figure of base station communication be
H i ,Consider the real-time of industrial wireless sensor network, the common Smax of the no more than Smax(of jumping figure that requires node to arrive the base station should jump less than 6), judge the jumping figure of each sensor node and each base station communication
H i Whether satisfy and be less than maximum hop count Smax, if the jumping figure of each sensor node and each base station communication
H i Can not satisfy and be less than maximum hop count Smax, then think not requirement of real time of sensor node, then calculate all nodes
Penalty value
, its calculating formula is:
, wherein,
Kp 3Be penalty coefficient, as shown in Figure 1, from figure the result as can be seen, each sensor node is communicated by letter with two bunches of heads at least, the required common Smax of the no more than Smax(of jumping figure of node and base station communication should be less than 6), satisfied the real-time and the reliability requirement of system;
(8), adopt heuristic strategies initialization harmony matrix, adjust random value according to each sensor node distribution density, have tendency to produce the harmony matrix, the size of this harmony matrix is designated as HMS; In order to ensure not losing possible separating, produce the harmony of one complete " 1 " simultaneously;
(9), calculate each harmony
xTarget function value, target function is:
Wherein, min
f(x) expression target function,
,
,
It is respectively subfunction
,
,
Weights,
An expression bunch quantity,
The quantity of expression base station,
The standard deviation of an expression bunch load; Standard deviation
Calculating formula is:
(10), find best harmony in initialization and in the sound memory storehouse
h g
Best harmony definition: the harmony of target function value minimum in the harmony matrix is placed on and is meant top f (x) minimum here;
(11), generate new harmony:
(11-1), with probability
HMCRIn the harmony data base, search for new explanation, with probability 1
-HMCRBut in the energy gap of variable, search for
,Its search formula is:
Wherein, the random number between the rand () expression 0 to 1,
N ij
The new harmony individuality that produces of expression, HM
Ij I in expression harmony matrix is individual.
In in the harmony data base, searching for, a kind of new individual search strategy of parallel correspondence has been proposed, corresponding harmony data base generates a plurality of new explanations in new iteration of parallel individual search strategy, this strategy can effectively prevent the algorithm precocity for large-scale industry wireless sensor network disposition optimization problem, improve the global optimization performance of algorithm, separating and may propose a kind of new heuristic strategies, heuristic strategies during domain search: supposition has
Individual sensor node, wherein
kIndividual general sensor node, bunch number that need this moment is at least
Individual bunch of head
(In other words, the number that wherein produces bit in the new harmony " 1 " be no less than for
,
)Therefore, adjust the probability that produces " 1 " at random, the probability calculation formula of its " 1 " is:
Wherein, k is lax operator, and desirable 1.2-1.5 produces 0 or 1 formula at random and is:
Wherein, N
IjThe new harmony individuality that produces of expression, the random number between the rand () expression 0 to 1
,This heuristic strategies can effectively be estimated and separate, thereby improves the search efficiency and the search quality of algorithm.
(11-2) be different from other and be applied to binary-coded binary system harmony searching algorithm, adopt a kind of new tone fine setting operation operator based on didactic binary system harmony searching algorithm
(In other words, if wherein new harmony from the harmony data base, then new harmony is carried out the fine setting of global optimization tone with probability P AR
),Its tone fine setting operation operator calculating formula is
Wherein,
N Ij The new harmony individuality that produces of expression,
Optimum harmony individuality in the expression harmony matrix,
HM Ij I individuality in the expression harmony matrix.
(12) newer harmony
With harmony corresponding in the harmony data base
Quality, select adaptive value to select the more excellent harmony data base that enters of adaptive value to be:
Wherein, HM
iI individuality in the expression harmony data base,
N i The new harmony individuality that produces of expression;
(13), upgrade optimum harmony
h g ,
(14),, judge whether the new harmony number that produces is less than HMS, if the new harmony number that produces is less than HMS, returns step (11) and continue to produce new harmony, if the new harmony number that produces is not to be less than HMS, and algorithm has reached maximum iteration time, then stops iteration, generates optimum harmony
h g ,Otherwise return step (11) and continue iteration.According to optimum harmony
h g Determine bunch head and base station position and quantity,, realize the optimum deployment of industrial wireless sensor network multiple target then according to the communication radius of sensor node and bunch head in the monitored area.
The optimum method of disposing of a kind of industrial wireless sensor network multiple target of the present invention is according to optimum harmony
h g Determine bunch head and base station position and quantity in the monitored area, can draw industry spot zone wireless sensor network coverage diagram according to the communication radius of sensor node and bunch head then, sensor node arrives the communication route map of base station, the communication route map that arrives the base station by regional wireless sensor network coverage diagram coverage diagram and sensor node can find out that each sensor node carries out communication with 2 bunches of heads at least, the sensor node of appointment carries out communication with 3 bunches of heads at least in the network, each sensor node arrives the required common Smax of jumping figure Smax(in base station should be less than 6), each bunch head also has at least 2 links to lead to the base station, therefore, the present invention can be in the communication reliability and the real-time that guarantee system at sensor node layer and bunch head layer.By rational deployment to leader cluster node and base station, the energy consumption of balance bunch head and reduce sensor node and the base station between the required jumping figure of communication, help prolonging life cycle of network.In addition, the present invention is based on heuristic binary system harmony searching algorithm can be with original building network of minimum one-tenth and maintenance cost, and guarantees the system redundancy demand to improve system reliability and real-time.
Claims (3)
1. the optimum method of disposing of an industrial wireless sensor network multiple target is characterized in that the concrete steps of this method are as follows:
(1), at first according to industry spot real space, barrier size and location, wireless senser power, required precision, the monitored area is divided into
Three-dimensional grid,
R,
S,
TDivide hop count on corresponding horizontal respectively, vertical, the ordinate, sensor node, bunch head and base station all are deployed in respectively on the grid intersection, and according to industrial requirements, sensor node is divided into two classes, and a class is general sensor node, and another kind of is the key sensor node; According to the actual process design requirement, have in the industry spot real space
Individual sensor node is vacant
Individual grid point deploy bunch head and base station;
(2), exist according to on-the-spot physical device
Position dyspoiesis thing matrix in the three-dimensional network coordinate
B, the barrier matrix
BSize is
, grid represents that barrier is arranged on this grid for " 1 ", if grid is for " 0 " then represent do not have barrier on this grid
,Can't communicate with one another between this two sensors node if having barrier in the straight line path between any 2 then think;
(3), the harmony individuality expression of separating:
,
, vacant
Arrange on the grid point and gather head and base station,
, wherein, n represents to be used for disposing the grid sum of bunch head and base station,
Be illustrated in
jIndividual abortive haul lattice point is vacant,
Be illustrated in
jIndividual abortive haul lattice point deploy transducer bunch head,
Expression the
jIndividual abortive haul lattice point deploy base station;
(4) each Control Parameter of the heuristic binary system harmony searching algorithm of setting, the Control Parameter of heuristic binary system harmony searching algorithm comprises the creation number of times
NI ,Harmony data base size
, harmony data base thinking probability
With tone fine setting probability
, and random initializtion harmony data base
HM
(5), the communication radius of setting sensor node is
, the communication radius of bunch head is
, judge between sensor node and bunch head distance whether smaller or equal to
, if the distance between sensor node and bunch head smaller or equal to
, and when not having barrier between both communication links, then think the communication of sensor node and this bunch, with the load of sensor node as this bunch head, otherwise think sensor node can not with this bunch communication; Judge between two bunches of heads distance whether smaller or equal to
, if the distance between two bunches of heads smaller or equal to
, and the communication link between two bunches of heads is then thought to communicate with one another between these two bunches of heads when not having barrier; The total load of bunch head be bunch inner sensor node number and with bunch number sum of its communication;
(6), judge whether each general sensor node at least with 2 bunches communications, if each general sensor node can not be at least and 2 bunches communications, think that then sensor node is discontented with the pedal system reliability requirement, then calculate all general sensor nodes
Penalty value
Otherwise think that general sensor node satisfies the system reliability requirement, do not calculate the penalty value that general transducer is put successively, judge the key sensor node whether can with more than or equal to 3 bunches communications, if can not with more than or equal to 3 bunches communications, then calculate all key sensor nodes
Penalty value
, otherwise think that the key sensor node satisfies the system reliability requirement, does not calculate the penalty value of key node;
(7), be set in the monitored area and have
N BASE Individual base station is designated as
N BASE , sensor node
iBy bunch head and the nearest required jumping figure of base station communication be
H i ,Consider the real-time of industrial wireless sensor network, require the no more than Smax of jumping figure of sensor node arrival base station, judge the jumping figure of each sensor node and each base station communication
H i Whether satisfy and be less than maximum hop count Smax, if the jumping figure of each sensor node and each base station communication
H i Can not satisfy and be less than maximum hop count Smax, then think not requirement of real time of sensor node, then calculate all the sensors node
Penalty value
, otherwise think the sensor node requirement of real time, do not calculate the penalty value of sensor node;
(8), adopt heuristic strategies initialization harmony matrix, adjust random value according to each sensor node distribution density, have tendency to produce the harmony matrix, the size of this harmony matrix is designated as HMS; In order to ensure not losing possible separating, produce the harmony of one complete " 1 " simultaneously;
(9), calculate each harmony
xTarget function value, target function is:
Wherein, min
f(x) expression target function,
,
,
It is respectively subfunction
,
,
Weights;
An expression bunch quantity,
The quantity of expression base station,
The standard deviation of an expression bunch load;
(10), find best harmony in initialization and in the sound memory storehouse
h g
Best harmony definition: the harmony of target function value minimum in the harmony matrix;
(11), generate new harmony;
(12), newer harmony
With harmony corresponding in the harmony data base
Quality; If new harmony
Than harmony corresponding in the harmony data base
Excellent, then use new harmony
Replace harmony corresponding in the harmony data base
, otherwise the harmony matrix is constant;
(13), upgrade optimum harmony
h g
(14), judge whether the new harmony number that produces is less than HMS, if the new harmony number that produces is less than HMS, returns step (11) and continue to produce new harmony, if the new harmony number that produces is not to be less than HMS, and algorithm has reached maximum iteration time, then stops iteration, generates optimum harmony
h g ,Otherwise return step (11) and continue iteration.
2. the optimum method of disposing of a kind of industrial wireless sensor network multiple target according to claim 1 is characterized in that, the new harmony of generation described in the above-mentioned steps (11), and it is specific as follows:
(11-1), with probability
HMCRIn the harmony data base, search for new explanation, with probability 1
-HMCRBut in the energy gap of variable, search for
,Its search formula is:
Wherein, the random number between the rand () expression 0 to 1,
N ij
The new harmony individuality that produces of expression, HM
IjI in expression harmony matrix is individual,
In in the harmony data base, searching for, a kind of new individual search strategy of parallel correspondence has been proposed, corresponding harmony data base generates a plurality of new explanations in new iteration of parallel individual search strategy, this strategy can effectively prevent the algorithm precocity for large-scale industry wireless sensor network disposition optimization problem, improve the global optimization performance of algorithm, separating and may propose a kind of new heuristic strategies, heuristic strategies during domain search: supposition has
Individual sensor node, wherein
kIndividual general sensor node, bunch number that need this moment is at least
Individual bunch of head
(In other words, the number that wherein produces bit in the new harmony " 1 " be no less than for
,
)Therefore, adjust the probability that produces " 1 " at random, the probability calculation formula of its " 1 " is:
Wherein, k is lax operator, and desirable 1.2-1.5 produces 0 or 1 formula at random and is:
Wherein, N
IjThe new harmony individuality that produces of expression, the random number between the rand () expression 0 to 1
,This heuristic strategies can effectively be estimated and separate, thereby improves the search efficiency and the search quality of algorithm;
(11-2) be different from other and be applied to binary-coded binary system harmony searching algorithm, adopt a kind of new tone fine setting operation operator based on didactic binary system harmony searching algorithm
(In other words, if wherein new harmony from the harmony data base, then new harmony is carried out the fine setting of global optimization tone with probability P AR
),Its tone fine setting operation operator calculating formula is
Wherein,
N Ij The new harmony individuality that produces of expression,
Optimum harmony individuality in the expression harmony matrix,
HM Ij I individuality in the expression harmony matrix.
3. the optimum method of disposing of a kind of industrial wireless sensor network multiple target according to claim 2 is characterized in that the newer harmony described in the above-mentioned steps (12)
With harmony corresponding in the harmony data base
Quality, select the more excellent harmony data base that enters of adaptive value to be:
Wherein, HM
iI individuality in the expression harmony data base,
N i The new harmony individuality that produces of expression.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110049025.7A CN102098687B (en) | 2011-03-02 | 2011-03-02 | Multi-object optimized deployment method for industrial wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110049025.7A CN102098687B (en) | 2011-03-02 | 2011-03-02 | Multi-object optimized deployment method for industrial wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102098687A true CN102098687A (en) | 2011-06-15 |
| CN102098687B CN102098687B (en) | 2014-01-15 |
Family
ID=44131508
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110049025.7A Expired - Fee Related CN102098687B (en) | 2011-03-02 | 2011-03-02 | Multi-object optimized deployment method for industrial wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102098687B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102625324A (en) * | 2012-03-08 | 2012-08-01 | 上海大学 | Wireless optical fiber sensor network deployment method based on particle swarm optimization |
| CN102917388A (en) * | 2012-10-15 | 2013-02-06 | 中国联合网络通信集团有限公司 | Self-repairing method for base stations, cut-through management and control device, cluster head base station and communication system |
| CN102915355A (en) * | 2012-10-11 | 2013-02-06 | 李英明 | Multiprocessor task scheduling method based on harmony search and simulated annealing |
| CN103856952A (en) * | 2014-02-27 | 2014-06-11 | 上海大学 | Method for optimizing Pareto multiple target deployment of industrial wireless sensor network |
| CN103916927A (en) * | 2014-03-17 | 2014-07-09 | 华中科技大学 | Wireless sensor network routing method based on improved harmony search algorithm |
| CN103997747A (en) * | 2014-05-14 | 2014-08-20 | 浪潮电子信息产业股份有限公司 | Spatial network node uniform deployment method based on virtual force |
| CN105163325A (en) * | 2015-09-25 | 2015-12-16 | 重庆工商大学 | Heterogeneous directed sensor network deployment method |
| CN105979540A (en) * | 2016-06-14 | 2016-09-28 | 昆明理工大学 | Real time positioning topology control method for three-dimensional wireless sensor network |
| CN106131862A (en) * | 2016-07-01 | 2016-11-16 | 厦门大学 | Optimization covering method based on multi-objective Evolutionary Algorithm in wireless sensor network |
| CN106550450A (en) * | 2016-10-11 | 2017-03-29 | 电子科技大学 | A kind of polyhedron grid covers searching method |
| CN107343283A (en) * | 2017-06-02 | 2017-11-10 | 电子科技大学 | A kind of three-dimensional static radio sensing network dispositions method based on genetic algorithm |
| CN107708133A (en) * | 2017-09-21 | 2018-02-16 | 浙江工业大学 | Underwater wireless sensor network multi-dimensional optimization node deployment method based on mesh generation |
| CN108200549A (en) * | 2018-01-10 | 2018-06-22 | 深圳市鑫汇达机械设计有限公司 | Tea growth ambient intelligence monitoring system |
| CN109033520A (en) * | 2018-06-25 | 2018-12-18 | 北京交通大学 | A kind of system Multipurpose Optimal Method based on random enhancing harmony algorithm |
| CN111542070A (en) * | 2020-04-17 | 2020-08-14 | 上海海事大学 | Efficient multi-constraint deployment method for industrial wireless sensor network |
| CN114676539A (en) * | 2022-04-12 | 2022-06-28 | 山东华方智联科技股份有限公司 | NB-IoT-based multi-target deployment method for intelligent electric meter |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101221236A (en) * | 2008-02-02 | 2008-07-16 | 北京航空航天大学 | Node self-locating method based on sampling of wireless sensor network in three-dimensional space |
| CN101339240A (en) * | 2008-08-26 | 2009-01-07 | 中国人民解放军海军工程大学 | Wireless sensor network object tracking method based on double layer forecast mechanism |
| CN101383736A (en) * | 2008-10-15 | 2009-03-11 | 中国科学院上海微系统与信息技术研究所 | Optimizing method for wireless sensor network node laying oriented to area monitoring |
-
2011
- 2011-03-02 CN CN201110049025.7A patent/CN102098687B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101221236A (en) * | 2008-02-02 | 2008-07-16 | 北京航空航天大学 | Node self-locating method based on sampling of wireless sensor network in three-dimensional space |
| CN101339240A (en) * | 2008-08-26 | 2009-01-07 | 中国人民解放军海军工程大学 | Wireless sensor network object tracking method based on double layer forecast mechanism |
| CN101383736A (en) * | 2008-10-15 | 2009-03-11 | 中国科学院上海微系统与信息技术研究所 | Optimizing method for wireless sensor network node laying oriented to area monitoring |
Non-Patent Citations (2)
| Title |
|---|
| 梁天、周晖、谢静、王坤赤: "无线传感器网络的多目标覆盖控制策略", 《传感技术学报》 * |
| 王换招、范琳、王海、李增智: "无线传感器网络多目标跟踪数据融合", 《西安交通大学学报》 * |
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102625324B (en) * | 2012-03-08 | 2014-10-01 | 上海大学 | Wireless optical fiber sensor network deployment method based on particle swarm optimization |
| CN102625324A (en) * | 2012-03-08 | 2012-08-01 | 上海大学 | Wireless optical fiber sensor network deployment method based on particle swarm optimization |
| CN102915355A (en) * | 2012-10-11 | 2013-02-06 | 李英明 | Multiprocessor task scheduling method based on harmony search and simulated annealing |
| CN102917388A (en) * | 2012-10-15 | 2013-02-06 | 中国联合网络通信集团有限公司 | Self-repairing method for base stations, cut-through management and control device, cluster head base station and communication system |
| CN102917388B (en) * | 2012-10-15 | 2015-03-25 | 中国联合网络通信集团有限公司 | Self-repairing method for base stations, cut-through management and control device, cluster head base station and communication system |
| CN103856952A (en) * | 2014-02-27 | 2014-06-11 | 上海大学 | Method for optimizing Pareto multiple target deployment of industrial wireless sensor network |
| CN103916927B (en) * | 2014-03-17 | 2017-06-13 | 华中科技大学 | A kind of wireless sensor network routing method based on improvement harmonic search algorithm |
| CN103916927A (en) * | 2014-03-17 | 2014-07-09 | 华中科技大学 | Wireless sensor network routing method based on improved harmony search algorithm |
| CN103997747A (en) * | 2014-05-14 | 2014-08-20 | 浪潮电子信息产业股份有限公司 | Spatial network node uniform deployment method based on virtual force |
| CN103997747B (en) * | 2014-05-14 | 2018-04-17 | 浪潮电子信息产业股份有限公司 | A kind of uniform dispositions method of spatial network node based on fictitious force |
| CN105163325B (en) * | 2015-09-25 | 2018-03-13 | 重庆工商大学 | Isomery directional sensor network dispositions method |
| CN105163325A (en) * | 2015-09-25 | 2015-12-16 | 重庆工商大学 | Heterogeneous directed sensor network deployment method |
| CN105979540A (en) * | 2016-06-14 | 2016-09-28 | 昆明理工大学 | Real time positioning topology control method for three-dimensional wireless sensor network |
| CN106131862A (en) * | 2016-07-01 | 2016-11-16 | 厦门大学 | Optimization covering method based on multi-objective Evolutionary Algorithm in wireless sensor network |
| CN106131862B (en) * | 2016-07-01 | 2019-08-16 | 厦门大学 | Optimization covering method based on multi-objective Evolutionary Algorithm in a kind of wireless sensor network |
| CN106550450A (en) * | 2016-10-11 | 2017-03-29 | 电子科技大学 | A kind of polyhedron grid covers searching method |
| CN106550450B (en) * | 2016-10-11 | 2019-08-13 | 电子科技大学 | A kind of polyhedron grid covering searching method |
| CN107343283A (en) * | 2017-06-02 | 2017-11-10 | 电子科技大学 | A kind of three-dimensional static radio sensing network dispositions method based on genetic algorithm |
| CN107708133A (en) * | 2017-09-21 | 2018-02-16 | 浙江工业大学 | Underwater wireless sensor network multi-dimensional optimization node deployment method based on mesh generation |
| CN107708133B (en) * | 2017-09-21 | 2021-02-26 | 浙江工业大学 | Mesh division-based underwater wireless sensor network multi-dimensional optimization node deployment method |
| CN108200549A (en) * | 2018-01-10 | 2018-06-22 | 深圳市鑫汇达机械设计有限公司 | Tea growth ambient intelligence monitoring system |
| CN109033520A (en) * | 2018-06-25 | 2018-12-18 | 北京交通大学 | A kind of system Multipurpose Optimal Method based on random enhancing harmony algorithm |
| CN111542070A (en) * | 2020-04-17 | 2020-08-14 | 上海海事大学 | Efficient multi-constraint deployment method for industrial wireless sensor network |
| CN111542070B (en) * | 2020-04-17 | 2023-03-14 | 上海海事大学 | Efficient multi-constraint deployment method for industrial wireless sensor network |
| CN114676539A (en) * | 2022-04-12 | 2022-06-28 | 山东华方智联科技股份有限公司 | NB-IoT-based multi-target deployment method for intelligent electric meter |
| CN114676539B (en) * | 2022-04-12 | 2022-10-14 | 山东华方智联科技股份有限公司 | NB-IoT-based multi-target deployment method for intelligent electric meter |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102098687B (en) | 2014-01-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102098687A (en) | Multi-object optimized deployment method for industrial wireless sensor network | |
| CN102014398B (en) | Optimal deployment method of large-scale industrial wireless sensor network based on differential evolution algorithm | |
| Martins et al. | A hybrid multiobjective evolutionary approach for improving the performance of wireless sensor networks | |
| CN106503839B (en) | Hierarchical planning method for offshore wind farm annular current collection network | |
| CN110334837A (en) | A kind of more AGV dispatching methods decomposed based on petri net | |
| CN103856952A (en) | Method for optimizing Pareto multiple target deployment of industrial wireless sensor network | |
| CN104734150A (en) | Power distribution network optimizing method | |
| CN102883429A (en) | Method and device for tracking move object in sensor network based on directional antenna | |
| Qu et al. | A distributed control method for urban networks using multi-agent reinforcement learning based on regional mixed strategy Nash-equilibrium | |
| Sun et al. | Edge computing terminal equipment planning method for real-time online monitoring service of power grid | |
| CN102238561A (en) | Node deployment method for energy efficient hierarchical collaboration coverage model | |
| CN108092267A (en) | A kind of power distribution network access planning system and method based on intelligent body | |
| CN103150605A (en) | Power grid planning auxiliary system | |
| CN110322079A (en) | A kind of flow of power plan optimization method | |
| Shi et al. | Energy dependent divisible load theory for wireless sensor network workload allocation | |
| CN103020290A (en) | Power grid information verifying method and system | |
| CN114004550B (en) | Power grid emergency repair and restoration scheduling cooperative decision method and system under natural disaster | |
| Wang et al. | The node placement of large-scale industrial wireless sensor networks based on binary differential evolution harmony search algorithm | |
| Hou et al. | Cable connection scheme optimization for offshore wind farm considering wake effect | |
| CN102509177B (en) | Locally weighted linear regression projection operation method based on cloud platform | |
| CN114090667A (en) | Distributed intelligent integrated management platform for cross-basin hydropower station group | |
| Yao et al. | Multihop clustering routing protocol based on improved coronavirus herd immunity optimizer and Q-learning in WSNs | |
| CN113689064A (en) | Transparent transformer substation management system architecture | |
| CN107292423B (en) | Uncertainty method-based energy efficiency power plant optimization configuration and plant network planning method | |
| Sun et al. | A genetic simulated annealing hybrid algorithm for relay nodes deployment optimization in industrial wireless sensor networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140115 Termination date: 20210302 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |