CN115413041A - Centralized wireless ad hoc network resource allocation method and system - Google Patents
Centralized wireless ad hoc network resource allocation method and system Download PDFInfo
- Publication number
- CN115413041A CN115413041A CN202211013134.8A CN202211013134A CN115413041A CN 115413041 A CN115413041 A CN 115413041A CN 202211013134 A CN202211013134 A CN 202211013134A CN 115413041 A CN115413041 A CN 115413041A
- Authority
- CN
- China
- Prior art keywords
- link
- resources
- total
- resource
- resource allocation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides a centralized wireless ad hoc network resource allocation method and a centralized wireless ad hoc network resource allocation system, and aims at a centralized ad hoc communication system. The resource allocation is updated according to a fixed period, and the specific steps are as follows: step 1, completing networking; step 2, reporting resource requirements; step 3, calculating link resource requirements; step 4, distributing central node resources; and 5, the resource allocation takes effect. The invention fully considers the characteristics of different links and different services on the same link, so that the resource allocation is more reasonable and efficient. And meanwhile, the sent data volume of each service is introduced, so that the ping-pong effect of resource allocation is effectively reduced, and the service delay is favorably reduced. In addition, link resources are uniformly distributed in a resource period, and the service transmission risk is reduced.
Description
Technical Field
The invention relates to the technical field of wireless ad hoc network communication, in particular to a centralized wireless ad hoc network resource allocation method and system.
Background
The wireless ad hoc network is a distributed wireless packet autonomous network, has no fixed infrastructure, has peer-to-peer node positions, can freely move, has the characteristics of flexible networking, multi-hop relay, damage resistance, self-healing and the like, and is more and more widely applied to scenes such as emergency deployment, public service, military communication and the like.
The wireless ad hoc network resource allocation method comprises static allocation and dynamic allocation.
Static allocation means that resources are allocated to nodes in advance, and the allocation scheme cannot be dynamically adjusted according to the change of service demands, so that the resource waste is very serious, and the practicability is poor.
Dynamic allocation refers to a way for a system to dynamically adjust resource allocation according to service requirements between nodes. At present, the wireless ad hoc network mostly adopts a dynamic wireless resource allocation mode. Dynamic resource allocation can be divided into centralized allocation and distributed allocation. Distributed allocation means that each node calculates resource allocation according to own neighbors, is completely based on a random competition mechanism, and has the problems of more conflicts and small throughput; the centralized allocation combines the advantages of the static allocation algorithm and the distributed allocation algorithm, and improves the utilization rate of the channel, but has some disadvantages.
In the existing centralized allocation scheme, resources are usually allocated based on nodes, even fixed resources are allocated to nodes in some cases, and meanwhile, the amount of sent data cannot be taken into consideration, so that the resource utilization rate is not high, and different services and link attributes cannot be well adapted.
Disclosure of Invention
The invention aims to: a centralized wireless ad hoc network resource allocation method is provided, and a system for implementing the method is further provided, so as to solve the above problems in the prior art.
In a first aspect, a centralized wireless ad hoc network resource allocation method is provided, and the method includes the following steps:
step 1, completing networking: and generating a central node by adopting a preset strategy, starting network establishment by the central node, accessing non-central nodes in all communication ranges into a network as slave nodes, and performing updating maintenance of network topology in the system, scheduling management of communication resources and the like by the central node.
Step 2, reporting resource requirements: the slave node and the central node establish stable connection and then periodically report the resource demand information of each link; the link is a wireless path from the node to each other node and has directivity. The resource requirement information mainly utilized by the invention comprises service types, service priorities, the data volume sent and to be sent in the last period of each service, the rate of each link and the like.
Step 3, calculating link resource requirements: according to the resource demand information, the central node calculates each link to obtain the number of the required resources;
step 4, distributing central node resources: after receiving the resource demand information of all nodes in the network, the central node allocates resources to each link;
step 5, the resource allocation takes effect: the central node sends the resource allocation condition of each link to the slave nodes through the control message, and appoints that all the resource allocation takes effect at a certain preset time after the last node receives the control message.
In some implementations of the first aspect, the step 3 of calculating link resource requirements further includes:
step 3-1, each node counts the data volume aiming at each service type, wherein the data volume comprises the data volume sent in the last period
Local amount of data to be sent
And sending the information to the central node in combination with the service priority information;
step 3-2, after receiving the link resource demand information, the central node calculates the total data volume and the total data volume to be sent of all service types on the link, and the total data volume
(ii) a Total amount of data to be sent
；
Step 3-3, if the total data volume
And if the data quantity is zero, judging the total data quantity of the reverse link:
if the total data volume of the reverse link is also zero, resources are not allocated to the link; if the total data volume of the reverse link is not zero, allocating a single resource block for the link;
step 3-4, counting the total data volume
If not, judging the link data amount to be sent
：
If it is
If the number is zero, reserving the link resource allocation number of the last period; if it is
If not, respectively calculating the number of resources required by each service type and the total number of resources required by the link.
In some implementations of the first aspect, the step 4 of allocating the central node resource further includes:
step 4-1, the central node counts the total resource requirements of all links and compares the total resource requirements with the resources which can be distributed by the system;
step 4-2, if the total demand is less than the number of the allocable resources, each link allocates all the available resources according to the demand proportion;
4-3, if the total demand is greater than the number of the allocable resources, allocating the resources according to the following rules:
step 4-3a, counting the total demand number of the highest priority service of the unallocated resources in all the links, and comparing the total demand number with the residual resources of the system;
4-3b, if the residual resources are enough, distributing the resources according to the service requirements; after the allocation is finished, if the system has the remaining resources, returning to the step 4-3a again, and if the resources do not remain, ending the allocation process;
and 4-3c, if the residual resources are not enough, distributing the resources according to the respective demand proportion, and ending the distribution process.
In some implementations of the first aspect, in step 4-3, if the total demand is greater than the number of allocable resources, the link weight value may be calculated by weighting according to the service priority and the traffic volume, and the resource allocation is performed according to the calculated link weight value:
in the link, the service priority weighting coefficient with the priority of j is
The last cycle sends data amount of
The weighting coefficient is
The amount of data to be transmitted is
The weighting coefficient is
Then the link weight value is:
in the formula (I), the compound is shown in the specification,
is weighted value of link I of node m, I is number of service priority,
、
、
three weight coefficients are determined by a specific system;
resource allocation ratio of node m link i
Expressed, as follows:
in the formula, N is the number of nodes, and L is the number of links of each node.
In a second aspect, a system for allocating wireless ad hoc network resources is provided, where the system includes a networking module, a resource demand reporting module, a link resource demand calculating module, a central node resource allocating module, and a resource allocation validation module.
The networking module generates a central node by adopting a preset strategy, the central node starts the network establishment, and non-central nodes in all communication ranges are used as slave nodes to access the network.
After the slave node and the central node establish stable connection, the resource demand reporting module periodically reports the resource demand information of each link.
And the link resource demand calculation module is used for controlling the central node to calculate each link according to the resource demand information to obtain the required resource number. The link resource demand calculation module further counts the data volume of each node for each service type, wherein the data volume comprises the data volume sent in the last period
Local amount of data to be sent
In combination with service priority informationThe message is sent to the central node;
when the central node receives the link resource demand information, the link resource demand calculation module calculates the total data volume and the total data volume to be sent of all service types on the link, and the total data volume
(ii) a Total amount of data to be sent
；
If the total data volume is zero, judging the total data volume of the reverse link:
if the total data volume of the reverse link is also zero, resources are not allocated to the link; if the total data volume of the reverse link is not zero, allocating a single resource block for the link;
if total amount of data
If not, judging the link data amount to be sent
：
If it is
If the number is zero, reserving the link resource allocation number of the last period; if it is
If not, respectively calculating the number of resources required by each service type and the total number of resources required by the link.
And the central node resource allocation module allocates resources to each link after the central node receives the resource demand information of all the nodes in the network. The central node resource allocation module further controls the central node to count the total resource requirements of all links and compare the total resource requirements with the resources allocable by the system;
if the total demand is less than the number of the allocable resources, each link allocates all available resources according to the demand proportion;
if the total demand is greater than the number of the allocable resources, further counting the total demand number of the highest priority service of the unallocated resources in all the links, and comparing the total demand number with the remaining resources of the system;
if the residual resources are enough, the resources are distributed according to the requirements of each service; after the distribution is completed, if the system has the residual resources, the total demand number of the highest priority service of the unallocated resources in all the links is counted again, and is compared with the residual resources of the system; if no resource remains, ending the distribution process;
if the residual resources are not enough, the resources are distributed according to the respective demand proportion, and the distribution process is finished.
When the central node resource allocation module allocates resources, if the total demand is greater than the number of allocable resources, the central node resource allocation module performs weighted calculation on a link weighted value by using the service priority and the service volume, and performs resource allocation according to the weighted calculation:
in the link, the service priority weighting coefficient with the priority of j is
The last cycle sends data amount of
The weighting coefficient is
The amount of data to be transmitted is
With a weighting coefficient of
Then the link weight value is:
in the formula (I), the compound is shown in the specification,
is weighted value of link I of node m, I is number of service priority,
、
、
three weight coefficients are determined by a specific system;
resource allocation ratio of node m link i
Expressed as follows:
in the formula, N is the number of nodes, and L is the number of links of each node.
The central node of the resource allocation validation module sends the resource allocation condition of each link to the slave nodes through the control message, and the resource allocation validation module agrees that all the resource allocation takes effect at a certain preset time after the last node receives the control message.
In a third aspect, a wireless ad hoc network resource allocation device is proposed, which comprises at least one processor and a memory; the memory stores computer execution instructions; execution of computer-executable instructions stored by the memory by the at least one processor causes the at least one processor to perform a wireless ad hoc network resource allocation method as described in the first aspect.
In a fourth aspect, a readable storage medium is provided, where a computer executable instruction is stored, and when a processor executes the computer executable instruction, the method for allocating wireless ad hoc network resources according to the first aspect is implemented.
Has the advantages that: the centralized wireless ad hoc network resource allocation method and system provided by the invention fully consider the characteristics of different links and different services on the same link, so that the resource allocation is more reasonable and efficient. And meanwhile, the sent data volume of each service is introduced, so that the ping-pong effect of resource allocation is effectively reduced, and the service delay is favorably reduced. In addition, link resources are uniformly distributed in a resource period, and the service transmission risk is reduced.
Drawings
Fig. 1 is a flow chart of wireless ad hoc network resource allocation according to the present invention.
Fig. 2 is a link resource requirement algorithm of the present invention.
Fig. 3 is a link resource allocation algorithm of the present invention.
Fig. 4 is a diagram comparing the effect of the resource allocation part of the present invention with the conventional scheme.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without one or more of these specific details. In other instances, well-known features have not been described in order to avoid obscuring the invention.
The applicant researches and discovers that in the existing centralized allocation scheme, resources are allocated based on nodes, even fixed resources are allocated to the nodes, and meanwhile, the sent data volume cannot be taken into consideration, so that the resource utilization rate is not high, and different services and link attributes cannot be well adapted.
Therefore, the applicant provides a centralized resource allocation method, which fully considers the characteristics of different links and different services on the same link, so that the resource allocation is more reasonable and efficient. As shown in fig. 4, the present solution fully guarantees the transmission resources of the services with high priority based on the urgency (priority) of different services, and processes other services after there are surplus resources or the transmission of high priority is completed. Meanwhile, the sent data volume of each service is introduced, when no data to be sent exists in the period, if the data to be sent exists in the previous period, certain transmission resources are still reserved for the service to deal with the service burst data, the ping-pong effect of resource allocation is effectively reduced, and the stable transmission of the service is facilitated. In addition, link resources are uniformly distributed in the resource period, so that the service delay is reduced, as shown in fig. 4.
The present invention is directed to a centralized, ad hoc communication system, by which is meant a system having fixed or non-fixed central nodes. The slave node reports the service-related information to the central node, and the central node performs uniform resource allocation according to the service condition of the system, and the general flow is as shown in fig. 1. The invention provides a centralized dynamic resource allocation method and a flow, wherein the resource allocation is updated according to a fixed period, and the method comprises the following specific steps:
the method comprises the following steps: complete the networking
And generating the central node by adopting a pre-planning mode or a certain strategy. The pre-planning refers to that a certain node is manually set as a central node before the node is started, and is a static mode; the dynamic mode is to real-time promote the central node by a certain algorithm according to the self position, responsibility and other related attributes of each node after the node is started. The central node starts the network establishment, and all non-central nodes in the communication range are used as slave nodes to access the network. The central node performs updating maintenance of network topology in the system, scheduling management of communication resources and the like.
Step two: resource demand reporting
And after the stable connection is established between the slave node and the central node, the resource demand information of each link is periodically reported, wherein the link is a wireless access from the node to other nodes and has directivity. The resource requirement information mainly utilized by the invention comprises service types, service priorities, the data volume sent and to be sent in the last period of each service, the rate of each link and the like.
Step three: calculating link resource requirements
According to the resource demand information, the central node calculates each link to obtain the number of resources required by the link, and a specific algorithm is shown in fig. 2.
Each node statistics data for each traffic typeAmount, which includes the amount of data sent in the last cycle
Local amount of data to be sent
And sending the information to the central node by combining the service priority and other related information.
After receiving the link resource demand information, the central node calculates the total data volume and the total data volume to be sent of all service types on the link, that is, the central node calculates the total data volume and the total data volume to be sent of all service types on the link
，
。
If it is
And if the value is zero, judging the total data volume of the reverse link. If the total data volume of the reverse link is also zero, resources are not allocated to the link; and if the total data amount of the reverse link is not zero, allocating a single resource block for the link. The resource block form and size are determined by the specific system, for example, a TDMA system can be set to one slot.
If it is
If not, judging the link data amount to be sent. If it is
If the number is zero, reserving the link resource allocation number of the last period; if it is
If not, respectively calculating the number of resources required by each service type and the total number of resources required by the link.
Step four: central node resource allocation
After receiving the resource demand information of all nodes in the network, the central node allocates resources to each link according to the resource allocation algorithm of the present invention, as shown in fig. 3.
1) The central node counts the total resource demand of all the links and compares the total resource demand with the allocable resources of the system.
2) If the total demand is less than the number of the allocable resources, each link allocates all the available resources according to the demand proportion.
3) If the total demand is greater than the number of the allocable resources, the resources are allocated according to the following rules:
a. counting the total demand number of the highest priority service of the unallocated resources in all the links, and comparing the total demand number with the residual resources of the system;
b. and if the residual resources are enough, distributing the resources according to the service requirements. And c, after the allocation is finished, if the system has the remaining resources, returning to the step a again, and if the system has no remaining resources, ending the allocation process.
c. If the residual resources are not enough, the resources are distributed according to the respective demand proportion, and the distribution process is finished.
The allocation scheme in step 3) takes priority to meet the requirement of high-priority service as a criterion, and the allocation scheme may result in that low-priority service cannot always get transmission opportunity. Therefore, in some usage application scenarios, the resource allocation can be performed according to the weighted calculation of the link weighted value by using the service priority and the traffic.
In the link, the service priority weighting coefficient with the priority of j is
The last cycle sends data amount of
With a weighting coefficient of
The amount of data to be transmitted is
The weighting coefficient is
Then the link weight value is:
in the formula (I), the compound is shown in the specification,
is weighted value of link I of node m, I is number of service priority,
、
、
three weight coefficients are determined by a specific system;
resource allocation ratio of node m link i
Expressed, as follows:
in the formula, N is the number of nodes, and L is the number of links of each node.
Each link resource distributed by the invention follows the principle of uniform distribution in the period, thus not only reducing the service transmission delay, but also preventing the problem of window dragging in reliable transmission and enhancing the system robustness.
Step five: resource allocation validation
The central node sends the resource allocation condition of each link to the slave nodes through the control message, and appoints that all the resource allocation takes effect at the same time at a certain moment after the last node receives the control message.
As noted above, while the present invention has been shown and described with reference to certain preferred embodiments, it is not to be construed as limited thereto. Various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A centralized wireless ad hoc network resource allocation method is characterized by comprising the following steps:
step 1, completing networking: generating a central node by adopting a preset strategy, starting network establishment by the central node, and accessing non-central nodes in all communication ranges as slave nodes into a network;
step 2, reporting resource requirements: periodically reporting resource demand information of each link after the slave node and the central node establish stable connection;
step 3, calculating link resource requirements: according to the resource demand information, the central node calculates each link to obtain the number of the required resources;
step 4, distributing central node resources: after receiving the resource demand information of all nodes in the network, the central node allocates resources to each link;
step 5, resource allocation takes effect: the central node sends the resource allocation condition of each link to the slave nodes through the control message, and appoints that all the resource allocation takes effect at a certain preset time after the last node receives the control message.
2. The method as claimed in claim 1, wherein the step 3 of calculating link resource requirement further comprises:
step 3-1, each node counts the data volume aiming at each service type, which comprises the data volume sent in the last period
Local to be sentData volume
And sending the information to the central node in combination with the service priority information;
step 3-2, after receiving the link resource demand information, the central node calculates the total data volume and the total data volume to be sent of all service types on the link, and the total data volume
(ii) a Total amount of data to be sent
；
Step 3-3, if the total data volume
And if the data quantity is zero, judging the total data quantity of the reverse link:
if the total data volume of the reverse link is also zero, resources are not allocated to the link; if the total data volume of the reverse link is not zero, allocating a single resource block for the link;
step 3-4, if the total data volume
If not, judging the link data amount to be sent
：
If it is
If the number is zero, reserving the link resource allocation number of the last period; if it is
If not, respectively calculating the number of resources required by each service type and the total number of resources required by the link.
3. The method as claimed in claim 1, wherein the step 4 of allocating the central node resources further comprises:
step 4-1, the central node counts the total resource requirements of all links and compares the total resource requirements with the resources which can be distributed by the system;
step 4-2, if the total demand is less than the number of the allocable resources, each link allocates all the available resources according to the demand proportion;
4-3, if the total demand is greater than the number of the allocable resources, allocating the resources according to the following rules:
step 4-3a, counting the total demand number of the highest priority service of the unallocated resources in all the links, and comparing the total demand number with the residual resources of the system;
4-3b, if the residual resources are enough, distributing the resources according to the requirements of each service; after the allocation is finished, if the system has the remaining resources, returning to the step 4-3a again, and if the system has no remaining resources, ending the allocation process;
and 4-3c, if the residual resources are not enough, distributing the resources according to the respective demand proportion, and ending the distribution process.
4. A centralized wireless ad hoc network resource allocation method according to claim 3, wherein in step 4-3, if the total demand is greater than the number of allocable resources, the link weight value can be weighted by using the service priority and the traffic volume, and resource allocation is performed accordingly:
in the link, the service priority weighting coefficient with the priority of j is
The last cycle sends data amount of
The weighting coefficient is
The amount of data to be transmitted is
With a weighting coefficient of
Then the link weight value is:
in the formula (I), the compound is shown in the specification,
is weighted value of link I of node m, I is number of service priority,
、
、
three weight coefficients are determined by a particular system;
resource allocation ratio of node m link i
Expressed as follows:
in the formula, N is the number of nodes, and L is the number of links of each node.
5. A wireless ad hoc network resource allocation system, the system comprising:
the networking module adopts a preset strategy to generate a central node, the central node starts network establishment, and non-central nodes in all communication ranges are used as slave nodes to access the network;
the resource demand reporting module is used for periodically reporting the resource demand information of each link after the stable connection is established between the slave node and the central node;
the link resource demand calculation module is used for controlling the central node to calculate each link according to the resource demand information to obtain the number of the required resources;
the central node resource allocation module allocates resources to each link after the central node receives the resource demand information of all the nodes in the network;
and the resource allocation validation module is used for appointing that all the resource allocation takes effect at a certain preset time after the last node receives the control message.
6. The system according to claim 5, wherein the link resource requirement calculation module further counts the data volume of each node for each traffic type, which includes the data volume sent in the last period
Local amount of data to be sent
And sending the information to the central node in combination with the service priority information;
when the central node receives the link resource demand information, the link resource demand calculation module calculates the total data volume and the total data volume to be sent of all service types on the link, and the total data volume
(ii) a Total amount of data to be sent
；
If total amount of data
And if the data quantity is zero, judging the total data quantity of the reverse link:
if the total data volume of the reverse link is also zero, resources are not allocated to the link; if the total data volume of the reverse link is not zero, allocating a single resource block for the link;
if total amount of data
If not, judging the link data amount to be sent
：
If it is
If the number is zero, reserving the link resource allocation number of the last period; if it is
If not, respectively calculating the number of resources required by each service type and the total number of resources required by the link.
7. The wireless ad hoc network resource allocation system according to claim 5, wherein the central node resource allocation module further controls the central node to count the total resource demand of all links, and compare the total resource demand with the allocable resources of the system;
if the total demand is less than the number of the allocable resources, each link allocates all available resources according to the demand proportion;
if the total demand is greater than the number of the allocable resources, further counting the total demand number of the highest priority service of the unallocated resources in all the links, and comparing the total demand number with the remaining resources of the system;
if the residual resources are enough, the resources are distributed according to the requirements of each service; after the distribution is completed, if the system has the residual resources, the total demand number of the highest priority service of the unallocated resources in all the links is counted again, and is compared with the residual resources of the system; if no resource remains, ending the distribution process;
if the residual resources are not enough, the resources are distributed according to the respective demand proportion, and the distribution process is finished.
8. The system according to claim 7, wherein when allocating resources, the central node resource allocation module performs weighted calculation on link weighted values by using service priorities and traffic volumes if the total demand is greater than the number of allocable resources, and performs resource allocation according to the weighted calculation:
in the link, the service priority weighting coefficient with the priority of j is
The last cycle sends data amount of
The weighting coefficient is
The amount of data to be transmitted is
With a weighting coefficient of
Then the link weight value is:
in the formula (I), the compound is shown in the specification,
is weighted value of link I of node m, I is number of service priority,
、
、
three weight coefficients are determined by a specific system;
resource allocation ratio of node m link i
Expressed, as follows:
in the formula, N is the number of nodes, and L is the number of links of each node.
9. A wireless ad hoc network resource allocation device, comprising: at least one processor and memory;
the memory stores computer-executable instructions;
execution of the computer-executable instructions stored by the memory by the at least one processor causes the at least one processor to perform the wireless ad hoc network resource allocation method according to any one of claims 1 to 7.
10. A readable storage medium having stored therein computer executable instructions which, when executed by a processor, implement the method for allocating wireless ad hoc network resources according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211013134.8A CN115413041A (en) | 2022-08-23 | 2022-08-23 | Centralized wireless ad hoc network resource allocation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211013134.8A CN115413041A (en) | 2022-08-23 | 2022-08-23 | Centralized wireless ad hoc network resource allocation method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115413041A true CN115413041A (en) | 2022-11-29 |
Family
ID=84160858
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211013134.8A Pending CN115413041A (en) | 2022-08-23 | 2022-08-23 | Centralized wireless ad hoc network resource allocation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115413041A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116723583A (en) * | 2023-08-09 | 2023-09-08 | 国网信息通信产业集团有限公司 | Power emergency Mesh network communication resource allocation method and device |
-
2022
- 2022-08-23 CN CN202211013134.8A patent/CN115413041A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116723583A (en) * | 2023-08-09 | 2023-09-08 | 国网信息通信产业集团有限公司 | Power emergency Mesh network communication resource allocation method and device |
| CN116723583B (en) * | 2023-08-09 | 2024-01-09 | 国网信息通信产业集团有限公司 | Power emergency Mesh network communication resource allocation method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Tassiulas et al. | Maxmin fair scheduling in wireless networks | |
| Chen et al. | Supporting QoS in IEEE 802.11 e wireless LANs | |
| US20070189298A1 (en) | Distributed wireless network with dynamic bandwidth allocation | |
| US20130182565A1 (en) | Systems and methods for resource allocation serving communication requirements and fairness | |
| CN104301933B (en) | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking | |
| WO2007071198A1 (en) | A distributed wireless network with dynamic bandwidth allocation | |
| US9590918B2 (en) | Topology- and load-aware (TLA) resource allocation for a medium access control (MAC) protocol | |
| CN109617836B (en) | Intelligent bandwidth allocation method and system for satellite data transmission | |
| CN111371701B (en) | MAC layer queue scheduling method based on TDMA | |
| US11411818B2 (en) | Method and apparatus for a communication network | |
| CN115413041A (en) | Centralized wireless ad hoc network resource allocation method and system | |
| CN107770875B (en) | Method for mixing MAC protocol of aviation ad hoc network | |
| CN111836370A (en) | Resource reservation method and equipment based on competition | |
| CN117335941A (en) | Time slot allocation algorithm optimization method based on distributed TDMA protocol | |
| EP1916801B1 (en) | Access point for centralised scheduling in a IEEE 802.11e WLAN | |
| US8045577B2 (en) | Method and apparatus for allocating wireless resource and wireless network system | |
| CN101227369A (en) | System and method for node band width equitable distribution on elastic grouping ring | |
| CN114980155A (en) | Periodic data stream scheduling and aggregating method for 6TiSCH network | |
| Douligeris et al. | Fairness issues in the networking environment | |
| CN111148162A (en) | Multi-channel uplink dynamic scheduling method based on service level agreement SLA | |
| Tu et al. | A two-stage link scheduling scheme for variable-bit-rate traffic flows in wireless mesh networks | |
| Delicado et al. | New contention resolution schemes for WiMAX | |
| Nandagopal et al. | Fair scheduling in wireless packet data networks | |
| Nahrstedt | Bandwidth Management | |
| Jain et al. | Distributed protocols for scheduling and rate control to achieve max-min fairness in wireless mesh networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |