CN105072043A - Method for optimizing client declaration process in MESH network routing protocol - Google Patents
Method for optimizing client declaration process in MESH network routing protocol Download PDFInfo
- Publication number
- CN105072043A CN105072043A CN201510486743.9A CN201510486743A CN105072043A CN 105072043 A CN105072043 A CN 105072043A CN 201510486743 A CN201510486743 A CN 201510486743A CN 105072043 A CN105072043 A CN 105072043A
- Authority
- CN
- China
- Prior art keywords
- node
- detection packet
- client
- network
- information
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/028—Dynamic adaptation of the update intervals, e.g. event-triggered updates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for optimizing a client declaration process in the MESH network routing protocol and mainly aims at solving the problem that the number of clients that the existing network serves is restricted by the size of a probe packet. The implementation scheme of the method comprises the following steps: when the local conversion table of a source node changes, the source node broadcasts the probe packet to other nodes in the network; after receiving the probe packet, a receiving node judges whether the content of the probe packet is correct or not according to the variation of a domain VN value, and if the content of the probe packet is wrong, the receiving node sends a request packet to the source node, and a passing node blocks the request packet if the passing node finds itself carrying correct information, and returns a reply packet containing the correct information to the receiving node; and if the content of the probe packet is correct, a data link table segment corresponding to the source node in a global conversion table is directly updated, and then the optimization of the client declaration process in the MESH network routing protocol is completed. The method reduces the quantity of useless information carried in the probe packet, the network load and the network overload.
Description
Technical field
The invention belongs to communication technical field, particularly relate to a kind of client announcement procedure optimization method, can be used for the improvement of MESH network Routing Protocol.
Background technology
In the network that there is multiple client, Proactive routing protocols is the Routing Protocol that a class is commonly used.In this Routing Protocol, no matter whether have communication requirement, each node adopts periodically broadcast packet containing the method for the detection packet of complete routing iinformation, to safeguard a routing table comprising the routing iinformation arriving other nodes, i.e. local translation table.When detecting that network topology structure changes, node can send the detection packet comprising updating message in a network.The node receiving updating message, by upgrading the local translation table of self, guarantees the accuracy of routing iinformation.Source node, once will send grouping, can obtain the route pointing to destination node immediately.Typical Proactive routing protocols has BATMAN and OLSR.In the Wireless MESH network that there is multiple client, MESH node is called the client announcement procedure of Proactive routing protocols to the process of client message that the whole network node periodically broadcasts its service.
The mode that in existing MESH network Routing Protocol, usual periodic broadcasts all node routing information of the whole network realizes upgrading, but in a broadcast cycle, the routing iinformation of part of nodes is only had to change in network, therefore the mechanism of this " all sending " will certainly cause the redundancy of information in network, increase the transmission of garbage in network, make network overhead become very large.Such as, mention in " Computer Simulation " the 23rd volume the 2nd phase in 2006 " AODV and DSDV performance of route protocol emulates and compares " article, mechanism that existing BATMAN_adv agreement adopts " all sending ", the periodic broadcast probe bag of source node notifies its existence of neighbor node, comprises the route test information such as the MAC Address of upper hop node, the sequence number of detection packet of the MAC Address of source node, source node in this detection packet.Due in this mechanism, need periodically to broadcast the detection packet that this type of carries a large amount of control information, therefore need very large control overhead.
On the other hand, the feature of MESH network is that it supports multiple access, network enabled scale Quick Extended.After network size expands, the quantity of the client of each MESH node serve can increase sharply, if adopt " all sending " mechanism, MESH node needs the routing iinformation that just must comprise all legacy clients and new access client in the detection packet that other nodes send in network, therefore the amount of information transmitted in network can increase instantaneously, but because the memory capacity of detection packet is limited, all client-side informations after can not simultaneously carrying expansion scale transmit, and cause the number of clients that can simultaneously access in MESH network restricted.
Summary of the invention
The object of the invention is to the client announcement procedure optimization method proposed in a kind of MESH network Routing Protocol, with by improving the client announcement procedure in existing MESH network Routing Protocol, reduce network overhead, increase the number of access client, increase network utilization and the extensibility of network.
For achieving the above object, technical scheme of the present invention is in MESH network, the situation of change of the client-side information of serving with the value characterizing network node self of territory VN, and to the client-side information that other node broadcasts in network and renewal self are served, its concrete steps comprise as follows:
(1) initialization step:
Its current served client-side information is stored in the local translation table of self by each node in network, and to other node broadcasts detection packet in network, after other nodes receive detection packet, the information of carrying in detection packet is stored in the global transformation table of self;
(2) real-time update step:
When a certain node has the access of client or shifts out, the local translation table of this node changes, in its detection packet, the value of territory VN is from increasing, now, this node is other node broadcasts detection packet in network immediately, after other nodes receive detection packet, according to the content of detection packet, upgrade the value of the territory VN that this node is corresponding in global transformation table, client address information and routing iinformation.
Compared with prior art, tool has the following advantages in the present invention:
1. the present invention is owing to performing real-time update, and only just broadcasts its detection packet when the local translation table of node changes, and in the prior art, and no matter whether the local translation table of node changes, and node all can periodically broadcast probe bag.By contrast, present invention, avoiding the phenomenon of the identical detection packet of cyclical transmission in a network, alleviate network load, reduce network overhead.
2. the present invention is due in real-time update, only carries the value of territory VN, the client address information urgently upgraded and routing iinformation in detection packet, and in the prior art, must comprise all client address information and routing iinformation that node serves in detection packet.By contrast, present invention decreases the garbage amount in detection packet, solve number of clients that network serves by the problem of detection packet size restriction, add the number of clients that can simultaneously access, improve the extensibility of network utilization and network.
Accompanying drawing explanation
Fig. 1 is existing MESH network Organization Chart;
Fig. 2 is realization flow figure of the present invention;
Fig. 3 is the detection packet OGM structure chart in the present invention;
Fig. 4 is the front end blocking mechanism operating diagram in the present invention;
Fig. 5 transmits inquiry packet structure chart in the present invention;
Fig. 6 is the comparison diagram improving carry information amount in the detection packet of front and back client announcement procedure with the present invention;
Fig. 7 is the network overhead comparison diagram improving front and back client announcement procedure with the present invention.
Embodiment
For making object of the present invention, technical scheme and advantage clearly understand, below in conjunction with accompanying drawing and simulation result, verify effect of the present invention.
With reference to Fig. 1, described MESH network is made up of wireless controller AC, wireless access point AP and client, the wireless access point AP wherein in wireless controller AC control and management MESH network; Wireless access point AP is provided with 3 types: one is by wired WAP (wireless access point) MPP be connected with wireless controller AC, and but two is be connected with MPP do not access the WAP (wireless access point) MP of client, and three is for client provides the WAP (wireless access point) MAP of access service.The wireless access point AP of this three types constitutes the framework of MESH network, automatically mutually can find and initiate to set up the wireless connections of multi-hop, for client provides transmission service between wireless access point AP.
The present invention is optimized the client announcement procedure in the BATMAN_adv Routing Protocol of MESH network, namely improves respectively the detection packet structure of client announcement procedure and content.Its key technology improved has 2 points: one is increase a territory VN in the detection packet OGM of BATMAN_adv agreement, for characterizing the situation of change of source node local translation table, by judging that the value of territory VN can determine whether the client-side information that source node is served there occurs change; Two is in real-time update step, arranges the value of only carrying territory VN in detection packet OGM, the client mac address urgently upgraded and routing iinformation.
With reference to Fig. 2, the realization of technical solution of the present invention is implemented as follows:
Step one: source node broadcast probe bag OGM.
When the local translation table of source node changes, source node is other node broadcasts detection packet OGM in network.
Described local translation table, it is the data link table of the value of the territory VN for storing source node, its current served client address information and routing iinformation, when the client state of node serve changes, node upgrades the VN value, client address information and the routing iinformation that store in local translation table automatically.
Described detection packet OGM is for describing the packet of source node state in MESH network BATMAN_adv Routing Protocol, carries the client address information and routing iinformation that urgently upgrade in this packet.
With reference to Fig. 3, detection packet OGM comprises PacketType, Version, TTL, Flags, SequenceNumber, OriginatorAddress, PreviousSender, GWFlags, TQ, TT_num_changes, TT_CRC, VN, TT_change_list 13 parts, wherein:
PacketType: represent type of data packet, the type of data packet of detection packet OGM is source node state description packet;
Version: the version compatibility being MESH network Routing Protocol;
TTL: the life span representing this detection packet OGM, if the ttl value in the detection packet OGM that receives of receiving node has exceeded the ttl value preset, then receiving node has thought that this detection packet is invalid;
Flags: the tag mark being MESH network Routing Protocol, indicates that this bag is detection packet;
SequenceNumber: represent sending sequence number of this detection packet OGM;
OriginatorAddress: the address representing source node;
PreviousSender: represent the upper hop forward node forwarding this bag;
GWFlags: be gateway mark, represents the network segment belonging to this node;
TQ: be transmission quality mark, represent the quality of whole transmission path;
TT_num_changes: be the number of clients changed in local translation table;
TT_CRC: the cyclic redundancy error-check sequences being local translation table, for transfer of data error detection;
VN: be the territory that the present invention increases in detection packet, is used for representing the sequence number of source node local translation table, and its value is by characterizing the client-side information that node self serves there occurs change from increasing;
TT_change_list: be a data list, for storing the client address information and routing iinformation that urgently upgrade.
Step 2: receiving node receives the detection packet OGM of source node broadcast: receiving node receives the detection packet OGM of source node broadcast, searches territory VN in detection packet OGM, and the value of recording domain VN.
Described territory VN is the neofield that the present invention increases in detection packet, for characterizing the situation of change of source node local translation table.VN value in different step is different, that is:
In initialization step, the initial value of territory VN in self detection packet OGM is set to 0 by source node, and nodes sets up the global transformation table of self, and the VN initial value of other nodes except self is set to 0;
In real-time update step, when the local translation table of source node changes, in its detection packet OGM, the value of territory VN is just from increasing 1.
Described global transformation table is the data link table of the value of the territory VN for other nodes in storage networking except self, client address information and routing iinformation.This chained list can be split as the data link table section of unequal length, distinguishes the value of the territory VN of different node in storage networking, client address information and routing iinformation.
Step 3: judge that whether the VN value of detection packet OGM is equal with the VN value of source node corresponding data chained list section in global transformation table: if equal, then illustrate that any change does not occur the client-side information of source node, terminates process, otherwise, perform step 4.
Described source node corresponding data chained list section is for storing the data segment of the value of the territory VN of source node, client address information and routing iinformation in the global transformation table of receiving node.
Step 4: judge whether the difference of the VN value of source node corresponding data chained list section in the VN value of detection packet OGM and global transformation table equals 1: if be not equal to 1, perform step 5, otherwise, perform step 6.
Step 5: receiving node sends request bag to source node, the full table information of request transmission source node local translation table, and terminate process.
With reference to Fig. 4, the realization of this step to send request to source node in the process of bag at receiving node to introduce front end blocking mechanism, and its step is as follows:
5.1) receiving node D sends request bag to source node A, and request source node A shows information, as shown in Fig. 4 (a) entirely to its transmission.
5.2) by way of self global transformation table of Node B retrieval, when finding the full table information of self-contained active node A local translation table, block the transmission of request bag immediately, and the full table information that receiving node D needs is carried in reply bag, loopback to receiving node D, as shown in Fig. 4 (b).
Described request bag and reply bag, be the packet that request sends full table information and the reply data bag wrapped request respectively, both have identical pack arrangement, can be referred to as and transmit inquiry packet;
With reference to Fig. 5, this transmits inquiry packet, comprises PacketType, Version, DestinationAddress, SourceAddress, TTL, Flags, VN, TT_DATA six parts, wherein:
PacketType: represent type of data packet, this packet transmits inquiry packet for what send or reply request;
Version: be MESH network Routing Protocol version compatibility;
DestinationAddress: the address representing destination node;
SourceAddress: the address representing sending node;
TTL: the life span representing this request bag, if the ttl value transmitted in inquiry packet that receiving node receives has exceeded the ttl value preset, then it has been invalid for thinking that this transmits inquiry packet;
Flags: represent that inquiry packet transmitted by this bag;
VN: the sequence number representing source node local translation table, has two kinds of situations: one is this bag is that when asking bag, territory VN deposits the VN value that in receiving node D self global transformation table, source node A is corresponding; Two is these bags is that when replying bag, territory VN deposits the value of territory VN in source node A detection packet OGM;
TT_DATA: for storing the data list of data, have two kinds in wherein depositing: when this bag is for request bag, deposit the CRC check value of source node in TT_DATA; When this bag is for replying bag, in TT_DATA, deposit the full table information that receiving node D needs;
5.3) receiving node D receives and replys bag, make VN value A.VN that in self global transformation table, source node A is corresponding equal to reply wrap in the value of territory VN, as shown in Fig. 4 (c).
Step 6: whether retrieval detection packet OGM carries up-to-date one group of change: if carry, then receiving node upgrades source node corresponding data chained list section according to up-to-date one group of change information, and terminates process, otherwise, send up-to-date one group of change information to originating node requests, and terminate process.
Effect of the present invention further illustrates by following emulation experiment:
1, experiment condition
Experimental applications qemu-kvm platform creates the wireless access point AP in virtual machine emulation MESH network, application vde-switch platform simulation wireless transmission medium, the characterisitic parameter of application wirefilter platform simulation wireless connections, such as: bandwidth, packet loss and time delay etc.
2. experiment content
Experiment one, suppose between 0-20s, in MESH network, the state of all clients does not all change, when 20s, two new clients are accessed at source node place, other client states are constant, and to existing BATMAN_adv agreement with carry data volume by the detection packet of BATMAN_adv agreement after the present invention improves and carry out contrast test, result as shown in Figure 6.
As seen from Figure 6, the amount of information that the detection packet OGM of the MESH network BATMAN_adv agreement before improving with the present invention carries is 44 bytes, when 20s, the information of 2 clients is increased in detection packet OGM, i.e. 12 bytes, the amount of information of carrying in detection packet OGM reaches 56 bytes, keeps this amount of information constant after 20s always.The standard OGM of the MESH network BATMAN_adv agreement after improving with the present invention is 40 bytes, when 20s, information and 1 change claim information of 2 clients is increased in detection packet OGM, i.e. 14 bytes, the amount of information of carrying in detection packet OGM reaches 54 bytes, after completing renewal, newly-increased client-side information and change claim information are removed by detection packet OGM, and its amount of information of carrying returns to again 40 bytes.
Experiment two, emulates a MESH network, and wherein containing 1 wireless control point AC and 10 wireless access point AP, packet loss is set to 10%.In 0-100s, in this network, add new client at random, carry out contrast test to the network overhead of existing BATMAN_adv agreement and the BATMAN_adv agreement after improving with the present invention, result as shown in Figure 7.
As seen from Figure 7, when 0s, the network overhead of MESH network BATMAN_adv Routing Protocol is 400 byte per seconds.Between 0-100s, in existing MESH network BATMAN_adv Routing Protocol, because the equal periodic broadcast of nodes all in network carries the detection packet OGM of all client-side informations, network overhead linearly increases along with number clients object increase in network; And the present invention improve after MESH network BATMAN_adv Routing Protocol in, node is the ability broadcast probe bag OGM when the client state of its service changes only, and only carry the client-side information urgently upgraded in bag, therefore network overhead only adds fashionable just appearance in client obviously increases.
To sum up, the present invention not only reduces the garbage amount of carrying in detection packet, solves number of clients that network the serves problem by the restriction of detection packet size, and alleviates network load, reduce network overhead.
Above-described embodiment is only for example of the present invention is clearly described, the restriction not to execution mode.For those of ordinary skill in the field, other multi-form change or variations can also be made on the basis of the above description.Here exhaustive without the need to also giving all execution modes, and thus the apparent change of amplifying out or variation be still among protection scope of the present invention.
Claims (5)
1. the client announcement procedure optimization method in MESH network Routing Protocol, comprising:
(1) initialization step:
Its current served client-side information is stored in the local translation table of self by each node in network, and to other node broadcasts detection packet in network, after other nodes receive detection packet, the information of carrying in detection packet is stored in the global transformation table of self;
(2) real-time update step:
When a certain node has the access of client or shifts out, the local translation table of this node changes, in its detection packet, the value of territory VN is from increasing, now, this node is other node broadcasts detection packet in network immediately, after other nodes receive detection packet, according to the content of detection packet, upgrade the value of the territory VN that this node is corresponding in global transformation table, client address information and routing iinformation;
Described detection packet is the packet that a certain node in network sends during other node specification oneself states in network, and in the information difference that different steps comprises, that is:
In initialization step, the value of IncFlds VN, current the served all client address information of node and routing iinformation in detection packet;
In real-time update step, the value of IncFlds VN, the client address information urgently upgraded and routing iinformation in detection packet.
2. method according to claim 1, wherein said local translation table, it is the data link table of the value of the territory VN for storing this node, its current served client address information and routing iinformation, when the client state of node serve changes, node upgrades the VN value, client address information and the routing iinformation that store in local translation table automatically.
3. method according to claim 1, wherein said global transformation table is the data link table of the value of the territory VN for other nodes in storage networking except self, client address information and routing iinformation.
4. method according to claim 1, according to the content of detection packet in wherein said step (2), upgrades the value of the territory VN that this node is corresponding in global transformation table, client address information and routing iinformation, is divided into two kinds of situations:
When the content of detection packet is correct, perform following steps:
(2a) in the global transformation table of self, the data link table section corresponding with source node is retrieved;
(2b) the VN value stored in this data link table section is made to equal the value of territory VN in source node detection packet;
(2c) according to the client address information urgently upgraded in detection packet, add or corresponding client address information in obliterated data chained list section;
(2d) according to the client routing information urgently upgraded in detection packet, corresponding client routing information in Update Table chained list section;
When the content of detection packet is made mistakes, receiving node sends request bag to source node, and request source node sends its correct information needed to it.
5. method according to claim 4, wherein said receiving node sends request bag to source node, to send request to source node in the process of bag at receiving node to introduce front end blocking mechanism, if containing the correct information that receiving node needs in the global transformation table of node, then block the transmission of this request bag by way of node immediately, and send the reply bag carrying correct information to receiving node; Otherwise, forward this request bag to source node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510486743.9A CN105072043B (en) | 2015-08-10 | 2015-08-10 | Client announcement procedure optimization method in MESH network Routing Protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510486743.9A CN105072043B (en) | 2015-08-10 | 2015-08-10 | Client announcement procedure optimization method in MESH network Routing Protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105072043A true CN105072043A (en) | 2015-11-18 |
| CN105072043B CN105072043B (en) | 2018-07-06 |
Family
ID=54501329
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510486743.9A Active CN105072043B (en) | 2015-08-10 | 2015-08-10 | Client announcement procedure optimization method in MESH network Routing Protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105072043B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113098745A (en) * | 2020-01-08 | 2021-07-09 | 广州汽车集团股份有限公司 | In-vehicle information sharing method and system and vehicle |
| CN113259940A (en) * | 2021-05-12 | 2021-08-13 | 电子科技大学 | Block chain-based satellite ad hoc network BATMAN secure routing method |
| CN113765785A (en) * | 2021-08-19 | 2021-12-07 | 东北大学 | DPDK-based novel multi-path transmission scheme |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1345148A (en) * | 2000-09-18 | 2002-04-17 | 阿尔卡塔尔加拿大公司 | Method and device for implementation of resynchronization of topological data base in communication network having topological state routing protocol |
| CN101471693A (en) * | 2007-12-27 | 2009-07-01 | 华为技术有限公司 | Method and apparatus for sharing grid protection |
| CN101534238A (en) * | 2008-03-14 | 2009-09-16 | 华为技术有限公司 | Method, node and system for notifying agent update in wireless Mesh network |
| CN103210617A (en) * | 2010-11-12 | 2013-07-17 | 阿尔卡特朗讯公司 | Reduction of message and computational overhead in networks |
-
2015
- 2015-08-10 CN CN201510486743.9A patent/CN105072043B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1345148A (en) * | 2000-09-18 | 2002-04-17 | 阿尔卡塔尔加拿大公司 | Method and device for implementation of resynchronization of topological data base in communication network having topological state routing protocol |
| CN101471693A (en) * | 2007-12-27 | 2009-07-01 | 华为技术有限公司 | Method and apparatus for sharing grid protection |
| CN101534238A (en) * | 2008-03-14 | 2009-09-16 | 华为技术有限公司 | Method, node and system for notifying agent update in wireless Mesh network |
| CN103210617A (en) * | 2010-11-12 | 2013-07-17 | 阿尔卡特朗讯公司 | Reduction of message and computational overhead in networks |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113098745A (en) * | 2020-01-08 | 2021-07-09 | 广州汽车集团股份有限公司 | In-vehicle information sharing method and system and vehicle |
| CN113259940A (en) * | 2021-05-12 | 2021-08-13 | 电子科技大学 | Block chain-based satellite ad hoc network BATMAN secure routing method |
| CN113765785A (en) * | 2021-08-19 | 2021-12-07 | 东北大学 | DPDK-based novel multi-path transmission scheme |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105072043B (en) | 2018-07-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4732972B2 (en) | Ad hoc network, node, route control method, and route control program | |
| US20110228696A1 (en) | Dynamic directed acyclic graph (dag) topology reporting | |
| CN110580256B (en) | Method, device and system for identifying application identification | |
| JP2004521561A (en) | Dynamic network and routing method for dynamic network | |
| CN104836737A (en) | Internet of things communication method taking named data as center | |
| CN110691379A (en) | Active routing communication method suitable for wireless ad hoc network | |
| CN105591798A (en) | Method and device for transmitting OAM information in DCN | |
| CN101640628B (en) | Mesh network-based routing management and routing methods, node, device and system | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| CN111147372A (en) | Downlink message sending and forwarding method and device | |
| CN105072043A (en) | Method for optimizing client declaration process in MESH network routing protocol | |
| WO2019100794A1 (en) | Message processing method and apparatus | |
| JP2023519999A (en) | Route transmission method and apparatus, route processing method and apparatus, device, and storage medium | |
| CN105282041A (en) | Method and device of flooding on the basis of ISIS (intermediate system to intermediate system) | |
| CN105188103A (en) | Rapid roaming optimization method for use in MESH network routing protocol | |
| CN102546419B (en) | Routing method, routing device, packet forwarding method and packet forwarding system | |
| WO2014029287A1 (en) | Method and device for sharing tunnel load | |
| CN111464440A (en) | Communication method and device | |
| CN105162852A (en) | Distributed resource sharing method of multi-exit heterogeneous wireless network | |
| CN102573000A (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| CN101483608A (en) | EAPS loop network topology structure automatic discovery method | |
| CN109347734A (en) | A kind of file transmitting method, device, the network equipment and computer-readable medium | |
| KR101751891B1 (en) | Controller, apparatus and method, for topology discovery and peer detection based on openflow in openflow wireless mesh network environment | |
| WO2021088357A1 (en) | Method for generating forwarding information, device, and system | |
| Hui et al. | Analysis and research on OLSR protocol for multi-channel assignment of wireless mesh 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190111 Address after: 710077 No. 16 Zhang Basi Road, Xi'an High-tech Zone, Shaanxi Province Patentee after: Shaanxi Shang Shang Mdt InfoTech Ltd Address before: 710004 No. 19 Building 62, West Five Road, Xincheng District, Xi'an City, Shaanxi Province Patentee before: Shang Yimin |