CN111836370A - Resource reservation method and equipment based on competition - Google Patents

Resource reservation method and equipment based on competition Download PDF

Info

Publication number
CN111836370A
CN111836370A CN201910310193.3A CN201910310193A CN111836370A CN 111836370 A CN111836370 A CN 111836370A CN 201910310193 A CN201910310193 A CN 201910310193A CN 111836370 A CN111836370 A CN 111836370A
Authority
CN
China
Prior art keywords
time slot
priority
transmitted
service data
micro
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.)
Granted
Application number
CN201910310193.3A
Other languages
Chinese (zh)
Other versions
CN111836370B (en
Inventor
李忠孝
刘刚
王丹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Datang Mobile Communications Equipment Co Ltd
Original Assignee
Telecommunications Science and Technology Research Institute Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Telecommunications Science and Technology Research Institute Co Ltd filed Critical Telecommunications Science and Technology Research Institute Co Ltd
Priority to CN201910310193.3A priority Critical patent/CN111836370B/en
Publication of CN111836370A publication Critical patent/CN111836370A/en
Application granted granted Critical
Publication of CN111836370B publication Critical patent/CN111836370B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • 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/50—Allocation or scheduling criteria for wireless resources
    • H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure

Abstract

The invention provides a resource reservation method and equipment based on competition, which are used for solving the problems of limited network capacity and single supported service type caused by limited quantity of control channel resources in a synchronous ad hoc network technology. The first node reserves an idle time slot in a service transmission period of a transmission scheduling cycle for service data to be transmitted according to the time slot state table; and determining a time slot for resource reservation in a reservation control period in a transmission scheduling period, monitoring whether the time slot is occupied in a first micro-time slot in the determined time slot, wherein the length of the first micro-time slot is matched with the priority of the service data to be transmitted, determining that the time slot is not occupied, and transmitting reservation control information for indicating an idle time slot in a service transmission period for reserving the transmission scheduling period for the service data to be transmitted in a second micro-time slot in the time slot for resource reservation. The problem of service distributed source scheduling is solved through a random reservation mechanism for differentiating priority, and the network capacity is flexibly expanded.

Description

Resource reservation method and equipment based on competition
Technical Field
The present invention relates to the field of wireless communication technologies, and in particular, to a resource reservation method and device based on contention.
Background
The wireless ad hoc network has the characteristics of no center, self-organization, distributed control, node movement, multi-hop and the like, no central control entity performs global resource management and distribution, and a distributed channel access protocol suitable for the ad hoc network needs to be specially designed. The Access protocol of the ad hoc network MAC (Medium Access Control) is related to the indexes such as high efficiency, fairness of Service (QoS) guarantee, power validity, etc. that must be satisfied to the maximum extent on a limited channel according to the network particularity and the supported Service type.
With the diversification of ad hoc network services, a time slot resource allocation method based on a synchronization mechanism and dynamic reservation becomes a mainstream access method for guaranteeing the service quality and improving the service transmission efficiency of the ad hoc network. The QoS guarantee mechanism based on the reservation access can solve the problems that the service with high real-time requirement can quickly obtain the channel use right and avoid overlarge time delay jitter. Since the channel usage right is usually obtained by a distributed method, the access speed of the service depends not only on the node itself, but also on the number of its adjacent nodes, the traffic volume and the service priority.
The HR-TDMA (Hybrid Reservation-Time Division Multiple Access) protocol is a typical Reservation Access protocol of a synchronous ad hoc network, and adopts a fixed allocation strategy, and each node corresponds to its control channel one to one, so that the resource Reservation of the control channel corresponds to the network capacity. Because the number of control channel resources is limited in each transmission scheduling period, the number of users that the network can accommodate is limited, which greatly affects the service quality of the users on the network.
In summary, in the access control technology of the ad hoc network in the prior art, due to the limited amount of control channel resources, flexible expansion of network capacity is limited, and QoS service requests cannot be effectively supported.
Disclosure of Invention
The invention provides a resource reservation method and equipment based on competition, which are used for solving the problems of limited network capacity and single supported service type caused by limited control channel resource quantity in the synchronous ad hoc network technology in the prior art.
In a first aspect, an embodiment of the present invention provides a resource reservation method based on contention, where the method includes:
the first node reserves an idle time slot in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to a time slot state table;
the first node determines a first time slot of a reservation control period of the first transmission scheduling cycle, monitors whether the first time slot is occupied in a first micro time slot of the first time slot, and sends reservation control information in a second micro time slot of the first time slot if the first time slot is not occupied, wherein the reservation control information is used for indicating that the idle time slot in a service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
According to the method, when the first node detects that the first time slot is not occupied in the first micro time slot of the first time slot, the reservation control information used for indicating the business data to be transmitted to reserve the idle time slot of the business transmission period in the first scheduling period is sent in the second micro time slot of the first time slot, so that the first node can dynamically reserve the idle time slot for the data to be transmitted, the idle time slot can be used by different nodes, the network capacity is increased, the system performance is improved, the length of the first micro time slot is determined according to the priority of the business data to be transmitted, the distributed resource scheduling problem of various businesses is solved through a reservation mechanism with different priorities, and the QoS business request is effectively supported.
In a possible implementation manner, if the first time slot is occupied, the first node determines that resource reservation fails in the first time slot, and determines whether the number of resource reservation failures in a reservation control period of the first transmission scheduling cycle reaches a threshold value;
if the second time slot is not reached to the threshold value, the first node determines a second time slot of the reserved control period of the first transmission scheduling cycle, and monitors whether the second time slot is occupied in a first micro time slot in the second time slot, wherein after the first time slot, the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
According to the method, the resource reservation is failed in the first time slot, so that the time slot for resource reservation needs to be determined again, when the time slot for resource reservation is determined again, the resource reservation is determined according to the frequency of resource reservation failure of the first node in the reservation control time period of the first scheduling cycle, when the frequency of resource reservation failure does not reach the threshold value, the first node determines the second time slot of the reservation control time period of the first scheduling cycle, and monitors whether the second time slot is occupied in the first micro-time slot of the second time slot, and the second time slot is behind the first time slot, so that the success rate of resource reservation can be improved.
In a possible implementation manner, the first node determines, according to the priority of the service data to be transmitted, a position of the second time slot in a reservation control period of the first transmission scheduling cycle; if the service data to be transmitted is of a first priority, the position of the second time slot is a first position, and if the service data to be transmitted is of a second priority, the position of the second time slot is a second position, the first priority is higher than the second priority, and the first position is before the second position.
According to the method, the first node determines the position of the second time slot in the reserved control period of the first transmission scheduling period according to the priority of the service data to be transmitted, and the higher the priority of the service data to be transmitted is, the more front the position of the second time slot in the reserved control period of the first transmission scheduling period is, so that the higher the priority of the service data to be transmitted is, the higher the probability that the resource reservation of the node corresponding to the service data to be transmitted is successful is, and the priority access and QoS service of the high-priority service are ensured.
In a possible implementation manner, when the first node determines, according to the priority of the service data to be transmitted, a position of the second time slot within a reservation control period of the first transmission scheduling cycle:
the first node determines the value of the time slot offset in a time slot offset set according to the ratio between the priority sequence number and the highest priority sequence number of the service data to be transmitted, wherein the value of the time slot offset in the time slot offset set is equal to or smaller than the ratio; the sequence number of the priority is increased progressively according to the sequence from low to high;
and the first node randomly selects a time slot offset from the time slot offset set and determines the position of the second time slot according to the first time slot and the time slot offset.
The method includes the steps that a specific scheme that the position of a second time slot in a reserved control period of a first transmission scheduling period is determined according to the priority of service data to be transmitted is given, a time slot offset set is determined according to the proportional relation between the priority of the service data to be transmitted and the highest priority, then the second time slot is determined according to a time slot offset which is selected from the time slot offset set and the first time slot, the number of the time slot offsets in the time slot offset set is reduced along with the increase of the priority, the higher the priority of the service to be transmitted is, the smaller the time slot offset is, the priority can be entered preferentially, and meanwhile the time slot offset can be determined to reduce conflicts among nodes when competitive resources are reserved.
In a possible implementation manner, if the first time slot is occupied, the first node determines that resource reservation fails in the first time slot, and determines whether the number of resource reservation failures in a reservation control period of the first transmission scheduling cycle reaches a threshold value;
if the threshold value is reached, the first node monitors whether a third time slot is occupied in a first micro time slot of the third time slot in a third time slot of a service transmission period of a second transmission scheduling cycle, and the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
In the method, the resource reservation failure times of the first node in the reservation control period of the first transmission scheduling period reach the threshold value, the third time slot is determined in the reservation control period of the second scheduling period, whether the third time slot is occupied or not is monitored in the first micro-time slot in the third time slot, and the second scheduling period is behind the first scheduling period, so that the resource reservation success rate is improved.
In a possible implementation manner, the first node determines the length of the first micro-slot according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the length of the first micro-slot is of a first length, and if the service data to be transmitted is of a second priority, the length of the first micro-slot is of a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
In the method, the length of the first micro-slot is determined according to the priority of the service data to be transmitted, the higher the priority of the service data to be transmitted is, the shorter the length of the first micro-slot is, the higher the probability of successful resource reservation is, so that the higher the priority of the service data to be transmitted is, the service transmission slot resources required by service transmission can be reserved preferentially, and the priority access and the QoS quality of a high-priority service are ensured.
In a possible implementation manner, when the first node determines the length of the first micro timeslot according to the priority of the service data to be transmitted:
and the first node determines the length of the first micro-slot according to the inverse relation between the length of the first micro-slot and the priority sequence number of the service data to be transmitted.
The method provides a specific scheme for determining the length of the first micro-slot according to the priority of the service data to be transmitted, and it can be known that when the preset length of the first micro-slot is fixed, the larger the priority of the service data to be transmitted is, the smaller the length of the first micro-slot is, so that the service data to be transmitted with the larger priority can reserve the service transmission slot resources required by service transmission preferentially for preferential access.
In a possible implementation manner, if the first time slot or the second time slot is not occupied, the first node determines that resource reservation is successful in the first time slot or the second time slot, and the first node does not listen to whether other time slots of a reservation control period of the first transmission scheduling cycle are occupied.
In a possible implementation manner, if the third time slot is not occupied, the first node determines that resource reservation is successful in the third time slot, and the first node does not listen to whether other time slots of a reservation control period of the second transmission scheduling cycle are occupied.
In the method, the first node detects that the first time slot or the second time slot is not occupied, and determines that the resource reservation of the first time slot or the second time slot is successful, and the first node does not detect whether other time slots in the control period of the first transmission scheduling period are occupied; the first node senses that the third time slot is not occupied, determines that resource reservation is successful in the third time slot, and the first node does not sense whether other time slots of the reservation control period of the second transmission scheduling period are occupied, namely, the first node transmits the service data to be transmitted in the same transmission scheduling period, so that the data transmission efficiency is improved.
In one possible implementation, after the transmission of the reservation control information in the first slot, the first node updates the slot state table according to reservation control information from at least one second node;
if the first node determines that the time slot indicated by the reservation control information is available according to the updated time slot state table, transmitting the service data to be transmitted on the time slot indicated by the reservation control information; or
If the first node determines that the time slot indicated by the reservation control information is unavailable according to the updated time slot state table, processing the service data to be transmitted according to a configured processing strategy; the processing policy is used for indicating a processing operation when the resource reservation fails.
According to the method, after the first node sends the reservation control information in the first time slot, the first node can update the time slot state table according to the reservation control information from at least one second node, the first node determines that the time slot indicated by the reservation control information is available according to the updated time slot state table, the service data to be transmitted is transmitted in the time slot indicated by the reservation control information, otherwise, the service data to be transmitted is processed according to the configured processing strategy, and the time slot for transmitting the service data to be transmitted by the first node can be dynamically distributed according to a random reservation mechanism, so that the network capacity is increased, and the system performance is improved.
In a second aspect, an embodiment of the present invention provides a contention-based resource reservation apparatus, where the apparatus includes: a processor, a memory, and a transceiver;
the processor is used for reading the program in the memory and executing the following processes:
reserving idle time slots in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to a time slot state table;
determining a first time slot of a reservation control period of the first transmission scheduling cycle, and monitoring whether the first time slot is occupied in a first micro time slot of the first time slot, if the first time slot is not occupied, sending reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating that the idle time slot in the service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
In a third aspect, an embodiment of the present invention provides a contention-based resource reservation apparatus, where the apparatus includes:
the reservation module is used for reserving idle time slots in the service transmission time interval of the first transmission scheduling period for the service data to be transmitted according to the time slot state table;
the monitoring module is used for determining a first time slot of a reservation control period of the first transmission scheduling cycle, monitoring whether the first time slot is occupied in a first micro-time slot of the first time slot, and if the first time slot is not occupied, sending reservation control information in a second micro-time slot of the first time slot, wherein the reservation control information is used for indicating that the idle time slot in a service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
In a fourth aspect, an embodiment of the present invention provides a computer storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the aspect of any one of the first aspect.
In addition, for technical effects brought by any one implementation manner of the second aspect to the fourth aspect, reference may be made to technical effects brought by different implementation manners of the first aspect, and details are not described here.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
FIG. 1 is a diagram illustrating channel division using time division multiple access in the prior art;
fig. 2 is a flowchart illustrating a resource reservation method based on contention according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a timeslot provided in an embodiment of the present invention;
fig. 4 is a schematic structural diagram illustrating a node receiving a service data transmission request in a synchronization period of a transmission scheduling cycle according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram illustrating a node receiving a service data transmission request at any time slot of a reserved control period of a transmission scheduling cycle according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram illustrating a node receiving a service data transmission request in a service transmission period of a transmission scheduling cycle according to an embodiment of the present invention;
fig. 7 is a schematic flowchart of a complete method for contention-based resource reservation according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a contention-based resource reservation apparatus according to an embodiment of the present invention;
fig. 9 is a schematic structural diagram of another contention-based resource reservation apparatus according to an embodiment of the present invention.
Detailed Description
Hereinafter, some terms in the embodiments of the present application are explained to facilitate understanding by those skilled in the art.
(1) In the embodiments of the present application, the terms "network" and "system" are often used interchangeably, but those skilled in the art can understand the meaning.
(2) In the embodiments of the present application, the term "plurality" means two or more, and other terms are similar thereto.
(3) "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
The HR-TDMA (hybrid reservation time division multiple access) protocol is a distributed channel access protocol of a typical ad hoc network, and the channel division of the hybrid reservation time division multiple access protocol includes: superframe (superframe), time frame (frame), and slot (slot) 3-layer frame structure, as shown in fig. 1.
1) The time frame (frame) is a basic scheduling cycle of service transmission, and is divided into 3 periods, namely a synchronization period, a reservation Control period, and a service transmission period.
The synchronization period (synchronization Segment) is used for executing the synchronous maintenance of the ad hoc network and the dynamic update of the service time slot state table; the reservation Control period (Control Segment) is divided into a plurality of time slots and is used for reserving channel resources required by service transmission by using the time slots (slots) as units by the nodes; the Service Segment is used for Service transmission by the node on the reserved Service channel.
In order to minimize the service latency, the frame structure usually adopts a shorter frame length (frame _ length), and the transmission scheduling period (schedule _ cycle) is shortened as much as possible under the constraint of the service transmission efficiency (Throughput).
2) A superframe (superframe) period accommodates a plurality of time frames (frames), and generally, the number of the time frames in a superframe corresponds to the number of nodes (Num _ Users) in the network, which reflects the network capacity of the synchronous ad hoc network, that is: superframe _ length is Num _ Users (number of nodes) frame (time frame).
When a new node accesses the network, it usually needs to last for several (Num _ Scanning) superframe periods, which are expressed as Access _ Delay of the node, that is: access _ Delay (Num _ Scanning) × superframe _ length (superframe length).
3) In order To support transmission resource scheduling for dynamic TDMA, the reservation period (control segment) of each time frame (frame) is typically divided into several time slots for transmission of control signaling (RTS (RequestTo Send, request To Send frame)/CTS (Clear To Send )/ACK (Acknowledged Message)) required by the distributed reservation control algorithm.
In the existing synchronous ad hoc network access control technology (such as HR-TDMA protocol), the number of control channels (Num _ CCHs) of a reserved period corresponds to the maximum number of nodes (Num _ Users) that the network can accommodate, that is: num _ CCHs (control channel number) ═ Num _ Users (maximum node number). The method ensures that each network node has its own dedicated control channel, and can ensure the reliability of the node exchange reservation control signaling. This approach limits the number of nodes that can be accommodated in the network while providing a reliable signaling exchange.
In the existing access control technical scheme of the synchronous ad hoc network, the number of control channels corresponds to the maximum number of nodes that the network can accommodate. While the number of control channels (Num _ CCHs) is limited by the time frame length, the number of nodes (Num _ Users) of the synchronous ad hoc network is also greatly limited. When the number of nodes accessed in the network increases, the existing synchronous ad hoc network access scheme needs to provide an available control channel for a new node through a superframe expansion mechanism. However, this superframe extension mechanism greatly increases the network access delay of new users and the transmission latency of the service plane, and increases the complexity of the access protocol.
Since each node in the network does not transmit service data in real time, the control channel statically allocated to the corresponding node in the transmission scheduling period is in an idle state at a certain time, which wastes limited control channel resources. Therefore, the invention provides a resource reservation method based on the statistical multiplexing idea, which performs limited competition and flexible use on the limited control channel resources and completes the corresponding reservation control process, and solves the problem of distributed channel resource scheduling of multiple services through a priority-differentiated random reservation mechanism in the competition and flexible use process, so that the number of nodes which can be accommodated by a network is not limited by the number of control channels any more, thereby achieving the purposes of improving the capacity of a synchronous ad hoc network and ensuring flexible access and QoS (quality of service) of the services.
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 2, a flowchart of a resource reservation method based on contention according to an embodiment of the present invention includes the following steps:
step 200, the first node reserves an idle time slot in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to a time slot state table;
step 210, the first node determines a first time slot of a reservation control period of the first transmission scheduling cycle, and monitors whether the first time slot is occupied in a first micro-time slot of the first time slot, if the first time slot is not occupied, then sends reservation control information in a second micro-time slot of the first time slot, wherein the reservation control information is used for indicating that the idle time slot in a service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
In the method, a first node reserves an idle time slot in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to a time slot state table; determining a first time slot in a reservation control period of a first transmission scheduling period, monitoring whether the first time slot is occupied in a first micro-time slot of the first time slot, and after determining that the first time slot is unoccupied, sending reservation control information for indicating that the idle time slot in a service transmission period of the first transmission scheduling period is reserved for the service data to be transmitted in a second micro-time slot of the first time slot;
when the first node monitors that the first time slot is not occupied, the first node sends reservation control information used for indicating the business data to be transmitted to reserve the idle time slot of the business transmission time period in the first scheduling period in the first time slot, so that the first node can dynamically reserve the idle time slot for the business data to be transmitted, the idle time slot can be used by different nodes, the network capacity is increased, the system performance is improved, the length of the first micro time slot is determined according to the priority of the business data to be transmitted, the problem of distributed resource scheduling of various businesses is solved through a reservation mechanism for differentiating the priority, and the QoS business request is effectively supported.
The first micro time slot is used for the node to monitor whether the first time slot is occupied or not;
and the second micro-slot is used for the node to send reservation control information for indicating the idle time slot in the service transmission period for reserving the first transmission scheduling period for the service data to be transmitted.
As shown in fig. 3, a superframe includes a plurality of time frames, one time frame includes a synchronization period, a reservation control period, and a service transmission period, the reservation control period of one time frame includes a plurality of time slots, each time slot includes a first micro-slot and a second micro-slot, and a length of the first micro-slot matches with a priority of the service data to be transmitted.
In the embodiment of the invention, each node in the network receives the time slot state table issued by other nodes in the synchronous period of each time frame, and then the locally maintained 2-hop node time slot state table of the node is updated for the time slot reservation decision of the reserved section.
For example, the first node is an in-network node, and the first node receives the timeslot status tables issued by the plurality of second nodes in the synchronization period of each time frame, and then updates the locally maintained 2-hop node timeslot status table.
The time slot state table is the most important data structure when the centerless ad hoc network adopts a distributed time slot reservation algorithm to perform dynamic time slot allocation.
The dynamically maintained time slot state table contains the use state of the adjacent node to the time slot within the 2-hop range of each node, so that the time slot occupied by the adjacent node is avoided when the node performs time slot reservation, and the time slot occupation conflict is avoided.
For example, in the current timeslot state table of the first node, there are 5 timeslots, timeslot a, timeslot B, timeslot C, timeslot D, timeslot E, timeslot a is occupied by the second node 1, timeslot B is occupied by the second node 2, where the first node and the second node 1 are 2-hop nodes, and the first node and the second node 2 are 2-hop nodes. The first node receives a time slot state table issued by the second node 3 in a synchronous period of a time frame, the first node and the second node 3 are 2-hop nodes, a time slot C in the time slot state table issued by the second node 3 is occupied, the first node updates the time slot state table of the first node, the updated time slot state table is that a time slot A is occupied by the second node 1, a time slot B is occupied by the second node 2, the time slot C is occupied by the second node 3, and a time slot D and a time slot E are idle time slots.
After updating the time slot state table, the first node waits for a service data transmission request from a higher layer in each transmission scheduling period, where the higher layer may be an LLC (Logical Link Control) layer, an IP (Internet Protocol) layer, or another higher layer.
It should be noted that, one time frame represents one transmission scheduling period, and the first node is a node that can receive the time slot state tables issued by the plurality of second nodes and maintain the local time slot state table, so in the wireless ad hoc network, any node that can receive the time slot state tables issued by other nodes in the wireless ad hoc network and maintain its own time slot state table can be used as the first node, and the other nodes are the second nodes.
If the first node does not wait for the transmission of the service data sent by the high layer, the node skips the reservation control time period of the time frame, only receives the reservation request information of the second node, and updates the time slot state table; or
If the first node determines that at least one data transmission request from a high layer exists, the data transmission requests are sequenced according to priority information carried in the data transmission requests and from low to high, and a priority sequence number corresponding to the data transmission requests is determined;
for example, the first node determines that there are 3 data transfer requests A, B, C from higher layers; the data transmission request C has the highest priority, the data transmission request a has the second priority, and the data transmission request B has the lowest priority, and the data transmission requests are ranked according to the data with the priorities from low to high, and then: the data transmission system comprises a data transmission request B, a data transmission request A and a data transmission request C, so that the priority sequence number of the data transmission request B is 1, the priority sequence number of the data transmission request A is 2 and the priority sequence number of the data transmission request C is 3.
After the first node determines that a data transmission request from a high layer exists, reserving idle time slots of a service transmission period in a first transmission scheduling period for service data to be transmitted in the data transmission request according to a current time slot state table (namely the time slot state table obtained by updating a self time slot state table of the first node according to a time slot state table issued by at least one second node in a synchronous period of the transmission scheduling period);
for example, in the current timeslot state table of the first node, there are 5 timeslots, timeslot a, timeslot B, timeslot C, timeslot D, timeslot E, timeslot a is occupied by the second node 1, timeslot B is occupied by the second node 2, where the first node and the second node 1 are 2-hop nodes, and the first node and the second node 2 are 2-hop nodes. When the first node reserves an idle time slot of a service transmission period in a transmission scheduling period for the service data to be transmitted according to the time slot state table, the first node may select from the time slot C, the time slot D, and the time slot E, where a specific selection manner may be random selection, or may select the idle time slot through a certain algorithm, or may select the idle time slot through other manners, and the specific invention is not limited.
After the first node reserves the idle time slot of the service transmission period in the first transmission scheduling period for the service data to be transmitted according to the time slot state table, the first node determines the first time slot of the reserved control period of the first transmission scheduling period.
In this embodiment of the present invention, the first transmission scheduling period and the first time slot may be determined according to a location where the first node receives a service data transmission request sent by a higher layer. The first node may receive a service data transmission request sent by a higher layer at any position, where the received service data transmission request has a different position, and the determined first transmission scheduling period is different from the first time slot.
The first node can receive a service data transmission request sent by a higher layer in a synchronization period, a reservation control period and a service transmission period in a transmission scheduling cycle. These three cases will be described separately below.
The first condition is as follows: and receiving a service data transmission request sent by a higher layer in the synchronous period of the transmission scheduling cycle.
And the first node receives a service data transmission request sent by a high layer in the synchronous period of the transmission scheduling period, takes the transmission scheduling period for receiving the service data transmission request as a first transmission scheduling period, and takes the first time slot of the reservation control period of the transmission scheduling period as a first time slot.
As shown in fig. 4, there are a transmission scheduling cycle 1 and a transmission scheduling cycle 2, there are a time slot a, a time slot B, a time slot C, a time slot D, and a time slot E in the reservation control period of the transmission scheduling cycle 1, and when a node receives a service data transmission request sent by a higher layer in the synchronization period of the transmission scheduling cycle 1, the node uses the transmission scheduling cycle 1 as a first transmission scheduling cycle and uses the time slot a as a first time slot.
Case two: and receiving a service data transmission request sent by a higher layer in a reserved control period of a transmission scheduling cycle.
And the first node receives the service data transmission request sent by the higher layer at any time slot in the reserved control period of the transmission scheduling period, the transmission scheduling period for receiving the service data transmission request is taken as a first transmission scheduling period, and the time slot of the reserved control period of the transmission scheduling period for receiving the service data transmission request is taken as a first time slot.
As shown in fig. 5, there are a transmission scheduling cycle 1 and a transmission scheduling cycle 2, there are a time slot a, a time slot B, a time slot C, a time slot D, and a time slot E in the reservation control period of the transmission scheduling cycle 1, and the first node receives a service data transmission request sent by a higher layer in the time slot C of the reservation control period of the transmission scheduling cycle 1, then takes the transmission scheduling cycle 1 as the first transmission scheduling cycle, and takes the time slot C as the first time slot.
Case three: and receiving a service data transmission request sent by a higher layer in a service transmission period of a transmission scheduling cycle.
And the first node receives a service data transmission request sent by a higher layer in a service transmission period of a transmission scheduling cycle, takes a transmission scheduling cycle next to the transmission scheduling cycle receiving the service data transmission request as a first transmission scheduling cycle, and takes a first time slot of a reserved control period in the transmission scheduling cycle next to the transmission scheduling cycle receiving the service data transmission request as a first time slot.
As shown in fig. 6, there are a transmission scheduling cycle 1 and a transmission scheduling cycle 2, where the transmission scheduling cycle 1 is adjacent to the transmission scheduling cycle 2, and after the transmission scheduling cycle 1 in the transmission scheduling cycle 2, there are a time slot a, a time slot B, a time slot C, a time slot D, and a time slot E in the reservation control period of the transmission scheduling cycle 2, and the first node receives a service data transmission request sent by a higher layer in the service transmission period of the transmission scheduling cycle 1, then takes the transmission scheduling cycle 2 as the first transmission scheduling cycle, and takes the time slot a in the reservation control period of the transmission scheduling cycle 2 as the first time slot.
After determining a first time slot of a reserved control period of a first scheduling cycle, a first node monitors whether the first time slot is occupied in a first micro time slot in the first time slot;
the first embodiment is as follows: the first time slot is unoccupied.
And if the first time slot is not occupied, indicating that the resource reservation of the first node in the first time slot is successful, and sending reservation control information in a second micro-time slot of the first time slot, wherein the reservation control information is used for indicating that the idle time slot in the service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted.
After the first time slot transmits the reservation control information, the first node updates the time slot state table according to the reservation control information from at least one second node;
in the embodiment of the present invention, the first node broadcasts the reservation control information, receives the reservation control information of at least one second node, determines a time slot occupied by the second node according to the received reservation control information of the at least one second node, and updates the time slot state table again;
for example, in the slot state table of the first node, there are 5 slots, slot a, slot B, slot C, slot D, and slot E, where slot a is occupied by the second node 1, slot B is occupied by the second node 2, and slot C, slot D, and slot E are idle slots;
and receiving reservation control information of the second node 3, determining that the second node 3 occupies the time slot C, updating the time slot state table at the moment, and determining that the time slot D and the time slot E are idle time slots.
It should be noted that, in this embodiment of the present invention, after the first node broadcasts the reservation control information, the first node receives a slot state table issued by at least one second node, and updates the slot state table according to the slot state table issued by the second node.
After updating the time slot state table according to reservation control information from at least one second node, determining whether a time slot indicated by the reservation control information is available according to the updated time slot state table;
wherein, whether the slot indicated by the reservation control information sent by the first node is available or not refers to: whether the time slot indicated by the reservation control information is occupied by a second node or not, and if the time slot indicated by the reservation control information is occupied by the second node, determining that the time slot indicated by the reservation control information is unavailable; or
And if the second node is not occupied, determining that the time slot indicated by the reservation control information is available.
For example, in the slot state table of the first node, there are 5 slots, slot a, slot B, slot C, slot D, and slot E, where slot a is occupied by the second node 1, slot B is occupied by the second node 2, slot C, slot D, and slot E are idle slots, and an idle slot in the service transmission period of the first transmission scheduling cycle reserved for the service data to be transmitted is slot C (that is, the slot indicated by the reservation control information is slot C); receiving reservation control information of the second node 3, and determining that the second node 3 occupies a time slot C; at this time, the time slot C indicated by the reservation control information is occupied by the second node 3, and it is determined that the time slot indicated by the reservation control information is not available.
If the first node determines that the time slot indicated by the reservation control information is available according to the updated time slot state table, transmitting the service data to be transmitted on the time slot indicated by the reservation control information; or
If the first node determines that the time slot indicated by the reservation control information is unavailable according to the updated time slot state table, processing the service data to be transmitted according to a configured processing strategy; the processing policy is used for indicating a processing operation when the resource reservation fails.
The processing strategy is determined according to the requirement characteristic of the service data to be transmitted, and the processing operation indicated by the processing strategy comprises the following steps: discard, reserve, retransmit, etc.
In this embodiment of the present invention, when the first time slot is unoccupied, the first node determines that resource reservation is successful in the first time slot, and the first node no longer listens to whether another time slot of a reservation control period of the first transmission scheduling cycle is occupied.
That is, after determining that the first time slot is unoccupied, the first node does not continue to determine the second time slot in the reservation control period of the first transmission scheduling cycle, and does not perform a process of monitoring whether the second time slot is occupied.
Example two: the first time slot is occupied.
And if the first time slot is occupied, the first node determines that the resource reservation fails in the first time slot, and judges whether the number of times of resource reservation failure in the reservation control time period of the first transmission scheduling cycle reaches a threshold value.
The first condition is as follows: the number of reservation failures in the reservation control period of the first transmission scheduling cycle does not reach a threshold.
After determining that the number of times of reservation failure in the reservation control period of the first transmission scheduling cycle does not reach a threshold value, the first node determines a second time slot in the reservation control period of the first transmission scheduling cycle, and monitors whether the second time slot is occupied in a first micro-time slot in the second time slot, wherein the length of the first micro-time slot of the second time slot is matched with the priority of the service data to be transmitted after the first time slot of the second time slot.
For example, if the resource reservation of the first node in the time slot a of the reservation control period in the first transmission scheduling cycle fails, the first node determines that the number of times of resource reservation failure in the reservation control period in the first transmission scheduling cycle is 1 and the threshold is 3, and the first node determines that the number of times of resource reservation failure in the first transmission scheduling cycle does not reach the threshold, the first node re-determines a time slot (i.e., a second time slot) in the reservation control period in the first transmission scheduling cycle and monitors whether the second time slot is available in the first micro-slot of the second time slot, where the second time slot is before the first time slot.
In the embodiment of the present invention, when the first node determines the second time slot in the reservation control period of the first transmission scheduling cycle, the position of the second time slot in the reservation control period of the first transmission scheduling cycle is determined according to the priority of the service data to be transmitted;
when the first node determines the position of the second time slot in the reserved control period of the first transmission scheduling cycle according to the priority of the service data to be transmitted:
the first node determines the value of the time slot offset in a time slot offset set according to the ratio between the priority sequence number and the highest priority sequence number of the service data to be transmitted, wherein the value of the time slot offset in the time slot offset set is equal to or smaller than the ratio; the sequence number of the priority is increased progressively according to the sequence from low to high;
and the first node randomly selects a time slot offset from the time slot offset set and determines the position of the second time slot according to the first time slot and the time slot offset.
For example, the first node determines that there are 20 service data transmission requests, sorts the service data corresponding to the service data transmission requests according to priority information carried in the 20 service data transmission requests from high to low, where the lowest priority is ranked at the first position, the corresponding priority sequence number is 1, the highest priority is ranked at the last position, and the corresponding priority sequence number is 20, and if it is determined that the service data to be transmitted is ranked at the 4 th position, the priority sequence number of the service data to be transmitted is determined to be 4;
when determining the value of the timeslot offset in the timeslot offset set, taking a positive integer less than or equal to the ratio between the highest priority sequence number and the priority sequence number corresponding to the service data to be transmitted as the timeslot offset in the timeslot offset set, that is, the priority sequence number corresponding to the service data to be transmitted is 4, and the highest priority sequence number is 20, where the timeslot offset in the timeslot offset set includes 1, 2, 3, 4, and 5; at this time, a slot offset 3 is randomly selected from the slot offset set, and at this time, the second slot is a third slot after the first slot, for example, the first slot is a first slot in the reservation control period, and the second slot is a fourth slot in the reservation control period.
If the priority serial number of the service data to be transmitted is 10 and the highest priority serial number is 20, at this time, the timeslot offset in the timeslot offset set comprises 1 and 2; the randomly selected time slot offset is 1, and if the first time slot is still the first time slot in the reserved control time period, the second time slot is the second time slot in the reserved control time period;
therefore, if the service data to be transmitted is of the first priority, the position of the second time slot is the first position, and if the service data to be transmitted is of the second priority, the position of the second time slot is the second position, the first priority is higher than the second priority, and the first position is before the second position.
In the implementation, a backoff algorithm of service data priority is adopted for coordinating continuous competition collision probability among services of different levels, when resource reservation fails in a time slot of a reservation control period of a service transmission scheduling period and the number of failures reaches a threshold value, a time slot offset set is determined according to a priority sequence number of the service data to be transmitted, time slot offset is randomly selected in the time slot offset set, a second time slot is further determined according to the time slot offset, whether the second time slot is occupied or not is continuously monitored on the second time slot to determine the success/failure of resource reservation, and the collision probability is reduced; meanwhile, the time slot offset set of the high-priority service is small, so that the high-priority service has higher contention probability and ensures the priority access and the service quality of the high-priority service.
In this embodiment of the present invention, when the second time slot is unoccupied, the first node determines that resource reservation is successful in the second time slot, and the first node no longer monitors whether other time slots in a reservation control period of the first transmission scheduling cycle are occupied; after determining that the second time slot is unoccupied, the first node does not continue to determine other time slots in the reservation control period of the first transmission scheduling cycle and does not execute the process of monitoring whether other time slots are occupied; or
And when the second time slot is occupied, the first node determines that the number of times of resource reservation failure is increased by one, and re-reserves the time slot for sending the reservation control information according to whether the number of times of resource reservation failure reaches a threshold value, if not, determines the time slot for reserving sending the reservation control information in the reservation control period of the first transmission scheduling period, after the second time slot, continuously monitors whether the time slot is occupied in the determined time slot, otherwise, determines the time slot for reserving sending the reservation control information in the reservation control period of the second transmission scheduling period, and executes the monitoring process.
Case two: the number of reservation failures within a reservation control period of the first transmission scheduling cycle reaches a threshold.
If the threshold value is reached, the first node monitors whether a third time slot is occupied in a first micro time slot of the third time slot in a third time slot of a service transmission period of a second transmission scheduling cycle, and the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
The first node determines that the number of times of reservation failure reaches the threshold value in the first transmission scheduling cycle, and the first node does not reserve a time slot for transmitting the reservation control information in the reservation control period of the first transmission scheduling cycle, but reserves a time slot for transmitting the reservation control information in a transmission scheduling cycle (referred to as a second transmission scheduling cycle herein) subsequent to the first transmission scheduling cycle. To reduce the delay, the second transmission scheduling period may be a next transmission scheduling period adjacent to the first transmission scheduling period.
When the first node determines the time slot for sending the reservation control information in the second scheduling cycle, in order to reduce the time delay, a first time slot (namely, a third time slot) in the reservation control period of the second scheduling cycle may be selected, after the third time slot is determined, the first node monitors whether the third time slot is occupied in the third time slot, if the third time slot is not occupied, the resource reservation is successful in the third time slot, and the third time slot is used as the time slot for transmitting the reservation control information; if the third time slot is detected to be occupied, the resource reservation in the third time slot fails, and other time slots are selected in the reservation control period of the second transmission scheduling period by adopting the method for determining the second time slot.
For example, if the resource reservation of the first node in the time slot a of the reservation control period in the first transmission scheduling cycle fails, the first node determines that the number of times of resource reservation failure in the reservation control period in the first transmission scheduling cycle is 3 and the threshold is 3, and the number of times of resource reservation failure in the first transmission scheduling cycle reaches the threshold, the first node re-determines a time slot (i.e., a third time slot in the reservation control period in the second transmission scheduling cycle) in the reservation control period in the next transmission scheduling cycle adjacent to the first transmission scheduling cycle, and monitors whether the third time slot is available in the first micro-slot of the third time slot.
In the embodiment of the present invention, if the first node detects that the third time slot is not occupied, it indicates that the resource reservation in the third time slot is successful, and in order to improve the reliability of data transmission, the first node does not detect whether other time slots in the reservation control period of the transmission scheduling cycle (i.e., the second transmission scheduling cycle) in which the third time slot is located are occupied.
In the embodiment of the present invention, whether the first timeslot is occupied is sensed in the first micro-timeslot of the first timeslot, whether the second timeslot is occupied is sensed in the first micro-timeslot of the second timeslot, or whether the third timeslot is occupied is sensed in the first micro-timeslot of the third timeslot, whether the timeslot is occupied may be determined in a carrier sense manner, if the carrier can be sensed in the first micro-timeslot, the timeslot is occupied, and if the carrier cannot be sensed in the first micro-timeslot, the timeslot is unoccupied.
It should be noted that, in order to avoid misjudgment caused by the simultaneous monitoring of the same time slot by multiple nodes, when the carrier sensing is performed on the time slot, the sensing duration for sensing the time slot by each node may be different, that is, the length of the first micro time slot is different.
For example, the first node listens for 0.5ms in the first micro slot of the slot a, the second node listens for 0.4ms in the first micro slot of the slot a, if the first node and the second node listen for 0.4ms in the first micro slot of the slot a at the same time and the slot a is occupied, the second node occupies the slot a if it is determined that the slot a is unoccupied, and at this time, the first node also needs to listen for 0.1ms, and it is determined that the slot a is occupied, and the first node does not use the slot a any more.
If the first node and the second node have the same listening time length in the first micro-slot of the time slot A, both the first node and the second node are 0.4ms, when the first node and the second node listen in the first micro-slot of the time slot A, if the time slot A is unoccupied, the first node and the second node listen for 0.4ms at the same time, and both the first node and the second node determine that the time slot A is unoccupied, if both the first node and the second node use the time slot A, misjudgment of listening can be caused, and the first node and the second node generate conflict. Therefore, the interception duration of the first node and the second node in the first micro time slot is different, and misjudgment caused by simultaneous interception of the first node and the second node can be avoided.
Therefore, the lengths of the first micro time slot and the second micro time slot are not fixed, and random jitter with a certain time length is attached, so that the carrier sense can distinguish the occupation state of the current time slot, and the time slot contention conflict is avoided to the maximum extent.
The length of the first micro-slot is matched with the priority of the service data to be transmitted in the data transmission request of the node from the high layer, the higher the priority of the service data to be transmitted is, the shorter the length of the first micro-slot is, the higher the competition level of the corresponding node for time slot contention is, so that the time slot contention probability of the high-priority service is improved, and the time slot resource is reserved for service transmission preferentially.
In the embodiment of the present invention, the length of the first micro timeslot is determined by the first node according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the length of the first micro-slot is of a first length, and if the service data to be transmitted is of a second priority, the length of the first micro-slot is of a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
When the first node determines the length of the first micro time slot according to the priority of the service data to be transmitted: and the first node determines the length of the first micro-time slot according to the inverse relation between the length of the first micro-time slot and the priority sequence number of the service data to be transmitted.
The length of the first minislot is determined primarily by the following equation:
Figure BDA0002031197360000211
wherein CS _ Jitter represents the length of the first micro-slot, k represents the priority sequence number of the service data to be transmitted, and WtThe length of a preset first micro time slot is t, the length of the time slot in the transmission scheduling period is represented by t, each time slot is divided into a first micro time slot and a second micro time slot, and the length of the time slot in the transmission scheduling period is constant;
according to the property of negative exponential distribution, the expected length of the first micro time slot corresponding to the service data to be transmitted is as follows:
E(CS_Jitter)＝Wt/k
e (CS _ Jitter) is the expected length of a first micro-slot corresponding to the service data to be transmitted; wtIs a preset first micro time slot length; k is the priority sequence number of the service data to be transmitted, and the priorities of the service data to be transmitted are arranged from low to high.
Wherein, WtThe length of the first micro-slot corresponding to the service data to be transmitted with the lowest priority may be defined, and the length of the first micro-slot corresponding to the service data to be transmitted with the highest priority may also be defined, specifically, the length of the preset first micro-slot is not specifically limited.
According to the above formula, when WtWhen the value is constant, the larger k is, the smaller E (CS _ Jitter) is, and according to the property of negative exponential distribution, the smaller E (CS _ Jitter) is and the smaller CS _ Jitter are when t is consistent;
that is, the higher the priority of the service data to be transmitted, the smaller the length of the first micro-slot, the shorter the time for carrying out carrier sensing, and when it is determined that the time slot is not occupied, the higher the priority of the service data to be transmitted, the service data to be transmitted can reserve the service transmission time slot resource required by service transmission preferentially.
In this embodiment of the present invention, when the first node determines the length of the first micro timeslot according to the priority of the service data to be transmitted: first, determining a first proportion of a first priority difference value to a second priority difference value; the first priority difference is the difference of the priority of the service data to be transmitted minus the highest priority, and the second priority difference is the difference of the lowest priority minus the priority of the service data to be transmitted;
further, the length of the first micro time slot is determined according to the first proportion, so that a second proportion of the difference value of the lengths of the first micro time slot and the difference value of the second micro time slot is matched with the first proportion; the first micro time slot difference is the difference of the minimum value of the first micro time slot length minus the micro time slot interception length, and the second micro time slot difference is the difference of the first micro time slot length before the maximum length of the first micro time slot; if the priority of the service data to be transmitted is equal to the highest priority, the length of the first micro time slot is equal to the minimum value of the length of the first micro time slot; and if the priority of the service data to be transmitted is equal to the lowest priority, the length of the first micro time slot is equal to the maximum value of the length of the first micro time slot.
In the embodiment of the present invention, the first micro timeslot may also be determined in other manners according to the priority of the service data to be transmitted, as long as the inverse relationship between the length of the first micro timeslot and the priority sequence number of the service data to be transmitted is satisfied, for example, the length of the first micro timeslot is determined in manners such as gaussian distribution and laplace distribution.
It should be noted that, in the embodiment of the present invention, it may also be further configured to monitor whether a time slot of a reserved control period in a transmission scheduling period is occupied according to a received service data transmission request from a higher layer, reserve an idle time slot of a service transmission period in a first transmission scheduling period for service data to be transmitted according to a time slot state table after determining that the time slot is unoccupied, and send reservation control information for instructing to reserve the idle time slot of the service transmission period in the first transmission scheduling period for the service data to be transmitted at the time slot.
As shown in fig. 7, a flowchart of an overall resource reservation method based on contention according to an embodiment of the present invention specifically includes the following steps:
step 700, a first node receives a time slot state table issued by at least one second node in a synchronous period of each frame;
step 701, the first node updates a locally maintained 2-hop node time slot state table according to the received time slot state table;
step 702, the first node determines whether there is a service data transmission request from a high layer in each transmission scheduling period, if so, step 703 is executed, otherwise, step 710 is executed;
703, the first node determines a time slot of a reserved control time interval in a transmission scheduling period according to the position of the received service data transmission request;
step 704, the first node monitors the time slot of the reserved control time interval in the first micro-time slot of the time slot;
step 705, the first node judges whether the time slot of the reserved control time period is occupied, if not, step 706 is executed, otherwise, step 707 is executed;
step 706, the first node successfully reserves the resource in the time slot of the reserved control time interval, and step 710 is executed;
step 707, the first node fails to reserve resources in the time slot of the reservation control period, and determines whether the number of times of resource reservation failure in the reservation control period of the same transmission scheduling cycle exceeds a threshold, if yes, step 708 is executed, otherwise step 709 is executed;
step 708, the first node determines a time slot in the reservation control period of the next scheduling cycle adjacent to the transmission scheduling cycle in which the number of times of failure of reservation of the current resource reaches the threshold, and returns to step 704;
step 709, the first node determines a time slot in the reserved control period of the transmission scheduling cycle, and returns to step 704;
step 710, the first node sends reservation control information to other nodes in the second micro-slot of the slot in which the resource reservation is successful;
step 711, the first node reserves the service transmission resource matched with the service data transmission request according to the time slot state table;
step 712, the first node receives the reservation control information sent by other nodes;
step 713, the first node updates the time slot state table again according to the received reservation control information sent by other nodes;
step 714, the first node determines whether the service transmission resource matched with the service data transmission request is available according to the time slot state table updated again, if so, step 715 is executed, otherwise, step 716 is executed;
step 715, the first node transmits the service data to be transmitted in the service data transmission request in the determined service transmission resource;
and step 716, the first node processes the service data to be transmitted according to the configured processing policy.
An embodiment of the present invention provides a readable storage medium, which is a non-volatile storage medium, and the readable storage medium is a non-volatile readable storage medium, and includes program code, when the program code runs on a computing device, the program code is configured to cause the computing device to perform the above contention-based resource reservation action.
Embodiments of the present invention provide a computer program product comprising instructions that, when run on a computer, cause the computing device to perform the above-described contention-based resource reservation actions.
Based on the same inventive concept, the embodiment of the present invention further provides a contention-based resource reservation device, and since the method corresponding to the device is the contention-based resource reservation method in the embodiment of the present invention, and the principle of the device for solving the problem is similar to that of the method, the implementation of the device may refer to the implementation of the method, and repeated details are not repeated.
As shown in fig. 8, a first contention-based resource reservation apparatus provided in an embodiment of the present invention includes: a processor 800, a memory 801, and a transceiver 802.
The processor 800 is responsible for managing the bus architecture and general processing, and the memory 801 may store data used by the processor 800 in performing operations. The transceiver 802 is used to receive and transmit data under the control of the processor 800.
The bus architecture may include any number of interconnected buses and bridges, with one or more processors represented by processor 800 and various circuits of memory represented by memory 801 being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The processor 800 is responsible for managing the bus architecture and general processing, and the memory 801 may store data used by the processor 800 in performing operations.
The processes disclosed in the embodiments of the present invention may be applied to processor 800, or implemented by processor 800. In implementation, the steps of the signal processing flow may be implemented by integrated logic circuits of hardware or instructions in the form of software in the processor 800. The processor 800 may be a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or the like that may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present invention may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in the processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in the memory 801, and the processor 800 reads the information in the memory 801 and completes the steps of the signal processing flow in combination with the hardware thereof.
The processor 800 is configured to read the program in the memory 801 and execute the following processes:
reserving idle time slots in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to a time slot state table;
determining a first time slot of a reservation control period of the first transmission scheduling cycle, and monitoring whether the first time slot is occupied in a first micro time slot of the first time slot, if the first time slot is not occupied, sending reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating that the idle time slot in the service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
Optionally, if the first time slot is occupied, the processor 800 is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
if the second time slot is not reached to the threshold value, determining a second time slot of the reserved control period of the first transmission scheduling cycle, and monitoring whether the second time slot is occupied in a first micro time slot in the second time slot, wherein the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted after the first time slot of the second time slot.
Optionally, the processor 800 is further configured to:
determining the position of the second time slot in the reserved control time interval of the first transmission scheduling cycle according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the position of the second time slot is a first position, and if the service data to be transmitted is of a second priority, the position of the second time slot is a second position, the first priority is higher than the second priority, and the first position is before the second position.
Optionally, the processor 800 is specifically configured to:
determining a value of a time slot offset in a time slot offset set according to a ratio between the priority sequence number and the highest priority sequence number of the service data to be transmitted, wherein the value of the time slot offset in the time slot offset set is equal to or smaller than the ratio; the sequence number of the priority is increased progressively according to the sequence from low to high;
randomly selecting a time slot offset from the time slot offset set, and determining the position of the second time slot according to the first time slot and the time slot offset.
Optionally, if the first time slot is occupied, the processor 800 is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
and if the threshold value is reached, monitoring whether a third time slot is occupied in a first micro time slot of the third time slot in a service transmission period of a second transmission scheduling period, wherein the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
Optionally, the processor 800 is further configured to:
determining the length of the first micro time slot according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the length of the first micro-slot is of a first length, and if the service data to be transmitted is of a second priority, the length of the first micro-slot is of a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
Optionally, the processor 800 is specifically configured to:
and determining the length of the first micro time slot according to the inverse relation between the length of the first micro time slot and the priority sequence number of the service data to be transmitted.
Optionally, if the first time slot or the second time slot is not occupied, the processor 800 determines that resource reservation is successful in the first time slot or the second time slot, and does not monitor whether other time slots in the reservation control period of the first transmission scheduling cycle are occupied.
Optionally, if the third time slot is not occupied, the processor 800 determines that the resource reservation in the third time slot is successful, and does not monitor whether other time slots in the reservation control period of the second transmission scheduling cycle are occupied.
Optionally, the processor 800 is further configured to:
updating the slot state table according to reservation control information from at least one second node;
if the time slot indicated by the reservation control information is available according to the updated time slot state table, transmitting the service data to be transmitted on the time slot indicated by the reservation control information; or
If the time slot indicated by the reservation control information is determined to be unavailable according to the updated time slot state table, processing the service data to be transmitted according to a configured processing strategy; the processing policy is used for indicating a processing operation when the resource reservation fails.
Based on the same inventive concept, another contention-based resource reservation device is also provided in the embodiments of the present invention, and since the method corresponding to the device is a contention-based resource reservation method in the embodiments of the present invention, and the principle of the device for solving the problem is similar to the method, the implementation of the device may refer to the implementation of the method, and repeated details are not repeated.
As shown in fig. 9, a second contention-based resource reservation apparatus provided in an embodiment of the present invention includes:
a reservation module 900, configured to reserve an idle time slot in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to the time slot state table;
a monitoring module 910, configured to determine a first time slot of a reservation control period of the first transmission scheduling cycle, and monitor whether the first time slot is occupied in a first micro time slot in the first time slot, and if the first time slot is not occupied, send reservation control information in a second micro time slot of the first time slot, where the reservation control information is used to instruct the service data to be transmitted to reserve an idle time slot in a service transmission period of the first transmission scheduling cycle; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
Optionally, the listening module 910 is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
if the second time slot is not reached to the threshold value, determining a second time slot of the reserved control period of the first transmission scheduling cycle, and monitoring whether the second time slot is occupied in a first micro time slot in the second time slot, wherein the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted after the first time slot of the second time slot.
Optionally, the listening module 910 is further configured to:
determining the position of the second time slot in the reserved control time interval of the first transmission scheduling cycle according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the position of the second time slot is a first position, and if the service data to be transmitted is of a second priority, the position of the second time slot is a second position, the first priority is higher than the second priority, and the first position is before the second position.
Optionally, the listening module 910 is specifically configured to:
determining a value of a time slot offset in a time slot offset set according to a ratio between the priority sequence number and the highest priority sequence number of the service data to be transmitted, wherein the value of the time slot offset in the time slot offset set is equal to or smaller than the ratio; the sequence number of the priority is increased progressively according to the sequence from low to high;
randomly selecting a time slot offset from the time slot offset set, and determining the position of the second time slot according to the first time slot and the time slot offset.
Optionally, the listening module 910 is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
and if the threshold value is reached, monitoring whether a third time slot is occupied in a first micro time slot of the third time slot in a service transmission period of a second transmission scheduling period, wherein the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
Optionally, the listening module 910 is further configured to:
determining the length of the first micro time slot according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the length of the first micro-slot is of a first length, and if the service data to be transmitted is of a second priority, the length of the first micro-slot is of a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
Optionally, the listening module 910 is specifically configured to:
and determining the length of the first micro time slot according to the inverse relation between the length of the first micro time slot and the priority sequence number of the service data to be transmitted.
Optionally, if the first time slot or the second time slot is not occupied, the monitoring module 910 determines that the resource reservation in the first time slot or the second time slot is successful, and does not monitor whether other time slots in the reservation control period of the first transmission scheduling cycle are occupied.
Optionally, if the third time slot is not occupied, the listening module determines that the resource reservation in the third time slot is successful, and does not listen to whether other time slots in the reservation control period of the second transmission scheduling cycle are occupied.
Optionally, the listening module 910 is further configured to:
updating the slot state table according to reservation control information from at least one second node;
if the time slot indicated by the reservation control information is available according to the updated time slot state table, transmitting the service data to be transmitted on the time slot indicated by the reservation control information; or
If the time slot indicated by the reservation control information is determined to be unavailable according to the updated time slot state table, processing the service data to be transmitted according to a configured processing strategy; the processing policy is used for indicating a processing operation when the resource reservation fails.
The present application is described above with reference to block diagrams and/or flowchart illustrations of methods, apparatus (systems) and/or computer program products according to embodiments of the application. It will be understood that one block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, and/or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer and/or other programmable data processing apparatus, create means for implementing the functions/acts specified in the block diagrams and/or flowchart block or blocks.
Accordingly, the subject application may also be embodied in hardware and/or in software (including firmware, resident software, micro-code, etc.). Furthermore, the present application may take the form of a computer program product on a computer-usable or computer-readable storage medium having computer-usable or computer-readable program code embodied in the medium for use by or in connection with an instruction execution system. In the context of this application, a computer-usable or computer-readable medium may be any medium that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (20)

1. A resource reservation method based on competition is characterized by comprising the following steps:
the first node reserves an idle time slot in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to a time slot state table;
the first node determines a first time slot of a reservation control period of the first transmission scheduling cycle, monitors whether the first time slot is occupied in a first micro time slot of the first time slot, and sends reservation control information in a second micro time slot of the first time slot if the first time slot is not occupied, wherein the reservation control information is used for indicating that the idle time slot in a service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
2. The method of claim 1, wherein if the first slot is occupied, the method further comprises:
the first node determines that the resource reservation fails in the first time slot, and judges whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
if the second time slot is not reached to the threshold value, the first node determines a second time slot of the reserved control period of the first transmission scheduling cycle, and monitors whether the second time slot is occupied in a first micro time slot in the second time slot, wherein after the first time slot, the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
3. The method of claim 2, further comprising:
the first node determines the position of the second time slot in the reserved control period of the first transmission scheduling cycle according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the position of the second time slot is a first position, and if the service data to be transmitted is of a second priority, the position of the second time slot is a second position, the first priority is higher than the second priority, and the first position is before the second position.
4. The method of claim 3, wherein the determining, by the first node, the position of the second time slot within the reservation control period of the first transmission scheduling cycle according to the priority of the service data to be transmitted comprises:
the first node determines the value of the time slot offset in a time slot offset set according to the ratio between the priority sequence number and the highest priority sequence number of the service data to be transmitted, wherein the value of the time slot offset in the time slot offset set is equal to or smaller than the ratio; the sequence number of the priority is increased progressively according to the sequence from low to high;
and the first node randomly selects a time slot offset from the time slot offset set and determines the position of the second time slot according to the first time slot and the time slot offset.
5. The method of claim 1, wherein if the first slot is occupied, the method further comprises:
the first node determines that the resource reservation fails in the first time slot, and judges whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
if the threshold value is reached, the first node monitors whether a third time slot is occupied in a first micro time slot of the third time slot in a third time slot of a service transmission period of a second transmission scheduling cycle, and the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
6. The method of any of claims 1 to 5, further comprising:
the first node determines the length of the first micro time slot according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the length of the first micro-slot is of a first length, and if the service data to be transmitted is of a second priority, the length of the first micro-slot is of a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
7. The method of claim 6, wherein the determining, by the first node, the length of the first minislot according to the priority of the traffic data to be transmitted comprises:
and the first node determines the length of the first micro-slot according to the inverse relation between the length of the first micro-slot and the priority sequence number of the service data to be transmitted.
8. The method of claim 1, wherein the first node determines that resource reservation was successful in the first time slot if the first time slot is unoccupied, the method further comprising:
the first node no longer listens whether other time slots of a reservation control period of the first transmission scheduling cycle are occupied.
9. The method of claim 1, wherein the transmitting reservation control information in the first time slot is followed by:
the first node updates the slot state table according to reservation control information from at least one second node;
if the first node determines that the time slot indicated by the reservation control information is available according to the updated time slot state table, transmitting the service data to be transmitted on the time slot indicated by the reservation control information; or
If the first node determines that the time slot indicated by the reservation control information is unavailable according to the updated time slot state table, processing the service data to be transmitted according to a configured processing strategy; the processing policy is used for indicating a processing operation when the resource reservation fails.
10. A contention-based resource reservation apparatus, comprising: a processor, a memory, and a transceiver;
the processor is used for reading the program in the memory and executing the following processes:
reserving idle time slots in a service transmission period of a first transmission scheduling cycle for service data to be transmitted according to a time slot state table;
determining a first time slot of a reservation control period of the first transmission scheduling cycle, and monitoring whether the first time slot is occupied in a first micro time slot of the first time slot, if the first time slot is not occupied, sending reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating that the idle time slot in the service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
11. The device of claim 10, wherein if the first slot is occupied, the processor is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
if the second time slot is not reached to the threshold value, determining a second time slot of the reserved control period of the first transmission scheduling cycle, and monitoring whether the second time slot is occupied in a first micro time slot in the second time slot, wherein the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted after the first time slot of the second time slot.
12. The device of claim 11, wherein the processor is further configured to:
determining the position of the second time slot in the reserved control time interval of the first transmission scheduling cycle according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the position of the second time slot is a first position, and if the service data to be transmitted is of a second priority, the position of the second time slot is a second position, the first priority is higher than the second priority, and the first position is before the second position.
13. The device of claim 12, wherein the processor is specifically configured to:
determining a value of a time slot offset in a time slot offset set according to a ratio between the priority sequence number and the highest priority sequence number of the service data to be transmitted, wherein the value of the time slot offset in the time slot offset set is equal to or smaller than the ratio; the sequence number of the priority is increased progressively according to the sequence from low to high;
randomly selecting a time slot offset from the time slot offset set, and determining the position of the second time slot according to the first time slot and the time slot offset.
14. The device of claim 10, wherein if the first slot is occupied, the processor is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the resource reservation failure times in the reservation control time period of the first transmission scheduling period reach a threshold value;
and if the threshold value is reached, monitoring whether a third time slot is occupied in a first micro time slot of the third time slot in a service transmission period of a second transmission scheduling period, wherein the length of the first micro time slot of the second time slot is matched with the priority of the service data to be transmitted.
15. The apparatus of any of claims 10 to 14, wherein the processor is further configured to:
determining the length of the first micro time slot according to the priority of the service data to be transmitted; if the service data to be transmitted is of a first priority, the length of the first micro-slot is of a first length, and if the service data to be transmitted is of a second priority, the length of the first micro-slot is of a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
16. The device of claim 15, wherein the processor is specifically configured to:
and determining the length of the first micro time slot according to the inverse relation between the length of the first micro time slot and the priority sequence number of the service data to be transmitted.
17. The device of claim 10, wherein if the first time slot is unoccupied, the processor determines that resource reservation was successful in the first time slot and no longer listens to other time slots of a reservation control period of the first transmission scheduling cycle.
18. The device of claim 10, wherein the processor is further configured to:
updating the slot state table according to reservation control information from at least one second node;
if the time slot indicated by the reservation control information is available according to the updated time slot state table, transmitting the service data to be transmitted on the time slot indicated by the reservation control information; or
If the time slot indicated by the reservation control information is determined to be unavailable according to the updated time slot state table, processing the service data to be transmitted according to a configured processing strategy; the processing policy is used for indicating a processing operation when the resource reservation fails.
19. A contention-based resource reservation apparatus, comprising:
the reservation module is used for reserving idle time slots in the service transmission time interval of the first transmission scheduling period for the service data to be transmitted according to the time slot state table;
the monitoring module is used for determining a first time slot of a reservation control period of the first transmission scheduling cycle, monitoring whether the first time slot is occupied in a first micro-time slot of the first time slot, and if the first time slot is not occupied, sending reservation control information in a second micro-time slot of the first time slot, wherein the reservation control information is used for indicating that the idle time slot in a service transmission period of the first transmission scheduling cycle is reserved for the service data to be transmitted; and the length of the first micro time slot is matched with the priority of the service data to be transmitted.
20. A computer storage medium having a computer program stored thereon, the program, when executed by a processor, implementing the steps of a method according to any one of claims 1 to 10.
CN201910310193.3A 2019-04-17 2019-04-17 Resource reservation method and equipment based on competition Active CN111836370B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910310193.3A CN111836370B (en) 2019-04-17 2019-04-17 Resource reservation method and equipment based on competition

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910310193.3A CN111836370B (en) 2019-04-17 2019-04-17 Resource reservation method and equipment based on competition

Publications (2)

Publication Number Publication Date
CN111836370A true CN111836370A (en) 2020-10-27
CN111836370B CN111836370B (en) 2023-07-25

Family

ID=72915095

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910310193.3A Active CN111836370B (en) 2019-04-17 2019-04-17 Resource reservation method and equipment based on competition

Country Status (1)

Country Link
CN (1) CN111836370B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113099538A (en) * 2021-04-08 2021-07-09 北京和峰科技有限公司 Data transmission method and device and electronic equipment
CN113923606A (en) * 2020-12-23 2022-01-11 技象科技(浙江)有限公司 Time-first-based transmission reservation method, device, system and storage medium
CN115884387A (en) * 2023-03-04 2023-03-31 天地信息网络研究院(安徽)有限公司 Directional ad hoc network time slot allocation method based on odd-even node micro time slots

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020105970A1 (en) * 2001-02-07 2002-08-08 Xtremespectrum, Inc System, method, and computer program product for sharing bandwidth in a wireless personal area network or a wireless local area network
US6963545B1 (en) * 1998-10-07 2005-11-08 At&T Corp. Voice-data integrated multiaccess by self-reservation and stabilized aloha contention
CN101102143A (en) * 2007-07-13 2008-01-09 北京航空航天大学 Multi-address access method for service quality guarantee
CN105050186A (en) * 2015-06-23 2015-11-11 闽南师范大学 Broadband wireless ad hoc network MAC-layer protocol method based on TDMA
CN110809324A (en) * 2019-10-10 2020-02-18 上海交通大学 MAC protocol based on distributed TDMA and wireless self-organizing network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6963545B1 (en) * 1998-10-07 2005-11-08 At&T Corp. Voice-data integrated multiaccess by self-reservation and stabilized aloha contention
US20020105970A1 (en) * 2001-02-07 2002-08-08 Xtremespectrum, Inc System, method, and computer program product for sharing bandwidth in a wireless personal area network or a wireless local area network
CN101102143A (en) * 2007-07-13 2008-01-09 北京航空航天大学 Multi-address access method for service quality guarantee
CN105050186A (en) * 2015-06-23 2015-11-11 闽南师范大学 Broadband wireless ad hoc network MAC-layer protocol method based on TDMA
CN110809324A (en) * 2019-10-10 2020-02-18 上海交通大学 MAC protocol based on distributed TDMA and wireless self-organizing network

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113923606A (en) * 2020-12-23 2022-01-11 技象科技(浙江)有限公司 Time-first-based transmission reservation method, device, system and storage medium
CN113923606B (en) * 2020-12-23 2022-12-06 技象科技(南京)有限公司 Time-first-based transmission reservation method, device, system and storage medium
CN113099538A (en) * 2021-04-08 2021-07-09 北京和峰科技有限公司 Data transmission method and device and electronic equipment
CN113099538B (en) * 2021-04-08 2022-09-16 北京和峰科技有限公司 Data transmission method and device and electronic equipment
CN115884387A (en) * 2023-03-04 2023-03-31 天地信息网络研究院(安徽)有限公司 Directional ad hoc network time slot allocation method based on odd-even node micro time slots
CN115884387B (en) * 2023-03-04 2023-05-02 天地信息网络研究院(安徽)有限公司 Directional ad hoc network time slot allocation method based on odd-even node micro time slots

