CN114727354A - Clustering optimal link state routing method based on virtual backbone network - Google Patents
Clustering optimal link state routing method based on virtual backbone network Download PDFInfo
- Publication number
- CN114727354A CN114727354A CN202210330968.5A CN202210330968A CN114727354A CN 114727354 A CN114727354 A CN 114727354A CN 202210330968 A CN202210330968 A CN 202210330968A CN 114727354 A CN114727354 A CN 114727354A
- Authority
- CN
- China
- Prior art keywords
- gateway
- node
- cluster
- message
- backbone network
- 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
- 238000000034 method Methods 0.000 title claims abstract description 46
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 102
- 238000004353 relayed correlation spectroscopy Methods 0.000 claims description 37
- KRTSDMXIXPKRQR-AATRIKPKSA-N monocrotophos Chemical compound CNC(=O)\C=C(/C)OP(=O)(OC)OC KRTSDMXIXPKRQR-AATRIKPKSA-N 0.000 claims description 12
- 238000012423 maintenance Methods 0.000 claims description 10
- 238000004422 calculation algorithm Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000003993 interaction Effects 0.000 claims description 4
- 239000013598 vector Substances 0.000 claims description 2
- 230000007246 mechanism Effects 0.000 abstract description 8
- 238000004891 communication Methods 0.000 abstract description 2
- 238000009709 capacitor discharge sintering Methods 0.000 description 17
- 238000010586 diagram Methods 0.000 description 2
- 229910003460 diamond Inorganic materials 0.000 description 2
- 239000010432 diamond Substances 0.000 description 2
- 230000008531 maintenance mechanism Effects 0.000 description 2
- 230000000737 periodic effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/023—Limited or focused flooding to selected areas of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to the technical field of wireless communication, in particular to a clustering optimal link state routing method based on a virtual backbone network. On a clustering structure constructed by a clustering OLSR routing method based on management message merging, a virtual backbone network is established and maintained. The cluster head node firstly calculates the MCDS which can dominate all nodes in the cluster, each cluster head selects the least number of gateway nodes to join the clustered MCDS, then the CDS which can reach all adjacent clusters is established, and the CDS of all the clusters in the network forms the backbone network of the network. Each cluster also needs to select a relay node in an adjacent cluster to forward the routing message from the cluster. And setting a forwarding rule of routing message flooding. The cluster head periodically maintains the virtual backbone network and sends a message to inform the member nodes of updating the backbone network state of the member nodes. And the virtual backbone network is adopted to replace an MPR mechanism to flood the routing message, and the routing overhead of the OLSR protocol is reduced by optimizing the forwarding times during the flooding of the routing message.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to a clustering optimal link state routing method based on a virtual backbone network.
Background
In the chinese invention patent application No. 202210303763.8, a clustered OLSR routing method based on management message merging is proposed, which is a new routing protocol, and its main contents include: establishing a clustering structure in a network, selecting a cluster head in a two-hop range by a node through a maximum connection degree clustering algorithm, and establishing a cluster in the two-hop range by the cluster head; designing a clustering periodic maintenance mechanism and a clustering combination mechanism, and keeping the stability of a network clustering structure in a dynamic network through the periodic information interaction of a cluster head and member nodes and the clustering combination mechanism; a routing message management mechanism of the OLSR is designed, a cluster head node collects routing messages of member nodes, the routing messages of the members are merged by the cluster head and then flooded, routing overhead is reduced by reducing head redundancy of the routing messages, the cluster head monitors the change condition of the topology of each member according to the routing messages of the members, and unnecessary routing overhead is reduced by reducing flooding frequency of the routing messages of the members with stable topology.
On the basis of the routing protocol, a new routing mechanism needs to be further developed to optimize the forwarding times during message flooding and reduce the routing overhead of the OLSR protocol.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a clustering optimal link state routing method based on a virtual backbone network, wherein the virtual backbone network is adopted to replace an MPR mechanism to flood routing messages, and the routing overhead of an OLSR protocol is reduced by optimizing the forwarding times during the flooding of the routing messages.
In order to achieve the purpose, the invention is realized by the following technical scheme: a clustering optimal link state routing method based on a virtual backbone network comprises the following steps: in a cluster structure constructed by a clustering OLSR routing method based on management message merging, a virtual backbone network is established and maintained on the basis of a Chinese invention patent application file with the application number of 202210303763.8;
in the process of establishing a virtual backbone network, a cluster head node firstly calculates MCDS capable of dominating all nodes in a cluster, each cluster head selects a minimum number of gateway nodes to add into the clustered MCDS, then a CDS capable of reaching all adjacent clusters is established, and the CDS of all the clusters in the network forms the backbone network of the network; in addition, each cluster also needs to select a relay node in an adjacent cluster, and the relay node forwards the routing message from the cluster; setting a forwarding rule of routing message flooding based on the establishment of a virtual backbone network and the selection of a relay node;
in the maintenance stage of the virtual backbone network, the cluster head is used for periodically maintaining the virtual backbone network and sending a message to inform member nodes of the virtual backbone network to update the state of the backbone network; the gateway node periodically submits the adjacent cluster nodes discovered by the gateway node to the cluster head, so that the cluster head can acquire the latest adjacent cluster information.
The technical scheme shows that the invention has the following beneficial effects:
1. the invention provides a clustering optimal link state routing method based on a virtual backbone network, which adopts the virtual backbone network to replace an MPR mechanism to flood routing messages, and reduces the routing overhead of an OLSR protocol by optimizing the forwarding times during the flooding of the routing messages.
2. The invention provides a clustering optimal link state routing method based on a virtual backbone network, which ensures the stability of the clustering optimal link state routing method based on the virtual backbone network in a dynamic network by maintaining the virtual backbone network.
Drawings
FIG. 1 is a flowchart of a calculation algorithm for gateway dominating points of a clustered optimal link state routing method based on a virtual backbone network according to the present invention;
fig. 2 is an exemplary diagram of isolated nodes affecting global flooding of routing messages in the virtual backbone network-based clustered optimal link state routing method according to the present invention;
fig. 3 is an exemplary diagram of a backbone network and a routing message flooding mechanism of the virtual backbone network-based clustering optimal link state routing method according to the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
Examples
The method for routing a clustered optimal link state based on a virtual backbone network comprises the following steps: on a clustering structure constructed by a clustering OLSR routing method based on management message merging, which is proposed in Chinese invention patent application with the application number of 202210303763.8, a virtual backbone network is established and maintained. The device is mainly divided into two parts: establishing a virtual backbone network and maintaining the virtual backbone network.
The establishment of the virtual backbone network can be divided into four parts: the method comprises the steps of establishing MCDS in a cluster, establishing CDS in the cluster, selecting relay nodes and processing isolated nodes.
To describe the nodes in the backbone, in this embodiment, we define three different backbone states, includingMPR dominator(MPR dominance points to identify nodes in a minimal connected dominance set within a cluster)Gateway Dominator(gateway dominance point for identifying gateway nodes in a intra-cluster connectivity dominance set),Relay Point(relay node for identifying a relay node selected by the gateway dominator within the neighboring cluster), andunset(not allocated to backbone). The initial backbone network state of all nodes isunset. It should be noted that a node may be both an MPR dominator and a gateway dominator.
(1) Establishment of MCDS in cluster
First, we describe the establishment process of the MCDS within a cluster. After the clustering is completed, the cluster head node calculates the MCDS capable of covering all the nodes in the cluster by using the known information. The cluster head can acquire the information of all member nodes through the interaction of the HELLO messages. Therefore, the cluster head only needs to strip the topology view of the cluster from the neighbor topology information in the two-hop range, and can calculate the MPR nodes covering all member nodes in the cluster through the selection algorithm of the MPR set, which are called as MPR dominant points. All MPR dominating points and cluster heads constitute an MCDS covering all nodes in the cluster. The MPR set selection algorithm is consistent with OLSR standard protocol file RFC.3626. After the MPR dominating point is calculated, the cluster head sends a BACKBONE message to inform all member nodes of the calculated MPR dominating point set. We present the following steps to build an MCDS within a cluster:
1) and the cluster head acquires the addresses and the topology information of all the member nodes according to the contents of HELLO message interaction, and strips out the self-clustering topology view.
2) According to the clustered topology, the cluster head calculates the MPR nodes covering all the member nodes by utilizing an MPR set selection algorithm, and marks the MPR nodes as MPR dominant points.
3) The cluster head node records the self address and the addresses of the MPR Dominator points in an MPR Dominator Set (MPR domino Set), and informs all member nodes of the information of the MPR Dominator points of the cluster by sending a BACKBONE message.
4) After receiving the BACKBONE message sent by the cluster head of the member node, the member node records the MPR node address and the cluster head address contained in the message in the MPR dominating point set. If the MPR dominating point set recorded in the BACKBONE message contains the address of the member node, the member node marks the BACKBONE network state of the member node as the BACKBONE network stateMPR dominator。
After the MCDS in the cluster is established, the TC message and the CTC message may reach all nodes of the cluster through the MPR dominant point. However, in order to make the flooded routing message reach all nodes in the network, we need to connect MCDS of different clusters.
(2) Establishment of CDS in clusters
We add a gateway node for each clustered MCDS so that it can connect all neighboring clusters. We call these newly added gateway nodes as gateway dominating points, and the process of selecting gateway dominating points by the cluster head is as follows: all GATEWAY nodes of the cluster send GATEWAY messages to the cluster head, and the content of the GATEWAY nodes comprises the self address of the GATEWAY nodes and the cluster head addresses of all adjacent clusters discovered by the GATEWAY nodes; the cluster head selects the least number of Gateway nodes as Gateway dominating points (Gateway routers) according to the neighbor cluster information gathered by all Gateway nodes, and adds the Gateway nodes into the cluster MCDS to form the cluster CDS covering all neighbor clusters.
The establishment of the CDS within a cluster is as follows:
1) all GATEWAY nodes send GATEWAY messages to their own cluster heads, and their contents include their own addresses and the cluster head addresses of all neighboring clusters that they find.
2) After receiving the GATEWAY message, the cluster head records the address of the head of the adjacent cluster and the address of the GATEWAY node contained in the GATEWAY Set (GATEWAY Set), and the elements of the Set are vectors formed by the address of the cluster head of the adjacent cluster and all the addresses of the GATEWAY nodes adjacent to the adjacent cluster.
3) The cluster head computing gateway dominates the nodes. Firstly, if a cluster head is adjacent to a neighbor cluster node, selecting the cluster head as a gateway control point, and deleting related entries of all neighbor cluster head addresses found by the cluster head in a gateway set; if the gateway set is not empty after the steps, selecting an MPR dominant point connected with most adjacent clusters from the MPR dominant point set by each round of cluster head, selecting the MPR dominant point as a gateway dominant point, and deleting the entries related to all adjacent clusters in the gateway set until the gateway set is empty; if the gateway set is still not empty after traversing all MPR dominating points, the cluster head selects a gateway node connected with most adjacent clusters from the gateway nodes in each round, marks the gateway node as the gateway dominating point, and deletes entries related to all adjacent clusters in the gateway set until the gateway set is empty. The algorithm steps are shown in fig. 1.
4) After the cluster head completes the calculation of the gateway dominating point, all the gateway dominating points are recorded in the gateway dominating point set, and the gateway dominating point set is added into the BACKBONE message and then is sent to all the member nodes.
5) And after receiving the BACKBONE message sent by the cluster head, all the member nodes record a gateway dominating point set. If BACKBONE messageIf the recorded gateway dominating point set contains the address of the member node, the member node marks the backbone network state of itself asGateway dominator。
After the selection of the gateway dominating point is completed, the intra-cluster MCDS of each cluster is expanded into intra-cluster CDS. The intra-cluster CDSs of each cluster are connected with all adjacent clusters, and the intra-cluster CDSs of all the clusters form a virtual backbone network of the network.
(3) Relay node selection
After the virtual backbone network is constructed, in order to ensure that each routing message for flooding can propagate in the virtual backbone network and reach all nodes in the network, we need to select a suitable relay node to connect parts of the virtual backbone network in different clusters with each other.
After a node learns that the node is a gateway control Point, the node needs to select a neighbor node with the maximum connectivity degree in each neighbor cluster connected with the node to forward a TC or CTC message sent or forwarded by the gateway control Point, and the neighbor node of the neighbor cluster selected by the gateway control Point is called a Relay node (Relay Point) of the gateway control Point. Since each member node in a neighboring cluster must be a node in its intra-cluster CDS or adjacent to a node in its intra-cluster CDS, routing messages generated or forwarded by the gateway's dominating point can reach all nodes in each neighboring cluster through its selected relay node. The gateway dominating Point informs neighbor neighbors to become RELAY nodes thereof by sending a RELAY _ POINTS message, and the RELAY node refers to the gateway dominating Point for selecting the RELAY node as a RELAY Point Selector (RELAY Point Selector).
The gateway control point may be directly connected to the CDS in the neighboring cluster, but cannot judge whether to connect to the CDS of the neighboring cluster because of its lack of information on the CDS of the neighboring cluster. In the above case, the relay node selected by the gateway dominance point does not have to forward the routing message from the gateway dominance point. Therefore, if the relay node finds that its relay point selector is connected to the CDS of its own cluster, the relay node does not forward the route flooding message from the gateway dominating point.
(4) Isolated node processing
Isolated nodes may exist in the network, and the analysis and processing are required for the special case.
For the processing of isolated points, we proceed as follows. Since the isolated node sets its cluster head address field to null in the HELLO message, it can be detected by the neighbor node. An isolated node may be surrounded by a plurality of clusters, and if all the clusters adjacent to the isolated node are communicated with the isolated node and a gateway control point is newly added, a larger redundancy is generated. For each isolated node, the node only needs to inquire the neighbor with the maximum connectivity degree about the global topology information by periodically sending the TC-REQ message, and the cluster adjacent to the node does not need to forward the routing message to the node.
However, routing messages for other nodes must in some cases be forwarded through the isolated node, otherwise the message may not be flooded to the entire network. FIG. 2 shows an example of the above case where the white circles are member nodes, the black circles are clusterheads, and the grid circles are isolated nodes; the triangle and the square are respectively marked with an MPR dominant point and a gateway dominant point, and the diamond is marked with a relay node of the gateway dominant point; the flooding of the TC/CTC message must pass through the orphan node J.
In order to solve the above problem, after receiving the TC or CTC message from another node, the isolated node must forward the message to all its neighboring nodes.
In addition to this, the routing of the data packet may also have to go through an isolated node, such as the route between two clusters in fig. 2. Therefore, TC messages generated by isolated nodes need to be flooded to the whole network. To solve this problem, the isolated node needs to select one relay node in each neighboring cluster adjacent to the isolated node to forward the TC message generated by the isolated node.
After the virtual backbone is established, we give the flooding forwarding rules for routing messages:
1) and the gateway control point selects a neighbor node with the maximum connectivity as a relay node of the gateway control point in each neighbor cluster adjacent to the gateway control point. After all the RELAY nodes of the adjacent cluster are selected, the gateway node sends a RELAY _ POINTS message to inform the nodes to become the RELAY nodes.
2) After the node receives the RELAY _ POINTS message from the adjacent cluster, if the message contains the address of the node, the source node of the message is recorded as the RELAY point selector of the node.
3) And after the relay node receives the TC or CTC message sent or forwarded by the relay point selector, searching whether a node is adjacent to the relay point selector in the MPR dominant point set and the gateway dominant point set of the cluster. If the existing node is adjacent to the relay point selector, the relay node does not forward the TC or CTC message, otherwise, the relay node forwards the TC or CTC message.
4) If the node is in the virtual backbone network, i.e. it is selected as an MPR dominating point or a gateway dominating point by the cluster head, it unconditionally forwards all received TC or CTC messages.
Fig. 3 shows an example of a virtual backbone network established by the clustering optimal link state routing method based on the virtual backbone network and a routing message flooding rule according to this embodiment. Wherein the white circles are member nodes, the black circles are cluster heads, and the grid circles are isolated nodes. The triangle and the square are respectively marked with MPR (maximum printed Circuit) dominant points and gateway dominant points, and the diamond is marked with the relay nodes of the gateway dominant points. The bold arrows represent the flooding process of the TC messages generated by node N.
In the maintenance stage of the virtual backbone network, a virtual backbone network suitable for a dynamic network and a maintenance mechanism of a routing message flooding rule are provided.
In the method for routing in a clustered optimal link state based on a virtual BACKBONE network described in this embodiment, a gateway node periodically reports neighboring cluster information to its own cluster head, and the cluster head periodically calculates an MPR dominating point and a gateway dominating point, and broadcasts a BACKBONE message to notify member nodes to confirm the BACKBONE network state. Thus, the member nodes can periodically maintain their backbone network status and intra-cluster CDS information, thereby maintaining virtual backbone networks and routing message flooding rules in dynamic networks. We denote this period as Backbone network period (Backbone peeriod).
In each backbone network period, the GATEWAY node sends a GATEWAY message to the cluster head, so that the latest adjacent cluster information is submitted to the cluster head. The cluster head sets an expiration Time (E, a clustering optimal link state routing method duration Time based on a virtual backbone network) for each entry in the gateway set to delete the expiration information. The maintenance algorithm of the gateway set is as follows: each adjacent cluster head address in the gateway set corresponds to a plurality of gateway nodes, and each gateway node has respective expiration time for the entry of a certain adjacent cluster head address; after the cluster head receives a GATEWAY message of the GATEWAY node, finding a corresponding entry in the GATEWAY set for each adjacent cluster head address in the GATEWAY message, and updating the expiration time of the GATEWAY node in each adjacent cluster head entry; and when the expiration time of the gateway node is overtime in a certain entry of the gateway set, deleting the gateway node in the entry, and if the entry loses all the gateway nodes, deleting the entry.
Through the above process, the cluster head can obtain the latest adjacent cluster information, so the latest intra-cluster CDS can be calculated every backbone network period: in each BACKBONE network period, the cluster head calculates an MPR (maximum printed circuit board) dominating point set and a gateway dominating point set according to the newly obtained adjacent cluster information, and sends a BACKBONE (backup discovery) message to inform all member nodes after the calculation is finished; the member nodes set expiration time for the BACKBONE network state of the member nodes, periodically check whether the BACKBONE network state of the member nodes is overtime or not in each BACKBONE network, and update the expiration time of the BACKBONE network state of the member nodes by receiving a BACKBONE message; in addition, each gateway control point needs to recalculate the RELAY node after confirming the backbone network state, and sends a RELAY _ POINTS message to notify the RELAY node.
It should be noted that the establishment and maintenance of the virtual backbone network are dependent on the clustering structure of the network, so when the clustering status of the cluster head or member nodes expires, the backbone network status and the relay point status are immediately lost.
The behavior of the cluster head node in the virtual backbone network maintenance phase can be described as follows:
1) after receiving the GATEWAY message, the cluster head updates the information of the relevant entry in the GATEWAY set and updates the expiration time of the entry. At any time, if an entry in the gateway set is expired, the cluster head immediately deletes the entry.
2) In each BACKBONE network period, the cluster head recalculates the MPR dominating point set and the gateway dominating point set according to the adjacent cluster information in the gateway set, and respectively sends a BACKBONE message to inform all member nodes.
3) If the clustering state of the cluster head changes, the cluster head immediately loses the existing backbone network state and resets the backbone network state to the state of the backbone networkunset。
The behavior of the member nodes in the maintenance phase of the virtual backbone network can be described as follows:
1) at each backbone cycle, a member as a GATEWAY node will send a GATEWAY message containing the latest neighbor cluster information to the cluster head.
2) And after receiving the BACKBONE message from the cluster head, the member nodes update the BACKBONE network state of the member nodes. If the MPR dominating point and the gateway dominating point find that the MPR dominating point and the gateway dominating point are not selected as the dominating point in the period, the state of the MPR dominating point or the gateway dominating point is abandoned, and otherwise, the expiration time of the state of the backbone network is updated. If some backbone network state of the node is not updated due to expiration, the node immediately loses the corresponding backbone network state.
3) In each backbone network period, the gateway control point selects a RELAY node in each adjacent cluster adjacent to the gateway control point, and sends a RELAY _ nodes message to notify the RELAY node of the gateway control point.
4) When the node receives the RELAY _ POINTS message of the gateway control point, the node becomes the RELAY node of the message source node and updates the expiration time of the state of the RELAY node. And if the RELAY node does not receive the RELAY _ POINTS message of the RELAY point selector after the timeout, the RELAY node which is taken as the gateway dominating point is abandoned.
5) If the clustering state of the member node changes, the member node immediately loses the existing backbone network and relay point states, and the backbone network state is reset to unset.
The technical principles of the present invention have been described above in connection with specific embodiments, which are intended to explain the principles of the present invention and should not be construed as limiting the scope of the present invention in any way. Based on the explanations herein, those skilled in the art will be able to conceive of other embodiments of the present invention without inventive effort, which would fall within the scope of the present invention.
Claims (10)
1. A clustering optimal link state routing method based on a virtual backbone network is characterized in that: the method comprises the steps of establishing a virtual backbone network and maintaining the virtual backbone network on a clustering structure constructed by a clustering OLSR routing method based on management message merging;
in the process of establishing a virtual backbone network, firstly, a cluster head node calculates MCDS capable of dominating all nodes in a cluster, each cluster head selects a minimum number of gateway nodes to add into the clustered MCDS, then, a CDS capable of reaching all adjacent clusters is established, and the CDS of all clusters in the network forms the backbone network of the network; in addition, each cluster also needs to select a relay node in an adjacent cluster, and the relay node forwards the routing message from the cluster; setting a forwarding rule of routing message flooding based on the establishment of a virtual backbone network and the selection of a relay node;
in the maintenance stage of the virtual backbone network, the cluster head is used for periodically maintaining the virtual backbone network and sending a message to inform member nodes of the virtual backbone network to update the state of the backbone network; the gateway node periodically submits the adjacent cluster nodes discovered by the gateway node to the cluster head, so that the cluster head can acquire the latest adjacent cluster information.
2. The virtual backbone network-based clustering optimal link state routing method according to claim 1, wherein: the establishment of the MCDS in the cluster comprises the following steps:
s1, a cluster head acquires addresses and topology information of all member nodes according to contents of HELLO message interaction, and a self-clustered topology view is stripped;
s2, according to the clustered topology, calculating the MPR nodes covering all member nodes by the cluster head through an MPR set selection algorithm, and marking the MPR nodes as MPR dominant points;
s3, the cluster head node records the self address and the addresses of the MPR dominating points in an MPR dominating point set, and informs all member nodes of the information of the MPR dominating points of the cluster by sending a BACKBONE message;
after receiving a BACKBONE message sent by a cluster head of a member node, recording an MPR node address and a cluster head address contained in the message in an MPR dominating point set; if the MPR dominator set recorded in the BACKBONE message contains the address of the member node, the member node marks the self BACKBONE network state as the MPR dominator.
3. The virtual backbone network-based clustering optimal link state routing method according to claim 2, wherein: the establishment of the CDS within the cluster comprises the following steps:
s1, all GATEWAY nodes send GATEWAY messages to own cluster heads, and the content of the GATEWAY nodes comprises own addresses and cluster head addresses of all adjacent clusters discovered by the GATEWAY nodes;
s2, after receiving the GATEWAY message, the cluster head records the adjacent cluster head address and the GATEWAY node address contained in the GATEWAY set, wherein the elements of the set are vectors formed by the cluster head address of the adjacent cluster and all the GATEWAY node addresses adjacent to the adjacent cluster;
s3, calculating a gateway dominating node by the cluster head;
s4, after the cluster head completes the calculation of the gateway dominating points, all the gateway dominating points are recorded in a gateway dominating point set, and the gateway dominating point set is added into a BACKBONE message and then sent to all the member nodes;
after receiving the BACKBONE message sent by the cluster head, all member nodes record a gateway control point set; if the gateway dominating point set recorded in the BACKBONE message contains the address of the member node, the member node marks the BACKBONE network state of the member node as the gateway dominating point.
4. The virtual backbone network-based clustering optimal link state routing method according to claim 3, wherein: the method for calculating the gateway dominating node comprises the following steps: firstly, if a cluster head is adjacent to a neighbor cluster node, selecting the cluster head as a gateway control point, and deleting related entries of all neighbor cluster head addresses found by the cluster head in a gateway set; if the gateway set is not empty after the steps, selecting an MPR dominant point connected with most adjacent clusters from the MPR dominant point set by each round of cluster head, selecting the MPR dominant point as a gateway dominant point, and deleting the entries related to all adjacent clusters in the gateway set until the gateway set is empty; if the gateway set is still not empty after traversing all MPR dominating points, the cluster head selects a gateway node connected with most adjacent clusters from the gateway nodes in each round, marks the gateway node as the gateway dominating point, and deletes entries related to all adjacent clusters in the gateway set until the gateway set is empty.
5. The virtual backbone network-based clustering optimal link state routing method according to claim 4, wherein: the method for selecting the relay node comprises the following steps: the gateway dominating point informs neighbor neighbors to become RELAY nodes of the gateway dominating point by sending a RELAY _ POINTS message, and the RELAY nodes call the gateway dominating point selected by the RELAY nodes as a RELAY point selector; if the relay node finds that the relay point selector is connected with the CDS of the cluster, the relay node does not forward the route flooding message from the gateway dominating point.
6. The virtual backbone network-based clustering optimal link state routing method according to claim 5, wherein: the method also comprises a method for processing the isolated node: each isolated node periodically sends TC request information, inquires the global topology information of the neighbor with the maximum connectivity, and the adjacent cluster does not need to forward the routing information to the isolated node; after receiving TC or CTC messages from other nodes, an isolated node needs to forward the messages to all neighbor nodes of the isolated node; the isolated node needs to select one relay node in each neighboring cluster adjacent to the isolated node to forward the TC message generated by the isolated node.
7. The virtual backbone network-based clustered optimal link state routing method according to claim 6, wherein: the flooding forwarding rule of the routing message comprises the following steps:
s1, a gateway control point selects a neighbor node with the maximum connectivity as a relay node of the gateway control point in each neighbor cluster adjacent to the gateway control point; after the RELAY nodes of all the adjacent clusters are selected, the gateway node sends a RELAY _ POINTS message to inform the nodes to become the RELAY nodes;
s2, after the node receives a RELAY _ POINTS message from the adjacent cluster, if the message contains the address of the node, recording the source node of the message as a RELAY point selector of the node;
s3, after the relay node receives TC or CTC messages sent or forwarded by the relay selector, searching whether a node is adjacent to the relay selector or not in the MPR dominant point set and the gateway dominant point set of the cluster; if the existing node is adjacent to the relay point selector, the relay node does not forward the TC or CTC message, otherwise, the relay node forwards the TC or CTC message;
and S4, if the node is in the virtual backbone network, namely the node is selected as an MPR (maximum printed Circuit) dominant point or a gateway dominant point by the cluster head, unconditionally forwarding all received TC or CTC messages.
8. The method according to claim 7, wherein the method comprises: in the maintenance phase of the virtual BACKBONE network, the gateway node periodically reports the adjacent cluster information to the cluster head of the gateway node, and the cluster head periodically calculates the MPR dominant point and the gateway dominant point and broadcasts a BACKBONE message to inform the member nodes to confirm the BACKBONE network state.
9. The method according to claim 8, wherein the method comprises: in the maintenance stage of the virtual backbone network, the GATEWAY node periodically sends GATEWAY messages to the cluster head, and the cluster head sets expiration time for each entry in the GATEWAY set to delete the expiration information; the maintenance algorithm of the gateway set is as follows: each adjacent cluster head address in the gateway set corresponds to a plurality of gateway nodes, and each gateway node has respective expiration time for the entry of a certain adjacent cluster head address; after the cluster head receives a GATEWAY message of the GATEWAY node, finding a corresponding entry in the GATEWAY set for each adjacent cluster head address in the GATEWAY message, and updating the expiration time of the GATEWAY node in each adjacent cluster head entry; and when the expiration time of the gateway node is overtime in a certain entry of the gateway set, deleting the gateway node in the entry, and if the entry loses all the gateway nodes, deleting the entry.
10. The method according to claim 9, wherein the method comprises: in each period, the cluster head calculates an MPR (maximum printed circuit board) dominating point set and a gateway dominating point set according to the newly obtained adjacent cluster information, and sends a BACKBONE (backup discovery) message to inform all member nodes after the calculation is finished; the member nodes set expiration time for the BACKBONE network state of the member nodes, periodically check whether the BACKBONE network state of the member nodes is overtime or not in each BACKBONE network, and update the expiration time of the BACKBONE network state of the member nodes by receiving a BACKBONE message; in addition, each gateway control point needs to recalculate the RELAY node after confirming the backbone network state, and sends a RELAY _ POINTS message to inform the RELAY node; when the cluster state of the cluster head or member nodes expires, it immediately loses backbone network state and relay point state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210330968.5A CN114727354B (en) | 2022-03-30 | 2022-03-30 | Clustering optimal link state routing method based on virtual backbone network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210330968.5A CN114727354B (en) | 2022-03-30 | 2022-03-30 | Clustering optimal link state routing method based on virtual backbone network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114727354A true CN114727354A (en) | 2022-07-08 |
| CN114727354B CN114727354B (en) | 2023-12-01 |
Family
ID=82240738
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210330968.5A Active CN114727354B (en) | 2022-03-30 | 2022-03-30 | Clustering optimal link state routing method based on virtual backbone network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114727354B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115955680A (en) * | 2023-03-14 | 2023-04-11 | 南京邮电大学 | Virtual backbone network establishing and routing method based on clustering communication |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080247335A1 (en) * | 2007-04-05 | 2008-10-09 | Harris Corporation | Ad-hoc network routing protocol including the use of forward and reverse multi-point relay (mpr) spanning tree routes |
| CN108337166A (en) * | 2018-02-06 | 2018-07-27 | 吕娜 | A kind of highly reliable Routing Protocol of low time delay of Aviation cluster network |
| CN109714260A (en) * | 2019-01-04 | 2019-05-03 | 浙江大学 | Implementation method based on UCDS algorithm building virtual backbone network in OLSR Routing Protocol |
| CN110139304A (en) * | 2019-05-11 | 2019-08-16 | 东南大学 | MPR set option method based on isolated degree and non-MPR node |
| CN111669798A (en) * | 2020-05-28 | 2020-09-15 | 华南理工大学 | Method for dynamically generating control information of OLSR (on-line analytical processing) routing protocol |
| US20200374224A1 (en) * | 2019-05-20 | 2020-11-26 | The Regents Of The University Of California | Techniques for loop-free dynamic on-demand and proactive routing in communications networks |
-
2022
- 2022-03-30 CN CN202210330968.5A patent/CN114727354B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080247335A1 (en) * | 2007-04-05 | 2008-10-09 | Harris Corporation | Ad-hoc network routing protocol including the use of forward and reverse multi-point relay (mpr) spanning tree routes |
| CN108337166A (en) * | 2018-02-06 | 2018-07-27 | 吕娜 | A kind of highly reliable Routing Protocol of low time delay of Aviation cluster network |
| CN109714260A (en) * | 2019-01-04 | 2019-05-03 | 浙江大学 | Implementation method based on UCDS algorithm building virtual backbone network in OLSR Routing Protocol |
| CN110139304A (en) * | 2019-05-11 | 2019-08-16 | 东南大学 | MPR set option method based on isolated degree and non-MPR node |
| US20200374224A1 (en) * | 2019-05-20 | 2020-11-26 | The Regents Of The University Of California | Techniques for loop-free dynamic on-demand and proactive routing in communications networks |
| CN111669798A (en) * | 2020-05-28 | 2020-09-15 | 华南理工大学 | Method for dynamically generating control information of OLSR (on-line analytical processing) routing protocol |
Non-Patent Citations (2)
| Title |
|---|
| 施韦等: "移动自组织网络中一种基于多点中继策略的优化泛洪广播算法", 计算机研究与发展 * |
| 朱炳键: "大规模移动自组网虚拟骨干网构建与路由策略研究", 硕士学位论文 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115955680A (en) * | 2023-03-14 | 2023-04-11 | 南京邮电大学 | Virtual backbone network establishing and routing method based on clustering communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114727354B (en) | 2023-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| RU2682930C2 (en) | Route selection in wireless networks | |
| JP4145294B2 (en) | Time Transition Network Protocol (TTNP) in mobile ad hoc networks | |
| US10250503B2 (en) | Routing method and wireless node for wireless mesh network | |
| CN106411736B (en) | Node resource discovery strategy optimization method for software-defined satellite network | |
| US7936732B2 (en) | Selecting aggregation nodes in a network | |
| CN108366093B (en) | Distributed wireless ad hoc network based on virtual center and mobile agent | |
| WO2017020619A1 (en) | Routing method and device | |
| US10979340B2 (en) | Link state addition and deletion based on reception of a single message in link state vector routing | |
| CN111432439B (en) | UPF data plane extension and system thereof | |
| JP2011501921A (en) | Method for adjusting node and routing table update interval of wireless communication network | |
| JP5004999B2 (en) | Hybrid mesh routing protocol | |
| CN114727354A (en) | Clustering optimal link state routing method based on virtual backbone network | |
| Chau et al. | IDRM: Inter-Domain Routing Protocol for Mobile Ad Hoc Networks | |
| JP4767329B2 (en) | Network system and communication method | |
| WO2023184213A1 (en) | Clustered optimized link state routing method based on virtual backbone network | |
| WO2011047581A1 (en) | Method and system for discovering ring network protection information | |
| CN114339931A (en) | Clustering-based active routing method for unmanned aerial vehicle ad hoc network | |
| CN114785726B (en) | Clustering OLSR routing method based on management message merging | |
| CN106973422B (en) | Improved algorithm of DSR protocol | |
| JPWO2008105039A1 (en) | Nodes in ad hoc networks and ad hoc network systems | |
| CN114143249B (en) | Method and device for determining routing information, electronic equipment and storage medium | |
| CN115865775B (en) | Unmanned aerial vehicle network rapid route recovery method based on OLSR | |
| CN114641050A (en) | Energy-saving routing protocol method for unmanned aerial vehicle ad hoc network load sensing | |
| US20210084591A1 (en) | Parent device shadow execution for a sleeping low power and lossy network child network device | |
| Frelechoux et al. | Topology optimization of IP over ATM |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |