CN108093496A - A kind of uniformity network-building method based on ISA100.11a standards - Google Patents
A kind of uniformity network-building method based on ISA100.11a standards Download PDFInfo
- Publication number
- CN108093496A CN108093496A CN201711411743.8A CN201711411743A CN108093496A CN 108093496 A CN108093496 A CN 108093496A CN 201711411743 A CN201711411743 A CN 201711411743A CN 108093496 A CN108093496 A CN 108093496A
- Authority
- CN
- China
- Prior art keywords
- ring
- point
- network
- node
- spanning tree
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
-
- 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/48—Routing tree calculation
Abstract
A kind of uniformity network-building method based on ISA100.11a standards, including：Ignore the function difference of all wireless devices, collected by system administration manager count entire grid network topology single hop wireless communication quality be used as it is point-to-point in its topology between weight；Assessment weight generates non-interconnected complex network topologies figure；Make the new figure of the non-interconnected complex network topologies figure of backbone router and all wireless devices composition full-mesh；The weight on the side of the slave backbone router of all additions is denoted as 1；Again using backbone router node as root node, its minimum spanning tree is acquired；Take the out-degree of minimum spanning tree root node, K is set to, then the minimum number of the contained tree of non-interconnected complex network topologies figure is equal with K values, and the whole nodes being directly connected with root node are obtained in minimum spanning tree, using these nodes as the node of routing device, uniformity networking is realized.The present invention can realize the connection of entire wireless sensor network with minimum router quantity.
Description
Technical field
The present invention relates to Design of Wireless Sensor Network methods, and in particular to a kind of based on the consistent of ISA100.11a standards
Property network-building method, on the premise of data acquisition and communication is ensured, reduce the quantity of routing device, realize network topology dynamic more
Newly.
Background technology
The most-often used wireless sensor network standards of industrial circle have ISA100.11a, Wireless respectively at present
HART and WIA-PA agreements.In these standards, the road of the field device and responsible wireless forwarding that carry sensor is both defined
By equipment, for this two classes wireless device by appropriate topologic network, composition meets the wireless sensing of certain acquisition covering surface requirement
Device network.
When network is disposed, it is contemplated that routing device generally requires to bear more wireless transmissions times compared to field device
Business, while for the requirement for meeting wireless network low cost, low energy consumption as far as possible on the premise of use demand is ensured, it will usually root
Different network topology structures is attempted according to the environment of industry spot, finally debugs out and is keeping certain industrial field device measuring point
Under the premise of use the minimum scheme of routing device.However, though Each performs its own functions for field device and routing device energy, it is difficult to meet reality
When changeable industrial environment under wireless network dynamic ad hoc network adjustment demand, once because some reasons cause part field to set
For when cannot connect to nearest routing device, the situation of these field device logouts is will result in, so as to be tieed up by network
The wireless device deployment scheme of the shield personnel manual amendment part again.Above-mentioned three kinds of wireless protocol standards also propose the phenomenon
Some increase the modification of flexibilities：ISA100.11a defines the full-function device of compatible field device and routing device, i.e.,
It can freely configure whether wireless device possesses acquisition function or routing function by configuration；Wireless HART then make wirelessly
Field device all has routing function；WIA-PA is then changed into from the special routing device of early stage using routing function as wireless existing
A part for field device.
For compatible both roles of field device and routing device wireless device in three big wireless protocol standards all
Paid attention to, this brings Equipment Foundations to the flexibility for enhancing network dynamic ad hoc network.It is but specific how using wirelessly setting
Standby role transforming realizes that flexible networking does not provide in the protocol, and traditional maximum path algorithm be easy to cause routing and set again
It is standby excessive so that the efficient context number of devices for being able to carry out sensing acquisition task is very few, reduce network whole efficiency and
Information collecting capacity.
The content of the invention
It is an object of the invention to it is middle for the above-mentioned prior art the problem of, provide a kind of based on ISA100.11a standards
Uniformity network-building method, associated wireless devices need to have the energy converted between equipment at the scene and routing device both roles
Power on the premise of data acquisition and communication is ensured, can realize entire wireless sensor network with minimum router quantity
Connection.
To achieve these goals, the technical solution adopted by the present invention comprises the following steps：
Step 1, ignore the function difference of all wireless devices, collected by system administration manager and count entire grid network
The single hop wireless communication quality of topology is as the weight between point-to-point in its topology；
Step 2, assessment weight rejects the link that weighted value is less than communication quality threshold, generates non-interconnected complex network and open up
Flutter figure；
Step 3, make backbone router as root node and be attached with each wireless device node, make backbone router
The new figure of the non-interconnected complex network topologies figure composition full-mesh of all wireless devices generated with step 2；
Step 4, the new figure generated to step 3,1 is denoted as by the weight on the side of the slave backbone router of all additions；
Again using backbone router node as root node, its minimum spanning tree is acquired using Zhu Liu-Edmonds minimal spanning tree algorithms；
Step 5, the minimum spanning tree generated for step 4 takes the out-degree of its root node, is set to K, then step 2 is non-
It is equal with K values to connect the minimum number of the contained tree of complex network topologies figures, obtained in minimum spanning tree directly with root node phase
Whole nodes even, and using these nodes as the node of routing device, realize uniformity networking.
The step 2 counts the two-way packet loss on each channel in assessment weight, and two-way packet loss refers to single-hop and leads to
The transmission packet loss of counterpart device is arrived between two wireless devices on road, in this, as the weight of network topology digraph.
If the weighted value between two wireless devices of some single-hop access only there are one direction is high in the step 2
In threshold value, also judge obstructed between the two equipment, weed out whole links between the two equipment.
The connection for there was only all wireless devices of backbone router direction in the step 3 in new figure is unidirectionally to connect,
Connection between remaining wireless device is all two-phase connection.
The concrete operations of step 4 are：The minimal weight side of all direction any other points in addition to root node is first looked for,
Form a line set；If ring is reconstructed into a new node, and the side right weight to being directed toward new node there are ring in set
It is updated；Repeat ring being converted into the operation on side, until no longer there are rings in line set；Finally, generated in step 3
It is found in new figure and carried out the newer side of weight, and then find the point and its ring of these sides direction, then deleted and refer in these rings
Into the ring of the point, minimum edge then obtains the minimum spanning tree using backbone router node as root node to interrupt ring.
The specific mathematical linguistics of Zhu Liu-Edmonds minimal spanning tree algorithms is described as follows：1. digraph G=(V, E) is set,
Middle V is the point set of digraph, and E is the side collection of digraph；A point τ ∈ V is selected as root node, to each side ej∈ E set it
Weighted value is ωj；T=f (G, τ, W) is made to represent in digraph G using τ as root node, W=∑s ωjFor the spanning tree of value；Wherein, 0
＜ j ＜=M, M are the number of set E；2. for digraph G, all node v in addition to root node τ are traveled throughi∈ { V { τ } },
To each viFetching is to viSide in weighted value minimum edge, and record the source points p on these sidesi, the collection on these sides is combined into P=
{(pi, vi)|vi∈{V\{τ}}；Wherein, 0 ＜=i ＜ N, N is the number of set V；3. if the random subset of P cannot be formed
Ring then obtains minimum spanning tree Tmin=f (P, τ, W), value W, algorithm terminate；4. if contain the son that may be constructed ring in P
Collection then remembers ring for C, and ring C is abstracted as point vc, and C is deleted from P, P ← P C；Again direction is found in the side collection E of artwork
The side e=(u, v) of ring, e meetObtain point v in ring exterior point u and ring；And then it is found in ring C and is directed toward point v
Side e '=(u ', v), e ' meets u ' ∈ C ∧ v ∈ C；Point u is directed toward abstract point vcSide be denoted as ec=(u, vc), and by ecAdd
Add P, i.e. P ← P { ec, ecWeighted value ωc=ω (e)-ω (e ')；If there is multiple summits are as ec, then ω is only selectedcMost
Small person adds in P；5. it computes repeatedly 2 and calculates 4, until the random subset of P cannot form ring；6. investigating the ring C calculated in 4, look for
Side e into PcThe corresponding side e in artwork, then find in ring C with side e=(u, v) be directed toward the side e ' of identical point v=
(u ', v)；Delete side e ' to interrupt ring, by ring C in addition in e ' while add in P；E is finally deleted from Pc, by ecIn original
Corresponding side e adds in P in figure, then obtains minimum spanning tree Tmin=f (P, τ, W), value W, algorithm terminate.
When single-hop connects all field devices during a routing device is difficult to meet and set therewith, it would be desirable to multi-hop connection
The equipment that relaying field device is arranged to compatible routing function allows the letter of some specific neighbour of its data link layer forwarding
Breath.
Compared with prior art, the present invention has following advantageous effect：Since routing device is responsible for substantial amounts of wireless turn
Work is sent out, the quantity of routing device directly influences the communications cost of entire wireless network, when the wireless device quantity in network
One timing, routing device excessively can also tie up the quantity of field device, reduce the data acquisition amount of entire wireless network.The present invention
To arbitrary non-interconnected topological diagram, its conditional connectedness can be searched out, this condition is for ISA100.11a wireless networks
For network, specifically refer to and ensure that minimal number of routing device can be opposite makes network totle drilling cost and power consumption relatively low, in networking
In simultaneously meet data acquisition and communication the needs of, additionally it is possible to reduce dynamic update network topology when cost of labor.
Description of the drawings
Fig. 1 refers to the general networking deployment topologies figure of ISA100.11a standards；
Fig. 2 802.15.4 channel distribution schematic diagrames；
Fig. 3, which is rejected, does not reach the non-interconnected complex network topologies figure that the point-to-point communication of threshold value connects；
The connected graph that Fig. 4 collectively forms backbone router as new node and all wireless general device nodes；
Fig. 5 chooses schematic diagram of the K root node of minimum spanning tree as routing device.
Specific embodiment
The present invention is described in further detail below in conjunction with the accompanying drawings.
First it should be appreciated that network-building method of the present invention is for wireless device, i.e. " wireless sensing in Fig. 1
The scope of net " is all wireless communication in this scope, between all devices.It is different from traditional maximum path algorithm, the present invention
The target of the network-building method is to acquire the routing device of minimum number.This is because routing device is responsible for substantial amounts of wireless forwarding
Work, therefore the quantity of routing device directly influences the communications cost of entire wireless network；Secondly, when wirelessly setting in network
Standby one timing of quantity, routing device excessively can also tie up the quantity of field device, reduce the data acquisition amount of entire wireless network.
The network-building method specifically includes following steps：
Step 1, all wireless devices are regarded as to the general device of ISA100.11a, are specially field device without considering it
Or routing device, that is, ignore its function difference；System administration manager collects the single-hop channel radio for counting entire grid network topology
Believe quality as the weight between point-to-point in its topology.The calculating of weight will be considered such as Fig. 2 institutes using packet loss as standard
The frequency overlapping interference of the 802.15.4 channel distributions and 802.11 channel distributions shown, therefore total weight can be obtained by following formula
Go out；
Wherein, previous item refers in 11,12,13,14,16,17,18,19,21,22,23,24 frequency ranges in 802.15.4
The sum of packet loss, latter refer to the sum of packet loss in 15,20,25 frequency ranges in 802.15.4.
The purpose of this step be provide represent it is point-to-point between wireless communication communication quality definition, commented as subsequent step
Estimate the basis of topology connectivity.For the weight calculation of communication quality, with reference to figure 2,802.15.4 channel distributions and 802.11 are made
Nonoverlapping 15,20 and No. 25 channels of channel distribution are main weight contribution person, and specific contribution rate is provided with reference to sixteen principles.
Note that No. 26 channels of Fig. 2 are defined as alternate channel in ISA100.11a standards, it is general not to use, therefore it is not involved in weight
It calculates.
Step 2, assessment weight, and it is specifically contemplated that the two-way packet loss on each channel, i.e. the two of single-hop access
There should be the transmission packet loss that this equipment arrives counterpart device between wireless device respectively, in this, as the power of network topology digraph
Weight；The link that weighted value is less than communication quality threshold is finally rejected, generates a kind of non-interconnected complex network topologies figure；Pay attention to if
Between two wireless devices of some single-hop access only the weighted value there are one direction higher than threshold value, be also considered as the two equipment it
Between it is obstructed, it is necessary to whole links between weeding out the two equipment.
The purpose of this step is to assess the connectedness of wireless network topology, and is not considered further that based on communication after this step
The topological diagram connection variation of quality, i.e., it must can lead to that the side remained in the topological diagram of this step generation between any two points, which represents it,
's.
Step 3, make backbone router as root node and be attached with each wireless device node, make backbone router
The new figure of the non-interconnected topological diagram composition full-mesh of all wireless devices generated with step 2；Pay attention to being not present from wireless device
The side of backbone router is directed toward, i.e., the unidirectional connection for only having backbone router to be directed toward all wireless devices in the connected graph.
By the operation of step 2, the wireless topology of whole network is it is possible that can become unconnected graph, as shown in Figure 3.This hair
The purpose of the bright uniformity network-building method is that arbitrary non-interconnected topological diagram, can find its conditional connection
Property, i.e., so-called consistency problem, this condition refers specifically to ensure minimal number of road for ISA100.11a wireless networks
By equipment can be opposite make the totle drilling cost of network and power consumption relatively low.Therefore the condition is asked for for convenience, it is necessary to by unconnected graph
Connected graph is converted into, so as to which some connected graph algorithms are introduced, as shown in Figure 4.
The present invention asks for the condition for consistence of wireless topology using Zhu Liu-Edmonds minimal spanning tree algorithms.Considering should
The reason for algorithm is, this linking wireless sense network of backbone router as shown in Figure 1 defined in ISA100.11a standards
With the special joint of gateway, this network structure feature so that non-interconnected topology linking can be complete by the presence of backbone router
The topology of connection, thus the role of backbone router become will ask for minimum routing device problem equivalent be converted to Zhu Liu-
Edmonds algorithms ask for the crucial tie of minimum spanning tree problem.Conversion between both of these problems is in the specific implementation of step 5
It is continued in mode.
In view of the minimum spanning tree of backbone router selected as Zhu Liu-Edmonds algorithms root when, it is necessary to which root will be directed toward
The side right value of node is all deleted, therefore this step does not add the side that wireless device is directed toward backbone router, as shown in Figure 4.
Step 4, the connected graph generated for step 3 remembers the weight on the side of the slave backbone router of all additions
For 1；Again using backbone router node as root node, acquire its minimum using Zhu Liu-Edmonds minimal spanning tree algorithms and generate
Tree.
Specifically, first looking for the minimal weight side of all direction any other points in addition to root node, a side is formed
Set；If ring is reconstructed into a new node, and the side right to being directed toward new node is updated again there are ring in set；
The operation for side by cyclisation is repeated, until no longer there are rings in line set；Finally, step 3 generate former connected graph find into
The newer side of weight of going, and then the point and its ring of these sides direction are found, then delete and be directed toward in the ring of the point in these rings
Minimum edge then obtains the minimum spanning tree using backbone router node as root node so as to interrupt ring.
The purpose that the weight on the side of the slave backbone router of all additions is denoted as 1 is, obtains routeing with backbone
After device is the minimum spanning tree of root node, can directly it be learnt by the out-degree of root node in the unconnected graph of step 2 containing more
Few tree, and then draw and several wireless devices should be arranged to routing device, as shown in Figure 5.
Zhu Liu-Edmonds minimal spanning tree algorithms can be described as follows with mathematical linguistics：
1. setting digraph G=(V, E), wherein V is the point set of digraph, and E is the side collection of digraph；Select a point τ ∈ V
As root node, to each side ej∈ E set its weighted value as ωj；T=f (G, τ, W) is made to represent in digraph G using τ as root node,
W=∑s ωjFor the spanning tree of value；Wherein, 0 ＜ j ＜=M, M is the number of set E.
2. for digraph G, all node v in addition to root node τ are traveled throughi∈ { V { τ } }, to each viFetching is to vi
Side in weighted value minimum edge, and record the source points p on these sidesi, the collection on these sides is combined into P={ (pi, vi)|vi∈{V\
{τ}}；Wherein, 0 ＜=i ＜ N, N is the number of set V.
3. obtain minimum spanning tree T if the random subset of P cannot form ringmin=f (P, τ, W), value W, algorithm knot
Beam.
4. if ring is remembered for C, and ring C is abstracted as point v containing the subset that may be constructed ring in Pc, and deleted from P
C, i.e. P ← P C；Again artwork found in collection E be directed toward ring while e=(u, v), i.e. e satisfactionObtain ring
The exterior point u and interior point v of ring；And then side e '=(u ', the v) for being directed toward point v is found in ring C, i.e. e ' meets u ' ∈ C ∧ v ∈ C；It will point u
It is directed toward abstract point vcSide be denoted as ec=(u, vc), and by ecBe added to P, i.e. P ← P { ec, ecWeighted value ωc=ω (e)-
ω(e′)；If there is multiple summits can be used as ec, then ω is only selectedcReckling adds in P.
5. it computes repeatedly 2 and calculates 4, until the random subset of P cannot form ring.
6. investigating the ring C calculated in 4, the side e in P is foundcThe corresponding side e in artwork, then find in ring C and side
E=(u, v) is directed toward side e '=(u ', the v) of identical point v；Delete side e ' to interrupt ring, by ring C in addition in e ' while add
Enter P；E is finally deleted from Pc, by ecCorresponding side e adds in P in artwork, then obtains minimum spanning tree Tmin=f (P, τ, W),
Its value is W, and algorithm terminates.
From the calculating 2 of foregoing description as can be seen that entire algorithm eliminates the side for being directed toward root node, this has also pointed out step
3 It is not necessary to which the cause on the side of backbone router is directed toward in addition from wireless device.
Step 5, the minimum spanning tree generated for step 4 takes the out-degree of its root node, is set to K, then step 2 is non-
The minimum number of the contained tree of connected graph is equal with K, and the whole nodes being directly connected with root node are obtained in minimum spanning tree, and
Using these nodes as routing device node.
It is equal with K on the minimum number set contained by the unconnected graph of step 2, it is described as follows：
First, if the minimum number of the contained tree of unconnected graph is N, connected graph is generated in a manner of step 3 and is acquired arbitrary
After spanning tree, if root node out-degree is K ', in order to ensure connectedness, there must be K ' ＞=N, otherwise the out-degree of root node cannot be guaranteed
Connect all mutually trees without intersection；
Secondly, the arbitrary spanning tree that step 4 is generated is investigated, if root node out-degree is K*, since spanning tree eventually will
The ring generated in calculating process is reduced to the element in the line set of the unconnected graph of step 2, therefore must have K*＞=K, wherein K are
The root node out-degree of minimum spanning tree；
To sum up, the out-degree K of minimum spanning tree is minimized, i.e. K=N.
Above description first shows the root node out-degree that backbone router meets as the arbitrary spanning tree needs of root node
Condition, then show the root node out-degree minimum of the minimum spanning tree in arbitrary spanning tree, comprehensive to understand, the root section of minimum spanning tree
Point out-degree is minimized the number of the contained tree of i.e. unconnected graph.
In practical applications, the routing device for excessively pursuing minimum number is likely to result in the load of certain several routing device
It is overweight, influence the performance of entire wireless network；It therefore can be on the basis of minimum number routing device be acquired, for contained wireless
The more tree of number of devices increases by one or two of routing device with balancing traffic load as one sees fit.Also this feelings are demonstrated by among Fig. 5
Condition.In addition, in some trees, a routing device is likely difficult to meet all field devices in tree, and single-hop connects therewith, at this time
The equipment that the relaying field device that multi-hop connects can will be needed to be arranged to compatible routing function, i.e. although the equipment is that scene is set
It is standby, but allow the information of some specific neighbour of its data link layer forwarding, can't so bring many additional power consumptions and
Cost.
Claims (7)
1. a kind of uniformity network-building method based on ISA100.11a standards, which is characterized in that comprise the following steps：
Step 1, ignore the function difference of all wireless devices, collected by system administration manager and count entire grid network topology
Single hop wireless communication quality as the weight between point-to-point in its topology；
Step 2, assessment weight rejects the link that weighted value is less than communication quality threshold, generates non-interconnected complex network topologies figure；
Step 3, make backbone router as root node and be attached with each wireless device node, make backbone router and step
The new figure of the non-interconnected complex network topologies figure composition full-mesh of all wireless devices of rapid 2 generation；
Step 4, the new figure generated to step 3,1 is denoted as by the weight on the side of the slave backbone router of all additions；Again with
Backbone router node is root node, its minimum spanning tree is acquired using Zhu Liu-Edmonds minimal spanning tree algorithms；
Step 5, the minimum spanning tree generated for step 4 takes the out-degree of its root node, is set to K, then step 2 is non-interconnected
The minimum number of the contained tree of complex network topologies figure is equal with K values, obtains what is be directly connected with root node in minimum spanning tree
Whole nodes, and using these nodes as the node of routing device, realize uniformity networking.
2. the uniformity network-building method based on ISA100.11a standards according to claim 1, it is characterised in that：The step
Rapid 2 count the two-way packet loss on each channel in assessment weight, and two-way packet loss refers to two wireless devices of single-hop access
Between arrive counterpart device transmission packet loss, in this, as the weight of network topology digraph.
3. the uniformity network-building method based on ISA100.11a standards according to claim 2, it is characterised in that：The step
If only the weighted value there are one direction higher than threshold value, also judges this between two wireless devices of some single-hop access in rapid 2
It is obstructed between two equipment, weed out whole links between the two equipment.
4. the uniformity network-building method based on ISA100.11a standards according to claim 1, it is characterised in that：The step
The connection for there was only all wireless devices of backbone router direction in rapid 3 in new figure is unidirectionally to connect, between remaining wireless device
Connection is two-phase connection.
5. the uniformity network-building method based on ISA100.11a standards according to claim 1, which is characterized in that step 4
Concrete operations are：The minimal weight side of all direction any other points in addition to root node is first looked for, forms a line set；
If ring is reconstructed into a new node, and the side right to being directed toward new node is updated again there are ring in set；Repeat into
It is about to the operation that ring is converted into side, until no longer there are rings in line set；Finally, progress is found in the new figure generated in step 3
The newer side of weight is crossed, and then finds the point and its ring of these sides direction, then deletes and is directed toward in the ring of the point most in these rings
Small side then obtains the minimum spanning tree using backbone router node as root node to interrupt ring.
6. the uniformity network-building method based on ISA100.11a standards according to claim 1, which is characterized in that Zhu Liu-
The specific mathematical linguistics of Edmonds minimal spanning tree algorithms is described as follows：1. setting digraph G=(V, E), wherein V is digraph
Point set, E are the side collection of digraph；A point τ ∈ V is selected as root node, to each side ej∈ E set its weighted value as ωj；Make T
Using τ as root node in=f (G, τ, W) expression digraphs G, W=∑s ωjFor the spanning tree of value；Wherein, 0<j<=M, M are set E
Number；2. for digraph G, all node v in addition to root node τ are traveled throughi∈ { V { τ } }, to each viFetching is to vi's
Weighted value minimum edge in side, and record the source points p on these sidesi, the collection on these sides is combined into P={ (pi,vi)|vi∈{V\{τ}}；
Wherein, 0<=i<N, N are the number of set V；3. if the random subset of P cannot form ring, obtain minimum spanning tree Tmin=
F (P, τ, W), value W, algorithm terminate；4. if ring is remembered for C, and ring C is abstracted containing the subset that may be constructed ring in P
For point vc, and C is deleted from P, P ← P C；Again artwork found in collection E be directed toward ring while e=(u, v), e meetObtain point v in ring exterior point u and ring；And then side e '=(u ', the v) for being directed toward point v is found in ring C, e ' is full
Sufficient u ' ∈ C ∧ v ∈ C；Point u is directed toward abstract point vcSide be denoted as ec=(u, vc), and by ecBe added to P, i.e. P ← P { ec, ec
Weighted value ωc=ω (e)-ω (e ')；If there is multiple summits are as ec, then ω is only selectedcReckling adds in P；5. it computes repeatedly
2 and 4 are calculated, until the random subset of P cannot form ring；6. investigating the ring C calculated in 4, the side e in P is foundcThe phase in artwork
Corresponding side e, then side e '=(u ', the v) that identical point v is directed toward with side e=(u, v) is found in ring C；Side e ' is deleted to interrupt
Ring, by ring C in addition in e ' while add in P；E is finally deleted from Pc, by ecCorresponding side e adds in P in artwork,
Then obtain minimum spanning tree Tmin=f (P, τ, W), value W, algorithm terminate.
7. the uniformity network-building method based on ISA100.11a standards according to claim 1, it is characterised in that：On a road
When being difficult to meet all field devices in tree by equipment single-hop connected therewith, it would be desirable to which the relaying field device of multi-hop connection is set
For the equipment of compatible routing function, its data link layer is allowed to forward the information of some specific neighbour.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711411743.8A CN108093496B (en) | 2017-12-23 | 2017-12-23 | ISA100.11a standard-based consistency networking method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711411743.8A CN108093496B (en) | 2017-12-23 | 2017-12-23 | ISA100.11a standard-based consistency networking method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108093496A true CN108093496A (en) | 2018-05-29 |
| CN108093496B CN108093496B (en) | 2020-03-13 |
Family
ID=62179034
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711411743.8A Active CN108093496B (en) | 2017-12-23 | 2017-12-23 | ISA100.11a standard-based consistency networking method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108093496B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110662272A (en) * | 2019-09-05 | 2020-01-07 | 西安交通大学 | Minimum-number pilot selection method based on swarm unmanned aerial vehicle |
| CN115242656A (en) * | 2022-06-27 | 2022-10-25 | 新华三技术有限公司 | Communication establishing method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100191793A1 (en) * | 2009-01-28 | 2010-07-29 | Microsoft Corporation | Symbolic Computation Using Tree-Structured Mathematical Expressions |
| CN103402234A (en) * | 2013-07-30 | 2013-11-20 | 济南大学 | Data aggregation method of wireless sensor network |
| CN103501270A (en) * | 2013-10-15 | 2014-01-08 | 南通大学 | Rapid node cluster head recommending method |
| CN104022911A (en) * | 2014-06-27 | 2014-09-03 | 哈尔滨工业大学 | Content route managing method of fusion type content distribution network |
| CN104333590A (en) * | 2014-10-31 | 2015-02-04 | 广东工业大学 | Sensing network topological optimization method in manufacturing internet of things |
| CN107483248A (en) * | 2017-08-17 | 2017-12-15 | 广东工业大学 | A kind of constraint minimum spanning tree Topology Control Algorithm based on wireless sensor network |
-
2017
- 2017-12-23 CN CN201711411743.8A patent/CN108093496B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100191793A1 (en) * | 2009-01-28 | 2010-07-29 | Microsoft Corporation | Symbolic Computation Using Tree-Structured Mathematical Expressions |
| CN103402234A (en) * | 2013-07-30 | 2013-11-20 | 济南大学 | Data aggregation method of wireless sensor network |
| CN103501270A (en) * | 2013-10-15 | 2014-01-08 | 南通大学 | Rapid node cluster head recommending method |
| CN104022911A (en) * | 2014-06-27 | 2014-09-03 | 哈尔滨工业大学 | Content route managing method of fusion type content distribution network |
| CN104333590A (en) * | 2014-10-31 | 2015-02-04 | 广东工业大学 | Sensing network topological optimization method in manufacturing internet of things |
| CN107483248A (en) * | 2017-08-17 | 2017-12-15 | 广东工业大学 | A kind of constraint minimum spanning tree Topology Control Algorithm based on wireless sensor network |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110662272A (en) * | 2019-09-05 | 2020-01-07 | 西安交通大学 | Minimum-number pilot selection method based on swarm unmanned aerial vehicle |
| CN115242656A (en) * | 2022-06-27 | 2022-10-25 | 新华三技术有限公司 | Communication establishing method and device |
| CN115242656B (en) * | 2022-06-27 | 2023-07-21 | 新华三技术有限公司 | Communication establishment method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108093496B (en) | 2020-03-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103999510B (en) | Auxiliary Intelligent routing for brief connecting object network | |
| Abdolmaleki et al. | Fuzzy topology discovery protocol for SDN-based wireless sensor networks | |
| CN104518967B (en) | Method for routing, equipment and system | |
| US10904097B2 (en) | Concurrent network reformation for low-power and lossy networks | |
| CN107294852A (en) | A kind of network route method using the scattered short path collection of topology | |
| EP2063586B1 (en) | Method for routing and load balancing in communication networks | |
| CN108134772A (en) | A kind of safety routing method using AODV or DSDV protocol realizations | |
| Misra et al. | A low-overhead fault-tolerant routing algorithm for mobile ad hoc networks: A scheme and its simulation analysis | |
| CN108093496A (en) | A kind of uniformity network-building method based on ISA100.11a standards | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN106101001A (en) | A kind of uncertain multicast transmission method | |
| Guo et al. | Pangu: Towards a software-defined architecture for multi-function wireless sensor networks | |
| CN104994019B (en) | A kind of horizontal direction interface system for SDN controllers | |
| Santos et al. | eXtend collection tree protocol | |
| Sasidharan et al. | A framework for the IPv6 based implementation of a reactive routing protocol in ns-3: Case study using LOADng | |
| KR101913745B1 (en) | Apparatus and method of configuring transmission route utilizing data plane application in software defined network | |
| CN109714261A (en) | A kind of multi-broadcast routing method based on fidelity measurement in quantum communication network | |
| Aneeth et al. | Energy-efficient communication in wireless sensor network for precision farming | |
| Entezami et al. | Deploying parameters of wireless sensor networks in test bed environment | |
| Guerrieri et al. | An evaluation framework for buildings-oriented wireless sensor networks | |
| Vijaya Kumar et al. | Neural networks based efficient multiple multicast routing for mobile networks | |
| Cheng et al. | A fast and efficient multicast algorithm for QoS group communications in heterogeneous network | |
| Wang et al. | Reliable shortest path routing with applications to wireless software-defined networking | |
| Piechowiak et al. | The evaluation of unconstrained multicast routing algorithms in ad-hoc networks | |
| Chen et al. | Information transmission on hybrid networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |