CN105208622A - High-efficiency dynamic automatic-maintenance routing list structure and routing list management method - Google Patents
High-efficiency dynamic automatic-maintenance routing list structure and routing list management method Download PDFInfo
- Publication number
- CN105208622A CN105208622A CN201510533086.9A CN201510533086A CN105208622A CN 105208622 A CN105208622 A CN 105208622A CN 201510533086 A CN201510533086 A CN 201510533086A CN 105208622 A CN105208622 A CN 105208622A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- via node
- hash table
- chained list
- 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
- 238000012423 maintenance Methods 0.000 title claims abstract description 18
- 238000007726 management method Methods 0.000 title claims abstract description 11
- 238000004891 communication Methods 0.000 claims abstract description 41
- 238000000034 method Methods 0.000 claims description 36
- 238000012913 prioritisation Methods 0.000 claims description 6
- 230000006835 compression Effects 0.000 claims description 3
- 238000007906 compression Methods 0.000 claims description 3
- 230000002068 genetic effect Effects 0.000 claims description 3
- 235000008694 Humulus lupulus Nutrition 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 8
- 239000000203 mixture Substances 0.000 description 4
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000007429 general method Methods 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000008929 regeneration Effects 0.000 description 1
- 238000011069 regeneration method Methods 0.000 description 1
- 238000007493 shaping process Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- G—PHYSICS
- G08—SIGNALLING
- G08C—TRANSMISSION SYSTEMS FOR MEASURED VALUES, CONTROL OR SIMILAR SIGNALS
- G08C19/00—Electric signal transmission systems
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a high-efficiency dynamic automatic-maintenance routing list structure and routing list management method, thereby realizing management of a relay routing list of a carrier-wave or micro power wireless communication device (equipment) of a centralized meter reading system. A data structure of a central node routing list is formed by a hash table and an ordered double linked list; and a hash address of the hash table is obtained by die taking after superposition sub node addresses. Each sub node corresponds to a unique ID according to a position existing in the hash table; each sub node manages a routing linked list; an element in the linked list is a node ID of a first hop of a current node returning to the central node (concentrator); and the linked list carries out sorting according to the number of hops of the node returning to the central node. For relay paths of each sub node, a plurality of effective paths can be obtained according to permutation and combination; no extra storage space consumption is increased; the routing list searching speed is fast; and automatic updating and maintenance can be realized based on operation of the central node.
Description
Technical field
The present invention relates to when to use carrier wave or micro-power wireless communication in automatic meter reading system, the method for managing route table that a kind of high-efficiency dynamic that carrier wave or micro-power wireless communication module use is safeguarded automatically, the specifically router-table structure automatically safeguarded of a kind of high-efficiency dynamic and method for managing route table.
Background technology
Electric power remote automatic meter reading system (being called for short " centralized meter-reading system ") is based on based on computer, the communication technology, electric energy meter is carried out to the Large Information Systems of data acquisition, transmission and process, it is a kind of technological progress of meter reading method, can improve promptness rate of checking meter, reduce manual metering error rate, find multiplexing electric abnormality and alarm, copy and accept platform district summary table simultaneously and can carry out line loss calculation analysis.Centralized meter-reading system is made up of communication network, system main website, concentrator, acquisition terminal four part.Along with the development that science and technology is maked rapid progress, communication has become the important component part of whole system.According to the formation of system, communication channel can be divided into uplink and downlink, and common communication mode has: PSTN cable telephone network, GPRS are wireless, optical fiber communication mode, wireless networking and low voltage electric power carrier communication mode etc.
Along with the expansion of the large transformation of nationwide electrical network, how to solve day by day huge supply network automatic management problem extremely urgent.Utilizing low voltage electric power carrier communication technology to transmit electricity consumption data, realize timely and effective collection and statistics, improve electric power system to power supply quality monitoring capacity and managerial skills, is a preferred plan of generally acknowledging both at home and abroad at present.Low-voltage power line is the most a kind of medium of communication network, and adopt appropriate technology fully to make good use of this ready-made medium, the demand making Low Voltage Power Line Carrier Record System reach practical, the economic benefit produced and production efficiency are apparent.But due to the complexity of low-voltage power web frame and the polytropy of electrical network feature, make PLC technology have certain limitation.In recent years, along with the development of wireless communication technology, adopt wireless networking communications mode, make up the deficiency of PLC technology to a certain extent.In recent years, power line carrier, PLC and micro power radio communication, destroy field at electric power collection, has considerable application.
No matter descending use carrier communication or micro power radio communication mode, be limited to direct point-to-point communication distance, the data acquisition of a distribute-electricity transformer district be completed, usually for the ammeter of radio area end, need by multilevel relay, could gather successfully.Due to the polytropy of power grid environment, only by single routed path, be difficult to make platform district success rate of checking meter to reach 100%, to any one district's node, must can be quick from many routed path path selections flexibly, and routing table is wanted can according to on-the-spot ruuning situation, Dynamic Maintenance upgrades, and the success rate that can make to check meter steps to a new level.So in embedded system, under limited resources supplIes, the routing table realizing Centroid efficiently manages, and seems particularly important.
Summary of the invention
The object of the invention is in central system, when descending use carrier communication or micro-power wireless communication mode, routing table active path is few, seek rate is slow, Dynamic Maintenance upgrades the problems such as difficulty, proposes router-table structure that a kind of high-efficiency dynamic safeguards automatically and method for managing route table.
Technical scheme of the present invention is:
The router-table structure that a kind of high-efficiency dynamic is safeguarded automatically, the data structure of Centroid routing table is made up of hash table and route chained list, described route chained list is orderly doubly linked list, each child node in hash table safeguards a route chained list, this child node is certainly as route linked list head node, each element in route chained list, jumps via node for this child node returns first of Centroid; Each element in described route chained list and via node, its content comprises node ID, hop count and route frequency information, hop count is defined as current node and selects this via node to get back to Centroid, needs the via node number of process, and hop count fewer expression path is shorter; Route frequency information defines the active degree of via node for this reason, route frequency higher expression communication success rate is higher, when center sensor selection problem, one paths communicates, if communicate successfully, then and each node in path, successively its downstream node is added its route chained list as via node, and its route frequency information is increased by 1, meanwhile, Centroid is according to time dimension, the frequency information of the via node of each node is subtracted 1 by timing, and namely route frequency information volatilizees in time; Via node in the route chained list of child node carries out integrated ordered according to its hop count, route frequency information: the via node that prioritization route frequency is high, the via node that the prioritization hop count that route frequency is identical is few, when selecting routed path, by prioritizing selection from the nearest via node of linked list head.
The hash address of hash table obtains according to delivery after child node address superposition, and modulus value M is constant, and the scale according to Centroid support is arranged.
In centralized meter-reading system, child node address is 6 byte-code compression binary-coded decimals, hash table address:
Each child node in hash table, according to the position in hash table, a corresponding unique ID, the sequence number being arranged in hash table by hash array index number+child node is formed.
Centroid is according to time dimension, and the frequency information of the via node of each node is subtracted 1 by timing, and described timing is 12 hours.
The method for managing route table that high-efficiency dynamic is safeguarded automatically, it comprises, and routed path is searched, routed path manages, routed path Dynamic Maintenance three part, wherein:
Routed path search procedure comprises:
S101, searches hash table according to child node address, searches failure and then terminates, and searches and successfully carries out S102;
S102, gets route chained list first via node;
S103, takes out child node ID from node elements, judges whether the child node in corresponding hash table, is, carries out S104, otherwise gets the next via node of route chained list and the S103 that circulates;
S104, child node joins in path selection, judges whether route chained list is empty, is terminate, otherwise returns S102;
Routed path management process comprises:
S201, explores unknown routing iinformation, obtains a communication path;
S202, in the mode of inverted order, from last node, successively the next node of its communication path is joined in its route chained list, and upgrade hop count, increase progressively route frequency information, if this node is Already in route chained list, only upgrade hop count and route frequency information.
Routed path Dynamic Maintenance process comprises:
S301, selected child node to be safeguarded from hash table;
S302, selects i-th via node, initial i=0 from its route chained list;
S303, chooses the i-th+1 via node, and this via node is that sky then terminates, and does not then carry out S304 for sky;
S304, the i-th+1 via node compares priority successively with 0 ~ i via node: route frequency height person priority is high, if route frequency is identical, then the few person's priority of hop count is high; Judge whether the via node finding priority lower than it, find, carry out S305, otherwise return S303;
S305, before the i-th+1 via node being inserted the via node of priority lower than it, and returns S303.
The concrete steps that in routed path search procedure, S101 searches hash table according to child node address are:
S1011 is according to treating that communication child node address calculates hash table address MID;
S1012 gets hash table first child node, judges whether hash table is empty, for sky then terminates; Otherwise carry out matching addresses, the match is successful then terminates, otherwise get the next element circular S1012 of hash table.
In routed path management process S201 obtain a communication path be Centroid idle time, use ant group algorithm or genetic algorithm, explore unknown routing iinformation to obtain communication path.
Beneficial effect of the present invention:
Method of the present invention be not limited to carrier path by or the routing management of micro power radio communication, take into account the prerequisite of embedded system resource-constrained, meet the fast finding of routing table simultaneously, route descriptor is irredundant, a large amount of saving memory space, and can dynamic auto maintenance update, there is very high application and popularization value.
The method for managing route table that the present invention proposes, is searched by routed path, routed path manages (increase, delete), routed path Dynamic Maintenance three part is formed, simple, efficient.This method has taken into full account the automatic recovery (reparation) under any path dependent options situation appears in Centroid, fully presents efficient, highly reliable feature.Simultaneously, the method has deeply abstraction, have nothing to do with concrete communication mode, bandwidth carrier, narrowband carrier or micro power radio communication can be adapted to, it is a kind of more general method for managing route table, go for the different embedded system data communications fields, there is very high practicality and promotional value.
Accompanying drawing explanation
Fig. 1 is router-table structure block diagram.
Fig. 2 is via node structure chart.
Fig. 3 is child node ID structure chart.
Fig. 4 searches hash table flow chart according to child node address.
Fig. 5 is that routed path searches flow chart.
Fig. 6 is that routed path upgrades flow chart.
Fig. 7 is the automatic maintenance process figure of routing table.
Embodiment
Below in conjunction with drawings and Examples, the present invention is further illustrated.
As Figure 1-3, the router-table structure that a kind of high-efficiency dynamic is safeguarded automatically, the data structure of Centroid routing table is made up of hash table and route chained list, described route chained list is orderly doubly linked list, each child node in hash table safeguards a route chained list, this child node is certainly as route linked list head node, and each element in route chained list, jumps via node for this child node returns first of Centroid; Each element in described route chained list and via node, its content comprises node ID, hop count and route frequency information, hop count is defined as current node and selects this via node to get back to Centroid, (jumping figure is 2 to need the via node number of process, represent that current node selects this via node to get back to Centroid, need through 2 via nodes); Route frequency information defines the active degree (being a multidate information) of via node for this reason, one paths communicates when center sensor selection problem, if communicate successfully, each node then in path, adds its route chained list using its downstream node as via node successively, and its route frequency information is increased by 1, simultaneously, Centroid is according to time dimension, and the frequency information of the via node of each node is subtracted 1 by timing, and namely route frequency information volatilizees in time; If a child node fails to communicate with certain via node in its route chained list for a long time, so the route frequency information of this via node will reduce to 0, and in subsequent path is selected, the priority of this via node will rearward; Via node in the route chained list of child node carries out integrated ordered according to its hop count, route frequency information: the via node that prioritization route frequency is high, the via node that the prioritization hop count that route frequency is identical is few, when selecting routed path, by prioritizing selection from the nearest via node of linked list head.
In a preferred embodiment, the hash address of hash table obtains according to delivery after child node address superposition, and modulus value M is constant, and the scale according to Centroid support is arranged.There is the child node of same Hash table address, same hash table will be arranged in.
In centralized meter-reading system, child node address is 6 byte-code compression binary-coded decimals, hash table address:
In a preferred embodiment, each child node in hash table, according to the position in hash table, a corresponding unique ID, the sequence number being arranged in hash table by hash array index number+child node is formed.As 0304, represent the 3rd hash table the 4th sequential bits.
Each child node only manages the via node oneself returning Centroid first and jump, and the redundant information of whole routing table is almost 0, the selection of routed path, according to permutation and combination, will have unlimited multiple possibility, and not take any extra memory space.
The method for managing route table that high-efficiency dynamic is safeguarded automatically, it comprises, and routed path is searched, routed path manages, routed path Dynamic Maintenance three part.
Composition graphs 5, when routed path search procedure is Centroid preparation communication, by according to child node address to be visited, according to hash address operation rule, calculate hash address, and in the hash table of correspondence, search corresponding child node, after finding this child node, select optimum routed path, first via node of the route chained list of this child node is optimum via node, then according to this via node, it is found to be arranged in the child node of hash table, the like, until can get back to Centroid, a routed path is selected complete.Communicate successfully, will again upgrade the doubly linked list information of each node.Comprise:
S101, searches hash table according to child node address, searches failure and then terminates, and searches and successfully carries out S102;
S102, gets route chained list first via node;
S103, takes out child node ID from node elements, judges whether the child node in corresponding hash table, is, carries out S104, otherwise gets the next via node of route chained list and the S103 that circulates;
S104, child node joins in path selection, judges whether route chained list is empty, is terminate, otherwise returns S102.
Composition graphs 4, the concrete steps that in routed path search procedure, S101 searches hash table according to child node address are:
S1011 is according to treating that communication child node address calculates hash table address MID;
S1012 gets hash table first child node, judges whether hash table is empty, for sky then terminates; Otherwise carry out matching addresses, the match is successful then terminates, otherwise get the next element circular S1012 of hash table.
Composition graphs 6, when routed path management process is the Centroid free time, uses ant group algorithm or genetic algorithm, explore unknown routing iinformation, when getting a routed path, adopt the mode of inverted order, from last node, successively by the next node in its routed path, join in its route chained list, and upgrade hop count, increase progressively route frequency information, if this node is Already in chained list, only upgrade hop count and route frequency information.Comprise:
S201, explores unknown routing iinformation, obtains a communication path;
S202, in the mode of inverted order, from last node, successively the next node of its communication path is joined in its route chained list, and upgrade hop count, increase progressively route frequency information, if this node is Already in route chained list, only upgrade hop count and route frequency information.
Composition graphs 7, routed path Dynamic Maintenance process is Centroid timed maintenance routing table, sort according to the hop count of each via node and route frequency information, the maximum route number of plies can be set simultaneously, the maximum number of plies will be exceeded and integrated ordered last node is eliminated, ensure the efficient and high reliability of the irredundant information of whole routing table and routing iinformation, reach the target of the dynamic auto maintenance of routing table.Comprise:
S301, selected child node to be safeguarded from hash table;
S302, selects i-th via node, initial i=0 from its route chained list;
S303, chooses the i-th+1 via node, and this via node is that sky then terminates, and does not then carry out S304 for sky;
S304, the i-th+1 via node compares priority successively with 0 ~ i via node: route frequency height person priority is high, if route frequency is identical, then the few person's priority of hop count is high; Judge whether the via node finding priority lower than it, find, carry out S305, otherwise return S303;
S305, before the i-th+1 via node being inserted the via node of priority lower than it, and returns S303.
Be described below in conjunction with instantiation:
Suppose the maximum support node number 2040 of Centroid, hash array M value 100,100 hash arrays in Centroid, will be set up, in theory, the nodes that each hash table comprises about 20.
Regeneration node data structure in relaying chained list can be designed to one 32 shapings, and high 16 is node ID, and middle 8 is hop count, least-significant byte mark route frequency information.
Routing table process of establishing is as follows:
When supposing Centroid route exploration, search a paths, from Centroid to the node address of endpoint node process successively: 000123000024,000123000025,000123000026,000123000027.
According to the computation rule of hash address, the ID of four nodes respectively:
000123000024ID＝(0x01+0x23+0x24)％100＝7200；
000123000025ID＝(0x01+0x23+0x25)％100＝7300；
000123000026ID＝(0x01+0x23+0x26)％100＝7400；
000123000027ID＝(0x01+0x23+0x27)％100＝7500；
Wherein, 72,73,74,75 is hash array sequence number, and latter two are positioned at the sequence number of hash table for current node.
7500 nodes, the node of its down hop is 7400, and hop count is 3, route frequency information 1, then via node complete information is described as: 74000301, and first via node of 7500 nodes is 74000301, the like, first via node of 7400 is 73000201.
Routed path selection course is as follows:
Based on the above-mentioned routing table set up, supposing that Centroid is current needs with 000123000026 node communication, first, calculate the hash address of this node, obtaining hash address is 74, this node is searched again in this hash table, sequence number is found to be 0, namely 7400, following selection routed path, it is 73000201 that first of 7400 optimums jump path, search 7300 nodes successively again, its optimum via node is 72000101, find 7200 nodes again, 7200 nodes are without follow-up via node, search end, complete routed path is: Centroid->7200->7300->7 400, complete communication.
The automatic maintenance process of routing table is as follows:
Suppose 7500 nodes, have 3 relaying via nodes, be respectively: 74000305,73000201,76000401, by 7400 nodes, get back to Centroid, need to jump through 3, route liveness is 5, Centroid is returned through 7300 nodes, need to jump through 2, route liveness is 1, gets back to Centroid through 7600, to jump through 4, liveness is 1; The node that Centroid prioritizing selection liveness is high, so 7400 nodes will arrange limit priority; Obviously, 7300 are better than 7600, when liveness is identical, and the node that prioritizing selection path is short, sequence completes, and the via node of sequence least significant end, is continued in relaying priority end in continuous three days, invalid relaying will be considered as, make delete processing, complete route Dynamic Maintenance since then.
The part that the present invention does not relate to prior art that maybe can adopt all same as the prior art is realized.
Claims (8)
1. the router-table structure automatically safeguarded of a high-efficiency dynamic, it is characterized in that the data structure of Centroid routing table is made up of hash table and route chained list, described route chained list is orderly doubly linked list, each child node in hash table safeguards a route chained list, this child node is certainly as route linked list head node, each element in route chained list, jumps via node for this child node returns first of Centroid; Each element in described route chained list and via node, its content comprises node ID, hop count and route frequency information, and hop count is that current node selects this via node to get back to Centroid, needs the via node number of process; The active degree of route frequency information via node for this reason, one paths communicates when center sensor selection problem, if communicate successfully, each node then in path, adds its route chained list using its downstream node as via node successively, and its route frequency information is increased by 1, simultaneously, Centroid is according to time dimension, and the frequency information of the via node of each node is subtracted 1 by timing, and namely route frequency information volatilizees in time; Via node in the route chained list of child node carries out integrated ordered according to its hop count, route frequency information: the via node that prioritization route frequency is high, the via node that the prioritization hop count that route frequency is identical is few, when selecting routed path, by prioritizing selection from the nearest via node of linked list head.
2. the router-table structure automatically safeguarded of a kind of high-efficiency dynamic according to claim 1, it is characterized in that the hash address of hash table obtains according to delivery after child node address superposition, modulus value M is constant, and the scale according to Centroid support is arranged.
3. the router-table structure automatically safeguarded of a kind of high-efficiency dynamic according to claim 2, it is characterized in that in centralized meter-reading system, child node address is 6 byte-code compression binary-coded decimals, hash table address:
4. the router-table structure automatically safeguarded of a kind of high-efficiency dynamic according to claim 1, it is characterized in that each child node in hash table, according to the position in hash table, a corresponding unique ID, the sequence number being arranged in hash table by hash array index number+child node is formed.
5. the router-table structure automatically safeguarded of a kind of high-efficiency dynamic according to claim 1, is characterized in that Centroid is according to time dimension, and the frequency information of the via node of each node is subtracted 1 by timing, and described timing is 12 hours.
6. the method for managing route table automatically safeguarded of high-efficiency dynamic, it is characterized in that it comprises that routed path is searched, routed path management, routed path Dynamic Maintenance three part, wherein:
Routed path search procedure comprises:
S101, searches hash table according to child node address, searches failure and then terminates, and searches and successfully carries out S102;
S102, gets route chained list first via node;
S103, takes out child node ID from node elements, judges whether the child node in corresponding hash table, is, carries out S104, otherwise gets the next via node of route chained list and the S103 that circulates;
S104, child node joins in path selection, judges whether route chained list is empty, is terminate, otherwise returns S102;
Routed path management process comprises:
S201, explores unknown routing iinformation, obtains a communication path;
S202, in the mode of inverted order, from last node, successively the next node of its communication path is joined in its route chained list, and upgrade hop count, increase progressively route frequency information, if this node is Already in route chained list, only upgrade hop count and route frequency information.
Routed path Dynamic Maintenance process comprises:
S301, selected child node to be safeguarded from hash table;
S302, selects i-th via node, initial i=0 from its route chained list;
S303, chooses the i-th+1 via node, and this via node is that sky then terminates, and does not then carry out S304 for sky;
S304, the i-th+1 via node compares priority successively with 0 ~ i via node: route frequency height person priority is high, if route frequency is identical, then the few person's priority of hop count is high; Judge whether the via node finding priority lower than it, find, carry out S305, otherwise return S303;
S305, before the i-th+1 via node being inserted the via node of priority lower than it, and returns S303.
7. the method for managing route table automatically safeguarded of a kind of high-efficiency dynamic according to claim 6, is characterized in that the concrete steps that in routed path search procedure, S101 searches hash table according to child node address are:
S1011 is according to treating that communication child node address calculates hash table address MID;
S1012 gets hash table first child node, judges whether hash table is empty, for sky then terminates; Otherwise carry out matching addresses, the match is successful then terminates, otherwise get the next element circular S1012 of hash table.
8. the method for managing route table automatically safeguarded of a kind of high-efficiency dynamic according to claim 6, to it is characterized in that in routed path management process S201 obtain a communication path be Centroid idle time, use ant group algorithm or genetic algorithm, explore unknown routing iinformation to obtain communication path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510533086.9A CN105208622B (en) | 2015-08-26 | 2015-08-26 | A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510533086.9A CN105208622B (en) | 2015-08-26 | 2015-08-26 | A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105208622A true CN105208622A (en) | 2015-12-30 |
| CN105208622B CN105208622B (en) | 2019-05-10 |
Family
ID=54955969
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510533086.9A Active CN105208622B (en) | 2015-08-26 | 2015-08-26 | A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105208622B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847150A (en) * | 2016-03-23 | 2016-08-10 | 贵州电网有限责任公司电力科学研究院 | Method for selecting hybrid route of wireless communication and electric power carrier wave wired communication |
| CN105933208A (en) * | 2016-05-19 | 2016-09-07 | 青岛海尔智能家电科技有限公司 | Message processing method and device |
| WO2018058316A1 (en) * | 2016-09-27 | 2018-04-05 | 深圳市思达仪表有限公司 | Networking method for centralized meter reading and networking system for centralized meter reading |
| CN109347736A (en) * | 2018-09-27 | 2019-02-15 | 深圳友讯达科技股份有限公司 | Bimodulus routes short address communication means, device and server |
| CN109804605A (en) * | 2016-08-15 | 2019-05-24 | 奈飞公司 | Compress forwarding table |
| CN111601359A (en) * | 2020-05-15 | 2020-08-28 | 郑州糖小果网络技术有限公司 | Method for identifying key nodes of communication network |
| CN112258825A (en) * | 2020-10-30 | 2021-01-22 | 石家庄科林电气股份有限公司 | Meter reading route addressing method based on spiral algorithm |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101106520A (en) * | 2006-07-11 | 2008-01-16 | 北京邮电大学 | AODV-based independent multi-routing technology for several root nodes |
| CN101399778A (en) * | 2008-10-30 | 2009-04-01 | 北京邮电大学 | Node organizing method and resource discovery method in wireless P2P network |
| CN102497440A (en) * | 2011-12-20 | 2012-06-13 | 山东大学 | Low-latency data aggregation algorithm |
| US20140198770A1 (en) * | 2011-09-20 | 2014-07-17 | Fujitsu Limited | Node device, communication method, and storage medium |
| CN104134332A (en) * | 2014-07-31 | 2014-11-05 | 国家电网公司 | Distribution-area integrated-reading-system dynamic ad hoc network method based on wireless sensor network technology |
-
2015
- 2015-08-26 CN CN201510533086.9A patent/CN105208622B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101106520A (en) * | 2006-07-11 | 2008-01-16 | 北京邮电大学 | AODV-based independent multi-routing technology for several root nodes |
| CN101399778A (en) * | 2008-10-30 | 2009-04-01 | 北京邮电大学 | Node organizing method and resource discovery method in wireless P2P network |
| US20140198770A1 (en) * | 2011-09-20 | 2014-07-17 | Fujitsu Limited | Node device, communication method, and storage medium |
| CN102497440A (en) * | 2011-12-20 | 2012-06-13 | 山东大学 | Low-latency data aggregation algorithm |
| CN104134332A (en) * | 2014-07-31 | 2014-11-05 | 国家电网公司 | Distribution-area integrated-reading-system dynamic ad hoc network method based on wireless sensor network technology |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105847150A (en) * | 2016-03-23 | 2016-08-10 | 贵州电网有限责任公司电力科学研究院 | Method for selecting hybrid route of wireless communication and electric power carrier wave wired communication |
| CN105847150B (en) * | 2016-03-23 | 2019-03-12 | 贵州电网有限责任公司电力科学研究院 | It is a kind of wirelessly with the wired mixed logic dynamic selection method of power carrier |
| CN105933208A (en) * | 2016-05-19 | 2016-09-07 | 青岛海尔智能家电科技有限公司 | Message processing method and device |
| CN109804605A (en) * | 2016-08-15 | 2019-05-24 | 奈飞公司 | Compress forwarding table |
| CN109804605B (en) * | 2016-08-15 | 2021-06-04 | 奈飞公司 | Compressing forwarding tables |
| WO2018058316A1 (en) * | 2016-09-27 | 2018-04-05 | 深圳市思达仪表有限公司 | Networking method for centralized meter reading and networking system for centralized meter reading |
| CN109347736A (en) * | 2018-09-27 | 2019-02-15 | 深圳友讯达科技股份有限公司 | Bimodulus routes short address communication means, device and server |
| CN111601359A (en) * | 2020-05-15 | 2020-08-28 | 郑州糖小果网络技术有限公司 | Method for identifying key nodes of communication network |
| CN111601359B (en) * | 2020-05-15 | 2022-05-31 | 广州禄德投资有限公司 | Method for identifying key nodes of communication network |
| CN112258825A (en) * | 2020-10-30 | 2021-01-22 | 石家庄科林电气股份有限公司 | Meter reading route addressing method based on spiral algorithm |
| CN112258825B (en) * | 2020-10-30 | 2021-07-23 | 石家庄科林电气股份有限公司 | Meter reading route addressing method based on spiral algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105208622B (en) | 2019-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105208622A (en) | High-efficiency dynamic automatic-maintenance routing list structure and routing list management method | |
| Erol-Kantarci et al. | Suresense: sustainable wireless rechargeable sensor networks for the smart grid | |
| CN106327847B (en) | Power information collection copies method and system | |
| CN108924233A (en) | Electric power collection copies group system and method | |
| CN102184628B (en) | Intelligent divisional low-power-consumption wireless networking meter reading method | |
| CN106713512B (en) | Efficient data transmission method and system for dynamically balancing network bandwidth of Internet of things | |
| CN109215326A (en) | A kind of parallel meter register method and device | |
| CN101801006B (en) | Method for acquiring soil humidity information | |
| CN102882979B (en) | Data acquisition based on cloud computing system and the system and method collecting shunting | |
| CN110032592A (en) | A kind of energy big data integration system and method | |
| CN104750649A (en) | Synchronous sequential control method for opening topology structure bus | |
| CN105430720A (en) | Sensor networking system and method for substation equipment based on distributed bootstrap algorithm | |
| JP2023506618A (en) | Distribution system with a network of smart meters | |
| CN115190378A (en) | Data acquisition terminal based on WI-SUN communication mode | |
| CN105072589B (en) | A kind of data transmission method and Wide Area Netweork base satation of Wide Area Netweork base satation | |
| CN109003432A (en) | Information copy reading method based on power-line carrier communication system | |
| CN103139865A (en) | Method of networking and communicating in electric power internet of things | |
| CN106899678B (en) | High-efficiency data transmission method and system for dynamically balancing energy Internet network bandwidth | |
| CN105790254A (en) | Multi-tree-based feeder topology representation method | |
| CN102348295A (en) | System based on wireless data acquisition and networking method thereof | |
| CN112134354B (en) | A Fusion Method of Marketing and Distribution Data Based on HPLC Communication | |
| CN110032586B (en) | Storage method, query method and acquisition and storage system for energy storage cell data | |
| CN107465706A (en) | A kind of distributed data object storage device based on cordless communication network | |
| CN112488343B (en) | Smart city intelligent perception terminal address selection method based on hyper-heuristic algorithm | |
| CN102571447B (en) | Method and system of embedded cloud computing node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: Qidong City, Jiangsu province 226200 Nantong City Lin Yang Lu No. 666 Applicant after: JIANGSU LINYANG ENERGY CO., LTD. Applicant after: Nanjing Linyang Electric Power Technology Co.,Ltd. Address before: Qidong City, Jiangsu province 226200 Nantong City Lin Yang Lu No. 666 Applicant before: Jiangsu Linyang Electronics Co., Ltd. Applicant before: Nanjing Linyang Electric Power Technology Co.,Ltd. |
|
| COR | Change of bibliographic data | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200117 Address after: 226200 Jiangsu city of Nantong province Qidong Economic Development Zone No. 666 Lin Yang Lu Co-patentee after: Nanjing Linyang Electric Power Technology Co.,Ltd. Patentee after: JIANGSU LINYANG ENERGY CO., LTD. Co-patentee after: Jiangsu Huayuan Apparatus and Instrument Co., Ltd. Address before: Qidong City, Jiangsu province 226200 Nantong City Lin Yang Lu No. 666 Co-patentee before: Nanjing Linyang Electric Power Technology Co.,Ltd. Patentee before: JIANGSU LINYANG ENERGY CO., LTD. |
|
| TR01 | Transfer of patent right |