CN115190629A - Distributed dynamic resource allocation method, system, device and storage medium - Google Patents
Distributed dynamic resource allocation method, system, device and storage medium Download PDFInfo
- Publication number
- CN115190629A CN115190629A CN202210809535.8A CN202210809535A CN115190629A CN 115190629 A CN115190629 A CN 115190629A CN 202210809535 A CN202210809535 A CN 202210809535A CN 115190629 A CN115190629 A CN 115190629A
- Authority
- CN
- China
- Prior art keywords
- node
- service
- resource
- subnet
- time slot
- 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
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a distributed dynamic resource allocation method, a system, equipment and a storage medium, wherein the method comprises the following steps: dynamically applying for a common node a service resource according to the use condition of the signaling time slot resource of the neighbor node in the two-hop range, and broadcasting the service for the neighbor node of any common node of any subnet so as to realize the two-hop outer space multiplexing of the transmission resource; according to the signaling time slot resource of any subnet in which the gateway node is located, as the signaling time slot resource of the gateway node, for any gateway node in any subnet, when any gateway node communicates with a node of a certain subnet in a certain service time slot, the service time slot can still be occupied when nodes in other subnets communicate with other nodes outside the any gateway node. The invention realizes the complete spatial multiplexing of transmission resources of different frequency bands by declaring and transmitting the time slot state and the node state, and improves the resource allocation efficiency and the resource utilization rate.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a distributed dynamic resource allocation method, system, device, and storage medium.
Background
The ad hoc network does not need a fixed backbone node, supports the wireless interconnection and intercommunication among mobile users, and is widely applied to military communication and field environment. In the planar ad hoc routing protocol, in order to maintain a routing table of the whole network, a large routing overhead is usually required, each lower-level sub-network node in the hierarchical routing protocol only needs to know member information of the sub-network node where the node is located, only a small routing table needs to be maintained, and the routing overhead and routing convergence time are reduced. The frequency hopping communication has the characteristics of stronger anti-interference capability, low interception probability, better confidentiality and the like, and can be widely applied to military communication and field environment. How to make full use of orthogonal frequency hopping resources among different subnets, improve network throughput, and reduce network delay is a key solution to resource management. The existing resource allocation method in the ad hoc network mainly comprises the following steps:
1. static resource allocation methods such as TDMA (Time division multiple access). The wireless resources are fixedly distributed to each network node, a static distribution algorithm is simple, temporary adjustment is not needed according to the topological state of the network, the sudden service requirements of the nodes and the like, resource request and authorization processes are not needed, timely transceiving can be achieved, and transmission delay is small.
2. Dynamic resource allocation methods, such as CSMA (Carrier Sense Multiple Access). And after the network is stable, dynamically adjusting the resource allocation mode according to the service requirements among the nodes. Resource allocation is reduced when traffic is small and increased when traffic is large. The dynamic resource allocation method performs resource allocation by quickly responding to the change condition of the channel resources and can realize two-hop external multiplexing of the resources.
Fig. 1 is a schematic diagram of a two-level network of an ad hoc network component of a frequency division multi-subnet communication system in the prior art, as shown in fig. 1, the frequency division multi-subnet communication system supports to construct a two-level network, and the entire network realizes subnet interconnection by a gateway node connecting a higher-level subnet and a lower-level subnet, as shown in fig. 1, a node 9 and a node 10 in the diagram form the higher-level subnet, a node in the higher-level subnet is referred to as a higher-level node, and particularly, a node 1, a node 2, a node 3 and a node 4 form the lower-level subnet 1, because the higher-level subnet and the lower-level subnet 1 commonly own the node 1, the node 1 is referred to as a gateway node, a node 5, a node 6, a node 7 and a node 8 form a lower-level subnet m, and the higher-level subnet and the lower-level subnet m commonly own the node 5, and therefore, the node in the lower-level subnet is referred to as a gateway node, and not less than n nodes are supported in each subnet, and not less than m subnets are supported. And determining the sub-networks to which the nodes belong according to network planning, configuring a network number with a unique identifier for each sub-network, supporting orthogonal frequency hopping among the sub-networks, and sharing the same frequency table by the upper sub-network and each lower sub-network. The gateway node supports presetting and dynamic election, and the lower-level subnet realizes the intercommunication between subnets through the gateway node and the upper-level subnet. The method supports the splitting and the fusion in the sub-networks, is separated from the lower sub-networks of the upper sub-network, and can realize independent networking.
At present, resource allocation methods in a wireless ad hoc network mainly include two modes, namely static resource scheduling and dynamic resource scheduling. The conflict-free scheduling can be realized based on a static resource scheduling mode, but the resource utilization rate is low; the space multiplexing of transmission resources can be realized based on a dynamic resource scheduling mode, and the resource utilization rate is improved through the multiplexing of two-hop outer nodes. However, the above two types of resource allocation manners mainly solve the problem of resource coordination and scheduling between nodes in a network, and if the two types of resource allocation manners are used for solving the problem of resource allocation of gateway nodes between a plurality of subnets, the transmission resources are wasted, and the resource utilization rate of communication between the subnets is reduced.
Disclosure of Invention
The invention provides a distributed dynamic resource allocation method, a system, equipment and a storage medium, and mainly aims to realize complete spatial multiplexing of transmission resources in different frequency bands through declaration and transmission of a time slot state and a node state, and improve resource allocation efficiency and resource utilization rate.
In a first aspect, an embodiment of the present invention provides a distributed dynamic resource allocation method, including:
for a frequency division multi-subnet communication system, dynamically applying for a common node for service resources according to the signaling time slot resource use condition of a neighbor node in a two-hop range, and for any common node of any subnet, performing service broadcast on the neighbor node of any common node, wherein other nodes except the common node and the neighbor node in any subnet can perform other service resource transmission, thereby realizing two-hop external spatial multiplexing of transmission resources;
according to the signaling time slot resource of any subnet in which the gateway node is located, as the signaling time slot resource of the gateway node, for any gateway node in any subnet, when any gateway node communicates with a node of a certain subnet in a certain service time slot, the service time slot can still be occupied when nodes in other subnets communicate with other nodes outside any gateway node.
Preferably, the method further comprises the following steps:
after receiving the service resource status message, any common node or any gateway node maintains a local service resource table according to the service resource usage information in the service resource status message, and waits for the sending opportunity of the service resource status message;
recording the applied resources to a local service resource table, diffusing the occupation information to any common node or a neighbor node of any gateway node through service resource state information, and periodically informing the neighbor nodes of the resource use conditions of the node and a one-hop neighbor node by all the nodes;
and when the service resource state message sending time of any common node or any gateway node arrives, immediately organizing the service resource state message to send out.
Preferably, the service resources include real-time service resources and non-real-time service resources, and the priority of the real-time service resources is higher than that of the non-real-time service resources.
Preferably, the method further comprises the following steps:
if any common node or any gateway node receives a plurality of service resources at the same time, the service resources with high priority occupy the node preferentially;
for the service resources with the same priority, newly initiating the service resources to allow the node where the original service resources are located to be preempted, finding the conflict of the service resources by processing the service resources sent by the neighbor nodes no matter whether the conflict is a one-hop conflict or a two-hop conflict, reserving one of the service resources according to the conflict resolution criteria of the service resources after finding the conflict, announcing the conflict in the state time slot of the next service resource, and finally informing the two-hop node of the node;
for the service resource conflict inside the subnet, the high priority service is preferentially ensured, and if the priorities are the same, the service with small node ID is preferentially ensured;
and when the service time slots of the sub-networks conflict, the high-priority service is preferentially ensured, and if the priorities are the same, the service transmission of the high-priority sub-networks is preferentially ensured.
Preferably, the method further comprises the following steps:
if the node is on the upper subnet, the node is sent according to the time slot resource planning of the upper subnet;
and if the node is on the lower subnet, the node is scheduled and transmitted according to the time slot resource scheduled by the lower subnet. For the gateway node, the lower level sub-network signaling time slot and the upper level sub-network signaling time slot are at different frequency points, and other time slots are common service time slots.
Preferably, the signaling time slot resource usage includes idle, self-sending, self-receiving and non-transceiving, where:
the idle state indicates that other nodes can be occupied, and the service resource state does not carry a destination node, priority and whether the node is voice or not;
the self-sending indicates that the node occupies the time slot, the service resource state carries a target node, a priority and whether the node is a voice, and other nodes or the node can apply for occupation only when the service/node priority is higher than that of the node;
the self-receiving indicates that the node is receiving the services of other nodes, the service resource state carries a source node and priority, whether the node is voice or not, and the node and the neighbor nodes can apply for occupation only when the service/node priority is higher than that of the node;
the said non-transceive means that it is used only when the cross-network node is used to advertise the other sub-network traffic slot status.
In a second aspect, an embodiment of the present invention provides a distributed dynamic resource allocation system, including:
the common node module is used for dynamically applying service resources for a common node according to the signaling time slot resource use condition of a neighbor node in a two-hop range for a frequency division multi-subnet communication system, and for any common node of any subnet, performing service broadcast on the neighbor node of any common node, wherein other nodes except the common node and the neighbor node in any subnet can perform other service resource transmission, thereby realizing two-hop external space multiplexing of transmission resources;
and the gateway node module is used for serving as the signaling time slot resource of the gateway node according to the signaling time slot resource of any subnet in which the gateway node is positioned, and for any gateway node in any subnet, when any gateway node communicates with a node of a certain subnet in a certain service time slot and nodes in other subnets communicate with other nodes except the any gateway node, the service time slot can still be occupied.
In a third aspect, an embodiment of the present invention provides a computer device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps of the distributed dynamic resource allocation method when executing the computer program.
In a fourth aspect, an embodiment of the present invention provides a computer storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements the steps of the distributed dynamic resource allocation method.
The invention provides a distributed dynamic resource allocation method, a system, equipment and a storage medium, which realize complete spatial multiplexing of transmission resources in different frequency bands and two-hop external spatial multiplexing of the transmission resources in the same frequency band by declaring and transmitting a time slot state and a node state, and solve the problems of low resource allocation efficiency and low resource utilization rate when resource allocation in a traditional multi-subnet system takes a single subnet or a plurality of subnets as a unit. The method can be used for dynamic resource allocation of common nodes and gateway nodes of frequency division multiple subnets.
Drawings
Fig. 1 is a schematic diagram of a two-level network of an ad hoc network component of a frequency division multiple subnet communication system in the prior art;
fig. 2 is a flowchart of a distributed dynamic resource allocation method according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a service resource application signaling interaction process in an embodiment of the present invention;
fig. 4 is a schematic diagram of a service resource conflict signaling interaction process according to an embodiment of the present invention;
fig. 5 is a format diagram of a lower subnet frame format plan in an embodiment of the present invention;
fig. 6 is a format diagram of a format plan of an upper subnet frame in the embodiment of the present invention;
FIG. 7 is a format diagram of a two-stage frame format plan in an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a distributed dynamic resource allocation system according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of a computer device provided in an embodiment of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Fig. 2 is a flowchart of a distributed dynamic resource allocation method according to an embodiment of the present invention, and as shown in fig. 2, the method includes:
s210, for a frequency division multiple sub-network communication system, dynamically applying for a service resource for a common node according to the signaling time slot resource use condition of a neighbor node in a two-hop range, for any common node of any sub-network, performing service broadcast on the neighbor node of any common node, and performing other service resource transmission on other nodes except the common node and the neighbor node in any sub-network, so as to realize two-hop external space multiplexing of transmission resources;
s220, according to the signaling time slot resource of any subnet where the gateway node is located, the signaling time slot resource is used as the signaling time slot resource of the gateway node, and for any gateway node in any subnet, when any gateway node communicates with the node of a certain subnet in a certain service time slot, the service time slot can still be occupied when the node where other subnets are located communicates with other nodes except the any gateway node.
The gateway node in the embodiment of the invention refers to a node in which a superior subnet and a subordinate subnet exist at the same time, and the superior subnet and the subordinate subnet except the gateway node are common nodes, the nodes in the embodiment comprise a common Lu Jiedian and the gateway node, and the node can acquire the position of a signaling time slot of the node through a static or dynamic allocation mode and announce the resource use state detected by the node in a broadcast mode in the signaling time slot of the node. The service resource status information of the signaling time slot is communicated among the nodes to obtain the service time slot use condition, and the service time slot is dynamically applied according to the resource use condition, so that resource multiplexing is realized.
The basic idea of the distributed dynamic resource allocation method in the frequency division multi-subnet communication system is as follows: the use condition of the time slot is marked by four states of idle, self-sending, self-receiving and non-receiving, the common node dynamically applies for transmission resources according to the use condition of the time slot resources declared by the neighbor node in the two-hop range, the two-hop external space multiplexing of the transmission resources is realized, the gateway node coordinates the working time of the gateway node in different subnets by declaring the non-receiving and sending time slot, the two-hop external space multiplexing of the resources is realized in each subnet, and the complete space multiplexing of the resources is realized among the subnets at the same time.
The distributed dynamic resource allocation method in the frequency division multiple subnet communication system defines the air interface state of time frequency resources (namely time slots in a TDMA system) to have 4 types:
(1) 'Idle'
When the time slot state is idle, it indicates that other nodes can be occupied, and the service resource state does not carry other information such as destination node, priority, whether it is voice, etc.
(2) Self-sending "
The time slot state is 'self-sending', which means that the node occupies the time slot, the service resource state can carry the destination node, the priority and whether the node is voice, and other nodes or the node can apply for occupation only when the service/node priority is higher than that of the node.
(3) "self-income"
The time slot state is 'self-receiving' which means that the node is receiving the service of other nodes, and the service resource state carries the source node and priority and whether the node is voice or not. When the time slot state is 'self receiving', the node and the neighbor node can apply for occupation only when the priority of the service/node is higher than that of the node.
(4) No transceiving "
The time slot state is 'unable to receive and send' and is only used when the cross-network node is used for announcing the time slot state of the service of another subnet, which means that the node is in 'receiving' or 'sending' state in the other 1 subnets and is used for announcing that the neighbor node cannot send the service to the node. The service resource state carries the priority and whether the service is a voice service. The neighbor node can be occupied only when the service priority is high.
For the gateway node, the traffic time slot may be a time slot of any subnet in which the traffic node is located. When the gateway node communicates with a node of a certain subnet in a certain service time slot, and nodes of other subnets communicate with other nodes outside the gateway node, the service time slot can still be occupied. Taking a network composed of upper and lower subnets as shown in fig. 1 as an example, when a certain service time slot node 1 and the upper subnet are at the same frequency point, and the node 1 sends information to a node 9 in the upper subnet, nodes 2 and 4 in the lower subnet 1 and the gateway node 1 are at different frequency points, and the nodes 2 and 4 can still communicate in this time slot.
The distributed dynamic resource allocation method provided by the embodiment of the invention realizes complete spatial multiplexing of transmission resources in different frequency bands and two-hop external spatial multiplexing of transmission resources in the same frequency band by declaring and transmitting the time slot state and the node state, and solves the problems of low resource allocation efficiency and low resource utilization rate when resource allocation in a traditional multi-subnet system takes a single subnet or a plurality of subnets as a unit. The method can be used for dynamic resource allocation of common nodes and gateway nodes of frequency division multiple subnets.
On the basis of the above embodiment, it is preferable to further include:
after receiving the service resource status message, any common node or any gateway node maintains a local service resource table according to the service resource usage information in the service resource status message, and waits for the sending opportunity of the service resource status message;
recording the applied resources to a local service resource table, diffusing the occupation information to any common node or a neighbor node of any gateway node through service resource state information, and periodically informing the neighbor nodes of the resource use conditions of the node and a one-hop neighbor node by all the nodes;
and when the service resource state message sending time of any common node or any gateway node arrives, immediately organizing the service resource state message to send out.
The dynamic resource allocation process of the frequency division multiple sub-network is as follows: after receiving the service resource status message, the node maintains a local service resource table according to the service resource usage information in the message, and waits for the sending time of the service resource status message of the node. When the service resource state message sending time of the node arrives, immediately organizing the service resource state message to send out.
Before the resource module organizes the service resource state message to be sent, the resource module records the applied resource to a local resource table, and the occupation information of the resource module is diffused to the neighbor node through the service resource state message. Because all nodes periodically announce the resource use condition of the node and the one-hop neighbor node to the surrounding neighbor nodes, each node can master the resource use condition of the node in the 2-hop range of the node through 2 rounds of forwarding of the service resource state message.
On the basis of the foregoing embodiment, preferably, the service resources include real-time service resources and non-real-time service resources, and the priority of the real-time service resources is higher than the priority of the non-real-time service resources.
The service resources in the embodiment of the invention comprise real-time service resources and non-real-time service resources, and the real-time requirement of the real-time service resources is higher, so that the priority of the real-time service resources is higher than that of the non-real-time service resources, and when a certain node meets the conditions of the real-time service resources and the non-real-time service resources at the same time, the node can process the real-time service resources preferentially.
(1) The real-time service resource application mode is as follows:
the real-time service includes services such as voice. The sending end sends the service resource state and applies for the resource in a mode of starting to use after applying for the service resource, and the time slot number of the applied service resource is carried out according to the voice rate and the voice transmission rate grade. The real-time service does not adopt the rate self-adaptive service, and the destination address (including unicast, multicast/broadcast address) of the application resource is the neighbor broadcast.
(2) The non-real-time service resource application mode is as follows:
the non-real-time service comprises services such as messages, short messages, videos, files and the like. When non-real-time service is applied, the sending end sends a service resource state to apply for service resources and then waits for a frame to start using to apply for resources, and the number of the applied service resource time slots is carried out according to the service volume and the transmission rate grade. In the non-real-time service, the destination address of the unicast service application resource is the next hop unicast address. The destination address of the multicast service application resource is a multicast/broadcast address. For broadcast services, the destination address of the application resource (including unicast, multicast/broadcast addresses) is broadcast by the neighbors.
The user side of the wireless network layer monitors the rate of the upper-layer service and the buffer amount of the local cache occupied service in real time and reports the buffer amount to the resource management module, the resource management module inquires the next hop node of the destination node, calculates the number of resources required by the next hop node according to the buffer occupied report information and the transmission rate of the current service, and compares the number of the resources with the number of the resources existing in the local to obtain the number of the resources to be applied or deleted. If the number of the resources to be applied for the current time is larger than the number of the existing resources, triggering a resource application process; if the number of the resources to be applied is less than the number of the existing resources, the resources are to be deleted; if the number of the resources to be applied for the current time is equal to the number of the existing resources, the processing is not carried out. The relationship between the number of resource demands and the traffic volume is simply described as: number of slots = traffic/(slot bearer-group packet overhead).
Fig. 3 is a schematic diagram of a service resource application signaling interaction process in the embodiment of the present invention, and as shown in fig. 3, the process mainly describes a resource application process, and a resource multiplexing and main processing process of a 2-hop-out node. When the node A sends the service, the same service resource 2 can be applied when the node A applies for the service time slot 2,3 and the node D sends the service. The network transmission control module monitors the upper layer service rate and the service buffer amount in real time and reports the upper layer service rate and the service buffer amount to the resource management module, and the resource management module calculates the number of resources required by the next hop node and triggers a resource application process; if the number of the resources to be applied for the current time is larger than the number of the existing resources, triggering a resource application process; if the number of the resources to be applied is less than the number of the existing resources, the resources are to be deleted, and a resource delayed deletion timer is started; if the number of the resources to be applied for the current time is equal to the number of the existing resources, the processing is not carried out.
On the basis of the above embodiment, it is preferable that the method further includes:
if any common node or any gateway node receives a plurality of service resources at the same time, the service resources with high priority occupy the node preferentially;
for the service resources with the same priority, newly initiating the service resources to allow the node where the original service resources are located to be preempted, finding the conflict of the service resources by processing the service resources sent by the neighbor nodes no matter whether the conflict is a one-hop conflict or a two-hop conflict, reserving one of the service resources according to the conflict resolution criteria of the service resources after finding the conflict, announcing the conflict in the state time slot of the next service resource, and finally informing the two-hop node of the node;
for the service resource conflict inside the subnet, the high priority service is preferentially ensured, and if the priorities are the same, the service with small node ID is preferentially ensured;
and when the service time slots of the sub-networks conflict, the high-priority service is preferentially ensured, and if the priorities are the same, the service transmission of the high-priority sub-networks is preferentially ensured.
Fig. 4 is a schematic diagram of a service resource conflict signaling interaction process provided in the embodiment of the present invention, and as shown in fig. 4, the service resource conflict resolution process is as follows: the service resource application destination address can be a neighbor broadcast address or a unicast address. The addresses currently used are all neighbor broadcast addresses. There are many scenarios where the service resource conflict occurs, such as service resource status message loss, signal leakage, node movement, resource preemption, and the like.
The resolution criterion of the service resource conflict is as follows: the service with high priority preferentially occupies the resource, and for the service with the same priority, the newly-initiated service allows the original service to be preempted. The conflict of the service resources, no matter one-hop conflict or two-hop conflict, finds the conflict by processing the service resource state message sent by the neighbor node, after finding the conflict, reserves one of the service occupied resources according to the conflict resolution criteria of the service resources, announces the resource occupied resource in the next service resource state time slot, and finally informs the two-hop node of the node.
And the service resources in the subnet conflict, the high-priority service is preferentially ensured, and if the priorities are the same, the service with small node ID is preferentially ensured.
And when the service time slots of the sub-networks conflict, the high-priority service is preferentially ensured, and if the priorities are the same, the service transmission of the high-priority sub-networks is preferentially ensured.
The following flow mainly describes the process and main processing of simultaneously applying for a certain service resource by the node a and the node D, and preferentially reserving the service resource with high priority, and preferentially reserving the service resource applied by the node with small ID if the priority is the same.
On the basis of the above embodiment, it is preferable to further include:
if the node is on the upper subnet, the node is sent according to the time slot resource planning of the upper subnet;
and if the node is on the lower subnet, the node is scheduled and transmitted according to the time slot resource scheduled by the lower subnet. For the gateway node, the lower subnet signaling time slot and the upper subnet signaling time slot are at different frequency points, and other time slots are common service time slots.
Specifically, in the embodiment of the present invention, the service resource application applies for corresponding resources according to the service order, when the number of resources required by a service with a high priority is greater than the number of resources of a local idle timeslot, the service with a low priority may be preempted according to the service priority, if the priorities are the same, when the priorities are the voice service, the resource with a low priority is preempted according to the node with a high priority, when the node priorities are the same, the occupation of the node id is small, and when the node priorities are the non-voice service, the occupation of the node id is small.
It should be noted that fig. 5 is a format diagram of a lower-level subnet frame format plan in the embodiment of the present invention, and fig. 6 is a format diagram of a higher-level subnet frame format plan in the embodiment of the present invention, as shown in fig. 5 and fig. 6, a wireless resource of an upper-level subnet and a lower-level subnet is divided into a signaling time slot resource and a service time slot resource, the signaling time slot resource is used for sending networking messages, service resource states and routing signaling, and the service resource is used for transmitting unicast, multicast and broadcast service messages. Fig. 7 is a format diagram of a two-stage frame format plan in the embodiment of the present invention, and as shown in fig. 7, if a node is on an upper subnet, it is scheduled to transmit according to a timeslot resource planned by an upper subnet, and if it is on a lower subnet, it is scheduled to transmit according to a timeslot resource planned by a lower subnet. For the gateway node, the lower subnet signaling time slot and the upper subnet signaling time slot are at different frequency points, and other time slots are common service time slots.
In the frequency division multi-subnet communication system of the embodiment of the invention, the service time slot use condition is marked by four states of idle, self-transmitting, self-receiving and non-receiving; the gateway node coordinates the working time of the gateway node in different subnets by declaring that the gateway node can not receive and transmit time slots, realizes the two-hop external space multiplexing of resources in each subnet, and simultaneously realizes the complete space multiplexing of the resources among the subnets; the common node dynamically applies for transmission resources according to the time slot resource use condition declared by the neighbor node in the two-hop range, and the two-hop external space multiplexing of the transmission resources is realized. The time slot is preempted by the high-priority service in the two-hop range through the declaration and transmission of the time slot state and the node state, and the time delay requirements of various services are met. A method for solving resource conflict in two-hop range through declaration and transmission of time slot state and node state.
The embodiment of the invention provides a distributed dynamic resource allocation method, which is used for a frequency division multi-subnet system and has the following advantages:
(1) The conflict of the same channel resource and the waste of the reusable resources of different channels when the nodes of the network nodes and the nodes of different sub-networks are communicated are avoided.
(2) The spatial multiplexing outside two hops of the transmission resource of the same subnet and the complete spatial multiplexing of the transmission resource of different subnets are realized, the resource distribution efficiency in and among subnets in the frequency division multi-subnet system is improved, and the resource utilization rate of the system is effectively improved.
(3) The nodes in the two-hop range can perform resource preemption according to the service priority, and meet the time delay requirements of different services.
Fig. 8 is a schematic structural diagram of a distributed dynamic resource allocation system according to an embodiment of the present invention, and as shown in fig. 8, the system includes a normal node module 810 and a gateway node module 820, where:
the common node module 810 is configured to dynamically apply for a common node a service resource according to a signaling time slot resource usage of a neighbor node in a two-hop range for a frequency division multiple subnet communication system, and perform service broadcast on a neighbor node of any common node in any subnet, where other nodes except the common node and the neighbor node in any subnet may perform other service resource transmission, thereby implementing two-hop external spatial multiplexing of transmission resources;
the gateway node module 820 is configured to use the signaling time slot resource of any sub-network where the gateway node is located as the signaling time slot resource of the gateway node, and for any gateway node in any sub-network, when the any gateway node communicates with a node of a certain sub-network at a certain service time slot, and when a node where other sub-networks are located communicates with other nodes other than the any gateway node, the service time slot may still be occupied.
This embodiment is a system embodiment corresponding to the above method embodiment, the specific implementation process is the same as the above method embodiment, please refer to the above method embodiment for details, and this system embodiment is not described herein again.
The various modules in the distributed dynamic resource allocation system described above may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
Fig. 9 is a schematic structural diagram of a computer device provided in an embodiment of the present invention, where the computer device may be a server, and an internal structural diagram of the computer device may be as shown in fig. 9. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a computer storage medium and an internal memory. The computer storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the computer storage media. The database of the computer device is used for storing data generated or obtained during execution of a distributed dynamic resource allocation method, such as a frequency division multiple subnet communication system. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a distributed dynamic resource allocation method.
In one embodiment, a computer device is provided, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the steps of one of the distributed dynamic resource allocation methods in the above embodiments are implemented. Alternatively, the processor, when executing the computer program, implements the functions of the modules/units in an embodiment of a distributed dynamic resource allocation system.
In an embodiment, a computer storage medium is provided, on which a computer program is stored, which, when being executed by a processor, implements the steps of a distributed dynamic resource allocation method in the above embodiments. Alternatively, the computer program, when executed by a processor, implements the functionality of the modules/units in the embodiment of a distributed dynamic resource allocation system as described above.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), rambus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.
The above-mentioned embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not substantially depart from the spirit and scope of the embodiments of the present invention, and are intended to be included within the scope of the present invention.
Claims (9)
1. A distributed dynamic resource allocation method, comprising:
for a frequency division multi-subnet communication system, dynamically applying for a common node for service resources according to the signaling time slot resource use condition of a neighbor node in a two-hop range, and for any common node of any subnet, performing service broadcast on the neighbor node of any common node, wherein other nodes except the common node and the neighbor node in any subnet can perform other service resource transmission, thereby realizing two-hop external spatial multiplexing of transmission resources;
according to the signaling time slot resource of any subnet in which the gateway node is located, as the signaling time slot resource of the gateway node, for any gateway node in any subnet, when any gateway node communicates with a node of a certain subnet in a certain service time slot, the service time slot can still be occupied when nodes in other subnets communicate with other nodes outside any gateway node.
2. The distributed dynamic resource allocation method of claim 1, further comprising:
after receiving the service resource status message, any common node or any gateway node maintains a local service resource table according to the service resource usage information in the service resource status message, and waits for the sending opportunity of the service resource status message;
recording the applied resources to a local service resource table, diffusing the occupation information to any common node or a neighbor node of any gateway node through service resource state information, and periodically informing the neighbor nodes of the resource use conditions of the node and a one-hop neighbor node by all the nodes;
and when the service resource state message sending time of any common node or any gateway node arrives, immediately organizing the service resource state message to send out.
3. The distributed dynamic resource allocation method of claim 2, wherein said traffic resources comprise real-time traffic resources and non-real-time traffic resources, and wherein said real-time traffic resources have a higher priority than said non-real-time traffic resources.
4. The distributed dynamic resource allocation method of claim 3, further comprising:
if any common node or any gateway node receives a plurality of service resources at the same time, the service resources with high priority occupy the node preferentially;
for the service resources with the same priority, newly initiating the service resources to allow the node where the original service resources are located to be preempted, finding the conflict of the service resources by processing the service resources sent by the neighbor nodes no matter whether the conflict is a one-hop conflict or a two-hop conflict, reserving one of the service resources according to the conflict resolution criteria of the service resources after finding the conflict, announcing the conflict in the state time slot of the next service resource, and finally informing the two-hop node of the node;
for the service resource conflict inside the subnet, the high priority service is preferentially ensured, and if the priorities are the same, the service with small node ID is preferentially ensured;
and when the service time slots of the sub-networks conflict, the high-priority service is preferentially ensured, and if the priorities are the same, the service transmission of the high-priority sub-networks is preferentially ensured.
5. The distributed dynamic resource allocation method of claim 3, further comprising:
if the node is on the upper subnet, the node is sent according to the time slot resource planning of the upper subnet;
if the node is on the lower subnet, the node is sent according to the time slot resource planning planned by the lower subnet, for the gateway node, the signaling time slot of the lower subnet and the signaling time slot of the upper subnet are at different frequency points, and other time slots are all common service time slots.
6. The distributed dynamic resource allocation method according to any one of claims 1 to 5, wherein the signaling timeslot resource usage includes idle, self-transmitting, self-receiving, and no-transceiving, wherein:
the idle state indicates that other nodes can be occupied, and the service resource state does not carry a destination node, priority and whether the node is voice or not;
the self-sending indicates that the node is occupying the time slot, the service resource state carries a target node, priority and whether the node is voice, and other nodes or the node can apply for occupation only when the service/node priority is higher than that of the node;
the self-receiving indicates that the node is receiving the services of other nodes, the service resource state carries a source node and priority, whether the node is a voice or not, and the node and the neighbor nodes can apply for occupation only when the service/node priority is higher than that of the node;
the non-transceivable means that it is used only when the cross-network node is used to advertise the traffic slot status of another sub-network.
7. A distributed dynamic resource allocation system, comprising:
the common node module is used for dynamically applying service resources for a common node according to the signaling time slot resource use condition of a neighbor node in a two-hop range for a frequency division multi-subnet communication system, and for any common node of any subnet, performing service broadcast on the neighbor node of any common node, wherein other nodes except the common node and the neighbor node in any subnet can perform other service resource transmission, thereby realizing two-hop external space multiplexing of transmission resources;
and the gateway node module is used for serving as the signaling time slot resource of the gateway node according to the signaling time slot resource of any subnet in which the gateway node is positioned, and for any gateway node in any subnet, when any gateway node communicates with a node of a certain subnet in a certain service time slot and nodes in other subnets communicate with other nodes except the any gateway node, the service time slot can still be occupied.
8. A computer arrangement comprising a memory, a processor and a computer program stored in the memory and executable on the processor, characterized in that the processor implements the steps of the distributed dynamic resource allocation method according to any one of claims 1 to 6 when executing the computer program.
9. A computer storage medium storing a computer program, wherein the computer program, when executed by a processor, performs the steps of the distributed dynamic resource allocation method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210809535.8A CN115190629A (en) | 2022-07-11 | 2022-07-11 | Distributed dynamic resource allocation method, system, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210809535.8A CN115190629A (en) | 2022-07-11 | 2022-07-11 | Distributed dynamic resource allocation method, system, device and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115190629A true CN115190629A (en) | 2022-10-14 |
Family
ID=83517553
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210809535.8A Pending CN115190629A (en) | 2022-07-11 | 2022-07-11 | Distributed dynamic resource allocation method, system, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115190629A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024103463A1 (en) * | 2022-11-18 | 2024-05-23 | 深圳先进技术研究院 | Elastic deep learning job scheduling method and system, and computer device |
-
2022
- 2022-07-11 CN CN202210809535.8A patent/CN115190629A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024103463A1 (en) * | 2022-11-18 | 2024-05-23 | 深圳先进技术研究院 | Elastic deep learning job scheduling method and system, and computer device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | A scalable CSMA and self-organizing TDMA MAC for IEEE 802.11 p/1609. x in VANETs | |
| US7936709B2 (en) | Distributed beacon enabled wireless networks | |
| JP5427232B2 (en) | MAC protocol for multi-channel wireless networks | |
| US20020167960A1 (en) | System and method for transmission scheduling using network membership information and neighborhood information | |
| US20120044827A1 (en) | Communication method and apparatus in mobile ad-hoc network | |
| CN110809324B (en) | MAC transmission method based on distributed TDMA and wireless self-organizing network system | |
| EP1856548A2 (en) | Qos management in wireless mesh networks | |
| CN110049562B (en) | LoRaWAN (local area network) Internet of things supporting TDMA (time division multiple Access) access | |
| Wu et al. | Joint multi-radio multi-channel assignment, scheduling, and routing in wireless mesh networks | |
| CN106793128A (en) | A kind of channel wireless radio multi Mesh network TDMA resource allocation methods | |
| IL174895A (en) | Method and device for determining routings and for allocating radio resources for the determined routings in a radio communications system | |
| KR20030059068A (en) | Network with prioritized transmission between sub-networks, method and controller for controlling such a network | |
| CN108200652B (en) | Communication method and device applied to unmanned aerial vehicle cluster | |
| CN112217728A (en) | Satellite channel hybrid access method based on pre-allocation and on-demand reservation | |
| Lin et al. | A dynamic slot assignment algorithm of TDMA for the distribution class protocol using node neighborhood information | |
| CN115190629A (en) | Distributed dynamic resource allocation method, system, device and storage medium | |
| KR20110076259A (en) | Frequency diversity based mac architecture for wireless sensor network, and operating method for the same | |
| CN114449589A (en) | Time slot resource reservation system and method | |
| CN111194088B (en) | Dynamic time slot allocation method for mobile network based on subnet division | |
| EP1371183A1 (en) | System and method for transmission scheduling using network membership information and neighborhood information | |
| EP4106459A1 (en) | On demand data delivery in a wireless network | |
| CN116131927A (en) | Multi-hop TDMA time slot allocation method suitable for unmanned aerial vehicle ad hoc network | |
| CN111491320B (en) | Network resource processing method and device and electronic equipment | |
| CN115002844A (en) | Method and system for realizing resource reservation based on dynamic TDMA (time division multiple address) resource allocation ad hoc network | |
| CN112469061B (en) | Application method, device, equipment and storage medium of network resources |
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 |