CN105208622B - A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically - Google Patents
A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically Download PDFInfo
- Publication number
- CN105208622B CN105208622B CN201510533086.9A CN201510533086A CN105208622B CN 105208622 B CN105208622 B CN 105208622B CN 201510533086 A CN201510533086 A CN 201510533086A CN 105208622 B CN105208622 B CN 105208622B
- Authority
- CN
- China
- Prior art keywords
- node
- routing
- chained list
- relay node
- hash table
- 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.)
- Active
Links
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 kind of router-table structures and method for managing route table that high-efficiency dynamic is safeguarded automatically, the management for the transistroute table of carrier wave or micro-power wireless communication device (equipment) in automatic meter reading system.The data structure of central node routing table is made of hash table and orderly doubly linked list, and the hash address of hash table obtains after being superimposed modulus according to child node address；Each child node is according to the corresponding unique ID in the position being present in hash table, each child node manages a routing chained list, element in chained list is the first node ID jumped that current node returns to central node (concentrator), and chained list is ranked up according to the hop count of the nodal regression central node.The relay route of each child node can obtain a plurality of active path according to permutation and combination, and not increase additional storage space consumption, and routing table lookup speed is fast, and can automatically update maintenance according to the operation of central node.
Description
Technical field
When the present invention relates to using carrier wave or micro-power wireless communication in automatic meter reading system, carrier wave or micropower are wireless
The method for managing route table that a kind of high-efficiency dynamic that communication module uses is safeguarded automatically, specifically a kind of high-efficiency dynamic are safeguarded automatically
Router-table structure and method for managing route table.
Background technique
Electric power remote automatic meter reading system (referred to as " centralized meter-reading system ") is based on based on computer, the communication technology, to electricity
Energy table carries out the Large Information Systems of data acquisition, transmission and processing, it is a kind of technological progress of meter reading method, be can be improved
Meter reading promptness rate, reduction manual metering error rate, discovery multiplexing electric abnormality and alarm, line loss can be carried out by copying and accepting platform area summary table simultaneously
Calculate analysis.Centralized meter-reading system is made of communication network, system main website, concentrator, four part of acquisition terminal.With scientific and technical day
The different development of crescent, communication have become the important component of whole system.According to the composition of system, communication channel can be divided into
Uplink and downlink, common communication mode have: PSTN cable telephone network, GPRS are wireless, fiber optic communication mode, wireless networking and low
Piezoelectric forces carrier communication mode etc..
With the expansion of the big transformation of nationwide power grid, increasingly huge supply network automatic management how is solved the problems, such as
It is extremely urgent.Electricity consumption data is transmitted using low voltage electric power carrier communication technology, realizes timely and effective collection and statistics, is improved
Electric system is the preferred plan generally acknowledged both at home and abroad at present to power supply quality monitoring capacity and management level.Low-voltage power
Line is a kind of most commonly used medium of communication network, this ready-made medium is sufficiently made good use of using appropriate technology, makes low-voltage power
Line carrier meter reading system reaches practical demand, and generated economic benefit and production efficiency are obvious.But due to
The variability of the complexity and power grid feature of low-voltage power web frame, so that PLC technology has certain limitation.
In recent years, with the development of wireless communication technique, using wireless networking communications mode, power carrier skill is made up to a certain extent
The deficiency of art.In recent years, power line carrier, PLC and micro power radio communication destroy field in electric power collection, suffer from considerable application.
Though downlink use carrier communication or micro power radio communication mode, be limited to directly it is point-to-point communication away from
From the data that complete a distribute-electricity transformer district acquire, usually the ammeter for radio area end, need through multilevel relay, ability
It acquires successfully.Due to the variability of power grid environment, single routed path is only leaned on, is difficult so that meter reading success rate in platform area reaches
100%, to any one Qu Jiedian, it is necessary to it can be flexibly quickly from a plurality of routed path path selection, and routing table wants energy
According to live operating condition, Dynamic Maintenance updates, and meter reading success rate can be made to step to a new level.So in embedded system, have
Under the resources supplIes of limit, realize that the routing table of central node efficiently manages, it appears particularly important.
Summary of the invention
The purpose of the present invention is being directed in central system, when downlink uses carrier communication or micro-power wireless communication mode,
Routing table active path is few, search speed is slow, Dynamic Maintenance updates the problems such as difficult, proposes what a kind of high-efficiency dynamic was safeguarded automatically
Router-table structure and method for managing route table.
The technical scheme is that
A kind of router-table structure that high-efficiency dynamic is safeguarded automatically, the data structure of central node routing table is by hash table and road
It is made of chained list, the routing chained list is orderly doubly linked list, and each child node in hash table safeguards a routing chained list, should
Child node itself is routing chained list head node, routes each element in chained list, return to central node for the child node first
Jump relay node；Each element, that is, relay node in the routing chained list, content include node ID, hop count and road
By frequency information, hop count is defined as current node and this relay node is selected to return to central node, need by relaying
Node number, hop count is fewer, and expression path is shorter；Routing frequency information defines the active degree of relay node thus, routing
Frequency is higher, and expression communication success rate is higher, when central node has selected a paths to be communicated, if communicated successfully, road
Each node in diameter successively node will be added its as relay node and route chained list, and and route it frequency information downstream
Increase by 1, meanwhile, the frequency information of the relay node of each node is periodically subtracted 1 according to time dimension by central node, i.e. routing frequency
Degree information is volatilized at any time；Relay node in the routing chained list of child node is carried out according to its hop count, routing frequency information
Integrated ordered: prioritization routes the high relay node of frequency, the few relaying of the identical prioritization hop count of routing frequency
Node will preferentially select the relay node nearest from linked list head when selecting routed path.
Modulus obtains after the hash address of hash table is superimposed according to child node address, and modulus value M is constant, according to central node
The scale of support is configured.
In centralized meter-reading system, child node address is 6 byte-code compression binary-coded decimals, hashes table address:
Each child node in hash table, according to the position in hash table, a corresponding unique ID, by hash array rope
Quotation marks+child node is located at the composition of the serial number in hash table.
The frequency information of the relay node of each node is periodically subtracted 1 according to time dimension by central node, and the timing is 12
Hour.
A kind of method for managing route table that high-efficiency dynamic is safeguarded automatically, it include routed path lookup, routed path management,
Routed path Dynamic Maintenance three parts, in which:
Routed path search procedure includes:
S101 searches hash table according to child node address, and searching failure then terminates, and searches and successfully carries out S102；
S102 takes routing first relay node of chained list；
S103 takes out child node ID from node elements, judges whether the child node in corresponding hash table, is to carry out
Otherwise S104 takes the next relay node of routing chained list and recycles S103；
S104, child node are added in path selection, are judged to route whether chained list is sky, are to terminate, otherwise return
S102；
Routed path management process includes:
S201 explores unknown routing iinformation, obtains a communication path；
Since the last one node, successively the next node of its communication path is added in a manner of inverted order by S202
It is routed in chained list to it, and updates hop count, be incremented by routing frequency information, if the node is already present on routing chained list
In, only update hop count and routing frequency information.
Routed path Dynamic Maintenance process includes:
S301 selectes child node to be safeguarded from hash table；
S302 is routed in chained list from it and is selected i-th of relay node, initial i=0；
S303 chooses i+1 relay node, which is that sky then terminates, and does not carry out S304 then for sky；
S304, i+1 relay node and 0~i relay node successively compared with priority: the routing high person's priority of frequency
Height, if routing frequency is identical, it is high that hop count lacks person's priority；Judge whether to find the relay node that priority is lower than it,
It finds, carries out S305, otherwise return to S303；
S305 before relay node of the i+1 relay node insertion priority lower than it, and returns to S303.
S101 searches the specific steps of hash table according to child node address in routed path search procedure are as follows:
S1011 calculates hash table address MID according to child node address to be communicated；
S1012 takes first child node of hash table, judges whether hash table is empty, is that sky then terminates；Otherwise address is carried out
Matching, successful match then terminate, and otherwise take the next element circular S1012 of hash table.
S201 obtains a communication path when being the central node free time in routed path management process, using ant group algorithm or
Genetic algorithm explores unknown routing iinformation to obtain communication path.
Beneficial effects of the present invention:
Method of the invention be not limited to carrier path by or micro power radio communication routing management, taken into account embedded system
The limited premise of resource, at the same meet routing table it is quick lookup, routing description information it is irredundant, largely save memory space,
And can dynamic auto maintenance update, there is very high application and popularization value.
Method for managing route table proposed by the present invention is searched, routed path management (increase, delete), road by routed path
It is made of path Dynamic Maintenance three parts, it is simple, efficient.This method, which has been fully considered, there are any path dependent options in central node
In the case of automatic recovery (reparation), sufficiently present efficient, highly reliable feature.Meanwhile this method has deeply abstraction,
It is unrelated with specific communication mode, it is suitable for bandwidth carrier, narrowband carrier or micro power radio communication, is a kind of more general routing
Table management method can be adapted for the different embedded system data communications fields, have very high practicability and promotional value.
Detailed description of the invention
Fig. 1 is router-table structure block diagram.
Fig. 2 is relay node structure chart.
Fig. 3 is child node ID structure chart.
Fig. 4 is to search hash table flow chart according to child node address.
Fig. 5 is that routed path searches flow chart.
Fig. 6 is that routed path updates flow chart.
Fig. 7 is the automatic maintenance process figure of routing table.
Specific embodiment
The present invention is further illustrated with reference to the accompanying drawings and examples.
As shown in Figure 1-3, a kind of router-table structure that high-efficiency dynamic is safeguarded automatically, the data structure of central node routing table
It is made of hash table and routing chained list, the routing chained list is orderly doubly linked list, each child node maintenance one in hash table
A routing chained list, the child node itself are routing chained list head node, route each element in chained list, in child node return
The first of heart node jumps relay node；Each element, that is, relay node in the routing chained list, content include node ID, road
It is defined as current node by hop count and routing frequency information, hop count and this relay node is selected to return to central node, needed
The relay node number to be passed through (hop count 2, indicate current node select this relay node to return to central node, need through
Cross 2 relay nodes)；Routing frequency information defines the active degree (for a multidate information) of relay node thus, works as centromere
Point has selected a paths to be communicated, if communicated successfully, each node in path successively will node conduct downstream
Relay node is added it and routes chained list, and routes it frequency information increase by 1, meanwhile, central node is according to time dimension, timing
The frequency information of the relay node of each node is subtracted 1, i.e. routing frequency information volatilizees at any time；If a child node is for a long time
Certain relay node for failing to route with it in chained list communicates, then the routing frequency information of the relay node will be reduced to 0, subsequent
In Path selection, the priority of this relay node will rearward；Relay node in the routing chained list of child node is jumped according to its routing
Number, routing frequency information carry out integrated ordered: prioritization routes the high relay node of frequency, the identical preferential row of routing frequency
The few relay node of column hop count will preferentially select the relay node nearest from linked list head when selecting routed path.
In a preferred embodiment, modulus obtains after the hash address of hash table is superimposed according to child node address, and modulus value M is
Constant is configured according to the scale that central node is supported.Child node with same Hash table address will be located at same dissipate
In list.
In centralized meter-reading system, child node address is 6 byte-code compression binary-coded decimals, hashes table address:
In a preferred embodiment, each child node in hash table, according to the position in hash table, corresponding one only
One ID is located at the serial number in hash table by hash array index number+child node and constitutes.Such as 0304, indicate the 3rd hash table the 4th
Sequential bits.
Each child node, which only manages, oneself returns to the relay node that central node first is jumped, the redundancy of entire routing table
Almost 0, the selection of routed path will have unlimited a variety of possibility, and be not take up any additional storage according to permutation and combination
Space.
A kind of method for managing route table that high-efficiency dynamic is safeguarded automatically, it include routed path lookup, routed path management,
Routed path Dynamic Maintenance three parts.
It, will according to child node to be visited when routed path search procedure is that central node prepares communication in conjunction with Fig. 5
Hash address is calculated according to hash address operation rule in location, and corresponding child node is searched in corresponding hash table,
After finding the child node, optimal routed path is selected, first relay node of the routing chained list of the child node is as optimal
Relay node finds its child node being located in hash table further according to this relay node, and so on, until center can be returned to
Node, a routed path selection finish.After communicating successfully, the doubly linked list information of each node will be updated again.Include:
S101 searches hash table according to child node address, and searching failure then terminates, and searches and successfully carries out S102；
S102 takes routing first relay node of chained list；
S103 takes out child node ID from node elements, judges whether the child node in corresponding hash table, is to carry out
Otherwise S104 takes the next relay node of routing chained list and recycles S103；
S104, child node are added in path selection, are judged to route whether chained list is sky, are to terminate, otherwise return
S102。
In conjunction with Fig. 4, S101 searches the specific steps of hash table according to child node address in routed path search procedure are as follows:
S1011 calculates hash table address MID according to child node address to be communicated；
S1012 takes first child node of hash table, judges whether hash table is empty, is that sky then terminates；Otherwise address is carried out
Matching, successful match then terminate, and otherwise take the next element circular S1012 of hash table.
In conjunction with Fig. 6, when routed path management process is the central node free time, using ant group algorithm or genetic algorithm, explore
Unknown routing iinformation by the way of inverted order, since the last one node, successively will when getting a routed path
Next node in its routed path is added to it and routes in chained list, and updates hop count, is incremented by routing frequency information,
If the node is already present in chained list, hop count and routing frequency information are only updated.Include:
S201 explores unknown routing iinformation, obtains a communication path；
Since the last one node, successively the next node of its communication path is added in a manner of inverted order by S202
It is routed in chained list to it, and updates hop count, be incremented by routing frequency information, if the node is already present on routing chained list
In, only update hop count and routing frequency information.
In conjunction with Fig. 7, routed path Dynamic Maintenance process is central node timed maintenance routing table, according to each relay node
Hop count and routing frequency information are ranked up, while can set the maximum routing number of plies, will be more than the maximum number of plies and synthesis
The last node that sorts carries out superseded, guarantees the efficient and high reliability of the irredundant information of entire routing table and routing iinformation,
Reach the target of the dynamic auto maintenance of routing table.Include:
S301 selectes child node to be safeguarded from hash table；
S302 is routed in chained list from it and is selected i-th of relay node, initial i=0；
S303 chooses i+1 relay node, which is that sky then terminates, and does not carry out S304 then for sky；
S304, i+1 relay node and 0~i relay node successively compared with priority: the routing high person's priority of frequency
Height, if routing frequency is identical, it is high that hop count lacks person's priority；Judge whether to find the relay node that priority is lower than it,
It finds, carries out S305, otherwise return to S303；
S305 before relay node of the i+1 relay node insertion priority lower than it, and returns to S303.
It is illustrated below with reference to specific example:
Assuming that central node maximum supporting node number 2040, hashes array M value 100, will establish 100 in central node
Hash array, theoretically, the number of nodes that each hash table includes about 20.
Regeneration node data structure in relaying chained list may be designed as one 32 shapings, and high 16 be node ID, and intermediate 8 are
Hop count, least-significant byte mark routing frequency information.
Routing table establishment process is as follows:
Assuming that a paths are searched when central node route exploration, the node passed through from central node to endpoint node
Address is successively: 000123000024,000123000025,000123000026,000123000027.
According to the computation rule of hash address, the ID of four nodes is 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 be hash array serial number, and latter two are located at the serial number of hash table for current node.
7500 nodes, the node of next-hop are 7400, and hop count 3 routes frequency information 1, then relay node is complete
The description of whole information are as follows: first relay node of 74000301,7500 nodes is 74000301, and so on, the of 7400
One relay node is 73000201.
Routed path selection course is as follows:
Based on the above-mentioned routing table having built up, it is assumed that central node currently needs logical with 000123000026 node
Letter, firstly, calculating the hash address of the node, obtaining hash address is 74, then the node is searched into this hash table, finds sequence
Number it is 0, i.e., 7400, next selects routed path, 7400 optimal first to jump paths is 73000201, then successively searches 7300
Node, optimal relay node is 72000101, then finds 7200 nodes, and 7200 nodes terminate without subsequent relay node, lookup,
Complete routed path are as follows: central node -> 7200- > 7300- > 7400 completes communication.
The automatic maintenance process of routing table is as follows:
Assuming that 7500 nodes, possess 3 relaying relay nodes, be respectively as follows: 74000305,73000201,76000401, lead to
7400 nodes are crossed, central node is returned to, need to jump by 3, routing liveness is 5, returns central node by 7300 nodes, needs
It is jumped by 2, routing liveness is 1, and process 7600 returns to central node, will be jumped by 4, liveness 1；Central node preferentially selects
The high node of liveness is selected, then 7400 nodes will arrange highest priority；Obviously, 7300 are better than 7600, and liveness is identical
In the case of, the preferential node for selecting path short, sequence is completed, the relay node for the least significant end that sorts, and is continued within continuous three days
After priority end, it will be regarded as relaying in vain, make delete processing, complete routing Dynamic Maintenance since then.
Part that the present invention does not relate to is the same as those in the prior art or can be realized by using the prior art.
Claims (8)
1. a kind of route selection method for the router-table structure that high-efficiency dynamic is safeguarded automatically, it is characterized in that central node routing table
Data structure is made of hash table and routing chained list, and the routing chained list is orderly doubly linked list, every height section in hash table
Point one routing chained list of maintenance, the child node itself are routing chained list head node, each element in chained list are routed, for the sub- section
Point returns to the first jump relay node of central node；Each element, that is, relay node in the routing chained list, content include
Node ID, hop count and routing frequency information, hop count are that current node selects this relay node to return to centromere
Point, need by relay node number；The active degree for routing frequency information relay node thus, when central node selects
One paths are communicated, if communicated successfully, each node in path, successively will downstream node as relay node
It is added and routes chained list, and routes it frequency information increase by 1, meanwhile, central node is according to time dimension, periodically by each node
The frequency information of relay node subtract 1, i.e. routing frequency information volatilizees at any time；Relay node in the routing chained list of child node
Carried out according to its hop count, routing frequency information integrated ordered: prioritization routes the high relay node of frequency, routes frequency
The few relay node of identical prioritization hop count will be selected preferentially nearest from linked list head when selecting routed path
Relay node.
2. the route selection method for the router-table structure that a kind of high-efficiency dynamic according to claim 1 is safeguarded automatically, special
Sign is that modulus obtains after the hash address of hash table is superimposed according to child node address, and modulus value M is constant, is supported according to central node
Scale be configured.
3. the route selection method for the router-table structure that a kind of high-efficiency dynamic according to claim 2 is safeguarded automatically, special
Sign is in centralized meter-reading system, and child node address is 6 byte-code compression binary-coded decimals, hashes table address:
Wherein: s indicates child node quantity, and Add (k) indicates that k-th of child node address, % are modulo operation, and modulus value M is constant.
4. the route selection method for the router-table structure that a kind of high-efficiency dynamic according to claim 1 is safeguarded automatically, special
Sign is each child node in hash table, according to the position in hash table, a corresponding unique ID, by hash array index number
+ child node is located at the composition of the serial number in hash table.
5. the route selection method for the router-table structure that a kind of high-efficiency dynamic according to claim 1 is safeguarded automatically, special
Sign is central node according to time dimension, periodically subtracts 1 for the frequency information of the relay node of each node, and the timing is 12 small
When.
6. a kind of method for managing route table that high-efficiency dynamic is safeguarded automatically, it is characterized in that it includes that routed path is searched, routes road
Diameter management, routed path Dynamic Maintenance three parts, in which:
Routed path search procedure includes:
S101 searches hash table according to child node address, and searching failure then terminates, and searches and successfully carries out S102；
S102 takes routing first relay node of chained list；
S103 takes out child node ID from node elements, judges whether the child node in corresponding hash table, is to carry out S104,
Otherwise it takes the next relay node of routing chained list and recycles S103；
S104, child node are added in path selection, are judged to route whether chained list is sky, are to terminate, otherwise return to S102；
Routed path management process includes:
S201 explores unknown routing iinformation, obtains a communication path；
The next node of its communication path since the last one node, is successively added to it in a manner of inverted order by S202
It routes in chained list, and updates hop count, be incremented by routing frequency information, if the node is already present in routing chained list, only
Update hop count and routing frequency information；
Routed path Dynamic Maintenance process includes:
S301 selectes child node to be safeguarded from hash table；
S302 is routed in chained list from it and is selected i-th of relay node, initial i=0；
S303 chooses i+1 relay node, which is that sky then terminates, and does not carry out S304 then for sky；
S304, i+1 relay node and 0~i relay node successively compared with priority: the high person's priority of routing frequency is high,
If it is identical to route frequency, it is high that hop count lacks person's priority；Judge whether to find the relay node that priority is lower than it, find
S305 is then carried out, S306 is otherwise carried out；
S305 before relay node of the i+1 relay node insertion priority lower than it, and carries out S306；
S306, i=i+1 select i+1 relay node from routing chained list, and return to S303.
7. the method for managing route table that a kind of high-efficiency dynamic according to claim 6 is safeguarded automatically, it is characterized in that routing road
S101 searches the specific steps of hash table according to child node address in diameter search procedure are as follows:
S1011 calculates hash table address MID according to child node address to be communicated；
S1012 takes first child node of hash table, judges whether hash table is empty, is that sky then terminates；Otherwise address matching is carried out,
Successful match then terminates, and otherwise takes the next element circular S1012 of hash table.
8. the method for managing route table that a kind of high-efficiency dynamic according to claim 6 is safeguarded automatically, it is characterized in that routing road
When one communication path of S201 acquisition is the central node free time in diameter management process, ant group algorithm or genetic algorithm are used, is explored
Unknown routing iinformation is 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 CN105208622A (en) | 2015-12-30 |
| CN105208622B true 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) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| US10263890B2 (en) * | 2016-08-15 | 2019-04-16 | Netflix, Inc. | Synthetic supernet compression |
| WO2018058316A1 (en) * | 2016-09-27 | 2018-04-05 | 深圳市思达仪表有限公司 | Networking method for centralized meter reading and networking system for centralized meter reading |
| CN109347736B (en) * | 2018-09-27 | 2021-11-12 | 深圳友讯达科技股份有限公司 | Dual-mode routing short address communication method, device and server |
| CN111601359B (en) * | 2020-05-15 | 2022-05-31 | 广州禄德投资有限公司 | Method for identifying key nodes of communication network |
| CN112258825B (en) * | 2020-10-30 | 2021-07-23 | 石家庄科林电气股份有限公司 | Meter reading route addressing method based on spiral algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101106520A (en) * | 2006-07-11 | 2008-01-16 | 北京邮电大学 | Multi-routing technology with several independent root nodes based on AODV |
| CN101399778A (en) * | 2008-10-30 | 2009-04-01 | 北京邮电大学 | Node organizing method and resource discovery method in wireless P2P network |
| CN104134332A (en) * | 2014-07-31 | 2014-11-05 | 国家电网公司 | Distribution-area integrated-reading-system dynamic ad hoc network method based on wireless sensor network technology |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5673840B2 (en) * | 2011-09-20 | 2015-02-18 | 富士通株式会社 | Node device and communication method |
| CN102497440B (en) * | 2011-12-20 | 2014-04-09 | 山东大学 | Low-latency data aggregation algorithm |
-
2015
- 2015-08-26 CN CN201510533086.9A patent/CN105208622B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101106520A (en) * | 2006-07-11 | 2008-01-16 | 北京邮电大学 | Multi-routing technology with several independent root nodes based on AODV |
| CN101399778A (en) * | 2008-10-30 | 2009-04-01 | 北京邮电大学 | Node organizing method and resource discovery method in wireless P2P network |
| CN104134332A (en) * | 2014-07-31 | 2014-11-05 | 国家电网公司 | Distribution-area integrated-reading-system dynamic ad hoc network method based on wireless sensor network technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105208622A (en) | 2015-12-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105208622B (en) | A kind of route selection method and method for managing route table of the router-table structure that high-efficiency dynamic is safeguarded automatically | |
| CN104106287B (en) | The damaged link in intelligent measuring apparatus network is avoided in order to the loop free route of dividing into groups | |
| CN106357305A (en) | Self-networking method, device and system of tree structure network | |
| CN102184628B (en) | Intelligent divisional low-power-consumption wireless networking meter reading method | |
| CN102890682A (en) | Method for creating index, searching method, device and system | |
| CN102868936B (en) | Method and system for storing video logs | |
| CN101222391B (en) | Method for constructing topological tree in server/client terminal structure | |
| CN103874113A (en) | Wireless network maintenance method, device and system | |
| CN106899639A (en) | The acquisition methods of data resource, index server and communication system | |
| CN102546440A (en) | Routing and wavelength assignment method and system | |
| CN109215326A (en) | A kind of parallel meter register method and device | |
| CN102882979A (en) | System and method for collecting, gathering and distributing data on basis of cloud computing system | |
| CN103139865A (en) | Method of networking and communicating in electric power internet of things | |
| CN105007310A (en) | Information synchronization method, device and system | |
| CN103001874B (en) | Delay tolerant mobile social network routing method based on node label set | |
| CN103200029B (en) | The label distribution of webmaster to PTN/IPRan equipment and the method for management | |
| CN100442632C (en) | Automatic module configuration in a telecommunications power system and battery configuration with a click | |
| CN102025615B (en) | Method and device for planning paths of small-granularity services in optical communication network | |
| CN105681200A (en) | Method for topologically querying geographical location of intelligent ammeter by routing function of concentrator | |
| CN105207825A (en) | Fast synchronizing system and synchronizing method for network elements | |
| CN102420812A (en) | Automatic quality of service (QoS) combination method supporting distributed parallel processing in web service | |
| Kampstra et al. | Evolutionary computing in telecommunication network design: A survey | |
| CN101516086B (en) | Service matching method for mobile communication | |
| CN107465706A (en) | A kind of distributed data object storage device based on cordless communication network | |
| CN106559490B (en) | A kind of management method for storage cluster equipment |
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 | ||
| 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. |