CN102647356B - Carrier concentrator relay route meter reading method of ant colony-like algorithm based on candidate set strategy - Google Patents
Carrier concentrator relay route meter reading method of ant colony-like algorithm based on candidate set strategy Download PDFInfo
- Publication number
- CN102647356B CN102647356B CN201210108167.0A CN201210108167A CN102647356B CN 102647356 B CN102647356 B CN 102647356B CN 201210108167 A CN201210108167 A CN 201210108167A CN 102647356 B CN102647356 B CN 102647356B
- Authority
- CN
- China
- Prior art keywords
- node
- ant
- concentrator
- broadcast
- optional
- 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.)
- Expired - Fee Related
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a carrier concentrator relay route meter reading method of an ant colony-like algorithm based on a candidate set strategy. The method comprises the following steps of: partitioning a distribution network into a tree structure to obtain a node ID (Identity) table; switching on a meter reading system for initializing, and timely transmitting broadcast ants through each node, wherein only nodes which satisfy conditions made by the invention can receive; making nodes which receive ant packs update relevant data tables thereof; generating a search ant by using the concentrator, wherein the ant can rapidly move forwards towards a destination node under constraint conditions made in the invention; changing original data of the destination node; returning to the concentrator along an original path; and reading an electric meter according to an obtained route meter by using the concentrator. According to the method, a tree structure node ID table, an electric distance table and a route distance table are introduced on the basis of the ant colony-like algorithm, so that the concentrator for reading meters has high efficiency, high stability, high accuracy and wide application prospect.
Description
Technical field
The present invention relates to power electronics Nonlinear Intelligent control field, specifically a kind of carrier wave concentrator transistroute meter register method of the like-ant colony algorithm based on candidate collection strategy.
Background technology
At present, low-voltage power line is successfully applied in the engineerings such as remote automatic meter reading system, Street lamps control, camera head monitor as the technology (power line communication, PLC) of communication medium transmission data.But power line has the features such as bandwidth is narrow, speed is too low, fading channel is large, communication environment is severe.In remote automatic meter reading system, these characteristics will badly influence the reliability of the Distance geometry communication of Signal transmissions, thus have impact on the systematic functions such as the scope of checking meter and accuracy.So in actual applications, need to improve above-mentioned defect by relaying technique.
It is the key link of remote meter reading that transistroute is checked meter, and this link relates to carrier communication, power electronic technology, theory of algorithm in one, is one of study hotspot technology of remote meter reading.So-called relaying, is when carrier wave concentrator directly can not copy and accept the data of certain user, can carries out data retransmission by certain line module between carrier wave concentrator and this line module or dedicated repeaters.At present, the many employings of transistroute algorithm are as tree traversal and ant group algorithm etc.Although they achieve the long range propagation of power line carrier communication, but their defects are in actual applications apparent: the shortcoming of tree traversal is, on the one hand when line module or dedicated repeaters more time, infinite search is very consuming time, the on the other hand relay route that obtains of the method non-optimal, the reliability of namely checking meter is not high.Tradition ant group algorithm shortcoming be, due to ant group algorithm to adopt repeatedly inundation iteration, if a route will be obtained, a lot of time can be consumed.Therefore, propose a kind of efficient dynamic routing algorithm with having adaptive ability and just seem particularly important.
Summary of the invention
The present invention devises a kind of like-ant colony algorithm candidate collection strategy, relaying constraints, broadcast principles, CSMA, electrical distance and limited life principle combined with ant colony optimization algorithm, based on the carrier wave concentrator transistroute meter register method of this algorithm compared with existing meter register method, make remote automatic meter reading system have higher efficiency and the reliability of Geng Gao, and can various topological structure be adapted to.
The technical scheme realizing the object of the invention is:
The carrier wave concentrator transistroute meter register method of a kind of like-ant colony algorithm based on candidate collection strategy of the present invention, comprises the steps:
(1) logically tree structure is divided into according to power distribution network physical topological structure, namely kilowatt meter reading-out system take concentrator as root node, power line is line, ammeter is child node, again with organization definition description concentrator root node of tree and the Array for structural body of the attribute such as the phase sequence classification of ammeter node in tree, line numbering, ammeter case number (CN), node ID, thus construct unique No. ID of each node, then be built into tree structure node ID table with each node ID number;
(2) after tree structure node ID table has built, kilowatt meter reading-out system is powered on, can carry out initialization to network, initialization comprises the interpolation foundation of tree structure, the routing table (Sub_Routing_Table_i) of system parameter setting and initialization root node, pheromones table and electrical distance table;
(3) after initially completing, each node of tree structure is according to network idle situation, timing can generate and send broadcast ant (broad_ant), i.e. Frame, and only have meet simultaneously do not coexist an ammeter box and with the node near root vertex being direction (to send the node of broadcast ant for starting point) two conditions just by monitoring the Signal reception broadcast ant bag on power line, what the node receiving this broadcast ant bag then dynamically updated this node directly can reach node route list (Sub_Routing_Table_i), pheromones table and electrical distance table;
(4) after broadcast ant sends, concentrator root node is then according to network idle state and line traffic state, timing or event trigger to generate explores ant (search_ant), explore the restriction of quantity by maximum ant number of ant, under electrical distance allows and ensures the condition that route distance is large as far as possible, explore ant to advance fast along the branch direction near destination node place, if explore ant to arrive destination node not yet through 6 routers, this exploration ant life-span is reduced to zero, and is dropped;
(5) if explore ant to arrive destination node, then destination node is by the data such as source address, destination address, relay address in the former data packet frame of change, and these data are returned root node by original route, root node is according to the Frame returned, set up or upgrade root node routing table, pheromones table, electrical distance table, namely completing a route circulation;
(6) under the iterations meeting kilowatt meter reading-out system setting and required precision, system exports routing table of checking meter, and kilowatt meter reading-out system, according to this routing table of checking meter, carries out transistroute to ammeter node and checks meter, and namely completes carrier wave concentrator transistroute and checks meter.
Wherein:
Described tree is the set T of the individual finite data element of n (n >=0).Arbitrary non-NULL tree (n>0) meets 2 conditions: one is have and only have a node being called root (root), and root node does not have predecessor node; Two is as n > l, and the remainder data element except root node is divided into the individual mutually disjoint set T of m (m>0)
1, T
2..., T
m, wherein each set T
i(1≤i≤m) itself is again one tree.Tree T
1, T
2..., T
ibe called the subtree of this root node.
Described phase sequence classification, line numbering, ammeter case number (CN), node ID carry out to the phase sequence taking tree as structure, electric wire branch, ammeter box, each node the representative digit that manual numbering obtains, and the purposes of numbering provides constraint scheme to improve speed of checking meter.Phase sequence classification refers to A, B, C three-phase, can not relaying each other between homophase.And circuit number refers to: (1) 1000 ~ 9000 to represent circuit be one-level branched line, wherein 1 ~ 9 represent 1st ~ 9 articles of branch lines on one-level branched line; (2) X100 ~ X900 is the secondary branch circuit separated from one-level branched line.(X is 1 ~ 9 any number); (3) XX10 ~ XX90 is the three grades of branch circuits separated from secondary branched line, (X is 1 ~ 9 any number); Numbering below by that analogy, should carry out in strict accordance with the wiring actual state of power supply circuits by the demarcation for lines branch.Ammeter case number (CN) and node ID refer to ammeter case number (CN) and the representative digit arrived that sorts of node ID numeral, for distinguishing coexist ammeter box on a phase sequence and branch line and node.By above-mentioned coding rule, we can show that following constraint scheme is as follows: for the node being in same circuit number, then comparison node sequence number, and what node ID was little can make relaying for the node that this line node sequence number is large; And relaying can be made for the node of subordinate's circuit number for the node of the higher level's circuit number be in same branch, otherwise then can not; The node of different branched line numbering can not make relaying.Because usually we think (ammeter box is numbered except 0), node in same table case is equal to the distance of concentrator node, if concentrator node can copy one piece of ammeter node wherein by a link, so concentrator node can copy other ammeter nodes in this block table case equally by identical link, therefore constraint rule regulation of the present invention, do not allow the ammeter node relaying table each other in same table case, to avoid resource and waste of time, thus effectively improve meter reading efficiency.
Described node structure body array is the phase sequence of defined node residing in tree, line numbering, ammeter box numbering and node ID, jointly No. ID that one represents ammeter node is formed by above-mentioned four kinds of numberings, the node ID number of such as A-1210-1-2, the implication of its representative is, (1) phase sequence A: representation node is in A phase line; (2) circuit number 1210: the first bit digital " 1 " represents the 1st article of branch line of one-level branched line, and second-order digit " 2 " represents the 2nd article of branch line of secondary branch circuit, and the 3rd bit digital " 1 " represents the 1st article of branch line of three grades of branched lines.4-digit number " 0 " represents without level Four branched line.(3) ammeter box numbering 1: representing the ammeter box sequence be on this phase line branch road is No. 1.(4) node ID 2: the representation node sequence be on this phase line branch road is No. 2.
Described electrical distance refers to that receiving node is by receiving demodulation data frame signal, calculates its signal to noise ratio, thus represents the electrical distance between transmitting-receiving node position by its signal to noise ratio.
Described route distance refer to any two can the node of direct communication, length legislations is unit distance 1; Need two nodes communicated by 1 router, its length is 2, and by that analogy, and regulation root node is defined as 6 to the maximum length of arbitrary node.
Described data frame format, is made up of frame head, frame length, frame type identifier, source address, destination address, hop count, routed domain, data length, data field, request-reply identifier, School Affairs postamble.Wherein frame head and postamble are for distinguishing the starting and ending of frame; Frame type identifier is data type mark, explores ant and general data for distinguishing; Source address is for sending Frame address of node mark; Destination address is the address designation of receiving data frames; Hop count is the number of times that Frame is forwarded in a network, i.e. the life-span of Frame.Frame is often forwarded once, and this value is subtracted 1.When Frame be forwarded number of times exceed set point time, this Frame is dropped.Routed domain contains relaying sum of series relay address (maximum can be 6) two parts, and relay address is that Frame is forwarded time sequence address, the route namely transmitted; Data length is the byte length of data field, and data field is data payload, and when frame is route maintenance, this partial data is empty.
Described broadcast ant is a kind of for setting up the packet that candidate collection outwards sends with broadcast mode, and the node that it can be satisfied condition receives, and dynamically updates this node and can be directly to and reach node route list, namely establishes candidate collection.The node that can receive this broadcast ant bag will meet the formula (1) of the present invention's proposition simultaneously:
Described exploration ant is the Frame for searching for transistroute obtained based on ant group algorithm.Only have concentrator root node just can generate and explore ant.For exploration ant, each ordinary node according to the difference of No. ID, optional node in this node route list and this node ID number and optional node with this node electrical distance as selection gist, namely to meet formula (2) (3) (4) selection strategy as next node of the present invention's proposition simultaneously:
Described maximum ant number is that each the exploration ant generated due to root node can not ensure can arrive some specified nodes in definite path-length, explores ant probably in exploration destination node process " death ".Therefore, need to specify maximum ant number, it is worth two times of desirable nodes.When exploring ant number and exceed maximum ant number and without active path, abandon current iteration.This point will provide special marking in root node routing table, again to attempt during next time new route searching.
The present invention's advantage is compared with prior art:
(1) make use of the ability that ant group algorithm has stronger robustness and searches better solutions, even if there is respective nodes to damage in system, also only produce less impact to checking meter, the carrier wave concentrator made is checked meter and is had dynamic self-adapting ability and higher reliability;
(2) owing to introducing the parameter such as electrical distance and route distance, improve stability and high efficiency that carrier wave concentrator checks meter;
(3) owing to introducing relaying constraints and broadcast ant thus define candidate collection at each node, enable exploration ant find destination node fast and accurately, the carrier wave concentrator meter register method therefore making the present invention design has fast convergence, Accuracy and high efficiency.
The carrier wave concentrator transistroute meter register method of the ant group algorithm based on candidate collection strategy therefore designed by the present invention has broad application prospects.
Accompanying drawing explanation
Fig. 1 is transistroute meter register method overall construction drawing of the present invention
Fig. 2 is tree structure sketch of the present invention
Fig. 3 is data frame format figure of the present invention
Fig. 4 is transistroute meter register method flow chart of the present invention.
Embodiment
Below by specific embodiment, the present invention will be described in detail by reference to the accompanying drawings.
See Fig. 1, meter register method concrete steps of the present invention are as follows:
(1) first carrier wave concentrator node connects multiple ammeter node by three-phase power line, the power circuit that A phase line is drawn is divided into three grades, 1000 circuits are one-level branched line, 1100 is the 1st article of branch line from secondary branch circuit, by that analogy, B, C phase line also draws secondary and one-level circuit to numbering below respectively simultaneously.Each node, according to coding rule, draws respective No. ID;
(2) now ammeter node (A-1110-1-3) is copied and accepted for concentrator, after tree structure node ID table has built, kilowatt meter reading-out system is powered on, can carry out initialization to network, initialization comprises the interpolation foundation of tree structure, the routing table (Sub_Routing_Table_i) of system parameter setting and initialization root node, pheromones table and electrical distance table;
(3) after initialization completes, each node of tree structure is according to network idle situation, and timing generates and send broadcast ant, only has the node meeting the formula (1) that the present invention proposes just can receive broadcast ant bag, thus form the sub-route table of each node, i.e. candidate collection.The candidate collection of part of nodes is as table 1:
Table 1
(4) after broadcast ant sends, according to network idle state and line traffic state, when ammeter node (A-1110-1-3) generation exploration ant copied and accepted by root node concentrator (0-0000-0-0).Formula (2) (3) (4) that exploration ant proposes using the present invention are as the selection strategy of next node:
According to the selection strategy (putting aside electrical distance) of formula (2) (3) (4) that the present invention proposes, the path copying and accepting (A-1110-1-3) ammeter node is:
(5) after exploration ant arrives destination node, destination node will return root node by original route, and root node starts evaluation scheme according to return data frame, upgrade routing table, pheromones table, electrical distance table, namely complete a route circulation;
(6) meeting under iterations and required precision, system exports routing table of checking meter, and kilowatt meter reading-out system carries out transistroute according to this routing table of checking meter to ammeter node (A-1110-1-3) and checks meter, and namely completes and copies and accepts the data of this ammeter high efficient and reliable.
See Fig. 2, power distribution network logically can be divided into tree structure, and diagram is the conceptual abstraction figure of tree structure.Arbitrary non-NULL tree meets 2 conditions: one is have and only have a node being called root (root), and root node does not have predecessor node; Two is as n > l, and the remainder data element except root node is divided into the individual mutually disjoint set T of m (m>0)
1, T
2..., T
m, wherein each set T
i(1≤i≤m) itself is again one tree.As T
1={5,6,7,8}, T
2={9,10,11,12,13}..., T
ibe called the subtree of this root node.
Fig. 3 is data frame format of the present invention, and it is made up of frame head, frame length, frame type identifier, source address, destination address, hop count, routed domain, data length, data field, request-reply identifier, School Affairs postamble.
Fig. 4 is transistroute meter register method flow chart of the present invention:
Step S401, program brings into operation;
Step S402, system starts to carry out initialization to network, and initialization comprises: the optimum configurations such as foundation, node ID number formation, cycle-index, pheromones of tree; After initialization,
Step S403, now whether program interrogates adds node, if it is performs step S404;
No. ID, step S404 input node, if otherwise perform step S405;
Step S405, according to network condition, each node sends broadcast ant, and this broadcast ant only has the node meeting formula disclosed by the invention (1) just can receive; When receiving the node of broadcast ant, just perform step S406;
Step S406, each node forms candidate collection, upgrades each tables of data; Broadcast ant performs step S407 after sending and terminating;
Step S407, root node finds the failure of certain node communication, as otherwise perform step S408;
Step S408, termination routine; Then perform step S409 in this way;
Step S409, application decision, transfer next node, transfer number subtracts 1, namely according to the selection strategy of formula (2) (3) (4), carries out route search; Then routine executing step S410;
Step S410, once circulation finishes, otherwise returns execution step S409, then performs step S411 in this way;
Step S411, evaluation scheme; After scheme evaluation is complete, then perform step S412;
Step S412, pheromones volatilization and release pheromone; Perform this step complete after, perform step S413;
Step S413, upgrades routing table; And then step S414 is performed;
Step S414, meets iterations and required precision, if not, then returns and performs step S409, if so, then performs step S415;
Step S415, Output rusults, namely system exports final routing table, and system just efficiently, reliably can copy and accept ammeter according to this routing table; When after Output rusults, program finally performs step S408, termination routine.
More than show and describe general principle of the present invention, principal character and advantage of the present invention; the technical staff of the industry should understand; the present invention is not limited to the restriction of above-mentioned specific embodiment; above-described embodiment and specification merely illustrate principle and the feature of invention; under the prerequisite not departing from essence spirit of the present invention and scope; the present invention also has various changes and modifications, and these will fall into protection range, and application claims protection range is defined by appended claims.
Claims (3)
1., based on a carrier wave concentrator transistroute meter register method for the like-ant colony algorithm of candidate collection strategy, it is characterized in that: comprise the steps:
(1) logically tree structure is divided into according to power distribution network physical topological structure, namely kilowatt meter reading-out system take concentrator as root node, power line is line, ammeter is child node, again with tree organization definition description concentrator root node and the phase sequence classification of ammeter node in tree, line numbering, ammeter case number (CN), node ID attribute Array for structural body, thus construct unique No. ID of each node, then be built into tree structure node ID table with each node ID number;
(2) after tree structure node ID table has built, kilowatt meter reading-out system is powered on, can carry out initialization to network, initialization comprises the interpolation foundation of tree structure, the routing table (Sub_Routing_Table_i) of system parameter setting and initialization root node, pheromones table and electrical distance table;
(3) after initialization completes, each node of tree structure is according to network idle situation, timing can generate and send broadcast ant (broad_ant), i.e. Frame, and only have meet simultaneously do not coexist an ammeter box and with the node that is two conditions in direction near root vertex just by monitoring the Signal reception broadcast ant bag on power line, what the node receiving this broadcast ant bag then dynamically updated this node directly can reach node route list (Sub_Routing_Table_i), pheromones table and electrical distance table;
(4) after broadcast ant sends, concentrator root node is then according to network idle state and line traffic state, timing or event trigger to generate explores ant (search_ant), explore the restriction of quantity by maximum ant number of ant, under electrical distance allows and ensures the condition that route distance is large as far as possible, explore ant to advance fast along the branch direction near destination node place, if explore ant to arrive destination node not yet through 6 routers, this exploration ant life-span is reduced to zero, and is dropped;
(5) if explore ant to arrive destination node, then destination node is by source address, destination address, the relay address data in the former data packet frame of change, and these data are returned root node by original route, root node is according to the Frame returned, set up or upgrade root node routing table, pheromones table, electrical distance table, namely completing a route circulation;
(6) under the iterations meeting kilowatt meter reading-out system setting and required precision, system exports routing table of checking meter, and kilowatt meter reading-out system, according to this routing table of checking meter, carries out transistroute to ammeter node and checks meter, and namely completes carrier wave concentrator transistroute and checks meter.
2. meter register method according to claim 1, it is characterized in that: described broadcast ant is a kind of for setting up the packet that candidate collection outwards sends with broadcast mode, the node that it can be satisfied condition receives, and dynamically update this node and can be directly to and reach node route list, namely establish candidate collection, the node that can receive this broadcast ant bag will meet following formula (1) simultaneously:
Wherein:
for sending broadcast ant node (present node)
number phase sequence;
for the node (optional node) of broadcast ant bag can be received
number phase sequence;
for present node
number line numbering nonzero digit;
for optional node
number line numbering nonzero digit, and the position of this nonzero digit is numbered corresponding with present node line, number with
identical;
for present node
number ammeter case number (CN);
for optional node
number ammeter case number (CN);
for present node
number, comprise phase sequence, line numbering, ammeter case number (CN) and node ID; Formula (1-1) ensure that optional node is identical with present node phase sequence, and formula (1-2) ensure that the node of higher level's circuit number can make relaying for the node of subordinate's circuit number, otherwise then can not; Formula (1-3) ensure that ammeter in table case can not relaying each other; Formula (1-4) ensures the node being in same phase sequence collinear road numbering, node ID little can for node ID large make relaying; Formula (1-5) ensures that root node can receive the broadcast ant bag of the arbitrary node transmission except this node.
3. meter register method according to claim 1, it is characterized in that: described exploration ant is the Frame for searching for transistroute obtained based on ant group algorithm, only have concentrator root node just can generate and explore ant, for exploration ant, each ordinary node according to the difference of No. ID, optional node in this node route list and this node ID number and optional node and this node electrical distance as selection gist, namely to meet following formula (2) (3) (4) selection strategy as next node simultaneously;
Wherein:
it is present node in the K time iteration
number;
for optional node
number;
for the purpose of node
number;
for present node is to the pheromones intensity of optional node;
for present node and optional node
number difference mould namely
;
for present node is to the electrical distance value of optional node; The stochastic variable of S selected by the probability distribution that provides according to equation (2-1);
be respectively pheromones Dynamic gene, difference mould Dynamic gene and electrical distance Dynamic gene;
for exploring the set of ant down hop both candidate nodes;
in [0,1] interval equally distributed random number;
the probability metrics threshold value of down hop is selected for exploring ant;
for optional node
number line numbering nonzero digit;
for the purpose of node
number line numbering nonzero digit, and the position of this nonzero digit is numbered corresponding with optional node line, number with
identical; When
time, explore ant under the condition that electrical distance allows and route distance is large as far as possible, the path node selecting pheromones maximum is as next-hop node; Here it is certainty selection strategy;
When
time, according to formula (2-1) Stochastic choice down hop, Here it is randomness selection strategy; The certainty of algorithm makes selection tend to obtain best candidate solution, and randomness then finds new solution by disturbance, prevents from being absorbed in local optimum; Institute with the formula (2) is used for ensureing as far as possible under electrical distance allows, the maximization of route distance; Formula (3) is used for ensureing to select node to move to destination node; Formula (4) is used for ensureing to select in the right direction to destination node of node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210108167.0A CN102647356B (en) | 2012-04-13 | 2012-04-13 | Carrier concentrator relay route meter reading method of ant colony-like algorithm based on candidate set strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210108167.0A CN102647356B (en) | 2012-04-13 | 2012-04-13 | Carrier concentrator relay route meter reading method of ant colony-like algorithm based on candidate set strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102647356A CN102647356A (en) | 2012-08-22 |
| CN102647356B true CN102647356B (en) | 2014-12-31 |
Family
ID=46659940
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210108167.0A Expired - Fee Related CN102647356B (en) | 2012-04-13 | 2012-04-13 | Carrier concentrator relay route meter reading method of ant colony-like algorithm based on candidate set strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102647356B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104579425A (en) * | 2014-12-22 | 2015-04-29 | 云南电网公司电力科学研究院 | Ant colony networking algorithm for power line carrier network |
| CN106297235B (en) * | 2016-08-12 | 2019-06-04 | 中国南方电网有限责任公司电网技术研究中心 | Method for routing foundation and meter register method for low-voltage electricity user centralized automatic meter-reading |
| CN107018545B (en) * | 2017-04-07 | 2019-09-27 | 广西师范大学 | A kind of ad hoc network method applied in wireless communication system |
| CN107770075B (en) * | 2017-09-29 | 2021-01-01 | 南京林洋电力科技有限公司 | High-efficiency meter reading method based on routing table |
| CN108037725B (en) * | 2017-12-08 | 2019-09-03 | 中冶南方工程技术有限公司 | A kind of method and apparatus for reading and writing plc data |
| CN111383432B (en) * | 2018-12-28 | 2023-01-24 | 中兴通讯股份有限公司 | Information receiving method and device, and information reporting method, device and system |
| CN111245719B (en) * | 2020-01-02 | 2021-12-31 | 湖南大学 | Ant colony optimization-based erasure coding storage system data updating method |
| CN112258825B (en) * | 2020-10-30 | 2021-07-23 | 石家庄科林电气股份有限公司 | Meter reading route addressing method based on spiral algorithm |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7157899B2 (en) * | 2004-10-18 | 2007-01-02 | Veris Industries, Llc | Prioritized interrupt for waveform measurement |
| CN101216982A (en) * | 2007-12-29 | 2008-07-09 | 深圳市科陆电子科技股份有限公司 | A 2D relay-type automatic route meter reading method and carrier route dynamic maintenance method |
| CN101466156A (en) * | 2009-01-16 | 2009-06-24 | 西安佳禾资讯发展有限公司 | Remote wireless centralization meter-reading method and system |
| CN102045088A (en) * | 2011-01-26 | 2011-05-04 | 长沙威胜信息技术有限公司 | Low-voltage power line narrowband carrier communication routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8394246B2 (en) * | 2009-02-23 | 2013-03-12 | Roche Diagnostics Operations, Inc. | System and method for the electrochemical measurement of an analyte employing a remote sensor |
-
2012
- 2012-04-13 CN CN201210108167.0A patent/CN102647356B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7157899B2 (en) * | 2004-10-18 | 2007-01-02 | Veris Industries, Llc | Prioritized interrupt for waveform measurement |
| CN101216982A (en) * | 2007-12-29 | 2008-07-09 | 深圳市科陆电子科技股份有限公司 | A 2D relay-type automatic route meter reading method and carrier route dynamic maintenance method |
| CN101466156A (en) * | 2009-01-16 | 2009-06-24 | 西安佳禾资讯发展有限公司 | Remote wireless centralization meter-reading method and system |
| CN102045088A (en) * | 2011-01-26 | 2011-05-04 | 长沙威胜信息技术有限公司 | Low-voltage power line narrowband carrier communication routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102647356A (en) | 2012-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102647356B (en) | Carrier concentrator relay route meter reading method of ant colony-like algorithm based on candidate set strategy | |
| CN102037685B (en) | IP forwarding across a link state protocol controlled Ethernet network | |
| CN102185749B (en) | Method for avoiding routing loop by adopting tree topology relationship | |
| CN102377680B (en) | Route convergence method and device | |
| CN101888334A (en) | Utilize the routing policy expanded that dynamically the redefines structure of route priority value | |
| CN102150148A (en) | Differentiated services for unicast multicast frames in layer 2 topologies | |
| CN102946349B (en) | A kind of Ethernet E-Line service link discover method based on ospf protocol and device | |
| Wu et al. | Domination and its applications in ad hoc wireless networks with unidirectional links | |
| CN102957589A (en) | Method, network node and system for service data transmission | |
| CN103780425A (en) | A method and a controller device for configuring a software-defined network | |
| CN103200643A (en) | Distributed fault-tolerant topology control method based on dump energy sensing | |
| Palta et al. | Comparison of OLSR and TORA routing protocols using OPNET Modeler | |
| CN108632940A (en) | Reliable multi-path routing algorithm suitable for photoelectric sensor Wireless MESH network | |
| CN108347382B (en) | A kind of new generation network implementation method based on data grid technology | |
| Guo et al. | A new solution based on optimal link-state routing for named data MANET | |
| CN103078796A (en) | Routing calculation method and equipment | |
| Jindong et al. | ELHFR: A graph routing in industrial wireless mesh network | |
| CN104202247A (en) | Non-linear annealing based multi-constrained routing method for SDN (Software Defined Network) | |
| CN102752199B (en) | Method and system for constructing data forwarding plane of virtual router | |
| Jain et al. | Energy aware routing for spatio-temporal queries in sensor networks | |
| CN104080088A (en) | Method and device of channel allocation | |
| CN110121185A (en) | A kind of power distribution communication network route optimization method | |
| Huang et al. | UAV routing protocol based on link stability and selectivity of neighbor nodes in ETX metrics | |
| CN104244230B (en) | The cast communication implementation method of next generation wireless network | |
| FI124397B (en) | Method and apparatus for determining search system for a network element of software-defined network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141231 Termination date: 20200413 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |