CN106028418A - Display drive device for automatic instrument - Google Patents

Abstract

The invention discloses a display drive device for an automatic instrument. The display drive device for the automatic instrument comprises a display, a slide slot, a mounting plate, a travel control piece, a triggering travel switch, a slide slot block, a crank connecting rod and a motor. An angle rotation device is arranged at the lower end of the display. The angle rotation device is equipped with a motor. The motor drives the crank connecting rod to rotate. The slide slot block is arranged below the mounting plate. The slide slot is arranged in the slide slot block. The tail end of the crank connecting rod is equipped with the travel control piece. One side of the travel control piece is equipped with the triggering travel switch. According to the device, the plane display is enabled to rotate in the left and right horizontal directions, or hoist in the up and down directions, or incline in the front and back directions; and moreover, the actions can be driven easily and reliably through an electric motor.

Description

A kind of drive device for display of instrument and meter for automation

Technical field

The invention belongs to technical field of electric appliances, particularly relate to the drive device for display of a kind of instrument and meter for automation.

Background technology

As the driving means of existing display, have and driven by electro-motor flat-panel screens in left and right horizontal Side is rotated up and is driven by electro-motor this flat-panel screens also at the device of incline direction tilting action.Additionally, also Have and manually make display be rotated up in left and right horizontal side or the most also device of tilting action or pass through Display is manually made to lift in the vertical direction or the device of tilting action (inclination) in the longitudinal direction.But, above-mentioned existing Device be not the most device as follows, it may be assumed that make display be rotated up in left and right horizontal side, or make it in the vertical direction Lifting, or make its most also tilting action, and, drive these actions by electro-motor.

Summary of the invention

It is an object of the invention to provide the drive device for display of a kind of instrument and meter for automation, it is intended to solving display can not The problem enough realizing angular turn voluntarily.

The present invention is achieved in that the drive device for display of instrument and meter for automation, the display of described instrument and meter for automation Driving means includes: display, chute, installing plate, Stroke Control sheet, triggering travel switch, runner block, crank connecting link, motor；

Display lower end arranges angular turn device, and angular turn device is provided with motor, and driven by motor crank connecting link rotates, It is provided with a runner block below installing plate, in runner block, has a chute, crank connecting link end to be provided with Stroke Control sheet, Stroke Control sheet Side is provided with triggering travel switch；

Described crank connecting link end is additionally provided with one stroke and controls sheet, and Stroke Control sheet side is provided with triggering travel switch；

Described crank connecting link penetrates chute and drives when electric machine rotation runner block to rotate around installing plate；

Described driving means is additionally provided with remote controller and remotely operates；

Further, the Image Iterative model representation of described display is:

Wherein, X is described target image, and M is sytem matrix, and G is described data for projection, and i represents iterations, X_iRepresent The iteration result obtained after ith iteration；λ represents convergence coefficient, and λ ∈ (0,1), and MT represents the transposition to matrix M；Institute is set State the initial value of target image, and utilize described iterative model in described target image according to the iterations pre-set Each pixel is iterated updating, and obtains described target image, the current grayvalue of the pixel in described iterative model with The gray value Uniform approximat of previous iteration；The described pixel zero setting by gray value in target image less than 0；

The object function of Image Iterative is:

$\underset{D,r}{min}\underset{i=1}{\overset{l}{\Σ}}\[\left|\right|R_i\mathrm{\Δ}-{\mathrm{D\α}}_i|{|}_2^2+\mathrm{\γ}|\left|{\mathrm{\α}}_i\right|{|}_l\];$

Wherein, R_i∈ RM × N, Δ represents described first non-negative image or described second non-negative image, R

_iΔ represents the image block extracted from Δ, | | | | 2 represent 2-norm, | | | | 1 represents 1-norm, and γ is regularization Parameter, D represented complete dictionary, α_iFor i-th image block R_iThe sparse coefficient that Δ is corresponding, Γ is the sparse system of all image blocks Manifold is closed.

Further, described remote controller is provided with data aggregate module, the data aggregation method tool of described data aggregate module Body includes:

Step one, deployment wireless sensor node: in the detection region that area is S=W × L, by wireless sensor node Point is deployed in detection region, and base station deployment is overseas at detection zone, and base station is used for receiving and process whole radio sensing network and collects The data message arrived；

Step 2, selection bunch head: whole detection region is evenly dividing by grid, makes the size shape of each grid Identical, the sensor node that selection positional distance grid element center is nearest in each grid is as a bunch head, and detection region is according to side Shape grid is evenly dividing, and chooses the nearest node of distance center in grid as a bunch head；

