CN114727354B - 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
- CN114727354B CN114727354B CN202210330968.5A CN202210330968A CN114727354B CN 114727354 B CN114727354 B CN 114727354B CN 202210330968 A CN202210330968 A CN 202210330968A CN 114727354 B CN114727354 B CN 114727354B
- Authority
- CN
- China
- Prior art keywords
- gateway
- node
- cluster
- backbone network
- message
- 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
- 238000000034 method Methods 0.000 title claims abstract description 43
- 241000854291 Dianthus carthusianorum Species 0.000 claims abstract description 95
- 238000004353 relayed correlation spectroscopy Methods 0.000 claims description 23
- 238000012423 maintenance Methods 0.000 claims description 11
- 238000004422 calculation algorithm Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 5
- 230000003993 interaction Effects 0.000 claims description 4
- 239000013598 vector Substances 0.000 claims description 2
- 238000003672 processing method Methods 0.000 claims 1
- 238000010187 selection method Methods 0.000 claims 1
- 230000007246 mechanism Effects 0.000 abstract description 8
- 238000004891 communication Methods 0.000 abstract description 2
- KRTSDMXIXPKRQR-AATRIKPKSA-N monocrotophos Chemical compound CNC(=O)\C=C(/C)OP(=O)(OC)OC KRTSDMXIXPKRQR-AATRIKPKSA-N 0.000 description 6
- 238000012545 processing Methods 0.000 description 3
- 239000010432 diamond Substances 0.000 description 2
- 230000008531 maintenance mechanism Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 229910003460 diamond Inorganic materials 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
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 MCDS which can govern all nodes in the cluster, each cluster prefers the least gateway nodes to join the MCDS of the cluster, then builds CDS which can reach all adjacent clusters, and the CDS of all clusters in the network forms a backbone network of the network. Each cluster also needs to select a relay node in the neighbor cluster to forward the routing message from the cluster. And setting forwarding rules of route message flooding. The cluster head periodically maintains the virtual backbone network and sends a message informing its member nodes to update its own backbone network state. And the virtual backbone network is adopted to replace an MPR mechanism to carry out the flooding of the routing information, and the routing cost of the OLSR protocol is reduced by optimizing the forwarding times when the routing information is flooded.
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 patent application document of application number 202210303763.8, a method for clustering OLSR routing based on management message merging is provided, and the routing method is essentially a new routing protocol, and the main contents of the method include: establishing a clustering structure in a network, selecting cluster heads in a two-hop range by a node through a maximum connectivity clustering algorithm, and establishing clusters in the two-hop range by the cluster heads; the method comprises the steps of designing a clustering period maintenance mechanism and a clustering merging mechanism, and maintaining the stability of a network clustering structure in a dynamic network through periodical information interaction of cluster heads and member nodes and the clustering merging mechanism; the method comprises the steps of designing a routing message management mechanism of the OLSR, collecting routing messages of member nodes by cluster head nodes, merging the routing messages of the members by the cluster head nodes, then carrying out flooding, reducing routing cost by reducing head redundancy of the routing messages, monitoring topology change conditions of the cluster head according to the routing messages of each member, and reducing unnecessary routing cost by reducing flooding frequency of the member routing messages with stable topology.
On the basis of the routing protocol, a new routing mechanism needs to be further developed to optimize the forwarding times in message flooding so as to reduce the routing overhead of the OLSR protocol.
Disclosure of Invention
In order to overcome the defects in the prior art, 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 carry out the flooding of routing information, and reduces the routing overhead of an OLSR protocol by optimizing the forwarding times when the routing information is flooded.
In order to achieve the above object, the present 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 the Chinese patent application document based on application number 202210303763.8, a virtual backbone network is established and maintained on a clustering structure constructed by a clustering OLSR routing method based on management message combination;
in the establishing process of the virtual backbone network, the cluster head node firstly calculates MCDS which can govern all nodes in the cluster, each cluster prefers the least gateway nodes to join the MCDS of the cluster, then establishes CDS which can reach all adjacent clusters, 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 the adjacent cluster, and the routing message from the cluster is forwarded through the relay node; setting a forwarding rule of route 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 virtual backbone network is periodically maintained by using a cluster head, and a message is sent to inform member nodes of the virtual backbone network to update the backbone network state of the member nodes; the gateway node periodically submits the discovered adjacent cluster nodes to the cluster head, so that the cluster head can acquire the latest adjacent cluster information.
The technical scheme can be seen 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 carry out the flooding of routing information, and reduces the routing expense of an OLSR protocol by optimizing the forwarding times when the routing information is flooded.
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 flow chart of a calculation algorithm of gateway dominant points of a clustering optimal link state routing method based on a virtual backbone network according to the present invention;
FIG. 2 is an illustration of isolated nodes that affect global flooding of routing messages in a virtual backbone network-based clustering 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 a virtual backbone network-based clustering optimal link state routing method according to the present invention.
Detailed Description
Embodiments of the present invention are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative and intended to explain the present invention and should not be construed as limiting the invention.
Examples
The content of the clustering optimal link state routing method based on the virtual backbone network in the embodiment is as follows: a virtual backbone network is established and maintained on a clustering structure constructed by a clustering OLSR routing method based on management message combination, which is proposed in the Chinese patent application document of application number 202210303763.8. The method is mainly divided into two parts: virtual backbone establishment and virtual backbone maintenance.
The establishment of the virtual backbone network can be divided into four parts: establishment of MCDS in a cluster, establishment of CDS in a cluster, relay node selection, and isolated node processing.
To describe nodes in the backbone network, in this embodiment we define three different backbone states, includingMPR dominator(MPR dominant points for identifying nodes in the minimum connectivity dominant set within the cluster),Gateway Dominator(gateway dominating point for identifying gateway nodes in the intra-cluster dominating set),Relay Point(Relay node for identifying relay nodes selected by gateway dominant points within neighbor clusters), andunset(not assigned to the backbone). The initial backbone network state of all nodes isunset. It should be noted that one node may be both MPR dominant point and gateway dominant point.
(1) Establishment of MCDS within cluster
First, we introduce the set-up procedure of MCDS within a cluster. After the clustering is completed, the cluster head node calculates the MCDS capable of covering all nodes in the cluster by using the known information. The cluster head can obtain the information of all member nodes through interaction of HELLO messages. Therefore, the cluster head only needs to strip the topological view of the cluster from the neighbor topological information in the two-hop range, so that the MPR nodes covering all member nodes in the cluster can be calculated through the selection algorithm of the MPR set and are called MPR dominant points. All MPR dominant points and cluster heads constitute the MCDS covering all nodes in the cluster. Wherein, the selection algorithm of the MPR set is consistent with the OLSR standard protocol file RFC.3626. After the calculation of the MPR dominant points is completed, the cluster head will send a back set message, informing all member nodes of its calculated MPR dominant point set. We give the steps of setting up the MCDS within a cluster as follows:
1) And the cluster head acquires the addresses of all member nodes and the topology information thereof according to the interaction content of the HELLO message, and strips the topology view of the self-cluster.
2) According to the topology of the cluster, the cluster head calculates the MPR nodes covering all member nodes by using an MPR set selection algorithm and marks the MPR nodes as MPR dominant points.
3) The cluster head node records its own address and addresses of these MPR dominant points in an MPR dominant point set (MPR Dominator Set), and informs all member nodes of the information of the MPR dominant points of the present cluster by sending a back box message.
4) After receiving the BACKBONE message sent by the cluster head, the member node records the MPR node address and the cluster head address contained in the message in the MPR dominant point set. If the MPR dominant 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 self BACKBONE network stateMPR dominator。
After the intra-cluster MCDS is established, TC messages and CTC messages may reach all nodes of the cluster through MPR dominant points. However, in order for a flooded routing message to reach all nodes in the network, we need to communicate the MCDS of the different clusters.
(2) Intra-cluster CDS establishment
We add a gateway node for each clustered MCDS so that it can connect all neighbor clusters. We call these newly added gateway nodes as gateway dominant points, and the procedure for cluster to choose gateway dominant points is as follows: all GATEWAY nodes of the cluster send GATEWAY information to the cluster head, and the content of the GATEWAY information comprises the address of the GATEWAY node and the cluster head address of all adjacent clusters discovered by the GATEWAY node; the cluster head selects the least gateway nodes as gateway dominant points (Gateway Dominator) according to the neighbor cluster information summarized by all the gateway nodes, and adds the gateway nodes into the MCDS in the cluster to form the CDS in the cluster covering all the neighbor clusters.
The process of establishing the intra-cluster CDS is as follows:
1) All GATEWAY nodes send GATEWAY information to own cluster heads, and the content of the GATEWAY information comprises own addresses and cluster head addresses of all adjacent clusters discovered by the GATEWAY nodes.
2) After receiving the GATEWAY message, the cluster head records the adjacent cluster head address and GATEWAY node address contained in the GATEWAY Set (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.
3) The cluster head computing gateway hosts the node. Firstly, if a cluster head is adjacent to an adjacent cluster node, selecting the cluster head as a gateway dominant point, and deleting related entries of all adjacent cluster head addresses found by the cluster head in a gateway set; if the gateway set is not empty after the steps, selecting one MPR dominant point connected with the most adjacent clusters from the MPR dominant point set by the cluster head every round, selecting the MPR dominant point as the gateway dominant point, and deleting entries related to all adjacent clusters adjacent to the MPR dominant point in the gateway set until the gateway set is empty; if the gateway set is still not empty after traversing all MPR dominant points, selecting one gateway node connected with the most adjacent clusters from the gateway nodes by the cluster head every round, marking the gateway node as the gateway dominant point, and deleting entries related to all adjacent clusters adjacent to the gateway node in the gateway set until the gateway set is empty. The algorithm steps are shown in fig. 1.
4) After the cluster head finishes the calculation of the gateway dominant points, all the gateway dominant points are recorded in a gateway dominant point set, and the gateway dominant point set is added into a BACKBONE message and then is sent to all the member nodes.
5) And after receiving the BACKBONE message sent by the cluster head, all member nodes record the gateway dominant point set. If the gateway dominant 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 self BACKBONE network stateGateway dominator。
After the selection of the gateway dominant points is completed, we expand the intra-cluster MCDS of each cluster to intra-cluster CDS. The intra-cluster CDS of each cluster establishes connections with all neighboring clusters, and the intra-cluster CDS of all clusters forms 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 appropriate relay nodes to connect the parts of the virtual backbone network within different clusters to each other.
When the node knows that the node is a gateway dominant Point, it needs to select a neighbor node with the largest connectivity in each neighbor cluster connected with the node to forward a TC or CTC message sent or forwarded by the gateway dominant Point, and the neighbor node of the neighbor cluster selected by the gateway dominant Point is called a Relay node (Relay Point) of the gateway dominant Point. Since each member node in a neighbor cluster must be a node in its intra-cluster CDS or adjacent to a node in its intra-cluster CDS, the gateway dominant point generates or forwards routing messages that can reach all nodes in each neighbor cluster through its selected relay node. The gateway dominant point informs the neighbor cluster neighbor to become its RELAY node by sending a relay_point message, and the RELAY node refers to the gateway dominant point that will select it as a RELAY point selector (Relay Point Selector).
The gateway dominant point may be directly connected to the CDS in the cluster of the neighboring cluster, but it cannot be determined whether to connect to the CDS of the neighboring cluster due to its lack of CDS information of the neighboring cluster. In the above case, the relay node selected by the gateway dominant point does not have to forward the routing message from the gateway dominant point. Therefore, if the relay node finds that its relay node selector is connected to the CDS of the cluster, the relay node does not forward the route flooding message from the gateway dominant point.
(4) Isolated node processing
Isolated nodes may exist in the network and we need to analyze and handle this special case.
For the processing of outliers, we will make the following explanation. The isolated node sets the cluster head address field of the isolated node to be null in the HELLO message, so that the isolated node can be detected by the neighbor node. An isolated node may be surrounded by multiple clusters, and if all clusters adjacent to the isolated node have gateway dominant points added to communicate with the isolated node, greater redundancy may result. For each orphan node, it only needs to query the neighbor with the largest connectivity for global topology information by periodically sending TC-REQ messages, while clusters adjacent to it do not need to forward routing messages to it.
However, routing messages from other nodes must be forwarded by isolated nodes in some cases, otherwise the messages may not be flooded to the whole network. Fig. 2 gives an example of the above case, in which white circles are member nodes, black circles are cluster heads, and 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; flooding of TC/CTC messages must pass through isolated nodes J.
To solve the above problem, after receiving TC or CTC messages from other nodes, the isolated node needs to forward the messages to all its neighboring nodes.
In addition, the routing of data packets may also have to go through isolated nodes, such as the routing between two clusters in fig. 2. Therefore, TC messages generated by orphaned nodes need to be flooded to the whole network. To solve this problem, an orphan node needs to select one relay node in each neighboring cluster adjacent thereto to forward its generated TC message, respectively.
After the virtual backbone network is established, we present the flooding forwarding rules for routing messages:
1) The gateway dominant point selects a neighbor node with the largest connectivity in each adjacent cluster as a relay node of the neighbor node in the adjacent cluster. After selecting the RELAY nodes of all the adjacent clusters, the gateway node sends a relay_POINTS message to inform the nodes to become RELAY nodes.
2) After the node receives the RELAY_POINTS message from the adjacent cluster, if the message contains the self address, the source node of the message is recorded as the RELAY point selector.
3) And after the relay node receives the TC or CTC message sent or forwarded by the relay point selector, searching whether any 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 existence node is found to be adjacent to the relay point selector, the relay node does not forward the TC or CTC message, otherwise, the TC or CTC message is forwarded.
4) If a node is in the virtual backbone, i.e. it is preferred by the cluster to be either an MPR dominant point or a gateway dominant point, it unconditionally forwards all received TC or CTC messages.
Fig. 3 shows an example of a virtual backbone network established by a clustering optimal link state routing method based on the virtual backbone network and a routing message flooding rule according to the present embodiment. Wherein white circles are member nodes, black circles are cluster heads, and grid circles are isolated nodes. Triangles and squares mark MPR dominant points and gateway dominant points respectively, and diamonds mark relay nodes of gateway dominant points. The bold arrow represents the flooding process of the TC message generated by node N.
In the virtual backbone maintenance phase, we present a maintenance mechanism for virtual backbone and routing message flooding rules applicable to dynamic networks.
In the method for routing the clustering optimal link state based on the virtual BACKBONE network according to the embodiment, 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 backup message to inform member nodes to confirm the BACKBONE network state. Thus, member nodes can periodically maintain their backbone state and intra-cluster CDS information, thereby maintaining virtual backbones and routing message flooding rules in the dynamic network. We note this period as Backbone period (Backbone peimod).
And in each backbone network period, the GATEWAY node sends a GATEWAY message to the cluster head so as to submit the latest adjacent cluster information to the cluster head. The cluster head sets an expiration Time (E-clustering optimal link state routing method period Time based on the virtual backbone network) for each entry in the gateway set, so as to delete the expiration information. The maintenance algorithm for 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 an entry of a certain adjacent cluster head address; after the cluster head receives the GATEWAY node's GATEWAY message, for each adjacent cluster head address in the GATEWAY message, find the corresponding entry in the GATEWAY set, and update the expiration time of the GATEWAY node in each adjacent cluster head entry; when the expiration time of a gateway node is overtime in a certain item of the gateway set, the gateway node is deleted in the item, and if the certain item loses all gateway nodes, the item is deleted.
Through the above process, the cluster head can obtain the latest neighbor cluster information, so that the latest intra-cluster CDS can be calculated in each backbone network period: in each BACKBONE network period, the cluster head calculates an MPR dominant point set and a gateway dominant point set according to the latest acquired neighbor cluster information, and sends a BACKBONE message to inform all member nodes after the calculation is completed; the member node sets an expiration time for the BACKBONE network state of the member node, checks whether the BACKBONE network state of the member node is overtime in each BACKBONE network period, and updates the expiration time of the BACKBONE network state of the member node by receiving a BACKBONE message; in addition, each gateway dominant point needs to recalculate the RELAY node after confirming its backbone state and send a relay_point message informing the RELAY node.
It should be noted that the establishment and maintenance of the virtual backbone network is dependent on the clustering structure of the network, so that when the clustering state of a cluster head or member node expires, it immediately loses the backbone network state and the relay point state.
The behavior of cluster head nodes in the virtual backbone maintenance phase can be described as follows:
1) After receiving the GATEWAY message, the cluster first updates the information of the related entries in the GATEWAY set and updates the expiration time of the entries. At any moment, if an entry in the gateway set expires, the cluster head immediately deletes the entry.
2) And in each BACKBONE network period, recalculating an MPR dominant point set and a gateway dominant point set according to neighbor cluster information in a gateway set by a cluster head, and respectively sending a BACKBONE message to inform all member nodes.
3) If the cluster state of the cluster head changes, the cluster head immediately loses the existing backbone network state and resets the backbone network state to beunset。
The behavior of the member node in the virtual backbone maintenance phase may be described as follows:
1) In each backbone cycle, a GATEWAY message containing the latest neighbor cluster information will be sent to the cluster head as a member of the GATEWAY node.
2) And after receiving the BACKBONE message from the cluster head, the member node updates the BACKBONE network state of the member node. If the MPR dominant point and the gateway dominant point are not selected as dominant points in the period, discarding the MPR dominant point or the gateway dominant point state, otherwise updating the expiration time of the backbone network state. If a node's certain backbone state expires without updating, it immediately loses the corresponding backbone state.
3) In each backbone network period, the gateway dominant point selects one RELAY node in each adjacent cluster, and sends a relay_point message to inform the own RELAY node.
4) When the node receives the RELAY_POINTS message of the gateway dominant point, the node becomes a RELAY node of the message source node and updates the expiration time of the RELAY node state. If the RELAY node does not receive the relay_POINTS message of the RELAY node selector after time-out, the RELAY node serving as the gateway dominant point is abandoned.
5) If the cluster state of the member node changes, it immediately loses the existing backbone network and relay point state, resetting the backbone network state to unset.
The technical principles of the present invention have been described above in connection with specific embodiments, which are provided for the purpose of explaining the principles of the present invention and are not to be construed as limiting the scope of the present invention in any way. Other embodiments of the invention will be apparent to those skilled in the art from consideration of this specification without undue burden.
Claims (8)
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 establishing process of the virtual backbone network, the cluster head node firstly calculates MCDS which can govern all nodes in the cluster, each cluster prefers the least gateway nodes to join the MCDS of the cluster, then establishes CDS which can reach all adjacent clusters, 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 the adjacent cluster, and the routing message from the cluster is forwarded through the relay node; setting a forwarding rule of route 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 virtual backbone network is periodically maintained by using a cluster head, and a message is sent to inform member nodes of the virtual backbone network to update the backbone network state of the member nodes; the gateway node periodically submits the discovered adjacent cluster nodes to the cluster head, so that the cluster head can acquire the latest adjacent cluster information;
the establishment of the MCDS in the cluster comprises the following steps:
s11, the cluster head acquires addresses of all member nodes and topology information thereof according to the interaction content of HELLO messages, and strips a topological view of the self-cluster;
s12, calculating MPR nodes covering all member nodes by using an MPR set selection algorithm according to the clustering topology, and marking the MPR nodes as MPR dominant points;
s13, the cluster head node records the self address and the addresses of the MPR dominant points in an MPR dominant point set, and informs all member nodes of the information of the MPR dominant points of the cluster by sending a BACKBONE message;
after receiving a BACKBONE message sent by a cluster head of the member node, recording an MPR node address and a cluster head address contained in the message in an MPR dominant point set; if the MPR dominant 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 MPR dominant point;
the establishing of the intra-cluster CDS comprises the following steps:
s21, all GATEWAY nodes send GATEWAY information to own cluster heads, and the content of the GATEWAY information comprises own addresses and cluster head addresses of all adjacent clusters discovered by the GATEWAY nodes;
s22, after receiving the GATEWAY message, the cluster head records the adjacent cluster head address and the GATEWAY node address contained in the GATEWAY message in a 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;
s23, cluster head computing gateway dominant nodes;
s24, after the cluster head finishes the calculation of the gateway dominant points, recording all gateway dominant points in a gateway dominant point set, adding the gateway dominant point set into a BACKBONE message, and then sending the BACKBONE message to all member nodes;
after all member nodes receive the BACKBONE message sent by the cluster head, recording a gateway dominant point set; if the gateway dominant point set recorded in the backup message contains the address of the member node, the member node marks the BACKBONE network state of the member node as the gateway dominant point.
2. The method for routing the clustering optimal link states based on the virtual backbone network according to claim 1, wherein: the method for computing gateway dominant nodes comprises the following steps: firstly, if a cluster head is adjacent to an adjacent cluster node, selecting the cluster head as a gateway dominant point, and deleting related entries of all adjacent cluster head addresses found by the cluster head in a gateway set; if the gateway set is not empty after the steps, selecting one MPR dominant point connected with the most adjacent clusters from the MPR dominant point set by the cluster head every round, selecting the MPR dominant point as the gateway dominant point, and deleting entries related to all adjacent clusters adjacent to the MPR dominant point in the gateway set until the gateway set is empty; if the gateway set is still not empty after traversing all MPR dominant points, selecting one gateway node connected with the most adjacent clusters from the gateway nodes by the cluster head every round, marking the gateway node as the gateway dominant point, and deleting entries related to all adjacent clusters adjacent to the gateway node in the gateway set until the gateway set is empty.
3. A method for clustering optimal link state routing based on a virtual backbone network according to claim 2, wherein: the relay node selection method comprises the following steps: the gateway dominant point informs the neighbor cluster neighbor to become a RELAY node thereof by sending a relay_POINTS message, and the RELAY node refers to the gateway dominant point for selecting the gateway dominant point as a RELAY point selector; if the relay node finds that the relay node selector is connected with the CDS of the cluster, the relay node does not forward the route flooding message from the gateway dominant point.
4. A method for clustering optimal link state routing based on a virtual backbone network according to claim 3, wherein: the processing method of the isolated node is also included: each isolated node periodically sends TC request information, inquires global topology information from a neighbor with the maximum connectivity, and clusters adjacent to the TC request information do not need to forward routing information to the TC request information; after receiving TC or CTC messages from other nodes, the isolated node transmits the messages to all neighboring nodes; the isolated node needs to select a relay node in each adjacent cluster adjacent to the isolated node to forward the generated TC message.
5. The method for clustering optimal link state routing based on virtual backbone network according to claim 4, wherein: the flooding forwarding rule of the routing message comprises the following steps:
s1, selecting a neighbor node with the maximum connectivity from each adjacent cluster of the gateway dominant point as a relay node of the neighbor node in the adjacent cluster; after the RELAY nodes of all adjacent clusters are selected, the gateway node sends RELAY_POINTS information to inform the nodes to become RELAY nodes;
s2, after the node receives RELAY_POINTS information from the adjacent cluster, if the information contains the self address, the source node of the information is recorded as a RELAY point selector of the node;
s3, after the relay node receives TC or CTC information sent or forwarded by the relay point selector, searching whether a node is adjacent to the relay point selector or not in an MPR dominant point set and a gateway dominant point set of the cluster; if the existence node is found to be adjacent to the relay node selector, the relay node does not forward the TC or CTC message, otherwise, the TC or CTC message is forwarded;
s4, if the node is in the virtual backbone network, namely the node is first selected as an MPR dominant point or a gateway dominant point by the cluster, the node unconditionally forwards all received TC or CTC messages.
6. The method for clustering optimal link state routing based on virtual backbone network according to claim 5, wherein: in the virtual BACKBONE network maintenance stage, the gateway node periodically reports the adjacent cluster information to the cluster head of the gateway node, and the cluster head periodically calculates MPR dominant points and gateway dominant points and broadcasts a BACKBONE message to inform member nodes to confirm the BACKBONE network state.
7. The method for clustering optimal link state routing based on virtual backbone network according to claim 6, wherein: in the maintenance stage of the virtual backbone network, the GATEWAY node periodically transmits a GATEWAY message to a cluster head, and the cluster head sets an expiration time for each entry in the GATEWAY set so as to delete the expiration information; the maintenance algorithm for 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 an entry of a certain adjacent cluster head address; after the cluster head receives the GATEWAY node's GATEWAY message, for each adjacent cluster head address in the GATEWAY message, find the corresponding entry in the GATEWAY set, and update the expiration time of the GATEWAY node in each adjacent cluster head entry; when the expiration time of a gateway node is overtime in a certain item of the gateway set, the gateway node is deleted in the item, and if the certain item loses all gateway nodes, the item is deleted.
8. The method for clustering optimal link state routing based on a virtual backbone network according to claim 7, wherein: in each period, the cluster head calculates an MPR dominant point set and a gateway dominant point set according to the latest acquired neighbor cluster information, and sends a BACKBONE message to inform all member nodes after the calculation is completed; the member node sets an expiration time for the BACKBONE network state of the member node, checks whether the BACKBONE network state of the member node is overtime in each BACKBONE network period, and updates the expiration time of the BACKBONE network state of the member node by receiving a BACKBONE message; in addition, each gateway dominant point needs to recalculate the RELAY node after confirming the backbone network state, and sends a relay_point message to inform the RELAY node; when the cluster state of the cluster head or member node expires, it immediately loses the backbone network state and the 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 CN114727354A (en) | 2022-07-08 |
| CN114727354B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115955680B (en) * | 2023-03-14 | 2023-05-16 | 南京邮电大学 | Virtual backbone network establishment and routing method based on clustering communication |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7561024B2 (en) * | 2007-04-05 | 2009-07-14 | Harris Corporation | Ad-hoc network routing protocol including the use of forward and reverse multi-point relay (MPR) spanning tree routes |
| US11765078B2 (en) * | 2019-05-20 | 2023-09-19 | 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 (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Non-Patent Citations (2)
| Title |
|---|
| 大规模移动自组网虚拟骨干网构建与路由策略研究;朱炳键;硕士学位论文;全文 * |
| 移动自组织网络中一种基于多点中继策略的优化泛洪广播算法;施韦等;计算机研究与发展;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114727354A (en) | 2022-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1500286B1 (en) | Temporal transition network protocol (ttnp) in a mobile ad hoc network | |
| US8065434B2 (en) | Method and device for maintaining routes | |
| EP4027613A1 (en) | Border gateway protocol for communication among software defined network controllers | |
| US8730958B2 (en) | Method, node, and system for notifying proxy update in WMN | |
| WO2017020619A1 (en) | Routing method and device | |
| TW201818743A (en) | Routing method and wireless node for wireless mesh network | |
| WO2003061220A1 (en) | Routing method for mobile ad-hoc network | |
| CN111432439B (en) | UPF data plane extension and system thereof | |
| CN114727354B (en) | Clustering optimal link state routing method based on virtual backbone network | |
| CN108092899A (en) | Routing policy update method based on name data network under MANET environment | |
| CN106954243A (en) | Route implementation method based on wireless chain network | |
| CN102325080B (en) | Open shortest path first (OSPF) protocol graceful restarting method and device | |
| KR20120046270A (en) | Method, apparatus and system for building on-demand routing | |
| CN104243303B (en) | The method and apparatus for updating message are sent in a kind of autonomous system loop networking | |
| WO2023184213A1 (en) | Clustered optimized link state routing method based on virtual backbone network | |
| JP4767329B2 (en) | Network system and communication method | |
| WO2011047581A1 (en) | Method and system for discovering ring network protection information | |
| CN102026330A (en) | Method for improving availability of ad hoc network | |
| JPH06232872A (en) | Information communication equipment | |
| CN114710819A (en) | Route planning method for unmanned aerial vehicle cluster networking | |
| JP4810606B2 (en) | Nodes in ad hoc networks and ad hoc network systems | |
| CN115002863A (en) | Wireless network routing method and storage medium suitable for large-scale network | |
| CN110752991A (en) | Method for selecting shortest path of dynamic route | |
| CN114785726B (en) | Clustering OLSR routing method based on management message merging | |
| CN114143249B (en) | Method and device for determining routing information, electronic equipment and storage medium |
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 |