Task adjustment and reconstruction method based on dynamic network constraint

Abstract

The invention discloses a task adjustment and reconstruction method based on dynamic network constraint, which belongs to the technical field of communication, and comprises the following steps: an alliance master node sends an alliance establishment proposal message to other nodes, and defines the maximum hop count Hmax and the current hop count # imgabs0 # of message transmission to propose other nodes to assist a CL to establish an alliance capable of completing a task; after the node Ak receives the alliance establishment proposal message, the current hop count # imgabs1 # of the message is checked, judgment is made according to the current hop count # imgabs2 # and resources owned by the node, and corresponding operation is executed; and the alliance main node executes corresponding operation after receiving information fed back by all potential alliance members. According to the task adjustment and reconstruction method based on the dynamic network constraint provided by the invention, the problems of reasonable planning and allocation of limited resources and broadcast storm in alliance establishment are effectively solved.

Description

Technical Field

[0001] The present invention relates to the field of communication technologies, and in particular, to a task adjustment and reconstruction method based on dynamic network constraints. Background Art

[0002] With the popularization of concepts such as "cluster" and "collaboration" and the continuous maturity of corresponding technologies, the unmanned aerial vehicle (UAV) cluster system driven by overall tasks has been applied to various complex scenarios. However, the large scale of aircraft in the cluster network leads to problems such as a huge amount of interaction information between aircraft, dynamic time-varying network, frequent link interruptions, degradation of network performance, and shortage of communication resources. In this case, how to reasonably plan and allocate limited resources under the condition of ensuring stable communication of the aircraft cluster network has become a difficult problem that urgently needs to be solved.

[0003] In the traditional alliance formation process, due to constraints such as communication distance and communication delay, the alliance master node cannot ensure that the alliance formation proposal message is broadcast to each "idle" node in a timely manner. Traditional broadcasting usually adopts the flooding method, that is, a node re-broadcasts the received broadcast message to all its neighbor nodes. Although this method is simple to implement, it will cause a large number of redundant data packets, and at the same time, it will cause these data packets to compete for network bandwidth and cause collisions, resulting in the broadcast storm problem. Summary of the Invention

[0004] The purpose of the present invention is to provide a task adjustment and reconstruction method based on dynamic network constraints to solve the problems existing in the background art.

[0005] To achieve the above purpose, the present invention provides a task adjustment and reconstruction method based on dynamic network constraints, including an alliance formation process based on the maximum number of hops, and the steps are as follows:

[0006] S1. Alliance formation proposal: The alliance master node (CL) sends an alliance formation proposal message to broadcast to other nodes, and defines the maximum number of hops H max and the current number of hops and proposes that other nodes assist CL in forming an alliance that can complete the task;

[0007] S2. Alliance formation bidding: Node A k after receiving the alliance formation proposal message, checks the current number of hops of the message and makes a judgment and performs corresponding operations according to the current number of hops and the resources owned by the node;

[0008] S3. Alliance formation: After the alliance master node (CL) receives the information fed back by all potential coalition members (PCM), it performs corresponding operations.

[0009] Preferably, S1 includes:

[0010] S11. The coalition leader node (CL) broadcasts the location and resource requirement vector of target T j to other nodes in the form of a coalition formation proposal message, proposing that other nodes assist it in forming a coalition capable of completing the task;

[0011] S12. Define the maximum number of hops for message transmission as H max , and the current number of hops of message transmission is

[0012] Preferably, when the message starts to be broadcast in S12, its current number of hops is initialized to the maximum number of hops.

[0013] Preferably, in S2, according to the information interaction mechanism of the maximum number of hops, each node performs operations, including:

[0014] S21. Before the aircraft node re-broadcasts the received message, it checks the current number of hops of the message

[0015] S22. If then forward the message to the neighbor node, and otherwise, the message will no longer be forwarded;

[0016] S23. If node A k has not consumed all the task resources it currently has and is in an idle state, then it becomes a potential coalition member (PCM);

[0017] S24. The potential coalition member A k feeds back its own resource information and the earliest arrival time to the coalition leader node A in the form of a coalition formation bid message through the communication network i , and participates in the coalition formation.

[0018] Preferably, in S22, the message will no longer be forwarded until the current number of hops is reduced to 0 or the message reaches the target node.

[0019] Preferably, S3 includes:

[0020] S31. After the coalition leader node (CL) receives the information feedback from all potential coalition members (PCMs), it makes a decision to determine the formation of the coalition and determines the nodes that can complete the published task;

[0021] S32. The coalition leader node (CL) sends the coalition formation result to all potential coalition members (PCMs) in the form of a message, and the nodes that form the coalition are called coalition members (CMs).

[0022] ​S33. If the coalition formation fails, send the information of the failed coalition formation to all potential coalition members (PCMs).

[0023] Preferably, the content of the message in S32 is: inform the bidders of the winning nodes and the non-winning nodes; for the non-winning nodes, continue to execute the tasks they were originally performing.

[0024] Preferably, when the situation in S33 occurs, the coalition master node A i will rebroadcast the proposal message after a period of time DT and form a coalition again.

[0025] Therefore, the present invention adopts the above-mentioned method for task adjustment and reconstruction based on dynamic network constraints. In view of the "multi-hop" characteristic of information transmission in the cluster network, and taking the two most important indicators of communication distance and communication delay as communication constraint conditions into consideration, an information interaction mechanism based on the maximum number of hops is designed. Under this mechanism, the coalition master node can broadcast a coalition formation proposal message, thereby determining the potential coalition member nodes, preparing for the master node to select coalition members from the set of potential coalition member nodes to form a coalition.

[0026] Next, through the drawings and embodiments, the technical solution of the present invention will be further described in detail. Description of the Drawings

[0027] Figure 1 It is a schematic diagram of the coalition formation process of the embodiment of the present invention;

[0028] Figure 2 It is a schematic diagram of the principle of the information interaction mechanism based on the maximum number of hops of the embodiment of the present invention. Detailed Embodiments

[0029] The following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the scope of protection of the present invention.

[0030] A method for task adjustment and reconstruction based on dynamic network constraints discloses a coalition formation process based on the maximum number of hops, as Figure 1 shown, including:

[0031] S1. Coalition formation proposal: The coalition master node (CL) sends a coalition formation proposal message to broadcast to other nodes, and defines the maximum number of hops H max of message transmission and the current number of hops and proposes that other nodes assist it in forming a coalition that can complete the task.

[0032] In S1, it includes:

[0033] S11. The coalition leader node (CL) broadcasts the location and resource requirement vector of target T j to other nodes in the form of a coalition formation proposal message, proposing that other nodes assist it in forming a coalition that can complete the task.

[0034] The coalition leader node (CL) first clarifies the key information such as the specific target location of the task, the types and quantities of required resources. It encapsulates this key information and some of its own basic information (such as node ID, location, etc.) into a coalition formation proposal message. Through the communication network, the coalition leader node (CL) sends this proposal message to other nodes within its reach in a broadcast form.

[0035] S12. Define the maximum number of hops for message transmission as H max , and the current number of hops for message transmission is When the message starts to be broadcast, its current number of hops is initialized to the maximum number of hops, that is

[0036] When broadcasting the proposal message, the coalition leader node (CL) sets a maximum number of hops H for message transmission max to limit the propagation range of the message. At the same time, when the message starts to be broadcast, it initializes a current number of hops whose value is set to the maximum number of hops H max . The current number of hops is used to record the number of nodes the message has passed through to ensure that the message is no longer forwarded after reaching the maximum number of hops.

[0037] S2. Coalition formation bidding: After node A k receives the coalition formation proposal message, it checks the current number of hops of the message and makes a judgment and performs corresponding operations based on the current number of hops and the resources owned by the node.

[0038] In S2, the idea of "minimizing the number of forwarding nodes" is followed. To reduce the possibility of broadcast storms, according to the information interaction mechanism of the maximum number of hops, each node performs operations, such as Figure 2 shown in

[0039] S21. Before the aerial vehicle node re-broadcasts the received message, it checks the current number of hops of the message

[0040] When a node receives the coalition formation proposal message, it first checks the current number of hops of the message If the current number of hops is greater than 0, it means that the message still has remaining forwarding times, and the node can continue to process this message. ​

[0041] S22. If then forward the message to the neighbor nodes, and otherwise, the message will no longer be forwarded.

[0042] If the current hop count is greater than 0, the node will decide whether to forward the message according to its own status and resource situation. If the node decides to forward the message, it will decrement the current hop count by 1 and forward the message to its neighbor nodes.

[0043] In this way, the message will propagate hop by hop in the network until the current hop count is decremented to 0 or the message reaches the destination node.

[0044] S23. If node A k has not exhausted the task resources it currently has and is in the "idle" state, it will become a potential coalition member (PCM).

[0045] Before forwarding the message, the node will evaluate its own resource situation and task status. If the node has not exhausted the task resources it currently has and is in the "idle" state (i.e., has no task being executed), it will become a potential coalition member (PCM).

[0046] S24. Potential coalition member A k will feedback the resource information it owns and the earliest arrival time to the coalition leader node A in the form of a coalition formation bidding message through the communication network i , and participate in the coalition formation.

[0047] Potential coalition members (PCMs) will formulate a bidding plan based on information such as their own resource situation and the time to reach the target location. Then, the potential coalition members (PCMs) will feedback this bidding plan to the coalition leader node (CL) in the form of a coalition formation bidding message through the communication network.

[0048] The bidding message contains the resource information of the potential coalition member, the earliest arrival time, and other possibly relevant decision-making information.

[0049] S3. Coalition formation: After receiving the information feedback from all potential coalition members (PCMs), the coalition leader node (CL) will perform corresponding operations.

[0050] S3 includes:

[0051] S31. After receiving the information feedback from all potential coalition members (PCMs), the coalition leader node (CL) will make a decision, determine to form a coalition, and decide which nodes will complete the released tasks.

[0052] After receiving the bidding messages from all potential coalition members (PCMs), the coalition leader node (CL) will conduct a comprehensive evaluation based on factors such as task requirements, resource conditions, and bidding schemes. Based on the evaluation results, the coalition leader node (CL) will make a decision on whether to form a coalition and which nodes will form the coalition to complete the task.

[0053] S32. The coalition leader node (CL) sends the coalition formation result message to all potential coalition members (PCMs), that is, it tells the bidders which nodes are the winning bidders and which are the non-winning bidders (non-winning bidders will continue to execute the tasks they were previously performing). The nodes that form the coalition are called coalition members (CMs).

[0054] The coalition leader node (CL) will send the result of the coalition formation to all potential coalition members (PCMs) in the form of a message. The result message contains information about the winning bidders and non-winning bidders. The winning bidders will become coalition members (CMs), while the non-winning bidders will continue to execute the tasks they were previously performing. Coalition members (CMs) will receive specific task assignment information and execution requirements.

[0055] S33. If the coalition formation fails, the information about the failure of coalition formation will be sent to all potential coalition members (PCMs). When this happens, the coalition leader node A i will rebroadcast the proposal message after a period of DT and try to form a coalition again.

[0056] If the coalition formation fails due to certain reasons (such as insufficient resources, time constraints, etc.), the coalition leader node (CL) will send the failure information to all potential coalition members (PCMs). In this case, the coalition leader node (CL) will wait for a period of time (denoted as DT), and this period can be adjusted according to the actual situation.

[0057] After the waiting time ends, the coalition leader node (CL) will rebroadcast the coalition formation proposal message and try to form a coalition again.

[0058] Therefore, the present invention adopts the above-mentioned method for task adjustment and reconstruction based on dynamic network constraints. Considering the "multi-hop" characteristic of information transmission in the cluster network and taking the two most important indicators of communication distance and communication delay as communication constraint conditions, an information interaction mechanism based on the maximum number of hops is designed. Under this mechanism, the coalition leader node can determine potential coalition member nodes by broadcasting the coalition formation proposal message, preparing for the master node to select coalition members from the set of potential coalition member nodes to form a coalition.

[0059] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions of the present invention or make equivalent replacements, and these modifications or equivalent replacements do not enable the modified technical solutions to deviate from the spirit and scope of the technical solutions of the present invention.

Claims

1. A task adjustment and reconstruction method based on dynamic network constraints, characterized in that It includes a coalition formation process based on the maximum hop count, and the steps are as follows: S1. Alliance formation proposal: The main node CL of the alliance sends an alliance formation proposal message to broadcast to other nodes, and defines the maximum number of hops H for message transmission max and the current hop count proposes that other nodes assist CL in forming an alliance that can complete the task; S2. The alliance formation bids, Node A k After receiving the alliance formation proposal message, checks the current hop count of the message And based on the current hop count Makes a judgment according to the resources owned by the node and performs corresponding operations; S3. Coalition formation: After the coalition leader node CL receives the information fed back by all potential coalition members PCM, it performs corresponding operations.

2. The task adjustment and reconstruction method based on dynamic network constraints according to claim 1, wherein S1 includes: S11. The alliance master node CL broadcasts the position and resource requirement vector of target T j to other nodes in the form of an alliance formation proposal message, proposing that other nodes assist it in forming an alliance capable of completing the task; ​ S12. Define the maximum number of hops for message transmission as H max , and the current number of hops for message transmission is 3. The task adjustment and reconstruction method based on dynamic network constraints according to claim 2, characterized in that: When the message in S12 starts to be broadcast, the current hop count is initialized to the maximum hop count.

4. A task adjustment and reconstruction method based on dynamic network constraints according to claim 1, characterized in that: In S2, according to the information interaction mechanism of the maximum hop count, each node performs operations, including: Before the aircraft node re - broadcasts the received message, it checks the current hop count of the message S22. If then forward the message to the neighbor node, and otherwise, the message will no longer be forwarded; S23. If node A k has not exhausted the task resources it currently has and is in an idle state itself, it becomes a potential coalition member PCM; S24. Potential Alliance Member A k Feedback the resource information and the earliest arrival time it owns to the alliance master node A in the form of an alliance formation bidding message through the communication network i to participate in the alliance formation.

5. A task adjustment and reconstruction method based on dynamic network constraints according to claim 4, characterized in that: In S22, the message is no longer forwarded until the current hop count is reduced to 0 or the message reaches the target node.

6. A task adjustment and reconstruction method based on dynamic network constraints according to claim 1, characterized in that S3 It includes: S31. After the coalition leader node CL receives the information fed back by all potential coalition members PCM, it makes a decision to determine the formation of a coalition and determines the nodes that have completed the published tasks; S32. The coalition leader node CL sends the coalition formation result to all potential coalition members PCM in the form of a message, and the nodes that form the coalition are called coalition members CM; S33. If the coalition formation fails, the information of the failed coalition formation is sent to all potential coalition members PCM.

7. A task adjustment and reconstruction method based on dynamic network constraints according to claim 6, characterized in that The content of the message in S32 is: Notify the bidders, the winning nodes and the non-winning nodes; for the non-winning nodes, continue to execute the tasks they were originally performing.

8. A task adjustment and reconstruction method based on dynamic network constraints according to claim 7, characterized in that: When the situation of S33 occurs, the coalition master node A i will re-broadcast the proposal message after a certain time DT and form a coalition again.

Images