Step 3, sub-clustering: after a bunch head has selected, bunch head broadcast Cluster{ID, N, Hop} information, wherein, ID is joint The numbering of point, N is the jumping figure that Cluster information forwards, and the initial value of N is 0, and Hop is the jumping figure of default；It is in bunch attached After near neighbor node receives Cluster information, N increase by 1 forwards this information, again until N=Hop the most no longer forwards Cluster Information；The neighbor node of bunch head forward Cluster information after again to Cluster information being transmitted to oneself neighbor node, so One feedback information Join{ID of rear transmission, N, E_ir, d_ij, k_iGive the node that Cluster information is transmitted to oneself, the most at last Join information is transmitted to a bunch head and represents that oneself adds this bunch, wherein, E_irRepresent this node dump energy now, d_ijRepresent two Internodal distance, k_iRepresent that this node can monitor the size of the packet obtained；If a node have received multiple Cluster information, node just selects this bunch of addition that N value is little, if the equal node of N the most at will selects one bunch and joins this Bunch；If node does not receive Cluster information, then node sends Help information, adds from oneself nearest one bunch；

Wherein, dump energy E that each node is initial is obtained_irAfter, it is possible to estimate node by LEACH energy consumption model The surplus value of energy, such as after having carried out M wheel, one takes turns and obtains Monitoring Data for sensor node and then data successively uploaded, This process finally transferring data to base station is to take turns, and the dump energy of node can be evaluated whether as E=E_ir-M(E_tx+E_rx) =E_ir-M(2kE_elec+kε_{free-space-amp}d²), E_irBeing the node feeding back dump energy to bunch head, LEACH energy consumption model is The sensor that LEACH agreement proposes is the consumption models of energy expenditure when sending and receive data, and the form of embodying is:

$E_{tx}(k,d)=E_{tx-elec}\left(k\right)+E_{tx-amp}(k,d)=\left\{\begin{array}{c}{\mathrm{kE}}_{elec}+{\mathrm{k\ϵ}}_{free-space-amp}{d}^2,d\≤d_0\\ {\mathrm{kE}}_{elec}+{\mathrm{k\ϵ}}_{two-way-amp}{d}^2,d\≥d_0\end{array}\right.;$

E_rx(k)=E_re-elec(k)=kE_elec；

Wherein, E_elecRepresent wireless transceiver circuit energy consumption, ε_{free-space-amp}And ε_two-way-ampRepresent free space mode respectively The amplifier energy consumption of type and multichannel consumption models, d₀Being constant, d is communication node standoff distance, and k is the number to send or to receive According to figure place, E_tx(k, d) and E_rxEnergy consumption when () represents sensor transmission respectively and receive data k；By LEACH energy consumption model I.e. can get the dump energy of node；

Step 4, bunch interior nodes constitute simple graph model: in being obtained bunch by step 3 all nodes bunch in residing Position, by each node as a summit of figure, is connected with limit between each two adjacent node；

Step 5, bunch in the calculating of weights: by step 3, bunch head obtain bunch in the E of member node_ir、d_ijAnd k_i, calculate Two adjacent sections point i, the weights between j, the computing formula of weights is:

W_ij=a₁(E_ir+E_jr)+a₂d_ij+a₃(k_i+k_j)

Wherein, E_jr、k_jRepresent the size of the data that the dump energy of node j and node j can monitor, and a respectively₁+a₂ +a₃=1, such system just can be according to system to E_ir、d_ijOr k_iRequired proportion difference adjusts a_iValue and be met The different weights needed；

Step 6, bunch interior nodes build minimum spanning tree: according to the simple artwork of bunch interior nodes composition that step 4 obtains The weights that type and step 5 obtain, build bunch interior nodes minimum spanning tree according to the definition of Prim minimal spanning tree algorithm；

Step 7, bunch in data aggregate: after the minimum spanning tree construction complete of bunch interior nodes, sensor node starts normally Work, from the beginning of minimum one-level sensor node, the data of collection are passed to father node, the data that oneself is collected by father node with Passing to the father node of oneself after the data aggregate that child node transmits again, aggregated data is transferred to a bunch head the most at last；

Wherein, father node is to be referred to as father according to the node transmitting direction convergence data of data in minimum spanning tree to save Point, the node transferring data to father node is child node；

Step 8, the calculating of bunch head weights: after being completed by step 3 sub-clustering, bunch head obtains the position of whole bunch of interior nodes Put, residue energy of node and sensor node monitoring may obtain the size information of data, wherein E_cir=E_1r+E_2r+…+E_irTable Show the residual energy value of whole bunch, K_ciRepresent a bunch size of data for head polymerization, D_ijRepresent the distance between adjacent cluster head, to adjacent Two bunches of head i, between j, weights calculate, and the formula of weights is defined as:

W_ij=b₁(E_cir+E_cjr)+b₂D_ij+b₃(K_ci+K_cj)

Wherein, E_cjrAnd K_cjRepresent residual energy value and the size of data of bunch head j polymerization of bunch head j, and b respectively₁+b₂+b₃ =1, system according to system to E_cir、D_ijOr K_ciThe proportion difference required adjusts b_iValue and be met the weights of different needs；

Step 9, leader cluster node constitute simple graph model: each bunch of head is regarded a summit of figure, between adjacent cluster head Being connected with limit, the weights of each edge are obtained by the weight computing formula in step 8；

Step 10, leader cluster node structure minimum spanning tree: the simple graph model that the leader cluster node be given by step 8 is constituted After, build minimum spanning tree according to the definition of Prim minimal spanning tree algorithm；

Step 11, bunch head data aggregate: after the minimum spanning tree construction complete of leader cluster node, open from minimum one-level bunch head Begin, the data of collection are passed to father node, pass again after data that oneself is polymerized by father node and the data aggregate that child node transmits To the father node of oneself, aggregated data is transferred to base station the most at last；

Step 12, equilibrium node energy consumption: in order to balance the consumption of node energy, prevent the too fast death of node, maintenance bunch Properly functioning, after often carrying out M wheel, just reselect a bunch head, then re-start step above, wherein, the energy consumption of node Can be estimated by LEACH energy consumption model；

Step 13, bunch maintenance: after bunch interior nodes death, it is possible to bunch interior minimum spanning tree path can be caused to lose Effect, so will be before death at node, node sends a Die information to a bunch head, and representing oneself will be dead, and a bunch head receives this After one information, a bunch head begins to a bunch interior nodes is rebuild minimum spanning tree.

Further, described driving means and remote controller are by wireless body area network communication, and the safety of described wireless body area network connects Enter method and use unicast mode, specifically include: actively initiation mode and passively initiate mode；Unicast mode is in wireless body area network Single sensor node access network coordinator；

Actively initiate mode, be that network coordinator initiates to shake hands that to implement step as follows:

Step one, network coordinator sends through key k_AInformation Msg1 of encryption includes to sensor node A, Msg1 For producing random number N once_BNC of pair temporal key, and sensor node identity ID_A；

Step 2, after the random number that BN_A generates receives Msg1, verifies identity ID_A；If being proved to be successful, then generate BN_ The random number that A generates, and will be through key k_AInformation Msg2 of encryption is sent to network coordinator, otherwise abandons this information；

Step 3, after network coordinator receives Msg2, the random number that checking BNC generates；If being proved to be successful, then use PRF Function combines generating random number and loads pair temporal key, then uses key k under AES-CBC-MAC pattern_ACalculate The random number that BN_A generates, the message integrity authentication code KMAC of ID_A}, and KMAC is sent to sensor joint as Msg3 Point A, otherwise abandons this information；

Step 4, after sensor node A receives Msg3, uses the key k of oneself under AES-CBC-MAC pattern_ARoot Calculate KMAC' according to corresponding information, the KMAC received is compared with the KMAC' calculated, if unanimously, then sensor joint Point A PRF function combines generating random number and loads pair temporal key, and follow-on 4-Way Handshake completes, otherwise Abandon this information；

Certain sensor node index exceedes threshold value w_iTime, passively initiate mode, be that respective sensor node initiates to shake hands Implement step as follows:

Step one, sensor node A sends through key k_AInformation Msg1 of encryption includes to network coordinator, Msg1 For producing random number N once_BNC of pair temporal key, and sensor node identity ID_A；

Step 2, after network coordinator receives Msg1, verifies identity ID_A；If being proved to be successful, then generate random number Nonce_BNC, and will be through key k_AInformation Msg2 of encryption is sent to sensor node A, otherwise abandons this information；

Step 3, after sensor node A receives Msg2, random number N once_A that verificating sensor node A generates；If It is proved to be successful, then combines generating random number with PRF function and load pair temporal key, then under AES-CBC-MAC pattern Use key k_ACalculate BN_A generate random number, the message integrity authentication code KMAC of ID_A}, and using KMAC as Msg3 is sent to network coordinator, otherwise abandons this information；

Step 4, after network coordinator receives Msg3, uses key k under AES-CBC-MAC pattern_AAccording to corresponding letter Breath calculates KMAC', is compared with the KMAC' calculated by the KMAC received, if unanimously, then and network coordinator PRF Function combines generating random number and loads pair temporal key, and follow-on 4-Way Handshake completes, and otherwise abandons this letter Breath.

The drive device for display of the instrument and meter for automation that the present invention provides, has the advantage that and can make flat-panel screens It is rotated up in left and right horizontal side, or makes it lift in the vertical direction, or make its most also tilting action, not only So, these are to easily and reliably driven to move by electro-motor.The present invention is used can effectively to reduce network congestion, Shorten and access required time, and use (restriction of sensor node (BN) quantity) to control the switching between both of which, can be effective Reduce the operand of sensor node (BN), save sensor node (BN) resource.

Accompanying drawing explanation

Fig. 1 is the drive device for display structural representation of the instrument and meter for automation that the embodiment of the present invention provides；

In figure: 1, display；2, chute；3, installing plate；4, Stroke Control sheet；5, travel switch is triggered；6, runner block；7、 Crank connecting link；8, motor.

Detailed description of the invention

In order to make the purpose of the present invention, technical scheme and advantage clearer, below in conjunction with embodiment, to the present invention It is further elaborated.Should be appreciated that specific embodiment described herein, only in order to explain the present invention, is not used to Limit the present invention.

The application principle of 1 couple of present invention is further described below in conjunction with the accompanying drawings.The display of this instrument and meter for automation drives Device includes: 1, display；2, chute；3, installing plate；4, Stroke Control sheet；5, travel switch is triggered；6, runner block；7, crank Connecting rod；8, motor；

Display 1 lower end arranges angular turn device, and angular turn device is provided with motor 8, and motor 8 drives crank connecting link 7 Rotate, be provided with a runner block 6 below installing plate 3, in runner block 6, have a chute 2, crank connecting link 7 end to be provided with Stroke Control sheet 4, Stroke Control sheet 4 side is provided with triggering travel switch 5.

Described crank connecting link 7 end is additionally provided with one stroke and controls sheet 4, and Stroke Control sheet 4 side is provided with triggering travel switch 5。

Described crank connecting link 7 penetrates chute 2 and drives when motor 8 rotates runner block to rotate around installing plate 3.

Described driving means is additionally provided with remote controller and remotely operates.

Further, the Image Iterative model representation of described display is:

Wherein, X is described target image, and M is sytem matrix, and G is described data for projection, and i represents iterations, X_iRepresent The iteration result obtained after ith iteration；λ represents convergence coefficient, and λ ∈ (0,1), and MT represents the transposition to matrix M；Institute is set State the initial value of target image, and utilize described iterative model in described target image according to the iterations pre-set Each pixel is iterated updating, and obtains described target image, the current grayvalue of the pixel in described iterative model with The gray value Uniform approximat of previous iteration；The described pixel zero setting by gray value in target image less than 0；

The object function of Image Iterative is:

$\underset{D,r}{min}\underset{i=1}{\overset{l}{\Σ}}\[\left|\right|R_i\mathrm{\Δ}-{\mathrm{D\α}}_i|{|}_2^2+\mathrm{\γ}|\left|{\mathrm{\α}}_i\right|{|}_l\];$

Wherein, R_i∈ RM × N, Δ represents described first non-negative image or described second non-negative image, R

_iΔ represents the image block extracted from Δ, | | | | 2 represent 2-norm, | | | | 1 represents 1-norm, and γ is regularization Parameter, D represented complete dictionary, α_iFor i-th image block R_iThe sparse coefficient that Δ is corresponding, Γ is the sparse system of all image blocks Manifold is closed.

Further, described remote controller is provided with data aggregate module, the data aggregation method tool of described data aggregate module Body includes:

Step one, deployment wireless sensor node: in the detection region that area is S=W × L, by wireless sensor node Point is deployed in detection region, and base station deployment is overseas at detection zone, and base station is used for receiving and process whole radio sensing network and collects The data message arrived；

Step 2, selection bunch head: whole detection region is evenly dividing by grid, makes the size shape of each grid Identical, the sensor node that selection positional distance grid element center is nearest in each grid is as a bunch head, and detection region is according to side Shape grid is evenly dividing, and chooses the nearest node of distance center in grid as a bunch head；

Step 3, sub-clustering: after a bunch head has selected, bunch head broadcast Cluster{ID, N, Hop} information, wherein, ID is joint The numbering of point, N is the jumping figure that Cluster information forwards, and the initial value of N is 0, and Hop is the jumping figure of default；It is in bunch attached After near neighbor node receives Cluster information, N increase by 1 forwards this information, again until N=Hop the most no longer forwards Cluster Information；The neighbor node of bunch head forward Cluster information after again to Cluster information being transmitted to oneself neighbor node, so One feedback information Join{ID of rear transmission, N, E_ir, d_ij, k_iGive the node that Cluster information is transmitted to oneself, the most at last Join information is transmitted to a bunch head and represents that oneself adds this bunch, wherein, E_irRepresent this node dump energy now, d_ijRepresent two Internodal distance, k_iRepresent that this node can monitor the size of the packet obtained；If a node have received multiple Cluster information, node just selects this bunch of addition that N value is little, if the equal node of N the most at will selects one bunch and joins this Bunch；If node does not receive Cluster information, then node sends Help information, adds from oneself nearest one bunch；

Wherein, dump energy E that each node is initial is obtained_irAfter, it is possible to estimate node by LEACH energy consumption model The surplus value of energy, such as after having carried out M wheel, one takes turns and obtains Monitoring Data for sensor node and then data successively uploaded, This process finally transferring data to base station is to take turns, and the dump energy of node can be evaluated whether as E=E_ir-M(E_tx+E_rx) =E_ir-M(2kE_elec+kε_{free-space-amp}d²), E_irBeing the node feeding back dump energy to bunch head, LEACH energy consumption model is The sensor that LEACH agreement proposes is the consumption models of energy expenditure when sending and receive data, and the form of embodying is:

$E_{tx}(k,d)=E_{tx-elec}\left(k\right)+E_{tx-amp}(k,d)=\left\{\begin{array}{c}{\mathrm{kE}}_{elec}+{\mathrm{k\ϵ}}_{free-space-amp}{d}^2,d\≤d_0\\ {\mathrm{kE}}_{elec}+{\mathrm{k\ϵ}}_{two-way-amp}{d}^2,d\≥d_0\end{array}\right.;$

E_rx(k)=E_re-elec(k)=kE_elec；

Wherein, E_elecRepresent wireless transceiver circuit energy consumption, ε_{free-space-amp}And ε_two-way-ampRepresent free space mode respectively The amplifier energy consumption of type and multichannel consumption models, d₀Being constant, d is communication node standoff distance, and k is the number to send or to receive According to figure place, E_tx(k, d) and E_rxEnergy consumption when () represents sensor transmission respectively and receive data k；By LEACH energy consumption model I.e. can get the dump energy of node；

Step 4, bunch interior nodes constitute simple graph model: in being obtained bunch by step 3 all nodes bunch in residing Position, by each node as a summit of figure, is connected with limit between each two adjacent node；

Step 5, bunch in the calculating of weights: by step 3, bunch head obtain bunch in the E of member node_ir、d_ijAnd k_i, calculate Two adjacent sections point i, the weights between j, the computing formula of weights is:

W_ij=a₁(E_ir+E_jr)+a₂d_ij+a₃(k_i+k_j)

Wherein, E_jr、k_jRepresent the size of the data that the dump energy of node j and node j can monitor, and a respectively₁+a₂ +a₃=1, such system just can be according to system to E_ir、d_ijOr k_iRequired proportion difference adjusts a_iValue and be met The different weights needed；

Step 6, bunch interior nodes build minimum spanning tree: according to the simple artwork of bunch interior nodes composition that step 4 obtains The weights that type and step 5 obtain, build bunch interior nodes minimum spanning tree according to the definition of Prim minimal spanning tree algorithm；

Step 7, bunch in data aggregate: after the minimum spanning tree construction complete of bunch interior nodes, sensor node starts normally Work, from the beginning of minimum one-level sensor node, the data of collection are passed to father node, the data that oneself is collected by father node with Passing to the father node of oneself after the data aggregate that child node transmits again, aggregated data is transferred to a bunch head the most at last；

Wherein, father node is to be referred to as father according to the node transmitting direction convergence data of data in minimum spanning tree to save Point, the node transferring data to father node is child node；

Step 8, the calculating of bunch head weights: after being completed by step 3 sub-clustering, bunch head obtains the position of whole bunch of interior nodes Put, residue energy of node and sensor node monitoring may obtain the size information of data, wherein E_cir=E_1r+E_2r+…+E_irTable Show the residual energy value of whole bunch, K_ciRepresent a bunch size of data for head polymerization, D_ijRepresent the distance between adjacent cluster head, to adjacent Two bunches of head i, between j, weights calculate, and the formula of weights is defined as:

W_ij=b₁(E_cir+E_cjr)+b₂D_ij+b₃(K_ci+K_cj)

Wherein, E_cjrAnd K_cjRepresent residual energy value and the size of data of bunch head j polymerization of bunch head j, and b respectively₁+b₂+b₃ =1, system according to system to E_cir、D_ijOr K_ciThe proportion difference required adjusts b_iValue and be met the weights of different needs；

Step 9, leader cluster node constitute simple graph model: each bunch of head is regarded a summit of figure, between adjacent cluster head Being connected with limit, the weights of each edge are obtained by the weight computing formula in step 8；

Step 10, leader cluster node structure minimum spanning tree: the simple graph model that the leader cluster node be given by step 8 is constituted After, build minimum spanning tree according to the definition of Prim minimal spanning tree algorithm；

Step 11, bunch head data aggregate: after the minimum spanning tree construction complete of leader cluster node, open from minimum one-level bunch head Begin, the data of collection are passed to father node, pass again after data that oneself is polymerized by father node and the data aggregate that child node transmits To the father node of oneself, aggregated data is transferred to base station the most at last；

Step 12, equilibrium node energy consumption: in order to balance the consumption of node energy, prevent the too fast death of node, maintenance bunch Properly functioning, after often carrying out M wheel, just reselect a bunch head, then re-start step above, wherein, the energy consumption of node Can be estimated by LEACH energy consumption model；

Step 13, bunch maintenance: after bunch interior nodes death, it is possible to bunch interior minimum spanning tree path can be caused to lose Effect, so will be before death at node, node sends a Die information to a bunch head, and representing oneself will be dead, and a bunch head receives this After one information, a bunch head begins to a bunch interior nodes is rebuild minimum spanning tree.

Further, described driving means and remote controller are by wireless body area network communication, and the safety of described wireless body area network connects Enter method and use unicast mode, specifically include: actively initiation mode and passively initiate mode；Unicast mode is in wireless body area network Single sensor node access network coordinator；

Actively initiate mode, be that network coordinator initiates to shake hands that to implement step as follows:

Step one, network coordinator sends through key k_AInformation Msg1 of encryption includes to sensor node A, Msg1 For producing random number N once_BNC of pair temporal key, and sensor node identity ID_A；

Step 2, after the random number that BN_A generates receives Msg1, verifies identity ID_A；If being proved to be successful, then generate BN_ The random number that A generates, and will be through key k_AInformation Msg2 of encryption is sent to network coordinator, otherwise abandons this information；

Step 3, after network coordinator receives Msg2, the random number that checking BNC generates；If being proved to be successful, then use PRF Function combines generating random number and loads pair temporal key, then uses key k under AES-CBC-MAC pattern_ACalculate The random number that BN_A generates, the message integrity authentication code KMAC of ID_A}, and KMAC is sent to sensor joint as Msg3 Point A, otherwise abandons this information；

Step 4, after sensor node A receives Msg3, uses the key k of oneself under AES-CBC-MAC pattern_ARoot Calculate KMAC' according to corresponding information, the KMAC received is compared with the KMAC' calculated, if unanimously, then sensor joint Point A PRF function combines generating random number and loads pair temporal key, and follow-on 4-Way Handshake completes, otherwise Abandon this information；

Certain sensor node index exceedes threshold value w_iTime, passively initiate mode, be that respective sensor node initiates to shake hands Implement step as follows:

Step one, sensor node A sends through key k_AInformation Msg1 of encryption includes to network coordinator, Msg1 For producing random number N once_BNC of pair temporal key, and sensor node identity ID_A；

Step 2, after network coordinator receives Msg1, verifies identity ID_A；If being proved to be successful, then generate random number Nonce_BNC, and will be through key k_AInformation Msg2 of encryption is sent to sensor node A, otherwise abandons this information；

Step 3, after sensor node A receives Msg2, random number N once_A that verificating sensor node A generates；If It is proved to be successful, then combines generating random number with PRF function and load pair temporal key, then under AES-CBC-MAC pattern Use key k_ACalculate BN_A generate random number, the message integrity authentication code KMAC of ID_A}, and using KMAC as Msg3 is sent to network coordinator, otherwise abandons this information；

