CN106453098A - Automatic superimposed data collection algorithm based on network topology - Google Patents
Automatic superimposed data collection algorithm based on network topology Download PDFInfo
- Publication number
- CN106453098A CN106453098A CN201611103261.1A CN201611103261A CN106453098A CN 106453098 A CN106453098 A CN 106453098A CN 201611103261 A CN201611103261 A CN 201611103261A CN 106453098 A CN106453098 A CN 106453098A
- Authority
- CN
- China
- Prior art keywords
- node
- information
- data collection
- data
- level
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an automatic superimposed data collection algorithm based on network topology. The automatic superimposed data collection algorithm comprises the following steps: startup is performed, i=1 is set, wherein i expresses the i<th> level node; a main node refreshes routing topology information; and the main node sends data information of collecting a certain leaf node of the k<th> level. The technical scheme has the advantages that the network topology information is fully used on the basis of the traditional data collection method, when the information of the leaf node is transmitted back, the node information along the way is used as additional information, so that the information of all nodes on the path is collected at the same when the information of one leaf node is collected, compared with the traditional asking and answering communication mode, the communication times are reduced, the communication time is shortened, and the data collection efficiency is improved; and compared with the traversal data collection, the algorithm only needs to perform data collection on the leaf node to achieve the data collection of all nodes in the whole network, therefore the multiplicity of the traversal process is reduced, and fast data collection can be achieved.
Description
Technical field
The present invention relates to data acquisition algorithm, it is based especially on the automatic superposition of data gathering algorithm of network topology.
Background technology
Traditional is that host node actively selects to want the node of gathered data based on the data acquisition algorithm of network topology, adopts
The mode of question-response carries out data acquisition, and during waiting data result to be collected to return, host node is no longer to other
Node carries out data acquisition, and collecting efficiency is relatively low；Traditional algorithm does not make full use of network topology structure and carries out data and adopts simultaneously
Collection, but all nodes are carried out with data acquisition using the mode of traversal, ergodic process repeated and redundant and slow, required time is relatively
Long, acquisition speed is slower.
Content of the invention
It is an object of the invention to provide a kind of gatherer process is simple, fireballing being adopted based on the automatic superposition of data of network topology
Set algorithm, solves one of above-mentioned prior art problem or multiple.
For solving the above problems, the technical scheme is that：Based on the automatic superposition of data gathering algorithm of network topology,
Its innovative point is：Its step is as follows：
S1 starts to start, and makes i=1, i represent i-stage node；
S2 host node refreshes route topological information；
S3 host node sends the data message of collection kth some leaf node of level；
Node receiving data collection information in S4 i-stage respective path, gathers this nodal information, in ageing time,
This data message is effective, otherwise this nodal information of Resurvey；Check routing table, the information that host node is sent is sent to down
One-level corresponding node；Setting flag bit, indicate whether this nodal information uploads as additional information, if uploading, being 1, instead
Then be 0；
S5 data acquisition information is sent to the kth level leaf node of specified collection information by step S4 one-level level；
S6 leaf node receives collection information, collection result is encapsulated in reply data frame, and is sent to upper level father
Node；
After S7 upper level father node receiving data frames, check its flag bit, if flag bit is 0, the collection of this node
Result is attached in Frame, and flag bit is set to 1, if flag bit is 1, the data message of this node need not transmit,
In ageing time, flag bit does not change, and is otherwise automatically changed to 0；
Data after Reseal is passed to upper level corresponding node by S8 father node, until passing to host node；
S9 host node receiving data collection result information；
S10 data acquisition flow terminates.
The advantage of the technical program：The technical program takes full advantage of network on the basis of traditional gathered data method and opens up
Flutter information, take the mode along circuit node information as additional information during leaf node information passback, realize one leaf of collection
Collect the information of all nodes on this path while child node information, compared with traditional question-response formula communication mode, subtract
Lack number of communications, shortened call duration time, improve data acquisition efficiency；Compared with traversal formula data acquisition, this algorithm is only
Leaf node need to be carried out with the data acquisition just achievable data acquisition to nodes all in whole network, decrease ergodic process
Multiplicity, achievable rapid data collection.
Brief description
Fig. 1 is the automatic superposition of data gathering algorithm flow chart based on network topology for the present invention.
Fig. 2 is the instance graph based on the automatic superposition of data gathering algorithm of network topology for the present invention.
Specific embodiment
With reference to Figure of description, the present invention is described in more detail.
Automatic superposition of data gathering algorithm based on network topology as shown in Figure 1, its step is as follows：
Start to start, make i=1, i represent i-stage node；Host node refreshes route topological information；Host node sends collection
The data message of kth some leaf node of level；Node receiving data collection information in i-stage respective path, gathers this section
Point information, in ageing time, this data message is effective, otherwise this nodal information of Resurvey；Check routing table, by host node
The information sending is sent to next stage corresponding node；Set flag bit, indicate this nodal information whether as additional information
Uploading, if uploading, being 1, otherwise be then 0；Data acquisition information is sent to specified collection information by step S4 one-level level
Kth level leaf node；Leaf node receives collection information, collection result is encapsulated in reply data frame, and is sent to
One-level father node；After upper level father node receiving data frames, check its flag bit, if flag bit is 0, the collection of this node
Result is attached in Frame, and flag bit is set to 1, if flag bit is 1, the data message of this node need not transmit,
In ageing time, flag bit does not change, and is otherwise automatically changed to 0；Data after Reseal is passed to upper level by father node
Corresponding node, until pass to host node；Host node receiving data collection result information；Data acquisition flow terminates.
The technical program takes full advantage of network topological information on the basis of traditional gathered data method, takes leaf section
Using the mode along circuit node information as additional information during point information back, realize adopting while one leaf node information of collection
Collect the information of all nodes on this path, compared with traditional question-response formula communication mode, decrease number of communications, shorten
Call duration time, improves data acquisition efficiency；Compared with traversal formula data acquisition, this algorithm only need to carry out data to leaf node
Collection just can achieve the data acquisition to nodes all in whole network, decreases the multiplicity of ergodic process, can achieve quick
Data acquisition.
As shown in Figure 2 wherein, host node a sends data acquisition information to leaf node e, by data flow (1), (2),
(3), (4) one-level one-level is sent to node e, and node b, c, d, when receiving data flow (1), (2), (3), check this nodal information
Whether there is gathered data, if having, judging whether in ageing time, if exceeding ageing time, re-starting collection.Leaf section
Point by data flow (5), (6), (7), (8), collection result is back to host node a, wherein when generation data flow (5), (6),
(7), when (8), node d, c, b check its zone bit information respectively, if flag bit is 1, this nodal information has uploaded, need not
It is transmitted, if flag bit is 0, this nodal information is added in collection result information and is uploaded again.
The above be only the optimal way of the present invention it is noted that to those skilled in the art, not
On the premise of departing from the invention design, some similar deformation and improvement can also be made, these also should be regarded as the present invention
Protection domain within.
Claims (1)
1. the automatic superposition of data gathering algorithm based on network topology it is characterised in that：Its step is as follows：
S1 starts to start, and makes i=1, i represent i-stage node；
S2 host node refreshes route topological information；
S3 host node sends the data message of collection kth some leaf node of level；
Node receiving data collection information in S4 i-stage respective path, gathers this nodal information, in ageing time, this number
It is believed that breath is effectively, otherwise this nodal information of Resurvey；Check routing table, the information that host node is sent is sent to next stage
Corresponding node；Setting flag bit, indicate whether this nodal information uploads as additional information, if uploading, being 1, otherwise then
For 0；
S5 data acquisition information is sent to the kth level leaf node of specified collection information by step S4 one-level level；
S6 leaf node receives collection information, collection result is encapsulated in reply data frame, and is sent to upper level father node；
After S7 upper level father node receiving data frames, check its flag bit, if flag bit is 0, the collection result of this node
It is attached in Frame, and flag bit is set to 1, if flag bit is 1, the data message of this node need not transmit, aging
In time, flag bit does not change, and is otherwise automatically changed to 0；
Data after Reseal is passed to upper level corresponding node by S8 father node, until passing to host node；
S9 host node receiving data collection result information；
S10 data acquisition flow terminates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611103261.1A CN106453098A (en) | 2016-12-05 | 2016-12-05 | Automatic superimposed data collection algorithm based on network topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611103261.1A CN106453098A (en) | 2016-12-05 | 2016-12-05 | Automatic superimposed data collection algorithm based on network topology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106453098A true CN106453098A (en) | 2017-02-22 |
Family
ID=58223827
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611103261.1A Pending CN106453098A (en) | 2016-12-05 | 2016-12-05 | Automatic superimposed data collection algorithm based on network topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106453098A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101605064A (en) * | 2009-07-10 | 2009-12-16 | 西北工业大学 | Network topology building method based on end-to-end measurement |
| CN101883039A (en) * | 2010-05-13 | 2010-11-10 | 北京航空航天大学 | Data transmission network of large-scale clustering system and construction method thereof |
| CN102195683A (en) * | 2011-05-11 | 2011-09-21 | 深圳市金正方科技有限公司 | Power carrier communication method |
| CN103023680A (en) * | 2011-09-23 | 2013-04-03 | 中国科学院声学研究所 | Terminal state collection system and method |
| CN103166750A (en) * | 2011-12-14 | 2013-06-19 | 中兴通讯股份有限公司 | Clock time synchronous resource distribution method and device |
-
2016
- 2016-12-05 CN CN201611103261.1A patent/CN106453098A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101605064A (en) * | 2009-07-10 | 2009-12-16 | 西北工业大学 | Network topology building method based on end-to-end measurement |
| CN101883039A (en) * | 2010-05-13 | 2010-11-10 | 北京航空航天大学 | Data transmission network of large-scale clustering system and construction method thereof |
| CN102195683A (en) * | 2011-05-11 | 2011-09-21 | 深圳市金正方科技有限公司 | Power carrier communication method |
| CN103023680A (en) * | 2011-09-23 | 2013-04-03 | 中国科学院声学研究所 | Terminal state collection system and method |
| CN103166750A (en) * | 2011-12-14 | 2013-06-19 | 中兴通讯股份有限公司 | Clock time synchronous resource distribution method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105871602B (en) | A kind of control method, device and system counting flow | |
| CN103534982B (en) | The protection method of service reliability, equipment and network virtualization system | |
| CN103944828B (en) | The transmission method and equipment of a kind of protocol massages | |
| US20160156504A1 (en) | Controlling forwarding devices in software defined networks | |
| CN105591937B (en) | A kind of acquisition method and equipment of network topological information | |
| CN106911724B (en) | Message processing method and device | |
| CN107277886B (en) | Internet of things equipment ad hoc network method based on WIFI | |
| CN104704779A (en) | Method and apparatus for accelerating forwarding in software-defined networks | |
| CN204795616U (en) | ZIGBEE network access control device | |
| CN103023773A (en) | Method, device and system for forwarding message in multi-topology network | |
| CN105790988B (en) | Method and device for realizing operation maintenance management function | |
| CN106330728B (en) | Method, the equipment of standby Designated Router and Designated Router troubleshooting are waited in election | |
| CN105591892B (en) | A kind of starting method and apparatus of smooth restarting process | |
| CN104869062B (en) | A kind of data packet forwarding method and equipment | |
| CN106453098A (en) | Automatic superimposed data collection algorithm based on network topology | |
| CN102857415B (en) | Routing bridge and device and method for controlling media access control address study | |
| CN116545842A (en) | Communication fault network reconstruction method, system, electronic equipment and storage medium | |
| CN104079485B (en) | It is a kind of to transmit the method and device specified and turn originator information | |
| WO2015170474A1 (en) | Packet transport apparatus, packet transport system and packet transport method | |
| CN114040424B (en) | Sensor network communication system, method and device and storage medium | |
| CN103179285A (en) | Ticket file collecting method and device | |
| CN106559345A (en) | Ranked data gathering algorithm based on network topology | |
| CN104796345B (en) | The sending control method and equipment of a kind of message | |
| CN106034078A (en) | Method and system for reducing DR change of PIM protocol | |
| CN106572073A (en) | Method and system for reducing load by filtering out broadcast messages, and storage device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170222 |