CN103248576A - In-site bus type network topology identification method - Google Patents

In-site bus type network topology identification method Download PDF

Info

Publication number
CN103248576A
CN103248576A CN2013101803474A CN201310180347A CN103248576A CN 103248576 A CN103248576 A CN 103248576A CN 2013101803474 A CN2013101803474 A CN 2013101803474A CN 201310180347 A CN201310180347 A CN 201310180347A CN 103248576 A CN103248576 A CN 103248576A
Authority
CN
China
Prior art keywords
sensing point
numbers
ordered series
prime
sensing
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
Application number
CN2013101803474A
Other languages
Chinese (zh)
Other versions
CN103248576B (en
Inventor
贺宏锟
韩朝晨
康新华
冯千倪
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xi'an Duofei Electronic Technology Co ltd
Original Assignee
Northwestern Polytechnical University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Northwestern Polytechnical University filed Critical Northwestern Polytechnical University
Priority to CN201310180347.4A priority Critical patent/CN103248576B/en
Publication of CN103248576A publication Critical patent/CN103248576A/en
Application granted granted Critical
Publication of CN103248576B publication Critical patent/CN103248576B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Small-Scale Networks (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides an in-site bus type network topology identification method. Through the current detection technology, a controller sequentially sends inquiry signals to detection points, the detection points return confirming signals, the detection points of the shortest path of the same link passed by the detection points also return corresponding confirming signals to the controller, the relationship between the detection points and any one detection point is confirmed, and the topology relationship diagram of the whole network can be judged through the relationship between all detection points. The topology relationship among network nodes can be determined, so the installation, the maintenance and the fault elimination on the network system can be more conveniently and fast realized, and the installation and maintenance time as well as relevant cost brought by the installation and the maintenance can be greatly saved. Meanwhile, because of the adoption of the current detection technology, the confirming process of the topology relationship hardly generates influence on the current of the whole loop, the current of the whole detection loop can reach the muA level, and the number of correspondingly connected detection equipment can also be greatly increased.

Description

The recognition methods of a kind of on-site bus type network topology
Technical field
The present invention relates to a kind of topological recognition methods, especially the recognition methods of network bus topology.
Background technology
Bus-network is simple in structure with it, it is convenient to be easy to expand, increase and decrease, sharing is strong, characteristics that higher reliability is arranged have obtained using widely in field bus control systems such as manufacturing industry, traffic, building, electric power.
At present, in the existing fieldbus detection control system, mainly be to send each address lookup frame one by one by controller, this sensing point or control point answer state is separately given controller then, thereby identify each sensing point or control point, but the topological relation between sensing point or the control point can not determine that this exists a lot of not enough in the practical operation application process.In the automatic fire alarm control system as current extensive use, controller just detects and has connected what fire detectors (detecting devices), but each position of detector and mutual topological relation seldom can determine (domesticly do not have this technology, there is company that this is studied abroad, and certain application is arranged.Pass through at resistance of each detector polyphone as German An She Co., Ltd (Caradon Esser GmbH), and then detect the magnitude of voltage of each detector by controller, thereby determine the topological relation between the detector, produce topological relation figure.But the deficiency that the method exists is, (current, the multipotency in each loop connects 256 detecting devicess if the detector that connects is many, loop current is the mA level), even the resistance of Lian Jieing is very little so, to whole loop, particularly the influence of the detector of loop end is very big.And, the method must with the supporting use of the detector that has corresponding identification code, is detected one by one by detector and to identify, so detection speed is slow and the scope of application is single.Install, detector is debugged, in the maintenance, maintenance process owing to can not determine topological relation between the detector, the staff just can only check one by one, debug, and manually register, this has just expended manpower to a certain extent, has increased installation cost.Simultaneously, owing to manually register, also have the problem of registration error, this also is a big hidden danger for fire alarm undoubtedly.In addition, under normal operating conditions at ordinary times, having indivedual detectors unavoidably breaks down, this just requires the staff can in time find, accurately dispose, but owing to can not accurately position related detector, the staff just can only overhaul whole detector loop, and this has not only incured loss through delay troubleshooting time, has also increased maintenance cost.
Summary of the invention
In order to overcome the deficiencies in the prior art, the invention provides a kind of method of on-site bus type network topology identification.
Pass through current detection technology, send request signal by controller one by one to sensing point, this request signal carries and the corresponding address lookup information of sensing point, after receiving the address information that is complementary with it when sensing point, return corresponding confirmation signal to controller, meanwhile, the sensing point that this sensing point returns the same link shortest path of confirmation signal process also returns corresponding confirmation signal to controller, after controller is received the affirmation signal of sensing point, send request signal for the second time, search second sensing point, after second sensing point received request signal, also return a confirmation signal to controller, same, second sensing point returns the sensing point of the same link shortest path of confirmation signal process, also returns corresponding confirmation signal to controller; By that analogy, all sensing points when receiving that request signal returns confirmation signal, its return confirmation signal the sensing point of same link shortest path of process also return corresponding confirmation signal to controller.
The step of the concrete recognition methods of the technical solution adopted for the present invention to solve the technical problems is as follows:
Step 1: determine the n item ordered series of numbers that concerns between n the sensing point, send request signal to each sensing point one by one by controller, each sensing point is according to receiving that the situation of request signal returns confirmation signal; Sensing point returns confirmation signal to controller and is designated as 1, if sensing point does not return confirmation signal and then is designated as 0, uses A iRepresent the n item ordered series of numbers that concerns between i sensing point and all sensing points, A i={ a I1, a I2..., a Ij..., a In(i, j=1,2,3 ..., n), its middle term a IjExpression after each sensing point is received request signal, is returned the situation of confirmation signal when sending the i time request signal, obtain the n item ordered series of numbers that concerns between n the sensing point;
Step 2: determine the every of n item ordered series of numbers and the ordered series of numbers S that forms: and numeration row A iIn every and S iThe n item number of forming is classified S as, S={S 1, S 2..., S i... S n,
Figure BDA00003190306200021
Step 3: every according to rearranging and be designated as S ' by little to big order with among the gained ordered series of numbers S in the step 2 makes S '={ S I ', S 2 '..., S N 'Be the non-decreasing ordered series of numbers, namely S ' satisfies S L '≤ S 2 '...≤S N ';
Step 4: the ordered series of numbers of the every correspondence among the S ' is designated as B I ', i '=1,2,3 ..., n, B I '={ b I ' 1, b I ' 2... b I ' j..., b I ' n, j=1,2,3 ..., n arranges the order of adjusting according to ordered series of numbers S, with ordered series of numbers A iValue give ordered series of numbers B I ', can obtain B simultaneously I 'The ordered series of numbers L that corresponding sensing point position constitutes, L={1 ', 2 ' ..., n ');
Step 5: according to the S ' that obtains in the step 3={ S 1 ', S 2 '..., S N 'Make the following judgment, just can obtain the network topology relation:
If S I '=1, illustrate that then network has i parallel branch, sensing point 1 ', 2 ' ..., i ' is respectively behind the controller first sensing point on i the parallel branch;
If S I '≠ 1, i=2,3 ..., n, note S I 'With S (i-1) 'At ordered series of numbers B I 'With B (i-1) 'Middle corresponding every sum of products is K I (i-1)
K i , ( i - 1 ) = Σ j = 1 n b i ′ j b ( i - 1 ) ′ , j , i = 2,3 , . . . , n
If S I '>S (i-1) '=K I, (i-1), sensing point i ' and sensing point (i-1) ' at same link so, and be sensing point (i-1) ' after first sensing point;
If S I '=S (i-1) '>K I, (i-1), sensing point i ' and sensing point (i-1) ' not need further to judge K at same link so I, (i-2)With S (i-2) 'Relation;
If S (i-2) '=K I, (i-2), so sensing point i ' and sensing point (i-2) ' same link and be sensing point (i-2) ' after first sensing point;
If S (i-2) '>K I, (i-2), sensing point i ' and sensing point (i-2) ' also need further to judge K not at same link so I, (i-3)With S (i-3) 'Relation, till the relation of confirming this sensing point and arbitrary sensing point, when to S I '(i '=1,2,3 ..., n) judgement finishes, and can obtain the topological relation of whole network, and then can obtain the topological relation figure of network.
The invention has the beneficial effects as follows this method can determine between the network node topological relation, produce topological diagram, thereby can make the operation user of service more convenient, quickly network system is installed, is overhauled and fixes a breakdown, the correlative charges that can save installation, repair time widely and bring thus.Simultaneously, owing to can adopt current detection technology, by detecting detector and loop current, definite process of topological relation exerts an influence hardly to the electric current in whole loop, the electric current of whole detection circuit can be accomplished μ A level, and the detecting devices number of corresponding connection also can be greatly improved.
In the present fire alarm control system, each loop maximum can connect 256 detecting devicess, if do not carry out automated topology identification, the workload of then installing, overhauling is well imagined.If but adopted the method to realize that in controller automated topology identifies and draw out corresponding topological relation figure, so in installation, maintenance, maintenance and use, just following advantage has been arranged:
(1) in the installation process, no longer needs each detector is registered, can obtain topology diagram accurately by this method, alleviated installation workload, reduced installation cost;
(2) overhaul or change indivedual detectors, can specifically be accurate to a little, no longer need whole loop is checked, also make Operation and Maintenance become simple more, direct, convenient;
(3) by carrying out relative set with fire-fighting link equipment, in case find fire, can be in time, exactly particular location and the zone of fire are accurately located, and can report to the police the very first time, validity and the reliability of fire detecting and alarm improved.
Description of drawings
A kind of on-site bus type network control system that Fig. 1 is suitable for for the present invention.
Fig. 2 surveys the control network for a kind of on-site bus type fire alarm used in the applicating example of the present invention.
The network topology graph of a relation of the corresponding diagram 2 that Fig. 3 obtains for the present invention.
Fig. 4 is topological identification process block diagram of the present invention.
Embodiment
The present invention is further described below in conjunction with drawings and Examples.
Step 1: determine the n item ordered series of numbers that concerns between n the sensing point, send request signal to each sensing point one by one by controller, each sensing point is according to receiving that the situation of request signal returns confirmation signal; Sensing point returns confirmation signal to controller and is designated as 1, if sensing point does not return confirmation signal and then is designated as 0, uses A iRepresent the n item ordered series of numbers that concerns between i sensing point and all sensing points, A i={ a I1, a I2..., a Ij..., a In(i, j=1,2,3 ..., n), its middle term a IjExpression after each sensing point is received request signal, is returned the situation of confirmation signal when sending the i time request signal, obtain the n item ordered series of numbers that concerns between n the sensing point;
Step 2: determine the every of n item ordered series of numbers and the ordered series of numbers S that forms: and numeration row A iIn every and S iThe n item number of forming is classified S as, S={S 1, S 2..., S i... S n,
Step 3: every according to rearranging and be designated as S ' by little to big order with among the gained ordered series of numbers S in the step 2 makes S '={ S 1 ', S 2 '..., S N 'Be the non-decreasing ordered series of numbers, namely S ' satisfies S 1 '≤ S 2 '...≤S N ';
Step 4: the ordered series of numbers of the every correspondence among the S ' is designated as B I ', i '=1,2,3 ..., n, B I '={ b I ' 1, b I ' 2... b I ' j..., b I ' n, j=1,2,3 ..., n arranges the order of adjusting according to ordered series of numbers S, with ordered series of numbers A iValue give ordered series of numbers B I ', can obtain B simultaneously I 'The ordered series of numbers L that corresponding sensing point position constitutes, L=(1 ', 2 ' ..., n ');
Step 5: according to the S ' that obtains in the step 3={ S 1 ', S 2 '..., S N 'Make the following judgment, just can obtain the network topology relation:
If S I '=1, illustrate that then network has i parallel branch, sensing point 1 ', 2 ' ..., i ' is respectively behind the controller first sensing point on i the parallel branch;
If S I '≠ 1, i=2,3 ..., n, note S I 'With S (i-1) 'At ordered series of numbers B I 'With B (i-1) 'Middle corresponding every sum of products is K I (i-1);
K i , ( i - 1 ) = Σ j = 1 n b i ′ j b ( i - 1 ) ′ , j , i = 2,3 , . . . , n
If S I '>S (i-1) '=K I, (i-1), sensing point i ' and sensing point (i-1) ' at same link so, and be sensing point (i-1) ' after first sensing point;
If S I '=S (i-1) '>K I, (i-1), sensing point i ' and sensing point (i-1) ' not need further to judge K at same link so I, (i-2)With S (i-2) 'Relation;
If S (i-2) '=K I, (i-2), so sensing point i ' and sensing point (i-2) ' same link and be sensing point (i-2) ' after first sensing point;
If S (i-2) '>K I, (i-2), sensing point i ' and sensing point (i-2) ' also need further to judge K not at same link so I, (i-3)With S (i-3) 'Relation, till the relation of confirming this sensing point and arbitrary sensing point, when to S I '(i '=1,2,3 ..., n) judgement finishes, and can obtain the topological relation of whole network, and then can obtain the topological relation figure of network.
Figure 2 shows that fire alarm detection control network, be connected with 12 detectors, as shown in Figure 2, according to the method described above, its embodiment and process are as follows:
Step 1: determine the n item ordered series of numbers that concerns between n the sensing point:
Send request signal by controller one by one to sensing point, and the address that the each transmission of hypothesis request signal carries is identical with its corresponding sequence number.Send request signal the 1st time so, return confirmation signal to controller after the 1st sensing point received request signal, be designated as 1, and it returns without 2 to No. 12 detectors of confirmation signal, so the 2nd to No. 12 detector does not return confirmation signal, is designated as 0, can obtain thus:
Ordered series of numbers A 1={ 1,0,0,0,0,0,0,0,0,0,0,0};
In like manner, controller can obtain by repeatedly sending request signal and return confirmation signal and affirmation signal that the detector of inverse signal shortest path process returns to sensing point:
Ordered series of numbers A 2={ 1,1,0,0,0,0,0,0,0,0,0,0};
Ordered series of numbers A 3={ 1,1,1,0,0,0,0,0,0,0,0,0};
Ordered series of numbers A 4={ 1,1,1,1,0,0,0,0,0,0,0,0};
Ordered series of numbers A 5={ 1,1,1,1,1,0,0,0,0,0,0,0};
Ordered series of numbers A 6={ 1,1,1,1,1,1,0,0,0,0,0,0};
Ordered series of numbers A 7={ 1,1,1,0,0,0,1,0,0,0,0,0};
Ordered series of numbers A 8={ 1,1,1,0,0,0,1,1,0,0,0,0};
Ordered series of numbers A 9={ 1,1,1,0,0,0,1,1,1,0,0,0};
Ordered series of numbers A 10={ 1,1,1,0,0,0,1,1,1,1,0,0};
Ordered series of numbers A 11={ 1,1,1,0,0,0,1,1,0,01,0};
Ordered series of numbers A 12={ 1,1,1,0,0,0,1,1,0,0,1,1}.
Step 2: calculate ordered series of numbers A 1, A 2..., A 12Every and, can get the every and ordered series of numbers S={1 that forms, 2,3,4,5,6,4,5,6,7,6,7};
Step 3: arrange according to ascending order, the item in the ordered series of numbers of every and composition is rearranged, can get non-decreasing ordered series of numbers S '={ 1,2,3,4,4,5,5,6,6,6,7,7};
Step 4: the ordered series of numbers of the every correspondence among the S ' is designated as B I ', arrange situation about adjusting according to ordered series of numbers S, with ordered series of numbers A iValue give ordered series of numbers B I ', can get:
B 1′=A 1;B 2′=A 2;B 3′=A 3;B 4′=A 4;B 5′=A 7;B 6′=A 5;B 7′=A 8;B 8′=A 6;B 9′=A 9;B 10′=A 11;B 11′=A 10;B 12′=A 12
Thereby can get B I 'The ordered series of numbers L={1 that corresponding sensing point position constitutes, 2,3,4,7,5,8,6,9,11,10,12};
Step 5: according to the S ' that obtains in the step 3={ S 1 ', S 2 '..., S N 'Make the following judgment:
Because S 1 '=1, S 2 '≠ 1, so corresponding sensing point 1 is first sensing point behind the controller;
Because S 2 '=2,
Figure BDA00003190306200081
S 2 '>S 1 '=K 2,1So corresponding sensing point 2 is first sensing point behind the sensing point 1;
Because S 3 '=3,
Figure BDA00003190306200082
S 3 '>S 2 '=K 3,2So corresponding sensing point 3 is first sensing point behind the sensing point 2;
Because S 4 '=4,
Figure BDA00003190306200083
S 4 '>S 3 '=K 4,3So corresponding sensing point 4 is first sensing point behind the sensing point 3;
Because S 5 '=3, and K 5,4 = &Sigma; j = 1 12 b 5 &prime; j b 4 &prime; j = 3 < S 4 &prime; , K 5,3 = &Sigma; j = 1 12 b 5 &prime; j b 3 &prime; j = 3 = S 3 &prime; , So corresponding sensing point 7 and sensing point 3 be at same link, and for being listed in sensing point in sensing point 3 another branches of back with sensing point 4;
Because S 6 '=5, and K 6,5 = &Sigma; j = 1 12 b 6 &prime; j b 5 &prime; j = 3 < S 5 &prime; , K 6,4 = &Sigma; j = 1 12 b 6 &prime; j b 4 &prime; j = 4 = S 4 &prime; , So corresponding sensing point 5 and sensing point 4 at same link and with sensing point 7 not at same link, and be a sensing point behind the sensing point 4;
Because S 7 '=5, and K 7,6 = &Sigma; j = 1 12 b 7 &prime; j b 6 &prime; j = 3 < S 6 &prime; , K 7,5 = &Sigma; j = 1 12 b 7 &prime; j b 5 &prime; j = 4 = S 5 &prime; , So corresponding sensing point 8 and sensing point 7 at same link and with sensing point 5 not at same link, and be a sensing point behind the sensing point 7;
Because S 8 '=6, and K 8,7 = &Sigma; j = 1 12 b 8 &prime; j b 7 &prime; j = 3 < S 7 &prime; , K 8,6 = &Sigma; j = 1 12 b 8 &prime; j b 6 &prime; j = 5 = S 6 &prime; , So corresponding sensing point 6 and sensing point 5 at same link and with sensing point 8 not at same link, and be a sensing point behind the sensing point 5;
Because S 9 '=6, and K 9,8 = &Sigma; j = 1 12 b 9 &prime; j b 8 &prime; j = 3 < S 8 &prime; , K 9,7 = &Sigma; j = 1 12 b 9 &prime; j b 7 &prime; j = 5 = S 7 &prime; , So corresponding sensing point 9 and sensing point 8 at same link and with sensing point 6 not at same link, and be a sensing point behind the sensing point 8;
Because S 10 '=6, and K 10,9 = &Sigma; j = 1 12 b 10 &prime; j b 9 &prime; j = 5 < S 9 &prime; , K 10,8 = &Sigma; j = 1 12 b 10 &prime; j b 8 &prime; j = 3 < S 8 &prime; , K 10,7 = &Sigma; j = 1 12 b 10 &prime; j b 7 &prime; j = 5 = S 7 &prime; , So, so corresponding sensing point 11 and sensing point 8 at same link and with sensing point 6 and sensing point 9 not at same link, and for being listed in sensing point in sensing point 8 another branches of back with sensing point 9;
Because S 11 '=7, and K 11,10 = &Sigma; j = 1 12 b 11 &prime; j b 10 &prime; j = 5 < S 10 &prime; , K 11,9 = &Sigma; j = 1 12 b 11 &prime; j b 9 &prime; j = 6 = S 9 &prime; , , So corresponding sensing point 10 and sensing point 9 at same link and with sensing point 11 not at same link, and be a sensing point behind the sensing point 9;
Because S 12 '=7, and K 12,11 = &Sigma; j = 1 12 b 12 &prime; j b 11 &prime; j = 5 < S 11 &prime; , K 12,10 = &Sigma; j = 1 12 b 12 &prime; j b 12 &prime; j b 10 &prime; j = 6 = S 10 &prime; , So s ' 12 Corresponding sensing point 12 and sensing point 11 at same link and with sensing point 10 not at same link, and be a sensing point behind the sensing point 11.
So far, the topological relation between all sensing points is all definite, can get 12 network topology graphs of a relation between the sensing point as shown in Figure 3.

Claims (1)

1. on-site bus type network topology recognition methods is characterized in that comprising the steps:
Step 1: determine the n item ordered series of numbers that concerns between n the sensing point, send request signal to each sensing point one by one by controller, each sensing point is according to receiving that the situation of request signal returns confirmation signal; Sensing point returns confirmation signal to controller and is designated as 1, if sensing point does not return confirmation signal and then is designated as 0, uses A iRepresent the n item ordered series of numbers that concerns between i sensing point and all sensing points, A i={ a I1, a I2..., a Ij..., a In(i, j=1,2,3 ..., n), its middle term a IjExpression after each sensing point is received request signal, is returned the situation of confirmation signal when sending the i time request signal, obtain the n item ordered series of numbers that concerns between n the sensing point;
Step 2: determine the every of n item ordered series of numbers and the ordered series of numbers S that forms: and numeration row A iIn every and S iThe n item number of forming is classified S as, S={S 1, S 2, ..., S i... S n,
Figure FDA00003190306100011
Step 3: every according to rearranging and be designated as S ' by little to big order with among the gained ordered series of numbers S in the step 2 makes S '={ S 1 ', S 2 '..., S N 'Be the non-decreasing ordered series of numbers, namely S ' satisfies S 1 '≤ S 2 '...≤S N ';
Step 4: the ordered series of numbers of the every correspondence among the S ' is designated as B I ', i '=1,2,3 ..., n, B I '={ b I ' 1, b I ' 2... b I ' j..., b I ' n, j=1,2,3 ..., n arranges the order of adjusting according to ordered series of numbers S, with ordered series of numbers A iValue give ordered series of numbers B I ', can obtain B simultaneously I 'The ordered series of numbers L that corresponding sensing point position constitutes, L={1 ', 2 ' ..., n ' };
Step 5: according to the S ' that obtains in the step 3={ S 1 ', S 2 '..., S N 'Make the following judgment, just can obtain the network topology relation:
If S I '=1, illustrate that then network has i parallel branch, sensing point 1 ', 2 ' ..., i ' is respectively behind the controller first sensing point on i the parallel branch;
If S I '≠ 1, i=2,3 ..., n, note S I 'With S (i-1) 'At ordered series of numbers B I 'With B (i-1) 'Middle corresponding every sum of products is K I (i-1);
K i , ( i - 1 ) = &Sigma; j = 1 n b i &prime; j b ( i - 1 ) &prime; , j , i = 2,3 , . . . , n
If S I '>S (i-1) '=K I, (i-1), sensing point i ' and sensing point (i-1) ' at same link so, and be sensing point (i-1) ' after first sensing point;
If S I '=S (i-1) '>K I, (i-1), sensing point i ' and sensing point (i-1) ' not need further to judge K at same link so I, (i-2)With S (i-2) 'Relation;
If S (i-2) '=K I, (i-2), so sensing point i ' and sensing point (i-2) ' same link and be sensing point (i-2) ' after first sensing point;
If S (i-2) '>K I, (i-2), sensing point i ' and sensing point (i-2) ' also need further to judge K not at same link so I, (i-3)With S (i-3) 'Relation, till the relation of confirming this sensing point and arbitrary sensing point, when to S I '(i '=1,2,3 ..., n) judgement finishes, and can obtain the topological relation of whole network, and then can obtain the topological relation figure of network.
CN201310180347.4A 2013-05-15 2013-05-15 A kind of on-site bus type network topology identification method Active CN103248576B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310180347.4A CN103248576B (en) 2013-05-15 2013-05-15 A kind of on-site bus type network topology identification method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310180347.4A CN103248576B (en) 2013-05-15 2013-05-15 A kind of on-site bus type network topology identification method

Publications (2)

Publication Number Publication Date
CN103248576A true CN103248576A (en) 2013-08-14
CN103248576B CN103248576B (en) 2015-12-09

Family

ID=48927804

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310180347.4A Active CN103248576B (en) 2013-05-15 2013-05-15 A kind of on-site bus type network topology identification method

Country Status (1)

Country Link
CN (1) CN103248576B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006065100A1 (en) * 2004-12-17 2006-06-22 Nhn Corporation Communication network system of bus network structure and method using the communication network system
EP2544417A1 (en) * 2010-03-05 2013-01-09 Nec Corporation Communication system, path control apparatus, packet forwarding apparatus and path control method
CN202872815U (en) * 2012-09-24 2013-04-10 长城汽车股份有限公司 Automobile network topology

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006065100A1 (en) * 2004-12-17 2006-06-22 Nhn Corporation Communication network system of bus network structure and method using the communication network system
EP2544417A1 (en) * 2010-03-05 2013-01-09 Nec Corporation Communication system, path control apparatus, packet forwarding apparatus and path control method
CN202872815U (en) * 2012-09-24 2013-04-10 长城汽车股份有限公司 Automobile network topology

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
贺宏锟,史浩山: "UWB多目标异步定位改进方法", 《系统仿真学报》 *
贺宏锟,史浩山: "基于关联矩阵的网络拓扑辨识方法研究", 《西安交通大学学报》 *

Also Published As

Publication number Publication date
CN103248576B (en) 2015-12-09

Similar Documents

Publication Publication Date Title
CN106093702B (en) A kind of ultra-high-tension power transmission line travelling wave ranging method considering multipoint fault
CN100529672C (en) Information inspecting controller based on sensor and its inspection
EP3176699B1 (en) System and method for applying aggregated cable test result data
US9823311B2 (en) System to identify potential electrical network faults combining vibration and power quality analysis
CN102130784A (en) Communication error monitoring system of power device based on Ethernet and method thereof
CN106571689A (en) Online monitoring system for diagnosing substation telemetering fault based on multi-data source comparison technology
CN102694692A (en) Fault detecting method and device of distributed equipment
CN109375064A (en) Fault location system and method based on transient state recording type fault detector
CN102507816B (en) Method for detecting effectiveness of oil chromatogram online monitoring data
CN103869243B (en) Low pressure microcomputer protecting controller operation panel relay intelligent method of calibration
JP6552715B2 (en) Disconnection detection device
CN103095509A (en) Method for quickly testing recommended standard 485 (RS485) bus breakdown
KR101448012B1 (en) Release detection apparatus for bolt and nut using spring washer and conductor
CN104502782A (en) Circuit detecting system for household distribution box
CN103248576A (en) In-site bus type network topology identification method
CN104158606B (en) The concentrator communication module method of testing that a kind of automatic calibration system is special
CN207924051U (en) A kind of line fault point detection device
CN102243491A (en) Intelligent special-gas monitoring system and implementation method thereof
CN102098199A (en) Communication fault detection method
CN104569734B (en) A kind of cable system redundant line method for diagnosing faults
CN103995216A (en) Automatic monitoring method for power system line fault
CN108254720B (en) Article position information detection device and method
CN107426044B (en) Serial line detection method and device and operation and maintenance server
CN105720683A (en) Device for intelligently selecting and inspecting onsite bus of electric power meter
CN105914721B (en) A kind of anti-overstep tripping system and its guard method for more electrical power distribution networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230614

Address after: 710072 Floor 11, Block B, Innovation and Technology Building, Northwestern Polytechnical University, Beilin District, Xi'an, Shaanxi

Patentee after: Xi'an Duofei Electronic Technology Co.,Ltd.

Address before: 710072 No. 127 Youyi West Road, Shaanxi, Xi'an

Patentee before: Northwestern Polytechnical University

CP03 Change of name, title or address

Address after: Room 4009, Building A, 4th Floor, West China University of Technology Innovation Building, No. 127 Youyi West Road, Beilin District, Xi'an City, Shaanxi Province, 710072

Patentee after: Xi'an Duofei Electronic Technology Co.,Ltd.

Country or region after: China

Address before: 710072 Floor 11, Block B, Innovation and Technology Building, Northwestern Polytechnical University, Beilin District, Xi'an, Shaanxi

Patentee before: Xi'an Duofei Electronic Technology Co.,Ltd.

Country or region before: China