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

Resource reservation method and equipment based on competition Download PDF

Info

Publication number
CN111836370B
CN111836370B CN201910310193.3A CN201910310193A CN111836370B CN 111836370 B CN111836370 B CN 111836370B CN 201910310193 A CN201910310193 A CN 201910310193A CN 111836370 B CN111836370 B CN 111836370B
Authority
CN
China
Prior art keywords
time slot
priority
transmitted
service data
period
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.)
Active
Application number
CN201910310193.3A
Other languages
Chinese (zh)
Other versions
CN111836370A (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
Datang Mobile Communications Equipment 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 Datang Mobile Communications Equipment Co Ltd filed Critical Datang Mobile Communications Equipment 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

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
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

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 types caused by limited quantity of control channel resources in a synchronous ad hoc network technology. The first node reserves idle time slots in a service transmission period of a transmission scheduling period for service data to be transmitted according to a time slot state table; and determining a time slot for carrying out resource reservation of a reserved control time slot in a transmission scheduling period, monitoring whether the time slot is occupied or not in a first micro time slot in the determined time slots, wherein the length of the first micro time slot is matched with the priority of service data to be transmitted, determining that the time slot is unoccupied, and transmitting reserved control information for indicating an idle time slot in the service transmission time slot for reserving the transmission scheduling period for the service data to be transmitted in a second micro time slot in the time slot for carrying out resource reservation. The problem of service distributed source scheduling is solved by a random reservation mechanism with a 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 communications technologies, and in particular, to a contention-based resource reservation method and apparatus.
Background
The wireless ad hoc network has the characteristics of no center, self-organization, distributed control, node movement, multi-hop and the like, and does not have a central control entity for global resource management and allocation, and a distributed channel access protocol suitable for the ad hoc network needs to be specially designed. An ad hoc network MAC (Medium Access Control, media access control) access protocol relates to the fact that indexes such as high efficiency, fairness QoS (Quality of Service, service quality) guarantee, power effectiveness and the like of the protocol are met on a limited channel to the greatest extent according to the specificity of the network and the supported service types.
With the diversification of the ad hoc network service, a time slot resource allocation method based on a synchronization mechanism and dynamic reservation becomes a main stream access method for guaranteeing the service quality and improving the service transmission efficiency of the ad hoc network. The QoS guarantee mechanism based on reservation access can solve the problems that the service with high real-time requirement can quickly obtain the channel use right and avoid excessive delay jitter. Since the channel usage rights are usually obtained in a distributed way, the access speed of the service depends not only on the node itself, but also to a large extent on the number of its neighboring nodes, the traffic volume and the traffic priority.
The HR-TDMA (Hybrid Reservation-Time Division Multiple Access, hybrid reservation time division multiple access) protocol is a typical synchronous ad hoc network reservation access protocol, and adopts a fixed allocation policy, where each node corresponds to its control channel one by 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 which can be accommodated by the network is limited, and the service quality of the users in the network is greatly influenced.
In summary, in the synchronous ad hoc network access control technology in the prior art, because the number of control channel resources is limited, 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 types caused by limited quantity of control channel resources in the synchronous ad hoc network technology in the prior art.
In a first aspect, an embodiment of the present invention provides a contention-based resource reservation method, including:
the first node reserves idle time slots in a service transmission period of a first transmission scheduling period 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 period, monitors whether the first time slot is occupied or not in a first micro time slot in the first time slot, and if the first time slot is not occupied, sends reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating an idle time slot in a service transmission period of the reserved first transmission scheduling period for service data to be transmitted; 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 unoccupied in the first micro time slot of the first time slot, reservation control information for indicating that the service data to be transmitted reserves the idle time slot of the service 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, network capacity is increased, system performance is improved, the length of the first micro time slot is determined according to the priority of the service data to be transmitted, the problem of distributed resource scheduling of multiple types of services is solved through a reservation mechanism for distinguishing the priority, and QoS service requests are effectively supported.
In one 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 period reaches a threshold;
if the threshold is not reached, the first node determines a second time slot of a reserved control period of the first transmission scheduling period, monitors whether the second time slot is occupied or not in a first micro time slot in the second time slot, and after the second time slot is 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 of the first time slot fails, so that the time slot for carrying out the resource reservation needs to be redetermined, when the time slot for carrying out the resource reservation is redetermined, the first node determines the second time slot of the reservation control period of the first scheduling period according to the number of times of resource reservation failure of the first node in the reservation control period of the first scheduling period, when the number of times of resource reservation failure does not reach the threshold value, and monitors whether the second time slot is occupied or not 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 the resource reservation can be improved.
In a possible implementation manner, the first node determines a position of the second time slot in a reserved control period of the first transmission scheduling period according to the priority of the service data to be transmitted; and if the service data to be transmitted is the second priority, the position of the second time slot is the second position, and if the service data to be transmitted is the first priority, the position of the second time slot is the first 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 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 of successful resource reservation of the node corresponding to the service data to be transmitted is, and the priority access and QoS service of the high-priority service are ensured.
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 within a reserved control period of the first transmission scheduling period:
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 time slot offset value in the time slot offset set is equal to or smaller than the ratio; the priority sequence numbers are increased from low priority to high priority;
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.
According to the method, a specific scheme of determining 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 is given, a time slot offset set is determined according to the proportion relation between the priority of the service data to be transmitted and the highest priority, then a time slot offset is selected in the time slot offset set according to the time slot offset to be selected, and the second time slot is determined according to the selected time slot offset and the first time slot.
In one 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 period reaches a threshold;
if the threshold value is reached, the first node monitors whether the third time slot is occupied or not in a third time slot in a reserved control period of a second transmission scheduling period and in a first micro time slot of the third time slot, and the length of the first micro time slot of the third time slot is matched with the priority of the service data to be transmitted.
According to the method, when the number of resource reservation failure times of the first node in the reservation control period of the first transmission scheduling period reaches 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 after 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 time slot according to the priority of the service data to be transmitted; and if the service data to be transmitted is a second priority, the length of the first micro time slot is a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
According to the method, the length of the first micro time 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 time 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 time slot resources required by service transmission can be reserved preferentially, and the priority access and QoS quality of high-priority service are ensured.
In one possible implementation manner, when the first node determines the length of the first micro 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.
According to the method, a specific scheme for determining the length of the first micro time slot according to the priority of the service data to be transmitted is provided, and when the preset length of the first micro time slot is fixed, the larger the priority of the service data to be transmitted is, the smaller the length of the first micro time slot is, so that the service data to be transmitted with the larger priority can reserve service transmission time slot resources required by service transmission preferentially and access preferentially.
In one possible implementation, if the first time slot or the second time slot is unoccupied, the first node determines that the reservation of resources in the first time slot or the second time slot is successful, and the first node does not monitor whether other time slots of the reserved control period of the first transmission scheduling period are occupied.
In one possible implementation, if the third time slot is unoccupied, the first node determines that the reservation of the resource in the third time slot is successful, and the first node does not monitor whether other time slots of the reserved control period of the second transmission scheduling period are occupied.
According to the method, the first node detects that the first time slot or the second time slot is unoccupied, and determines whether the first time slot or the second time slot resource reservation is successful, and the first node does not detect whether other time slots of the control period of the first transmission scheduling period are occupied; the first node detects that the third time slot is unoccupied, determines that the reservation of the resource in the third time slot is successful, and does not monitor whether other time slots of the reserved control period of the second transmission scheduling period are occupied or not, namely, the first node transmits service data to be transmitted in the same transmission scheduling period, so that the data transmission efficiency is improved.
In a possible implementation manner, after the first time slot transmits reservation control information, the first node updates the time slot state table according to the 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 (b)
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, the service data to be transmitted is processed according to a configured processing strategy; the processing policy is used to indicate processing operations when resource reservation fails.
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, and the first node determines that the time slot indicated by the reservation control information is available according to the updated time slot state table, so that the service data to be transmitted is transmitted on 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 of the service data to be transmitted, which is transmitted by the first node, can be dynamically allocated according to a random reservation mechanism, thereby increasing the network accommodation amount and improving the system performance.
In a second aspect, an embodiment of the present invention provides a contention-based resource reservation apparatus, including: a processor, a memory, and a transceiver;
wherein 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 period 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 period, and monitoring whether the first time slot is occupied or not in a first micro time slot in the first time slot, if the first time slot is not occupied, transmitting reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating an idle time slot in a service transmission period of reserving the first transmission scheduling period for service data to be transmitted; 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, including:
the reservation module is used for reserving idle time slots in a service transmission period of a first transmission scheduling period for service data to be transmitted according to the time slot state table;
A listening module, configured to determine a first timeslot of a reserved control period of the first transmission scheduling period, and listen, in a first micro timeslot in the first timeslot, whether the first timeslot is occupied, and if the first timeslot is not occupied, send reserved control information in a second micro timeslot of the first timeslot, where the reserved control information is used to indicate an idle timeslot in a service transmission period of the reserved first transmission scheduling period for service data to be transmitted; 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 having stored thereon a computer program, which when executed by a processor implements any of the aspects described above.
In addition, the technical effects caused by any implementation manner of the second aspect to the fourth aspect may refer to the technical effects caused by different implementation manners of the first aspect, which are not described herein.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the description of the embodiments will be briefly described below, it will be apparent that the drawings in the following description are only some embodiments of the present invention, and that other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of channel division using time division multiple access in the prior art;
fig. 2 is a schematic flow chart of a contention-based resource reservation method according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a time slot structure according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a node according to an embodiment of the present invention receiving a service data transmission request in a synchronization period of a transmission scheduling period;
fig. 5 is a schematic structural diagram of a node according to an embodiment of the present invention receiving a service data transmission request in any slot of a reserved control period of a transmission scheduling period;
fig. 6 is a schematic structural diagram of a node according to an embodiment of the present invention receiving a service data transmission request during a service transmission period of a transmission scheduling period;
FIG. 7 is a schematic flow chart of a complete method for resource reservation based on competition 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
In the following, some terms in the embodiments of the present application are explained for easy understanding by those skilled in the art.
(1) In the present embodiment, the terms "network" and "system" are often used interchangeably, but those skilled in the art will understand their meaning.
(2) The term "plurality" in the embodiments of the present application means two or more, and other adjectives are similar thereto.
(3) "and/or", describes an association relationship of an association object, and indicates that there may be three relationships, for example, a and/or B, and may indicate: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship.
The HR-TDMA (hybrid reserved time division multiple access) protocol is a distributed channel access protocol of a typical ad hoc network, and channel division of the hybrid reserved time division multiple access protocol includes: super frame, time frame and slot 3 layer frame structures as shown in fig. 1.
1) The time frame (frame) is a basic scheduling period of traffic transmission, and is divided into 3 periods, namely, a synchronization (Synchronize Segment) period, a reservation Control (Control Segment) period, and a traffic transmission (Service Segment) period.
The synchronization period (Synchronize Segment) is used for performing synchronous maintenance of the ad hoc network and 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 a node by taking the time slots (slots) as units; a Service Segment (Service Segment) is used for the node to transmit traffic on the reserved traffic channel.
To minimize the traffic latency, the time frame (frame) structure typically employs a shorter time frame length (frame_length), which minimizes the transmission scheduling period (schedule_cycle) under the constraint of traffic transmission efficiency (Throughput).
2) The super frame (superframe) period accommodates a plurality of time frames (frames), and generally the number of time frames in one super frame corresponds to the number of nodes (num_users) in the network, which represents the network capacity of the synchronous ad hoc network, namely: super frame_length=num_users (number of nodes) ×frame (time frame).
When a new node accesses the network, it generally needs to last for several (num_scanning) superframe periods, which is expressed as access_delay (access_delay) of the node, namely: access_delay=num_scanning (number) ×superframelength (superframe length).
3) In order To support transmission resource scheduling of dynamic TDMA, a reservation period (Control Segment) of each time frame (frame) is generally divided into a number of slots for transmission of Control signaling (RTS (Request To Send) and CTS (Clear To Send) required for a distributed reservation Control algorithm (ACK (Acknowledged Message, response message)).
Existing synchronous ad hoc network access control technologies (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 own dedicated control channel, and can ensure the reliability of the node exchanging the reservation control signaling. But this approach, while providing reliable signaling exchanges, limits the number of nodes that can be accommodated in the network.
In the existing technical scheme of synchronous ad hoc network access control, the number of control channels corresponds to the maximum number of nodes which can be accommodated by a network. While the number of control channels (num_cchs) is limited by the time frame length, the number of nodes of the synchronous ad hoc network (num_users) is also greatly limited. When the number of nodes accessed in the network increases, the existing synchronous ad hoc network access scheme must provide available control channels for new nodes through a superframe extension mechanism. However, this superframe extension mechanism greatly increases the access delay of the new user and the transmission waiting delay of the service plane, and increases the complexity of the access protocol.
Because 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 moment, and therefore limited control channel resources are wasted. 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, completes corresponding reservation control flow, solves the problem of distributed channel resource scheduling of multiple services through a random reservation mechanism with different priorities in the competition and flexible use process, ensures that the number of nodes which can be accommodated by a network is not limited by the number of control channels, thereby improving the capacity of a synchronous ad hoc network, and ensuring flexible access and QoS service of the services.
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in fig. 2, a flowchart of a contention-based resource reservation method according to an embodiment of the present invention includes the following steps:
step 200, the first node reserves idle time slots in a service transmission period of a first transmission scheduling period for service data to be transmitted according to a time slot state table;
step 210, the first node determines a first timeslot of a reserved control period of the first transmission scheduling period, listens in a first minislot in the first timeslot whether the first timeslot is occupied, and if the first timeslot is not occupied, sends reserved control information in a second minislot of the first timeslot, where the reserved control information is used to indicate an idle timeslot in the reserved service transmission period of the first transmission scheduling period for the service data to be transmitted; the length of the first micro time slot is matched with the priority of the service data to be transmitted.
According to the method, a first node reserves idle time slots in a service transmission period of a first transmission scheduling period for service data to be transmitted according to a time slot state table; determining whether the first time slot is occupied or not in a reserved control period of a first transmission scheduling period, monitoring whether the first time slot is occupied or not in a first micro time slot of the first time slot, and transmitting reserved control information for indicating an idle time slot in a service transmission period reserved for service data to be transmitted in the first transmission scheduling period in a second micro time slot of the first time slot after determining that the first time slot is unoccupied;
when the first node detects that the first time slot is unoccupied, the first node sends reservation control information for indicating that the service data to be transmitted reserves the idle time slot of the service transmission 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 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 service data to be transmitted, the problem of distributed resource scheduling of multiple types of services is solved through a reservation mechanism with different priorities, and the QoS service request is effectively supported.
The first micro time slot is used for a node to monitor whether the first time slot is occupied or not;
the second micro time slot is used for the node to send reservation control information for indicating the idle time slot in the service transmission period of the reserved first transmission scheduling period for the service data to be transmitted.
As shown in fig. 3, a structure diagram of a time slot provided in an embodiment of the present invention is shown, where a superframe includes a plurality of time frames, a time frame includes a synchronization period, a reservation control period, and a service transmission period, and a reservation control period of a time frame includes a plurality of time slots, and each time slot includes a first micro time slot and a second micro time slot, where a length of the first micro time slot is matched 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 updates the 2-hop node time slot state table locally maintained by the node for the time slot reservation decision of the reserved section.
For example, the first node is a network node, and the first node receives the time slot state tables issued by the plurality of second nodes in the synchronous period of each time frame, and then updates the time slot state tables of the 2-hop nodes maintained locally.
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 when the node performs time slot reservation, the time slot occupied by the adjacent node is avoided, and the time slot occupation conflict is avoided.
For example, in the current slot state table of the first node, there are 5 slots, slot a, slot B, slot C, slot D, slot E, slot a being occupied by the second node 1, slot B being occupied by the second node 2, wherein 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 one 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, a 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 slot status table, the first node waits for a service data transmission request from a higher layer, which may be an LLC (Logical Link Control ) layer, an IP (Internet Protocol, internet protocol) layer, or other higher layers, in each transmission scheduling period.
It should be noted that, one time frame represents one transmission scheduling period, and the first node is a node capable of receiving the slot state tables issued by the plurality of second nodes and maintaining the local slot state tables, so that any node in the wireless ad hoc network capable of receiving the slot state tables issued by other nodes in the wireless ad hoc network and maintaining the own slot state tables can be used as the first node, and the other nodes are the second nodes.
If the first node does not wait for the service data transmission sent by the high layer, the node skips the reservation control period of the time frame, only receives the reservation request information of the second node, and updates the time slot state table; or (b)
If the first node determines that at least one data transmission request from a high layer exists, the data transmission requests are ordered according to the priority information carried in the data transmission requests and the 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 priority of the data transmission request C is highest, the priority of the data transmission request A is next lowest, and the priority of the data transmission request B is lowest, at this time, the data transmission requests are ordered according to the data from low priority to high, and the data transmission requests are: 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 an idle time slot 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 first node updates the time slot state table according to the 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 slot state table of the first node, there are 5 slots, slot a, slot B, slot C, slot D, slot E, slot a being occupied by the second node 1, slot B being occupied by the second node 2, wherein 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 may select from the time slots C, D and E when reserving an idle time slot of the service transmission period in the transmission scheduling period for the service data to be transmitted according to the time slot state table, where a specific selection manner may be a random selection, may also select through a certain algorithm, and may also select the idle time slot through other manners.
And after reserving 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 the embodiment of the present invention, the first transmission scheduling period and the first time slot may be determined according to the position where the first node receives the service data transmission request sent by the higher layer. The first node may receive, at any position, a service data transmission request sent by a higher layer, where the received service data transmission request is different, and the determined first transmission scheduling period is different from the first time slot.
The first node may 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 period. These three cases are each described below.
Case one: and receiving the service data transmission request sent by the higher layer in the synchronous period of the transmission scheduling period.
And the first node receives the service data transmission request sent by the higher 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 reserved control period of the transmission scheduling period as a first time slot.
As shown in fig. 4, there are a transmission scheduling period 1 and a transmission scheduling period 2, where a reservation control period of the transmission scheduling period 1 has a time slot a, a time slot B, a time slot C, a time slot D, and a time slot E, and if a node receives a service data transmission request sent by a higher layer in a synchronization period of the transmission scheduling period 1, the node takes the transmission scheduling period 1 as a first transmission scheduling period, and takes the time slot a as a first time slot.
And a second case: and receiving a service data transmission request sent by a high layer in a reserved control period of a transmission scheduling period.
The first node receives the service data transmission request sent by the higher layer in 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 period 1 and a transmission scheduling period 2, where the reservation control period of the transmission scheduling period 1 has a time slot a, a time slot B, a time slot C, a time slot D, and a time slot E, and if 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 period 1, the transmission scheduling period 1 is taken as a first transmission scheduling period, and the time slot C is taken as a first time slot.
And a third case: and receiving a service data transmission request sent by a higher layer in a service transmission period of a transmission scheduling period.
The first node receives a service data transmission request sent by a higher layer in a service transmission period of a transmission scheduling period, takes a transmission scheduling period next to the transmission scheduling period in which the service data transmission request is received as a first transmission scheduling period, and takes a first time slot of a reserved control period in the transmission scheduling period next to the transmission scheduling period in which the service data transmission request is received as a first time slot.
As shown in fig. 6, there are a transmission scheduling period 1 and a transmission scheduling period 2, the transmission scheduling period 1 is adjacent to the transmission scheduling period 2, and after the transmission scheduling period 1, the reservation control period of the transmission scheduling period 2 has a time slot a, a time slot B, a time slot C, a time slot D, and a time slot E, and when the first node receives a service data transmission request sent by a higher layer in the service transmission period of the transmission scheduling period 1, the transmission scheduling period 2 is taken as a first transmission scheduling period, and the time slot a of the reservation control period of the transmission scheduling period 2 is taken as a first time slot.
After determining a first time slot of a reserved control period of a first scheduling period, a first node monitors whether the first time slot is occupied or not in a first micro time slot in the first time slot;
Embodiment one: the first time slot is unoccupied.
If the first time slot is not occupied, the first node is indicated to be successful in reservation of the first time slot resource, reservation control information is sent in a second micro time slot of the first time slot, and the reservation control information is used for indicating an idle time slot in a service transmission period of the reserved first transmission scheduling period for the service data to be transmitted.
After the first time slot transmits 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 invention, the first node broadcasts the reservation control information, receives the reservation control information of at least one second node, determines the 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, slot E, slot a being occupied by the second node 1, slot B being occupied by the second node 2, slot C, slot D and slot E being idle slots;
and receiving reservation control information of the second node 3, determining that the second node 3 occupies a 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 the embodiment of the present invention, after broadcasting the reservation control information, the first node receives a time slot state table issued by at least one second node, and updates the time slot state table according to the time 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 time slot indicated by the reservation control information sent by the first node is available refers to: whether the time slot indicated by the reservation control information is occupied by a second node or not, if so, determining that the time slot indicated by the reservation control information is unavailable; or (b)
And if the time slot is not occupied by the second node, 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, slot E, slot a being occupied by the second node 1, slot B being occupied by the second node 2, slot C, slot D and slot E being idle slots, and idle slots in the traffic transmission period of the first transmission scheduling period being reserved for the traffic data to be transmitted being slot C (i.e. slots indicated by reservation control information being 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 (b)
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, the service data to be transmitted is processed according to a configured processing strategy; the processing policy is used to indicate processing operations when resource reservation fails.
Wherein the processing policy is determined according to the requirement characteristics of the service data to be transmitted, and the processing operation indicated by the processing policy includes: discard, re-reserve, retransmit, etc.
In the embodiment of the present invention, when the first time slot is unoccupied, the first node determines that the reservation of the resource in the first time slot is successful, and the first node does not monitor whether other time slots of the reserved control period of the first transmission scheduling period are occupied.
That is, the first node does not continue to determine the second time slot in the reserved control period of the first transmission scheduling period after determining that the first time slot is unoccupied, and does not perform a process of listening to whether the second time slot is occupied.
Embodiment two: the first time slot is occupied.
If the first time slot is occupied, the first node determines that the reservation of the resources in the first time slot fails, and judges whether the number of times of the reservation of the resources in the reservation control period of the first transmission scheduling period reaches a threshold value or not.
Case one: the number of reservation failures in the reservation control period of the first transmission scheduling period does not reach a threshold.
After determining that the number of reservation failures in the reservation control period of the first transmission scheduling period does not reach a threshold, the first node determines a second time slot in the reservation control period of the first transmission scheduling period, monitors whether the second time slot is occupied in a first micro time slot in the second time slot, and after the second time slot is 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.
For example, when the first node fails to reserve the time slot a resource in the reserved control period in the first transmission scheduling period, the first node determines that the number of times of resource reservation failure in the reserved control period in the first transmission scheduling period is 1, the threshold is 3, and the first node determines that the number of times of resource reservation failure in the first transmission scheduling period does not reach the threshold, then the first node redetermines a time slot (i.e. a second time slot) in the reserved control period in the first transmission scheduling period, listens whether the second time slot is available in the first micro time slot of the second time slot, and the second time slot is before the first time slot.
In the embodiment of the invention, when the first node determines a second time slot in the reserved control period in the first transmission scheduling period, the position of the second time slot in the reserved control period in the first transmission scheduling period is determined according to the priority of the service data to be transmitted;
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:
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 time slot offset value in the time slot offset set is equal to or smaller than the ratio; the priority sequence numbers are increased from low priority to high priority;
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 the priority information carried in the 20 service data transmission requests from high to low, where the priority is lowest and is ranked at the first position, the corresponding priority sequence number is 1, the priority is highest and 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, it is determined that the priority sequence number of the service data to be transmitted is 4;
When determining the time slot offset value in the time slot offset set, taking a positive integer smaller 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 time slot offset in the time slot offset set, namely, the priority sequence number corresponding to the service data to be transmitted is 4, and the highest priority sequence number is 20, wherein the time slot offset in the time slot offset set comprises 1, 2, 3, 4 and 5; at this time, a slot offset 3 is randomly selected from the slot offset set, where the second slot is a third slot after the first slot, for example, the first slot is a first slot in the reserved control period, and the second slot is a fourth slot in the reserved control period.
If the priority sequence number of the service data to be transmitted is 10 and the highest priority sequence number is 20, at this time, the time slot offset in the time slot offset set comprises 1 and 2; the offset of the randomly selected time slot is 1, and if the first time slot is still the first time slot in the reserved control period, the second time slot is the second time slot in the reserved control 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 back-off algorithm of service data priority is adopted and is used for coordinating continuous competition conflict probability among different grades of services, when resource reservation fails in a time slot of a reserved control period of a service transmission scheduling period and the failure times reach a threshold value, a time slot offset set is determined according to a priority sequence number of service data to be transmitted, a 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, and success/failure of resource reservation is determined, so that the conflict probability is reduced; meanwhile, as the time slot offset set of the high-priority service is small, the contention probability is higher, and the priority access and the service quality of the high-priority service are ensured.
In the embodiment of the present invention, when the second time slot is unoccupied, the first node determines that the reservation of the resource in the second time slot is successful, and the first node does not monitor whether other time slots of the reserved control period of the first transmission scheduling period are occupied; after determining that the second time slot is unoccupied, the first node does not continue to determine other time slots in the reserved control period of the first transmission scheduling period, and does not execute the process of monitoring whether other time slots are occupied; or (b)
When the second time slot is occupied, the first node determines the number of times of resource reservation failure plus one, and re-reserves the time slot for transmitting reservation control information according to whether the number of times of resource reservation failure reaches a threshold value, if the number of times of resource reservation failure does not reach the threshold value, the time slot for reserving to transmit the reservation control information is determined in the reservation control period of the first transmission scheduling period, the determined time slot is behind the second time slot, whether the time slot is occupied is continuously monitored in the determined time slot, otherwise, the time slot for reserving to transmit the reservation control information is determined in the reservation control period of the second transmission scheduling period, and the monitoring process is executed.
And a second case: the number of reservation failures in the reservation control period of the first transmission scheduling period reaches a threshold.
If the threshold value is reached, the first node monitors whether the third time slot is occupied or not in a third time slot in a reserved control period of a second transmission scheduling period and in a first micro time slot of the third time slot, and the length of the first micro time slot of the third 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 in the first transmission scheduling period, and the first node reserves not a time slot for transmitting reservation control information in a reservation control period of the first transmission scheduling period but a time slot for transmitting reservation control information in one transmission scheduling period (referred to herein as a second transmission scheduling period) after the first transmission scheduling period. To reduce the time 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 transmitting the reservation control information in the second scheduling period, in order to reduce the time delay, the first time slot (namely, the third time slot) in the reservation control period of the second scheduling period can 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 not, the reservation of the third time slot resource is successful, 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 reservation of the third time slot resource 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, when the first node fails to reserve the time slot a resource in the reserved control period in the first transmission scheduling period, the first node determines that the number of times of resource reservation failure in the reserved control period in the first transmission scheduling period is 3, the threshold is 3, and the first node determines that the number of times of resource reservation failure in the first transmission scheduling period reaches the threshold, then the first node redetermines a time slot (i.e. a third time slot in the reserved control period in the second transmission scheduling period) in the reserved control period in the next transmission scheduling period adjacent to the first transmission scheduling period, and listens whether the third time slot is available in the first micro time slot of the third time slot.
In the embodiment of the present invention, if the first node detects that the third time slot is unoccupied, it indicates that the reservation of the resource in the third time slot is successful, and in order to improve the reliability of data transmission, the first node does not monitor whether other time slots of the reserved control period of the transmission scheduling period (i.e., the second transmission scheduling period) in which the third time slot is located are occupied.
In the embodiment of the invention, whether the first time slot is occupied or not is monitored in the first micro time slot of the first time slot, whether the second time slot is occupied or not is monitored in the first micro time slot of the second time slot, or whether the third time slot is occupied or not is monitored in the first micro time slot of the third time slot, whether the time slot is occupied or not can be determined in a carrier sensing mode, if the carrier can be monitored in the first micro time slot, the time slot is determined to be occupied, and if the carrier cannot be monitored in the first micro time slot, the time slot is determined to be unoccupied.
It should be noted that, in order to avoid misjudgment caused by that a plurality of nodes listen to the same time slot at the same time, when carrier sensing is performed on the time slot, the sensing duration of the time slot for each node may be different, that is, the length of the first micro time slot is different.
For example, the interception duration of the first micro time slot of the first node in the time slot a is 0.5ms, the interception duration of the second node in the first micro time slot of the time slot a is 0.4ms, if the first node and the second node intercept whether the time slot a is occupied at the same time in the first micro time slot of the time slot a, the second node intercepts the time slot a for 0.4ms, and determines that the time slot a is unoccupied, the second node occupies the time slot a, at this time, the first node also needs to intercept for 0.1ms, and determines that the time slot a is occupied, and the first node does not use the time slot a any more.
If the interception duration of the first micro time slot of the time slot A is the same as that of the second node, and is 0.4ms, when the first node and the second node intercept the first micro time slot of the time slot A, if the time slot A is not occupied, the first node and the second node intercept 0.4ms at the same time, and the first node and the second node determine that the time slot A is not occupied, and if the first node and the second node use the time slot A, the interception misjudgment is caused, so that the first node and the second node generate conflict. Therefore, the first node and the second node have different interception time lengths in the first micro time slot, 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 duration is added, so that the carrier sensing can distinguish the occupied state of the current time slot, and the time slot contention conflict is avoided to the greatest extent.
The length of the first micro time slot is matched with the priority of the service data to be transmitted in the data transmission request of the node from the higher layer, the higher the priority of the service data to be transmitted is, the shorter the length of the first micro time slot is, and the higher the competition level of the corresponding node to the time slot competition is, so that the time slot competition probability of the high-priority service is improved, and the service is reserved preferentially to transmit the time slot resources.
In the embodiment of the present invention, the length of the first micro time slot is determined by the first node according to the priority of the service data to be transmitted; and if the service data to be transmitted is a second priority, the length of the first micro time slot is 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 mainly by the following formula:
wherein CS_jitter represents the length of the first micro time slot, k represents the priority sequence number of the service data to be transmitted, W t For the length of a preset first micro time slot, t represents the length of a time slot in a transmission scheduling period, each time slot is divided into the first micro time slot and a second micro time slot, and the length of the time slot in the transmission scheduling period is fixed;
According to the nature of the negative index distribution, the expected length of the first micro time slot corresponding to the service data to be transmitted is as follows:
E(CS_Jitter)＝W t /k
wherein E (cs_jitter) is the expected length of the first minislot corresponding to the service data to be transmitted; w (W) t The method comprises the steps of setting 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 according to the sequence from low to high.
Wherein W is t The length of the first micro time slot corresponding to the service data to be transmitted with the lowest priority can be defined, and the length of the first micro time slot corresponding to the service data to be transmitted with the highest priority can also be defined, and the preset length of the first micro time slot is not specifically limited.
As can be seen from the above formula, when W t When k is constant, E (CS_jitter) is smaller as k is larger, and when t is consistent, the smaller E (CS_jitter) is, the smaller CS_jitter is, according to the property of negative index distribution;
that is, the higher the priority of the service data to be transmitted, the smaller the length of the first micro time slot, the shorter the time for carrier sensing, and when determining that the time slot is unoccupied, the service data to be transmitted with the higher priority will reserve the service transmission time slot resources required by service transmission.
In the embodiment of the present invention, when the first node determines the length of the first micro time slot according to the priority of the service data to be transmitted: determining a first proportion of a first priority difference value and a second priority difference value; the first priority difference value is a difference value obtained by subtracting the highest priority from the priority of the service data to be transmitted, and the second priority difference value is a difference value obtained by subtracting the priority of the service data to be transmitted from the lowest priority difference value;
further, determining the length of the first micro time slot according to the first proportion, so that a second proportion of a first micro time slot length difference value and a second micro time slot difference value is matched with the first proportion; the first micro time slot difference value is a difference value obtained by subtracting the minimum value of the micro time slot interception length from the first micro time slot length, and the second micro time slot difference value is a difference value obtained by subtracting the first micro time slot length from 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-slot may also be determined according to the priority of the service data to be transmitted in other manners, so long as the inverse relationship between the length of the first micro-slot and the priority sequence number of the service data to be transmitted is satisfied, for example, the length of the first micro-slot is determined by means of gaussian distribution, laplace distribution, and the like.
It should be noted that, in the embodiment of the present invention, whether the time slot of the reserved control period in the transmission scheduling period is occupied or not may be monitored according to the received service data transmission request from the higher layer, after determining that the time slot is unoccupied, the idle time slot of the service transmission period in the first transmission scheduling period is reserved for the service data to be transmitted according to the time slot state table, and reservation control information for indicating the idle time slot of the service transmission period in the first transmission scheduling period is sent in the time slot.
As shown in fig. 7, a flowchart of an overall method for reserving resources based on contention according to an embodiment of the present invention specifically includes the following steps:
step 700, the first node receives a time slot state table issued by at least one second node in a synchronous period of each frame;
Step 701, a first node updates a locally maintained 2-hop node time slot state table according to a received time slot state table;
step 702, the first node determines whether there is a service data transmission request from a higher layer in each transmission scheduling period, if so, step 703 is executed, otherwise step 710 is executed;
step 703, the first node determines a time slot of a reserved control period in a transmission scheduling period according to the position of the received service data transmission request;
step 704, the first node listens for the time slot of the reserved control period in the first micro time slot of the time slot;
step 705, the first node judges whether the time slot of the reserved control 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 period, and step 710 is executed;
step 707, the first node fails to reserve resources in the time slot of the reserved control period, and determines whether the number of times of resource reservation failure in the reserved control period of the same transmission scheduling period exceeds a threshold, if yes, step 708 is executed, otherwise step 709 is executed;
step 708, the first node determines a time slot in a reservation control period of a next scheduling period adjacent to the transmission scheduling period in which the current resource reservation failure number 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 period, and returns to step 704;
step 710, the first node sends reservation control information to other nodes in the second micro time slot of the time slot where 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 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 the 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 updated time slot state table, 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;
step 716, the first node processes the service data to be transmitted according to the configured processing policy.
Embodiments of the present invention provide a readable storage medium that is a non-volatile storage medium, the readable storage medium being a non-volatile readable storage medium comprising program code for causing a computing device to perform the actions of contention-based resource reservation described above when the program code is run on the computing device.
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 actions of contention-based resource reservation.
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 a 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 the repetition is omitted.
As shown in fig. 8, a first contention-based resource reservation apparatus according to 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 interconnecting buses and bridges, and in particular one or more processors represented by the processor 800 and various circuits of the memory, represented by the memory 801. The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, power management circuits, etc., which are well known in the art and, therefore, will not be described 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 flow disclosed in the embodiment of the invention can be applied to the processor 800 or implemented by the processor 800. In implementation, the steps of the signal processing flow may be performed by integrated logic circuitry in hardware or instructions in software in 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, a discrete gate or transistor logic device, a discrete hardware component, where the methods, steps and logic blocks disclosed in the embodiments of the present invention may be implemented or performed. The 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 embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in the memory 801, and the processor 800 reads information in the memory 801 and completes steps of the signal processing flow in combination with its hardware.
Wherein the processor 800 is configured to read a program in the memory 801 and execute the following procedures:
reserving idle time slots in a service transmission period of a first transmission scheduling period 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 period, and monitoring whether the first time slot is occupied or not in a first micro time slot in the first time slot, if the first time slot is not occupied, transmitting reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating an idle time slot in a service transmission period of reserving the first transmission scheduling period for service data to be transmitted; 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 number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold is not reached, determining a second time slot of the reserved control period of the first transmission scheduling period, and monitoring whether the second time slot is occupied or not 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 second time slot is arranged in the first time slot.
Optionally, the processor 800 is further configured to:
determining 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 if the service data to be transmitted is the second priority, the position of the second time slot is the second position, and if the service data to be transmitted is the first priority, the position of the second time slot is the first 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 the value of a 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 priority sequence numbers are increased from low priority to high priority;
and 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 number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold value is reached, a third time slot in a reserved control period of a second transmission scheduling period is monitored in a first micro time slot of the third time slot to judge whether the third time slot is occupied or not, and the length of the first micro time slot of the third 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; and if the service data to be transmitted is a second priority, the length of the first micro time slot is 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.
Alternatively, if the first time slot or the second time slot is unoccupied, the processor 800 determines whether the reservation of resources in the first time slot or the second time slot is successful, and does not monitor whether other time slots of the reserved control period of the first transmission scheduling period are occupied.
Optionally, if the third time slot is unoccupied, the processor 800 determines whether the reservation of the resource in the third time slot is successful, and does not monitor whether other time slots of the reserved control period of the second transmission scheduling period 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 (b)
If the time slot indicated by the reservation control information is not available 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 to indicate processing operations when resource reservation fails.
Based on the same inventive concept, another contention-based resource reservation device is provided in the embodiment of the present invention, and because the method corresponding to the device is a 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 the repetition is omitted.
As shown in fig. 9, a second contention-based resource reservation apparatus provided in an embodiment of the present invention includes:
the reservation module 900 is configured to reserve, for service data to be transmitted, an idle time slot in a service transmission period of a first transmission scheduling period according to a time slot status table;
a listening module 910, configured to determine a first timeslot of a reserved control period of the first transmission scheduling period, and listen, in a first minislot in the first timeslots, whether the first timeslot is occupied, and if the first timeslot is not occupied, send reserved control information in a second minislot of the first timeslot, where the reserved control information is used to indicate an idle timeslot in a traffic transmission period of the reserved first transmission scheduling period for traffic data to be transmitted; the length of the first micro time slot is matched with the priority of the service data to be transmitted.
Optionally, the interception module 910 is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold is not reached, determining a second time slot of the reserved control period of the first transmission scheduling period, and monitoring whether the second time slot is occupied or not 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 second time slot is arranged in the first time slot.
Optionally, the interception module 910 is further configured to:
determining 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 if the service data to be transmitted is the second priority, the position of the second time slot is the second position, and if the service data to be transmitted is the first priority, the position of the second time slot is the first position, the first priority is higher than the second priority, and the first position is before the second position.
Optionally, the interception module 910 is specifically configured to:
determining the value of a 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 priority sequence numbers are increased from low priority to high priority;
and 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 interception module 910 is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold value is reached, a third time slot in a reserved control period of a second transmission scheduling period is monitored in a first micro time slot of the third time slot to judge whether the third time slot is occupied or not, and the length of the first micro time slot of the third time slot is matched with the priority of the service data to be transmitted.
Optionally, the interception 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; and if the service data to be transmitted is a second priority, the length of the first micro time slot is a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
Optionally, the interception 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 unoccupied, the interception module 910 determines whether resource reservation is successful in the first time slot or the second time slot, and does not intercept other time slots of the reserved control period of the first transmission scheduling period.
Optionally, if the third time slot is unoccupied, the interception module determines that the reservation of the resource in the third time slot is successful, and does not intercept whether other time slots of the reserved control period of the second transmission scheduling period are occupied.
Optionally, the interception 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 (b)
If the time slot indicated by the reservation control information is not available 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 to indicate processing operations when 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 illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, 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 present application may also be embodied in hardware and/or in software (including firmware, resident software, micro-code, etc.). Still further, 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 modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (20)

1. A contention-based resource reservation method, comprising:
the first node reserves idle time slots in a service transmission period of a first transmission scheduling period 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 period, monitors whether the first time slot is occupied or not in a first micro time slot in the first time slot, and if the first time slot is not occupied, sends reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating an idle time slot in a service transmission period of the reserved first transmission scheduling period for service data to be transmitted; 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 time 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 number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold is not reached, the first node determines a second time slot of a reserved control period of the first transmission scheduling period, monitors whether the second time slot is occupied or not in a first micro time slot in the second time slot, and after the second time slot is 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, wherein the method further comprises:
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 if the service data to be transmitted is the second priority, the position of the second time slot is the second position, and if the service data to be transmitted is the first priority, the position of the second time slot is the first 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 first node determining the location of the second time slot within a reserved control period of the first transmission scheduling period based on the priority of the traffic 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 time slot offset value in the time slot offset set is equal to or smaller than the ratio; the priority sequence numbers are increased from low priority to high priority;
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 time 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 number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold value is reached, the first node monitors whether the third time slot is occupied or not in a third time slot in a reserved control period of a second transmission scheduling period and in a first micro time slot of the third time slot, and the length of the first micro time slot of the third time slot is matched with the priority of the service data to be transmitted.
6. The method of any one of claims 1-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; and if the service data to be transmitted is a second priority, the length of the first micro time slot is 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 first node determining the length of the first minislot based on the priority of the traffic data to be transmitted comprises:
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.
8. The method of claim 1, wherein the first node determines that reservation of resources at the first time slot was successful if the first time slot is unoccupied, the method further comprising:
the first node no longer listens to whether other time slots of the reserved control period of the first transmission scheduling period are occupied.
9. The method of claim 1, wherein after the first time slot transmits reservation control information, further comprising:
the first node updates the time 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 (b)
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, the service data to be transmitted is processed according to a configured processing strategy; the processing policy is used to indicate processing operations when resource reservation fails.
10. A contention-based resource reservation apparatus, comprising: a processor, a memory, and a transceiver;
wherein 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 period 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 period, and monitoring whether the first time slot is occupied or not in a first micro time slot in the first time slot, if the first time slot is not occupied, transmitting reservation control information in a second micro time slot of the first time slot, wherein the reservation control information is used for indicating an idle time slot in a service transmission period of reserving the first transmission scheduling period for service data to be transmitted; the length of the first micro time slot is matched with the priority of the service data to be transmitted.
11. The apparatus of claim 10, wherein if the first time slot is occupied, the processor is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold is not reached, determining a second time slot of the reserved control period of the first transmission scheduling period, and monitoring whether the second time slot is occupied or not 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 second time slot is arranged in the first time slot.
12. The apparatus of claim 11, wherein the processor is further configured to:
determining 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 if the service data to be transmitted is the second priority, the position of the second time slot is the second position, and if the service data to be transmitted is the first priority, the position of the second time slot is the first position, the first priority is higher than the second priority, and the first position is before the second position.
13. The apparatus of claim 12, wherein the processor is specifically configured to:
determining the value of a 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 priority sequence numbers are increased from low priority to high priority;
and 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 apparatus of claim 10, wherein if the first time slot is occupied, the processor is further configured to:
determining that the resource reservation fails in the first time slot, and judging whether the number of resource reservation failures in a reservation control period of the first transmission scheduling period reaches a threshold value or not;
if the threshold value is reached, a third time slot in a reserved control period of a second transmission scheduling period is monitored in a first micro time slot of the third time slot to judge whether the third time slot is occupied or not, and the length of the first micro time slot of the third 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; and if the service data to be transmitted is a second priority, the length of the first micro time slot is a second length, the first priority is higher than the second priority, and the first length is smaller than the second length.
16. The apparatus 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 whether reservation of resources at the first time slot was successful and no longer listens to other time slots of a reservation control period of the first transmission scheduling period.
18. The apparatus 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 (b)
If the time slot indicated by the reservation control information is not available 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 to indicate processing operations when resource reservation fails.
19. A contention-based resource reservation apparatus, comprising:
the reservation module is used for reserving idle time slots in a service transmission period of a first transmission scheduling period for service data to be transmitted according to the time slot state table;
a listening module, configured to determine a first timeslot of a reserved control period of the first transmission scheduling period, and listen, in a first micro timeslot in the first timeslot, whether the first timeslot is occupied, and if the first timeslot is not occupied, send reserved control information in a second micro timeslot of the first timeslot, where the reserved control information is used to indicate an idle timeslot in a service transmission period of the reserved first transmission scheduling period for service data to be transmitted; 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 stored thereon a computer program, which when executed by a processor performs the steps of the method according to any of claims 1 to 9.
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 CN111836370A (en) 2020-10-27
CN111836370B true 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)

Families Citing this family (3)

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

Family Cites Families (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
US7110380B2 (en) * 2001-02-07 2006-09-19 Freescale Semiconductor, Inc. System, method, and computer program product for sharing bandwidth in a wireless personal area network or a wireless local area network
CN100521581C (en) * 2007-07-13 2009-07-29 北京航空航天大学 Multi-address access method for service quality guarantee
CN105050186B (en) * 2015-06-23 2018-03-02 闽南师范大学 A kind of broadband wireless MANET mac-layer protocol method based on TDMA
CN110809324B (en) * 2019-10-10 2023-07-28 上海交通大学 MAC transmission method based on distributed TDMA and wireless self-organizing network system

Also Published As

Publication number Publication date
CN111836370A (en) 2020-10-27

Similar Documents

Publication Publication Date Title
US9380577B2 (en) Method and device for collaborative data communication in a radio network
EP2702730B1 (en) Effective circuits in packet-switched networks
CN111836370B (en) Resource reservation method and equipment based on competition
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
US9730241B2 (en) Scheduling method and system, access point and station
CN112996116B (en) Resource allocation method and system for guaranteeing quality of power time delay sensitive service
CN111836312B (en) Resource reservation method and equipment based on competition
JP2023011930A (en) Systems and methods for determining information indicative of cancellation
WO2020143773A1 (en) Transmission resource selection method and apparatus
WO2020077568A1 (en) Time-frequency resource contention method, apparatus, device and system for direct-connection communication
KR20180105775A (en) Method of Joint Optimization of Channel Selection and Frame Scheduling for Coexistence of LTE and WLAN in Unlicensed Band
CN109644502B (en) Point-to-multipoint channel allocation method, device and system
CN106793114B (en) Dynamic time slot allocation method, applicable medium access control system and node
CN112153742B (en) MANET network dynamic time slot distribution method, system, equipment and application
KR101339604B1 (en) A method for resource management in multi-user hybrid medium access control (HMAC)-based wireless networks
WO2009069047A1 (en) Link-based transmission queue structure for wireless networks
CN111586880A (en) Dynamic hybrid access method and system suitable for TDMA
US20140286163A1 (en) Data channel scheduling method and system for orthogonal frequency division multiplexing access (ofdma)-based wireless mesh network
KR101040290B1 (en) Wireless Network Systems with Priority Class Based Medium Access Control
WO2014187425A1 (en) Cross-master-node service processing method and apparatus
CN118102480A (en) Resource scheduling method, device and network node
WO2023125579A1 (en) Wireless resource scheduling method and apparatus, and storage medium
CN115174026B (en) Method and device for allocating number of beacon time slots and computer equipment
CN114938542B (en) BLE protocol stack multilink management method, chip and system
CA3119033C (en) Method and apparatus for dynamic track allocation in a 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

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

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant