CN101299708A - Dynamic broadcast routing method - Google Patents
Dynamic broadcast routing method Download PDFInfo
- Publication number
- CN101299708A CN101299708A CNA2007100461900A CN200710046190A CN101299708A CN 101299708 A CN101299708 A CN 101299708A CN A2007100461900 A CNA2007100461900 A CN A2007100461900A CN 200710046190 A CN200710046190 A CN 200710046190A CN 101299708 A CN101299708 A CN 101299708A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- root
- tree
- father
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a route diffusion method for dynamically generating expansion tree in the network, specifically suitable for the scene of broadcast routing in an Ad hoc Network or a Wireless Mesh Network. The invention takes route cost and hop together as criterion to select an optimum route, and every node in the network uses the flooding of the call packet to establish, update and delete the corresponding node in the broadcast tree. The method includes: broadcast tree generation, wherein, network nodes select and determine father nodes according to the hop of packets for reaching interactive root nodes; broadcast tree updating, in the broadcast tree updating process, according to the setting triggering criterion, when reaching the corresponding triggering condition, the broadcast tree updates according to the broadcast tree updating method; and broadcast packet transmit-receive. The route diffusion method for dynamically generating expansion tree in the network adopted by the invention can realize the effective spreading of the broadcast packet, and effectively inhibit the generation of broadcast storm and routing self-loop; the method has relative simple and practical protocol, application in micro scale networking, and fast network convergence rate.
Description
Technical field
The present invention relates to a kind of method of in route network, broadcasting route.Be particularly useful in Adhoc (English full name Ad hoc Network is hereinafter to be referred as Ad hoc) or MESH (English full name WirelessMesh Network is hereinafter to be referred as MESH) network, broadcasting the scene of route.
Background technology
Ad hoc be a kind ofly move, the network system of multi-hop, self-healing.Each network node in this network can be determined its different role in network by certain criterion (for example information such as transmitting power, remaining battery), thereby under the prerequisite of proper communication, realizes the function of routing forwarding.
Because the node in the Ad hoc network has possessed the characteristic that moves and has not relied on the fixing network equipment, thereby its physical location is unfixing, routing relation is unfixing yet, can proper communication in order to make between the node still, therefore need certain routing mechanism to finish the reconstruction and the reparation of routing relation, promptly the node in the network possesses self-healing ability.In addition, owing to from the angle of system design, do not limit for network size, so node communicates by letter with internodal, very possible employing be that multi-hop can reach but not direct visible mode.
Owing to possessed above-mentioned characteristic, Ad hoc network is compared the most tangible difference with respect to other network system commonly used at present and is that its network architecture is no center mode, and promptly internodal communication need not to control and transmit by certain stationary nodes.Make the ability that Ad hoc network possesses better self-healing and prevents Single Point of Faliure like this.In addition, because Ad hoc network possessed radio characteristics, so build complexity the early stage of network and cost has more inherent advantage with respect to common cable network.
Though Ad hoc network has many advantages with respect to legacy network,, when realizing, still can run into many problems because Ad hoc network is a network system wireless and that nothing is planned in advance.Broadcast storm is one of them.
In cable network because the transmission of signal can be limited by physical media, therefore can adopt physically isolation and the formulation of broadcast strategy limit the influence of broadcasting packet for offered load.Yet, in wireless network, because can't be for internodal signal transmission employing isolation physically, therefore need design and adopt certain method to prevent broadcasting packet constantly flooding in network, thereby reduce the broadcasting packet influence that normal operation brings for network, promptly prevent the generation of network storm.
By top analysis, can see for Ad hoc network system how effectively reducing broadcast storm, for network stabilization, effective, normal operation crucial effects is arranged.Yet the present Routing Protocol that is used for Ad hoc network mostly mainly is the discussion at clean culture and multicast route, and for the not relevant description of broadcasting route.
Summary of the invention
The present invention is intended to solve the problem that the broadcasting route is brought in Ad hoc and the similar network system, thereby effectively reduces the broadcast storm influence that normal operation brings to network.
In order effectively to solve broadcast storm and the route problem from ring, the present invention has adopted the method that dynamically generates the expansion tree in network.
Basic assumption is as follows:
1) root node of broadcasting tree has the node that is connected to serve as by those and fixed network.And each broadcasting tree has and can only have a root node.
2) respective nodes of broadcasting in the tree is set up, upgrades, deleted to each node in the network by calling out flooding of message.
The performed method of the present invention comprises following basic step:
Step 2, broadcast tree updating in the broadcast tree updating process, according to the triggering criterion of setting, when arriving corresponding triggering condition, is carried out the broadcast tree updating method, upgrades;
Step 3, the broadcasting packet transmitting-receiving.
In the described step 1:
1.1) if network node finds oneself to be root node, then need not to select father node.But the calling message that need other nodes in specified network floods, the jumping figure that wherein is set to root node is 0, and cost (the path cost value is a criterion among the present invention, hereinafter to be referred as cost) value is maximum;
1.2) if network node finds it oneself is not root node, and each network node calls out jumping figure and the cost value that message interaction arrives root node separately by sending, and this node is selected cost value maximum, and the node that arrives root node jumping figure minimum is as father node;
1.3) if non-root node network node has been selected be over father node and root node, then need be in calling out message father node and the root node and to jumping figure and the cost value of root node of statement under own;
In the described step 2, specifically comprise following two steps:
2.1) the broadcast tree updating triggering, comprise respectively: the fast triggering and triggering slowly:
Trigger soon when one of following situation occurs and take place: change has taken place in the root node of A father node correspondence; The B father node is empty; C disconnects by the connection that the calling message detects father node;
Slowly trigger when one of following situation occurs and take place: the A network node just starts; The B network topology is stable, each network node regular update broadcasting tree information separately; C has just experienced once and has triggered soon, and does not choose suitable father node;
2.2) broadcast tree updating, this method will select a non-child node that has arrival root node optimal path as new father node.Detailed process is described below:
2.2.1) each neighbor node of polling present node;
2.2.2) if this neighbor node be the child node of present node then skip;
2.2.3) in triggering (network topology is stable) slowly, if this node to the jumping figure of root node more than or equal to network diameter, then skip;
For triggering (just carried out a father node gravity treatment, and do not chosen father node) slowly, if this node is then skipped to the jumping figure of the root node jumping figure more than or equal to the last arrival of this node root node;
For fast triggering, if this node be non-father node and to the jumping figure of root node more than or equal to the jumping figure of present node to root node, then skip;
2.2.4) if this neighbor node does not have corresponding root node, then skip;
2.2.5) if this neighbor node is not a root node, then cost from this neighbor node to root node and present node are selected minimum value to the cost of neighbor node.
2.2.6) compare this node by the cost value of this neighbor node arrival root node and the maximum cost value that obtains through polling.
2.2.7) if it is the father node of present node that the cost value that has just calculated, is then selected this neighbor node than the cost value that originally calculated bigger (excellent), and present node is updated to the cost value that has just calculated to the cost value of root node.
2.2.8) if the cost value that has just calculated is the same big with the cost value that originally calculated, then select a neighbor node that has minimum hop count to root node as father node, and upgrade the cost value.
2.2.9) if the father node that obtains by polling is compared with original father node variation has taken place, broadcast ﹠ call message immediately then.
2.2.10) if the cost value to the corresponding root node of father node that obtains by polling is compared with the analog value that originally calculated variation has taken place, the originally routing relation of foundation, broadcast ﹠ call message then of deletion immediately then.
2.2.11) if do not choose suitable father node, then the last jumping figure value that arrives root node of this node is added one.
In step 3, the broadcasting packet transmitting-receiving specifically comprises broadcast downstream message and broadcast upstream message:
The broadcast downstream message comprises following two steps: A receives broadcasting packet on network interface, checks that message is whether from the father node of this node, if not then directly abandoning.B judges whether this node also exists child node, if exist then message is transmitted to its child node.
The broadcast upstream message comprises following three steps: A receives broadcasting packet on network interface, checks that message is whether from the child node of this node; B is if not then directly abandoning; C judges simultaneously whether this node also exists other child node if then message is transmitted to father node, if exist, then this message is sent to all the other child nodes.
The present invention adopts the method for expansion tree effectively to solve the problem of broadcasting route, selects to adopt path cost value (cost) and jumping figure value (hop) together as the foundation of selecting optimal path in the present invention.
Description of drawings
Fig. 1 is that dynamic routing method broadcasting tree generates basic flow sheet
Fig. 2 is a dynamic routing method broadcast downstream message basic flow sheet
Fig. 3 is a dynamic routing method broadcast upstream message basic flow sheet
Fig. 4 is the embodiment network node schematic diagram of dynamic routing method
Embodiment
Below in conjunction with accompanying drawing the inventive method is described further.
The wireless self-organization network of being formed with A, B, four network nodes of C, D among Fig. 4 is an example, supposes that its neighborhood is as follows:
● B is the neighbor node of A
● C, D are the neighbor node of B
● B, D are the neighbor node of C
● B, C are the neighbor node of D
Setting node A is the root node of a broadcasting tree, and its jumping figure is set is 0, and cost value is a maximum, and the Node B in this network, C, the D calling message that floods; Because of Node B to the jumping figure minimum of root node A, the cost maximum, setting the B node is the father node of node C, D, and node C, the D jumping figure and the cost value of declaring father node B and root node A in calling out message.
1) network node B receives the broadcasting packet from father node A, because of node C, D are the child node of Node B, then the broadcasting packet that it is received is transmitted to child node C, D, and the broadcasting packet that receives as Node B is from child node C, D, then directly abandon, this is the broadcast downstream message.Node B receives the broadcasting packet from its child node C, D, again it is transmitted to father node, the broadcasting packet that receives as Node B is from father node A, then directly abandon, judge simultaneously whether this node also exists other child node, if exist, then this message is sent to all the other child nodes, this is the broadcast upstream message.
2) broadcasting packet transmitting-receiving finishes, and through polling, receives broadcasting packet from node C or D as Node B, because of node C and node D are the child node of Node B, does not then carry out the renewal of broadcasting packet;
3) receive broadcasting packet as node D from node C, because of its to jumping figure of node C greater than network diameter, then do not carry out the renewal of broadcasting packet;
4) arrive the jumping figure of the jumping figure of its father node A as node C or D, then do not carry out the renewal of broadcasting packet greater than last time arrival father node B;
5) contrast node C arrives the cost value of node A and Node B, selects the big node of cost value as its father node, carries out the renewal of new broadcasting packet then; It is the same big with the cost value of Node B to arrive node A as node C, and the Node B of then selecting to have minimum hop count is carried out the renewal of new broadcasting packet then as its father node;
6) as node C or D deserved father node is varied to node A by Node B, has then carried out the renewal of new broadcasting packet immediately;
7) variation has taken place with the analog value that originally calculated in the cost of the corresponding root node A that obtains as Node B, and then the original routing relation of setting up of deletion is immediately carried out the transmitting-receiving of new broadcasting packet then;
8) after polling finishes, the jumping figure value of root node A is added one, proceed the transmitting-receiving of broadcasting packet.
More than set forth method of the present invention with specific embodiment, but said method of the present invention is not limited to cited embodiment.
Claims (18)
1. a dynamic broadcast routing method promptly dynamically generates the method that expansion is set in network.It is characterized in that this method adopts path cost value (cost) and jumping figure value (hop) to select optimal path as foundation together, said method comprising the steps of:
Step 1, the broadcasting tree generates, and network node is selected and definite father node according to calling out the message jumping figure of reaching interactive root nodes separately;
Step 2, broadcast tree updating in the broadcast tree updating process, according to the triggering criterion of setting, when arriving corresponding triggering condition, according to the broadcast tree updating method, is upgraded;
Step 3, the broadcasting packet transmitting-receiving.
2. dynamic broadcast routing method according to claim 1 is characterized in that, the root node of broadcasting tree is by having the node that is connected to serve as with fixed network in the described method, and each broadcasting tree has a root node.
3. dynamic broadcast routing method according to claim 1 is characterized in that, the respective nodes of broadcasting in the tree is set up, upgrades, deleted to each node in the network of described method by calling out flooding of message.
4. dynamic broadcast routing method according to claim 1 is characterized in that, if network node finds oneself to be root node in the described step 1, then need not to select father node.But the calling message that need other nodes in specified network floods, the jumping figure that wherein is set to root node is 0, the cost value is a maximum.
5. dynamic broadcast routing method according to claim 1, it is characterized in that, if network node finds it oneself is not root node in the described step 1, and each network node is called out jumping figure and the cost value that message interaction arrives root node separately by sending, this node selects the cost value maximum, and the node that arrives root node jumping figure minimum is as father node.
6. dynamic broadcast routing method according to claim 1, it is characterized in that, if non-network root has been selected be over father node and root node in the described step 1, then need be in calling out message father node and the root node and to jumping figure and the cost value of root node of statement under own.
7. dynamic broadcast routing method according to claim 1 is characterized in that, the renewal of described step 2 kind of broadcasting tree comprises two triggering criterion:
A) the fast triggering;
B) trigger slowly.
8. dynamic broadcast routing method according to claim 7 is characterized in that, the situation that described fast triggering criterion takes place is:
A) change has taken place in the root node of father node correspondence;
B) father node is empty;
C) connection that detects father node by the root node message disconnects.
9. dynamic broadcast routing method according to claim 7 is characterized in that, the situation that described slow triggering criterion takes place is:
A) network node just starts;
B) network topology is stable, each network node regular update broadcasting tree information separately;
C) just experience once triggering soon, and do not chosen suitable father node.
10. dynamic broadcast routing method according to claim 1 is characterized in that, the update method of broadcasting tree is in the described step 2:
A) each neighbor node of polling present node;
B) if this neighbor node be the child node of present node then skip.
11., it is characterized in that the update method of broadcasting tree is in the described step 2 according to the described dynamic broadcast routing method of claim 1:
A) each neighbor node of polling present node;
B) for triggering (network topology is stable) slowly, if this node to the jumping figure of root node more than or equal to network diameter, then skip;
For triggering (just carried out a father node gravity treatment, and do not chosen father node) slowly, if this node is then skipped to the jumping figure of the root node jumping figure more than or equal to the last arrival of this node root node;
For fast triggering, if this node be non-father node and to the jumping figure of root node more than or equal to the jumping figure of present node to root node, then skip.
12. dynamic broadcast routing method according to claim 1 is characterized in that, the update method of broadcasting tree is in the described step 2:
A) each neighbor node of polling present node;
B) if this neighbor node does not have corresponding root node, then skip.
13. dynamic broadcast routing method according to claim 1 is characterized in that, the update method of broadcasting tree is in the described step 2:
A) each neighbor node of polling present node;
B) if this neighbor node is not a root node, then cost from this neighbor node to root node and present node are selected minimum value to the cost of neighbor node;
C) relatively this node arrives the cost value of root node and the maximum cost value that obtains through polling by this neighbor node;
D) if it is the father node of present node that the cost value that has just calculated, is then selected this neighbor node than the cost value that originally calculated bigger (excellent), and present node is updated to the cost value that has just calculated to the cost value of root node;
E), then select a neighbor node that has minimum hop count to root node as father node, and upgrade the cost value if the cost value that has just calculated is the same big with the cost value that originally calculated.
14. dynamic broadcast routing method according to claim 1 is characterized in that, the update method of broadcasting tree is in the described step 2:
A) each neighbor node of polling present node;
B) if the father node that obtains by polling is compared with original father node variation has taken place, then broadcast ﹠ call message immediately.
15. dynamic broadcast routing method according to claim 1 is characterized in that, the update method of broadcasting tree is in the described step 2:
A) each neighbor node of polling present node;
B) if the cost value to the corresponding root node of father node that obtains by polling is compared with the analog value that originally calculated variation has taken place, then originally the routing relation of foundation, broadcast ﹠ call message then of deletion immediately.
16. dynamic broadcast routing method according to claim 1 is characterized in that, the update method of broadcasting tree is in the described step 2:
A) each neighbor node of polling present node;
B), then the last jumping figure value that arrives root node of this node is added one if do not choose suitable father node.
17. dynamic broadcast routing method according to claim 1 is characterized in that, the broadcast downstream method of message is in the described step 3:
A) on network interface, receive broadcasting packet, check that message is whether from the father node of this node, if not then directly abandoning;
B) judge whether this node also exists child node, if exist then message is transmitted to its child node.
18. dynamic routing method according to claim 1 is characterized in that, the broadcast upstream method of message is in the described step 3:
A) on network interface, receive broadcasting packet, check that message is whether from the child node of this node, if not then directly abandoning;
B) if then message is transmitted to father node, judge simultaneously whether this node also exists other child node, if exist, then this message is sent to all the other child nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100461900A CN101299708B (en) | 2007-09-20 | 2007-09-20 | Dynamic broadcast routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007100461900A CN101299708B (en) | 2007-09-20 | 2007-09-20 | Dynamic broadcast routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101299708A true CN101299708A (en) | 2008-11-05 |
| CN101299708B CN101299708B (en) | 2011-10-12 |
Family
ID=40079401
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100461900A Active CN101299708B (en) | 2007-09-20 | 2007-09-20 | Dynamic broadcast routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101299708B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102883337A (en) * | 2012-09-24 | 2013-01-16 | 华为技术有限公司 | Method and equipment for establishing a multi-hop network, and multi-hop network node |
| CN103826289A (en) * | 2012-11-19 | 2014-05-28 | 富士通株式会社 | Wireless communication system, wireless communication method, and transmitting terminal |
| CN103974363A (en) * | 2013-01-31 | 2014-08-06 | 中兴通讯股份有限公司 | Non-gateway node, wireless mesh network and wireless mesh network data forwarding method |
| CN106102017A (en) * | 2016-05-31 | 2016-11-09 | 厦门纵行信息科技有限公司 | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment |
| CN106953750A (en) * | 2017-03-09 | 2017-07-14 | 新华三技术有限公司 | One kind detection path establishment method and device |
| CN107276780A (en) * | 2016-04-07 | 2017-10-20 | 中国科学院声学研究所 | It is a kind of be used for topology not exclusively can survey grid network dynamic generation tree method |
| CN108366019A (en) * | 2018-02-11 | 2018-08-03 | 乐鑫信息科技（上海）有限公司 | Broadcast transmission method in a kind of mesh networks |
| CN110087268A (en) * | 2019-04-30 | 2019-08-02 | 上海寰创通信科技股份有限公司 | A kind of based on WLAN route switching method |
| CN110557185A (en) * | 2018-05-31 | 2019-12-10 | 成都鼎桥通信技术有限公司 | method and device for determining operation mode of relay equipment |
| CN111835633A (en) * | 2020-07-09 | 2020-10-27 | 烽火通信科技股份有限公司 | Routing and loop-back preventing method and device in easy mesh networking |
| CN112737981A (en) * | 2020-12-23 | 2021-04-30 | 迈普通信技术股份有限公司 | Broadcast path determining method and device, distributed equipment and readable storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100346617C (en) * | 2004-01-14 | 2007-10-31 | 电子科技大学 | Nucleus tree self-organizing dynamic route algorithm |
| CN1731760A (en) * | 2005-08-05 | 2006-02-08 | 武汉理工大学 | Ad Hoc network routing method based on flooding mechanism |
-
2007
- 2007-09-20 CN CN2007100461900A patent/CN101299708B/en active Active
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102883337B (en) * | 2012-09-24 | 2016-06-08 | 华为技术有限公司 | Multihop network construction method, set up device and node |
| CN102883337A (en) * | 2012-09-24 | 2013-01-16 | 华为技术有限公司 | Method and equipment for establishing a multi-hop network, and multi-hop network node |
| CN103826289A (en) * | 2012-11-19 | 2014-05-28 | 富士通株式会社 | Wireless communication system, wireless communication method, and transmitting terminal |
| CN103974363A (en) * | 2013-01-31 | 2014-08-06 | 中兴通讯股份有限公司 | Non-gateway node, wireless mesh network and wireless mesh network data forwarding method |
| CN107276780A (en) * | 2016-04-07 | 2017-10-20 | 中国科学院声学研究所 | It is a kind of be used for topology not exclusively can survey grid network dynamic generation tree method |
| CN107276780B (en) * | 2016-04-07 | 2019-10-22 | 中国科学院声学研究所 | It is a kind of for topology not exclusively can survey grid network dynamic generation tree method |
| CN106102017A (en) * | 2016-05-31 | 2016-11-09 | 厦门纵行信息科技有限公司 | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment |
| CN106953750A (en) * | 2017-03-09 | 2017-07-14 | 新华三技术有限公司 | One kind detection path establishment method and device |
| CN108366019A (en) * | 2018-02-11 | 2018-08-03 | 乐鑫信息科技（上海）有限公司 | Broadcast transmission method in a kind of mesh networks |
| CN110557185B (en) * | 2018-05-31 | 2022-08-19 | 成都鼎桥通信技术有限公司 | Method and device for determining operation mode of relay equipment |
| CN110557185A (en) * | 2018-05-31 | 2019-12-10 | 成都鼎桥通信技术有限公司 | method and device for determining operation mode of relay equipment |
| CN110087268A (en) * | 2019-04-30 | 2019-08-02 | 上海寰创通信科技股份有限公司 | A kind of based on WLAN route switching method |
| CN110087268B (en) * | 2019-04-30 | 2021-08-17 | 上海寰创通信科技股份有限公司 | Route switching method based on wireless local area network |
| CN111835633B (en) * | 2020-07-09 | 2022-03-25 | 烽火通信科技股份有限公司 | Routing and loop-back preventing method and device in easy mesh networking |
| CN111835633A (en) * | 2020-07-09 | 2020-10-27 | 烽火通信科技股份有限公司 | Routing and loop-back preventing method and device in easy mesh networking |
| CN112737981A (en) * | 2020-12-23 | 2021-04-30 | 迈普通信技术股份有限公司 | Broadcast path determining method and device, distributed equipment and readable storage medium |
| CN112737981B (en) * | 2020-12-23 | 2022-04-08 | 迈普通信技术股份有限公司 | Broadcast path determining method and device, distributed equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101299708B (en) | 2011-10-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101299708B (en) | Dynamic broadcast routing method | |
| CN101299707A (en) | Method for diffusing route | |
| EP1853004B1 (en) | Access point supporting direct and indirect downstream delivery based on communication characteristics | |
| US20060040705A1 (en) | Radio node apparatus, multi-hop radio system, and multi-hop radio system constructing method | |
| EP1102509B1 (en) | Data routing using a location server in a mobile communication network | |
| CN101674630A (en) | Implementation method of cross-layer routing capable of perceiving congestion | |
| CN101969680A (en) | Method for realizing routing of wireless mesh network and wireless mesh network node | |
| CN102334312A (en) | Methods and apparatus for forming, maintaining and/or using overlapping networks | |
| CN104219727A (en) | Multiple exit heterogeneous wireless network and route method | |
| CN101610594A (en) | Dynamic layered PMP/Mesh hybrid network system and superframe structure thereof based on TD-OFDMA | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN100536429C (en) | Method and system for data transmission in wireless net-like network | |
| KR20140126801A (en) | Apparatus and method for rouing multicast in wireless mesh network | |
| JP4474527B2 (en) | Multihop wireless system configuration method and wireless node device | |
| CN105007570A (en) | Mobile ad-hoc network congestion control method based on OLSR protocol | |
| CN102369766B (en) | Method of performing an intra-segment handover | |
| JP4757770B2 (en) | Communication route selection control device, wireless device, and communication route selection method | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| CN101626593A (en) | Method, system and terminal for controlling CDMA service channel | |
| CN101478806B (en) | Loop free route constructing method for wireless Ad Hoc network | |
| CN106375222A (en) | Multicast line switching method for annular networking and equipment | |
| CN103621020A (en) | An intermediate network node in a telecommunications system | |
| CN112351509A (en) | Self-organizing network protocol based on determinacy management method | |
| CN102006231B (en) | Method and device for establishing intelligent route of data service network element as well as data service transmission apparatus | |
| CN101662374B (en) | Broadcasting method for mobile ad hoc 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 | ||
| C56 | Change in the name or address of the patentee |
Owner name: SHANGHAI GBCOM COMMUNICATION TECHNOLOGY CO., LTD. Free format text: FORMER NAME: SHANGHAI GBCOM CO., LTD. |
|
| CP03 | Change of name, title or address |
Address after: 200241, No. 555 Dongchuan Road, Shanghai, Minhang District, building 6, 02B Patentee after: Shanghai Huanchuang Communication Technology Co., Ltd. Address before: 200241, room 6, building 555, 602 Dongchuan Road, Shanghai, Minhang District Patentee before: Shanghai Gbcom Co., Ltd. |