CN104410985B - A kind for the treatment of method and apparatus of topology control message - Google Patents
A kind for the treatment of method and apparatus of topology control message Download PDFInfo
- Publication number
- CN104410985B CN104410985B CN201410560105.2A CN201410560105A CN104410985B CN 104410985 B CN104410985 B CN 104410985B CN 201410560105 A CN201410560105 A CN 201410560105A CN 104410985 B CN104410985 B CN 104410985B
- Authority
- CN
- China
- Prior art keywords
- node
- section point
- mpr
- messages
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/023—Limited or focused flooding to selected areas of a network
Abstract
The invention provides a kind of processing method of topology control message, this method includes：Multiple MPR nodes of the first node including to before selecting itself as the directly-connected neighbor node transmission TC messages of MPR nodes, judging whether the neighbor node have selected comprising the first node；When multiple MPR nodes including judging that the neighbor node have selected comprising the first node, the first node judges itself whether to meet the transmission condition that TC messages are sent to the neighbor node, when judging to meet transmission condition, the first node sends the TC messages to the neighbor node, when judging not meeting transmission condition, the TC messages are not sent to the neighbor node.Present invention also offers a kind of processing unit of topology control message.
Description
Technical field
The present invention relates to Wireless Ad hoc network technical field, more particularly to a kind of processing method of topology control message and
Device.
Background technology
Wireless Ad hoc network (Mobile Ad hoc Network, MANET) be a kind of highly dynamic, self-organizing from
The wireless mesh network (Mesh network) of configuration, the node in network have terminal and the function of router simultaneously, and network is disobeyed
The access point or network infrastructure of any centralizations of Lai Yu, and the radio node in network is established link by less radio-frequency and connected
Connect.
Optimization Link State route (Optimized Link State Routing, OLSR) agreement is that one kind is applied to nothing
The dynamic routing protocol of line Ad hoc networks.Need periodically to exchange various controls between node in Wireless Ad hoc network
Information, by Distributed Calculation come the network topological diagram for updating and establishing oneself, multipoint relay is elected as by neighbors
The node of (MultiPoint Relay, MPR) is needed periodically to Web broadcast control information, contained in control information by
It elects the information of MPR those nodes (MPR constituents) as, and only MPR nodes are used as routing nodes, non-MPR nodes
It is not involved in router-level topology.Also using MPR nodes, effectively broadcast control information, non-MPR nodes need not forward control to OLSR agreements
Information processed, therefore, traditional Routing Protocol is different from, OLSR agreements can effectively reduce the quantity that message transmits in a network.
Message in OLSR agreements has two kinds, and one kind is HELLO messages, and another kind is topological control (Topology
Control, TC) message.HELLO messages are broadcasted in the range of only being jumped one, it is impossible to it are forwarded, and TC messages need to be flooded to entirely
Net, node is according to the TC messages received come calculating network topological diagram.For the quantity for controlling message to transmit in a network,
In OLSR agreements, only MPR nodes can forward TC messages.
In OLSR agreements, each node can know that oneself one jumps (1-hop) and double bounce (2- by HELLO messages
Hop) neighbours, corresponding 1-hop neighborhoods and 2-hop neighborhoods are formed.Each node by independently of one another from itself
MPR is elected in 1-hop neighborhoods, the MPR elected forms MPR subsets, and the MPR subsets can cover all of the node
2-hop neighbours.
At present, node elects MPR rule to have from the 1-hop neighborhoods of itself：
1st, the big node of willingness values is preferentially chosen；
2nd, the big node of remaining degree of communication R () value is preferentially chosen；
3rd, the big node of physical connection degree D () value is preferentially chosen；
4th, the preferential node chosen election itself and be MPR；
5th, self-defined election.For example, in the Wireless Ad hoc network shown in Fig. 1, can be with use priority MPP>MP1>
MP2>MP3>MAP1>MAP2>MAP3>MAP4 elects MPR nodes；Wherein, MPP represents Mesh gateway nodes (Mesh Portal
Point), MAP represents Mesh access nodes (Mesh Access Point), and MP represents Mesh nodes (Mesh Point).
When electing multiple MPR nodes in network, this multiple MPR node may have identical 1-hop neighbours,
In OLSR agreements, MPR nodes can send TC messages to its direct-connected neighbor node, then when this multiple MPR node receives together
During one TC message, then this multiple MPR node can forward the TC messages to its identical 1-hop neighbours simultaneously, in this way, resulting in
To the situation of same node-node transmission more parts of identical TC messages.In Fig. 1 in shown Wireless Ad hoc network, it is assumed that root
Three MPR nodes are elected according to above-mentioned election regulation：MPP, MP2 and MP3.When the TC messages of MPP nodes itself change,
MPP nodes send when a new TC message, MP2 and MP3 receive the new TC messages from MPP as MPR nodes, it is necessary to
The new TC messages are forwarded, still, MP2 and MP3 have identical 1-hop neighbours, i.e. MAP2 nodes and MAP4 nodes, then
MAP2 nodes can receive the new TC messages of two parts of identicals of MP2 and MP3 forwardings, and MAP4 nodes can also receive MP2 and MP3
The new TC messages of two parts of identicals of forwarding, this has resulted in repetition transmission of message.
The content of the invention
In order to solve existing technical problem, the embodiments of the invention provide a kind of processing side of topology control message
Method and device.
Based on the embodiment of the present invention, the present invention provides a kind of processing method of topology control message, and this method is applied to
Any one node of Mesh network, this method include：
When first node and section point are directly-connected neighbor, the non-selected section point of first node is MPR and section point
It has selected comprising multiple direct-link nodes including first node when being MPR nodes, the first node is judged by election algorithm
Itself whether be section point new TC messages sending node, if so, then the first node sent to the section point it is new
TC messages, if it is not, then the first node does not send new TC messages to the section point；
The election algorithm be used for for the section point the section point include the first node including it is more
Uniquely it is responsible for forwarding the node of new TC messages in individual MPR nodes to it for its determination one.
Further, the MPR information carried in the HELLO messages that the first node is sent by section point judges institute
Multiple MPR nodes including whether section point have selected comprising the first node are stated, the MPR information contains described
Two nodes are elected to be the identification information of MPR node；The election algorithm is based on the identification information and determined for the section point
Go out to be responsible for the MPR nodes that the section point sends new TC messages.
Further, methods described also includes：When first node and section point are directly-connected neighbor, the first node is not
Selection section point be MPR nodes, and section point is when also non-selected first node is MPR nodes, if section point choosing
Other nodes are selected as its MPR node, then the first node sends TC messages not directly to section point.
Further, methods described also includes：When the section point only has the first node as its MPR node
When, the first node directly sends new TC messages to the section point.
Based on the embodiment of the present invention, the present invention also provides a kind of processing unit of topology control message, described device application
In any one node of Mesh network, the device includes：
Judging unit, for being directly-connected neighbor when first node and section point, the non-selected section point of first node is
MPR and section point have selected comprising first node including multiple direct-link nodes when being MPR nodes, judged by election algorithm
Itself whether be section point new TC messages sending node；When being determined as being, then transmitting element is called to the section point
The new TC messages are sent, if it is not, then never call transmitting element sends the new TC messages to the section point；
Transmitting element, for sending new TC messages；
The election algorithm be used for for the section point the section point include the first node including it is more
Uniquely it is responsible for forwarding the node of new TC messages in individual MPR nodes to it for its determination one.
Further, the MPR information carried in the HELLO messages that the judging unit is sent by section point judges institute
Multiple MPR nodes including whether section point have selected comprising the first node are stated, the MPR information contains described
Two nodes are elected to be the identification information of MPR nodes；It is that the section point is determined that the election algorithm, which is based on the identification information,
It is responsible for the MPR nodes that the section point sends new TC messages.
Further, the judging unit, it is additionally operable to when first node and section point are directly-connected neighbor, the first segment
The non-selected section point of point is MPR nodes, and section point judges described second when also non-selected first node is MPR nodes
Whether node has selected other nodes to be sent out as its MPR node if so, then never calling the transmitting element to the section point
Send TC messages.
Further, the judging unit, it is additionally operable to judge whether the section point only has the first node conduct
Its MPR node, if so, then calling transmitting element to send new TC messages to the section point.
The treating method and apparatus of topology control message provided in an embodiment of the present invention：The TC messages hair of first node itself
When new TC messages are generated during changing or receiving new TC messages, the section point in the MPR subsets elected to itself is sent out
Send the new TC messages, and/or, itself send the new TC messages for MPR neighbor node to electing.Pass through above-mentioned skill
Art scheme, TC messages flooding object can be effectively distinguished, avoid repeating diffusion TC messages, so as to effectively reduce TC messages on network
Quantity.
Brief description of the drawings
Fig. 1 is that existing TC messages flood network diagram；
Fig. 2 is the flooding method flow chart of TC messages in OLSR agreements provided in an embodiment of the present invention；
Fig. 3 is that TC messages provided in an embodiment of the present invention flood network diagram；
Fig. 4 is that first node selectivity provided by the invention is sent to selection itself for the directly-connected neighbor node of MPR nodes
The step flow chart of TC messages；
Fig. 5 show the flooding apparatus structure schematic diagram of TC messages in OLSR agreements provided in an embodiment of the present invention.
Embodiment
In OLSR agreements, each node selects a part as the MPR nodes of oneself in the neighbor node of oneself.Only
Having can be just responsible for flooding TC messages by election as MPR node to the whole network.OLSR reduces association by using MPR mechanism
The expense of view, Routing Protocol is optimized.MPR nodes periodically flood TC messages, including TC messages caused by itself
With the TC messages from other MPR nodes received.But because multiple MPR nodes may have identical 1-hop adjacent
Occupy, therefore the situation to more parts of identical TC messages of same node-node transmission can be caused.
In order to avoid the appearance of the above situation, the embodiments of the invention provide a kind of processing side of TC messages in OLSR agreements
Method, it is necessary first to which explanation, following method and steps provided in an embodiment of the present invention perform after the completion of MPR elections.Such as Fig. 2 institutes
Show, this method includes：
Step 201, new TC messages are generated when the TC messages of first node itself change, or first node receives
To new TC messages.
Because Wireless Ad hoc network has the topological structure of height change, therefore, the MPR nodes in network need the cycle
Property transmission TC messages, including TC messages and the TC messages from other MPR nodes that receive caused by itself.
Above-mentioned TC messages are newest TC messages, may determine that whether it is newest according to the sequence number of TC messages.
Step 202, the first node sends the new TC messages to the MPR nodes itself elected；
In order to ensure the connectedness of network, provided according to agreement, the first node is bound to new TC messages to institute
Have oneself select MPR nodes send, the priority of the processing mode be higher than be subsequently noted optionally to select itself
The processing mode of new TC messages is sent for the directly-connected neighbor node of MPR nodes.
In the embodiment of the present invention, MPR subsets refer to individual node in network and jump (1-hop) neighbours section from itself direct-connected i.e. 1
The set of the MPR nodes elected in point, the MPR subsets of all individual nodes constitute the MPR set of whole network in network.
By taking Fig. 3 as an example, it is assumed that first node is MPP nodes, the set of the MPR nodes composition of MPP nodes election, i.e. should
The MPR subsets of MPP nodes are { MP2, MP3 }, then when the TC of MPP nodes changes or received the new TC messages of other nodes transmission
When, these new TC messages can be sent respectively to MP2, MP3.
Continue by taking Fig. 3 as an example, it is assumed that first node is MAP2 nodes, and MAP2 MPR subsets are { MP2, MP3 }, on MAP2
New TC messages, it is necessary to which the MPR nodes into the MPR subsets of oneself are MP2 and MP3 nodes sends respectively.
Continue by taking Fig. 3 as an example, it is assumed that first node is the node of MP types, and MP type nodes can also elect the MPR of oneself
Node, by taking the MP2 in Fig. 3 as an example, MP2 MPR subsets are { MPP }, then when the TC messages of the MP2 nodes itself change or receive
During the new TC messages that other nodes are sent, MP2 nodes can send these new TC to all nodes in the MPR subsets of oneself
Message.Similarly, if the MPR nodes of MP3 selections also include MPP nodes, MP3 is also required to send new TC reports to MPP nodes
Text.
Step 203, first node is optionally sent out to other directly-connected neighbor nodes in addition to the MPR nodes selected except itself
Send new TC messages.
Due to that may select other side between two nodes mutually as MPR nodes, any one node can be selected preferentially to oneself
MPR nodes send new TC messages, therefore, first node is to selecting itself to send newly for the directly-connected neighbor node of MPR nodes
, it is necessary to reject the MPR nodes of first node selection during TC messages, that is, skip the neighbours for being sent to the new TC messages
Node, it is not repeated to send.In remaining directly-connected neighbor node, the present invention observes some selection strategies described below, selects
New TC messages are sent to other directly-connected neighbor nodes in addition to the MPR nodes selected except itself to selecting property.
Any one node in Mesh network, is set to first node, when the direct-connected 1 hop neighbor node of the first node selects
When the first node is MPR nodes, and when the non-selected neighbor node of the first node is MPR nodes, the first node to
, it is necessary to first judge itself whether be elected as the TC messages forwarding section of the neighbor node when neighbor node sends new TC messages
Point, just itself can be the direct-connected of MPR to selection when the first node is elected as the TC message forward node of the neighbor node
Neighbor node sends new TC messages, and specific transmission process is as shown in figure 4, concretely comprise the following steps：
Step 401, first node receives the calling HELLO messages that neighbor node is sent.
By existing protocol, HELLO messages are periodically to send, and after Mesh network completes MPR election process, are sent
HELLO messages in can carry MPR information.
Step 402, first node judges whether the neighbor node elects itself as MPR according to HELLO messages, if it is,
Step 403 is performed, if not, first node does not send new TC messages to the neighbor node, flow terminates.
First node judges whether neighbor node elects certainly according to the MPR information carried in the HELLO messages received
As MPR.In embodiments of the present invention, MPR information can be neighbours' interface medium access control (Media Access
Control, MAC) address, it can carry in the Address block TLV fields of HELLO messages (it is of course also possible to carry
In other have field or specially reserved field).It is MPR that if neighbor node, which have selected first node, then the neighbour
First segment can be sent to using the MAC Address of first node as the carrying of neighbours' interface mac address in HELLO messages by occupying node
Point.MPR information can also be IP address, if it is MPR that neighbor node, which have selected first node, then the neighbor node can be by
The IP address of one node carries as neighbours' IP address and is sent to first node in HELLO messages.
Step 403, when it is MPR that judged result, which characterizes the neighbor node to have selected first node, the first node root
Determine whether the neighbor node has elected multiple nodes as its MPR node according to HELLO messages, if it is, performing step
Rapid 404, otherwise, perform step 405.
First node can according to the number of the MAC Address included in the neighbours' interface mac address carried in HELLO messages
To judge whether the neighbor node have chosen multiple MPR, when there are multiple MAC Address, it is more to show that the neighbor node have selected
Individual MPR；This multiple MAC Address is the MAC Address for multiple MPR nodes that the neighbor node is chosen.Or first node according to
The number of the neighbours' IP address carried in HELLO messages is it may determine that go out whether the neighbor node have chosen multiple MPR, when having
During multiple neighbours' IP address, show to have chosen multiple MPR；This multiple neighbours' IP address is the multiple of neighbor node selection
The IP address of MPR nodes.
Step 404, first node determines itself whether be elected as the directly-connected neighbor node according to default election algorithm
New TC messages sending node, if it is, perform step 405；Otherwise, first node does not send new TC to the neighbor node and reported
Text, flow terminate.
The default election algorithm be used for the neighbor node selection include the first node including multiple MPR
A node for being responsible for sending new TC messages to the neighbor node is uniquely determined in node.
The default election algorithm can be：Compare included in the neighbours interface MAC/IP addresses of HELLO messages it is more
Individual MAC/IP addresses, for example, during the MAC/IP addresses maximum of first node, it is determined as that first node is selected as the neighbor node
Send new TC messages；MAC/IP addresses minimum can also be set as, or other conditions can also be preset, as long as can ensure
Select only one node and be responsible for the new TC messages of neighbor node forwarding.
Step 405, the first node sends the new TC messages to the neighbor node.
When it is MPR that the neighbor node, which has only elected first node, first node is directly sent to the neighbor node
The new TC messages；
The embodiment of the present invention is that the neighbours determine unique by election algorithm in multiple MPR that the neighbor node is elected
One MPR sends new TC messages for it, and other MPR nodes can be avoided also to send what is repeated to the neighbor node by this way
The situation of TC messages.
By taking Fig. 3 as an example, MP2, MP3 are MPP MPR nodes, and new TC messages can be sent to MP2 and MP3 by MPP, MP2 and
MP3 is simultaneously MAP2 MPR nodes, and the non-selected MAP2 of MP2 and MP3 is MPR nodes, it is assumed that is sent newly according to default
The election algorithm of TC messages determines that MP2 is responsible for MAP2 and sends new TC messages, then only MP2 can send out the new TC messages received
MAP2 is given, although MAP2 also have selected MP3 as its MPR node, due to not choosing its conduct according to election algorithm
MAP2 new TC messages sending node, therefore MP3 will not send the new TC messages of identical to MAP2.
Further, in the Mesh network for having more MP equipment, each node may elect one or more
MPR equipment, so any one node in the Mesh network, exemplified by first node, first node is to the node indirectly connected with it
The TC messages to flood can be responsible for the forwarding that floods by the MPR nodes of the first node, for it is direct-connected with first node but either party
Non-selected other side is MPR situation, and first node does not directly transmit TC messages to the direct-link node, but passes through first node
Direct-link node in MPR nodes be responsible for forwarding, flood so as to reducing repetition to the full extent.By taking Fig. 3 as an example, MAP2 and
MP1 is direct-link node, and any one party is MPR nodes all without selection other side, and now MAP2 nodes send new TC not directly to MP1
Message, MP1 also directly will not send new TC messages to MAP2, and the new TC messages that MAP2 needs to flood can select to it first
MPR nodes are that MP2 and MP3 nodes are sent, and MP2 and MP3 can be that MPP nodes are sent to its MPR node selected, finally, MPP nodes
New TC messages caused by MAP2 can be transmitted to MP1.Similarly, MP1 needs the new TC messages to flood, can pass through MPP, Ran Houyou
MP2 or MP3 are transmitted to MAP2.
If two nodes are direct-link nodes, either one does not select other side as MPR nodes between each other, then when the two are saved
Both other nodes of no reselection are MPR nodes or select the node without other nodes as MPR nodes any node in point
When, then the peer node of the node needs directly to send new TC messages to the node.
By TC Message processings provided in an embodiment of the present invention, can avoid repeating diffusion TC messages, so as to effectively reduce
The quantity of TC messages on network.
In order to realize the processing method of above-mentioned topology control message, the embodiment of the present invention additionally provides a kind of topology control
The processing unit of message, the hardware environment of the device typically at least include CPU, internal memory and nonvolatile memory, certainly
It is also possible that the hardware such as various forwarding chips, I/O interfaces.Fig. 5 is refer to, exemplified by implemented in software, the present embodiment passes through this
The wherein corresponding computer program instructions of non-volatile memories are read in internal memory and run by the CPU of device, include the device
Have：Judging unit 10, transmitting element 20；In one embodiment of the invention：
Judging unit 10, for being directly-connected neighbor when first node and section point, the non-selected section point of first node
When multiple direct-link nodes including being have selected for MPR and section point comprising first node are MPR nodes, sentenced by election algorithm
Break itself whether be section point new TC messages sending node；When being determined as being, then transmitting element 20 is called to described second
Node sends the new TC messages, if it is not, then never call transmitting element 20 sends the new TC messages to the section point；
Transmitting element 20, new TC messages are sent to directly-connected neighbor for the court verdict according to judging unit 10；
The election algorithm be used for for the section point the section point include the first node including it is more
Uniquely it is responsible for forwarding the node of new TC messages in individual MPR nodes to it for its determination one.
In one embodiment, the MPR letters carried in the HELLO messages that the judging unit 10 is sent by section point
Breath judge the section point whether have selected comprising the first node including multiple MPR nodes, the MPR packets contain
Section point is elected to be the identification information of MPR nodes, and the node identification can be MAC Address or IP address；
It is that the section point is determined to be responsible for the section point hair that the election algorithm, which is based on the identification information,
Send the MPR nodes of new TC messages..
In one embodiment, the judging unit 10 is additionally operable to when first node and section point are directly-connected neighbor, institute
It is MPR nodes to state the non-selected section point of first node, and section point is judged when also non-selected first node is MPR nodes
Whether the section point has selected other nodes as its MPR node, if so, then the judging unit 10 never calls transmission list
Member 20 sends TC messages to the section point.
In one embodiment, judging unit 10 is additionally operable to judge whether the section point only has the first node to make
For its MPR node, if so, then calling transmitting element 20 to send new TC messages to the section point.
Technical scheme is provided by the above embodiment of the present invention, first node can be into the MPR subsets of itself election
Section point sends new TC messages, and/or, itself new TC messages are sent for MPR neighbor node to electing, so as to
TC messages flooding object is effectively distinguished, avoids repeating diffusion TC messages, effectively reduces the quantity of TC messages on network.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method, system or computer program
Product.Therefore, the shape of the embodiment in terms of the present invention can use hardware embodiment, software implementation or combination software and hardware
Formula.Moreover, the present invention can use the computer for wherein including computer usable program code in one or more to use storage
The form for the computer program product that medium is implemented on (including but is not limited to magnetic disk storage and optical memory etc.).
The present invention is the flow with reference to method according to embodiments of the present invention, equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that can be by every first-class in computer program instructions implementation process figure and/or block diagram
Journey and/or the flow in square frame and flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided
The processors of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that produced by the instruction of computer or the computing device of other programmable data processing devices for real
The device for the function of being specified in present one flow of flow chart or one square frame of multiple flows and/or block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction being stored in the computer-readable memory, which produces, to be included referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one square frame of block diagram or
The function of being specified in multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented processing, so as in computer or
The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in individual square frame or multiple square frames.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the scope of the present invention.
Claims (8)
1. a kind of processing method of topology control message, it is characterised in that this method is Mesh nets applied to wireless mesh network
Any one node of network, this method include：
When first node and section point be directly-connected neighbor, the non-selected section point of first node is multipoint relay MPR and the
Two nodes have selected comprising first node including multiple direct-link nodes when being MPR nodes, the first node, which passes through to elect, to be calculated
Method judge itself whether be section point new topology control TC message sending nodes, if so, then the first node is to described
Section point sends new TC messages, if it is not, then the first node does not send new TC messages to the section point；
The election algorithm be used for for the section point the section point include the first node including multiple MPR
Uniquely it is responsible for forwarding the node of new TC messages in node to it for its determination one.
2. the processing method of topology control message according to claim 1, it is characterised in that
The MPR information carried in the HELLO messages that the first node is sent by section point judges that the section point is
It is no have selected comprising the first node including multiple MPR nodes, the MPR information contains the section point and is elected to be
The identification information of MPR node；
It is that the section point determines that being responsible for the section point sends newly that the election algorithm, which is based on the identification information,
The MPR nodes of TC messages.
3. the processing method of topology control message according to claim 1, it is characterised in that methods described also includes：
When first node and section point are directly-connected neighbor, the non-selected section point of first node is MPR nodes, and second
Node is when also non-selected first node is MPR nodes, if section point selection has other nodes as its MPR node,
The first node sends TC messages not directly to section point.
4. the processing method of topology control message according to claim 1, it is characterised in that methods described also includes：
When the section point only has the first node as its MPR node, the first node is directly to described second
Node sends new TC messages.
5. a kind of processing unit of topology control message, it is characterised in that described device is applied to wireless mesh network Mesh nets
Any one node of network, the device include：
Judging unit, for being directly-connected neighbor when first node and section point, the non-selected section point of first node is multiple spot
Relay station MPR and section point have selected comprising first node including multiple direct-link nodes when being MPR nodes, pass through to elect and calculate
Method judge itself whether be section point it is new topology control TC message sending nodes；When being determined as being, then transmitting element is called
The new topology control TC messages are sent to the section point, are sent out if it is not, then never calling transmitting element to the section point
Send the new TC messages；
Transmitting element, for sending new TC messages；
The election algorithm be used for for the section point the section point include the first node including multiple MPR
Uniquely it is responsible for forwarding the node of new TC messages in node to it for its determination one.
6. the processing unit of topology control message according to claim 5, it is characterised in that
The MPR information carried in the HELLO messages that the judging unit is sent by section point judges that the section point is
It is no have selected comprising the first node including multiple MPR nodes, the MPR information contains the section point and is elected to be
The identification information of MPR nodes；
It is that the section point determines that being responsible for the section point sends newly that the election algorithm, which is based on the identification information,
The MPR nodes of TC messages.
7. the processing unit of topology control message according to claim 5, it is characterised in that
The judging unit, it is directly-connected neighbor to be additionally operable to work as first node with section point, the first node non-selected second
Node is MPR nodes, and section point judges whether the section point selects when also non-selected first node is MPR nodes
There are other nodes as its MPR node, if so, then never call the transmitting element sends TC messages to the section point.
8. the processing unit of topology control message according to claim 5, it is characterised in that
The judging unit, it is additionally operable to judge whether the section point only has the first node as its MPR node, if
It is then to call transmitting element to send new TC messages to the section point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410560105.2A CN104410985B (en) | 2014-10-20 | 2014-10-20 | A kind for the treatment of method and apparatus of topology control message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410560105.2A CN104410985B (en) | 2014-10-20 | 2014-10-20 | A kind for the treatment of method and apparatus of topology control message |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104410985A CN104410985A (en) | 2015-03-11 |
| CN104410985B true CN104410985B (en) | 2018-04-06 |
Family
ID=52648567
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410560105.2A Active CN104410985B (en) | 2014-10-20 | 2014-10-20 | A kind for the treatment of method and apparatus of topology control message |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104410985B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106454984B (en) * | 2015-08-04 | 2021-05-04 | 中兴通讯股份有限公司 | Routing method and device |
| CN110662271B (en) * | 2019-10-10 | 2021-04-02 | 大唐终端技术有限公司 | Method for self-adaptive adjustment of routing protocol parameters based on OLSR |
| CN113015266B (en) * | 2020-10-09 | 2023-02-28 | 四川天邑康和通信股份有限公司 | Mesh election method for wifi6 router |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1921432A (en) * | 2006-09-15 | 2007-02-28 | 华为技术有限公司 | Message transmitting method and device |
| CN102315951A (en) * | 2011-09-19 | 2012-01-11 | 华为技术有限公司 | Transmission method for multicast message, correlated equipment and system |
| CN102882793A (en) * | 2012-09-20 | 2013-01-16 | 杭州华三通信技术有限公司 | Topology change message transmitting and processing method and network equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103873373B (en) * | 2012-12-11 | 2017-05-17 | 杭州华三通信技术有限公司 | Multicast data message forwarding method and equipment |
-
2014
- 2014-10-20 CN CN201410560105.2A patent/CN104410985B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1921432A (en) * | 2006-09-15 | 2007-02-28 | 华为技术有限公司 | Message transmitting method and device |
| CN102315951A (en) * | 2011-09-19 | 2012-01-11 | 华为技术有限公司 | Transmission method for multicast message, correlated equipment and system |
| CN102882793A (en) * | 2012-09-20 | 2013-01-16 | 杭州华三通信技术有限公司 | Topology change message transmitting and processing method and network equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104410985A (en) | 2015-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111031544B (en) | Multi-network coexisting multi-frequency-point wireless communication networking method | |
| Sharma et al. | An optimal algorithm for relay node assignment in cooperative ad hoc networks | |
| Barolli et al. | Performance analysis of OLSR and BATMAN protocols considering link quality parameter | |
| Gomez et al. | Improving performance of a real ad-hoc network by tuning OLSR parameters | |
| CN105591937B (en) | A kind of acquisition method and equipment of network topological information | |
| CN107852362A (en) | Trellis paths select | |
| US10904097B2 (en) | Concurrent network reformation for low-power and lossy networks | |
| US11310716B2 (en) | Method of selecting a route in an ad hoc network | |
| CN104410985B (en) | A kind for the treatment of method and apparatus of topology control message | |
| CN108370610B (en) | Interference mitigation in dense mesh networks | |
| Khorov et al. | Flexibility of routing framework architecture in IEEE 802.11 s mesh networks | |
| CN107820697B (en) | Enhanced peer discovery method and system in a mesh network | |
| JP4627465B2 (en) | Wireless communication terminal and QoS information collecting method | |
| CN110167100A (en) | The selection method of relay node in a kind of Internet of Things | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| Hou et al. | Performance comparison of AODV and DSR in MANET test-bed based on Internet of Things | |
| CN105337801B (en) | A kind of method for test examples design based on state machine suitable for switch protocol | |
| Kitasuka et al. | Finding more efficient multipoint relay set to reduce topology control traffic of OLSR | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| Mohapatra et al. | Performance analysis of reactive routing protocols in MANET under CBR traffic using NS2 | |
| WO2014185768A1 (en) | A method of spectrum aware routing in a mesh network and a system derived thereof | |
| KR101762696B1 (en) | Route Maintenance Protocol Using Destination-initiated Flooding in Mobile Ad Hoc Networks | |
| Grajzer et al. | Performance evaluation of Neighbor Discovery++ protocol for the provisioning of self-configuration services in IPv6 mobile ad hoc networks | |
| CN105553854B (en) | A kind of system and its multicast route method based on mobile ad-hoc network | |
| CN110139304B (en) | MPR set selection method based on isolation degree and non-MPR nodes |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant after: Xinhua three Technology Co., Ltd. Address before: 310052 Binjiang District Changhe Road, Zhejiang, China, No. 466, No. Applicant before: Huasan Communication Technology Co., Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |