CN107426791A - A kind of civil engineering Automatic Water System - Google Patents
A kind of civil engineering Automatic Water System Download PDFInfo
- Publication number
- CN107426791A CN107426791A CN201710752696.7A CN201710752696A CN107426791A CN 107426791 A CN107426791 A CN 107426791A CN 201710752696 A CN201710752696 A CN 201710752696A CN 107426791 A CN107426791 A CN 107426791A
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- mrow
- msub
- formula
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/46—Cluster building
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to hydrotechny field, discloses a kind of civil engineering Automatic Water System, including：Sump；Silion cell plate is equipped with the top of sump；Sump right-hand member is provided with feed pipe；Sump right-hand member bottom is embedded with water level alarm；Sump bottom is provided with buried pipe；Cabinet is bolted inside sump；Cabinet passes on left bolt and fixes accumulator；Enclosure top is embedded with water level monitor；Cabinet right is provided with controller；Water pump is bolted below cabinet；Water pump right-hand member is connected outlet pipe；Water pump bottom is connected buried pipe；Silion cell plate connects accumulator by circuit line；Accumulator, water level monitor, controller, water pump are connected by circuit line.The present invention, which is provided with silion cell plate, can provide the high-efficiency cleaning energy, save the energy, economic and environment-friendly；The water level alarm of setting can be in advance to the too low alarm of water level, and prevent from supplying water influences the duration not in time；Device structure is simple, convenient and practical.
Description
Technical field
The invention belongs to hydrotechny field, more particularly to a kind of civil engineering Automatic Water System.
Background technology
Civil engineering is that all kinds of facilities and the engineering discipline in place are built in the activity such as human lives, production, protection, is covered
On the ground, the house in each category such as underground, land, waterborne, underwater, road, railway, airport, bridge, water conservancy, harbour, tunnel,
The construction of the building, structures, engineering thing in facility and place in all works scopes such as plumbing, protection；Carrying out greatly
Mass concrete construction needs to conserve concrete, the long-term disperse water in construction site；However, existing building scene is supplied water
System constructing is complicated, and quantities is big, consuming energy, while can not send the warning information of water storage shortcoming in time.
In summary, the problem of prior art is present be：Existing building scene water system structure is complicated, and quantities is big,
Consuming energy, while the warning information of water storage shortcoming can not be sent in time.
The content of the invention
The problem of existing for prior art, the invention provides a kind of civil engineering Automatic Water System.
The present invention is achieved in that a kind of civil engineering Automatic Water System, the civil engineering Automatic Water System
It is provided with：Sump, cabinet, silion cell plate, feed pipe, water level alarm and buried pipe；
Silion cell plate is equipped with the top of the sump；The sump right-hand member is provided with feed pipe；The sump right-hand member bottom
Embedded with water level alarm；The sump bottom is provided with buried pipe；Cabinet is bolted inside the sump；
The cabinet passes on left bolt and fixes accumulator；The enclosure top is embedded with water level monitor；The cabinet
Right is provided with controller；Water pump is bolted below the cabinet；
The implementation method of the controller Timing Synchronization includes：
Step 1, according to formulaBy training sequence and the cyclic shift result of itself
Conjugation related operation is carried out by sign bit, obtains correlation function M (m), wherein c (k) is that local sequence is mapped out by sign bit
Complex result, c ((k+m))NIn k=1,2 ... represent to carry out c (k) result of cyclic shift during N；Search out related letter
Number main peak value and corresponding frequency domain sequence under submaximum value ratio maximum case, it is then determined that training sequence corresponding to the frequency domain sequence
Row；FormulaRepresent that training sequence is total to the cyclic shift result of itself by sign bit
Yoke related operation, wherein c (k) are the complex results mapped out to local sequence C (k) by sign bit, mapping equation be c (k)=
sign(Re(C(k)))+j*sign(Im(C(k)))；c((k))NRepresent to results of the c (k) using N as cycle progress periodic extension,
Thus c ((k+m))NIn k=1,2 ... representing to carry out c (k) result of cyclic shift during N, m ＞ 0 represent ring shift left m positions,
M ＜ 0 represent ring shift right | m | position, understand that correlation function value can go out when cyclic sequence circulation moves 0 according to the structure of sequence
An existing bigger main peak, peak value is M (0), and if during to training sequence or so cyclic shift NFFT, correlation function value all can
There is less submaximum, two peak values are respectively M (NFFT), M (- NFFT)；The purpose for searching for frequency-domain data sequence is to make training sequence
When row move 0 it is with the biggest gap to move the submaximum value that NFFT positions occur for the main peak value that occurs and circulation left and right, ensures to receive number with this
According to the timing slip estimation function main peak value and the gap of submaximum value obtained with training sequence by sign bit related operation as far as possible
Greatly, increase the span of dynamic threshold, because two submaximum value sizes of correlation function are essentially identical, take its main peak value M (0) and
The ratio of one of submaximum value M (NFFT) is as criterion；
Step 2, by reception signal data R (x), according to formula r (x)=sign (Re (R (x)))+j*sign (Im (R (x)))
The result r (x) mapped out to reception signal reality imaginary part by sign bit is obtained, then by local training sequence data C (k), utilizes formula c
(k)=sign (Re (C (k)))+j*sign (Im (C (k))) obtains the knot mapped out to training sequence data reality imaginary part by sign bit
Fruit c (k), formula is utilized according to obtained r (x) and c (k)
Timing slip estimation function is generated, N=2* (NFFT+CP) represents the length of associated window and local sequence in formula, and x, which is represented, slides phase
Close the original position of window；
Step 3, the timing slip estimation function F (x) obtained by step 2, according to formula
Dynamic threshold is obtained, wherein G (m) represents the value of m moment dynamic thresholds,Represent the M started counting up from the m moment
The average value of individual timing slip estimation function value, mul represent a constant；
The water pump right-hand member is connected outlet pipe；The water pump bottom is connected buried pipe；
The controller is connected with water level monitor, water level alarm by Internet of Things；
The link stability and energy hybrid model of the Internet of Things method for repairing route：
Internet of Things topological structure regards the network model G=(V, E) of a non-directed graph as, and wherein V represents a group node, E tables
Show the side collection of one group of connecting node, P (u, v)={ P0,P1,P2,L,PnBe all possible paths between node u and node v collection
Close, PiIt is node u and v possible path, selects egress u to node v optimal path,
The formula of link stability and residue energy of node is as follows：
Wherein, EisAnd Ei0For the dump energy and gross energy of node i, EthFor the energy threshold of node；
Link stability formula and residue energy of node formula change into the optimization formula of a totality, and the formula provides two
Individual important parameter (w1And w2), shown in its expression formula such as formula (4)：
Wherein w1And w2The coefficient of setting between node energy and link stationary value, w1+w2=1；
The maximum of the target summation is taken, is represented with formula below (5)：
MRFact(Pi)=max { RFact (P1),RFact(P2),L RFact(Pn)} (5)
Node when receiving data packet information, according to formula (1) and formula (2) calculate respectively outgoing link stationary value and
The dump energy of node, optimal path then is chosen using formula (5), to complete the selected of route.
The route anticipation specific method of the Internet of Things method for repairing route includes：
Step 1, first determine whether with the presence or absence of the effective routing for reaching destination node in reception RREQ node, if in the presence of
Establish link；
Step 2, calculate the dump energy and reception RREQ for receiving RREQ nodes respectively according to formula (1) and formula (2)
Link stationary value between node and transmission RREQ nodes；
Step 3, the link for judging the dump energy of receiving node and receiving RREQ nodes and sending between RREQ nodes are stable
Whether value is more than threshold value, if being less than threshold value, abandons the node；
Step 4, if being more than threshold value, record meets the node and routing information of condition in RREQ nodes are sent, and according to
Formula (4) selects optimal node forwarding RREQ bags；
Step 5, step 1 is returned to, continued executing with, is route until establishing；
During the Internet of Things data polymerization, comprise the following steps：
Step 1, deployment wireless senser：In the detection zone that area is S=W × L, wireless senser is deployed in inspection
Survey region；
Step 2, selection cluster head：Whole detection zone is evenly dividing by grid, makes the size shape of each grid
It is identical, the nearest sensor node of positional distance grid element center is selected in each grid as cluster head；
Step 3, sub-clustering：After the completion of cluster head selection, cluster head broadcast Cluster { ID, N, Hop } information, wherein, ID is node
Numbering, N is the hop count of Cluster information forwarding, and N initial value is the hop count that 0, Hop is default；Near cluster head
Neighbor node receive N increases by 1 after Cluster information and forward this information again, until N=Hop just no longer forwards Cluster letters
Breath；Again to Cluster information to be transmitted to the neighbor node of oneself after the neighbor node forwarding Cluster information of cluster head, then
Send feedback information Join { ID, N, an Eir, dij, ki, Cluster information is transmitted to the node of oneself, most at last Join
Information is transmitted to cluster head and represents oneself to add the cluster, wherein, EirRepresent the dump energy of the node now, dijRepresent two nodes
Between distance, kiRepresent that the node can monitor the obtained size of packet；If a node have received multiple Cluster
Information, node just select the N values small addition cluster, if the equal nodes of N just at will select a cluster and are added to the cluster；If section
Point does not receive Cluster information, then node sends Help information, adds a cluster nearest from oneself；
Step 4, cluster interior nodes form simple graph model：The position that all nodes are residing in cluster in cluster is obtained by step 3
Put, each node is regarded to a summit of figure, is connected between each two adjacent node with side；
The calculating of weights in step 5, cluster：By the step 3, cluster head obtains the E of member node in clusterir、dijAnd ki, meter
The weights between two adjacent sections point i, j are calculated, the calculation formula of weights is：
Wij=a1(Eir+Ejr)+a2dij+a3(ki+kj)；
Wherein, Ejr、kjThe size for the data that expression node j dump energy and node j can be monitored respectively, and a1+a2
+a3=1, such system can is according to system to Eir、dijOr kiThe different adjustment a of required proportioniValue and be met
The weights that difference needs；
Step 6, cluster interior nodes structure minimum spanning tree：The simple graph that the cluster interior nodes obtained according to the step 4 are formed
The weights that model and the step 5 obtain, cluster interior nodes minimum spanning tree is built according to the definition of Prim minimal spanning tree algorithms；
Data aggregate in step 7, cluster：After the minimum spanning tree construction complete of cluster interior nodes, sensor node starts normally
Work, since minimum one-level sensor node, the data of collection are transmitted to father node, father node by the data oneself collected with
The father node of oneself is transmitted to after the data aggregate that child node transmits again, most aggregated data is transferred to cluster head at last；
The calculating of step 8, cluster head weights：After the completion of step 3 sub-clustering, the position of the whole cluster interior nodes of cluster head acquisition,
Residue energy of node and sensor node may monitor to obtain the size information of data, wherein Ecir=E1r+E2r+…+EirRepresent
The residual energy value of whole cluster, KciRepresent the size of data of cluster head polymerization, DijThe distance between adjacent cluster head is represented, to adjacent two
Weights are calculated between cluster head i, j, and the formula of weights is：
Wij=b1(Ecir+Ecjr)+b2Dij+b3(Kci+Kcj)；
Wherein, EcjrAnd KcjCluster head j residual energy value and the size of data of cluster head j polymerizations, and b are represented respectively1+b2+b3
=1, such system can is according to system to Ecir、DijOr KciIt is required that the different adjustment b of proportioniValue and be met difference
The weights needed；
Step 9, leader cluster node form simple graph model：Each cluster head is regarded to a summit of figure, between adjacent cluster head
It is connected with side, the weights of each edge are calculated by the formula of step 8；
Step 10, leader cluster node structure minimum spanning tree：The simple graph model that the leader cluster node provided by step 8 is formed
Afterwards, minimum spanning tree is built according to the definition of Prim minimal spanning tree algorithms；
Step 11, cluster head data aggregate：After the minimum spanning tree construction complete of leader cluster node, opened from minimum one-level cluster head
Begin, the data of collection are transmitted to father node, father node will pass again after the data that oneself polymerize and the data aggregate that child node transmits
To the father node of oneself, most aggregated data is transferred to base station at last；
Step 12, balanced node energy consumption：After often carrying out M wheels, cluster head is just reselected, then re-starts step above
Suddenly, wherein, the energy consumption of node can be estimated by LEACH energy consumption models；
The maintenance of step 13, cluster：After cluster interior nodes death, it is possible to the minimum spanning tree path failure in cluster can be caused,
So node will it is dead before, node sends a Die information to cluster head, represents that oneself will be dead, cluster head receives this
After information, cluster head begins to rebuild minimum spanning tree to cluster interior nodes.
Further, the silion cell plate connects accumulator by circuit line；The accumulator, water level monitor, controller,
Water pump is connected by circuit line.
Further, the waterline of the water level monitor monitoring is higher than the waterline of water level alarm monitoring.
Advantages of the present invention and good effect are：The high-efficiency cleaning energy can be provided by being provided with silion cell plate, save the energy,
It is economic and environment-friendly；The water level alarm of setting can be in advance to the too low alarm of water level, and prevent from supplying water influences the duration not in time；The device
Structure is simple, convenient and practical.It is route according to the link-state information between estimation egress and the dump energy information of node
Anticipation, network route is established using broadcast request-response (RREQ-RREP) mode, and replaced in a manner of make-before-break
The link that will be damaged continues to forward data, and such routing stability is improved, and has saved the energy expenditure of node, extend
Network morals.The present invention proposes a kind of Internet of Things route repair side based on link stability and Energy-aware
Method, a kind of route repair mechanism of make-before-break is established, the comprehensive stable performance indications with node energy of route, passes through the cycle
The dump energy and inter-node link status information of detection node, the replacement route of forwarding data is actively established, is effectively controlled
Network overhead, data forwarding rate is improved, extends network life cycle, reduces network delay, improve the stabilization of network
Degree and route retention time.
Brief description of the drawings
Fig. 1 is civil engineering Automatic Water System structural representation provided in an embodiment of the present invention；
In figure：1st, sump；2nd, cabinet；2-1, accumulator；2-2, water level monitor；2-3, controller；2-4, outlet pipe；2-
5th, water pump；2-6, circuit line；3rd, silion cell plate；4th, feed pipe；5th, water level alarm；6th, buried pipe.
Embodiment
In order to further understand the content, features and effects of the present invention, hereby enumerating following examples, and coordinate accompanying drawing
Describe in detail as follows.
The structure of the present invention is explained in detail below in conjunction with the accompanying drawings.
As shown in figure 1, civil engineering Automatic Water System provided in an embodiment of the present invention includes：Sump 1, cabinet 2, silicon electricity
Pond plate 3, feed pipe 4, water level alarm 5 and buried pipe 6.
The top of sump 1 is equipped with silion cell plate 3；The right-hand member of sump 1 is provided with feed pipe 4；The right-hand member bottom of sump 1 is embedded with water
Level alarm 5；The bottom of sump 1 is provided with buried pipe 6；Cabinet 2 is bolted inside sump 1.
Cabinet 2 passes on left bolt and fixes accumulator 2-1；The top of cabinet 2 is embedded with water level monitor 2-2；The right of cabinet 2
It is provided with controller 2-3；The lower section of cabinet 2 is bolted water pump 2-5；Water pump 2-5 right-hand members linking outlet pipe 2-4；Water pump 2-5
Bottom is connected buried pipe 6.
Silion cell plate 3 passes through circuit line 2-6 connection accumulators 2-1；Accumulator 2-1, water level monitor 2-2, controller 2-
3, water pump 2-5 is connected by circuit line 2-6；The waterline of water level monitor 2-2 monitorings is higher than the water level that water level alarm 5 monitors
Line.
The implementation method of the controller Timing Synchronization includes：
Step 1, according to formulaTraining sequence and the cyclic shift result of itself are pressed
Sign bit carries out conjugation related operation, obtains correlation function M (m), and wherein c (k) is mapped out to local sequence by sign bit
Complex result, c ((k+m))NIn k=1,2 ... represent to carry out c (k) result of cyclic shift during N；Search out correlation function
Main peak value and corresponding frequency domain sequence under submaximum value ratio maximum case, it is then determined that training sequence corresponding to the frequency domain sequence；
FormulaRepresent that training sequence carries out conjugation phase with the cyclic shift result of itself by sign bit
Computing is closed, wherein c (k) is the complex result mapped out to local sequence C (k) by sign bit, and mapping equation is c (k)=sign
(Re(C(k)))+j*sign(Im(C(k)))；c((k))NExpression carries out the result of periodic extension to c (k) using N as the cycle, thus
c((k+m))NIn k=1,2 ... represent to carry out c (k) result of cyclic shift during N, m ＞ 0 represent ring shift left m positions, m ＜ 0
Represent ring shift right | m | position, understand that correlation function value occurs one when cyclic sequence circulation moves 0 according to the structure of sequence
Individual bigger main peak, peak value are M (0), and if during to training sequence or so cyclic shift NFFT, correlation function value can all occur
Less submaximum, two peak values are respectively M (NFFT), M (- NFFT)；The purpose of search frequency-domain data sequence is training sequence is moved 0
During position it is with the biggest gap to move the submaximum value that NFFT positions occur for the main peak value that occurs and circulation left and right, ensures to receive data and instruction with this
It is as big as possible to practice the gap of timing slip estimation function main peak value and submaximum value that sequence is obtained by sign bit related operation, increase
The span of dynamic threshold, because two submaximum value sizes of correlation function are essentially identical, take its main peak value M (0) and wherein one
The ratio of individual submaximum value M (NFFT) is as criterion；
Step 2, by reception signal data R (x), according to formula r (x)=sign (Re (R (x)))+j*sign (Im (R (x)))
The result r (x) mapped out to reception signal reality imaginary part by sign bit is obtained, then by local training sequence data C (k), utilizes formula c
(k)=sign (Re (C (k)))+j*sign (Im (C (k))) obtains the knot mapped out to training sequence data reality imaginary part by sign bit
Fruit c (k), formula is utilized according to obtained r (x) and c (k)
Timing slip estimation function is generated, N=2* (NFFT+CP) represents the length of associated window and local sequence in formula, and x, which is represented, slides phase
Close the original position of window；
Step 3, the timing slip estimation function F (x) obtained by step 2, according to formula
Dynamic threshold is obtained, wherein G (m) represents the value of m moment dynamic thresholds,Represent the M started counting up from the m moment
The average value of individual timing slip estimation function value, mul represent a constant；
The controller is connected with water level monitor, water level alarm by Internet of Things；
The link stability and energy hybrid model of the Internet of Things method for repairing route：
Internet of Things topological structure regards the network model G=(V, E) of a non-directed graph as, and wherein V represents a group node, E tables
Show the side collection of one group of connecting node, P (u, v)={ P0,P1,P2,L,PnBe all possible paths between node u and node v collection
Close, PiIt is node u and v possible path, selects egress u to node v optimal path,
The formula of link stability and residue energy of node is as follows：
Wherein, EisAnd Ei0For the dump energy and gross energy of node i, EthFor the energy threshold of node；
Link stability formula and residue energy of node formula change into the optimization formula of a totality, and the formula provides two
Individual important parameter (w1And w2), shown in its expression formula such as formula (4)：
Wherein w1And w2The coefficient of setting between node energy and link stationary value, w1+w2=1；
The maximum of the target summation is taken, is represented with formula below (5)：
MRFact(Pi)=max { RFact (P1),RFact(P2),L RFact(Pn)} (5)
Node when receiving data packet information, according to formula (1) and formula (2) calculate respectively outgoing link stationary value and
The dump energy of node, optimal path then is chosen using formula (5), to complete the selected of route.
The route anticipation specific method of the Internet of Things method for repairing route includes：
Step 1, first determine whether with the presence or absence of the effective routing for reaching destination node in reception RREQ node, if in the presence of
Establish link；
Step 2, calculate the dump energy and reception RREQ for receiving RREQ nodes respectively according to formula (1) and formula (2)
Link stationary value between node and transmission RREQ nodes；
Step 3, the link for judging the dump energy of receiving node and receiving RREQ nodes and sending between RREQ nodes are stable
Whether value is more than threshold value, if being less than threshold value, abandons the node；
Step 4, if being more than threshold value, record meets the node and routing information of condition in RREQ nodes are sent, and according to
Formula (4) selects optimal node forwarding RREQ bags；
Step 5, step 1 is returned to, continued executing with, is route until establishing；
During the Internet of Things data polymerization, comprise the following steps：
Step 1, deployment wireless senser：In the detection zone that area is S=W × L, wireless senser is deployed in inspection
Survey region；
Step 2, selection cluster head：Whole detection zone is evenly dividing by grid, makes the size shape of each grid
It is identical, the nearest sensor node of positional distance grid element center is selected in each grid as cluster head；
Step 3, sub-clustering：After the completion of cluster head selection, cluster head broadcast Cluster { ID, N, Hop } information, wherein, ID is node
Numbering, N is the hop count of Cluster information forwarding, and N initial value is the hop count that 0, Hop is default；Near cluster head
Neighbor node receive N increases by 1 after Cluster information and forward this information again, until N=Hop just no longer forwards Cluster letters
Breath；Again to Cluster information to be transmitted to the neighbor node of oneself after the neighbor node forwarding Cluster information of cluster head, then
Send feedback information Join { ID, N, an Eir, dij, kiCluster information is transmitted to the node of oneself, most at last Join
Information is transmitted to cluster head and represents oneself to add the cluster, wherein, EirRepresent the dump energy of the node now, dijRepresent two nodes
Between distance, kiRepresent that the node can monitor the obtained size of packet；If a node have received multiple Cluster
Information, node just select the N values small addition cluster, if the equal nodes of N just at will select a cluster and are added to the cluster；If section
Point does not receive Cluster information, then node sends Help information, adds a cluster nearest from oneself；
Step 4, cluster interior nodes form simple graph model：The position that all nodes are residing in cluster in cluster is obtained by step 3
Put, each node is regarded to a summit of figure, is connected between each two adjacent node with side；
The calculating of weights in step 5, cluster：By the step 3, cluster head obtains the E of member node in clusterir、dijAnd ki, meter
The weights between two adjacent sections point i, j are calculated, the calculation formula of weights is：
Wij=a1(Eir+Ejr)+a2dij+a3(ki+kj)；
Wherein, Ejr、kjThe size for the data that expression node j dump energy and node j can be monitored respectively, and a1+a2
+a3=1, such system can is according to system to Eir、dijOr kiThe different adjustment a of required proportioniValue and be met
The weights that difference needs；
Step 6, cluster interior nodes structure minimum spanning tree：The simple graph that the cluster interior nodes obtained according to the step 4 are formed
The weights that model and the step 5 obtain, cluster interior nodes minimum spanning tree is built according to the definition of Prim minimal spanning tree algorithms；
Data aggregate in step 7, cluster：After the minimum spanning tree construction complete of cluster interior nodes, sensor node starts normally
Work, since minimum one-level sensor node, the data of collection are transmitted to father node, father node by the data oneself collected with
The father node of oneself is transmitted to after the data aggregate that child node transmits again, most aggregated data is transferred to cluster head at last；
The calculating of step 8, cluster head weights：After the completion of step 3 sub-clustering, the position of the whole cluster interior nodes of cluster head acquisition,
Residue energy of node and sensor node may monitor to obtain the size information of data, wherein Ecir=E1r+E2r+…+EirRepresent
The residual energy value of whole cluster, KciRepresent the size of data of cluster head polymerization, DijThe distance between adjacent cluster head is represented, to adjacent two
Weights are calculated between cluster head i, j, and the formula of weights is：
Wij=b1(Ecir+Ecjr)+b2Dij+b3(Kci+Kcj)；
Wherein, EcjrAnd KcjCluster head j residual energy value and the size of data of cluster head j polymerizations, and b are represented respectively1+b2+b3
=1, such system can is according to system to Ecir、DijOr KciIt is required that the different adjustment b of proportioniValue and be met difference
The weights needed；
Step 9, leader cluster node form simple graph model：Each cluster head is regarded to a summit of figure, between adjacent cluster head
It is connected with side, the weights of each edge are calculated by the formula of step 8；
Step 10, leader cluster node structure minimum spanning tree：The simple graph model that the leader cluster node provided by step 8 is formed
Afterwards, minimum spanning tree is built according to the definition of Prim minimal spanning tree algorithms；
Step 11, cluster head data aggregate：After the minimum spanning tree construction complete of leader cluster node, opened from minimum one-level cluster head
Begin, the data of collection are transmitted to father node, father node will pass again after the data that oneself polymerize and the data aggregate that child node transmits
To the father node of oneself, most aggregated data is transferred to base station at last；
Step 12, balanced node energy consumption：After often carrying out M wheels, cluster head is just reselected, then re-starts step above
Suddenly, wherein, the energy consumption of node can be estimated by LEACH energy consumption models；
The maintenance of step 13, cluster：After cluster interior nodes death, it is possible to the minimum spanning tree path failure in cluster can be caused,
So node will it is dead before, node sends a Die information to cluster head, represents that oneself will be dead, cluster head receives this
After information, cluster head begins to rebuild minimum spanning tree to cluster interior nodes.
The operation principle of the present invention：
In use, silion cell plate 3 converts solar energy into electrical energy storage into accumulator 2-1；Accumulator 2-1 starts to supply
Electricity, water level monitor 2-2 monitor the water level of sump 1 in real time, start controller 2-3, controller 2-3 if less than setting waterline
Start water pump 2-5 to draw water by outlet pipe 2-4 deposits into sump 1 from underground；If waterline is too low, illustrate event of supplying water
Barrier, water level alarm 5 can send alarm in time, notify that staff properly protects measure.
It is described above to be only the preferred embodiments of the present invention, any formal limitation not is made to the present invention,
Every technical spirit according to the present invention belongs to any simple modification made for any of the above embodiments, equivalent variations and modification
In the range of technical solution of the present invention.
Claims (3)
1. a kind of civil engineering Automatic Water System, it is characterised in that the civil engineering Automatic Water System is provided with：Water
Storehouse, cabinet, silion cell plate, feed pipe, water level alarm and buried pipe；
Silion cell plate is equipped with the top of the sump；The sump right-hand member is provided with feed pipe；The sump right-hand member bottom setting-in
There is water level alarm；The sump bottom is provided with buried pipe；Cabinet is bolted inside the sump；
The cabinet passes on left bolt and fixes accumulator；The enclosure top is embedded with water level monitor；The cabinet right
It is provided with controller；Water pump is bolted below the cabinet；
The implementation method of the controller Timing Synchronization includes：
Step 1, according to formulaTraining sequence and the cyclic shift result of itself are pressed into symbol
Position carries out conjugation related operation, obtains correlation function M (m), wherein c (k) is the plural number mapped out to local sequence by sign bit
As a result, c ((k+m))NIn k=1,2 ... represent to carry out c (k) result of cyclic shift during N；Search out correlation function main peak
Value and corresponding frequency domain sequence under submaximum value ratio maximum case, it is then determined that training sequence corresponding to the frequency domain sequence；FormulaRepresent that training sequence is carried out being conjugated related fortune to the cyclic shift result of itself by sign bit
Calculate, wherein c (k) is the complex result mapped out to local sequence C (k) by sign bit, and mapping equation is c (k)=sign (Re (C
(k)))+j*sign(Im(C(k)))；c((k))NExpression carries out the result of periodic extension to c (k) using N as the cycle, thus c ((k+
m))NIn k=1,2 ... represent to carry out c (k) result of cyclic shift during N, m ＞ 0 represent ring shift left m positions, and m ＜ 0 are represented
Ring shift right | m | position, understand that a ratio occurs in correlation function value when cyclic sequence circulation moves 0 according to the structure of sequence
Larger main peak, peak value are M (0), and if during to training sequence or so cyclic shift NFFT, correlation function value can all occur smaller
Submaximum, two peak values are respectively M (NFFT), M (- NFFT)；Search frequency-domain data sequence purpose be make training sequence move 0 when
That the submaximum value that NFFT positions occur is moved in the main peak value of appearance and circulation left and right is with the biggest gap, ensures to receive data with training sequence with this
The gap of timing slip estimation function main peak value and submaximum value that row are obtained by sign bit related operation is as big as possible, increase dynamic
The span of thresholding, because two submaximum value sizes of correlation function are essentially identical, take its main peak value M (0) and one of pair
Peak value M (NFFT) ratio is as criterion；
Step 2, by reception signal data R (x), obtained according to formula r (x)=sign (Re (R (x)))+j*sign (Im (R (x)))
The result r (x) mapped out to reception signal reality imaginary part by sign bit, then by local training sequence data C (k), utilize formula c (k)
=sign (Re (C (k)))+j*sign (Im (C (k))) obtains the result mapped out to training sequence data reality imaginary part by sign bit
C (k), formula is utilized according to obtained r (x) and c (k)
Timing slip estimation function is generated, N=2* (NFFT+CP) represents the length of associated window and local sequence in formula, and x, which is represented, slides phase
Close the original position of window；
Step 3, the timing slip estimation function F (x) obtained by step 2, according to formula
Dynamic threshold is obtained, wherein G (m) represents the value of m moment dynamic thresholds,Represent the M started counting up from the m moment
The average value of individual timing slip estimation function value, mul represent a constant；
The water pump right-hand member is connected outlet pipe；The water pump bottom is connected buried pipe；
The controller is connected with water level monitor, water level alarm by Internet of Things；
The link stability and energy hybrid model of the Internet of Things method for repairing route：
Internet of Things topological structure regards the network model G=(V, E) of a non-directed graph as, and wherein V represents a group node, and E represents one
The side collection of group connecting node, P (u, v)={ P0,P1,P2,L,PnBe all possible paths between node u and node v set, Pi
It is node u and v possible path, selects egress u to node v optimal path,
The formula of link stability and residue energy of node is as follows：
<mrow>
<msub>
<mi>F</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<munder>
<mo>&Pi;</mo>
<mrow>
<mi>e</mi>
<mo>&Element;</mo>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mi>L</mi>
<mi>S</mi>
<mrow>
<mo>(</mo>
<mi>e</mi>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mi>F</mi>
<mn>2</mn>
</msub>
<mo>=</mo>
<munder>
<mo>&Pi;</mo>
<mrow>
<mi>e</mi>
<mo>&Element;</mo>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mi>C</mi>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<mi>C</mi>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<msub>
<mi>E</mi>
<mrow>
<mi>i</mi>
<mi>s</mi>
</mrow>
</msub>
<msub>
<mi>E</mi>
<mrow>
<mi>i</mi>
<mn>0</mn>
</mrow>
</msub>
</mfrac>
<mo>,</mo>
<msub>
<mi>E</mi>
<mrow>
<mi>i</mi>
<mi>s</mi>
</mrow>
</msub>
<mo>></mo>
<msub>
<mi>E</mi>
<mrow>
<mi>t</mi>
<mi>h</mi>
</mrow>
</msub>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein, EisAnd Ei0For the dump energy and gross energy of node i, EthFor the energy threshold of node；
Link stability formula and residue energy of node formula change into the optimization formula of a totality, and the formula provides two weights
Want parameter (w1And w2), shown in its expression formula such as formula (4)：
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<mi>R</mi>
<mi>F</mi>
<mi>a</mi>
<mi>c</mi>
<mi>t</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>w</mi>
<mn>1</mn>
</msub>
<msub>
<mi>F</mi>
<mn>1</mn>
</msub>
<mo>+</mo>
<msub>
<mi>w</mi>
<mn>2</mn>
</msub>
<msub>
<mi>F</mi>
<mn>2</mn>
</msub>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<msub>
<mi>w</mi>
<mn>1</mn>
</msub>
<munder>
<mo>&Pi;</mo>
<mrow>
<mi>e</mi>
<mo>&Element;</mo>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mi>L</mi>
<mi>S</mi>
<mrow>
<mo>(</mo>
<mi>e</mi>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>w</mi>
<mn>2</mn>
</msub>
<munder>
<mo>&Pi;</mo>
<mrow>
<mi>e</mi>
<mo>&Element;</mo>
<msub>
<mi>P</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mi>C</mi>
<mi>e</mi>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
Wherein w1And w2The coefficient of setting between node energy and link stationary value, w1+w2=1；
The maximum of the target summation is taken, is represented with formula below (5)：
MRFact(Pi)=max { RFact (P1),RFact(P2),L RFact(Pn)} (5)
Node calculates the stationary value and node of outgoing link according to formula (1) and formula (2) respectively when receiving data packet information
Dump energy, then optimal path is chosen using formula (5), to complete the selected of route；
The route anticipation specific method of the Internet of Things method for repairing route includes：
Step 1, first determine whether, with the presence or absence of the effective routing for reaching destination node in reception RREQ node, to establish if existing
Link；
Step 2, calculate the dump energy and reception RREQ nodes for receiving RREQ nodes respectively according to formula (1) and formula (2)
And send the link stationary value between RREQ nodes；
Step 3, the link stationary value for judging the dump energy of receiving node and receiving RREQ nodes and sending between RREQ nodes are
It is no to be more than threshold value, if being less than threshold value, abandon the node；
Step 4, if being more than threshold value, record meets the node and routing information of condition in RREQ nodes are sent, and according to formula
(4) optimal node forwarding RREQ bags are selected；
Step 5, step 1 is returned to, continued executing with, is route until establishing；
During the Internet of Things data polymerization, comprise the following steps：
Step 1, deployment wireless senser：In the detection zone that area is S=W × L, wireless senser is deployed in detection zone
Domain；
Step 2, selection cluster head：Whole detection zone is evenly dividing by grid, makes the size shape of each grid identical,
The nearest sensor node of positional distance grid element center is selected in each grid as cluster head；
Step 3, sub-clustering：After the completion of cluster head selection, cluster head broadcast Cluster { ID, N, Hop } information, wherein, ID is the volume of node
Number, N is the hop count of Cluster information forwarding, and N initial value is the hop count that 0, Hop is default；Neighbour near cluster head
Occupy N increases by 1 after node receives Cluster information and forward this information again, until N=Hop just no longer forwards Cluster information；
Again to Cluster information to be transmitted to the neighbor node of oneself after the neighbor node forwarding Cluster information of cluster head, then send
One feedback information Join { ID, N, Eir, dij, kiTo Cluster information to be transmitted to the node of oneself, most Join information at last
Cluster head is transmitted to represent oneself to add the cluster, wherein, EirRepresent the dump energy of the node now, dijRepresent between two nodes
Distance, kiRepresent that the node can monitor the obtained size of packet；If a node have received multiple Cluster letters
Breath, node just select the N values small addition cluster, if the equal nodes of N just at will select a cluster and are added to the cluster；If node
Cluster information is not received, then node sends Help information, adds a cluster nearest from oneself；
Step 4, cluster interior nodes form simple graph model：All nodes location in cluster in cluster is obtained by step 3, will
Each node regards a summit of figure, is connected between each two adjacent node with side；
The calculating of weights in step 5, cluster：By the step 3, cluster head obtains the E of member node in clusterir、dijAnd ki, calculate phase
Adjacent two node is, the weights between j, the calculation formula of weights are：
Wij=a1(Eir+Ejr)+a2dij+a3(ki+kj)；
Wherein, Ejr、kjThe size for the data that expression node j dump energy and node j can be monitored respectively, and a1+a2+a3
=1, such system can is according to system to Eir、dijOr kiThe different adjustment a of required proportioniValue and be met difference
The weights needed；
Step 6, cluster interior nodes structure minimum spanning tree：The simple graph model that the cluster interior nodes obtained according to the step 4 are formed
The weights obtained with the step 5, cluster interior nodes minimum spanning tree is built according to the definition of Prim minimal spanning tree algorithms；
Data aggregate in step 7, cluster：After the minimum spanning tree construction complete of cluster interior nodes, sensor node starts normal work,
Since minimum one-level sensor node, the data of collection are transmitted to father node, father node saves the data oneself collected and son
The father node of oneself is transmitted to again after the data aggregate that point transmits, and most aggregated data is transferred to cluster head at last；
The calculating of step 8, cluster head weights：After the completion of step 3 sub-clustering, cluster head obtains the position of whole cluster interior nodes, node
Dump energy and sensor node may monitor to obtain the size information of data, wherein Ecir=E1r+E2r+…+EirRepresent whole
The residual energy value of cluster, KciRepresent the size of data of cluster head polymerization, DijThe distance between adjacent cluster head is represented, to adjacent two cluster head
Weights are calculated between i, j, and the formula of weights is：
Wij=b1(Ecir+Ecjr)+b2Dij+b3(Kci+Kcj)；
Wherein, EcjrAnd KcjCluster head j residual energy value and the size of data of cluster head j polymerizations, and b are represented respectively1+b2+b3=1,
So system can according to system to Ecir、DijOr KciIt is required that the different adjustment b of proportioniValue and be met different needs
Weights；
Step 9, leader cluster node form simple graph model：Each cluster head is regarded to a summit of figure, side is used between adjacent cluster head
It is connected, the weights of each edge are calculated by the formula of step 8；
Step 10, leader cluster node structure minimum spanning tree：After the simple graph model that the leader cluster node provided by step 8 is formed, root
Minimum spanning tree is built according to the definition of Prim minimal spanning tree algorithms；
Step 11, cluster head data aggregate：, will since minimum one-level cluster head after the minimum spanning tree construction complete of leader cluster node
The data of collection are transmitted to father node, and father node will be transmitted to oneself again after the data that oneself polymerize and the data aggregate that child node transmits
Father node, most aggregated data is transferred to base station at last；
Step 12, balanced node energy consumption：After often carrying out M wheels, cluster head is just reselected, the step of then re-starting above,
Wherein, the energy consumption of node can be estimated by LEACH energy consumption models；
The maintenance of step 13, cluster：After cluster interior nodes death, it is possible to the minimum spanning tree path failure in cluster can be caused, so
Node will it is dead before, node sends a Die information to cluster head, represents that oneself will be dead, cluster head receives this information
Afterwards, cluster head begins to rebuild minimum spanning tree to cluster interior nodes.
2. civil engineering Automatic Water System as claimed in claim 1, it is characterised in that the silion cell plate passes through circuit line
Connect accumulator；The accumulator, water level monitor, controller, water pump are connected by circuit line.
3. civil engineering Automatic Water System as claimed in claim 1, it is characterised in that the water of the water level monitor monitoring
Bit line is higher than the waterline of water level alarm monitoring.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710752696.7A CN107426791A (en) | 2017-08-28 | 2017-08-28 | A kind of civil engineering Automatic Water System |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710752696.7A CN107426791A (en) | 2017-08-28 | 2017-08-28 | A kind of civil engineering Automatic Water System |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107426791A true CN107426791A (en) | 2017-12-01 |
Family
ID=60434727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710752696.7A Pending CN107426791A (en) | 2017-08-28 | 2017-08-28 | A kind of civil engineering Automatic Water System |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107426791A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108490854A (en) * | 2018-03-19 | 2018-09-04 | 哈尔滨市第医院 | A kind of control system in multi-direction organizational project porous material perfusion |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103414786A (en) * | 2013-08-28 | 2013-11-27 | 电子科技大学 | Data aggregation method based on minimum spanning tree |
| CN103986648A (en) * | 2014-05-06 | 2014-08-13 | 安徽理工大学 | Internet-of-Things route repairing method based on link stability and energy sensing |
| CN104125190A (en) * | 2014-08-18 | 2014-10-29 | 西安电子科技大学 | OFDM (orthogonal frequency division multiplexing) system symbol timing synchronization realizing method suitable for low-signal-to-noise-ratio channel environments |
| CN104267706A (en) * | 2014-10-17 | 2015-01-07 | 成都四为电子信息股份有限公司 | Integrated management system for water affairs |
| CN205000405U (en) * | 2015-09-30 | 2016-01-27 | 中国二十二冶集团有限公司 | Automatic water supply equipment of civil construction |
| CN106498962A (en) * | 2016-11-28 | 2017-03-15 | 中国神华能源股份有限公司 | Shallow underground water collecting and drainage system and construction method |
| KR20170031884A (en) * | 2015-09-14 | 2017-03-22 | 주식회사 엔씽 | Internet of things pot having automatic water supply function |
-
2017
- 2017-08-28 CN CN201710752696.7A patent/CN107426791A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103414786A (en) * | 2013-08-28 | 2013-11-27 | 电子科技大学 | Data aggregation method based on minimum spanning tree |
| CN103986648A (en) * | 2014-05-06 | 2014-08-13 | 安徽理工大学 | Internet-of-Things route repairing method based on link stability and energy sensing |
| CN104125190A (en) * | 2014-08-18 | 2014-10-29 | 西安电子科技大学 | OFDM (orthogonal frequency division multiplexing) system symbol timing synchronization realizing method suitable for low-signal-to-noise-ratio channel environments |
| CN104267706A (en) * | 2014-10-17 | 2015-01-07 | 成都四为电子信息股份有限公司 | Integrated management system for water affairs |
| KR20170031884A (en) * | 2015-09-14 | 2017-03-22 | 주식회사 엔씽 | Internet of things pot having automatic water supply function |
| CN205000405U (en) * | 2015-09-30 | 2016-01-27 | 中国二十二冶集团有限公司 | Automatic water supply equipment of civil construction |
| CN106498962A (en) * | 2016-11-28 | 2017-03-15 | 中国神华能源股份有限公司 | Shallow underground water collecting and drainage system and construction method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108490854A (en) * | 2018-03-19 | 2018-09-04 | 哈尔滨市第医院 | A kind of control system in multi-direction organizational project porous material perfusion |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104093180B (en) | Wireless sensing network route method based on multi-gateway data transmisison | |
| CN102497679B (en) | Static clustering algorithm for wireless sensor network | |
| CN102300281B (en) | Routing method for monitoring bridge state based on wireless sensor network | |
| CN103781148A (en) | Stable clustering routing method based on link perception in vehicle-mounted self-organizing network | |
| CN103826281A (en) | Micropower wireless communication routing algorithm and networking method based on field intensity information | |
| CN109584552A (en) | A kind of public transport arrival time prediction technique based on network vector autoregression model | |
| CN101925100A (en) | Fault-tolerant routing recovery method of heterogeneous wireless sensor network | |
| CN106968715B (en) | Coal mine down-hole fire monitoring based on wireless sensor network | |
| CN104507135A (en) | Underwater sensor network routing method of plurality of mobile convergent nodes | |
| CN102740394B (en) | Center calculation wireless sensor network 2-node disjoint multipath routing algorithm | |
| CN105246120A (en) | Data transmission delay and hop count-constrained Sink node movement path distributed selection method | |
| CN104883676A (en) | Cooperative safety communication method in multi-UAV environment | |
| US20230231796A1 (en) | Method for energy efficient routing in wireless sensor network based on multi-agent deep reinforcement learning | |
| CN106131916A (en) | A kind of wireless network method for routing foundation based on ant group algorithm | |
| CN104185237A (en) | Robustness optimization algorithm based on ant colony algorithm | |
| CN109040999A (en) | Deep foundation pit of construction intelligent monitoring device | |
| CN103945508A (en) | Wireless-sensing-network topology construction method based on probability comparison | |
| CN107426791A (en) | A kind of civil engineering Automatic Water System | |
| CN113411213A (en) | Ad hoc network topology control method and cooperative monitoring method based on Internet of things | |
| Ishihara et al. | Active node selection in flowing wireless sensor networks | |
| CN105188084A (en) | Congestion control based wireless sensor network routing optimization method | |
| CN102413471B (en) | Networking method of wireless grid sensor based on link stability estimation | |
| CN105246123A (en) | Improved CARP routing protocol | |
| CN107172676B (en) | Wireless sensor network routing method based on node redundancy and graph coloring algorithm | |
| CN108881464A (en) | The Excavation Settlement real-time monitoring system of wisdom building site control platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171201 |
|
| RJ01 | Rejection of invention patent application after publication |