Step 4, after network coordinator receives Msg3, uses key k under AES-CBC-MAC pattern_AAccording to corresponding letter Breath calculates KMAC', is compared with the KMAC' calculated by the KMAC received, if unanimously, then and network coordinator PRF Function combines generating random number and loads pair temporal key, and follow-on 4-Way Handshake completes, and otherwise abandons this letter Breath.

This device realizes rotating under the operation of remote controller, and crank connecting link 7 penetrates chute 2 and drives when motor 8 rotates sliding Geosynclinal block 6 rotates around installing plate 3, and corresponding promotion installing plate 3 realizes liquid crystal display angle adjustment around hinged axis rotation, and crank is even Bar 7 end is additionally provided with one stroke and controls sheet 4, Stroke Control sheet 4 concomitant rotation when motor 8 drives crank connecting link 7 positive and negative rotation Trigger travel switch 5 action stop angle when reaching the limit of to adjust.

The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all essences in the present invention Any amendment, equivalent and the improvement etc. made within god and principle, should be included within the scope of the present invention.

Claims (4)

1. the drive device for display of an instrument and meter for automation, it is characterised in that the display of described instrument and meter for automation drives dress Put and include: display, chute, installing plate, Stroke Control sheet, triggering travel switch, runner block, crank connecting link, motor；

Display lower end arranges angular turn device, and angular turn device is provided with motor, and driven by motor crank connecting link rotates, and installs It is provided with a runner block below plate, in runner block, has a chute, crank connecting link end to be provided with Stroke Control sheet, Stroke Control sheet side It is provided with triggering travel switch；

Described crank connecting link end is additionally provided with one stroke and controls sheet, and Stroke Control sheet side is provided with triggering travel switch；

Described crank connecting link penetrates chute and drives when electric machine rotation runner block to rotate around installing plate；

Described driving means is additionally provided with remote controller and remotely operates.

2. the drive device for display of instrument and meter for automation as claimed in claim 1, it is characterised in that the image of described display Iterative model is expressed as:

Wherein, X is described target image, and M is sytem matrix, and G is described data for projection, and i represents iterations, X_iRepresent i & lt The iteration result obtained after iteration；λ represents convergence coefficient, and λ ∈ (0,1), and MT represents the transposition to matrix M；Described mesh is set The initial value of logo image, and utilize each in described target image of described iterative model according to the iterations pre-set Pixel is iterated updating, and obtains described target image, and the current grayvalue of the pixel in described iterative model is with previous The gray value Uniform approximat of iteration；The described pixel zero setting by gray value in target image less than 0；

The object function of Image Iterative is:

$\underset{D,r}{min}\underset{i=1}{\overset{l}{\Σ}}\[\left|\right|R_i\mathrm{\Δ}-{\mathrm{D\α}}_i|{|}_2^2+\mathrm{\γ}|\left|{\mathrm{\α}}_i\right|{|}_l\];$

Wherein, R_i∈ RM × N, Δ represents described first non-negative image or described second non-negative image, R

_iΔ represents the image block extracted from Δ, | | | | 2 represent 2-norm, | | | | 1 represents 1-norm, and γ is regularization parameter, D Represented complete dictionary, α_iFor i-th image block R_iThe sparse coefficient that Δ is corresponding, Γ is the sparse coefficient set of all image blocks.

3. the drive device for display of instrument and meter for automation as claimed in claim 1, it is characterised in that described remote controller is provided with Data aggregate module, the data aggregation method of described data aggregate module specifically includes:

Step one, deployment wireless sensor node: in the detection region that area is S=W × L, by wireless sensor node portion Affixing one's name in detection region, base station deployment is overseas at detection zone, and base station is for receiving and process what whole radio sensing network was collected Data message；

Step 2, selection bunch head: whole detection region is evenly dividing by grid, makes the size shape phase of each grid With, the sensor node that selection positional distance grid element center is nearest in each grid is as a bunch head, and detection region is according to square Grid is evenly dividing, and chooses the nearest node of distance center in grid as a bunch head；

Step 3, sub-clustering: after a bunch head has selected, bunch head broadcast Cluster{ID, N, Hop} information, wherein, ID is node Numbering, N is the jumping figure that Cluster information forwards, and the initial value of N is 0, and Hop is the jumping figure of default；It is near bunch head After neighbor node receives Cluster information, N increase by 1 forwards this information, again until N=Hop the most no longer forwards Cluster to believe Breath；The neighbor node of bunch head forward Cluster information after again to Cluster information being transmitted to oneself neighbor node, then Send a feedback information Join{ID, N, E_ir, d_ij, k_iGive the node that Cluster information is transmitted to oneself, Join the most at last Information is transmitted to a bunch head and represents that oneself adds this bunch, wherein, E_irRepresent this node dump energy now, d_ijRepresent two nodes Between distance, k_iRepresent that this node can monitor the size of the packet obtained；If a node have received multiple Cluster Information, node just selects this bunch of addition that N value is little, if the equal node of N the most at will selects one bunch and joins this bunch；If joint Point does not receive Cluster information, then node sends Help information, adds from oneself nearest one bunch；

Wherein, dump energy E that each node is initial is obtained_irAfter, it is possible to estimate node energy by LEACH energy consumption model Surplus value, such as after having carried out M wheel, one takes turns and obtains Monitoring Data for sensor node and then data successively uploaded, finally This process transferring data to base station is to take turns, and the dump energy of node can be evaluated whether as E=E_ir-M(E_tx+E_rx)= E_ir-M(2kE_elec+kε_{free-space-amp}d²), E_irBeing the node feeding back dump energy to bunch head, LEACH energy consumption model is The sensor that LEACH agreement proposes is the consumption models of energy expenditure when sending and receive data, and the form of embodying is:

$E_{tx}(k,d)=E_{tx-elec}\left(k\right)+E_{tx-amp}(k,d)=\left\{\begin{array}{c}{\mathrm{kE}}_{elec}+{\mathrm{k\ϵ}}_{free-space-amp}{d}^2,d\≤d_0\\ {\mathrm{kE}}_{elec}+{\mathrm{k\ϵ}}_{two-way-amp}{d}^2,d\≥d_0\end{array}\right.;$

E_rx(k)=E_re-elec(k)=kE_elec；

Wherein, E_elecRepresent wireless transceiver circuit energy consumption, ε_{free-space-amp}And ε_two-way-ampRespectively represent free space model and The amplifier energy consumption of multichannel consumption models, d₀Being constant, d is communication node standoff distance, and k is the data bit to send or to receive Number, E_tx(k, d) and E_rxEnergy consumption when () represents sensor transmission respectively and receive data k；By LEACH energy consumption model Obtain the dump energy of node；

Step 4, bunch interior nodes constitute simple graph model: in being obtained bunch by step 3 all nodes bunch in location, By each node as a summit of figure, it is connected with limit between each two adjacent node；

Step 5, bunch in the calculating of weights: by step 3, bunch head obtain bunch in the E of member node_ir、d_ijAnd k_i, calculate adjacent Two node i, the weights between j, the computing formula of weights is:

W_ij=a₁(E_ir+E_jr)+a₂d_ij+a₃(k_i+k_j)

Wherein, E_jr、k_jRepresent the size of the data that the dump energy of node j and node j can monitor, and a respectively₁+a₂+a₃ =1, such system just can be according to system to E_ir、d_ijOr k_iRequired proportion difference adjusts a_iValue and be met difference The weights needed；

Step 6, bunch interior nodes build minimum spanning tree: simple graph model that bunch interior nodes obtained according to step 4 is constituted and The weights that step 5 obtains, build bunch interior nodes minimum spanning tree according to the definition of Prim minimal spanning tree algorithm；

Step 7, bunch in data aggregate: after the minimum spanning tree construction complete of bunch interior nodes, sensor node starts normal work Make, from the beginning of minimum one-level sensor node, the data of collection are passed to father node, data that oneself is collected by father node and son Passing to the father node of oneself after the data aggregate that node transmits again, aggregated data is transferred to a bunch head the most at last；

Wherein, father node is that the node of the transmission direction convergence data in minimum spanning tree according to data is referred to as father node, will It is child node that data are transferred to the node of father node；

Step 8, the calculating of bunch head weights: after being completed by step 3 sub-clustering, bunch head obtains the position of whole bunch of interior nodes, joint Point dump energy and sensor node may monitor the size information obtaining data, wherein E_cir=E_1r+E_2r+…+E_irRepresent whole The residual energy value of individual bunch, K_ciRepresent a bunch size of data for head polymerization, D_ijRepresent the distance between adjacent cluster head, to adjacent two bunches Head i, between j, weights calculate, and the formula of weights is defined as:

W_ij=b₁(E_cir+E_cjr)+b₂D_ij+b₃(K_ci+K_cj)

Wherein, E_cjrAnd K_cjRepresent residual energy value and the size of data of bunch head j polymerization of bunch head j, and b respectively₁+b₂+b₃=1, System according to system to E_cir、D_ijOr K_ciThe proportion difference required adjusts b_iValue and be met the weights of different needs；

Step 9, leader cluster node constitute simple graph model: by each bunch of head as a summit of figure, use limit between adjacent cluster head Being connected, the weights of each edge are obtained by the weight computing formula in step 8；

Step 10, leader cluster node build minimum spanning tree: after the simple graph model that the leader cluster node be given by step 8 is constituted, root Minimum spanning tree is built according to the definition of Prim minimal spanning tree algorithm；

Step 11, bunch head data aggregate: after the minimum spanning tree construction complete of leader cluster node, from the beginning of minimum one-level bunch head, The data of collection are passed to father node, pass to again after data that oneself is polymerized by father node and the data aggregate that child node transmits from Oneself father node, aggregated data is transferred to base station the most at last；

Step 12, equilibrium node energy consumption: in order to balance the consumption of node energy, prevent the too fast death of node, and maintenance bunch is normal Running, after often carrying out M wheel, just reselect a bunch head, then re-start step above, wherein, the energy consumption of node can be by LEACH energy consumption model is estimated；

Step 13, bunch maintenance: after bunch interior nodes death, it is possible to a bunch interior minimum spanning tree path failure, institute can be caused With will be before death at node, node sends a Die information to a bunch head, and representing oneself will be dead, and a bunch head receives this letter After breath, a bunch head begins to a bunch interior nodes is rebuild minimum spanning tree.

4. the drive device for display of instrument and meter for automation as claimed in claim 1, it is characterised in that described driving means is with distant Control device is used unicast mode by wireless body area network communication, the safety access method of described wireless body area network, is specifically included: actively Initiation mode and passively initiate mode；Unicast mode is single sensor node access network coordinator in wireless body area network；

Actively initiate mode, be that network coordinator initiates to shake hands that to implement step as follows:

Step one, network coordinator sends through key k_AEncryption information Msg1 to sensor node A, Msg1 include for Produce random number N once_BNC of pair temporal key, and sensor node identity ID_A；

Step 2, after the random number that BN_A generates receives Msg1, verifies identity ID_A；If being proved to be successful, then generate BN_A raw The random number become, and will be through key k_AInformation Msg2 of encryption is sent to network coordinator, otherwise abandons this information；

Step 3, after network coordinator receives Msg2, the random number that checking BNC generates；If being proved to be successful, then use PRF function In conjunction with generating random number and load pair temporal key, under AES-CBC-MAC pattern, then use key k_ACalculate { BN_A The random number generated, the message integrity authentication code KMAC of ID_A}, and KMAC is sent to sensor node A as Msg3, no Then abandon this information；

Step 4, after sensor node A receives Msg3, uses the key k of oneself under AES-CBC-MAC pattern_AAccording to accordingly Information calculates KMAC', is compared with the KMAC' calculated by the KMAC received, if unanimously, then sensor node A uses PRF function combines generating random number and loads pair temporal key, and follow-on 4-Way Handshake completes, and otherwise abandons This information；

Certain sensor node index exceedes threshold value w_iTime, passively initiate mode, be that respective sensor node initiates to shake hands the most in fact Existing step is as follows:

Step one, sensor node A sends through key k_AEncryption information Msg1 to network coordinator, Msg1 include for Produce random number N once_BNC of pair temporal key, and sensor node identity ID_A；

Step 2, after network coordinator receives Msg1, verifies identity ID_A；If being proved to be successful, then generate random number N once_ BNC, and will be through key k_AInformation Msg2 of encryption is sent to sensor node A, otherwise abandons this information；

Step 3, after sensor node A receives Msg2, random number N once_A that verificating sensor node A generates；If checking Success, then combine generating random number with PRF function and load pair temporal key, then uses under AES-CBC-MAC pattern Key k_ACalculate the random number that BN_A generates, the message integrity authentication code KMAC of ID_A}, and KMAC is sent out as Msg3 Give network coordinator, otherwise abandon this information；

Step 4, after network coordinator receives Msg3, uses key k under AES-CBC-MAC pattern_AAccording to corresponding information meter Calculate KMAC', the KMAC received is compared with the KMAC' calculated, if unanimously, then network coordinator PRF function In conjunction with generating random number and load pair temporal key, follow-on 4-Way Handshake completes, and otherwise abandons this information.