CN101895592B - Routing and addressing method based on tree topology address assignment - Google Patents
Routing and addressing method based on tree topology address assignment Download PDFInfo
- Publication number
- CN101895592B CN101895592B CN2010102677032A CN201010267703A CN101895592B CN 101895592 B CN101895592 B CN 101895592B CN 2010102677032 A CN2010102677032 A CN 2010102677032A CN 201010267703 A CN201010267703 A CN 201010267703A CN 101895592 B CN101895592 B CN 101895592B
- Authority
- CN
- China
- Prior art keywords
- node
- address
- limb
- routing
- route
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a routing and addressing method based on tree topology address assignment, belonging to the network technical field. The method comprises the following steps: dividing wireless network addresses into root node addresses, trunk routing addresses and branch routing addresses, respectively carrying out address assignment, routing and addressing on the root nodes, the trunk routing nodes and the branch routing addresses, and shielding off useless address fields according to different network depths of the nodes in the routing and addressing process. The method has the advantages of high capacity, low power consumption, adjustable communication distance and low cost, greatly reduces space occupied by the processor memory, and realizes the fusion of multi-network data. The method realizes that the trunk network depth and the branch network depth can be flexibly configured according to practical situations, thereby having absolute advantages in an industrial production field which requires a larger trunk network depth, the conditions of a limited branch network depth and multiple monitoring nodes.
Description
Technical field
What the present invention relates to is a kind of method of networking technology area, specifically is a kind of route addressing method based on the tree topology address assignment.
Background technology
The wireless communications method of current routine under the not high situation of wireless communication rate, is difficult to successful operation because expense is bigger, and frame is longer in the air, and redundant data is more on large-scale industry level sensor network; Secondly, in order to satisfy the commercial interoperability of using, network node often need expend most handling properties on versatility more in existing most of communication meanss, and the hardware requirement to node under wireless sensor network environment is higher; Once more; The conventional method design considers that node topology changes easily; Guarantee data transmission quality through the adjustment data transfer path; Because the stability of Radio Link communication network topology is better relatively in the industrial wireless sensor network, frequent converting network topological structure can cause bigger negative effect to communication performance, even causes periods of network disruption; In addition, address assignment and the method for routing of existing wireless method have certain complexity, fail to do further optimization to industrial environment, and most addresses fail effectively to utilize, and therefore the network size of reality is very little, fail to reach theoretical value far away.The wireless sensor network communication method embodiment that is directed to commercial Application must solve above-mentioned technical barrier, should guarantee the success rate of transfer of data, also will satisfy the few requirement of expense simultaneously.
Retrieval through to the prior art document is found; One Chinese patent application number is: 200810060070.0; Name is called: a kind of wireless sensor network routing method of new formation convergence gradient; This method forms aggregation node route far away by forming nearly aggregation node route, and modal processor is replied this several steps and formed: this route requests method has significantly reduced the control expense of wireless sensor network system, the life span that has prolonged network.One Chinese patent application number is: 200910039496.2; Name is called: a kind of wireless sensor network routing method; This technology makes that a bunch first energy total amount that consumes correspondingly reduces, and selects the less equalizing network energy consumption of strategy ability of main bunch head, thereby utilizes energy limited in the network efficiently.But above-mentioned two technology, the life span that has only prolonged network does not relate to the distribution and the addressing of address method of the network address.
Summary of the invention
The objective of the invention is to overcome the above-mentioned deficiency of prior art, a kind of route addressing method based on the tree topology address assignment is provided.The present invention can be according to the actual conditions flexible configuration backbone network degree of depth and the limb network degree of depth; Under the situation that the commercial production field requirement backbone network degree of depth is big, the limb network degree of depth is limited and monitoring node is more, has absolute advantage; In routing addressing,, mask useless address field according to the difference of the meshed network degree of depth.
Of the present invention through following technical scheme realization, the present invention includes following steps:
The first step is divided into root node address, backbone route address and limb routing address with the address of wireless network, and wherein: the root node address is fixed as 0x0000; The backbone route address be fixed as 0 from the address, main address is along with the increase of backbone network length singly increases one successively; The limb routing address distributes the address according to address assignment bit field table;
When new node requires to add this network, carried out for second step;
When root node requires addressing, carried out for the 3rd step;
When the backbone route node requires addressing, carried out for the 4th step;
When the limb routing node requires addressing, carried out for the 5th step.
Described address assignment bit field table is: AddrAssignTable []={ 0x0100,0x0040,0x0010,0x0004,0x0001};
Described main address is the high eight-bit territory of node address;
Described from the address, be low eight bit fields of node address.
In second step, when new node required to add root node, root node carries out the root address assignment to be handled;
When new node required to add the backbone route address, the backbone route node carries out the backbone route address assignment to be handled;
When new node required to add the limb routing address, the limb routing node carried out limb routing address allocation process; Thereby realize the address assignment of new node.
Described address assignment handled, and may further comprise the steps:
A, when the new node that requires to add is the backbone route node, and the number of the backbone route node that adds before hold less than root node backbone route node maximum number the time:
(1) when node require to add the backbone route node of root node for first, root node as its address, and sends to this node with the address with 0x0100;
(2) when node is the backbone route node of N requirement adding root node, root node adds the address of 1 back as new node with the main address of N-1 backbone route node that adds, and this address is sent to this node, N >=2;
B, when the new node that requires to add be the limb routing node, and the number of the limb routing node that adds before hold less than root node limb routing node maximum number the time:
(1) when node require to add the limb routing node of root node for first, root node carries out the logic OR computing with 0x0040 with the address that requires to add ingress self and obtains this address of node;
(2) when node be the limb routing node of N requirement adding root node, root node carries out the logic OR computing with the address of 0x0040 and N-1 adding limb route and obtains this address of node, N >=2.
Described backbone route address assignment is handled, and may further comprise the steps:
A, when the new node that requires to add is the backbone route node, this node adds 1 back with oneself main address and sends to as the address of new node and with the address and require the backbone route node node that adds;
B, when the new node that requires to add be the limb routing node, and the number of the limb routing node that adds before hold less than this node limb routing node maximum number the time:
(1) when node require to add the limb routing node of this node for first, this node carries out the logic OR computing with 0x0040 and the address of itself and obtains this address of node;
(2) be the limb routing node of N this node of requirement adding when node, this node carries out the logic OR computing with the address of 0x0040 and N-1 limb route that adds and obtains this address of node, N >=2.
Described limb routing address allocation process may further comprise the steps:
A, when the new node that requires to add is the backbone route node, disregard;
B, when the new node that requires to add be the limb routing node, and the number of the limb routing node that adds before hold less than this node limb routing node maximum number the time:
(1) when node requires to add the limb routing node of this node for first; This node carries out the logic OR computing with M element in the address assignment bit field table and the address of itself and obtains requiring to add the address of node, and wherein: M adds 1 for the network degree of depth of this node itself;
(2) when node be the limb routing node of N this node of requirement adding; This node is with M element in the address assignment bit field table; Carry out the logic OR computing with the address of N-1 limb route and obtain requiring to add the address of node; Wherein: M adds 1, N >=2 for the network degree of depth of this node itself.
The described network degree of depth; Be: the network degree of depth of root node and backbone route node is 0; The network degree of depth that adds the limb routing node of root node or backbone route node is 1, and the network degree of depth that adds the network degree of depth and be the limb routing node of 1 limb routing node is 2, by that analogy; The network degree of depth of limb node that adds the network degree of depth and be the node of N is N+1, N >=0.
In the 3rd step, when the destination address of root node addressing is root node, directly transfers to the upper strata and handle;
When the destination address of root node addressing is the backbone route address, be transmitted to the backbone route child node of this root node;
When the destination address of root node addressing is the limb routing address,
(1) when destination address is the child node of root node, is transmitted to the limb route child node of this root node;
(2) when destination address is the child node of backbone route in the network, be transmitted to the backbone route child node of this root node.
Described child node is: when N node added N-1 node, and N child node that node is a N-1 node then, N-1 node is the father node of N node, N >=1, the no node type of this relation limits.
In the 4th step, when the destination address of backbone route node addressing is root node, be transmitted to the father node of this backbone route node;
When the destination address of backbone route node addressing is the backbone route node, and:
(1) when the main address of destination address during, is transmitted to the backbone route child node of oneself greater than oneself main address;
(2) when the main address of destination address during, be transmitted to the backbone route father node of oneself less than oneself main address.
When the destination address of backbone route node addressing is the limb routing node, and:
(1) when the main address of destination address during, is transmitted to the backbone route child node of oneself greater than oneself main address;
(2) when the main address of destination address during, be transmitted to the backbone route father node of oneself less than oneself main address;
(3) when the main address of destination address equals the main address of oneself, be transmitted to the limb route child node of oneself.
In the 5th step, when the destination address of limb routing node addressing is root node, be transmitted to the father node of this node;
When the destination address of limb routing node addressing is the backbone route node, be transmitted to the father node of this node;
When the destination address of limb routing node addressing is the limb routing node, and:
(1) when the main address of destination address is greater than or less than the main address of oneself, is transmitted to the father node of oneself;
(2) main address and the destination address that equals oneself when the main address of destination address is transmitted to the limb route child node of oneself during for oneself child node; Otherwise, be transmitted to oneself father node.
Compared with prior art, the invention has the beneficial effects as follows:
(1) high power capacity: host node of this method can be managed 254 node; 4 grades of branch network degree of depth; And these parameters can arbitrarily dispose according to different concrete application, and than ZigBee (purple honeybee) technology, what the method was more stressed is reliability and ease for use.
(2) low-power consumption: this method adopts the strategy of " sleep earlier and wake up earlier ", is guaranteeing to make the power consumption of node reach minimum under the highly reliable prerequisite.Under the low power consumption standby mode, adopt TRN (backbone route node) or the BRN (limb routing node) of powder source management mode but node saves No. 5 dry cell support nodes work 6 months～24 months with 2, even the time is longer.
(3) communication distance is adjustable: transmission range generally between 50m～100m, after increasing RF (radio frequency) transmitting power, also rises to 1～3km.This refers to the distance between adjacent node.If through the relay of route and inter-node communication, transmission range can farther (supporting 255 grades of routes), and whole in addition wireless network can also be connected with existing other diverse network, realizes that many netting indexs are according to fusion.
(4) low cost: reduce service traffics, fully effectively utilize wireless bandwidth.Through optimization method significantly (less than prior art 1/10), reduced requirement to communication controler, need not preserve huge routing table, neighbor list has significantly reduced the space hold of processor memory.
Embodiment
Below method of the present invention is further described: present embodiment provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment being to implement under the prerequisite with technical scheme of the present invention.
Embodiment 1
The backbone route node requires to add root node in the present embodiment, and initiate backbone route node requirement addressing, specifically may further comprise the steps:
The first step, the address is divided: the address of wireless network is divided into root node address, backbone route address and limb routing address, and wherein: the root node address is fixed as 0x0000; The backbone route address be fixed as 0 from the address, main address is along with the increase of backbone network length singly increases one successively; The limb routing address distributes the address according to address assignment bit field table;
When new node requires to add this network, carried out for second step;
When the backbone route node requires addressing, carried out for the 3rd step.
Described address assignment bit field table is: AddrAssignTable []={ 0x0100,0x0040,0x0010,0x0004,0x0001};
Described main address is the high eight-bit territory of node address;
Described from the address, be low eight bit fields of node address.
Second step, address assignment:
A last backbone route node address that adds root node is 0x0200 in the present embodiment; Wherein 0x02 is the main address of node; When new node required to add root node, whether the backbone route interstitial content that adds before root node is at first judged was less than the maximum number that oneself can hold, when being greater than or equal to maximum node number; Root node sends a notice to the node that requires to add, and indicates it can't accept to join request; Otherwise root node adds the address of 1 back as new node with the main address of a last backbone route node, and here for 0x02 adds 1, the gained result is 0x03, so the address of new node is 0x0300.
The 3rd step, routing addressing:
It is 0x0200 that initiate backbone route node requires the destination address of addressing; Whether the main address that this node is at first judged destination address is greater than oneself main address; The main address 0x02 of destination address is less than the main address 0x03 of oneself, so with the father node of data forwarding to oneself here.
In the present embodiment, network node need not consume a lot of energy and be used to monitor the message that neighbor node sends, and only when adding network, sends corresponding claim frame, under wireless sensor network environment, has prolonged the service life of each node and whole network.This method adopts the address method for routing of optimizing, and makes the maximum 255 jumping master network degree of depth of supporting of network, 4 grades of branch network degree of depth, and these parameters can arbitrarily dispose according to different concrete application.
Embodiment 2
Backbone route point requires to add the backbone route node in the present embodiment, and initiate backbone route node requirement addressing, specifically may further comprise the steps:
The first step, the address is divided: the address of wireless network is divided into root node address, backbone route address and limb routing address, and wherein: the root node address is fixed as 0x0000; The backbone route address be fixed as 0 from the address, main address is along with the increase of backbone network length singly increases one successively; The limb routing address distributes the address according to address assignment bit field table;
When new node requires to add this network, carried out for second step;
When the backbone route node requires addressing, carried out for the 3rd step.
Described address assignment bit field table is: AddrAssignTable []={ 0x0100,0x0040,0x0010,0x0004,0x0001};
Described main address is the high eight-bit territory of node address;
Described from the address, be low eight bit fields of node address.
Second step, address assignment:
The backbone route node address that new node will add is 0x0300; Wherein 0x03 is the main address of node; When new node required to add backbone nodes, whether the backbone route interstitial content that adds before the backbone route node is at first judged was less than the maximum number that oneself can hold, when being greater than or equal to maximum node number; The backbone route node sends a notice to the node that requires to add, and indicates it can't accept to join request; Otherwise the backbone route node adds the address of 1 back as new node with the main address of oneself, and here for 0x03 adds 1, the gained result is 0x04, so the address of new node is 0x0400.
The 3rd step, routing addressing:
It is 0x0200 that initiate backbone route node requires the destination address of addressing; Whether the main address that this node is at first judged destination address is greater than oneself main address; The main address 0x02 of destination address is less than the main address 0x04 of oneself here; So give the father node of oneself with data forwarding, the destination address that requires addressing in the present embodiment is a root node, this node is directly given data forwarding the father node of oneself.
In the present embodiment; Each node in the wireless sensor network need not to preserve a large amount of neighbor lists; Information such as routing table have reduced the requirement of method to network node hardware, and this method makes full use of effective address; Need not consider the problem that reclaim the network address, make network size really reach thousand number of stages.This method can reduce service traffics, fully effectively utilizes wireless bandwidth.Through optimization method significantly (less than prior art 1/10), reduced requirement to communication controler, by forecast analysis, with the 8 8-digit microcontrollers measuring and calculating of AVR single-chip microcomputer, Full Featured host node needs the 16KB code, the subfunction node is few to the 8KB code.
Embodiment 3
The limb route point requires to add the backbone route node in the present embodiment, and initiate limb routing node requirement addressing, specifically may further comprise the steps:
The first step, the address is divided: the address of wireless network is divided into root node address, backbone route address and limb routing address, and wherein: the root node address is fixed as 0x0000; The backbone route address be fixed as 0 from the address, main address is along with the increase of backbone network length singly increases one successively; The limb routing address distributes the address according to address assignment bit field table;
When new node requires to add this network, carried out for second step;
When the limb routing node requires addressing, carried out for the 3rd step.
Described address assignment bit field table is: AddrAssignTable []={ 0x0100,0x0040,0x0010,0x0004,0x0001};
Described main address is the high eight-bit territory of node address;
Described from the address, be low eight bit fields of node address.
Second step, address assignment:
The backbone route node address that new node will add is 0x0300; Wherein 0x03 is the main address of node; When new node required to add backbone nodes, whether the limb routing node number that adds before the backbone route node is at first judged was less than the maximum number that oneself can hold, when being greater than or equal to maximum node number; The backbone route node sends a notice to the node that requires to add, and indicates it can't accept to join request; Otherwise; The backbone route node distributes the address according to the node that has added for the node that request adds, and the node that request adds in the present embodiment is first limb routing node, and this node is with second element in the address assignment bit field table; Be 0x0040; Carry out the logic OR computing with the address of itself and obtain this address of node, the gained result is 0x0340, so the address of new node is 0x0340.
The 3rd step, routing addressing:
It is 0x0200 that initiate limb routing node requires the destination address of addressing; Whether the main address that this node is at first judged destination address is greater than oneself main address; The main address 0x02 of destination address is less than the main address 0x03 of oneself here; So give the father node of oneself with data forwarding, the destination address that requires addressing in the present embodiment is a root node, this node is directly given data forwarding the father node of oneself; Requiring the destination address of addressing is 0x03C0, and the main address of the destination address here equals the main address of oneself, utilizes masked list, judges that 0x03C0 is the child node of father node, data forwarding is given the father node of oneself.
Node need not to preserve huge routing table in the present embodiment method, and neighbor list does not exist under the situation of node route list resource-constrained, can't set up the problem of new route on the path of request transmission.The method adopts the strategy of " sleep earlier and wake up earlier ", is guaranteeing to make the power consumption of node reach minimum under the highly reliable prerequisite.Remove complicated network configuration from, need only opened nodes at the scene, node will add network automatically, and the data transfer of going forward side by side does not need human intervention fully, realizes the self-configuring of network.
Claims (6)
1. the route addressing method based on the tree topology address assignment is characterized in that, may further comprise the steps:
The first step is divided into root node address, backbone route address and limb routing address with the address of wireless network, and wherein: the root node address is fixed as 0x0000; The backbone route address be fixed as 0 from the address, main address is along with the increase of backbone network length singly increases one successively; The limb routing address distributes the address according to address assignment bit field table;
When new node requires to add this network, carried out for second step;
When root node requires addressing, carried out for the 3rd step;
When the backbone route node requires addressing, carried out for the 4th step;
When the limb routing node requires addressing, carried out for the 5th step;
In second step, when new node required to add root node, root node carries out the root address assignment to be handled;
When new node required to add the backbone route address, the backbone route node carries out the backbone route address assignment to be handled;
When new node required to add the limb routing address, the limb routing node carried out limb routing address allocation process; Thereby realize the address assignment of new node;
In the 3rd step, when the destination address of root node addressing is root node, directly transfers to the upper strata and handle;
When the destination address of root node addressing is the backbone route address, data forwarding is given the backbone route child node of this root node;
When the destination address of root node addressing is the limb routing address,
(1) when destination address is the child node of root node, data forwarding is given the limb route child node of this root node;
(2) when destination address is the child node of backbone route in the network, data forwarding is given the backbone route child node of this root node;
In the 4th step, when the destination address of backbone route node addressing is root node, data forwarding is given the father node of this backbone route node;
When the destination address of backbone route node addressing is the backbone route node, and:
(1) when the main address of destination address during, data forwarding is given the backbone route child node of oneself greater than oneself main address;
(2) when the main address of destination address during, data forwarding is given the backbone route father node of oneself less than oneself main address;
When the destination address of backbone route node addressing is the limb routing node, and:
(1) when the main address of destination address during, data forwarding is given the backbone route child node of oneself greater than oneself main address;
(2) when the main address of destination address during, data forwarding is given the backbone route father node of oneself less than oneself main address;
(3) when the main address of destination address equals the main address of oneself, data forwarding is given the limb route child node of oneself;
In the 5th step, when the destination address of limb routing node addressing is root node, data forwarding is given the father node of this node;
When the destination address of limb routing node addressing is the backbone route node, data forwarding is given the father node of this node;
When the destination address of limb routing node addressing is the limb routing node, and:
(1) when the main address of destination address is greater than or less than the main address of oneself, data forwarding is given the father node of oneself;
(2) main address and the destination address that equals oneself when the main address of destination address is during for own child node, with the limb route child node of data forwarding to oneself; Otherwise, data forwarding is given the father node of oneself.
2. the route addressing method based on the tree topology address assignment according to claim 1 is characterized in that, the address assignment bit field table described in the first step is: AddrAssignTable []={ 0x0100,0x0040,0x0010,0x0004,0x0001}.
3. the route addressing method based on the tree topology address assignment according to claim 1 is characterized in that, the root address assignment described in second step is handled, and may further comprise the steps:
A, when the new node that requires to add is the backbone route node, and the number of the backbone route node that adds before hold less than root node backbone route node maximum number the time:
(1) when node require to add the backbone route node of root node for first, root node as its address, and sends to this node with the address with 0x0100;
(2) when node is the backbone route node of N requirement adding root node, root node adds the address of 1 back as new node with the main address of N-1 backbone route node that adds, and this address is sent to this node, N >=2;
B, when the new node that requires to add be the limb routing node, and the number of the limb routing node that adds before hold less than root node limb routing node maximum number the time:
(1) when node require to add the limb routing node of root node for first, root node carries out the logic OR computing with 0x0040 with the address that requires to add ingress self and obtains this address of node;
(2) when node be the limb routing node of N requirement adding root node, root node carries out the logic OR computing with the address of 0x0040 and N-1 adding limb route and obtains this address of node, N >=2.
4. the route addressing method based on the tree topology address assignment according to claim 1 is characterized in that, the backbone route address assignment described in second step is handled, and may further comprise the steps:
A, when the new node that requires to add is the backbone route node, this node adds 1 back with oneself main address and sends to as the address of new node and with the address and require the backbone route node that adds;
B, when the new node that requires to add be the limb routing node, and the number of the limb routing node that adds before hold less than this node limb routing node maximum number the time:
(1) when node require to add the limb routing node of this node for first, this node carries out the logic OR computing with 0x0040 and the address of itself and obtains this address of node;
(2) be the limb routing node of N this node of requirement adding when node, this node carries out the logic OR computing with the address of 0x0040 and N-1 limb route that adds and obtains this address of node, N >=2.
5. the route addressing method based on the tree topology address assignment according to claim 1 is characterized in that, the limb routing address allocation process described in second step may further comprise the steps:
A, when the new node that requires to add is the backbone route node, disregard;
B, when the new node that requires to add be the limb routing node, and the number of the limb routing node that adds before hold less than this node limb routing node maximum number the time:
(1) when new node requires to add the limb routing node of this root node for first; This root node carries out the logic OR computing with M element in the address assignment bit field table and the address of itself and obtains requiring to add the address of node, and wherein: M adds 1 for the network degree of depth of this root node itself;
(2) when new node be the limb routing node of N this root node of requirement adding; This root node is with M element in the address assignment bit field table; Carry out the logic OR computing with the address of N-1 limb route and obtain requiring to add the address of node; Wherein: M adds 1, N >=2 for the network degree of depth of this root node itself.
6. the route addressing method based on the tree topology address assignment according to claim 5 is characterized in that, the described network degree of depth; Be: the network degree of depth of root node and backbone route node is 0; The network degree of depth that adds the limb routing node of root node or backbone route node is 1, and the network degree of depth that adds the network degree of depth and be the limb routing node of 1 limb routing node is 2, by that analogy; The network degree of depth of limb node that adds the network degree of depth and be the node of H is H+1, H >=0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102677032A CN101895592B (en) | 2010-08-31 | 2010-08-31 | Routing and addressing method based on tree topology address assignment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102677032A CN101895592B (en) | 2010-08-31 | 2010-08-31 | Routing and addressing method based on tree topology address assignment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101895592A CN101895592A (en) | 2010-11-24 |
| CN101895592B true CN101895592B (en) | 2012-08-29 |
Family
ID=43104657
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102677032A Active CN101895592B (en) | 2010-08-31 | 2010-08-31 | Routing and addressing method based on tree topology address assignment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101895592B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102916891B (en) * | 2012-11-01 | 2017-04-12 | 奇点新源国际技术开发(北京)有限公司 | Routing method of communication network and routing node |
| CN102946450B (en) * | 2012-12-06 | 2015-06-24 | 中国科学技术大学苏州研究院 | Address assignment method for resource-constrained nodes in tree-shaped ubiquitous network |
| CN104869603B (en) * | 2015-05-08 | 2018-08-14 | 中山大学 | A kind of ZigBee method for routing suitable for wireless monitor control network |
| CN111835636B (en) * | 2019-06-02 | 2021-06-18 | 北京航空航天大学 | Network topology reconstruction method based on trunk path recursive expansion |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1341314A (en) * | 1999-02-26 | 2002-03-20 | 红石通信公司 | Network router search engine using compressed tree forwarding table |
| CN101296179A (en) * | 2007-10-29 | 2008-10-29 | 清华大学 | Method for IPv6 repeating vector IPv4/6 through inverse path |
| US20090285124A1 (en) * | 2008-05-13 | 2009-11-19 | Nortel Networks Limited | Wireless mesh network transit link topology optimization method and system |
-
2010
- 2010-08-31 CN CN2010102677032A patent/CN101895592B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1341314A (en) * | 1999-02-26 | 2002-03-20 | 红石通信公司 | Network router search engine using compressed tree forwarding table |
| CN101296179A (en) * | 2007-10-29 | 2008-10-29 | 清华大学 | Method for IPv6 repeating vector IPv4/6 through inverse path |
| US20090285124A1 (en) * | 2008-05-13 | 2009-11-19 | Nortel Networks Limited | Wireless mesh network transit link topology optimization method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101895592A (en) | 2010-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xu et al. | Improvement of LEACH protocol for WSN | |
| CN104378812B (en) | Farmland self-organizing network regenerative resource node difference topology control method | |
| CN103929823A (en) | Electric wireless private network channel access control method based on service classification | |
| Liu et al. | An approach of distributed joint optimization for cluster-based wireless sensor networks | |
| CN101895592B (en) | Routing and addressing method based on tree topology address assignment | |
| Gong et al. | A tree-based routing protocol in wireless sensor networks | |
| CN102238683A (en) | Routing information acquisition and transmission method for wireless mesh network | |
| CN103686855A (en) | Wireless sensor network data convergence method | |
| CN101466160B (en) | Method and system for saving energy of wireless netted network node | |
| Lande et al. | Energy efficient routing protocol for wireless sensor networks | |
| CN106714264B (en) | Energy-saving method and system for nodes of Internet of things | |
| Song et al. | Design of greenhouse control system based on wireless sensor networks and AVR microcontroller | |
| Liang | Energy-efficient, reliable cross-layer optimization routing protocol for wireless sensor network | |
| CN102025622B (en) | Method for realizing low-power consumption routing based on cognitive network | |
| Liu et al. | An improved algorithm based on LEACH protocol | |
| Zhang et al. | Design of wireless sensor network in intelligent distribution network | |
| Bernard et al. | Slot assignment over wireless sensor networks | |
| Chen et al. | An energy efficient clustering algorithm based on residual energy and concentration degree in wireless sensor networks | |
| CN103442403B (en) | The data route transmission control method of autonomous monitor network that wind energy turbine set is wireless | |
| Kaur et al. | Hybrid TB-LEACH Energy Based Multihop Protocol | |
| CN104053209A (en) | Topology control method of wireless sensor network for data collection | |
| Ai-hua | Research of clustering algorithms and its improvements in wireless sensor networks | |
| CN207166787U (en) | A kind of extensive ZigBee mixed-media network modules mixed-medias | |
| Li et al. | Cellular automata-based WSN energy saving technology | |
| CN102231903A (en) | Energy consumption management method for sensor nodes in wireless sensing 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 |