Directional ad hoc network node transmitting and receiving state distribution method based on service priority

Abstract

The invention discloses a directional ad hoc network node transmitting and receiving state distribution method based on service priority, which comprises the following steps that: in a time slot before service transmission is started, each node in a network queries the highest priority of a sending service in all beams in a next time slot in a service queue; then, the highest priority of services sent to the node by all neighbor nodes in the next time slot is obtained through a network node information table, and the transceiving state of the node is determined by the high-priority services; and finally, updating the service queue, and updating the service priority and the destination node number of the node in the next time slot to the network node information table. And for the same network node, at least one receiving time slot exists between the two sending services. The directional ad hoc network node transmitting and receiving state distribution method provided by the invention is simple in implementation mode and high in practicability, not only can meet communication requirements according to service priorities, but also can reduce information interaction and corresponding communication time delay required for adjusting the node transmitting and receiving states.

Description

Technical Field

[0001] The invention relates to the technical field of wireless self-organizing network communication, in particular to a method for allocating receiving and transmitting states of nodes in a directional self-organizing network. Background Art

[0002] The biggest feature of wireless self-organizing networks is that they are decentralized, that is, there is no central control node in the network, and each node has the same function in the network. If any node in the network fails, it will not have a significant impact on the entire communication network. Therefore, wireless self-organizing networks have strong robustness and anti-destruction capabilities.

[0003] Compared with the self-organizing network using omnidirectional antennas, directional antennas concentrate power on a narrow beam pointing in a specific direction, so that higher transmission and reception gain can be obtained in that direction. This can not only increase the communication rate in that direction, but also enhance the stealth capability and anti-interference ability of the communication node.

[0004] Applying multi-beam antennas to directional ad hoc networks can simultaneously form multiple beams to establish high-speed links with different nodes, realize space division multiplexing, and improve network capacity. However, since multiple beams share the same antenna, multiple beams of the same node must be in the same state at the same time, that is, the sending or receiving state. When there are multiple network nodes in a multi-beam directional ad hoc network, it is necessary to coordinate the sending and receiving states of all nodes in the network to avoid the deterioration of network capacity due to conflicts between sending and receiving states between nodes. In the existing research, most of the nodes in the network are divided into odd and even categories. The two types of nodes have opposite sending and receiving states at the same time, and can communicate with each other, but odd nodes or even nodes cannot communicate directly. This makes it difficult to meet the communication needs of different services in the network. Summary of the invention

[0005] In response to the above technical problems, the present invention provides a method for allocating the receiving and transmitting status of nodes in a directional self-organizing network based on service priority, so as to allocate the receiving and transmitting status of network nodes based on service priority, thereby meeting communication needs according to service priority and reducing the information interaction required for adjusting the receiving and transmitting status of nodes and the corresponding communication delay.

[0006] In order to achieve the above-mentioned purpose, the present invention adopts the following technical scheme:

[0007] The method for allocating the receiving and transmitting states of nodes in a directional self-organizing network based on service priority is characterized in that it is applied to a directional self-organizing network composed of N randomly arranged nodes, and each node is deployed with a multi-beam antenna to form multiple beams of each node, and a high-speed link is established with multiple beams of other nodes, and multiple beams of the same node are in the same state at the same time, that is, a sending state or a receiving state;

[0008] Let the duration of the current cycle be P, and divide the current cycle into a neighbor discovery period and a service transmission period, wherein the neighbor discovery period lasts for L time slots, the service transmission period lasts for M time slots, and P=L+M;

[0009] Each node has a service queue and a network node information table, wherein the service queue stores service data to be sent and the corresponding service priority and the number of the destination node; the network node information table contains the node number and location information of the node itself, the service priority and the number of the destination node of the service data to be sent in the service queue;

[0010] The method for allocating the receiving and sending status of nodes in a directional self-organizing network comprises the following steps:

[0011] Step 1: If the current cycle Time slots When the business data of the ith node arrives at the ith node, the corresponding business data is stored in the business queue of the ith node, and the Time slots The executed business data is deleted from the business queue of the i-th node, thereby updating the business queue of the i-th node. ;

[0012] Place the i-th node in Time slots The service priority and destination node number of the i-th node are updated to the network node information table;

[0013] Step 2: If If the time slot is the time slot before the start of the service transmission period of the current cycle or the last time slot of the transmission service, then execute step 3; otherwise, keep the i-th node in the k+1-th time slot The sending and receiving status of the kth time slot Same as above, and execute step 4;

[0014] Step 3: Based on the service priority in the network node information table of the ith node, the ith node in the k+1th time slot The sending and receiving status is assigned:

[0015] Step 3.1: The i-th node queries the k+1-th time slot in the service queue The highest service priority among all service data to be sent in all beams under ;

[0016] Step 3.2: The i-th node obtains all neighbor nodes in the k+1th time slot through its own network node information table The service priority sent to the i-th node, and the highest service priority is selected from them ;

[0017] Step 3.3: If , then it means that the i-th node is in the k+1th time slot is in receiving state and remains in receiving state until the service priority is Until the business data transmission is completed;

[0018] like And the i-th node is in the k-th time slot In the receiving state, let the i-th node be in the k+1th time slot The state is sent and remains sent until the service priority is Until the business data transmission is completed;

[0019] like And the i-th node is in the k-th time slot In the sending state, let the i-th node be in the k+1th time slot is in receiving state and remains in receiving state until the service priority is Until the business data transmission is completed;

[0020] like , then according to the parity characteristics of the number of the i-th node and The rule of the parity characteristic of the sequence number determines the i-th node in the next time slot The receiving and sending status of the next time slot If the service priority is The business data transmission ends; if the next time slot is in receiving state, it will remain in receiving state until the service priority is Until the business data transmission is completed;

[0021] Step 4: According to the i-th node in the k+1th time slot The assigned sending and receiving state completes the i-th node in the k+1th time slot After data is received or sent, k+1 is assigned to k, and the process returns to step 1 and executes sequentially until the termination time is reached.

[0022] The method for allocating the receiving and transmitting states of nodes in a directional self-organizing network of the present invention is also characterized in that the rules for the odd-even characteristics of the node numbers and the odd-even characteristics of the time slot numbers are as follows: the nodes with odd numbers are in the transmitting state in the odd-numbered time slots of the service transmission period, and are in the receiving state in the even-numbered time slots;

[0023] The even-numbered nodes are set to be in the receiving state in the odd-numbered time slots of the service transmission period, and in the sending state in the even-numbered time slots.

[0024] An electronic device of the present invention includes a memory and a processor, wherein the memory is used to store a program that supports the processor to execute the method for allocating the receiving and transmitting states of nodes in a directional self-organizing network, and the processor is configured to execute the program stored in the memory.

[0025] The present invention provides a computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and the computer program executes the steps of the method for allocating the receiving and transmitting states of nodes in a directional self-organizing network when the computer program is run by a processor.

[0026] Compared with the prior art, the present invention has the following beneficial effects:

[0027] 1. Reduce communication delay: The present invention transmits the network node information table together with the business data, and allocates the node's own transceiver status by querying the business queue and the business priority information in the network node information table, avoiding the information interaction required to adjust the node's transceiver status, thereby reducing communication delay.

[0028] 2. Better meet network communication needs: The present invention allocates the node receiving and sending status based on the service priority information in the network node information table. Compared with the traditional odd-even node classification method, it reduces the problem that similar nodes cannot communicate with each other, thereby better meeting the communication needs of different users in the network and improving the network service quality. BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Figure 1 This is a schematic diagram of network time division of the present invention;

[0030] Figure 2 A flow chart of the method for allocating the receiving and transmitting states of nodes in a directional self-organizing network provided by the present invention. DETAILED DESCRIPTION

[0031] In this embodiment, a method for allocating the receiving and transmitting states of nodes in a directional ad hoc network based on service priority is applied to a directional ad hoc network composed of N randomly arranged nodes, and each node is deployed with a multi-beam antenna to form multiple beams of each node, and establish a high-speed link with multiple beams of other nodes, and multiple beams of the same node are in the same state at the same time, that is, a sending state or a receiving state;

[0032] Let the duration of the current cycle be P, and divide the current cycle into a neighbor discovery period and a service transmission period, such as Figure 1 As shown, the neighbor discovery period lasts for L time slots, the service transmission period lasts for M time slots, and P = L + M;

[0033] Each node has a service queue and a network node information table, the service queue stores the service data to be sent and the corresponding service priority and the number of the destination node; the network node information table contains the node number and location information of the node itself, the service priority and the number of the destination node of the service data to be sent in the service queue;

[0034] like Figure 2 As shown, the method for allocating the receiving and sending status of nodes in a directional self-organizing network includes the following steps:

[0035] Step 1: If the current cycle Time slots When the business data of the ith node arrives at the ith node, the corresponding business data is stored in the business queue of the ith node, and the Time slots The executed business data is deleted from the business queue of the i-th node, thereby updating the business queue of the i-th node. ;

[0036] Place the i-th node in Time slots The service priority and destination node number of the i-th node are updated to the network node information table;

[0037] Step 2: If If the time slot is the time slot before the start of the service transmission period of the current cycle or the last time slot of the transmission service, then execute step 3; otherwise, keep the i-th node in the k+1-th time slot The sending and receiving status of the kth time slot Same as above, and execute step 4;

[0038] Step 3: Based on the service priority in the network node information table of the ith node, the ith node in the k+1th time slot The sending and receiving status is assigned:

[0039] Step 3.1: The i-th node queries the k+1-th time slot in the service queue The highest service priority among all service data to be sent in all beams under ;

[0040] Step 3.2: The i-th node obtains all neighbor nodes in the k+1th time slot through its own network node information table The service priority sent to the i-th node, and the highest service priority is selected from them ;

[0041] Step 3.3: If , then it means that the i-th node is in the k+1th time slot is in receiving state and remains in receiving state until the service priority is Until the business data transmission is completed;

[0042] like And the i-th node is in the k-th time slot In the receiving state, let the i-th node be in the k+1th time slot The state is sent and remains sent until the service priority is Until the business data transmission is completed;

[0043] like And the i-th node is in the k-th time slot In order to prevent the ith node from being in the sending state all the time and causing the network node information table to fail to update, the ith node is set to be in the k+1th time slot. is in receiving state and remains in receiving state until the service priority is Until the business data transmission is completed;

[0044] like , then according to the parity characteristics of the number of the i-th node and The rule of the parity characteristic of the sequence number determines the i-th node in the next time slot The receiving and sending state, that is, if i is an odd number and is an odd number, then the i-th node will be is the sending state; if i is an odd number and is an even number, then the i-th node will be is the receiving state; if i is an even number and is an odd number, then the i-th node will be is the receiving state; if i is an odd number and is an even number, then the i-th node will be In the sending state. If the next time slot If the service priority is The business data transmission ends; if the next time slot is in receiving state, it will remain in receiving state until the service priority is Until the business data transmission is completed;

[0045] In step 3, the service priority of the service queue and the network node information table is used to determine the i-th node in the next time slot. The sending and receiving status of the node is not only avoided, but also the information interaction required to adjust the sending and receiving status of the node is reduced. It also reduces the problem that similar nodes cannot communicate with each other in the traditional odd-even node classification method, thereby reducing the communication delay and better meeting the network communication needs.

[0046] Step 4: According to the i-th node in the k+1th time slot The assigned sending and receiving state completes the i-th node in the k+1th time slot After data is received or sent, k+1 is assigned to k, and the process returns to step 1 and executes sequentially until the termination time is reached.

[0047] In this embodiment, an electronic device includes a memory and a processor, wherein the memory is used to store a program that supports the processor to execute the above method, and the processor is configured to execute the program stored in the memory.

[0048] In this embodiment, a computer-readable storage medium stores a computer program on the computer-readable storage medium, and the computer program executes the steps of the above method when executed by a processor.

[0049] Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field and related fields without creative work should fall within the scope of protection of the present invention.

Claims

1. A method for allocating the receiving and sending status of nodes in a directional ad hoc network based on service priority, characterized in that: It is applied to a directional ad hoc network composed of N randomly arranged nodes, and each node is deployed with a multi-beam antenna to form multiple beams of each node and establish high-speed links with multiple beams of other nodes. Multiple beams of the same node are in the same state at the same time, that is, sending state or receiving state; Let the duration of the current cycle be P, and divide the current cycle into a neighbor discovery period and a service transmission period, wherein the neighbor discovery period lasts for L time slots, the service transmission period lasts for M time slots, and P=L+M; Each node has a service queue and a network node information table, wherein the service queue stores service data to be sent and the corresponding service priority and the number of the destination node; the network node information table contains the node number and location information of the node itself, the service priority and the number of the destination node of the service data to be sent in the service queue; The method for allocating the receiving and sending status of nodes in a directional self-organizing network comprises the following steps: Step 1: If the current cycle Time slots When the business data of the ith node arrives at the ith node, the corresponding business data is stored in the business queue of the ith node, and the Time slots The executed business data is deleted from the business queue of the i-th node, thereby updating the business queue of the i-th node. ; Place the i-th node in Time slots The service priority and destination node number of the i-th node are updated to the network node information table; Step 2: If If the time slot is the time slot before the start of the service transmission period of the current cycle or the last time slot of the transmission service, then execute step 3; otherwise, keep the i-th node in the k+1-th time slot The sending and receiving status of the kth time slot Same as above, and execute step 4; Step 3: Based on the service priority in the network node information table of the ith node, the ith node in the k+1th time slot The sending and receiving status is assigned: Step 3.1: The i-th node queries the k+1-th time slot in the service queue The highest service priority among all service data to be sent in all beams under ; Step 3.2: The i-th node obtains all neighbor nodes in the k+1th time slot through its own network node information table The service priority sent to the i-th node, and the highest service priority is selected from them ; Step 3.3: If , then it means that the i-th node is in the k+1th time slot is in receiving state and remains in receiving state until the service priority is Until the business data transmission is completed; like And the i-th node is in the k-th time slot In the receiving state, let the i-th node be in the k+1th time slot The state is sent and remains sent until the service priority is Until the business data transmission is completed; like And the i-th node is in the k-th time slot In the sending state, let the i-th node be in the k+1th time slot is in receiving state and remains in receiving state until the service priority is Until the business data transmission is completed; like , then according to the parity characteristics of the number of the i-th node and The rule of the parity characteristic of the sequence number determines the i-th node in the next time slot The receiving and sending status of the next time slot If the service priority is The business data transmission ends; if the next time slot is in receiving state, it will remain in receiving state until the service priority is Until the business data transmission is completed; Step 4: According to the i-th node in the k+1th time slot The assigned sending and receiving state completes the i-th node in the k+1th time slot After data is received or sent, k+1 is assigned to k, and the process returns to step 1 and executes sequentially until the termination time is reached.

2. The method for allocating the receiving and sending status of nodes in a directional ad hoc network according to claim 1, characterized in that: The rules for the parity characteristics of the node numbers and the parity characteristics of the time slot numbers are as follows: the nodes with odd numbers are in the sending state in the odd numbered time slots of the service transmission period, and are in the receiving state in the even numbered time slots; The even-numbered nodes are set to be in the receiving state in the odd-numbered time slots of the service transmission period, and in the sending state in the even-numbered time slots.

3. An electronic device, comprising a memory and a processor, characterized in that: The memory is used to store a program that supports the processor to execute the method for allocating the receiving and transmitting states of nodes in a directional self-organizing network as described in claim 1 or 2, and the processor is configured to execute the program stored in the memory.

4. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method for allocating the receiving and transmitting states of nodes in a directional self-organizing network according to claim 1 or 2 are executed.

Images