CN109547345B - Software-defined airborne network system and content-driven routing method - Google Patents

Software-defined airborne network system and content-driven routing method Download PDF

Info

Publication number
CN109547345B
CN109547345B CN201910058417.6A CN201910058417A CN109547345B CN 109547345 B CN109547345 B CN 109547345B CN 201910058417 A CN201910058417 A CN 201910058417A CN 109547345 B CN109547345 B CN 109547345B
Authority
CN
China
Prior art keywords
network
plane
information
node
content
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
CN201910058417.6A
Other languages
Chinese (zh)
Other versions
CN109547345A (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.)
Individual
Original Assignee
Individual
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 Individual filed Critical Individual
Priority to CN201910058417.6A priority Critical patent/CN109547345B/en
Publication of CN109547345A publication Critical patent/CN109547345A/en
Application granted granted Critical
Publication of CN109547345B publication Critical patent/CN109547345B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/14Routing performance; Theoretical aspects
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04Large scale networks; Deep hierarchical networks
    • H04W84/06Airborne or Satellite Networks

Abstract

The invention discloses a software-defined airborne network system and a content-driven routing method.A data plane is connected with a control plane through a southbound interface, the control plane is connected with an application plane through a northbound interface, and a management plane is respectively connected with the application plane, the control plane and the data plane through a management interface; the invention further designs a content-driven routing method from the point of view of network performance parameters such as end-to-end access delay, throughput and the like on the basis of a software-defined airborne network system. The software-defined airborne network system integrates the software-defined network, the information center network and the airborne tactical network, improves the flexibility and efficiency of network management and control, and provides differentiated network service for the network and efficient transmission of high-value information; in addition, the routing method of the invention provides different levels of differentiated routing forwarding capability for different information contents, thereby realizing the purpose of providing high-efficiency differentiated service for the network.

Description

Software-defined airborne network system and content-driven routing method
Technical Field
The invention relates to the technical field of routing protocols, in particular to a software-defined airborne network system and a content-driven routing method.
Background
In recent years, collaborative combat by airborne clusters consisting of large-scale manned/unmanned airborne platforms has replaced single-platform combat as the primary mode of airborne combat. The cluster members realize single or small amount of complex tasks through cooperative work, and further realize the maximization of platform capacity and the emergence of new cluster capacity. Currently, airborne networks employing a "chimney" architecture are typically designed for specific air combat communication needs, such as command, control, attack, intelligence, surveillance, reconnaissance, and the like. This design consideration tightly couples the communication services provided by the onboard network to the specific combat application. The method is limited by a chimney-type structure, and a routing protocol which is used for establishing connection, forwarding data and other important functions in the current airborne network is also limited, so that the method can only meet the information interaction requirement of fixed mode under the limited task background, but cannot support the flexible combat cooperation among all members of the aviation cluster.
Currently, the emergence of a Software Defined Networking (SDN) paradigm provides an idea for solving the problem of how an airborne network meets the information interaction requirement in the future aviation trunking combat application process. The SDN thoroughly separates a control plane and a data plane of a network, and forms a three-layer structure of an application plane, the control plane and the data plane from top to bottom. In the SDN, a data plane only needs to forward a data packet, and all operations such as routing decision, load balancing, traffic engineering, and the like are performed in a control plane in a logic set, so that the flexibility and efficiency of network management and control are fully improved. Researchers have tried to apply the paradigm of SDN to airborne networks, for example, the basic capability requirements of aviation trunking airborne networks of aviation trunking combat applications are analyzed by software-defined aviation trunking airborne tactical networks (journal of communications, 2017,38(8): 140:155.) in zhang hong et al, and a software-defined airborne network (SDAN-AS) architecture is proposed. The method explores the form of the airborne network supporting efficient information interaction among members of the future aviation cluster, and provides reference and reference for determining the evolution direction of the future airborne network.
On the other hand, as the topic of network applications gradually evolves toward content acquisition and information services, people increasingly demand applications for information acquisition. The existing system structure taking the host as the center is difficult to meet the application requirement taking information as the core in the future. Information Centric Networking (ICN) has been developed as a revolutionary network architecture with information content as the center, and provides a new approach to solve the contradiction between architecture and application requirements. The ICN directly names the information content, realizes the functions of routing forwarding, in-network caching, transmission control and the like based on the information content, solves the problem of 'what' but not 'where' of the information, and accords with the visual feeling of people for obtaining the information. Meanwhile, information and position are decoupled based on naming of information content, the information content acquisition efficiency is improved, and a new thought is provided for efficient acquisition and transmission of high-value information required by a task which cannot be supported by an airborne network.
The prior art has the following disadvantages:
currently, an airborne network mainly adopts a chimney type structure, and meets the continuously increasing and changing communication requirements of aviation operation by continuously superposing new communication protocols, communication terminals, communication antennas and other software and hardware in the face of continuously expanding aviation cluster operation functions of various platforms, multiple operation stages and multiple operation tasks. The method is simple, but causes mutual independence and equipment repetition among different systems, and causes difficult network management and control and poor interoperability and expandability. In addition, due to the restriction of factors such as platform load, integration technology and the like, the performance of an airborne network is improved to a limited extent, the flexibility, the openness and the interoperability are obviously insufficient, the complex communication requirement of aviation cluster battle is difficult to meet, and the capability of an aviation cluster is limited to emerge.
On one hand, a routing protocol under the current airborne network is restricted by a chimney type network architecture, and the flexible combat cooperation among all members of an aviation cluster is difficult to support. On the other hand, most routing protocols under the existing airborne network only solve the network problems under the specific battle scene, and provide a feasible scheme for improving the link data rate, the end-to-end network availability and other network performances, but do not consider and grasp the routing mechanism from the global perspective. Meanwhile, the routing protocol in the existing airborne network does not pay attention to the specific content of the forwarding information, so that the network has low acquisition efficiency of the information content, and the high-value information in the network is difficult to be efficiently transmitted.
Disclosure of Invention
Aiming at the defects existing in the problems, the invention provides a software-defined airborne network system and a content-driven routing method.
The invention discloses a software-defined airborne network system, which integrates three networks of SDN, ICN and airborne network, and comprises the following steps: the system comprises a data plane, a control plane, an application plane and a management plane, wherein the data plane is connected with the control plane through a southbound interface, the control plane is connected with the application plane through a northbound interface, and the management plane is respectively connected with the application plane, the control plane and the data plane through a management interface; wherein:
the data plane comprises a plurality of network devices, and is used for transmitting data packets in the plane according to configuration content issued by the control plane, collecting network state information in the plane and sending the network state information to the control plane;
the control plane includes a controller for processing and scheduling traffic of the data plane and opening multiple levels of programmability to the application plane;
the application plane comprises a plurality of network application modules for implementing user-defined high-level network control logic;
the management plane is used for managing the application plane, the control plane and the data plane.
As a further improvement of the present invention, in the data plane, a data transmission mode of the ICN is adopted;
the network equipment D needs certain information content, the network confirms the request of the network equipment D for the information content by sending an interest packet, so that the network equipment E meeting the corresponding requirement is found, and the network equipment E sends a data packet containing the information content needed by the network equipment D to complete information interaction.
As a further improvement of the present invention, the control plane processes and schedules the traffic of the data plane by performing centralized management and forwarding decision on the network devices of the data plane;
the control plane opens multiple levels of programmability to the application plane, allowing network users to flexibly formulate various network policies based on specific application scenarios.
As a further improvement of the present invention, in the application plane, the implementation of the content-driven routing method requires calling a mapping module in the controller, and the mapping module performs mapping from information content to an address;
the information content is transmitted to the controller through the southbound interface, the controller processes a data packet containing the information content through the mapping module, the information content is converted into an address, the data packet containing the address is issued to corresponding network equipment through the southbound interface, and the network equipment makes routing decision and forwards according to the address information.
The invention also discloses a content-driven routing method based on the software-defined airborne network system, which comprises the following steps:
calculating all paths from a source node to a destination node;
whether relevant forwarding information exists in a forwarding information base of the source node or not is judged;
if not, the source node sends an interest message to the controller;
whether the local routing information base of the controller has relevant routing information or not;
if not, a routing protocol driven by the content is called to calculate routing information and is issued to all relevant nodes;
the source node selects the optimal path in all paths to forward the interest message according to the routing information;
and the destination node returns the data message in the original path after receiving the interest message.
As a further improvement of the invention, if the forwarding information base of the source node has related forwarding information, the source node selects the optimal path in all paths to forward the interest message according to the routing information;
and if the local routing information base of the controller has related routing information, the source node selects the optimal path in all paths to forward the interest message according to the routing information.
As a further improvement of the invention, the method also comprises the following steps:
when the route forwarding mechanism is abnormal, the data packet cannot find the next target node, so that the forwarding fails and congestion is generated, and the expanded routing selection algorithm based on the multidimensional perception is directly called to select the next hop node.
As a further improvement of the present invention, the routing algorithm includes:
calculating the link connection time T of k neighbors of the source node;
calculating k comprehensive parameter values S, and arranging the k comprehensive parameter values S from large to small;
judging whether the same parameter value exists or not;
if yes, arranging the node connection time from large to small;
judging whether the same node connection time exists or not;
if yes, arranging the occupancy rates of the link layers from low to high;
obtaining a sequence s (x);
setting all 2-hop neighbor sets of x as Q (x), MPR sets of x as M (x), and setting as an empty set initially;
selecting a 1 st neighbor Ni from S (x);
judging whether Ni has some nodes including Q (x);
if so, adding Ni to M (x), deleting the node contained in M (x) from Q (x), and deleting Ni from S (x);
determining whether S (x) or Q (x) is empty;
if yes, the obtained M (x) is the MPR node set.
As a further improvement of the present invention, if there are no identical parameter values, a sequence s (x) is obtained;
if the same node connection time does not exist, acquiring a sequence S (x);
if Ni does not contain some nodes of Q (x), judging whether S (x) or Q (x) is empty;
if S (x) or Q (x) is not empty, then select neighbor Ni from S (x).
As a further improvement of the invention, the connection link time T is defined as:
Figure GDA0002572259860000051
in the formula: m ═ Vi×sin θi-Vj×sin θj,n=Xi-Xj,o=Vi×sin θi-Vj×sin θj,p=Yi-Yj,Vi,VjRepresenting the average moving speed of the node, thetai,θjIs the moving direction of the node, (X)i,Yi) And (X)j,Yj) Coordinates of nodes i, j respectively;
the combined parameter values S (x) are defined as:
Si=α×Tij+β×ηi
in the formula: alpha and beta are weighting parameters, and alpha + beta is 1;
Tijis the connection time of nodes i and j, ηiThe link layer congestion degree for node i is defined as:
ηi=Bp(i)/Bc(i)
in the formula: b isp(i) For the number of packets currently cached in the node i link layer interface queue, Bc(i) Caching capacity in a link layer interface queue of a node i;
and when the message forwarding still cannot be carried out by using the expanded MPOLSR routing algorithm, the data packet is selected to be discarded.
Compared with the prior art, the invention has the beneficial effects that:
the software-defined airborne network system disclosed by the invention integrates the software-defined network, the information center network and the airborne tactical network, improves the flexibility and efficiency of network control, provides differentiated network service for the network and efficient transmission of high-value information, and provides a feasible solution for overcoming the defects of the airborne tactical network in the background of aviation trunking combat. In addition, the invention further designs a content-driven routing method based on the system, and provides different levels of differentiated routing forwarding capability for different information contents, thereby realizing the purpose of providing high-efficiency differentiated service for the network.
Drawings
Fig. 1 is a schematic structural diagram of a software-defined airborne network system according to an embodiment of the present invention;
FIG. 2a is a diagram illustrating information interaction in a network system defined by software installed on board a computer according to an embodiment of the present invention;
FIG. 2b is another schematic diagram of information interaction in the SDN system according to an embodiment of the present invention;
FIG. 3 is a diagram of an interest message format disclosed in an embodiment of the present invention;
FIG. 4 is a diagram of a routing message format disclosed in one embodiment of the present invention;
FIG. 5 is a flow chart illustrating information message transmission according to a content-driven routing method for a software-defined airborne network system according to an embodiment of the present invention;
fig. 6 is a flowchart of a routing algorithm 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 obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
Aiming at the defects in the prior art, the invention provides a solution for solving the problems for an airborne network based on the idea that an open programming interface and a global network view of an SDN (software defined networking) name information according to the specific content of the information by using an ICN (integrated circuit network), integrates the SDN, the ICN and the airborne network, and provides a software defined information center airborne network (SDIC-ATN) system. Based on the system, a content-driven routing protocol (CDRP) is further designed from the perspective of network performance parameters such as end-to-end access delay and throughput, so as to provide differentiated routing forwarding capabilities with different service qualities for different information contents, thereby enabling the network to have the capability of providing efficient differentiated services.
The invention is described in further detail below with reference to the attached drawing figures:
as shown in fig. 1, the present invention provides a software defined airborne network system (SDIC-ATN), which integrates three networks of SDN, ICN and airborne network, and the SDIC-ATN refers to a network paradigm of SDN, and thus is also divided into an application plane, a control plane, a data plane and a management plane; the data plane is connected with the control plane through a south interface, the control plane is connected with the application plane through a north interface, and the management plane is respectively connected with the application plane, the control plane and the data plane through a management interface.
Wherein:
the data plane of the invention is composed of communication transmission equipment of ATN, which is called as network equipment in SDIC-ATN, and mainly has the functions of transmitting data packets in the plane according to related configuration content issued by the control plane, collecting network state information such as network topology and the like, and sending the network state information to the control plane. The SDIC-ATN refers to the data transmission mode of the ICN. Assuming that the network device D needs a certain information content, the network makes the network clear the request of the network device D for the information content by sending the interest packet, so as to find the network device E meeting the corresponding requirement, and the network device E sends the data packet containing the information content needed by the network device D to the network device D, thereby completing information interaction.
The control plane of the present invention is composed of network management devices of the ATN, which is called a controller in the SDIC-ATN. On one hand, the controller performs centralized management and forwarding decision on the underlying network equipment through a southbound interface protocol to process and schedule the flow of a data plane; on the other hand, the controller opens multiple levels of programmability to the upper application plane through the northbound interface, allowing network users to flexibly formulate various network policies based on specific application scenarios.
The application plane of the invention is composed of various network application modules, and realizes the high-level network control logic defined by users. In an application plane, the realization of the content-driven routing protocol designed by the invention needs to call a mapping module in the controller, and the mapping module finishes the mapping from information content to addresses. The information content is transmitted to the controller through the southbound interface, the controller processes the data packet containing the information content through the mapping module, the information content is converted into an address, the data packet containing the address is issued to the corresponding network equipment through the southbound interface, and the network equipment performs routing decision and forwarding according to the address information.
The management plane of the invention manages the SDIC-ATN network through the management interface, such as the deployment of a management controller, the initialization configuration of network equipment and the like.
The southward interface of the invention is connected with the data plane and the control plane to complete the interaction between the control plane and the data plane and part of the management configuration functions.
The northbound interface of the present invention connects the application plane and the control plane, providing logical abstraction and model of the data plane for the application. The interface is encapsulated, and an upper application developer is opened.
The management interface of the present invention is responsible for supporting the management plane to perform effective network management on the whole network.
The invention also provides a content-driven routing method based on the software-defined airborne network system, which comprises the following steps:
(1) route establishment mechanism
a) In the SDIC-ATN, the content request is referred to as "interest". When the network device receives the "interest packet," it returns a "data packet" to the requesting node. The packet traces a path to the requesting node. Subsequent intermediate nodes may forward the same interest packet further without being provided through the SDIC-ATN server.
b) The present invention assumes that network device B is the source node and network device E is the destination node. There are two paths from network device B to network device E, path 1: B-C-E, path 2: B-D-E.
c) After receiving a data packet, the network device B lacks relevant routing information in a Forwarding Information Base (FIB), and the data packet can only wait in a queue and sends an interest message to the controller through an extended OpenFlow protocol, as shown in fig. 2 a; the interest message contains the content name of the packet (SIAN-ID), the serial number (CSN), the address of network device B, the address of network device E and some other relevant data, etc.
d) The SIAN-ID may be fixed or variable depending on the naming method chosen, and can support different naming schemes. The CSN may be part of the content name or explicitly added as a variable length optional field. It may also identify the category of the content (e.g., instruction message or voice message) and the format of the interest message is shown in fig. 3.
e) After receiving the interest message, the controller searches a local Routing Information Base (RIB), and if the RIB does not have routing information about the message, the controller calls a content-driven routing protocol in an upper application plane through a northbound interface to determine information priority and calculate a routing message, wherein the format of the routing message is shown in fig. 4.
f) The present invention assumes that the controller, after calculation, obtains a more optimal route for path 2, which is stored in the RIB for the next decision. Then, the routing message is returned to the network device B and all the routing aircraft nodes in the obtained route through the extended OpenFlow, as shown in fig. 2B, where the routing message includes information Priority labels (Priority-IDs) and related routing information of the respective nodes.
g) Network device B, D, E, upon receiving the routing message, stores the relevant routing information in the respective FIB for the next lookup forwarding. And then the network equipment B starts to forward the interest message to the network equipment E along the path 2 according to the routing message, and the network equipment E returns the data message in the original path after receiving the interest message.
h) When the forwarding information table is full, the previous entry must be deleted and replaced by the new entry. This operation may be assisted by the controller or may be performed automatically by the node on the basis of fixed and simple rules, specific rules not being involved in the invention.
Specifically, the method comprises the following steps:
as shown in fig. 5, the method for transmitting information messages in an SDIC-ATN network of the present invention includes:
step 1, calculating all paths from a source node to a destination node;
step 2, whether relevant forwarding information exists in a forwarding information base of the source node or not is judged; if not, jumping to the step 3; if yes, jumping to the step 6;
step 3, the source node sends an interest message to the controller;
step 4, whether the local routing information base of the controller has relevant routing information or not; if not, jumping to the step 5; if yes, jumping to the step 6;
step 5, calling a routing protocol driven by the content to calculate routing information and sending the routing information to all relevant nodes;
6, the source node selects the optimal path in all paths to forward the interest message according to the routing information;
and 7, the destination node returns the data message in the original route after receiving the interest message.
(2) Exception handling mechanism
When the route forwarding mechanism is abnormal, the data packet cannot find the next target node, so that the forwarding fails and congestion is generated; at this time, the expanded multidimensional perception-based routing algorithm (MPOLSR) is directly invoked to select the next hop node.
Specifically, the method comprises the following steps:
as shown in fig. 6, the specific flow of the routing algorithm is as follows:
step a, calculating the link connection time T of k neighbors of a source node;
step b, calculating k comprehensive parameter values S, and arranging the k comprehensive parameter values S from large to small;
step c, judging whether the same parameter values exist or not; if yes, jumping to the step d; if not, jumping to the step g;
d, arranging the node connection time from large to small;
step e, judging whether the same node connection time exists or not; if yes, jumping to the step f; if not, jumping to the step g;
f, arranging the occupancy rates of the link layers from low to high;
step g, obtaining a sequence S (x);
h, setting all 2-hop neighbor sets of x as Q (x), the MPR set of x as M (x), and the initial set as a null set;
step i, selecting a 1 st neighbor Ni from S (x);
j, judging whether Ni contains some nodes of Q (x); if yes, jumping to the step k; if not, jumping to the step l;
step k, adding Ni into M (x), deleting the node contained in M (x) from Q (x), and deleting Ni from S (x);
step l, judging whether S (x) or Q (x) is empty; if the value is empty, jumping to the step m; if not, jumping to the step i;
and m (x) is the MPR node set.
Wherein:
the connection link time T is defined as:
Figure GDA0002572259860000101
in the formula: m ═ Vi×sin θi-Vj×sin θj,n=Xi-Xj,o=Vi×sin θi-Vj×sin θj,p=Yi-Yj,Vi,VjRepresenting the average moving speed of the node, thetai,θjIs the moving direction of the node, (X)i,Yi) And (X)j,Yj) Respectively, are the nodes i of the network,jthe coordinates of (a);
the combined parameter values S (x) are defined as:
Si=α×Tij+β×ηi
in the formula: alpha and beta are weighting parameters, and alpha + beta is 1;
Tijis the connection time of nodes i and j, ηiThe link layer congestion degree for node i is defined as:
ηi=Bp(i)/Bc(i)
in the formula: b isp(i) For the number of packets currently cached in the node i link layer interface queue, Bc(i) Caching capacity in a link layer interface queue of a node i;
and when the message forwarding still cannot be carried out by using the expanded MPOLSR routing algorithm, the data packet is selected to be discarded.
The invention uses a content-driven routing algorithm in which the priority of information is dynamically changed according to the specific combat mission and combat phase when routing. For example, in a reconnaissance detection stage, multiple means and multiple modes of comprehensive utilization of multiple sensor devices are mainly performed, so that enemy target information is acquired with the maximum probability. Therefore, the radar detection information of the close range enemy is collected at this stage with higher priority than the fire cooperative information. In the attack stage, the target is attacked mainly by adopting a formation multi-machine fire cooperative mode, so that the damage probability of the target is improved, and the damage probability of the machine is reduced.
At this stage, unlike the reconnaissance detection stage, the fire cooperative information has a higher priority than the radar detection information. The content-driven routing selection algorithm is applied to the SDIC-ATN network system, and the requirement-based interaction of difference business information in each stage in aviation battles can be met, so that the communication requirements of aviation cluster platforms with dynamic and diverse task requirements are met, and the air battle efficiency is improved.
Before calling the content driving algorithm, the invention calculates the adjacency matrix G according to the priority of the information content and uses the adjacency matrix G in the content driving algorithm. The calculation process will be described in detail in the latter half of this section. In the content-driven algorithm, initialization is performed first, and the distances from the source node to the remaining nodes are stored in dist. Then, searching the node with the minimum distance of each node according to the adjacency matrix G, marking the used value as 1, performing relay through the node, updating the distance from the source node to other nodes, namely updating dist, and filling the value of pre after updating each time. And (5) the optimal paths of all the nodes can be found by circulating the contents for n-1 times.
The specific process is as follows:
STEP 1: inputting an adjacency matrix G, a source node airplane number, a destination node airplane number and a node airplane number n;
STEP 2: setting a variable i as n, storing the shortest distance from a source node to the node by a vector dist, storing a vector pre to the last node of the node, storing a path in a reverse order by a vector out, and expressing a set of nodes with found optimal paths by a vector used;
STEP 3: initializing dist ═ infinity, pre ═ s-1, used ═ 0;
STEP 4:for i
STEP 5:if i≥1
STEP 6: selecting adjacent nodes of a source node, and updating the node distance which can be reached by the node through an edge;
STEP 7: updating the information of the node at the upper level;
STEP 8: updating the shortest path information of the nodes which are not accessed and can be reached by the node;
STEP 9:i=i-1;
STEP 10:end if
STEP 11:end for
STEP 12: outputting an optimal path out;
the adjacency matrix in the algorithm is defined as:
Figure GDA0002572259860000111
wherein, gijRepresenting the distance of nodes i to j. When there is a connection between i and j, gijRS, when there is no connection between i and j, gijWhen i is j, gij0. RS is defined as follows:
when the data packet is judged to be the high-priority data packet, the calculation formula is as follows:
Figure GDA0002572259860000121
wherein, alpha and beta are weighting parameters, and alpha + beta is 1; a, B, and C are weighting parameters, and when a ≠ 0 and B ≠ 0, a + B + C is 1. The specific numerical value is set according to the requirements of detailed battle scenes.
When the data packet is judged to be the data packet with other priority, the calculation formula is as follows:
Figure GDA0002572259860000122
wherein, P and Q are weighting parameters, and satisfy that P + Q is 1. The specific numerical value is set according to the requirements of detailed battle scenes. In the RS:
(1) k: representing the number of all possible paths from the source drone to the destination drone
(2) x: representing the number of packets with higher priority than itself. When the data packet is determined as a high-priority data packet, in order to avoid the congestion and transmit the data packet as soon as possible, a channel with a smaller number of data packets than the self-priority data packet is selected as much as possible to improve the transmission speed.
(3) y: representing a packet length with a higher priority than itself. When the data packet is determined as a high-priority data packet, in order to avoid the congestion and transmit the data packet as soon as possible, a channel with a shorter length than the data packet with a higher priority is selected as much as possible to improve the transmission speed.
(4) SINR: represents the signal-to-noise ratio, and
Figure GDA0002572259860000123
wherein P isiIs the transmission power of the source node, hijIs the cooperative efficiency of the remote independent fading receiving node, sigma is the receiving node noise variance, ImjIs the interference from nodes m to j, i.e. the signal power received from other nodes. To ensure the transmission quality of the data packets, the signal-to-noise ratio should be as large as possible. Herein, SINR is assumedmax=15dB。
(5)τij: representative biographyDelay in transmission, and
Figure GDA0002572259860000124
where l is the length of the packet, TrIs the transmission rate. To ensure the transmission quality of the data packets, the transmission delay should be kept as small as possible.
(6)∑qjk: representing a one-hop neighbor broadcast interference value. Where j is a one-hop node and k is a neighbor node of the one-hop node.
In extreme cases, a node and other nodes of the network are adjacent nodes, and at this time, the node needs to find the minimum distance value of n nodes, perform dist update n times, and perform n-1 times of circulation. The temporal complexity of the algorithm is therefore O (n)2). Since this algorithm is simple, the spatial complexity does not change with the size of n, and can be represented as O (1). Through analysis, the algorithm has low time and space complexity and is easy to realize in practical application.
The above is only a preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes will occur to those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (9)

1. A software-defined airborne network system is characterized by fusing three networks of an SDN network, an ICN network and an airborne network, and comprises the following components: the system comprises a data plane, a control plane, an application plane and a management plane, wherein the data plane is connected with the control plane through a southbound interface, the control plane is connected with the application plane through a northbound interface, and the management plane is respectively connected with the application plane, the control plane and the data plane through a management interface; wherein:
the data plane comprises a plurality of network devices, and is used for transmitting data packets in the plane according to configuration content issued by the control plane, collecting network state information in the plane and sending the network state information to the control plane; in the data plane, adopting the data transmission mode of ICN; the network equipment D needs certain information content, the network confirms the request of the network equipment D for the information content by sending an interest packet, so as to find the network equipment E meeting the corresponding requirement, and the network equipment E sends a data packet containing the information content needed by the network equipment D to the network equipment D, so that information interaction is completed;
the control plane includes a controller for processing and scheduling traffic of the data plane and opening multiple levels of programmability to the application plane;
the application plane comprises a plurality of network application modules for implementing user-defined high-level network control logic;
the management plane is used for managing the application plane, the control plane and the data plane.
2. The software-defined on-board network system of claim 1, wherein the control plane processes and schedules traffic for the data plane by centrally managing, forwarding decisions for network devices of the data plane;
the control plane opens multiple levels of programmability to the application plane, allowing network users to flexibly formulate various network policies based on specific application scenarios.
3. The software-defined on-board network system of claim 1, wherein in the application plane, implementation of a content-driven routing method requires invocation of a mapping module in the controller that performs mapping of information content to addresses;
the information content is transmitted to the controller through the southbound interface, the controller processes a data packet containing the information content through the mapping module, the information content is converted into an address, the data packet containing the address is issued to corresponding network equipment through the southbound interface, and the network equipment makes routing decision and forwards according to the address information.
4. A content-driven routing method based on the software-defined on-board network system according to any one of claims 1 to 3, comprising:
calculating all paths from a source node to a destination node;
whether relevant forwarding information exists in a forwarding information base of the source node or not is judged;
if not, the source node sends an interest message to the controller;
whether the local routing information base of the controller has relevant routing information or not;
if not, a routing protocol driven by the content is called to calculate routing information and is issued to all relevant nodes;
the source node selects the optimal path in all paths to forward the interest message according to the routing information;
and the destination node returns the data message in the original path after receiving the interest message.
5. The content-driven routing method according to claim 4, wherein if there is relevant forwarding information in the forwarding information base of the source node, the source node selects the optimal path among all paths for interest message forwarding according to the routing information;
and if the local routing information base of the controller has related routing information, the source node selects the optimal path in all paths to forward the interest message according to the routing information.
6. The content-driven routing method of claim 4, further comprising:
when the route forwarding mechanism is abnormal, the data packet cannot find the next target node, so that the forwarding fails and congestion is generated, and the expanded routing selection algorithm based on the multidimensional perception is directly called to select the next hop node.
7. The content-driven routing method of claim 6, wherein the routing algorithm comprises:
calculating the link connection time T of k neighbors of the source node;
calculating k comprehensive parameter values S, and arranging the k comprehensive parameter values S from large to small;
judging whether the same parameter value exists or not;
if yes, arranging the node connection time from large to small;
judging whether the same node connection time exists or not;
if yes, arranging the occupancy rates of the link layers from low to high;
obtaining a sequence s (x), wherein x represents a node, x ═ 1,2,3, ·, k;
setting all 2-hop neighbor sets of x as Q (x), MPR sets of x as M (x), and setting as an empty set initially;
selecting a 1 st neighbor Ni from S (x);
judging whether Ni has some nodes including Q (x);
if so, adding Ni to M (x), deleting the node contained in M (x) from Q (x), and deleting Ni from S (x);
determining whether S (x) or Q (x) is empty;
if yes, the obtained M (x) is the MPR node set.
8. The content-driven routing method according to claim 7, wherein if there are no identical parameter values, a sequence S (x) is obtained;
if the same node connection time does not exist, acquiring a sequence S (x);
if Ni does not contain some nodes of Q (x), judging whether S (x) or Q (x) is empty;
if S (x) or Q (x) is not empty, then select neighbor Ni from S (x).
9. The content-driven routing method of claim 7, wherein the connection link time T is defined as:
Figure FDA0002572259850000031
in the formula: m ═ Vi×sinθi-Vj×sinθj,n=Xi-Xj,o=Vi×sinθi-Vj×sinθj,p=Yi-Yj,Vi,VjRepresenting the average moving speed of the node, thetai,θjIs the moving direction of the node, (X)i,Yi) And (X)j,Yj) Respectively are coordinates of the nodes i and j, and r is the distance between the nodes i and j;
the combined parameter values S (x) are defined as:
Si=α×Tij+β×ηi
in the formula: alpha and beta are weighting parameters, and alpha + beta is 1;
Tijthe link time for nodes i and j;
ηithe link layer congestion degree for node i is defined as:
ηi=Bp(i)/Bc(i)
in the formula: b isp(i) For the number of packets currently cached in the node i link layer interface queue, Bc(i) Caching capacity in a link layer interface queue of a node i;
and when the message forwarding still cannot be carried out by using the expanded MPOLSR routing algorithm, the data packet is selected to be discarded.
CN201910058417.6A 2019-01-22 2019-01-22 Software-defined airborne network system and content-driven routing method Active CN109547345B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910058417.6A CN109547345B (en) 2019-01-22 2019-01-22 Software-defined airborne network system and content-driven routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910058417.6A CN109547345B (en) 2019-01-22 2019-01-22 Software-defined airborne network system and content-driven routing method

Publications (2)

Publication Number Publication Date
CN109547345A CN109547345A (en) 2019-03-29
CN109547345B true CN109547345B (en) 2020-11-03

Family

ID=65838271

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910058417.6A Active CN109547345B (en) 2019-01-22 2019-01-22 Software-defined airborne network system and content-driven routing method

Country Status (1)

Country Link
CN (1) CN109547345B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110995601B (en) * 2019-12-19 2021-11-26 北京工业大学 Software-defined space-based backbone network topology construction method
CN113258981A (en) * 2021-03-31 2021-08-13 航天东方红卫星有限公司 Three-dimensional grid type network architecture applied to cross-domain high-speed communication

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105871717A (en) * 2016-05-30 2016-08-17 杭州电子科技大学 Unmanned aerial vehicle ad hoc network routing method based on link stability
CN106789658A (en) * 2016-12-29 2017-05-31 南京邮电大学 Satellite MPLS network flow equalization method based on SDN controllers
CN107786654A (en) * 2017-10-24 2018-03-09 北京邮电大学 A kind of control message discontinuous communication means, apparatus and system
CN109039758A (en) * 2018-08-22 2018-12-18 吕娜 Software-oriented defines the controller failure restoration methods of aviation cluster onboard networks

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103581341B (en) * 2013-11-25 2016-08-31 中国科学院计算机网络信息中心 A kind of distributed mobility data transmission method of CCN
CN115103330A (en) * 2016-12-30 2022-09-23 英特尔公司 Method and apparatus for radio communication
CN108289062B (en) * 2017-12-21 2020-07-28 北京邮电大学 Information center network system based on software definition
CN108337166B (en) * 2018-02-06 2020-11-03 吕娜 Low-delay high-reliability routing method for aviation cluster network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105871717A (en) * 2016-05-30 2016-08-17 杭州电子科技大学 Unmanned aerial vehicle ad hoc network routing method based on link stability
CN106789658A (en) * 2016-12-29 2017-05-31 南京邮电大学 Satellite MPLS network flow equalization method based on SDN controllers
CN107786654A (en) * 2017-10-24 2018-03-09 北京邮电大学 A kind of control message discontinuous communication means, apparatus and system
CN109039758A (en) * 2018-08-22 2018-12-18 吕娜 Software-oriented defines the controller failure restoration methods of aviation cluster onboard networks

Also Published As

Publication number Publication date
CN109547345A (en) 2019-03-29

Similar Documents

Publication Publication Date Title
Xiong et al. An SDN-MQTT based communication system for battlefield UAV swarms
CN110647391B (en) Edge computing method and system for satellite-ground cooperative network
Garg et al. MobQoS: Mobility-aware and QoS-driven SDN framework for autonomous vehicles
CN101473607B (en) Method and system for rule-based sequencing for QoS
CN101449532B (en) Method and system for functional redundancy based quality of service
CN108322925B (en) Transmission path calculation method for distinguishing service types in ultra-density heterogeneous convergence network
CN108777633B (en) Intention pattern type industrial SDN northbound interface system supporting data scheduling and interaction method
CN101473236B (en) For the method and system of the QoS based on inbound content
Zacarias et al. Combining software-defined and delay-tolerant approaches in last-mile tactical edge networking
CN105491584B (en) Mobile application private network
Zeb et al. A proposed IoT-enabled smart waste bin management system and efficient route selection
CN109151077B (en) Calculation unloading method based on target guidance
CN102244614B (en) Message forwarding method, system and routing switch
CN101686203A (en) Method of managing a network having a plurality of nodes
CN109547345B (en) Software-defined airborne network system and content-driven routing method
CN110928694B (en) Computer system
CN115421901A (en) Priority perception task scheduling method and system for computational power network
Toorchi et al. Skeleton-based swarm routing (SSR): Intelligent smooth routing for dynamic UAV networks
Gnawali et al. Data centric, position-based routing in space networks
CN108900579A (en) Communication system and communication means, device and equipment, medium
Lee et al. Optimal flow rate control for SDN-based naval systems
CN115361048B (en) Giant low-orbit constellation serverless edge computing task arrangement method and device
Strayer et al. Mission-centric content sharing across heterogeneous networks
CN111901153B (en) Tactical edge-oriented decentralized computing architecture
CN112260747B (en) Airborne cooperative control and relay transmission system

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