[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN105072043B - Client announcement procedure optimization method in MESH network Routing Protocol - Google Patents

Client announcement procedure optimization method in MESH network Routing Protocol Download PDF

Info

Publication number
CN105072043B
CN105072043B CN201510486743.9A CN201510486743A CN105072043B CN 105072043 B CN105072043 B CN 105072043B CN 201510486743 A CN201510486743 A CN 201510486743A CN 105072043 B CN105072043 B CN 105072043B
Authority
CN
China
Prior art keywords
node
client
packet
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.)
Active
Application number
CN201510486743.9A
Other languages
Chinese (zh)
Other versions
CN105072043A (en
Inventor
覃国珍
薛楠
毛伯敏
张连委
温宇驰
寇强
杜正雅
王晓宇
李志超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shaanxi Shang Shang Mdt InfoTech Ltd
Original Assignee
Shang Yimin
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shang Yimin filed Critical Shang Yimin
Priority to CN201510486743.9A priority Critical patent/CN105072043B/en
Publication of CN105072043A publication Critical patent/CN105072043A/en
Application granted granted Critical
Publication of CN105072043B publication Critical patent/CN105072043B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/028Dynamic adaptation of the update intervals, e.g. event-triggered updates
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/021Ensuring 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 the client announcement procedure optimization methods in a kind of MESH network Routing Protocol, mainly solve the problems, such as that the number of clients that existing network is serviced is limited by detection packet size.Its implementation is:When the local translation table of source node changes, source node other node broadcasts detection packet into network;After receiving node receives detection packet, according to the variable quantity of domain VN values, judge whether the content of detection packet is correct, if detect the content mistake of packet, receiving node to source node send request bag, if by way of node find it is self-contained have correct information, block the request bag, and correct information is carried and is being replied in packet, return to receiving node;If the content for detecting packet is correct, the corresponding data-link table segment of source node in global transformation table is directly updated, completes the client announcement procedure optimization in MESH network Routing Protocol.The garbage amount carried in being wrapped present invention decreases detection, alleviates network load, reduces network overhead.

Description

Client announcement procedure optimization method in MESH network Routing Protocol
Technical field
The invention belongs to field of communication technology more particularly to a kind of client announcement procedure optimization method, available for MESH The improvement of network routing protocol.
Background technology
In the network there are multiple client, Proactive routing protocols are a kind of common Routing Protocols.On this road By in agreement, regardless of whether there is communication requirement, each node includes the detection packet of complete routing iinformation using periodically broadcast Method, safeguard a routing table for including the routing iinformation for reaching other nodes, i.e. local translation table.When detecting that network opens up When flutterring structure and changing, node can send the detection packet comprising new information in a network.The node for receiving new information will Update the local translation table of itself, it is ensured that the accuracy of routing iinformation.Source node will once send grouping, can be referred to immediately Routing to destination node.Typical Proactive routing protocols have BATMAN and OLSR.There are the wireless of multiple client In MESH network, the process that MESH nodes periodically broadcast the client message of its service to the whole network node is known as priori formula road By the client announcement procedure of agreement.
Come in existing MESH network Routing Protocol usually using the mode of all node routing informations of periodic broadcast the whole network Realize update, however in a broadcast cycle, the routing iinformation for there was only part of nodes in network changes, therefore this The mechanism of " all sending " will certainly cause the redundancy of information in network, increase the transmission of garbage in network, open network Pin becomes very big.For example,《Computer Simulation》The 2nd phase of volume 23 in 2006《The emulation of AODV and DSDV performance of route protocol with Compare》It is mentioned in article, existing BATMAN_adv agreements periodically broadcast spy using " all sending " mechanism, source node Survey packet and notify its existence of neighbor node, the MAC Address comprising source node in the detection packet, source node upper hop node The route tests information such as the sequence number that MAC Address, detection are wrapped.Due in the mechanism, needing periodically to broadcast such carrying The detection packet of a large amount of control information, it is therefore desirable to very big control overhead.
On the other hand, it is that it is supported multiple access, supports network size Quick Extended the characteristics of MESH network.Work as net After network popularization, the quantity of the client of each MESH node serves can increase sharply, if using " all sending " mechanism, MESH nodes need just include all legacy clients and new access client in the detection packet that other nodes are sent into network The routing iinformation at end, therefore the information content transmitted in network can increase moment, but since the memory capacity of detection packet is limited, it is impossible to The all clients information after extension scale is carried simultaneously to be transmitted, and leads to the number clients that can be accessed simultaneously in MESH network Mesh is restricted.
Invention content
It is an object of the invention to propose the client announcement procedure optimization method in a kind of MESH network Routing Protocol, with By being improved to the client announcement procedure in existing MESH network Routing Protocol, reduce network overhead, increase access visitor The number at family end, the scalability increased network utilization with network.
To achieve the above object, the technical scheme is that in MESH network, network node is characterized with the value of domain VN The situation of change of the client-side information itself serviced, and the visitor that other node broadcasts into network and update are serviced itself Family client information, specific steps include as follows:
(1) initialization step:
Its currently serviced client-side information is stored in the local translation table of itself by each node in network, and Other node broadcasts detection packet into network, after other nodes receive detection packet, the information carried during detection is wrapped is stored in In the global transformation table of itself;
(2) real-time update step:
When a certain node has the access or removal of client, the local translation table of the node changes, detection packet The value of middle domain VN is from increasing, at this point, other node broadcasts detection packet into network, other nodes receive detection packet to the node immediately Afterwards, according to the content of detection packet, value, client address information and the routing of the corresponding domain VN of the node in global transformation table are updated Information.
Compared with prior art, the present invention it has the following advantages that:
1. the present invention is due to performing real-time update, and its spy is only just broadcasted when the local translation table of node changes Packet is surveyed, and in the prior art, no matter whether the local translation table of node changes, and node all can periodically broadcast detection Packet.In contrast, the phenomenon that detection packet identical the invention avoids cyclical transmission in a network, network load is alleviated, is subtracted Small network overhead.
2. the present invention is due in real-time update, detecting the value of a carrying domain VN, urgently newer client address in packet Information and routing iinformation, and in the prior art, all clients address information that node is serviced must be included in detection packet And routing iinformation.In contrast, the garbage amount in being wrapped present invention decreases detection, solves the client that network is serviced The problem of number is limited by detection packet size, increases the number of clients that can be accessed simultaneously, improves network utilization and net The scalability of network.
Description of the drawings
Fig. 1 is existing MESH network Organization Chart;
Fig. 2 is the realization flow chart of the present invention;
Fig. 3 is the detection packet OGM structure charts in the present invention;
Fig. 4 is the front end blocking mechanism operating diagram in the present invention;
Fig. 5 is that the forwarding table in the present invention inquires inclusion composition;
Fig. 6 is the comparison diagram that information content is carried in the detection packet of client announcement procedure before and after being improved with the present invention;
Fig. 7 is the network overhead comparison diagram of client announcement procedure before and after being improved with the present invention.
Specific embodiment
To make the objectives, technical solutions, and advantages of the present invention more comprehensible, it below in conjunction with attached drawing and simulation result, tests Demonstrate,prove the effect of the present invention.
With reference to Fig. 1, the MESH network by wireless controller AC, wireless access point AP and groups of clients into, wherein without Lane controller AC controls and manages the wireless access point AP in MESH network;Wireless access point AP is equipped with 3 types:First, pass through Wired wireless access point MPP being connect with wireless controller AC, second is that the wireless access of client is connect but do not accessed with MPP Point MP, third, providing the wireless access point MAP of access service for client.The wireless access point AP of these three types constitutes The framework of MESH network can mutually find and initiate to establish the wireless connection of multi-hop between wireless access point AP automatically, be client End provides transmission service.
Pair the present invention is that the client announcement procedure in the BATMAN_adv Routing Protocols to MESH network optimizes, i.e., The detection pack arrangement and content of client announcement procedure are improved respectively.Its improved key technology has at 2 points:When Increase a domain VN in the detection packet OGM of BATMAN_adv agreements, for characterizing the situation of change of source node local translation table, lead to It crosses and judges that the value of domain VN can determine whether the client-side information that source node is serviced is changed;Second is that it is walked in real-time update In rapid, setting, which detects, wraps the value that domain VN is only carried in OGM, urgently newer client mac address and routing iinformation.
With reference to Fig. 2, the realization of technical solution of the present invention is implemented as follows:
Step 1:Source node broadcast detection packet OGM.
When the local translation table of source node changes, source node other node broadcasts detection packet OGM into network.
The local translation table is for storing the value of the domain VN of source node, its currently serviced client address The data link table of information and routing iinformation, when the client state of node serve changes, node automatically updates local turn Change the VN values stored in table, client address information and routing iinformation.
The detection packet OGM is the data for being used to describe source node state in MESH network BATMAN_adv Routing Protocols It wraps, urgently newer client address information and routing iinformation is carried in the data packet.
With reference to Fig. 3, detection packet OGM include Packet Type, Version, TTL, Flags, Sequence Number, Originator Address、Previous Sender、GW Flags、TQ、TT_num_changes、TT_CRC、VN、TT_ 13 parts of change_list, wherein:
Packet Type:Represent type of data packet, the type of data packet of detection packet OGM is source node state description data Packet;
Version:It is the version compatibility of MESH network Routing Protocol;
TTL:The life span of detection packet OGM is represented, if the ttl value in the detection packet OGM that receiving node receives is more than Preset ttl value, then receiving node think that the detection packet is invalid;
Flags:It is the tag mark of MESH network Routing Protocol, indicates that the packet is wrapped for detection;
Sequence Number:Represent sending sequence number for the detection packet OGM;
Originator Address:Represent the address of source node;
Previous Sender:Represent the upper hop forward node of the forwarding packet;
GW Flags:It is gateway mark, represents the network segment belonging to the node;
TQ:It is transmission quality mark, represents the quality of entire transmission path;
TT_num_changes:It is changed number of clients in local translation table;
TT_CRC:It is the cyclic redundancy error-check sequences of local translation table, for data transmission error detection;
VN:It is the present invention increased domain in detection is wrapped, for representing the serial number of source node local translation table, value Changed by increasing the client-side information serviced to characterize node itself certainly;
TT_change_list:It is a data list, for storing urgently newer client address information and routing Information.
Step 2:Receiving node receives the detection packet OGM of source node broadcast:Receiving node receives the detection of source node broadcast OGM is wrapped, domain VN, and the value of recording domain VN are searched in OGM is wrapped in detection.
The domain VN is the present invention increased neofield in detection is wrapped, for characterizing source node local translation table Situation of change.VN values in different step are different, i.e.,:
In initialization step, the initial value for itself detecting domain VN in packet OGM is set as 0 by source node, and nodes are built The global transformation table of itself is found, and the VN initial values of other nodes in addition to itself are set as 0;
In real-time update step, when changing the local translation table of source node, domain VN in detection packet OGM Value is just from increasing 1.
The global transformation table is value, client for storing the domain VN of other nodes in network in addition to itself The data link table of address information and routing iinformation.The chained list can be split as the data-link table segment of unequal length, store respectively Value, client address information and the routing iinformation of the domain VN of different nodes in network.
Step 3:Judge that detection wraps the VN values of OGM and the VN values of source node corresponding data chain table segment in global transformation table and is It is no equal:If equal, illustrate that any change does not occur for the client-side information of source node, terminate process, conversely, performing step Four.
The source node corresponding data chain table segment, be receiving node global transformation table in for storing the domain of source node The data segment of the value of VN, client address information and routing iinformation.
Step 4:The VN values and the VN values of source node corresponding data chain table segment in global transformation table for judging detection packet OGM Whether difference is equal to 1:If not equal to 1, step 5 is performed, conversely, performing step 6.
Step 5:Receiving node to source node send request bag, 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 is the end resistance before being introduced during receiving node sends request bag to source node Off line system, its step are as follows:
5.1) receiving node D sends request bag to source node A, and request source node A is sent to full table information, such as Fig. 4 (a) It is shown.
5.2) by way of node B itself global transformation table is retrieved, when finding the complete of self-contained active node A local translation tables During table information, the transmission of request bag is blocked immediately, and the full table information that receiving node D needs is carried in reply packet, loopback Receiving node D is given, as shown in Fig. 4 (b).
The request bag and reply is wrapped, and is data packet and the answer number to request bag that request sends full table information respectively According to packet, the two has identical pack arrangement, may be collectively referred to as forwarding table inquiry packet;
With reference to Fig. 5, forwarding table inquiry packet, including Packet Type, Version, Destination Address, Six Source Address, TTL, Flags, VN, TT_DATA parts, wherein:
Packet Type:Represent type of data packet, which is for sending or replying the inquiry of the forwarding table of request Packet;
Version:It is MESH network Routing Protocol version compatibility;
Destination Address:Represent the address of destination node;
Source Address:Represent the address of sending node;
TTL:The life span of the request bag is represented, if the ttl value in the forwarding table inquiry packet that receiving node receives is more than Preset ttl value, then it is assumed that forwarding table inquiry packet is invalid;
Flags:It is forwarding table inquiry packet to represent the packet;
VN:Represent the sequence number of source node local translation table, there are two types of situations:First, when the packet is request bag, domain VN is deposited Put the corresponding VN values of source node A in receiving node D itself global transformation tables;Second is that when the packet is replys packet, domain VN storages source section The value of domain VN in point A detection packets OGM;
TT_DATA:For storing the data list of data, wherein there are two types of the contents stored:When the packet is request bag, The CRC check value of source node is stored in TT_DATA;When the packet is replys packet, storage receiving node D needs in TT_DATA Full table information;
5.3) receiving node D, which is received, replys packet, and the corresponding VN values A.VN of source node A in itself global transformation table is enabled to be equal to back The value of domain VN in multiple packet, as shown in Fig. 4 (c).
Step 6:Whether retrieval detection packet OGM carries newest one group of variation:If carrying, receiving node is according to newest one Group change information update source node corresponding data chain table segment, and terminate process, conversely, sending newest one group of change to originating node requests Change information, and terminate process.
The effect of the present invention can be further illustrated by following emulation experiment:
1st, experiment condition
Experimental applications qemu-kvm platforms create the wireless access point AP in virtual machine emulation MESH network, using vde- Switch platform simulation wireless transmission mediums, using the characterisitic parameter of wirefilter platform simulation wireless connections, such as:Band Wide, packet loss and time delay etc..
2. experiment content
Experiment one, it is assumed that between 0-20s, the state of all clients does not change in MESH network, in 20s When, two new clients are accessed at source node, other client states are constant, sent out to existing BATMAN_adv agreements and with this The detection packet of bright improved BATMAN_adv agreements carries data volume and carries out contrast test, and the results are shown in Figure 6.
As seen from Figure 6, the information that the detection packet OGM of the MESH network BATMAN_adv agreements before being improved with the present invention is carried It measures as 44 bytes, in 20s, increases the information of 2 clients in OGM is wrapped in detection, is i.e. 12 bytes are taken in detection packet OGM The information content of band reaches 56 bytes, and it is constant that the information content is always maintained at after 20s.With the improved MESH network of the present invention The standard OGM of BATMAN_adv agreements is 40 bytes, in 20s, increase in detection packet OGM 2 clients information and 1 Changing claim information, i.e. 14 bytes, detection wraps the information content carried in OGM and reaches 54 bytes, after completing to update, detection packet OGM removes newly-increased client-side information and variation claim information, and the information content carried is restored to 40 bytes again.
Experiment two emulates a MESH network, wherein containing 1 wireless control point AC and 10 wireless access point APs, loses Packet rate is set as 10%.In 0-100s, new client is added at random into the network, to existing BATMAN_adv agreements and use The network overhead of the improved BATMAN_adv agreements of the present invention carries out contrast test, and the results are shown in Figure 7.
From fig.7, it can be seen that in 0s, the network overhead of MESH network BATMAN_adv Routing Protocols is 400 byte per seconds. Between 0-100s, in existing MESH network BATMAN_adv Routing Protocols, since nodes all in network are periodical Broadcast carries the detection packet OGM of all clients information, and network overhead increases as the increase of number clients purpose is linear in network It is long;And in the improved MESH network BATMAN_adv Routing Protocols of the present invention, node is only in the client state of its service Just broadcast detection packet OGM, and urgently newer client-side information is only carried in wrapping when changing, therefore network overhead is only in visitor Just occur apparent increase when family end adds in.
To sum up, the present invention not only reduces the garbage amount carried in detection packet, solves the client that network is serviced The problem of end number is limited by detection packet size, and network load is alleviated, reduce network overhead.
The above embodiment is merely an example for clearly illustrating the present invention, is not intended to limit the embodiments.It is right For those of ordinary skill in the art, can also make on the basis of the above description other it is various forms of variation or It changes.There is no necessity and possibility to exhaust all the enbodiments, and the obvious variation thus amplified out or Variation is still in the protection scope of this invention.

Claims (2)

1. the client announcement procedure optimization method in a kind of MESH network Routing Protocol, including:
(1) initialization step:
Its currently serviced client-side information is stored in the local translation table of itself by each node in network, and to net Other node broadcasts detection packet in network, after other nodes receive detection packet, the information carried during detection is wrapped is stored in itself Global transformation table in;
The local translation table is for storing the value of the domain VN of the node, its currently serviced client address information With the data link table of routing iinformation, when the client state of node serve changes, node automatically updates local translation table VN values, client address information and the routing iinformation of middle storage;
The global transformation table is for storing the value of the domain VN of other nodes in network in addition to itself, client address The data link table of information and routing iinformation;
The VN is the present invention increased domain in detection is wrapped, for representing the serial number of source node local translation table, Value is changed by increasing the client-side information serviced to characterize node itself certainly;
(2) real-time update step:
When a certain node has the access or removal of client, the local translation table of the node changes, domain in detection packet The value of VN is from increasing, at this point, the node immediately into network, wrap by the detection of other node broadcasts, after other nodes receive detection packet, root According to the content of detection packet, value, client address information and the routing iinformation of the corresponding domain VN of the node in global transformation table are updated;
The detection packet is the data that a certain node in network is sent into network during other node specification oneself states Packet, and it is different in the information that different steps includes, i.e.,:
In initialization step, in detection packet comprising the currently serviced all clients address information of the value of domain VN, node and Routing iinformation;
In real-time update step, the value comprising domain VN, urgently newer client address information and routing iinformation in detection packet;
The content according to detection packet updates value, the client address information of the corresponding domain VN of the node in global transformation table And routing iinformation, it is divided into two kinds of situations:
When the content of detection packet is correct, following steps are performed:
(2a) is retrieved and the corresponding data-link table segment of source node in the global transformation table of itself;
(2b) enables the value that the VN values stored in the data-link table segment are equal to domain VN in source node detection packet;
Urgently newer client address information during (2c) is wrapped according to detection, add in or erasing data-link table segment in corresponding client Hold address information;
Urgently newer client routing information during (2d) is wrapped according to detection changes corresponding client routing in data-link table segment Information;
When the content error of detection packet, receiving node sends request bag to source node, and request source node is sent to its needs Correct information.
2. according to the method described in claim 1, the wherein described receiving node to source node send request bag, be receive save Point introduces front end blocking mechanism during sending request bag to source node, if containing reception in the global transformation table of node The correct information that node needs then by way of node blocks the transmission of the request bag, and sends and carried correctly to receiving node immediately The reply packet of information;Conversely, forward the request bag to source node.
CN201510486743.9A 2015-08-10 2015-08-10 Client announcement procedure optimization method in MESH network Routing Protocol Active CN105072043B (en)

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 CN105072043A (en) 2015-11-18
CN105072043B true 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)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113098745B (en) * 2020-01-08 2023-06-02 广州汽车集团股份有限公司 In-vehicle information sharing method and system and automobile
CN113259940B (en) * 2021-05-12 2022-06-03 电子科技大学 Block chain-based satellite ad hoc network BATMAN secure routing method
CN113765785B (en) * 2021-08-19 2022-07-05 东北大学 DPDK-based multipath transmission method