Also Published As

Publication number Publication date
CN111836370B (en) 2023-07-25

Similar Documents

Publication Publication Date Title
US9380577B2 (en) Method and device for collaborative data communication in a radio network
CN109195195B (en) LoRa network channel access method, terminal, gateway, server and system
CN101977385B (en) DSAM (Dynamic Slot-time Allocation Method) of scale-extensible single-jump ad hoc network supporting QoS (Quality of Service)
CN102474883B (en) In half random back method of wireless local network resource reservation
US20040109428A1 (en) Method and apparatus for resource allocation for multiple traffic classes in wireless ad-hoc networks
KR100630192B1 (en) MAC protocol layer module of mobile terminal in MANET and method for transmitting/receiving frame thereof
KR100889747B1 (en) Method for controlling MAC and allocating resources in wireless Ad hoc network and computer-readable medium having embodied thereon a frame structure for the method
CN111836370B (en) Resource reservation method and equipment based on competition
CN111836312B (en) Resource reservation method and equipment based on competition
CN108141882A (en) The adjustment of the data flow and contention window parameter with different priorities in system competition-based
CN104244257A (en) Self-adaptation reservation and dynamic time slot distribution method and device
KR20180058662A (en) Method for collision avoidance in synchronized wireless communication system
CN106793114B (en) Dynamic time slot allocation method, applicable medium access control system and node
Rahbar Quality of service in optical packet switched networks
CN112153742B (en) MANET network dynamic time slot distribution method, system, equipment and application
Muir et al. Supporting real-time multimedia traffic in a wireless LAN
CN109644502B (en) Point-to-multipoint channel allocation method, device and system
EP2498455A1 (en) Method and system to coordinate the communication channel access in a technology independent way in order to improve channel efficiency and to provide QoS guarantees
KR100910033B1 (en) Reservation based traffic controlling method of wireless sensor network system
CN102843775B (en) Dispatching method, dispatching device and network equipment
WO2009069047A1 (en) Link-based transmission queue structure for wireless networks
CN111586880A (en) Dynamic hybrid access method and system suitable for TDMA
KR101040290B1 (en) Wireless Network Systems with Priority Class Based Medium Access Control
CN111371483A (en) Beam scheduling method, device and system
CN110958717A (en) Contention-free random medium access control method and system for centralized wireless local area network

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20210526

Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing

Applicant after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd.

Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road

Applicant before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY

GR01 Patent grant
GR01 Patent grant