CN115955680B - Virtual backbone network establishment and routing method based on clustering communication - Google Patents

Abstract

The invention belongs to the technical field of wireless communication, and discloses a virtual backbone network establishment and routing method based on clustering communication. The invention adopts a layered routing strategy, establishes a virtual backbone network by means of network clustering and communicating adjacent clusters, adopts the virtual backbone network to bear the routing function, reduces the number of nodes bearing the routing function, and simultaneously sets the routing domain as the adjacent cluster, thereby further reducing the complexity of the routing method. In addition, the invention comprehensively considers the node connectivity and the energy index, and preferentially selects the nodes with high connectivity and more energy to become backbone nodes. Simulation results show that compared with other schemes for constructing the virtual backbone network, the method and the device effectively reduce the scale of the virtual backbone network and the energy consumption in the process of establishing the virtual backbone network.

Description

Virtual backbone network establishment and routing method based on clustering communication

Technical Field

The invention belongs to the technical field of wireless communication, and particularly relates to a virtual backbone network establishment and routing method based on clustering communication.

Background

An ad hoc wireless network, unlike a cellular mobile communication network and a wireless local area network, does not have a fixed control center device, where each node is peer-to-peer, and assumes a routing forwarding function. In an ad hoc network, if a plane flooding type routing mechanism is adopted, network complexity is excessive, a large amount of network resources are occupied, and even communication paralysis of the network is caused. To solve these problems, many researchers have proposed virtual backbone structure algorithms based on the connected dominant set theory in graph theory. The main idea is to select part of nodes in the network as backbone nodes to bear the route management function.

In graph theory, for a two-dimensional graph g= (V, E), where V is a set of N nodes and E represents the connection topology between the nodes. The definition of the connectivity support set is as follows, if C is a subset of V, V is any node in V, C is any node in C, when V is satisfied to belong to C or V is a neighbor node of C, and all nodes in C constitute the connectivity graph, then C is referred to as one connectivity support set of graph G.

The wireless self-organizing network is abstractly described as a two-dimensional graph, and the establishment of a virtual backbone network in the wireless self-organizing network can be abstractly used for searching a connected support set in the two-dimensional graph. The existing algorithm for searching the connected support set in the two-dimensional graph has the following scheme:

patent application CN1917460a relates to a distributed construction method of a virtual backbone network in a wireless sensor network, which implements a distributed virtual backbone network based on a minimum connected support set in two stages. The first stage constructs a very large independent set through a clustering algorithm; and in the second stage, the cluster head searches for the gateway node to communicate with other cluster heads to form a communication supporting set. The method only considers the difference of node IDs in the process of establishing the virtual backbone network, and does not consider other attributes, so that the generated virtual backbone network has certain randomness, and the virtual backbone network has larger scale and shorter network survival time.

In document "Energy Efficient Distributed Connected Dominating Sets Construction in Wireless Sensor Networks" (Zeng Yuan, jia Xiaohua, he yanxiang. Proc. Of the 2006 ACM International Conference on Communications and Mobile Computing. New York, USA: ACM Press, 2006.) the authors proposed an energy efficient connected dominant set construction method that uses a dyeing method to solve a very large independent set in the first stage. In the second stage, the algorithm selects some connection nodes in a greedy mode, and solves the connected support set. The method considers the node weight and the residual energy in the process of establishing the virtual backbone network, reduces the scale of the virtual backbone network to a certain extent, and prolongs the survival time of the network. However, the method has more information interaction among nodes and has certain requirement on synchronization.

Patent application CN114727354a relates to a clustering optimal link state routing method based on a virtual backbone network. The method utilizes the virtual backbone network to replace the traditional route message flooding mechanism, and reduces the route cost of the OLSR protocol. However, the network adopts a routing strategy driven by a table, a routing table is established in the whole network, and the whole network routing message flooding is required, so that the routing cost is high.

Disclosure of Invention

Aiming at the defects of the prior art, the invention provides a virtual backbone network establishing and routing method based on clustering communication, which is applied to an self-organizing wireless network without control center equipment; in the process of establishing the virtual backbone network, the node connectivity is considered to effectively reduce the scale of the virtual backbone network, and the information interaction times among nodes are reduced in a clustering communication mode to reduce energy consumption; and a hierarchical routing strategy is adopted, a virtual backbone network is utilized to bear a routing function, and a routing domain is set as an adjacent cluster to solve the problem of high routing overhead.

In order to solve the technical problems, the invention provides a virtual backbone network establishment and routing method based on clustering communication, which comprises the following steps:

step 1, determining the identity of each node in a network according to the weight of the node, and clustering all nodes in the network;

step 2, according to the connection rule, the common node selects the identity of the connected node in an competitive manner, the cluster head node judges the identity of the connected node according to the weight of the node participating in the competitive selection and the size of the identity identification number ID, the cluster head node is connected with other clusters, and finally, all the cluster head nodes and the connected node form a virtual backbone network; the cluster head node and the communication node are called backbone nodes;

step 3, setting a route selection domain as adjacent clusters, and exchanging member information between the adjacent clusters through a communication node and establishing a route;

and 4, outside the routing domain, when the routing information reaching the non-adjacent cluster node is absent, the cluster head node sends a routing request through the virtual backbone network, the backbone node with the corresponding routing information responds to the routing request, and finally the routing response returns to the cluster head node to establish the routing.

Further, in step 1, the network nodes are clustered, specifically:

all nodes send broadcast messages to inform surrounding nodes of unique identification numbers (IDs), each node acquires one-hop neighbor IDs, and calculates the connectivity of the node, wherein the connectivity is the number of one-hop neighbors;

all nodes calculate weights, their weights

The method is obtained by the following formula:

；

wherein ,

representing node->

Connectivity of time, tight>

Representing node->

Residual energy at time, +.>

For coefficients ranging from 0 to 1;

all nodes are initially used as cluster head candidate nodes, broadcast messages are sent to inform surrounding nodes of self weights and IDs, and each node acquires the weights of adjacent candidate nodes and compares the weights with the self weights; if the self weight is the largest, the self is taken as a cluster head node; if the maximum weight value in the adjacent candidate nodes is equal to the self weight value, a plurality of nodes have the maximum weight value at the moment, and the node with the large ID value is considered to be used as a cluster head node; the Cluster head node establishes a Cluster name as a Cluster head node ID_Cluster and sends a broadcast message to serve as a Cluster head; after receiving the broadcast message, the one-hop neighbor of the cluster head node sends the broadcast message which becomes a common node and a cluster name to which the common node belongs, and the common node does not participate in cluster head competition;

after the identity of all the nodes is determined finally, the network nodes are divided into cluster head nodes and common nodes, one-hop neighbor nodes of the cluster head nodes are cluster member nodes, and one common node can belong to different clusters; the common node records the cluster name of the common node and the cluster name of the one-hop neighbor.

Further, define: the two clusters are crowded with common cluster member nodes, and the relationship between the two clusters is called direct adjacent; two clusters have no common cluster member node, but there is a situation that members of the two clusters are one-hop neighbor nodes, and the relationship of the two clusters is called indirect adjacency.

Further, in step 2, the adjacent cluster communication process specifically includes:

the cluster head node sets a timer, and the initial value of the timer is recorded as

；

Directly adjacent clusters communicate: if the cluster member node finds that the cluster member node belongs to a plurality of clusters, a broadcast message is sent to participate in the identity competition of the connected nodes of the directly adjacent clusters; the broadcast message contains weights

And cluster names to which it communicates; when the cluster head node receives the communication node identity competition message of the direct adjacent cluster for the first time, starting a timer, and stopping receiving the communication node identity competition message of the direct adjacent cluster by the cluster head after the timer finishes timing; cluster head nodes calculate and compare the received competition messages, and the node with the highest weight value is selected for the nodes connected with the same cluster to serve as a connected node; when a plurality of nodes have the same highest weight, selecting the node with the large ID value as a connected node; finally, the cluster head node sends broadcast, and informs the identity of the connected node and the names of other clusters connected with the cluster to member nodes in the cluster;

indirect adjacent clusters communicate: if the cluster member node finds that the cluster member node of the indirect adjacent cluster exists in the one-hop neighbor of the cluster member node, a broadcast message is sent to participate in the identity competition of the connected nodes of the indirect adjacent cluster; the broadcast message contains weights

And cluster names to which it communicates; when the cluster head node receives the connected node identity competition message of the indirect adjacent cluster for the first time, a timer is started, and the timer counts timeThe cluster head stops receiving the communication node identity competition message of the indirect adjacent cluster after finishing; cluster head nodes calculate and compare the received competition messages, and the node with the highest weight value is selected for the nodes connected with the same cluster to serve as a connected node; when a plurality of nodes have the same highest weight, selecting the node with the large ID value as a connected node; and finally, the cluster head node sends broadcasting, and informs the identity of the connected node and the names of other clusters connected with the cluster to member nodes in the cluster.

Further, in the step 3, the step of establishing the route in the adjacent cluster specifically includes:

the cluster head of the direct adjacent cluster and the cluster head of the indirect adjacent cluster inform each other of the member information in the cluster through the communication node, the cluster head and the communication node calculate the routing information in the adjacent cluster, and the routing information comprises a destination node ID and a next hop node ID; the calculation process specifically comprises the following steps:

the cluster head node calculates the route information reaching the adjacent cluster head node, the destination node ID is the adjacent cluster head node ID, and the next hop node ID is the connected node ID for connecting the two clusters;

the cluster head node calculates the route information reaching the members in the cluster, the destination node ID is the member node ID in the cluster, and the next hop node ID is the member node ID in the cluster;

the cluster head node calculates the route information reaching the adjacent cluster members, the destination node ID is the adjacent cluster member node ID, and the next hop node ID is the connected node ID for connecting the two clusters;

the communication node calculates the route information reaching the cluster head node, the destination node ID is the cluster head node ID, and the next hop node ID is the cluster head node ID or other communication node IDs;

the communication node calculates the route information reaching the common node, the destination node ID is the common node ID, and the next hop node ID is the cluster head node ID or other communication node IDs;

the common node adopts default route information, and the next hop node ID is the cluster head node ID.

Further, the non-adjacent cluster route establishment process specifically includes: the cluster head node broadcasts a routing request to the virtual backbone network, the routing request is continuously updated, and all backbone node IDs passed by the cluster head node are recorded;

after receiving the route request, the adjacent backbone node checks whether the destination node is in the self route table; if the destination node does not exist in the routing table of the adjacent backbone node, forwarding the routing request to other backbone nodes adjacent to the destination node; if the destination node exists in the routing table of the adjacent backbone node, the backbone node generates a routing response and returns the routing response to the source cluster head node;

the route response comprises all backbone node IDs on the route path, the backbone node returns the information according to the original route of the route request after receiving the response, and new route information comprising a destination node ID and a next hop node ID is added according to the route response.

The beneficial effects of the invention are as follows: the invention adopts a layered routing strategy, establishes a virtual backbone network in a mode of network clustering and adjacent cluster communication, adopts the virtual backbone network to bear a routing function, and reduces the number of nodes bearing the routing function; meanwhile, the routing domain is set as an adjacent cluster, so that the complexity of the routing method is further reduced. In addition, the invention comprehensively considers the node connectivity and the energy index, preferentially selects the nodes with high connectivity and more energy as backbone nodes, and effectively reduces the scale of the virtual backbone network; the number of information interaction between nodes is reduced in a cluster communication mode, so that energy consumption is reduced.

Drawings

Fig. 1 is a flowchart of a method for establishing and routing a virtual backbone network based on cluster connectivity according to the present invention;

FIG. 2 is a schematic diagram of virtual backbone network generation;

FIG. 3 is a graph comparing the scale of the virtual backbone network established by the method of the present invention with the simulation results of other algorithms;

fig. 4 is a graph comparing the energy consumption of the virtual backbone network established by the method of the present invention with the simulation results of other algorithms.

Detailed Description

In order that the invention may be more readily understood, a more particular description of the invention will be rendered by reference to specific embodiments that are illustrated in the appended drawings.

The invention discloses a virtual backbone network establishment and routing method based on clustering communication, which comprises the following steps:

step 1, determining the identity of each node in a network according to the weight of the node, and clustering all nodes in the network;

step 2, according to the connection rule, the common node selects the identity of the connected node in an competitive manner, the cluster head node judges the identity of the connected node according to the weight of the node participating in the competitive selection and the size of the identity identification number ID, the cluster head node is connected with other clusters, and finally, all the cluster head nodes and the connected node form a virtual backbone network; the cluster head node and the communication node are called backbone nodes;

step 3, setting a route selection domain as adjacent clusters, and exchanging member information between the adjacent clusters through a communication node and establishing a route;

and 4, outside the routing domain, when the routing information reaching the non-adjacent cluster node is absent, the cluster head node sends a routing request through the virtual backbone network, the backbone node with the corresponding routing information responds to the routing request, and finally the routing response returns to the cluster head node to establish the routing.

The following illustrates the generation of virtual backbones and routes using the present method.

(1) Each node has a unique ID number as shown in fig. 2 (a);

(2) The nodes send broadcast mutually, acquire one-hop neighbor information of the node, calculate own weight, send the node with the highest weight to become cluster head node information, and send the information of exiting cluster head competition after the neighbor node receives the information to become common node. After the above process, as shown in fig. 2 (b), the nodes 3, 4, 8 and 10 become cluster head nodes, the other nodes are common nodes, and form 3 clusters, and the cluster names are respectively 3_cluster, 4_cluster, 8_cluster and 10_cluster;

(3) Node 2 is a 3_Cluster member and also a 4_Cluster member, so node 2 sends a broadcast message, marks itself as a connected node, and connects 3_Cluster and 4_Cluster. After the cluster head node 3 and the cluster head node 4 receive the information, the information that other nodes participate in competition is not received before the timer finishes, the node 3 and the node 4 send a broadcast message to inform member nodes in the cluster that the 3_Cluster and the 4_Cluster are communicated, and the communicating node is the node 2; the same 3_Cluster is communicated with the 10_Cluster through a communication node 6; node 2 and node 7 are members of different clusters, and 3_Cluster, 4_Cluster and 8_Cluster are in an unconnected state, then node 2 and node 7 send a broadcast message, mark themselves as connected nodes, and connect 3_Cluster, 4_Cluster and 8_Cluster; after the node 3, the node 4 and the node 8 receive the information, the information that other nodes participate in competition is not received before the timer finishes, the node 3, the node 4 and the node 8 send a broadcast message to inform the member nodes in the cluster that the 3_Cluster, the 4_Cluster and the 8_Cluster are communicated, and the communicating nodes are 2 and 7. As shown in fig. 2 (c), the nodes 2, 7 become connected nodes;

(4) All the communication nodes and cluster head nodes form a virtual backbone network of the whole network, as shown in fig. 2 (c), and nodes 2, 3, 4, 6, 7, 8 and 10 are backbone nodes;

(5) The routing domain of the network is an adjacent cluster, and at this time, the 3_cluster and the 10_cluster are adjacent clusters, the backbone node 3 and the backbone node 10 exchange intra-cluster member information through the backbone node 6, and finally, according to the exchanged information, the backbone nodes 3, 6 and 10 calculate routing information reaching all members of the 3_cluster and the 10_cluster. Similarly, the backbone nodes 3, 2, 4, 7 and 8 calculate the route information reaching all members of the 3_Cluster, the 4_Cluster and the 8_Cluster;

(6) If the 4_Cluster and the 10_Cluster are not adjacent clusters and are outside the routing domain, if the backbone node 4 sends information to the node 10, a route searching stage is entered at the moment because no corresponding path exists in the routing table; the backbone node 4 sends a route request message to the virtual backbone network, where the request is sent to the neighboring backbone nodes 3, 7 because there is no route path to the node 10 in the routing table of the backbone node 2; the routing table of the backbone node 3 is provided with a routing path reaching the node 10, the backbone node 3 initiates a routing response, and the routing response information is finally sent back to the backbone node 4 according to the original path; the backbone nodes 2, 4 establish a routing path to the node 10 based on the routing response.

Simulation results

The performance of the method of the present invention and the energy efficient connected support set construction method are compared by simulation experiments. The experimental model consisted of 20 to 110 nodes, which were randomly distributed over a square area of 100 meters by 100 meters. The wireless communication module will

Bit data transmission->

The energy that needs to be consumed for the distance of the meter is as follows:

；

wherein ,

representing the energy expended by the node transceiver in transmitting data,/->

Energy representing the consumption of the transmission circuit for transmitting data, < >>

Energy representing the consumption of the data sent by the amplifying circuit, < >>

Energy consumed to indicate the transmission of unit bit data by the transceiver,/->

Representing the energy consumption coefficient of the amplifier in the free space channel model,/->

Energy consumption coefficient of amplifier under multipath fading channel model>

Is a distance threshold.

Wireless communication module reception

The energy that the data of the bits need to consume is as follows:

；

wherein ,

energy representing the consumption of data received by the node transceiver, < >>

Energy representing the consumption of data received by the receiving circuit, < >>

Representing the energy consumed by the transceiver to receive unit bit data.

The setting parameters of the invention are as follows: the node communication coverage radius is 40 meters,

20 meters, all nodes with an initial energy of 2J, < >>

0.5, packet size 400 bits,/->

50 nanojoules/bit->

10 picojoules/bit/square meter, < >>

At 0.0013 picojoules/bit/fourth square meter, a timer is set to 1 second to ensure that each potential connected node will be involved in contention.

Through multiple simulation experiments, the scale and energy consumption of the virtual backbone network generated by the scheme provided by the invention and the traditional energy-efficient communication dominant set construction method are compared. Fig. 3 shows the scale change trend of the virtual backbone network generated by the two methods when the node scale is gradually increased from 20 to 110, from which it can be seen that the virtual backbone network established by the method of the present invention has a lower scale.

Fig. 4 shows a comparison of energy consumption generated when the node scale is gradually increased from 20 to 110, and it can be seen that the method of the present invention consumes less energy when the virtual backbone network is established.

The foregoing is merely a preferred embodiment of the present invention, and is not intended to limit the present invention, and all equivalent variations using the description and drawings of the present invention are within the scope of the present invention.

Claims (5)

1. A method for establishing and routing a virtual backbone network based on clustered connectivity, the method comprising:

step 1, determining the identity of each node according to the weight of each node in the network, and clustering all nodes in the network; wherein the weight is determined according to connectivity and residual energy of the nodes;

step 2, according to the communication rule, the common node elections the identity of the communication node, the cluster head node judges the identity of the communication node according to the weight of the node participating in the election and the size of the identity identification number ID, and the cluster head node is communicated with other clusters, and finally all the cluster head nodes and the communication node form a virtual backbone network, wherein the cluster head node and the communication node are called as backbone nodes;

step 3, setting a route selection domain as adjacent clusters, and exchanging member information between the adjacent clusters through a communication node and establishing a route; wherein, if two clusters have common cluster member nodes, the two clusters are directly adjacent clusters; if two clusters have no common cluster member node, but there is a situation that the members of the two clusters are one-hop neighbor nodes, the two clusters are indirect neighbor clusters;

and 4, outside the routing domain, when the routing information reaching the non-adjacent cluster node is absent, the cluster head node sends a routing request through the virtual backbone network, the backbone node with the corresponding routing information responds to the routing request, and finally the routing response returns to the cluster head node to establish the routing.

2. The method for establishing and routing a virtual backbone network based on cluster connectivity according to claim 1, wherein the clustering is performed on network nodes in step 1, specifically:

all nodes send broadcast messages to inform surrounding nodes of unique identification numbers (IDs), each node acquires one-hop neighbor IDs, and calculates the connectivity of the nodes;

all nodes calculate the weight value, and the weight value of the node n

The method is obtained by the following formula:

；

wherein ,

indicating that node n is +.>

Connectivity of time, tight>

Indicating that node n is +.>

Residual energy at time, +.>

For coefficients ranging from 0 to 1;

all nodes are initially used as cluster head candidate nodes, broadcast messages are sent to inform surrounding nodes of self weights and IDs, and each node acquires the weights of adjacent candidate nodes and compares the weights with the self weights; if the self weight is the largest, the self is taken as a cluster head node; if the maximum weight value in the adjacent candidate nodes is equal to the self weight value, adopting the node with the large ID value as the cluster head node; the Cluster head node establishes a Cluster name as a Cluster head node ID_Cluster and sends a broadcast message to serve as a Cluster head; after receiving the broadcast message, the one-hop neighbor of the cluster head node sends the broadcast message which becomes a common node and a cluster name to which the common node belongs, and the common node does not participate in cluster head competition;

after the identity of all the nodes is determined finally, the network nodes are divided into cluster head nodes and common nodes, one-hop neighbor nodes of the cluster head nodes are cluster member nodes, and one common node can belong to different clusters; the common node records the cluster name of the common node and the cluster name of the one-hop neighbor.

3. The method for establishing and routing a virtual backbone network based on cluster connectivity according to claim 1, wherein in step 2, the adjacent cluster connectivity process is specifically:

the cluster head node sets a timer, and the initial value of the timer is recorded as

；

Directly adjacent clusters communicate: if the cluster member node finds that the cluster member node belongs to a plurality of clusters, a broadcast message is sent to participate in the identity competition of the connected nodes of the directly adjacent clusters; the broadcast message contains weights

And cluster names to which it communicates; when the cluster head node receives the communication node identity competition message of the direct adjacent cluster for the first time, starting a timer, and stopping receiving the communication node identity competition message of the direct adjacent cluster by the cluster head after the timer finishes timing; cluster head nodes calculate and compare the received competition messages, and the node with the highest weight value is selected for the nodes connected with the same cluster to serve as a connected node; when a plurality of nodes have the same highest weight, selecting the node with the large ID value as a connected node; finally, the cluster head node sends broadcast, and informs the identity of the connected node and the names of other clusters connected with the cluster to member nodes in the cluster;

indirect adjacent clusters communicate: if the cluster member node finds that the cluster member node of the indirect adjacent cluster exists in the one-hop neighbor of the cluster member node, a broadcast message is sent to participate in the identity competition of the connected nodes of the indirect adjacent cluster; the broadcast message contains weights

And cluster names to which it communicates; when the cluster head node receives the communication node identity competition message of the indirect adjacent cluster for the first time, starting a timer, and stopping receiving the communication node identity competition message of the indirect adjacent cluster by the cluster head after the timer finishes timing; cluster head nodes calculate and compare the received competition messages, and the node with the highest weight value is selected for the nodes connected with the same cluster to serve as a connected node; when a plurality of nodes have the same highest weight, selecting the node with the large ID value as a connected node; and finally, the cluster head node sends broadcasting, and informs the identity of the connected node and the names of other clusters connected with the cluster to member nodes in the cluster.

4. The method for establishing and routing a virtual backbone network based on cluster connectivity according to claim 1, wherein the step of establishing the routing in the adjacent clusters in step 3 is specifically as follows:

the cluster head of the direct adjacent cluster and the cluster head of the indirect adjacent cluster inform each other of the member information in the cluster through the communication node, the cluster head and the communication node calculate the routing information in the adjacent cluster, and the routing information comprises a destination node ID and a next hop node ID; the calculation process specifically comprises the following steps:

the cluster head node calculates the route information reaching the adjacent cluster head node, the destination node ID is the adjacent cluster head node ID, and the next hop node ID is the connected node ID for connecting the two clusters;

the cluster head node calculates the route information reaching the members in the cluster, the destination node ID is the member node ID in the cluster, and the next hop node ID is the member node ID in the cluster;

the cluster head node calculates the route information reaching the adjacent cluster members, the destination node ID is the adjacent cluster member node ID, and the next hop node ID is the connected node ID for connecting the two clusters;

the communication node calculates the route information reaching the cluster head node, the destination node ID is the cluster head node ID, and the next hop node ID is the cluster head node ID or other communication node IDs;

the communication node calculates the route information reaching the common node, the destination node ID is the common node ID, and the next hop node ID is the cluster head node ID or other communication node IDs;

the common node adopts default route information, and the next hop node ID is the cluster head node ID.

5. The method for establishing and routing a virtual backbone network based on cluster connectivity according to claim 1, wherein the non-adjacent cluster route establishment process specifically comprises:

the cluster head node broadcasts a routing request to the virtual backbone network, the routing request is continuously updated, and all backbone node IDs passed by the cluster head node are recorded;

after receiving the route request, the adjacent backbone node checks whether the destination node is in the self route table; if the destination node does not exist in the routing table of the adjacent backbone node, forwarding the routing request to other backbone nodes adjacent to the destination node; if the destination node exists in the routing table of the adjacent backbone node, the backbone node generates a routing response and returns the routing response to the source cluster head node;

the route response comprises all backbone node IDs on the route path, the backbone node returns the information according to the original route of the route request after receiving the response, and new route information comprising a destination node ID and a next hop node ID is added according to the route response.

Images