Citations (4)

* Cited by examiner, † Cited by third party
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
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

Also Published As

Publication number Publication date
CN105072043A (en) 2015-11-18

Similar Documents

Publication Publication Date Title
US7992201B2 (en) Dynamic network tunnel endpoint selection
WO2020220705A1 (en) Data transmission method and corresponding devices
US20110063979A1 (en) Network traffic management
CN108696895A (en) Resource acquiring method, apparatus and system
WO2012133521A1 (en) Communication method and communication device
JP2013502860A (en) Name address mapping system, data transmission method, and name address mapping maintenance method
CN104038425B (en) The method and apparatus for forwarding ether network packet
CN106790676A (en) The implementation method and device of subscribing notification
RU2008136890A (en) CONNECTION OF CELLULAR NETWORKS WITH A LOT OF RETAIL KNOTS USING THE NETWORK BRIDGE OF THE SUBMISSION OF CONTROL OF ACCESS TO THE TRANSMISSION MEDIA
CN101360046B (en) Bandwidth resource saving method
CN105072043B (en) Client announcement procedure optimization method in MESH network Routing Protocol
CN108696438A (en) The retransmission method and device of BIER messages
CN105207858B (en) Access device and method for connecting user equipment to network executed by access device
CN114338524A (en) Method and system for improving large-scale container cloud cluster network Service performance
US10231164B2 (en) System and method for distributed and integrated mobility support for mobile networks and mobile hosts
Sardar et al. Performance analysis of basic support protocol (bsp) in nested network mobility (nenemo)
CN105553856B (en) A kind of newer method and device of realization link state data packet
JP2023515955A (en) Route update method and device
CN105162852A (en) Distributed resource sharing method of multi-exit heterogeneous wireless network
CN111464440A (en) Communication method and device
CN105264833B (en) A kind of service path calculation method and device
FI127371B (en) Passive routing in a mesh network
JP4425757B2 (en) Mobile network system
CN108449443A (en) A kind of All-IP wireless network address configuration implementation method
CN114390632B (en) Wireless mobile ad hoc network dynamic routing method based on combination of access layer and network layer

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

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

TR01 Transfer of patent right