Wireless ad hoc network link resource management method
By using link correlation matrix and node degree calculation methods, the channel delay problem caused by improper resource allocation in wireless ad hoc networks is solved, achieving efficient resource management and network stability, and adapting to network topology changes.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-01-09
- Publication Date
- 2026-04-07
AI Technical Summary
In the process of establishing communication links between existing wireless ad hoc network nodes, the Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) technology causes excessive resource consumption and increased transmission latency, which is particularly evident in high-concurrency networks.
By employing a link correlation matrix and node degree calculation method, a node connectivity matrix and a link correlation matrix are generated through two rounds of broadcasting. Resources are allocated based on the link degree to avoid carrier snooping and achieve automated resource allocation.
It effectively reduces channel latency, improves wireless resource utilization and data transmission stability, can adapt to network topology changes, and ensures the scientific and flexible allocation of resources.
Smart Images
Figure CN121815431A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of communication resource management technology, and in particular to a method for managing link resources in wireless ad hoc networks. Background Technology
[0002] Wireless ad hoc networks are widely used in unmanned area communication, field research, and other fields due to their simple setup, support for multi-point to multi-point mesh structures, lack of fixed base stations, and ability to communicate directly with neighboring nodes. Inter-node link resource management is crucial for ensuring stable data transmission and optimal channel utilization during communication within the ad hoc network.
[0003] Currently, most wireless ad hoc network nodes establish communication links through Carrier Sense Multiple Access / Collision Avoidance (CSMA / CA) technology. Two nodes with communication needs must first perform carrier sensing to confirm idle time before data transmission can occur at a specified time. If the channel is busy, the device will stop transmitting and continue listening. This mechanism requires listening before each transmission. If the concurrent network data volume exceeds a threshold, it will lead to listening termination, consuming significant wireless resources and degrading transmission latency and rate.
[0004] Therefore, it is necessary to improve one or more of the problems existing in the above-mentioned related technical solutions.
[0005] It should be noted that this section is intended to provide background or context for the technical solutions of this disclosure as set forth in the claims. The description herein does not constitute an admission that it is prior art simply because it is included in this section. Summary of the Invention
[0006] The purpose of this invention is to provide a method for managing link resources in wireless ad hoc networks, thereby overcoming, at least to some extent, one or more problems caused by the limitations and defects of related technologies.
[0007] This invention provides a method for managing link resources in a wireless ad hoc network, comprising: S1. In a self-organizing network composed of multiple nodes, each node performs its first round of broadcasting according to the node access order. If the signal strength between the broadcasting node and the listening node exceeds the threshold, it is considered that there is a communication link between them. S2, each node performs a second round of broadcasting, the broadcast content includes the link information of the current node and the link information received by the current node from other nodes, and the last node summarizes all the link information in the ad hoc network; S3. Based on the summarized link information of the ad hoc network, generate a node connectivity matrix, calculate the total number of links based on the node connectivity matrix, and generate a link-related matrix. S4. Calculate the degree of each link based on the link correlation matrix, and sort the links in descending order of degree. S5 allocates resources to all links based on the correlation of links in the sequence.
[0008] In this invention, in the node connectivity matrix of S3, the matrix elements take the value of 0 or 1. 0 indicates that there is no connectivity between two nodes, and 1 indicates that there is a connectivity between two nodes.
[0009] In this invention, the links in S3 have rows and columns representing link numbers. The elements in the matrix are either 0 or 1. 0 indicates that there are no common nodes or no correlation between the two links; 1 indicates that there are common nodes or correlation between the two links.
[0010] In this invention, in step S4, the degree of each link is determined based on the number of related relationships for each link.
[0011] In this invention, step S5 includes the following steps: S501, allocate resource 1 to the first link in the sequence. Among all unrelated links in the sequence that are not related to the first link, allocate resource 1 to the first unrelated link. Determine whether subsequent unrelated links are unrelated to all unrelated links that have been allocated resource 1 before them: if they are all unrelated, allocate resource 1; if they are related, do not allocate resources for the time being. S502, allocate resource 2 to the first link among the remaining links that have not been allocated resources, and allocate resources to the remaining links according to the rules of S501, until all links have been allocated corresponding resources.
[0012] In this invention, the method further includes: S6, calculate the total number of resources and the number of links reused for each resource, and then weight the total available bandwidth. S7 generates link resource allocation processing results based on the location and size of each link and its allocated resources, as well as the corresponding nodes at both ends of the link, and sets the resource effective time. The allocation processing results are then transmitted to each node in the ad hoc network via a broadcast channel.
[0013] In this invention, the method further includes: S8: Each node broadcasts synchronization information to surrounding nodes. If a new node joins, link resources are reallocated after this round of broadcasting ends.
[0014] The technical solution provided by this invention may include the following beneficial effects: The wireless ad hoc network link resource management method of this invention adopts a link correlation matrix and node degree calculation method, which can automatically generate resource allocation results, avoid channel delay caused by carrier sensing, and solve the problem of wireless resource allocation in ad hoc networks. The wireless ad hoc network link allocation scheme implemented in this invention has low computational complexity and requires no additional hardware support. Attached Figure Description
[0015] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this disclosure and, together with the description, serve to explain the principles of this disclosure. It is obvious that the drawings described below are merely some embodiments of this disclosure, and those skilled in the art can obtain other drawings based on these drawings without any inventive effort.
[0016] Figure 1 A flowchart illustrating a wireless ad hoc network link resource management method in an exemplary embodiment of this disclosure is shown. Figure 2 A schematic diagram of a wireless ad hoc network topology in an exemplary embodiment of this disclosure is shown. Detailed Implementation
[0017] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that this disclosure will be more comprehensive and complete, and will fully convey the concept of the exemplary embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
[0018] Furthermore, the accompanying drawings are merely illustrative diagrams of embodiments of this disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and therefore repeated descriptions of them will be omitted. Some block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically independent entities.
[0019] This example implementation, based on the high concurrency of wireless ad hoc network communication, determines the channel multiplexing status by analyzing inter-node interference information, providing a wireless ad hoc network link resource management method. This method effectively avoids the consumption of information exchanged between nodes, improves overall network throughput, and reduces transmission latency. Please refer to [link to relevant documentation]. Figure 1 This method may include: S1-S5, as follows: S1. In a self-organizing network composed of multiple nodes, each node performs its first round of broadcasting according to the node access order. If the signal strength between the broadcasting node and the listening node exceeds the threshold, it is considered that there is a communication link between them.
[0020] S2, each node performs a second round of broadcasting, the broadcast content includes the link information of the current node and the link information received by the current node from other nodes, and the last node summarizes all the link information in the ad hoc network.
[0021] S3. Based on the summarized link information of the ad hoc network, generate a node connectivity matrix, calculate the total number of links based on the node connectivity matrix, and generate a link correlation matrix. In the node connectivity matrix, each element has a value of 0 or 1, where 0 indicates no connection between two nodes and 1 indicates a connection between two nodes. In the link correlation matrix, the rows and columns represent link numbers, and each element has a value of 0 or 1, where 0 indicates no connection between two links (no common nodes) and 1 indicates a connection between two links (common nodes).
[0022] S4. Calculate the degree of each link based on the link correlation matrix, and sort the links in descending order of degree.
[0023] S5 allocates resources to all links based on the correlation of links in the sequence.
[0024] In this embodiment, the link correlation matrix and node degree calculation method are adopted to automatically generate resource allocation results, avoid channel delay caused by carrier sensing, and solve the problem of wireless resource allocation in ad hoc networks. The wireless ad hoc network link allocation scheme implemented in this invention has low computational complexity and requires no additional hardware support.
[0025] S5 includes the following steps: S501, allocate resource 1 to the first link in the sequence. Among all unrelated links in the sequence that are not related to the first link, allocate resource 1 to the first unrelated link. Determine whether subsequent unrelated links are unrelated to all unrelated links that have been allocated resource 1 before them: if they are all unrelated, allocate resource 1; if they are related, do not allocate resources for the time being. S502, allocate resource 2 to the first link among the remaining links that have not been allocated resources, and allocate resources to the remaining links according to the rules of S501, until all links have been allocated corresponding resources.
[0026] Based on the above embodiments, the management method further includes the following steps: S6, calculate the total number of resources and the number of links reused for each resource, and then weight the total available bandwidth. S7 generates link resource allocation processing results based on the location and size of each link and its allocated resources, as well as the corresponding nodes at both ends of the link, and sets the resource effective time. The allocation processing results are then transmitted to each node in the ad hoc network via a broadcast channel. S8: Each node broadcasts synchronization information to surrounding nodes. If a new node joins, link resources are reallocated after this round of broadcasting ends.
[0027] Through the above steps, this wireless ad hoc network link resource management method forms a complete link resource allocation and dynamic adjustment mechanism. In the initial stage, link relationships and resource allocation order are determined through two rounds of broadcasting and matrix calculation, effectively avoiding the resource consumption problem of traditional Carrier Sense Multiple Access / Collision Avoidance Technology (CSMA / CA) when the network data volume is large, thus improving the utilization rate of wireless resources and the stability of data transmission.
[0028] Furthermore, this resource allocation method exhibits strong flexibility and adaptability. When allocating bandwidth in a weighted manner, rational planning based on the total number of resources and the number of resource-reused links fully considers the usage of different links, ensuring the scientific nature of resource allocation. Setting resource activation times and transmitting allocation results via broadcast channels guarantees that each node can obtain resource allocation information promptly and accurately, reducing uncertainty in communication.
[0029] In particular, the node broadcast synchronization and resource reallocation mechanisms when new nodes join enable the entire ad hoc network to adapt to changes in network topology in real time. When a new node joins, the system can react quickly and reallocate resources, ensuring the stability of network communication and avoiding communication interference and resource contention issues that may be caused by the new node joining.
[0030] Please refer to Figure 2 The following explanation uses an 8-node, 10-link wireless ad hoc network topology as an example.
[0031] 1. Each node broadcasts in the first round, while the other nodes listen. If the signal strength exceeds a threshold, it is assumed that a communication link exists between the broadcasting node and the listening node. Each node organizes the link information it receives from other nodes.
[0032] 2. Each node conducts a second round of broadcasting, broadcasting its own link information and the link information received from other nodes. The last node, H, then summarizes and organizes the information.
[0033] 3. Node H generates the following node connectivity matrix:
[0034] 4. The link correlation matrix generated from the node connectivity matrix is as follows:
[0035] 5. Calculate the degree of each link based on the link correlation matrix, and sort the links in descending order of degree, as shown in Table 1: Table 1 Link Degree Ranking Results
[0036] Degree calculation: According to the link correlation matrix, link 1 has 2 links with which it is correlated, so its degree is 2. Link 3 has 4 links with which it is correlated, so its degree is 4.
[0037] The degree calculation method for other links is the same as above.
[0038] 6. Allocate resources to all links based on their correlation in the sequence. The allocation results are shown in Table 2. Table 2 Resource Allocation Results
[0039] Resource allocation process description: (1) After sorting, the link with the highest degree is link 6. First, allocate resources ① to link 6. Then, among the links (1, 2, 7, 10) that are not related to link 6, allocate resources in sequence (7, 10, 1, 2): first allocate resources to link 7. Since link 7 and link 6 are unrelated links, allocate resources ①. Then analyze link 10 in sequence. Link 10 is related to link 7, so do not allocate resources for now. Link 1 is unrelated to both links 6 and 7, so allocate resources ①. Link 2 is related to link 1, so do not allocate resources for now.
[0040] (2) After allocating the links that are not related to link 6, allocate resources to link 3 according to the sequence. First, since link 3 is not related to link 6, allocate new resources - resource ②. Then allocate resources to links (2, 8, 9, 10) that have not been allocated resources and are not related to link 3. The allocation process is the same as described above.
[0041] Similarly, resources were allocated to the remaining links that had not been allocated resources, resulting in the allocation results shown in Table 2.
[0042] 7. Calculate the required number of resources and the percentage of total bandwidth allocated to each resource: The above requires a total of four resources, ①②③④, and the percentage of total bandwidth allocated to each resource is as follows: ①3 / 10 ②3 / 10 ③2 / 10 ④2 / 10.
[0043] The bandwidth is weighted according to the above resource proportions. Based on the location and size of each link and its allocated resources, as well as the corresponding nodes at both ends of the link, the link resource allocation processing result is generated, and the resource effective time is set. The allocation processing result is then transmitted to each node in the ad hoc network through the broadcast channel.
[0044] 8. Each node broadcasts synchronization information to surrounding nodes. If a new node joins, link resources are reallocated after this round of broadcasting ends.
[0045] In summary, this application has the following beneficial effects: (1) The present invention addresses the problem of wireless resource allocation in ad hoc networks by using a link correlation matrix and node degree calculation method, which can automatically generate resource allocation results and avoid channel delay caused by carrier sensing.
[0046] (2) The present invention can update the allocation scheme in real time according to the actual link topology, and can adapt to complex and changing dynamic self-organizing networks.
[0047] (3) The present invention performs weighted allocation of link resources based on link load, which can ensure that high-load links obtain more resources and guarantee transmission rate.
[0048] (4) The wireless self-organizing network link allocation scheme implemented in this invention has low computational complexity and requires no additional hardware support.
[0049] The embodiments of the present invention have been described above with reference to the accompanying drawings. However, the present invention is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of the present invention without departing from the spirit and scope of the claims. All of these forms are within the protection scope of the present invention.
Claims
1. A method for managing link resources in a wireless ad hoc network, characterized in that, include: S1. In a self-organizing network composed of multiple nodes, each node performs its first round of broadcasting according to the node access order. If the signal strength between the broadcasting node and the listening node exceeds the threshold, it is considered that there is a communication link between them. S2, each node performs a second round of broadcasting, the broadcast content includes the link information of the current node and the link information received by the current node from other nodes, and the last node summarizes all the link information in the ad hoc network; S3. Based on the summarized link information of the ad hoc network, generate a node connectivity matrix, calculate the total number of links based on the node connectivity matrix, and generate a link-related matrix. S4. Calculate the degree of each link based on the link correlation matrix, and sort the links in descending order of degree. S5 allocates resources to all links based on the correlation of links in the sequence.
2. The wireless ad hoc network link resource management method according to claim 1, characterized in that, In the node connectivity matrix of S3, the matrix elements take the value 0 or 1. 0 indicates that there is no connection between two nodes, and 1 indicates that there is a connection between two nodes.
3. The wireless ad hoc network link resource management method according to claim 1, characterized in that, In the link correlation matrix of S3, the rows and columns are the link numbers. The element in the matrix takes the value 0 or 1. 0 means that there is no common node between the two links and no correlation; 1 means that there is a common node between the two links and correlation.
4. The wireless ad hoc network link resource management method according to claim 1, characterized in that, In S4, the degree of each link is determined based on the number of related relationships for each link.
5. The wireless ad hoc network link resource management method according to claim 1, characterized in that, S5 includes the following steps: S501, allocate resource 1 to the first link in the sequence. Among all unrelated links in the sequence that are not related to the first link, allocate resource 1 to the first unrelated link. Determine whether subsequent unrelated links are unrelated to all unrelated links that have been allocated resource 1 before them: if they are all unrelated, allocate resource 1; if they are related, do not allocate resources for the time being. S502, allocate resource 2 to the first link among the remaining links that have not been allocated resources, and allocate resources to the remaining links according to the rules of S501, until all links have been allocated corresponding resources.
6. The wireless ad hoc network link resource management method according to any one of claims 1 to 5, characterized in that, The method further includes: S6, calculate the total number of resources and the number of links reused for each resource, and then weight the total available bandwidth. S7 generates link resource allocation processing results based on the location and size of each link and its allocated resources, as well as the corresponding nodes at both ends of the link, and sets the resource effective time. The allocation processing results are then transmitted to each node in the ad hoc network via a broadcast channel.
7. The wireless ad hoc network link resource management method according to claim 6, characterized in that, The method further includes: S8: Each node broadcasts synchronization information to surrounding nodes. If a new node joins, link resources are reallocated after this round of broadcasting ends.