CN110995333B - Cluster QoS route design method - Google Patents

Cluster QoS route design method Download PDF

Info

Publication number
CN110995333B
CN110995333B CN201911204044.5A CN201911204044A CN110995333B CN 110995333 B CN110995333 B CN 110995333B CN 201911204044 A CN201911204044 A CN 201911204044A CN 110995333 B CN110995333 B CN 110995333B
Authority
CN
China
Prior art keywords
node
cluster
route
cluster head
packet
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201911204044.5A
Other languages
Chinese (zh)
Other versions
CN110995333A (en
Inventor
张涛
谭林
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CN201911204044.5A priority Critical patent/CN110995333B/en
Publication of CN110995333A publication Critical patent/CN110995333A/en
Application granted granted Critical
Publication of CN110995333B publication Critical patent/CN110995333B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/1851—Systems using a satellite or space-based relay
    • H04B7/18519—Operations control, administration or maintenance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/46—Cluster building
    • 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
    • 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)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the invention provides a method for designing a cluster QoS route, which comprises the following steps: s1: dividing a network into a plurality of different clusters, and setting a fixed aerostat at the core position of each cluster as a cluster head node; s2: collecting state information of member nodes in the cluster through the cluster head node to construct an intra-cluster node information table; s3: and connecting different clusters by using the cluster head node as an inter-cluster gateway to complete the exchange of the intra-cluster node information table and construct an inter-cluster routing table. According to the cluster QoS route design method provided by the embodiment of the invention, the aerostat node at the core position is selected as the cluster head node, and route calculation is given charge to the aerostat node, so that the energy of member nodes in a cluster is saved; meanwhile, as the aerostat nodes have high-performance computing resources and sufficient energy, the routing computation is faster, and the time overhead is less; meanwhile, the centralized routing and the distributed routing are combined, and the bandwidth requirement and the delay requirement are met.

Description

Cluster QoS route design method
Technical Field
The invention relates to the technical field of communication, in particular to a clustering QoS route design method.
Background
The near space aerostat has the characteristics of long idle time, large load, strong viability, wide coverage range, high cost performance and the like, and the characteristics enable the near space aerostat to play a great role in the aspects of communication, remote sensing, navigation and the like. Aiming at specific tasks, an air-to-ground vehicle integrated network which takes near space aerostat nodes as a core and comprises a satellite, a plurality of unmanned aerial vehicles, trains, ground nodes and the like is quickly constructed, and the method is a key for realizing a task target based on air-to-ground vehicle information cooperation. The design of an effective and reliable routing scheme suitable for the space, air and ground vehicle integrated network is important.
The application examples of the aerostat are few at present, and Project Loon of Google is a representative case with success. This aerostat operates on the stratosphere, with the aim of broadening the network coverage to remote areas, while at the same time providing emergency communication after a natural disaster destroys the communication infrastructure. The design scheme of the project is as follows: hundreds of aerostats are lifted to the stratosphere to form a large Mesh network. The Google aerostat adopts an IEEE802.11j protocol and a Mesh mode for networking. In 2017, in 2 months, Project Loon Project groups issue messages, and the movement and the stay of the aerostat can be controlled by using machine learning and big data technologies, so that the aerostat is deployed in areas required by a network. In 2012, Simon mobile hall, burney university, switzerland proposed the use of aerial drones to build Mesh networks (UAVNet), with IEEE802.11 s standards between drones.
Similar to the related research, it is known that the networking topology of the existing aerostat is not flexible enough and the task type is simple, and the role of the aerostat needs to be further improved on the premise of networking by adopting the traditional microwave communication.
At present, researchers have proposed some Routing protocols for providing QoS guarantee, such as passive Routing protocol QoS-AODV, active Routing protocol QoS-OLSR, WMR (Wireless Mesh Routing), and the like, for QoS Routing technology of Wireless Mesh networks (WMNs for short), but these protocols all have some disadvantages. WMN is very similar to MANET (mobile Ad Hoc network), and most QoS protocols are developed by QoS routing improvements in MANET. Since WMN and MANET are different in mobility, energy constraint, service mode, etc., these QoS protocols cannot fully embody the characteristics of WMN, and therefore, the protocol performance is to be improved.
In addition, researchers propose a plurality of clustering algorithms for WMN, such as LEACH algorithm and HEED algorithm, but the algorithms have a complex cluster head node election mechanism, require large time overhead and energy overhead, and are not suitable for the scene of an air-ground vehicle integrated network.
In summary, there is a need to provide a new method for designing cluster QoS routes to meet the requirement of information interaction for building an air-ground vehicle integrated network.
Disclosure of Invention
In view of this, the embodiment of the present invention provides a new method for designing a cluster QoS route, so as to solve the defects in the prior art that an aerostat networking topology is not flexible enough, a task type is simple, and energy consumption of member nodes in a cluster is large.
The embodiment of the invention provides a clustering QoS route design method, which comprises the following steps: s1: dividing a network into a plurality of different clusters, and setting a fixed aerostat node at the core position of each cluster as a cluster head node; s2: collecting state information of member nodes in a cluster through a cluster head node to construct an intra-cluster node information table; s3: and connecting different clusters by using the cluster head node as an inter-cluster gateway to complete the exchange of the intra-cluster node information table and construct an inter-cluster routing table.
Further, step S2 specifically includes the following steps: s21: establishing an adjacent node list by the cluster head node and the member nodes in the cluster respectively by utilizing the communication hello packets; s22: the cluster head node announces grouping to the adjacent node set multicast root node according to the adjacent node table corresponding to the cluster head node; s23: after receiving the root node declaration grouping, the adjacent nodes join the cluster where the cluster head node is located, and continue flooding the root node declaration grouping to the next-level adjacent node according to the adjacent node table corresponding to the adjacent nodes; s24: and (4) iteratively executing the steps until the flooding process is converged, and acquiring an intra-cluster node information table formed by a plurality of mutually disjoint trees.
Further, after the neighboring node receives the root node declaration grouping and joins the cluster where the cluster head node is located, the method further includes: and the cluster head node updates the node information table in the cluster.
Further, the updating of the in-cluster node information table by the cluster head node periodically updates the in-cluster node information table by the cluster head node includes: the intra-cluster member node packs the adjacent node table, the available bandwidth and the hop count information corresponding to the intra-cluster member node into a periodic reply packet, and sends the periodic reply packet to the cluster head node of the cluster in which the intra-cluster member node is located; and the cluster head node updates the node information table in the cluster according to the periodic reply packet.
Further, the updating of the intra-cluster node information table by the cluster head node further includes: and if the adjacent nodes of the member nodes in the cluster are determined to be changed or the available bandwidth of the member nodes in the cluster exceeds a set threshold, the cluster head node immediately updates the node information table in the cluster.
Further, the step S3 specifically includes the following steps: s31: each cluster head node periodically sends an intra-cluster node information table to the cluster head nodes adjacent to the one-hop range of the cluster head node; s32: the adjacent cluster head nodes receive the inter-cluster routing table and update the self intra-cluster node information table to complete the exchange of the intra-cluster node information table; s33: the steps S31 are stopped after the process converges in S31-S32.
Further, after the step S33 is executed, the method further includes: and (4) determining that the intra-cluster node where the adjacent cluster head node is located is changed, updating the inter-cluster routing table of the adjacent cluster head node, and executing the steps S31-S32 again to obtain the inter-cluster routing table.
Further, after the step S3 is executed, the method further includes: determining that a source node and a destination node of a service flow are located in the same cluster, executing the following steps: judging whether a route reaching a destination node exists in an adjacent node table corresponding to the source node; if so, establishing data transmission between the source node and the destination node; if not, sending a routing request packet to the cluster head node through the source node; the cluster head node groups according to the route request to generate an optimal in-cluster route, writes a node sequence of the optimal in-cluster route into a route notification group, and sends the route notification group to a destination node in a one-hop manner; the destination node sends a route reply packet to the source node according to the reverse path, wherein the route reply packet comprises a node sequence; and the source node establishes data transmission with the destination node according to the node sequence.
Further, after the destination node sends the route reply packet to the source node according to the reverse route, the method further includes: performing bandwidth reservation and delay accumulation on member nodes in each cluster in the reverse path, and updating the current delay accumulation value in the route reply packet; if the current bandwidth of any cluster member node does not meet the minimum bandwidth requirement of the service or the time delay accumulated value of any cluster member node exceeds the maximum time delay requirement of the service, discarding the route reply packet and sending the route recalculation packet to the cluster head node; and the cluster head node sends the released resource group to a downstream node of any member node in the cluster, and after the reserved bandwidth resource is released, routing calculation is carried out again to obtain the optimal in-cluster route.
Further, after the step S3 is executed, the method further includes: determining that a source node and a destination node of a service flow are located in different clusters, and executing the following steps: the cluster head node receives a first routing request packet of a source node, generates a node sequence of a route in the source node cluster, writes the first routing request packet into the cluster head node, and acquires a second routing request packet; the second routing request packet is sent to a cluster head node of a cluster where a target node is located hop by hop, and the node sequence number of each passing cluster head node is added to the second routing request packet in sequence to generate a third routing request packet; a cluster head node of a cluster where a destination node is located generates a route notification packet according to a route in the destination node cluster; extracting a node sequence in the third route request packet and a node sequence of a route in a destination node cluster, writing the node sequences into a route notification packet, and sending the route notification packet to a destination node in one hop; the destination node sends a route reply packet to the source node according to a reverse route; and the source node establishes data transmission with the destination node according to the route reply packet.
According to the cluster QoS route design method provided by the embodiment of the invention, the aerostat node at the core position is selected as the cluster head node, the member nodes in the cluster are served and managed, and route calculation is completely given charge to the aerostat node, so that the energy of the member nodes in the cluster such as an unmanned aerial vehicle can be saved, and the endurance time of the member nodes is increased; meanwhile, as the aerostat nodes have high-performance computing resources and sufficient energy, the routing computation is faster, and the time overhead is less; meanwhile, in order to adapt to the characteristics of the application scene of the space-time, air-ground and vehicle integrated network, a cluster-based QoS routing protocol is established, so that the centralized routing and the distributed routing are combined, and the bandwidth requirement and the delay requirement are met.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of a method for designing a clustered QoS route according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a network scenario provided in an embodiment of the present invention;
fig. 3 is a schematic flowchart of a process for constructing a routing table in a cluster according to an embodiment of the present invention;
fig. 4 is a schematic diagram of another network scenario provided in the embodiment of the present invention;
fig. 5 is a schematic diagram illustrating an update flow of a node information table in a cluster according to an embodiment of the present invention;
fig. 6 is a schematic diagram illustrating an update flow of an inter-cluster routing table according to an embodiment of the present invention;
fig. 7 is a schematic diagram of intra-cluster routing computation according to an embodiment of the present invention;
fig. 8 is a schematic diagram of inter-cluster routing computation according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention provides a method for designing a cluster QoS route, which comprises the following steps of, as shown in FIG. 1:
s1: dividing a network into a plurality of different clusters, and setting a fixed aerostat node at the core position of each cluster as a cluster head node;
s2: collecting state information of member nodes in the cluster through the cluster head node to construct an intra-cluster node information table;
s3: and connecting different clusters by using the cluster head node as an inter-cluster gateway to complete the exchange of the intra-cluster node information table and construct an inter-cluster routing table.
In step S1 of the embodiment of the present invention, the entire network is first divided into a plurality of clusters according to the distribution of the nodes in the network, and the network coverage of each cluster is intersected. Further, the core position of each cluster is determined, and a fixed aerostat node is arranged at the core position to serve as a cluster head node of the whole cluster.
Specifically, fig. 2 provides a schematic view of an integrated network scene of an air-ground vehicle in the sky, and as shown in fig. 2, 4 fixed aerostat nodes are totally arranged in the network and are R respectively1-R4The height of the aerostat located in the adjacent space from the ground can be adjusted according to actual needs, but can be set to be 20KM, for example, based on the fact that the aerostat is in the advection. The one-hop communication distance of each aerostat node is within the range of the dashed circle in fig. 2. Member node A in cluster1-A16Is a one-hop node of the aerostat node and a member node B in the cluster1-B16A two-hop node and an intra-cluster member node C which are the nodes of the aerostat1-C8For the three-hop node of the aerostat node, one hop node, two hop node and three hop node can be used for representing movable nodes such as unmanned aerial vehicles, trains or ground sensors. Where each cluster is for at least one aerostat node (e.g., R)1) And a plurality of member nodes (including one-hop nodes, two-hop nodes, three-hop nodes or n-hop nodes) in the cluster. It should be noted that, due to the mobility of the member nodes in the cluster, the network topology is time-varying, for example, a member node in a cluster is R at the current time1But may become R at the next time2Therefore, the above fig. 2 is only a schematic diagram for explaining an integrated network scenario of the space, air and vehicle according to the embodiment of the present invention, and is not intended to limit the scope of the present embodiment of the present invention.
Because the aerostat nodes and the member nodes in the cluster have different communication distances (generally, the communication distance of the aerostat nodes is far greater than that of the member nodes in the cluster), and the communication distances between the different member nodes in the cluster are also different, a situation that the member nodes in the cluster can receive the sent message of the aerostat nodes, but the sent message of the member nodes in the cluster cannot directly reach the aerostat nodes occurs, and therefore, in the embodiment of the invention, only two nodes capable of directly receiving and sending each other are called one-hop neighbor nodes.
In the embodiment of the invention, the network is divided into a plurality of different clusters by selecting a plurality of cluster heads in the whole network, and all nodes in each cluster form a tree, so that the whole network forms a plurality of trees. The routing calculation is divided into intra-cluster routing calculation and inter-cluster routing calculation, and both are responsible for the cluster head node.
In a computer network, an inter-cluster Routing table (Routing table), also called Routing Information Base (RIB), is a spreadsheet (file) or class database stored in a router or a networked computer. The routing table contains topology information about the network perimeter, and stores paths (which may include route metric values for the paths) that point to specific network addresses. The main goal of the cluster routing table establishment is to generate a small direction table containing the data packet transmission priority path selected by the routing algorithm, thereby realizing routing protocol and static routing.
Each cluster head node collects the state information of each member node in the cluster and calculates the routing in the cluster; the cluster heads are gateways among the clusters, are connected with different clusters, and exchange routing tables periodically with each other, so that each cluster head node knows nodes contained in other clusters, and the process is similar to the updating of routing information protocol RIP. In the space-time air-ground vehicle integrated network, as the aerostat nodes have sufficient resources such as communication bandwidth, calculation, energy and the like and are located at the core position, each aerostat node is directly appointed to be the cluster head of each cluster.
In step S2, the cluster head node collects the state information of the member nodes in the cluster controlled by the cluster head node mainly through intra-cluster routing computation, and unifies each state information to generate an intra-cluster node information table. Wherein the state information includes: one-hop neighbor nodes of member nodes in each cluster, available bandwidth, hop count and the like, and the like.
In step S3, information interaction between clusters is established by using each cluster head as a communication gateway, including the exchange of node information tables in clusters, so that the separated clusters are connected into a whole to facilitate uniform deployment.
According to the cluster QoS route design method provided by the embodiment of the invention, the aerostat node at the core position is selected as the cluster head node, the member nodes in the cluster are served and managed, and route calculation is completely given charge to the aerostat node, so that the energy of the member nodes in the cluster such as an unmanned aerial vehicle can be saved, and the endurance time of the member nodes is increased; meanwhile, as the aerostat nodes have high-performance computing resources and sufficient energy, the routing computation is faster, and the time overhead is less; meanwhile, in order to adapt to the characteristics of the application scene of the space-time, air-ground and vehicle integrated network, a cluster-based QoS routing protocol is established, so that the centralized routing and the distributed routing are combined, and the bandwidth requirement and the delay requirement are met.
Based on the content of the foregoing embodiment, as an alternative embodiment, as shown in fig. 3, the foregoing step 2 includes, but is not limited to, the following steps:
s21: establishing an adjacent node list by the cluster head node and the member nodes in the cluster respectively by utilizing the communication hello packets;
s22: the cluster head node broadcasts a root node declaration grouping to an adjacent node set according to an adjacent node table corresponding to the cluster head node;
s23: after receiving the root node declaration grouping, the adjacent nodes join the cluster where the cluster head node is located, and continue flooding the root node declaration grouping to the next-level adjacent node according to the adjacent node table corresponding to the adjacent nodes;
s24: and (4) iteratively executing the steps until the flooding process is converged, and acquiring an intra-cluster node information table formed by a plurality of mutually disjoint trees.
Specifically, in step S21, taking the network scenario diagram described in fig. 4 as an example for explanation, in the initialization phase of the cluster QoS route design provided in the embodiment of the present invention, each node (including the cluster head node and all intra-cluster member nodes) broadcasts a hello packet to its surrounding nodes, and a node receiving the hello packet replies a hello _ ack packet to the node sending the hello packet, and should determine that the other node is a neighboring node of itself, and after the confirmation work of the neighboring node of each node is completed, a neighboring node table in the cluster may be generated.
For example: all nodes in fig. 4 broadcast hello packets to their surrounding nodes, wherein the hello packet signal of D is received by C, and C replies hello _ ack packets to D, and establishes mutual neighboring nodes between C and D, and similarly, a mutual neighboring node relationship can also be established between D and R1.
Further, in steps S22-S24, the cluster Head node acquires its own one-hop neighboring node set by the above method, and then multicasts a root node declaration group (HANN for short) containing the one-hop neighboring node set to the one-hop neighboring nodes; the one-hop neighbor nodes of the cluster head continue to flood the HANN packets, respectively, and are not forwarded to other one-hop neighbors.
For example: cluster head node R1A HANN containing the set of one-hop neighbor nodes is multicast to one-hop neighbor nodes A, B and D, while A, B and D continue to flood the HANN packet and select the one-hop upstream node that first received the HANN as its parent. And iteratively executing the steps until the flooding process converges, namely all the nodes belong to different clusters, and after the process is finished, generating a plurality of mutually disjoint trees in the whole network, wherein each tree is the structure of the corresponding cluster.
The embodiment of the invention starts broadcasting by the cluster head and constructs the cluster structure tree hop by hop, thereby effectively controlling the broadcasting overhead.
Based on the content of the foregoing embodiment, as an optional embodiment, after the neighboring node receives the root node declaration packet and joins the cluster where the cluster head node is located, the method further includes: and the cluster head node updates the node information table in the cluster.
Each member node in each cluster sends a Periodic Reply packet (PREP) containing information of one-hop neighbor node, available bandwidth, hop count and the like to a cluster head of the cluster in which the member node is located through a parent node of the member node. The cluster head records the related information in the intra-cluster node information table according to the PREP packet.
For example, take the network scenario diagram of fig. 4 as an example (where all source nodes are set to R)1) The results of the construction of table 1 are shown,as shown in table 1:
table 1-intra cluster node information table of cluster head R1
Figure BDA0002296555720000091
For example, the content of line 5 therein includes: the source node is set to R1The destination node is C; then, the next hop address represents an address of a next hop from the source node to the destination node, the hop count represents a total hop count from the source node to the destination node, and one adjacent node represents one adjacent node of the destination node; each intra-cluster node information table may further include information such as a total bandwidth (unit: Mbps), an available bandwidth (unit: Mbps), a timestamp, and the like of each destination node, which is not described in detail in this embodiment.
Based on the content described in the foregoing embodiment, further, the updating of the in-cluster node information table by the cluster head node may be that the cluster head node periodically updates the in-cluster node information table, and mainly includes the following steps:
the intra-cluster member node packs the adjacent node table, the available bandwidth and the hop count information corresponding to the intra-cluster member node into a periodic reply packet, and sends the periodic reply packet to the cluster head node of the cluster in which the intra-cluster member node is located; and the cluster head node updates the node information table in the cluster according to the periodic reply packet.
Further, the cluster head node updating the node information table in the cluster may also be implemented by the following steps, including: and determining that the adjacent nodes of the member nodes in the cluster are changed or the available bandwidth of the member nodes in the cluster exceeds a set threshold, and immediately updating the node information table in the cluster by the cluster head node.
The information Reply packets of member nodes in the cluster are divided into two types, one is a periodic Reply PREP packet, and the other is an Immediate Reply (IREP) packet. The PREP packet is primarily intended for periodic HANN packet replies to the cluster head, while the IREP is primarily intended for emergency information, such as a change in one-hop neighbor nodes and a change in available bandwidth exceeding a set threshold, where the set threshold may be set to 25% of the total bandwidth.
Specifically, as shown in fig. 5, the step of periodically updating the node information table in the cluster by the cluster head node includes: and the cluster head periodically multicasts the HANN packet to the adjacent cluster node set, each cluster node in the adjacent cluster node set records that the cluster is added after the HANN packet is received, the HANN packet is continuously flooded, and the PREP packet is replied along the reverse direction of the tree. If the adjacent node of any cluster node is changed or the change of the available bandwidth exceeds the set threshold (set to 25% in the figure), the cluster head immediately updates the cluster node information table, and replies an IREP group along the reverse direction of the tree, and finally completes the updating of the cluster node information table.
The cluster QoS route design method provided by the embodiment of the invention can save the route overhead while ensuring the timely update by designing different modes of regular update and immediate update for the node information table in the cluster.
Based on the content of the above embodiment, as an alternative embodiment shown in fig. 6, the step S3 includes, but is not limited to, the following steps:
s31: each cluster head node periodically sends an inter-cluster routing table to the cluster head nodes adjacent to the one-hop range of the cluster head node; s32: the adjacent cluster head node receives the inter-cluster routing table and updates the self intra-cluster node information table so as to complete the exchange of the intra-cluster node information table; s33: and step S31 is stopped after the process converges in the steps of S31-S32, and the inter-cluster routing table is obtained.
Table 2-inter-cluster routing table for clusterhead R1
Figure BDA0002296555720000101
In the initialization stage, each cluster head only knows the member nodes of the cluster where the cluster head is located, and in order to calculate the inter-cluster route, the cluster head needs to know the member nodes of the cluster. Each cluster head sends its own inter-cluster routing table to its own one-hop neighboring cluster head periodically, and after receiving the inter-cluster routing table, the neighboring cluster head updates its own inter-cluster routing table according to the contents therein. Specifically, each cluster headThe nodes periodically send the inter-cluster routing table to the cluster head nodes adjacent to the one-hop range of the nodes, and the adjacent cluster head nodes receive the inter-cluster routing table and update the inter-cluster routing table of the nodes to complete the exchange of the inter-cluster routing table. Until the process converges, that is, after the inter-cluster routing table is completed among all the clusters, each cluster head collects the state information of the member nodes included in other clusters, so that a route to any one cluster can be acquired. The convergence process is similar to the update process of the RIP protocol. As shown in FIG. 4, with R1The inter-cluster routing table established by using the member node in any cluster in the cluster as a source target is shown in the table 2.
Based on the content of the foregoing embodiment, as an alternative embodiment, after performing step S33, the method may further include: and (4) determining that the intra-cluster node where the adjacent cluster head node is located is changed, updating the inter-cluster routing table of the adjacent cluster head node, and executing the steps S31-S32 again.
The generation of the inter-cluster routing table is that the inter-cluster routing table is periodically exchanged between adjacent cluster heads during the network initialization period. After the process is converged, the cluster heads do not exchange the inter-cluster routing table regularly, but exchange the inter-cluster routing table of the cluster heads to enable other cluster heads to know the change for updating in time only when the nodes in the cluster are changed, and the routing overhead is favorably controlled.
Based on the content of the foregoing embodiment, as an alternative embodiment, after performing step S3, the method further includes: determining that a source node and a destination node of a service flow are located in the same cluster, executing the following steps:
judging whether a route reaching a destination node exists in an adjacent node table corresponding to a source node;
if so, establishing data transmission between the source node and the destination node;
if not, sending a routing request packet to the cluster head node through the source node; the cluster head node groups according to the route request to generate an optimal in-cluster route, writes a node sequence of the optimal in-cluster route into a route notification group, and sends the route notification group to a destination node in a one-hop manner; and the destination node sends a route reply packet to the source node according to the reverse path, wherein the route reply packet comprises a node sequence and the source node establishes data transmission with the destination node according to the node sequence.
Specifically, the method for designing a clustered QoS route according to the embodiment of the present invention, after completing the switching of the routing tables between clusters, if it is determined that the source node and the destination node of a service flow are located in the same cluster, performs intra-cluster route calculation, including but not limited to the following steps:
(1) when the source node and the destination node of the service flow are positioned in the same cluster, the source node firstly searches whether a route reaching the destination node exists in a routing table of the source node, if so, the source node directly starts service data transmission, and if not, the source node sends a request (B) containing the minimum bandwidth of the servicemin) And maximum delay requirement (D)max) The Route Request (RREQ for short) is grouped to the cluster head, and the cluster head is responsible for calculating and selecting the optimal intra-cluster Route. The optimal intra-cluster route is defined herein as the path of the minimum number of hops that meets the minimum bandwidth requirement.
(2) The cluster head writes the node sequence of the optimal intra-cluster Route into a Route Notification (RNOT) group, and directly sends the group to a destination node in one hop.
(3) The destination node sends a Route Reply (RREP) packet including the node sequence of the optimal Route toward the source node along a reverse path according to the node sequence of the Route in the RNOT.
(4) If the source node receives the RREP packet, indicating that the selected route meets the current traffic QoS requirements, the route is used to begin transmitting traffic data.
Based on the content of the foregoing embodiment, as an optional embodiment, after the destination node sends the route reply packet to the source node according to the reverse route, the method may further include:
performing bandwidth reservation and delay accumulation on member nodes in each cluster in the reverse path, and updating the current delay accumulation value in the route reply packet; if the current bandwidth of any member node in the cluster does not meet the minimum bandwidth requirement of the service or the time delay accumulated value of any member node in the cluster exceeds the maximum time delay requirement of the service, discarding the Route reply packet, sending a Route Recalculation (RREC) packet to a cluster head node, and sending a Resource Release (RRES) packet to a downstream node of the Route; after the cluster head node receives the RREC grouping, the routing calculation is carried out again to obtain the optimal intra-cluster routing; and after receiving the RRES packet, the downstream node of the route releases the reserved bandwidth resource.
Specifically, in the RREP packet transmission process, each node in the middle needs to perform bandwidth reservation and delay accumulation, and update the current delay accumulation value in the RREP packet. If one node finds that the current bandwidth does not satisfy BminOr the accumulated value of time delay exceeds the D of the servicemaxAnd discarding the packet, sending a route recalculation packet to inform the cluster head of performing route recalculation again, and sending a resource release packet to inform the downstream node of the route to release the reserved bandwidth resource.
Based on the content of the foregoing embodiment, as an alternative embodiment, after performing step S3, the method further includes: determining that a source node and a destination node of a service flow are located in different clusters, and executing the following steps:
the cluster head node receives the first routing request packet of the source node, generates a node sequence of a route in the source node cluster, writes the first routing request packet into the cluster head node, and acquires a second routing request packet; the second routing request packet is sent to a cluster head node of a cluster where a target node is located hop by hop, and the node sequence number of each passing cluster head node is added to the second routing request packet in sequence to generate a third routing request packet; a cluster head node of a cluster where a destination node is located generates a route notification packet according to a route in the destination node cluster; extracting a node sequence in the third route request packet and a node sequence of a route in a destination node cluster, writing the node sequences into a route notification packet, and sending the route notification packet to a destination node in one hop; the destination node sends a route reply packet to the source node according to a reverse route; and the source node establishes data transmission with the destination node according to the route reply packet.
Specifically, as shown in fig. 8, in the method for designing a cluster QoS route according to the embodiment of the present invention, after the switching of the routing tables between clusters is completed, if it is determined that the source node and the destination node of a service flow are not located in the same cluster, the inter-cluster route calculation is performed, including but not limited to the following steps:
the whole route consists of three parts. The first part is the intra-cluster route of the cluster where the source node is located, the second part is the static link between the cluster heads, and the third part is the intra-cluster route of the cluster where the destination node is located. The specific process is as follows:
(1) the source node searches its own route table, if there is a route to the destination node, it directly starts to transmit the service data, if not, it sends a message containing Bmin，DmaxThe route request RREQ is grouped to its own clusterhead.
(2) The cluster head checks that the node information table in the cluster does not obtain the target node and knows that the node is an out-of-cluster node, so that an inter-cluster routing table is searched, the node sequence of the first part of routing is written into the RREQ and the RREQ grouping is forwarded to the cluster head of the cluster where the target node is located hop by hop, and the middle cluster head adds the node sequence number of the cluster head to the RREQ
(3) The cluster head of the target cluster can acquire the cluster route reaching the target node, namely the third part route, according to the cluster node information table, the cluster head generates a route notification RNOT group, extracts and writes the route node sequence in the RREQ into the RNOT group, adds the node sequence number of the cluster head and the node sequence of the third part route into the RNOT group, and sends the RNOT to the target node by jumping.
(4) The destination node sends a route reply RREP packet towards the source node along a reverse path according to the node sequence of the route in the RNOT, the RREP packet containing the node sequence of the optimal route.
(5) The source node receives the RREP packet indicating that the selected route meets the current traffic QoS requirements and begins transmitting traffic data using that route.
In the process of sending the RREP packet, namely after a destination node receives the RNOT, the destination node sends a route reply RREP packet containing a node sequence of the whole route according to a reverse path, and an intermediate node needs to check QoS constraint content in the RREP, perform bandwidth reservation and time delay statistics and update a current time delay cumulative value in the RREP. If one intermediate node finds that the bandwidth reservation fails or the current delay accumulated value exceeds the maximum delay requirement, the intermediate node sends a resource releasing RRES packet to inform a downstream node of the route to release the reserved bandwidth resource.
According to the cluster QoS route design method provided by the embodiment of the invention, the aerostat node at the core position is selected as the cluster head node, the member nodes in the cluster are served and managed, and route calculation is completely given charge to the aerostat node, so that the energy of the member nodes in the cluster such as an unmanned aerial vehicle can be saved, and the endurance time of the member nodes is increased; meanwhile, as the aerostat nodes have high-performance computing resources and sufficient energy, the routing computation is faster, and the time overhead is less; meanwhile, in order to adapt to the characteristics of the application scene of the space-time, air-ground and vehicle integrated network, a cluster-based QoS routing protocol is established, so that the centralized routing and the distributed routing are combined, and the bandwidth requirement and the delay requirement are met.
In summary, the following steps: the embodiment of the invention provides a centralized and distributed QoS routing protocol (CQR) based on clustering, which can simultaneously meet the bandwidth requirement and the delay requirement by combining the provided clustering QoS routing design method.
Compared with QoS-AODV protocol and QoS-OLSR protocol, the CQR protocol has the following characteristics and advantages:
1) from the network performance perspective, the structure of the space-time ground vehicle integrated network has the characteristics of centralized type and distributed type, and can be regarded as a Mesh network, a CQR protocol is designed for the Mesh network, a clustering scheme is adopted, and aerostat nodes at the core position are selected as cluster heads to serve and manage member nodes in the cluster. And the QoS-AODV and the QoS-OLSR are mainly oriented to a distributed network structure and are not very suitable for a Mesh network structure. Mainly embodies that the CQR protocol has higher packet delivery rate, the route establishment time is obviously lower than QoS-AODV but slightly higher than QoS-OLSR, and the route overhead proportion is slightly higher than QoS-AODV but lower than QoS-OLSR.
2) From the energy perspective, route calculation is given charge to the aerostat node, can save the energy of other nodes such as unmanned aerial vehicle, increases its time of endurance, simultaneously because the aerostat node has high performance computational resource and sufficient energy, route calculation is quick, and time cost is few. The QoS-OLSR is that the node calculates the route, brings more route overhead and consumes energy quickly; QoS-AODV is passive on-demand routing, consumes little energy, is not strong in perception of network topology change and is not suitable for a network with fast dynamic change.
Comprehensively, the CQR route is superior to QoS-AODV and QoS-OLSR, and is more suitable for the air-ground vehicle integrated network.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (9)

1. A method for designing a cluster QoS route is characterized by comprising the following steps:
s1: dividing a network into a plurality of different clusters, and setting a fixed aerostat node at the core position of each cluster as a cluster head node;
s2: collecting state information of member nodes in the cluster through the cluster head node to construct an intra-cluster node information table;
s3: connecting different clusters by using the cluster head node as an inter-cluster gateway to complete the exchange of the intra-cluster node information table and construct an inter-cluster routing table;
step S3 specifically includes:
s31: each cluster head node periodically sends an inter-cluster routing table to the cluster head nodes adjacent to the one-hop range of the cluster head node;
s32: the adjacent cluster head node receives the inter-cluster routing table and updates the self intra-cluster node information table so as to complete the exchange of the intra-cluster node information table;
s33: and iteratively executing S31-S32 until the process converges, stopping the step S31 and obtaining the inter-cluster routing table.
2. The method of claim 1, wherein step S2 comprises:
s21: the cluster head node and the member nodes in the cluster respectively establish an adjacent node list by utilizing a communication hello packet;
s22: the cluster head node announces grouping to an adjacent node set multicast root node according to the adjacent node table corresponding to the cluster head node;
s23: after receiving the root node declaration grouping, the adjacent nodes join the cluster where the cluster head node is located, and continue to flood the root node declaration grouping to the next-level adjacent nodes according to the adjacent node table corresponding to the adjacent nodes;
s24: and (4) iteratively executing the steps until the flooding process is converged, and acquiring an intra-cluster node information table formed by a plurality of mutually disjoint trees.
3. The method of claim 2, wherein after the neighboring node receives the root node declaration packet and joins the cluster where the cluster head node is located, the method further comprises: and the cluster head node updates the node information table in the cluster.
4. The method of claim 3, wherein the updating of the in-cluster node information table by the cluster head node periodically updates the in-cluster node information table for the cluster head node, and comprises:
the member nodes in the cluster pack the adjacent node table, the available bandwidth and the hop count information corresponding to the member nodes in the cluster into a periodic reply packet, and the periodic reply packet is sent to the cluster head node of the cluster in which the member nodes are located;
and the cluster head node updates the node information table in the cluster according to the periodic reply packet.
5. The method of claim 4, wherein the cluster head node updates an intra-cluster node information table, further comprising:
and if the adjacent nodes of the member nodes in the cluster are determined to be changed or the available bandwidth of the member nodes in the cluster exceeds a set threshold, the cluster head node immediately updates the node information table in the cluster.
6. The method for designing clustered QoS routes according to claim 1, further comprising, after performing step S33:
determining that the intra-cluster node where the adjacent cluster head node is located is changed, and after updating the inter-cluster routing table of the adjacent cluster head node, executing the steps S31-S32 again;
and the in-cluster node where the adjacent cluster head node is located is an in-cluster member node of the cluster where the cluster head node is located.
7. The method for designing clustered QoS routes according to claim 1, further comprising, after performing step S3:
determining that a source node and a destination node of a service flow are located in the same cluster, executing the following steps:
judging whether a route reaching the destination node exists in an adjacent node table corresponding to the source node;
if so, establishing data transmission between the source node and the destination node;
if not, sending a routing request packet to the cluster head node through the source node;
the cluster head node generates an optimal in-cluster route according to the route request grouping, writes a node sequence of the optimal in-cluster route into a route notification grouping, and sends the route notification grouping to the destination node in one hop;
the destination node sends a route reply packet to the source node according to a reverse route, wherein the route reply packet comprises the node sequence;
and the source node establishes data transmission with the destination node according to the node sequence.
8. The method of claim 7, wherein after the destination node sends a route reply packet to the source node in a reverse route, the method further comprises:
performing bandwidth reservation and delay accumulation on member nodes in each cluster in the reverse path, and updating the current delay accumulation value in the route reply packet;
if the current bandwidth of any member node in the cluster does not meet the minimum bandwidth requirement of the service or the time delay accumulated value of any member node in the cluster exceeds the maximum time delay requirement of the service, discarding the route reply packet and sending a route recalculation packet to the cluster head node;
and the cluster head node sends a resource releasing group to a downstream node of the route, and after the cluster head node notifies the reserved bandwidth resources to be released, the cluster head node performs route calculation again to obtain the optimal intra-cluster route.
9. The method for designing clustered QoS routes according to claim 1, further comprising, after performing step S3:
determining that a source node and a destination node of a service flow are located in different clusters, and executing the following steps:
the cluster head node receives a first routing request packet of the source node, generates a node sequence of a route in a source node cluster, writes the first routing request packet into the cluster head node, and acquires a second routing request packet;
sending the second routing request packet hop by hop to a cluster head node of a cluster where the destination node is located, and sequentially adding a node sequence number of each passing cluster head node to the second routing request packet to generate a third routing request packet;
a cluster head node of a cluster where the destination node is located generates a route notification packet according to a route in the destination node cluster;
extracting a node sequence in the third route request packet and a node sequence of a route in the destination node cluster, writing the node sequences into the route notification packet, and sending the node sequences to the destination node in one hop;
the destination node sends a route reply packet to the source node according to a reverse route;
and the source node establishes data transmission with the destination node according to the route reply packet.
CN201911204044.5A 2019-11-29 2019-11-29 Cluster QoS route design method Active CN110995333B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911204044.5A CN110995333B (en) 2019-11-29 2019-11-29 Cluster QoS route design method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911204044.5A CN110995333B (en) 2019-11-29 2019-11-29 Cluster QoS route design method

Publications (2)

Publication Number Publication Date
CN110995333A CN110995333A (en) 2020-04-10
CN110995333B true CN110995333B (en) 2020-12-01

Family

ID=70088492

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911204044.5A Active CN110995333B (en) 2019-11-29 2019-11-29 Cluster QoS route design method

Country Status (1)

Country Link
CN (1) CN110995333B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111901153B (en) * 2020-07-02 2022-11-01 南京邮电大学 Tactical edge-oriented decentralized computing architecture
CN112350932B (en) * 2020-09-30 2021-11-23 浙江三维利普维网络有限公司 Hierarchical network routing method, system and computer equipment based on OLSR routing protocol
CN113613307B (en) * 2021-07-15 2023-08-04 天津(滨海)人工智能军民融合创新中心 On-demand routing method based on local active routing assistance
CN115037687A (en) * 2022-04-15 2022-09-09 北京云联慧通科技有限公司 Route establishing method and device based on multiple nodes and electronic equipment
CN115720357A (en) * 2022-11-02 2023-02-28 航天行云科技有限公司 Clustering mobility management method and system for wireless ad hoc network

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2003202882A1 (en) * 2002-01-04 2003-07-24 Einfinitus Technologies, Inc. Dynamic route selection for label switched paths in communication networks
CN101047638A (en) * 2006-06-28 2007-10-03 华为技术有限公司 Mesh network route method and device
EP1983699B1 (en) * 2007-04-16 2010-12-08 Rockwell-Collins France Multicast routing protocol for a clustered mobile ad hoc network
CN100576826C (en) * 2007-12-14 2009-12-30 北京科技大学 A kind of vehicle-mounted Ad hoc network cluster dividing method based on the signal bonding strength
KR100943178B1 (en) * 2007-12-17 2010-02-19 한국전자통신연구원 Method for routing and allocating resources in wireless sensor network
CN105323818B (en) * 2015-11-04 2018-09-14 天津理工大学 Energy saving cluster routing method based on network area division and distance
CN110234146B (en) * 2019-05-25 2022-12-13 西南电子技术研究所（中国电子科技集团公司第十研究所） Distributed self-adaptive clustering method suitable for self-organizing network

Also Published As

Publication number Publication date
CN110995333A (en) 2020-04-10

Similar Documents

Publication Publication Date Title
CN110995333B (en) Cluster QoS route design method
CN110149671B (en) Routing method of unmanned aerial vehicle swarm network
CN100591029C (en) Multi-jump wireless self-organizing network construction method based on partition tree
Garcia-Santiago et al. Evaluation of AODV and DSDV routing protocols for a FANET: Further results towards robotic vehicle networks
CN105871717A (en) Unmanned aerial vehicle ad hoc network routing method based on link stability
Rivoirard et al. Performance evaluation of AODV, DSR, GRP and OLSR for VANET with real-world trajectories
CN108366093B (en) Distributed wireless ad hoc network based on virtual center and mobile agent
Toorchi et al. Skeleton-based swarm routing (SSR): Intelligent smooth routing for dynamic UAV networks
Barve et al. Optimization of DSR routing protocol in MANET using passive clustering
Qu et al. An LBMRE-OLSR routing algorithm under the emergency scenarios in the space-air-ground integrated networks
CN109803342B (en) Unmanned aerial vehicle self-organizing network routing method oriented to energy balance
Choukri et al. An energy efficient clustering algorithm for MANETs
CN113411118A (en) Mesh-based virtual routing method for unmanned aerial vehicle ad hoc network
Logambigai et al. QEER: QoS aware energy efficient routing protocol for wireless sensor networks
Fu et al. A mesh in the sky: A routing protocol for airborne networks
Chaudhary et al. Energy efficiency and latency improving protocol for wireless sensor networks
Zheng et al. Research of routing protocols for unmanned aerial vehicle ad hoc network
Liu et al. Advanced Fast Recovery OLSR Protocol for UAV Swarms in the Presence of Topological Change
Liu et al. A Position Sensitive Clustering Algorithm for VANET.
Kumbharey et al. Renovated Cluster Based Routing Protocol for MANET
CN112423356B (en) Unmanned equipment cluster AODV routing method based on energy balance
Erman et al. A cross-layered communication protocol for load balancing in large scale multi-sink wireless sensor networks
Zhou Survey of ant colony routing protocols for mobile ad hoc networks
Zhang et al. PCAR: A power controlled routing protocol for wireless ad hoc networks
Lafta et al. Efficient routing protocol in the mobile ad-hoc network (MANET) by using genetic algorithm (GA)

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