Unmanned aerial vehicle network frequency spectrum information multicast method based on relay blocking network

Abstract

The invention discloses an unmanned aerial vehicle network frequency spectrum information multicast method based on a relay blocking network, which comprises the following steps: a source node broadcasts an RTS message to the whole network, and specifies specific parameters of an established multicast route; the destination node broadcasts the CTS message according to the indication sequence of the RTS message and a specific rule; after the network completes relaying of all control messages, the nodes select own roles through calculation according to the received control messages, and a specific multicast controlled interception area in the relay blocking network is formed; and the nodes forward data according to the roles of the nodes to realize multicast transmission. According to the method, the problem of low efficiency of the relay blocking network in a multicast scene is effectively solved by establishing the MCBR, and compared with the traditional unicast routing of the relay blocking network, the sending times of the control message are remarkably reduced through the MCBR, so that the network overhead is reduced, and the network efficiency is improved.

Description

Technical Field

[0001] The present invention belongs to the technical field of unmanned aerial vehicle self-organizing networks, and in particular relates to a method for multicasting spectrum information of unmanned aerial vehicle networks based on a relay network. Background Art

[0002] In complex battlefield environments, UAV networks face challenges such as unstable links and dynamic changes in network topology. Real-time and efficient multicast of spectrum information is essential for effective tactical response and spectrum utilization.

[0003] Relay networks have been proposed as a new type of network architecture. They achieve fast and reliable broadcast and unicast communications through autonomous cooperative communication and time division multiple access coordination between nodes. However, relay networks still have the following limitations: they focus mainly on broadcast and unicast, lack an effective multicast routing mechanism, and cannot meet the needs of spectrum information multicast in UAV networks; direct full-network broadcasting causes unnecessary nodes to participate in communication; existing perfect unicast requires the establishment of controlled interception areas for each source-destination pair, resulting in large control message overhead; traditional multicast routing protocols based on multicast trees are not suitable for UAV networks using cooperative communication. Therefore, it is of great theoretical significance and application value to develop a relay network routing method that can effectively support spectrum information multicast in UAV networks. Summary of the invention

[0004] The technical problem to be solved by the present invention is to provide a method for multicasting spectrum information of a UAV network based on a relay network in view of the deficiencies of the above-mentioned prior art, so as to effectively improve the multicast efficiency and real-time performance of the spectrum information.

[0005] In order to achieve the above technical objectives, the technical solution adopted by the present invention is:

[0006] A method for multicasting spectrum information in a drone network based on a relay network, wherein the drone network N = {n1, n2, ..., n K There are K nodes, including the following steps:

[0007] S1, the source node s broadcasts an RTS message to the entire network. The RTS message specifies the network size, i.e., the ultra-wideband e, the source node, the current number of hops from the source node, and the set of multiple target nodes D = {d1, d2, ..., d L} and the order in which these destination nodes should broadcast their CTS messages,

[0008] S2, each node monitors whether it has received a control message. When a control message is received, the node decodes the message.

[0009] S3, node n i Determine whether the type of the message m is RTS,

[0010] S4, if the type of m is RTS message, the node will extract the network scale parameter e, the set of all destination nodes D, and the number of hops from the source. information.

[0011] S5, when the node is also a destination node d l The minimum number of hops from the destination node to the source node is saved

[0012] S6: The node increases the current hop count from the source node in the original RTS message by 1, generates a new RTS message, participates in the cooperative broadcast in the next time slot, and forwards the new RTS message in coordination with other cooperative nodes. Then, the node waits to receive a new control message.

[0013] S7, if the type of m is not an RTS message but a CTS message, the node will extract the destination node d from which the message was created. q ,d q Minimum hop distance to source node s The distance between the current node and the destination node is d q Number of hops use Indicates that m comes from the destination node d q ,

[0014] S8, determine whether there are CTS messages to be broadcast. The judgment basis is whether the node has received the last CTS in the sequence of the last destination node, or has not received a message for a long time.

[0015] S9: If there is still CTS that has not been broadcasted, determine whether the node is a destination node.

[0016] S10, if the node is the destination node d l ,use Indicates the destination node d l Distance to destination node d q The number of hops to determine the destination node d l Whether it has not created a CTS message from itself and received a CTS message from the destination node d l-1 If the condition is not met, the node then waits to receive a new control message.

[0017] S11, if the above conditions are met, determine the source node s to d l The minimum number of hops + d l to d q The minimum number of hops ≤ super width + source node s to d q The minimum number of hops, that is Is it established?

[0018] S12, if the inequality holds, then the destination node d l In MCBR, there is no need to create a CTS message from itself, and then the node waits to receive a new control message.

[0019] S13, if the formula does not hold, then the destination node d l Create a CTS message from itself and broadcast it to the entire network in the subsequent non-conflicting time slot, and then the node waits to receive new control messages.

[0020] S14, if the node is not a destination node, the current hop count from the destination node in the original CTS message is increased by 1, and a new CTS message is generated. The node participates in the cooperative broadcast in the next time slot and cooperates with other cooperative nodes to forward the new CTS message. Then the node waits to receive a new control message.

[0021] S15, if there is no CTS to be broadcast, the node will calculate and determine its own identity based on the information obtained from the control message to form an MCBR.

[0022] To optimize the above technical solutions, the specific measures taken also include:

[0023] In S15, the specific method for the node to calculate and determine its own identity based on the information obtained from the control message is: if for this node n i For example, there is a destination node d l , so that n i The number of hops from the source node + its distance d l The number of hops ≤ d l The minimum number of hops to the source node + e, that is Then the identity of the node is a forwarding node; if it satisfies Then the node is a buffer node; in other cases, the node is an inactive node.

[0024] MCBR means: Multicast Controlled Barrage Region;

[0025] RTS means: Request to Send;

[0026] The meaning of CTS is: Clear to Send.

[0027] TDMA means: Time Division Multiple Access

[0028] The beneficial effects of the present invention are:

[0029] The present invention effectively solves the problem of low efficiency of relay networks in multicast scenarios by establishing MCBR. Compared with traditional relay network unicast routing, the present invention significantly reduces the number of control message transmissions through MCBR, thereby reducing network overhead and improving network efficiency. MCBR allows nodes to be reused in multicast streams, improves node utilization, thereby improving multicast throughput, and can meet the real-time requirements of the drone network for spectrum information multicast. At the same time, MCBR can quickly transmit spectrum information to all destination nodes, improve the update speed and real-time performance of spectrum information, thereby improving the responsiveness of the drone network to the battlefield environment and enhancing battlefield situation awareness and collaborative combat capabilities. BRIEF DESCRIPTION OF THE DRAWINGS

[0030] Figure 1 A flow chart of establishing multicast routing based on a relay network provided in an embodiment of the present invention.

[0031] Figure 2 This is a diagram of the RTS message format provided by an embodiment of the present invention.

[0032] Figure 3 This is a CTS message format diagram provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0033] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is described and illustrated below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. Based on the embodiments provided in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present application.

[0034] Obviously, the drawings described below are only some examples or embodiments of the present application. For ordinary technicians in this field, the present application can also be applied to other similar scenarios based on these drawings without creative work. In addition, it can also be understood that although the efforts made in this development process may be complicated and lengthy, for ordinary technicians in this field related to the content disclosed in this application, some changes in design, manufacturing or production based on the technical content disclosed in this application are just conventional technical means, and should not be understood as insufficient content disclosed in this application.

[0035] Reference to "embodiments" in this application means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those of ordinary skill in the art that the embodiments described in this application may be combined with other embodiments without conflict.

[0036] Unless otherwise defined, the technical terms or scientific terms involved in this application should be understood by people with ordinary skills in the technical field to which this application belongs. The words "one", "a", "a", "the" and the like involved in this application do not indicate a quantitative limitation, and may represent the singular or plural. The terms "include", "comprise", "have" and any of their variations involved in this application are intended to cover non-exclusive inclusions; for example, a process, method, system, product or device that includes a series of steps or units (units) is not limited to the listed steps or units, but may also include steps or units that are not listed, or may also include other steps or units inherent to these processes, methods, products or devices. The words "connect", "connected", "coupled" and the like involved in this application are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The "multiple" / "several" involved in this application refers to two or more. "And / or" describes the association relationship of associated objects, indicating that there can be three relationships, for example, "A and / or B" can mean: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the objects before and after are in an "or" relationship. The terms "first", "second", "third", etc. involved in this application are only used to distinguish similar objects and do not represent a specific ordering of the objects.

[0037] In battlefield environments, multi-hop UAV networks face the problem of poor link stability, and ensuring that the spectrum is propagated to the intended destination in real time and efficiently is crucial to spectrum utilization. The relay network uses autonomous and collaborative relays between nodes to achieve fast and reliable broadcasting through a special design for tactical edge communications. However, it mainly focuses on broadcast and unicast, and applying it to multicast scenarios will result in low node multiplexing efficiency. The goal of the present invention is to select a reasonable RTS / CTS broadcast scheme to reduce control message overhead, and at the same time reasonably determine the identity of the node to form a multicast controlled barrage region (MCBR) to improve throughput.

[0038] The present invention proposes a UAV network spectrum information multicast scheme based on a relay network, which operates by establishing MCBR in the UAV network. It limits the relay nodes to a certain area by specifying node identities, including buffer nodes that do not forward messages, relay nodes that forward messages, and other non-participating nodes, to ensure that data packets are relayed from source nodes to all intended destination nodes. In order to establish a suitable MCBR, it is necessary to reasonably broadcast RTS / CTS control messages and node self-identification. UAV network N = {n1, n2, ..., n K There are K nodes, and TDMA technology is used to achieve orderly allocation of channel resources and synchronous communication between nodes.

[0039] like Figure 1 As shown, the UAV network spectrum information multicast solution based on the relay network of the present invention includes the following steps:

[0040] S1, the source node s starts the process by broadcasting an RTS message to the entire network. The RTS specifies the network size, i.e., the ultra-wide e, the source node, the current number of hops from the source node, and the set of multiple target nodes D = {d1, d2, ..., d L} and the order in which these destination nodes should broadcast their CTS messages.

[0041] S2, each node monitors whether it has received a control message. When receiving a control message, the node decodes the message.

[0042] S3, node n i Determine whether the type of the message m is RTS.

[0043] S4, if the type of m is RTS message, the node will extract the network scale parameter e, the set of all destination nodes D, and the number of hops from the source. And other information.

[0044] S5, when the node is also a destination node d l The minimum number of hops from the destination node to the source node is saved

[0045] S6, the node increases the current hop count from the source node in the original RTS message by 1, and generates a new RTS message. The node participates in the cooperative broadcast in the next time slot, and forwards the new RTS message in cooperation with other cooperative nodes. Then the node waits to receive a new control message.

[0046] S7, if the type of m is not an RTS message but a CTS message, the node will extract the destination node d from which the message was created. q ,d q Minimum hop distance to source node s The distance d between the current node and the destination nodeq Hop Count And other information. Indicates that m comes from the destination node d q .

[0047] S8, judging whether there are CTS messages to be broadcasted. The judging basis is whether the node has received the last CTS in the sequence of the last destination node, or has not received any message for a long time.

[0048] S9: If there is still CTS that has not been broadcasted, determine whether the node is a destination node.

[0049] S10, if the node is the destination node d l ,use Indicates the destination node d l Distance to destination node d q Determine the destination node d l Whether it has not created a CTS message from itself and received a CTS message from the destination node d l-1 If the condition is not met, the node then waits to receive a new control message.

[0050] S11, if the above conditions are met, determine the source node s to d l The minimum number of hops + d l to d q The minimum number of hops ≤ super width + source node s to d q The minimum number of hops, that is Is it true?

[0051] S12, if the inequality holds, then the destination node d l In MCBR, there is no need to create a CTS message from itself. The node then waits to receive a new control message.

[0052] S13, if the formula does not hold, then the destination node d l Create a CTS message from itself and broadcast it to the entire network in the subsequent non-conflicting time slot. Then the node waits to receive new control messages.

[0053] S14, if the node is not a destination node, the current hop count from the destination node in the original CTS message is incremented by 1, and a new CTS message is generated. The node participates in the cooperative broadcast in the next time slot and forwards the new CTS message in cooperation with other cooperative nodes. The node then waits to receive a new control message.

[0054] S15, if there is no CTS to be broadcasted, the node will calculate and determine its own identity based on the information obtained from the control message to form MCBR. iFor example, there is a destination node d l , so that n i The number of hops from the source node + its distance d l The number of hops ≤ d l The minimum number of hops to the source node + e, that is Then the identity of the node is a forwarding node; if it satisfies Then the node is a buffer node; in other cases, the node is an inactive node.

[0055] like Figure 2 The RTS message format shown includes a message type, an extra width, an ID of a source node, a current number of hops from the source, and IDs of multiple destination nodes.

[0056] like Figure 3 The CTS message format shown includes the message type, the minimum number of hops from the destination node to the source, the ID of the destination node, and the current number of hops from the destination node.

[0057] It can be understood that the above specific description of the present invention is only used to illustrate the present invention and is not limited to the technical solution described in the implementation of the calculation method of the present invention. Ordinary technicians in the field should understand that the present invention can still be modified or replaced by equivalents to achieve the same technical effect; as long as the requirements of the calculation method are met, they are all within the protection scope of the present invention.

Claims

1. A method for multicasting spectrum information in a drone network based on a relay network, where the drone network N = {n1, n2, …, n K There are K nodes, whose characteristics are: The following steps are involved: S1, the source node s broadcasts an RTS message to the entire network. The RTS message specifies the network size, i.e., the ultra-wideband e, the source node, the current number of hops from the source node, and the set of multiple target nodes D = {d1, d2, ..., d L } and the order in which these destination nodes should broadcast their CTS messages, S2, each node monitors whether it has received a control message. When a control message is received, the node decodes the message. S3, node n i Determine whether the type of the message m is RTS, S4, if the type of m is RTS message, the node will extract the network scale parameter e, the set of all destination nodes D, and the number of hops from the source. information, S5, when the node is also a destination node d l The minimum number of hops from the destination node to the source node is saved S6: The node increases the current hop count from the source node in the original RTS message by 1, generates a new RTS message, participates in the cooperative broadcast in the next time slot, and forwards the new RTS message in coordination with other cooperative nodes. Then, the node waits to receive a new control message. S7, if the type of m is not an RTS message but a CTS message, the node will extract the destination node d from which the message was created. q d q Minimum hop distance to source node s The distance between the current node and the destination node is d q Number of hops use Indicates that m comes from the destination node d q , S8, determine whether there are CTS messages to be broadcast. The judgment basis is whether the node has received the last CTS in the sequence of the last destination node, or has not received a message for a long time. S9: If there is still CTS that has not been broadcasted, determine whether the node is a destination node. S10, if the node is the destination node d l ,use Indicates the destination node d l Distance to destination node d q The number of hops to determine the destination node d l Whether it has not created a CTS message from itself and received a CTS message from the destination node d l-1 If the condition is not met, the node then waits to receive a new control message. S11, if the above conditions are met, determine the source node s to d l The minimum number of hops + d l to d q The minimum number of hops ≤ super width + source node s to d q The minimum number of hops, that is Is it established? S12, if the inequality holds, then the destination node d l In MCBR, there is no need to create a CTS message from itself, and then the node waits to receive a new control message. S13, if the formula does not hold, then the destination node d l Create a CTS message from itself and broadcast it to the entire network in the subsequent non-conflicting time slot, and then the node waits to receive new control messages. S14, if the node is not a destination node, the current hop count from the destination node in the original CTS message is increased by 1, and a new CTS message is generated. The node participates in the cooperative broadcast in the next time slot and cooperates with other cooperative nodes to forward the new CTS message. Then the node waits to receive a new control message. S15, if there is no CTS to be broadcast, the node will calculate and determine its own identity based on the information obtained from the control message to form an MCBR.

2. According to claim 1, a method for multicasting spectrum information of a drone network based on a relay network is characterized by: In S15, the specific method for the node to calculate and determine its own identity based on the information obtained from the control message is: if for this node n i For example, there is a destination node d l , so that n i The number of hops from the source node + its distance d l The number of hops ≤ d l The minimum number of hops to the source node + e, that is Then the identity of the node is a forwarding node; if it satisfies Then the node is a buffer node; in other cases, the node is an inactive node.

Images