CN105050149A - Routing method for overcoming congestion of tree type Zigbee network - Google Patents
Routing method for overcoming congestion of tree type Zigbee network Download PDFInfo
- Publication number
- CN105050149A CN105050149A CN201510291350.2A CN201510291350A CN105050149A CN 105050149 A CN105050149 A CN 105050149A CN 201510291350 A CN201510291350 A CN 201510291350A CN 105050149 A CN105050149 A CN 105050149A
- Authority
- CN
- China
- Prior art keywords
- node
- neighbor
- network
- address
- data
- 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.)
- Pending
Links
Classifications
-
- 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
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a routing method for overcoming congestion of the tree type Zigbee network. The method comprises the following steps that a coordinator node establishes the Zigbee network, and other nodes establish neighbor tables thereof when accessing the Zigbee network; the tree type network is maintained; target address of a data frame is detected, and data is forwarded according to different target addresses; if a link to a father node is in the busy state always, information of the neighbor table is obtained, the neighbor table is inquired, a data request is sent to a neighbor node, the level of the neighbor node is higher than or equivalent to that of the present node, and the relation between the neighbor node and the present node is not a father-son relation; self information is added to a response frame again, and the node updates the neighbor table according to the response information; the neighbor node of the lowest load is selected for horizontal communication; and after the neighbor node receives the data frame, the data frame is forwarded continuously until that the data reaches the target node. When congestion occurs in the trunk, congestion can be effectively alleviated, time delay of the network is reduced, and the total energy consumption of the network is reduced.
Description
Technical field
The invention belongs to Zigbee tree network, relating to a kind of method for routing for solving Zigbee tree network congestion problems particularly.
Background technology
ZigBee technology is the short-distance wireless communication technology of a kind of low cost, low-power consumption and low data transmission rate.Zigbee network can support star-like, tree-shaped and mesh topology structure, and common network layer routing algorithm has tree-shaped route and AODVjr route, and the former is mainly used in tree network, and the latter is mainly used in grid type network.
In the tree-shaped routing algorithm of Zigbee network, node does not need to carry out route discovery, only need carry out the forwarding of data according to set membership, can avoid network loop and control routing cost.But also there is drawback, node can only communicate along tree, can only carry out when certain trunk occurs congested waiting for or abandon transmission, thus bring time delay and the packet loss of transfer of data; In addition, have very large data traffic compared with the trunk of heavy load, and the lighter trunk of load is in idle condition for a long time, causes the unbalanced of energy ezpenditure like this, reduces Network morals.
Zigbee network distributed address assignment mechanism scheme and routing algorithm general principle:
The principle of Zigbee tree-shaped route selection algorithm derives from its address allocation scheme, in distributed address allocation plan, each father node can obtain an address space, and the address of its child node obtains an address field or an address according to device type from this address space.The principle of its distributed address assignment mechanism mode is as follows:
First, in Zigbee network, determine network depth by telegon and allow the maximum node number of carry, wherein the network depth of telegon is 0, and its one-level child node network depth is 1, increases progressively successively.The maximum son node number of father node is represented with Cm, Rm represents the maximum number of child nodes of router, Lm represents the depth capacity of network, Cskip (d) represents that network depth be the father node of d is the address space that its child node is distributed, and the network address and the network depth of initialization telegon are 0.
Then, according to formula (1) and formula (2),
If
,
(1)
Otherwise,
(2)
So K child node is the father node A of d by the degree of depth
pallocation address calculates as formula (3) and formula (4),
When
(3)
When
(4)
Finally, father node according to such scheme to child node allocation address, until all address block of father node distributes and no longer accepts new node application.
The tree-shaped routing algorithm general principle of Zigbee network is as follows:
(1) when a node needs to forward information to destination node, first rebroadcast nodes needs to judge whether destination node is its descendant nodes.If the degree of depth of forward node is d, address is A, if meet formula (5), determines that destination node is its descendant nodes.
(5)
(2) if do not meet formula (5), then the father node to forward node transmits, and data carry out the judgement of publicity (5) again after arriving father node.
(3) as after determining that destination node is the descendant nodes of forward node, then the address of carrying out down hop judges.If destination node is the child node of forward node, so the address of down hop is exactly destination address.If destination node is the non-child node of its descendant, next hop address is calculated by formula (6).
(6)
(4) after the next hop address of node of determining to achieve the goal, this node can upgrade its routing table, in communication so afterwards, does not just need to determine next hop address by calculating at every turn, but can directly be obtained by table of query and routing.
Existing modified model tree-shaped routing algorithm prioritization scheme can be divided into two classes substantially, and a class is the mode by reducing amount of information, namely reduces the data volume that circulates in tree network as much as possible to reach the generation reducing congestion situation as far as possible.The minimizing of data volume is mainly through shortening data packet length and by increasing information that routing table stores to reduce route discovery number of times etc., and such scheme to improve significantly effect for the project of certain specific scale, but is unfavorable for expansion and the upgrading of network.Another kind of prioritization scheme mainly reaches balancing energy by changing network configuration pockety.For example set up the mode of Dynamic Cluster head, namely by certain algorithm, change bunch head of trunk as required, be equivalent to reset network configuration.Such scheme routing cost is comparatively large, and algorithm is complicated.
Summary of the invention
The trunk load Distribution that may occur for tree-shaped routing algorithm original in Zigbee network is unbalanced cause congested, thus bring the problem of transfer of data time delay or packet loss, the present invention seeks to: a kind of method for routing for solving Zigbee tree network congestion problems is provided, the method on original tree-shaped routing algorithm basis by setting up the mode in lateral communications path, make when trunk occurs congested, the neighbor node that node can adopt load lighter carries out forwarding data, can effectively reduce transfer of data time delay, solve the phenomenon of network energy skewness weighing apparatus, thus prolongation network lifecycle.
Technical scheme of the present invention is:
For solving a method for routing for Zigbee tree network congestion problems, it is characterized in that, comprising the steps:
(1) coordinator node sets up Zigbee network, sets up the neighbor table of self when other nodes add Zigbee network respectively;
(2) tree network maintenance phase, each node is by all neighbor nodes mutual neighbor table information of Hello maintenance packet with self;
(3) after node receives data, check the destination address of this Frame, if destination address is the Self address of present node, then data are given the father node of present node; Otherwise enter step (4);
(4) if destination address is the descendant nodes address of present node, then select next hop address by original Zigbee network tree-shaped routing algorithm, forward this data; Otherwise enter step (5);
(5) present node forwards the data to its father node, if communication smoothly, will repeat step (3), (4) until data arrive destination node; If be in busy state all the time to the link of father node, then enter step (6);
(6) neighbor table information that obtains according to step (2) of present node, by inquiry neighbor table, to the neighbor node transmission request of data of the grade non-set membership high or identical than oneself, and waits for the response of neighbor node;
(7) neighbor node giving response again adds the information of self in acknowledgement frame, and the node sending request of data upgrades neighbor table according to response message; By judging load, the lightest neighbor node of load is selected to carry out lateral communications;
(8) after neighbor node receives Frame, return step (3) and continue forwarding data frame, until data arrive destination node.
Preferably, in described step (2), each node is connected by hello packet maintaining network and with self all neighbor node interactive information, comprises the steps:
(21) all nodes in tree network periodically send hello packet to the node in oneself neighbor table, add the nodal information of self in the load of hello packet;
(22) receive the Node extraction message load information of hello packet and be kept in the neighbor table of oneself, self information being added in acknowledgement frame load simultaneously, turn back to sending node;
(23) timer that hello packet is corresponding to neighbor node in neighbor table is relevant, in timing, receive response, then illustrate and connect effectively, can upgrade neighbor table; Otherwise, then illustrate that link disconnects, and can not upgrade neighbor table.
Preferably, in described step (4), to be the determination methods of the descendant nodes address of present node be destination address: set the network depth of present node as d, address is A, and network depth is the peer distribution of d is C to the address offset amount of child node
skip(d-1), if destination address D meets following formula,
, then destination address is the descendant nodes address of present node; Otherwise destination address is not the descendant nodes address of present node; Next hop address in described step (4)
computing formula be:
Wherein,
represent the address space that the node that network depth is d has.
Preferably, in described step (7), the system of selection for the neighbor node of lateral communications is as follows:
(71) if neighbor node grade is identical with the node of request lateral communications, then the load of the load of the father node of neighbor node and the father node of requesting node is compared, choose the less conduct of load neighbor node to be selected;
(72) if neighbor node grade is higher than the node of request lateral communications, then the father node load of the load of neighbor node and requesting node is compared, choose the less conduct of load neighbor node to be selected;
(73) if neighbor node grade is lower than the node of request lateral communications, then the neighbor node to be selected as lateral communications is abandoned;
(74) in neighbor node to be selected, formula is passed through
choose and there is minimum D
tthe node of parameter is as the neighbor node of lateral communications; Wherein, E
it () represents the real-time capacity value of node, obtained, parameter D by the acknowledgement frame of neighbor node
tbe used for representing transfer of data time delay.
Advantage of the present invention is:
1. pair Zigbee tree network, by setting up the mode of lateral connection on original tree-shaped routing algorithm basis, allow there is in tree network non-set membership adjacent node between can communicate, make trunk when occurring congested, can alleviate congestion situation effectively, reduce network delay.
2., by setting up the mode of lateral connection, make the total power consumption of network less, simultaneously also can the data volume of balanced different trunk, thus the energy ezpenditure of balancing network, extend network lifecycle.
Accompanying drawing explanation
Below in conjunction with drawings and Examples, the invention will be further described:
Fig. 1 is that the present invention is for solving the Zigbee network topological structure schematic diagram of the method for routing of Zigbee tree network congestion problems;
Fig. 2 is that the present invention is for solving the hello packet information structure diagram of the method for routing of Zigbee tree network congestion problems;
Fig. 3 is route flow chart when to be the present invention do not occur congested for the trunk of the method for routing solving Zigbee tree network congestion problems;
Fig. 4 is that the present invention is for solving the lateral connection route flow chart of the method for routing of Zigbee tree network congestion problems.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with embodiment also with reference to accompanying drawing, the present invention is described in more detail.Should be appreciated that, these describe just exemplary, and do not really want to limit the scope of the invention.In addition, in the following description, the description to known features and technology is eliminated, to avoid unnecessarily obscuring concept of the present invention.
Embodiment:
As shown in Figure 1, first initiated to set up a Zigbee network by telegon A, by distributed address assignment mechanism mechanism, other nodes add network successively, and obtain the network address.In the tree network of Fig. 1, node C, J are in the x level of network, and node D, G of being in x+1 level are the child nodes of node C, and node L, M are the child nodes of node J, and the node of x+2 level has E, M and H.
After tree network is formed, obtained the information of neighbor node between node by hello packet, the data format of hello packet as shown in Figure 2.For node G, node G sends hello packet to all nodes in neighbor table, comprises load information 3, the network depth x+1 of node G, the network address etc. in message.After node C, D, E, M, L, J and H receive the hello packet from node D, be stored in message in neighbor table about the information of node D, and add the information of oneself to Hello response message, be sent back to node G.Like this, node G just has the information of its all neighbor node.
Data carry out the flow process that forwards as shown in Figure 3.After supposing that to receive destination address be the data of node E as node C, according to judgment formula
obtain, node E is the descendant nodes of node C, and then carries out the judgement of next hop address.Pass through formula
the address that can calculate down hop is the address of node G, and node G is not destination address, so first forward the data to node G, then carries out the judgement of above-mentioned same method, makes data finally arrive node E.
Another kind of situation, when node G has data will be forwarded to telegon A, passes through judgment formula
obtain, telegon A is not the descendant nodes of node G, so data will be sent to the father node of node G.And in the process sending data to node G, finding that wireless link is always occupied, request is not responded all the time.At this moment, data communicate adopting the mode setting up lateral connection.
As shown in Figure 4, concrete steps are as follows for the implementation procedure of lateral connection communication:
Step a: node G according to the neighbor table information obtained, and by inquiry neighbor table, to the neighbor node transmission request of data of the grade non-set membership high or identical than oneself, and waits for the response of neighbor node.In FIG, node L, H and J is only had to be the neighbor nodes with non-set membership of node G, so they can receive request of data.
Step b: neighbor node L, H and J add self information in acknowledgement frame, comprises their load and the load of their father nodes, real-time power E
nthe information such as 2 power Reciprocals sums addresses.
Step c: after node G receives acknowledgement frame, upgrades about the information of node L, H and J in neighbor table according to response message;
Steps d: first obtain node L grade identical with node G, compare discovery, the load that the father node of node L and node G has respectively is 4 and 5, so, can as the neighbor node of communication to be selected; Then the grade obtaining node H is lower than the grade of node G, so abandon H as neighbor node to be selected; Obtain node J grade higher than node G, and its load is also low than the father node load of G, so also as neighbor node to be selected;
Step e: in neighbor node J and L to be selected, by comparing parameter real-time power E
i2 powers reciprocal, have smaller value using the neighbor node as lateral communications, be assumed to be node J;
Step f: data, by lateral transport, after arriving the node J on another trunk, continue to select down hop route according to the address determination methods of tree-shaped route.
Should be understood that, above-mentioned embodiment of the present invention only for exemplary illustration or explain principle of the present invention, and is not construed as limiting the invention.Therefore, any amendment made when without departing from the spirit and scope of the present invention, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.In addition, claims of the present invention be intended to contain fall into claims scope and border or this scope and border equivalents in whole change and modification.
Claims (4)
1. for solving a method for routing for Zigbee tree network congestion problems, it is characterized in that, comprising the steps:
(1) coordinator node sets up Zigbee network, sets up the neighbor table of self when other nodes add Zigbee network respectively;
(2) tree network maintenance phase, each node is by all neighbor nodes mutual neighbor table information of Hello maintenance packet with self;
(3) after node receives data, check the destination address of this Frame, if destination address is the Self address of present node, then data are given the father node of present node; Otherwise enter step (4);
(4) if destination address is the descendant nodes address of present node, then select next hop address by original Zigbee network tree-shaped routing algorithm, forward this data; Otherwise enter step (5);
(5) present node forwards the data to its father node, if communication smoothly, will repeat step (3), (4) until data arrive destination node; If be in busy state all the time to the link of father node, then enter step (6);
(6) neighbor table information that obtains according to step (2) of present node, by inquiry neighbor table, to the neighbor node transmission request of data of the grade non-set membership high or identical than oneself, and waits for the response of neighbor node;
(7) neighbor node giving response again adds the information of self in acknowledgement frame, and the node sending request of data upgrades neighbor table according to response message; By judging load, the lightest neighbor node of load is selected to carry out lateral communications;
(8) after neighbor node receives Frame, return step (3) and continue forwarding data frame, until data arrive destination node.
2. the method for routing for solving Zigbee tree network congestion problems according to claim 1, it is characterized in that, in described step (2), each node is connected by hello packet maintaining network and with self all neighbor node interactive information, comprises the steps:
(21) all nodes in tree network periodically send hello packet to the node in oneself neighbor table, add the nodal information of self in the load of hello packet;
(22) receive the Node extraction message load information of hello packet and be kept in the neighbor table of oneself, self information being added in acknowledgement frame load simultaneously, turn back to sending node;
(23) timer that hello packet is corresponding to neighbor node in neighbor table is relevant, in timing, receive response, then illustrate and connect effectively, can upgrade neighbor table; Otherwise, then illustrate that link disconnects, and can not upgrade neighbor table.
3. the method for routing for solving Zigbee tree network congestion problems according to claim 1, it is characterized in that, in described step (4), destination address is the determination methods of the descendant nodes address of present node: set the network depth of present node as d, address is A, and network depth is the peer distribution of d is C to the address offset amount of child node
skip(d-1), if destination address D meets following formula,
, then destination address is the descendant nodes address of present node; Otherwise destination address is not the descendant nodes address of present node; Next hop address in described step (4)
computing formula be:
Wherein,
represent the address space that the node that network depth is d has.
4. the method for routing for solving Zigbee tree network congestion problems according to claim 1, is characterized in that, in described step (7), the system of selection for the neighbor node of lateral communications is as follows:
(71) if neighbor node grade is identical with the node of request lateral communications, then the load of the load of the father node of neighbor node and the father node of requesting node is compared, choose the less conduct of load neighbor node to be selected;
(72) if neighbor node grade is higher than the node of request lateral communications, then the father node load of the load of neighbor node and requesting node is compared, choose the less conduct of load neighbor node to be selected;
(73) if neighbor node grade is lower than the node of request lateral communications, then the neighbor node to be selected as lateral communications is abandoned;
(74) in neighbor node to be selected, formula is passed through
choose and there is minimum D
tthe node of parameter is as the neighbor node of lateral communications; Wherein, E
it () represents the real-time capacity value of node, obtained, parameter D by the acknowledgement frame of neighbor node
tbe used for representing transfer of data time delay.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510291350.2A CN105050149A (en) | 2015-06-01 | 2015-06-01 | Routing method for overcoming congestion of tree type Zigbee network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510291350.2A CN105050149A (en) | 2015-06-01 | 2015-06-01 | Routing method for overcoming congestion of tree type Zigbee network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105050149A true CN105050149A (en) | 2015-11-11 |
Family
ID=54456243
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510291350.2A Pending CN105050149A (en) | 2015-06-01 | 2015-06-01 | Routing method for overcoming congestion of tree type Zigbee network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105050149A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106851764A (en) * | 2016-12-05 | 2017-06-13 | 上海斐讯数据通信技术有限公司 | A kind of short data message sending method and device based on Zigbee network |
| CN106991294A (en) * | 2017-06-07 | 2017-07-28 | 深圳市创艺工业技术有限公司 | Telemedicine monitoring system |
| CN107332777A (en) * | 2017-06-22 | 2017-11-07 | 北京中宸泓昌科技有限公司 | A kind of low-voltage power line bandwidth carrier constructing communication network method based on tree |
| CN107566264A (en) * | 2017-09-28 | 2018-01-09 | 北京千丁互联科技有限公司 | A kind of means of communication based on tree network, node and communication system |
| CN112055393A (en) * | 2020-08-03 | 2020-12-08 | 博流智能科技（南京）有限公司 | Zigbee large-scale routing method and system based on AI optimization |
| CN116156593A (en) * | 2023-02-01 | 2023-05-23 | 深圳市华普微电子股份有限公司 | Wireless ad hoc network method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102664716A (en) * | 2012-04-13 | 2012-09-12 | 南通大学 | Wireless sensor network data collection method applied to real-time monitoring |
| CN102857975A (en) * | 2012-10-19 | 2013-01-02 | 南京大学 | Load balance CTP (Collection Tree Protocol) routing protocol |
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
| CN104661250A (en) * | 2015-02-03 | 2015-05-27 | 河海大学 | Route-replacement self-healing method for state monitoring system of wireless sensor of wind turbine unit |
-
2015
- 2015-06-01 CN CN201510291350.2A patent/CN105050149A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102664716A (en) * | 2012-04-13 | 2012-09-12 | 南通大学 | Wireless sensor network data collection method applied to real-time monitoring |
| CN102857975A (en) * | 2012-10-19 | 2013-01-02 | 南京大学 | Load balance CTP (Collection Tree Protocol) routing protocol |
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
| CN104661250A (en) * | 2015-02-03 | 2015-05-27 | 河海大学 | Route-replacement self-healing method for state monitoring system of wireless sensor of wind turbine unit |
Non-Patent Citations (2)
| Title |
|---|
| JING ZHAO ET AL.: "Load Migrating for the Hot Spots in Wireless Sensor Networks using CTP", 《2011 SEVENTH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS》 * |
| 李刚等: "一种改进的ZigBee网络Cluster_Tree路由算法", 《测控技术》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106851764A (en) * | 2016-12-05 | 2017-06-13 | 上海斐讯数据通信技术有限公司 | A kind of short data message sending method and device based on Zigbee network |
| CN106851764B (en) * | 2016-12-05 | 2020-12-22 | 台州智奥通信设备有限公司 | Short data message sending method and device based on Zigbee network |
| CN106991294A (en) * | 2017-06-07 | 2017-07-28 | 深圳市创艺工业技术有限公司 | Telemedicine monitoring system |
| CN107332777A (en) * | 2017-06-22 | 2017-11-07 | 北京中宸泓昌科技有限公司 | A kind of low-voltage power line bandwidth carrier constructing communication network method based on tree |
| CN107566264A (en) * | 2017-09-28 | 2018-01-09 | 北京千丁互联科技有限公司 | A kind of means of communication based on tree network, node and communication system |
| CN107566264B (en) * | 2017-09-28 | 2019-09-20 | 北京千丁互联科技有限公司 | A kind of means of communication based on tree network, node and communication system |
| CN112055393A (en) * | 2020-08-03 | 2020-12-08 | 博流智能科技（南京）有限公司 | Zigbee large-scale routing method and system based on AI optimization |
| CN116156593A (en) * | 2023-02-01 | 2023-05-23 | 深圳市华普微电子股份有限公司 | Wireless ad hoc network method |
| CN116156593B (en) * | 2023-02-01 | 2024-03-26 | 深圳市华普微电子股份有限公司 | Wireless ad hoc network method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105050149A (en) | Routing method for overcoming congestion of tree type Zigbee network | |
| Ho et al. | A ladder diffusion algorithm using ant colony optimization for wireless sensor networks | |
| CN107333312B (en) | Route selection method in opportunistic network | |
| CN102291448B (en) | Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network | |
| CN101562861B (en) | Cross-layer and bi-directional routing method based on hop number and energy in wireless sensor network | |
| CN102149138B (en) | Method for balancing gateway load of wireless Mesh network | |
| CN105515987B (en) | A kind of mapping method based on SDN framework Virtual optical-fiber networks | |
| CN101600227B (en) | Distributed network routing method and routing device | |
| CN104168620A (en) | Route establishing method in wireless multi-hop backhaul network | |
| CN102055675B (en) | Multipath routing distribution method based on load equilibrium | |
| CN103327564A (en) | Wireless sensor network route method based on ant colony algorithm | |
| CN103491590B (en) | A kind of implementation method of wireless sensor network route of future generation | |
| CN104469879B (en) | A kind of dynamic k value cluster routing methods | |
| CN104080112A (en) | Method for improving service reliability of wireless self-organizing network | |
| CN106161270B (en) | A kind of network deployment method | |
| CN103476086A (en) | Dynamic multi-path AODV routing method based on node congestion degree prediction | |
| CN101127714A (en) | A route management method and device for wireless mesh network | |
| CN103974365A (en) | Ad Hoc mobile network route restoring method | |
| Jia et al. | A BUS‐aided RSU access scheme based on SDN and evolutionary game in the Internet of Vehicle | |
| CN108462983A (en) | Based on the Communication of Muti-robot System network-building method for improving ant colony AODV agreements | |
| CN107864092A (en) | A kind of cloud content distribution method, device based on multicasting technology | |
| CN104284388A (en) | Mobile Ad Hoc network independent clustering and routing method | |
| CN109803342A (en) | A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission | |
| Devarajan et al. | An enhanced cluster gateway switch routing protocol (ECGSR) for congestion control using AODV algorithm in MANET | |
| Pham et al. | Geographical awareness hybrid routing protocol in mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151111 |