WO2014079308A1 - 一种时隙资源占用处理方法及装置 - Google Patents

一种时隙资源占用处理方法及装置 Download PDF

Info

Publication number
WO2014079308A1
WO2014079308A1 PCT/CN2013/086264 CN2013086264W WO2014079308A1 WO 2014079308 A1 WO2014079308 A1 WO 2014079308A1 CN 2013086264 W CN2013086264 W CN 2013086264W WO 2014079308 A1 WO2014079308 A1 WO 2014079308A1
Authority
WO
WIPO (PCT)
Prior art keywords
time slot
reset
slot
status vector
vector
Prior art date
Application number
PCT/CN2013/086264
Other languages
English (en)
French (fr)
Inventor
冯媛
赵毅
房家奕
赵丽
李凤
Original Assignee
电信科学技术研究院
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 电信科学技术研究院 filed Critical 电信科学技术研究院
Publication of WO2014079308A1 publication Critical patent/WO2014079308A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA

Definitions

  • the present application relates to the field of communications, and in particular, to a method and an apparatus for processing time slot resources. Background technique
  • DSRC Dedicated Short Range Communications
  • the MS-ALOHA (Mobile Slotted Aloha) mechanism is a DSRC MAC (Medium Access Control) layer access and resource allocation mechanism based on time-sharing.
  • the resource allocation is based on the frame structure to slot. (time slot) is a unit. Referring to Figure 1, each N slots form a frame (denoted as Frame), and the slot number in each frame is 0 N-1, which cycles back and forth between frames. Only one vehicle is allowed to be sent in each slot, that is, TDMA (Time Division Multiple Access) mode between vehicles. In the time slot occupied by the vehicle, not only the data of the application layer but also the FI (Frame Information) is transmitted, and the occupied state of each slot in a frame is indicated in the FI.
  • FI Time Division Multiple Access
  • the basic idea of the MS-AL0HA mechanism is: When any node (for example, a vehicle) joins the network, it needs to occupy a time slot by listening to the time slot status information. If the node does not actively give up the occupied time slot resources, it can always use The occupied time slot transmits data, and during this period, if other nodes can know that there is a node occupation on the time slot resource, the time slot resource will not be used. On the occupied time slot, the node needs to periodically send the FI. The FI carries the time slot information of other nodes in the range of two hops from the node and the time slot status information of the node, indicating the node perceived.
  • the occupancy status information (also referred to as slot status information, time slot information) of each time slot is given to each time slot: time slot occupancy status information, STI corresponding to the time slot node (Source Temporary Identifier) a node temporary identifier, or a node identifier, a priority state of a node occupying a time slot (which may also be considered as a priority state corresponding to data that the slot node transmits in the time slot); wherein, the slot occupancy status
  • the information can express the four occupied states of the time slot: (00) indicates that the time slot is idle, and (10) indicates that the time slot has been occupied by other nodes that are one hop away from the node (the cylinder is called a one-hop neighbor node) or The node occupies, (11) indicates that the time slot has been occupied by other nodes that are two hops away from the node (the cylinder is called a two-hop neighbor node), and (01) indicates that the time slot has been used by the other two.
  • each node can determine the time slot occupied by each node in the range of three adjacent hops by listening to the FI sent by the node of the adjacent one hop, and find the time slot occupied by the node.
  • a resource collides with a resource used by another node it re-books a new free time slot.
  • the FI and its internal information content are uniformly described in the following description:
  • the node sends frame information called: FI message, which can also be called FI;
  • the occupation status information corresponding to each time slot indicated in the FI is called: the time slot information field corresponding to each time slot in the FI message;
  • the three types of information ie, the slot occupancy status, the node STI, and the current slot priority information given in the occupation status information corresponding to each time slot in the FI are respectively called: the slot information field of each slot.
  • the included time slot occupies a state sub-domain, an STI sub-domain, and a priority sub-domain;
  • the node Under the MS-ALOHA mechanism, during the maintenance of the occupied time slot, the node needs to maintain a (N-1) *N slot state cache table for storing the FI message sent by the neighboring node received on the corresponding time slot.
  • the slot information field of each slot carried in.
  • the dimension of the slot state buffer table shown in FIG. 3 is N*N-dimensional. Since the FI message sent by the node itself in the occupied slot does not need to be stored, the slot actually maintained by the node.
  • the state cache table is N-1 lines (assuming each node occupies only one time slot), and the (N-1) *N slot state cache table described in the subsequent content of the present application refers to not saving the node itself.
  • the time slot information of the FI wherein the detection field corresponding to the time slot refers to the time slot information field corresponding to the time slot in the FI message sent in the time slot, which is called the "detection domain" of the time slot, and the "non-detection domain"
  • the time slot information field corresponding to the time slot in the FI that is not occupied by the time slot is referred to as a non-detection domain of the time slot. Where default is the default.
  • the node When receiving a FI message on a time slot, the node always overwrites the information content of the row corresponding to the time slot in the slot state buffer table with the slot information content carried in the newly received FI message (ie, covers one frame period before Recorded content).
  • the specific process is as follows:
  • a node generates and sends an FI message in its own time slot (also called a transmission time slot).
  • Each field (domain) needs to be filled according to certain rules, including the slot occupation status sub-domain, the STI sub-domain, and the priority sub-domain. After the transmission is completed, the node will clear the transmitted FI information.
  • the line corresponding to slot p in the slot status cache table is cleared. It is only necessary to clear the time slot status of the slot table corresponding to slot p in the cache table (because the line is not maintained at all).
  • the node needs to receive the FI sent by the surrounding node on the time slot (also called the transmission time slot) that is not occupied by itself, and then update the time slot state cache table according to the received FI, before reaching the time slot occupied by the node itself.
  • Determine the time slot occupied by itself Whether the maintenance is successful and the occupation status of each time slot of the non-self-occupied time slot, wherein, when no FI is received on the time slot that is not occupied by itself, the node will each field of the line corresponding to the time slot in the time slot state cache table Fill in the default value.
  • the Default value is currently processed in the idle state (00). Of course, other processing methods can also be defined.
  • the node maintains (N-1) *N slot state cache table and judges whether the maintenance is successful before the self-occupied slot (p+X*N) arrives, starting from slot (p + 1), listening for N-1 Slot, generate (N-1) *N slot state buffer table, at the end of slot ( p + N - 1 ) [that is, the beginning of slot ( p + N )], determine the N-1 of the column corresponding to slot p Elements: Confirm whether this time slot resource can continue to be maintained.
  • the node needs to save each FI received in one frame, and process it in the self-occupied time slot.
  • the node waits until the transmission time slot (ie, the self-occupied time slot) is processed to obtain the complete channel occupation information.
  • the application of the time slot resource can be performed.
  • the time slot resource applied for at this time may not guarantee the delay requirement of the service data packet.
  • a high-level data packet (a delay requirement of 100 ms, that is, 1 frame) arrives in slot 1 in frame N, and the current transmission slot of the node has only slot 99, that is, the node only acquires slot 99, and then acquires Complete channel reservation information of one frame and apply for slot selection.
  • the node selects slot 50 as the application slot for transmitting the upper layer service packet, that is, slot 50 in frame (N+1), but when frame N When time slot 1 in +1 arrives, the high-level data packet that has been received in time slot 1 in frame N has timed out packet loss at this time; obviously, this will cause unnecessary packet loss of the system, which will seriously affect the packet.
  • the transmission performance of the system is assumed that the node selects slot 50 as the application slot for transmitting the upper layer service packet, that is, slot 50 in frame (N+1), but when frame N When time slot 1 in +1 arrives, the high-level data packet that has been received in time slot 1 in frame N has timed out packet loss at this time; obviously, this will cause unnecessary
  • the node needs to maintain a two-dimensional slot state cache table of N*N or (N-1) *N size. This maintenance operation has too high storage requirements and is easy to cause nodes. Running load. Moreover, under the MS-AL0HA mechanism, the node processes the buffered slot state cache table before sending the FI, which also imposes a certain load on the processing capability of the processor.
  • the embodiment of the present invention provides a method and a device for processing a time slot resource occupation, which are used to effectively meet the transmission delay requirement of a high-level data packet under the premise of reducing processing complexity and ensuring system performance.
  • a method for processing a time slot resource occupation comprising:
  • the first node records the time slot state vector (table) corresponding to the reset time slot according to the preset reset time slot associated with itself, when the reset time slot arrives in each frame period. Copy the information to the corresponding reset time slot maintenance In the historical slot state vector (table), the slot state vector (table) is reset, and the slot state vector is updated in real time according to the received frame information FI before the next reset slot arrives (table) And a history slot state vector (table); at any time, when the first node determines that a new slot resource needs to be applied, the slot is made according to the slot state information recorded in the currently maintained historical slot state vector (table) Application.
  • a time slot resource occupation processing device includes:
  • a first control unit configured to: according to a preset reset time slot associated with itself, when a reset time slot arrives in each frame period, first adjust a time slot status vector corresponding to the reset time slot ( The information recorded in the table is copied to the historical time slot status vector (table) corresponding to the reset time slot maintenance, and the time slot status vector (table) is reset, and before the next reset time slot arrives, according to the reception
  • the received frame information FI updates the time slot state vector (table) and the historical time slot state vector (table) in real time;
  • a second control unit configured to perform a new time slot request according to the time slot status information recorded in the currently maintained historical time slot state vector (table) when it is determined that the new time slot resource needs to be applied at any time.
  • the first node according to the preset reset time slot associated with itself, firstly resets the time slot state vector corresponding to the reset time slot when the reset time slot arrives in each frame period (
  • the information recorded in Table) is copied to the historical time slot status vector (table) corresponding to the reset time slot maintenance, and then the time slot status vector is reset, and before the next reset time slot arrives, according to the received FI real-time. Updating the above-mentioned slot state vector (table) and historical slot state vector (table); and at any time, the first node determines that a new slot resource needs to be applied, according to the currently maintained historical slot state vector (table)
  • the recorded time slot status information is used for time slot application.
  • the first node since the first node updates the historical slot state vector (table) in each reset slot and resets the slot state vector (table), the real-time performance and accuracy of the transmitted FI can be guaranteed. Avoiding the introduction of erroneous historical information and unnecessary negative feedback, and since the first node can select the application time slot resource according to the current slot state vector (table), thereby effectively ensuring the delay requirement of the high-level service packet, At the same time, the feasibility and reliability of the selected idle time slot are also ensured, and the collision of time slot resources is avoided, and further, the buffer space load caused by maintaining the historical time slot state vector (table) can be reduced, and the FI is reduced. The amount of processing before transmission, which effectively reduces the processing delay, significantly and comprehensively improves system performance.
  • FIG. 1 is a schematic diagram of a superframe structure in the background art
  • FIG. 2 is a schematic view showing a FI structure of the background art
  • FIG. 3 is a schematic diagram of a time slot state cache table in the background art and the embodiment of the present application;
  • FIG. 4 is a schematic diagram of a slot state vector (table) in the embodiment of the present application.
  • FIG. 5 is a schematic diagram of a slot type in an embodiment of the present application
  • FIG. FIG. 6 is a flowchart of processing a time slot occupation by a first node according to an embodiment of the present application
  • FIG. 7 is a schematic structural diagram of a first node in an embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of a first node device according to an embodiment of the present application. detailed description
  • a comprehensive time slot occupation processing mechanism of a slot state vector (table) combined with a historical slot state vector (table) is proposed. Under the mechanism, the two tables are associated and unified. The reset time slot of the node is maintained; wherein the time slot status vector (table) is mainly used for FI mapping, and the historical time slot status vector (table) is used for time slot resource selection.
  • the node may perform the maintenance of the FI of each time slot in the frame in an iterative manner. That is, the node only stores one vector about the current occupied state of each time slot, which is called a time slot state vector (also called a time slot state table), which is hereinafter referred to as a time slot state vector (table), a possible time slot state vector. (Table)
  • a time slot state vector also called a time slot state table
  • table a time slot state vector
  • Table a possible time slot state vector.
  • Table As shown in FIG. 4, when the node receives the FI sent by other nodes, according to the slot information field corresponding to each slot in the newly received FI, each slot in the locally saved slot state vector (table) The corresponding slot information unit is updated, and the slot information is maintained by maintaining the slot status vector (table).
  • the node needs to send its own FI, it will generate the FI to be sent according to the information in the saved slot status vector (table).
  • one node may occupy multiple time slot resources, and when the node occupies multiple time slot resources, in order to maintain multiple time slot resources occupied by the node, the time associated with the node
  • the slots are divided into the following categories (see Figure 5 for details): Self-occupied time slots.
  • Application time slot The MAC layer compares the data volume of the high-level data packet to be sent in the buffer queue and the transmission capacity of the node's self-occupied time slot or the use time slot (including the application time slot), if the data of the data packet The new time slot is applied when the amount is greater than the self-occupied time slot or the transmission capacity that can be increased by using the time slot (including the application time slot).
  • the application time slot is converted into a self-occupied time slot if it is determined that the application time slot is not occupied by other nodes.
  • time slot resources occupied by the nodes can also be divided in the following manner:
  • the node uses the time slot (also referred to as the use time slot, the transmission time slot):
  • the time slot occupied by the node and the time slot that the node is applying are collectively referred to as the node use time slot.
  • nodes use time slots as well. It may only include the time slots occupied by the nodes.
  • Non-node use time slot also referred to as receive time slot: All other time slots except the node use time slot in all time slots in the frame.
  • the channel usage state perceived by the first node may be different at each time slot, and may be used when the first node uses multiple time slots. It is not limited to the following two ways to maintain the slot state vector (table) sensed by each slot:
  • the first way is: Single-table solution.
  • the so-called single-table solution means: when the first node can occupy multiple time slots in each frame period to send high-level data, if the total number of self-occupied time slots and application time slots is greater than 1, the first node can still Only one slot status vector (table) is maintained locally to record slot status information for multiple self-occupied time slots and/or application time slots.
  • the first node When the single-table scheme is used, when the first node receives the FI sent by the other node in the slot that is not used by itself, the first node updates the slot state vector according to the information in the slot information field corresponding to each slot in the received FI (The time slot information unit corresponding to each time slot in the table, the change of the time slot state information is reflected in the updated time slot state vector (table); the first node arrives at each of the self-occupied time slots [or application time Gap (When the application time slot can only become a self-occupied time slot after the actual transmission of data, it is possible to use the application time slot to send the FI, otherwise the FI can only be sent on the self-occupied time slot)], according to the current time slot Status Vector (Table) The content organization generates the FI and sends it.
  • the slot state vector (table) maintained by the first node is set at each frame (eg, reset slot), after transmitting the FI.
  • the reset is performed, and the information units corresponding to each time slot in the slot state vector (table) are not reset after the other slots transmit the FI.
  • the second way is: Multi-table solution.
  • the so-called multi-table scheme means: when the first node can occupy multiple time slots in each frame period to send high-level data, if the total number of self-occupied time slots and application time slots is greater than 1, the first node can be locally The corresponding slot state vector (table) is maintained for each of the self-occupied time slot and the application time slot, respectively.
  • the first node when the first node receives the FI sent by other nodes in the time slot not used by itself, the first node updates each corresponding time according to the information in the slot information field corresponding to each slot in the received FI. a slot information unit corresponding to each slot in the slot state vector (table), and the change of the slot state information is reflected in the slot state vector (table) corresponding to each updated slot; the first node arrives at each A self-occupied time slot [or application time slot (when the application time slot is considered to be only true data transmission before it can become a self-occupied time slot, it is possible to use the application time slot to send FI, otherwise the FI can only be in the self-occupied time slot.
  • the FI When sending), the FI is generated according to the content of the slot state vector (table) corresponding to the current self-occupied time slot (or the application slot), and the information of the other self-occupied time slots in the FI of the node
  • the domain content can be obtained from slot state vectors (tables) corresponding to other self-occupied time slots of the node.
  • the slot status vector (table) After the first node sends the FI in a self-occupied time slot, when the slot status vector (table) is used to maintain the slot status information, the slot status vector (table) corresponding to the self-occupied time slot of the transmitting FI is cleared.
  • a slot information unit corresponding to another slot other than the occupied slot.
  • Step 600 The first node according to the preset reset time slot associated with itself, when the reset time slot arrives in each frame period, first adjusts the slot state vector (table) corresponding to the reset time slot.
  • the recorded information is copied to the historical time slot status vector (table) corresponding to the reset time slot maintenance, and then the time slot status vector (table) is reset, and before the next reset time slot arrives, according to the received FI real time.
  • the above slot state vector (table) and historical slot state vector (table) are updated.
  • each node is preset to be associated with one reset time slot, and two types of time slot state information, one time slot state vector (table) and history, need to be maintained in the reset time slot.
  • the history slot state vector (table) is similar to the slot state vector (table), and is composed of a plurality of slot information units, and the slot occupancy status subunit in each slot information unit is used to indicate the intraframe. The state of a time slot.
  • the first node when the first node sets its own reset time slot, the first node may use but is not limited to the following method:
  • the reset time slot conversion may be marked as an application time slot. If the first node currently maintains a transmission time slot, select any one of the transmission time slots maintained by the local node as the reset time slot; or, the first node will use the (N-1) time slot after the time slot where the power on time is located.
  • N represents the number of time slots in a frame; or, if the first node does not currently maintain the transmission time slot, select any time point as the reset time slot;
  • the new application time slot can be converted into a reset time slot, which will be detailed in the following embodiments.
  • the first node can maintain the slot state vector (table) in a single-table or multi-table manner, and also needs to maintain a historical slot state vector (table), which is in the history slot state vector (table)
  • the reset slot update in each frame period of a node that is, the first node will organize and send according to the currently saved slot state vector (table) in the reset slot (also self-occupied slot/application slot) Its own FI, and after transmitting the FI, copy the contents recorded in the current slot status vector (table) to the historical slot status vector (table) before resetting the slot status vector (table), overwriting the history
  • the slot state vector (table) always stores the slot state information of at most one frame monitored by the first node
  • the historical slot state vector (table) stores at least one frame monitored by the first node. Up to two frames of slot state information, so as to ensure that the first node can learn at least any complete time from the current time at any time.
  • the channel occupancy situation, and then the application time slot can be selected according to the channel occupancy situation at this time.
  • Step 610 At any time, when the first node determines that a new slot resource needs to be applied, the slot request is performed according to the slot state information recorded in the currently maintained historical slot state vector (table).
  • the first node determines, according to the FI received in the receiving time slot (that is, the time slot that is not used by itself, that is, the self-occupied time slot and the non-application time slot), that the time slot used by the first time slot collides, according to the current corresponding reset.
  • the time slot status information recorded in the historical slot state vector (table) of the time slot maintenance applies for a new time slot resource; or/and, after receiving the new high layer service packet, the first node determines that the current node is currently used to carry the upper layer.
  • the new slot resource is requested according to the slot state information recorded in the currently maintained historical slot state vector (table).
  • the first node may preferentially select the idle time slot as the new application time slot resource, or may select the three-hop neighbor node when there is no idle time slot.
  • the occupied time slot resource is used as a new application time slot resource.
  • a new time slot resource is selected in the idle time slot as an example.
  • the first node determines that the current number of transmission slots cannot meet the transmission requirement, and can immediately select the application time according to the historical slot state vector (table) maintained by the current corresponding reset slot.
  • the historical time slot state vector (table) that is currently maintained by the corresponding reset time slot is selected to apply for a time slot;
  • a node maintains a corresponding slot state vector for each time slot used by itself (ie, adopts a multi-table scheme), and after selecting the application slot, the first node needs to further apply the corresponding slot state to the associated slot.
  • the first node selects the original self-occupied time slot in the future time slot that is closest to the newly applied time slot, and re-associates its associated time slot status vector to the new application time. Gap.
  • the history slot state vector (table) stores slot state information of at least one frame in comparison with the slot state vector (table)
  • the history slot state is The iterative content recorded in the vector (table) more accurately reflects the true state of the idle time slot, that is, the idle time slot recorded in the historical time slot state vector (table) is usually a true idle time slot, and thus, based on the historical time slot.
  • the state vector (table) is used to determine the idle time slot and apply for a new time slot resource, which can effectively avoid collision of newly applied time slot resources, thereby effectively avoiding the situation of re-application due to resource collision, and effectively guaranteeing the time.
  • the reliability of the gap resources reduces the amount of system computation.
  • the self-occupied time slot is selected as the reset time slot and the arbitrary time point is selected as the self-occupied time slot for the first node, and the process of occupying the time slot of the first node is introduced.
  • the specific processing process is divided into two types: the time slot resource is normal (that is, no collision occurs) and the collision occurs.
  • the first node needs to consider the processing of the application time slot, the sending process, the receiving process, and the resetting. Processing, the processing of the application time slot can occur at any one time point, and the reset time slot is a self-occupied time slot of the first node, so the reset processing can be placed on the transmission Send time slot processing.
  • the first node currently has a self-occupied time slot (i.e., a transmission time slot).
  • the historical slot state vector (table) must be associated with the slot status vector (table), that is, the same reset slot is used uniformly.
  • the first node in the single-table scheme only maintains one slot state vector (table), and the multi-table scheme maintains multiple slot state vectors (tables) in the multi-table scheme, and the processing of the two nodes is Differences, here are still separately explained for single-table and multi-table scenarios.
  • the first node maintains a slot state vector (table) by using a single table scheme, that is, regardless of whether the first node occupies several time slots at the same time, the first node internally maintains only one one-dimensional slot state for each time slot used by itself.
  • Vector (table)
  • the reset time slot is a self-occupied time slot of the node
  • the historical time slot state vector (table) and the time slot state vector (table) need to be maintained corresponding to the reset time slot, and corresponding to other self-occupied time slots. , there is no need to maintain any information.
  • the processing flow of the first section is as follows:
  • the reset time slot is only one of the self-occupied time slots, and other time slots do not maintain any information.
  • the first node receives the FI sent by the other node, and in real time pairs the maintained time slot state vector (table) and the historical time slot according to the received FI.
  • the status vector (table) is updated.
  • the update rule of the historical time slot state vector (table) is exactly the same as the slot state vector (table).
  • the first node needs to do the following two operations in the transmission time slot (ie, the time slot used by the first node itself, such as a self-occupied time slot):
  • the first node needs to send FI in all the self-occupied time slots, that is, the first node maps the slot state vector (table) currently maintained by the reset slot to FI transmission.
  • sending FI and "copying information in a slot state vector (table) to a historical slot state vector (table)” are both resetting the slot state vector (table) Execution before, but there is no specific order of execution between the two operations, can be parallel, or can be executed in the order in which they are set. Subsequent related operations are performed in this way and will not be described again.
  • Time slot application processing When the first node determines that it needs to apply for a new time slot resource according to the high-level service requirement, The time slot resource to be applied for this time does not need to maintain any information, and the first node only needs to select an idle time slot to apply according to the historical time slot state vector (table) maintained by the current corresponding reset time slot.
  • the time slot used by the first node is likely to collide with resources due to collision with the time slots used by other nodes.
  • the first node can make different collision processing, specifically:
  • the first node determines whether it is necessary to apply for a new time slot resource, and if so, the first node needs to be reset according to the current corresponding
  • the idle time slot recorded in the historical slot state vector (table) of the time slot maintenance applies for a new time slot resource, and reselects the reset time slot, and correspondingly sets the corresponding time slot state vector corresponding to the reselected reset time slot association. (table) and historical time slot status vector (table); otherwise, directly reset the reset time slot, and after selecting the reset time slot, associate the corresponding time slot status vector with the reselected reset time slot (Table) ) and historical time slot status vector (table).
  • the first node when selecting a new reset time slot, preferably, the first node generally selects a self-occupied time slot or an application time slot that is closest to the time slot in which the current resource collision determination is currently performed in the future time slot.
  • the time slot is further set.
  • the first node may The time slot associated historical time slot state vector (table) is associated with the reselected reset time slot, and maintenance is continued, and the time slot state vector (table) associated with the original reset time slot is cleared, and correspondingly reselected
  • the reset time slot is associated with a slot state vector (table) initialized to a zero vector, or the slot state vector (table) associated with the original reset slot is partially backed up and associated with a new reset. On the gap.
  • the first node updates the above-mentioned slot state vector and historical slot state vector in real time according to the received FI, and after the reselected reset slot arrives, according to the currently maintained
  • the slot status vector (table) sends the FI, and after the FI transmission, resets the currently maintained slot status vector, that is, resets the status of all slots in the slot status vector (table).
  • the historical slot state vector (table) corresponding to the reset slot maintenance is copied, because the information in the slot state vector (table) maintained corresponding to the reset slot is the partial slot state information, and the maintenance history is required. Gap state vector (table).
  • the first node determines whether it is necessary to apply for a new time slot resource, and if so, the first node only needs to be maintained according to the current time.
  • the idle time slot recorded in the historical time slot status vector (table) applies for a new time slot resource. At this time, no information needs to be maintained corresponding to the newly applied time slot resource; otherwise, no operation is performed.
  • the first node maintains the slot state vector (table) with a multi-table scheme, that is, when the first node sends data, it needs to use Maintaining a one-dimensional time slot state vector for each time slot (ie, transmission time slot) used by each of the multiple time slots
  • the time slot needs to maintain two sets of tables: a slot state vector (table) and a history slot state vector (table), for other self-occupation Time slots, only need to maintain slot state vector (table) information.
  • the processing flow of the first node is as follows:
  • the reset time slot is only one of the self-occupied time slots. It also needs to maintain related information in other self-occupied time slots, so there is a difference in receiving processing compared to the single-table scheme.
  • the first node For the slot state vector (table) and the historical slot state vector maintained by the self-occupied time slot in which the reset slot is located, the first node newly receives according to each time slot (ie, receiving slot) that is not used by itself.
  • the FI real-time updates the slot state vector (table) and the historical slot state vector (table), and the update rule of the historical slot state vector (table) is completely consistent with the slot state vector (table).
  • the first node according to the newly received FI in each non-self-used time slot (ie, the receiving slot)
  • the status vector (table) is updated.
  • the first node needs to do the following two operations in the transmission time slot (that is, the time slot used by the first node itself, such as a self-occupied time slot):
  • the first node maps its current corresponding slot state vector (table) to FI transmission in each self-occupied time slot.
  • the self-occupied time slot in which the reset slot is located differs from the processing of other self-occupied time slots.
  • the self-occupied time slot in which the reset slot of the first node arrives, after the first node sends the FI, the historical slot state vector (table) is cleared, and then the slot state vector maintained by the current corresponding reset slot is maintained ( The information recorded in Table) is copied to the historical time slot status vector (table), and finally, the state of all time slots in the time slot status vector (table) is cleared.
  • the first node When the self-occupied time slot in which the non-reset time slot of the first node arrives, the first node sends a FI, and then resets the time slot state vector (table) associated with the self-occupied time slot, that is, clears the Self-occupied time slot associated slot state vector (table).
  • Time slot application processing When a high-level service packet arrives, if the first node determines that a new time slot resource needs to be applied, the first node may select an idle time according to a historical time slot state vector (table) maintained by the current corresponding reset time slot. The gap is applied and the corresponding slot status vector (table) is associated with the newly applied time slot.
  • a historical time slot state vector (table) maintained by the current corresponding reset time slot.
  • the gap is applied and the corresponding slot status vector (table) is associated with the newly applied time slot.
  • the first node can select the new application of the absolute time axis to select the distance.
  • the original self-occupied time slot of the time slot is copied with its associated time slot state vector (table) to obtain a time slot state vector (table) associated with the newly applied time slot.
  • the time slot used by the first node is likely to be due to collision with the time slot used by other nodes.
  • a resource collision occurs.
  • the collision type is different, and the first node can make a different collision.
  • the node determines whether it needs to apply for a new time slot resource, and if so, the first node needs to apply for a new time slot resource according to the idle time slot recorded in the historical time slot state vector (table) maintained by the current corresponding reset time slot, and Selecting a reset time slot, and correspondingly selecting a corresponding time slot state vector (table) and a history state vector (table) corresponding to the reselected reset time slot association; otherwise, directly reselecting the reset time slot, and correspondingly reselecting the weight Set the slot association to set the corresponding slot status vector (table) and historical slot status vector (table).
  • the first node may select the original self-occupied time slot in the future time slot that is closest to the selected new application time slot, and copy the associated time slot status vector (table). A time slot status vector (table) associated with the newly applied time slot is obtained.
  • the first node determines whether the new time slot resource is selected or not.
  • the first node preferably, the first node generally selects the current distance on the time axis to perform the current resource collision slash determination.
  • the most recent self-occupied time slot or application time slot of the time slot is a new reset time slot.
  • the corresponding time slot state vector (table) and historical time slot state vector are set in association with the reselected reset time slot.
  • the first node may associate the historical time slot state vector (table) associated with the original reset time slot to the reselected reset time slot, continue to maintain, and clear the original weight
  • a slot state vector (table) associated with the slot is set, and a reselected reset slot is associated with a slot state vector (table) that initializes to a zero vector.
  • the first node updates the time slot state vector (table) and the historical state vector (table) corresponding to the reset time slot according to the received FI, and updates the corresponding deduplication in real time.
  • a slot state vector (table) maintained by each slot used by the slot other than the slot and after the next reset slot arrives, the FI is transmitted according to the slot state vector maintained by the current corresponding reset slot, and After the FI is sent, the slot state vector (table) currently maintained by the corresponding reset slot is reset, that is, the state of all slots in the slot state vector (table) is reset.
  • the historical slot state vector (table) corresponding to the reset slot maintenance cannot be copied, because the information in the slot state vector (table) maintained corresponding to the reset slot is the partial slot state information, which is required.
  • the historical time slot status vector (table) is continuously maintained.
  • the first node clears the historical time slot status vector (table), and then copies the current record content of the new reset time slot associated time slot status vector (table) to the history.
  • Time slot status vector (table) at the same time, first section The point is combined with the currently maintained slot state vector (table) to generate and transmit the FI, and reset the slot state vector after the FI is sent.
  • the first node applies for a new time slot resource according to the current historical time slot status vector (table). Selecting the original self-occupied time slot closest to the newly applied time slot in the future time slot, and copying its associated time slot status vector (table) to obtain the time slot status vector associated with the newly applied time slot (table) .
  • the first node determines whether it needs to apply for a new time slot resource, and if so, the first node only needs to be maintained according to the current time.
  • the idle time slot recorded in the historical time slot vector (table) applies for a new time slot resource, and associates the corresponding time slot state vector (table) for the newly applied time slot.
  • the first node can choose to be absolute.
  • the nearest self-occupied time slot of the newly applied time slot selected by the distance on the time axis, and the associated time slot state vector (table) is copied to obtain the slot state vector associated with the newly applied time slot (Table ).
  • the first node does not currently have a self-occupied time slot.
  • the first node may set the (N-1)th time slot after the time slot in which the power is turned on as the reset time slot, and maintain the corresponding time slot state vector (table) and historical time slot state vector (table). In this case, the first node does not send a time slot.
  • the application of the time slot resource is required, and the whole process is divided into the following two phases:
  • the first stage is: There is no high-level business, and the first stage may be any length of time.
  • the first node receives the FI sent by other nodes in the time slot not used by itself, and performs corresponding maintenance operations when the reset time slot arrives.
  • Receive time slot processing The first node according to each received time slot (ie, the time slot not used by the first node itself) newly received FI pair time slot state vector (table) and historical time slot state maintained by the corresponding reset time slot
  • the vector (table) is updated in real time.
  • the update rule of the historical slot state vector (table) is exactly the same as the slot state vector (table).
  • the first node When the reset slot of the first node arrives, the first node resets the historical slot state vector (table), and then copies the content recorded in the current slot state vector (table) to the historical slot state vector (table) ) Finally, reset the state of all time slots in the slot state vector (table).
  • the first node may apply for a new idle time slot recorded in the historical time slot state vector (table) maintained by the current corresponding reset time slot.
  • Time slot resource after selecting a new application time slot, the first node determines the new application time slot as a new reset time slot, and also needs to set the historical time slot status vector (table) and time slot status vector (Table) associated with the new reset time slot, correlating the historical time slot status vector (table) associated with the original reset time slot to the new reset time slot, and continuing to maintain, while clearing the original There is a slot state vector (table) associated with the reset slot association, and a slot state vector (table) initialized to a zero vector is associated with the new reset slot.
  • the second stage After receiving the time slot resource, the high-level service packet has been received.
  • the first node has updated the reset time slot, ie the new application time slot is set to the new reset time slot. Then, when the application time slot arrives, the first node needs to send the FI according to the current slot state vector (table) corresponding to the reset maintenance and maintenance, and reset all the time slots in the slot state vector (table) after transmitting the FI. For the historical slot state vector (table), since the information in the slot status vector (table) is part of the slot status information at this time, the table needs to be maintained continuously, and the reset processing cannot be performed.
  • the first node before the arrival of the next reset time slot, the first node also needs to update the time slot state vector (table) maintained by the corresponding reset time slot according to the FI received in each time slot not used by itself.
  • Historical time slot status vector (table) maintained by the corresponding reset time slot according to the FI received in each time slot not used by itself.
  • the first application scenario The maintenance operation of resetting the time slot during the channel access process.
  • this slotO is the reset time slot of node A, and at this time node A does not apply for a new time slot resource, node A resets the historical time slot state vector (table), and then the existing time The information recorded in the slot state vector (table) is copied into the historical slot state vector (table), and finally the state of all slots in the slot state vector (table) is reset.
  • node A has a high-level service packet arriving, and needs to apply for a new time slot resource.
  • node A selects a free time slot slot 1 according to the historical slot state vector (table), and at the same time
  • the reset time slot is updated to slot 1, and the slot state vector (table) associated with the original reset slot slot 0 is cleared, and a slot state vector (table) initialized to zero is associated with slot 1, and the original weight is
  • the historical slot state vector (table) associated with slot 0 is associated with slot 1.
  • Frame X+2 slot 1 this slotl is the new reset time slot
  • node A maps the slot status vector (table) to FI transmission, and resets all time slots in the slot status vector (table) after FI transmission status.
  • Frame X+3 Slot 1 Node A maintains the self-occupied time slot successfully, clears the historical time slot status vector (table), and then copies the information recorded in the current time slot status vector (table) to the historical time slot status vector (table)
  • the slot status vector (table) is mapped to FI transmission in combination with the node maintenance information, and the state of all slots is reset after the FI transmission.
  • the second application scenario is as follows: The single-table scheme resets the normal maintenance of the time slot and the processing operation of the collision.
  • this slotO is a reset time slot, associated with a historical time slot status vector (table) and time slot status vector (table).
  • node A clears the historical slot state vector (table), and then copies the information recorded in the existing slot state vector (table) into the historical slot state vector (table), and combines the node maintenance information,
  • the slot status vector (table) is mapped to FI transmission and the state of all time slots in the slot status vector (table) is reset after FI transmission.
  • Frame X slot 3 This slot 3 is a non-reset time slot and does not contain any information.
  • node A maps the slot state vector (table) associated with slotO to FI transmission.
  • Frame (X+l) slotO Similar to frame X slotO.
  • Frame (X+l) slot3 Similar to frame X slot3.
  • Frame (X+l) slot4 node A receives negative feedback and determines that slot 0 collides. Then, node A selects new slot resources in the idle slot according to the current historical slot state vector (table), assuming selection Slot 1 is the newly applied time slot. At this time, node A has an application slot slot1 and a self-occupied slot slot3. Then, node A selects a new reset slot as the slot 3 closest to the current slotlot4. Next, node A associates the currently maintained historical slot state vector (table) with slot 3, clears the slot state vector associated with slot 0 (table), and associates one for slot 3. A slot state vector (table) initialized to zero.
  • Frame (X+2) slotl this slotl is the new reset time slot.
  • Node A combines the node maintenance information, maps the slot status vector (table) to FI transmission, and resets the slot status vector after FI transmission ( Table) The status of all time slots in the table.
  • Frame (X+2) slot3 this slot3 is a non-reset time slot and does not contain any information.
  • node A combines the node maintenance information to map the slot state vector (table) associated with slotl to FI transmission.
  • Frame (X+3) slotl this slotl is the reset time slot
  • node A clears the historical slot state vector (table)
  • the slot status vector (table) is mapped to FI transmission, and the status of all slots in the slot status vector (table) is reset after FI transmission.
  • the third application scenario is as follows: The multi-table scheme resets the normal maintenance of the time slot and the processing operation of the collision.
  • Frame X slotO this slot 0 is the reset slot, associated with a historical slot status vector (table) and slot status vector (table).
  • node A clears the historical slot state vector (table), and then copies the information recorded in the current slot state vector (table) into the historical slot state vector (table), and combines the node maintenance information to the slot.
  • the state vector (table) is mapped to FI transmission and the state of all time slots in the slot state vector (table) is reset after FI transmission.
  • this slot 3 is a non-reset time slot, and only one slot state vector (table) is associated.
  • node A maps the slot status vector (table) to FI and resets all slots in the slot status vector (table) after FI transmission. Status.
  • Frame (X+l) slotO is similar to frame X slotO;
  • Frame (X+l) slot3 is similar to frame X slot3;
  • Frame (X+l) slot4 node A receives negative feedback and determines that slot 0 has collided. Node A selects a new slot resource in the idle slot according to the current historical slot state vector (table). If node A selects slot 1 as the newly applied slot, node A has its associated slot state vector (Table). At this time, since there is only one self-occupied slot 3 in front of the slot1, the node A copies the slot state vector (table) corresponding to the slot 3, and obtains the slot state vector associated with the slot 1 (table). Then, node A currently has only one self-occupied slot 3, then node A selects a new reset slot as slot 3, and then node A associates the currently maintained historical slot state vector (table) to slot 3, Clear the slot status vector (table) associated with slot 0.
  • Frame (X+2) slotl this slotl is a non-reset time slot, and only one slot state vector (table) is associated.
  • node A maps the slot state vector (table) associated with slot1 to FI transmission, and resets the state of all slots in the slot state vector (table) after FI transmission.
  • the first node includes a first control unit 70 and a second control unit 71, where
  • the first control unit 70 is configured to: according to the preset reset time slot associated with itself, when the reset time slot in each frame period arrives, first adjust the time slot state vector corresponding to the reset time slot (Table Copy the information recorded in the historical time slot status vector (table) corresponding to the reset time slot maintenance, reset the time slot status vector (table), and reset to the next Before the time slot arrives, the time slot state vector (table) and the historical time slot state vector (table) are updated in real time according to the received FI; the second control unit 71 is configured to determine that a new time slot needs to be applied at any time. When the resource is used, the time slot application is performed according to the slot state information recorded in the currently maintained historical slot state vector (table).
  • the first node device in this embodiment of the present application includes:
  • the processor 800 is configured to: according to the preset reset time slot associated with itself, when the reset time slot arrives in each frame period, first adjust the time slot state vector (table) corresponding to the reset time slot.
  • the recorded information is copied to the historical time slot state vector (table) corresponding to the reset time slot maintenance, and then the time slot state vector (table) is reset, and before passing to the next reset time slot, according to the transceiver
  • the received FI receives the above-mentioned slot status vector (table) and the historical slot status vector (table) in real time, and at any time, when it is determined that a new slot resource needs to be applied, according to the currently maintained historical slot status vector Time slot status information recorded in (Table) for time slot application;
  • the transceiver 810 is configured to send and receive data under the control of the processor 800.
  • the bus architecture may include any number of interconnected buses and bridges, specifically linked by one or more processors represented by processor 800 and various circuits of memory represented by memory 820.
  • the bus architecture can also link various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and, therefore, will not be further described herein.
  • the bus interface provides an interface.
  • Transceiver 810 can be a plurality of components, including a transmitter and a receiver, providing means for communicating with various other devices over the transport interface.
  • the processor 800 is responsible for managing the bus architecture and general processing, and the memory 820 can store data used by the processor 800 in performing the operations.
  • the processor 800 is responsible for managing the bus architecture and general processing, and the memory 820 can store data used by the processor 800 in performing operations.
  • the first node according to the preset reset time slot associated with itself, when the reset time slot in each frame period arrives, when resetting the corresponding reset time slot maintenance Before the slot state vector (table), copy the information recorded in the slot state vector (table) to the historical slot state vector (table) maintained by the corresponding reset slot, and after resetting the slot state vector Before the arrival of the next reset time slot, the above-mentioned time slot state vector (table) and historical time slot state vector (table) are updated in real time according to the received FI; and at any time, the first node determines that a new time slot needs to be applied.
  • the time slot application is performed according to the slot state information recorded in the currently maintained historical slot state vector (table).
  • the first node since the first node updates the historical slot state vector (table) in each reset slot and resets the slot state vector (table), the real-time performance and accuracy of the transmitted FI can be guaranteed. Avoiding the introduction of erroneous historical information and unnecessary negative feedback, and since the first node can select the application time slot resource according to the current slot state vector (table), thereby effectively ensuring the delay requirement of the high-level service packet, At the same time, the feasibility and reliability of the selected idle time slot are also ensured, and the collision of time slot resources is avoided, and further, the maintenance history can be alleviated.
  • the buffer space load caused by the slot status vector (table) reduces the processing amount before the FI is sent, thereby effectively reducing the processing delay and significantly and comprehensively improving the system performance.
  • the association relationship between the reset time slot and the self-occupied time slot in the case that the node has the self-occupied time slot is also described, and the node maintains the reset time slot in the case that the node has no self-occupied time slot.
  • the specific processing operation behavior of the node after the introduction of the reset time slot including the normal flow (application slot processing, transmission slot processing, receiving slot processing, reset processing) and exception processing (mainly time slot) In the case of a collision).
  • the new slot occupancy processing mechanism in the embodiment of the present application is further improved, so that the mechanism can be effectively implemented.
  • embodiments of the present application can be provided as a method, system, or computer program product.
  • the application can be in the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware.
  • the application can be in the form of a computer program product embodied on one or more computer-usable storage interfaces (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Landscapes

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

Abstract

本申请涉及通信领域,公开了一种时隙资源占用处理方法及装置。该方法为:当重置时隙到达时,先将对应重置时隙维护的时隙状态向量中记录的信息拷贝至对应重置时隙维护的历史时隙状态向量中,再重置时隙状态向量,以及在下一个重置时隙到达前,根据接收到的帧信息FI实时更新所述时隙状态向量和历史时隙状态向量;并且在任意时刻,当确定需要申请新的时隙资源时,根据当前维护的历史时隙状态向量中记录的时隙状态信息进行时隙申请。这样,能够保证发送的FI的实时性和准确性,避免引入错误的历史信息及不必要的负反馈,同时也保证了选择的空闲时隙的可行性和可靠性,避免了时隙资源的碰撞,减少FI发送前的处理量,从而有效减少了处理时延。

Description

一种时隙资源占用处理方法及装置
本申请要求在 2012年 11月 21 日提交中国专利局、 申请号为 201210477416.3、发明名 称为 "一种时隙资源占用处理方法及装置"的中国专利申请的优先权, 其全部内容通过引用 结合在本申请中。
技术领域
本申请涉及通信领域, 特别涉及一种时隙资源占用处理方法及装置。 背景技术
随着车载通信系统的发展和移动自组网技术的逐渐成熟, 为了实现对车辆的实时、 动 态、 智能化管理, 国际上专门开发了针对车联网的 DSRC ( Dedicated Short Range Communications, 专用短程通信)协议。 DSRC通过信息的双向传输, 将车辆与车辆、 车辆 和路侧的信息釆集设备有机的连接起来, 支持点对点、 点对多点通信。
MS-ALOHA ( Mobile Slotted Aloha, 移动分时隙 ALOHA )机制是一种基于分时方式 的 DSRC MAC ( Medium Access Control, 媒体接入控制)层接入和资源分配机制, 资源分 配基于帧结构以 slot(时隙)为单位。参阅图 1所示,每 N个 slot构成一个帧(记为 Frame ), 每个帧中的 slot的编号为 0 N-1 , 在帧之间循环往复。 每个 slot中只允许一个车辆进行发 送, 即车辆之间为 TDMA ( Time Division Multiple Access, 时分复用接入)模式。 车辆在 所占用的时隙上中不仅发送应用层的数据, 而且还需要发送 FI ( Frame Information, 帧信 息), 在 FI中会指示一个帧中各个 slot的占用状态。
MS-AL0HA机制的基本思想是: 任意一节点 (如, 车辆)加入网络时, 需要通过监 听时隙状态信息占用一个时隙, 如果节点不主动放弃该所占用的时隙资源, 则可一直使用 占用的时隙传输数据, 在这期间其他节点如果可以获知该时隙资源上有节点占用, 则不会 使用该时隙资源。 在占用的时隙上, 节点需要周期性发送 FI, FI中携带节点获得的与该节 点相距两跳范围内的其他节点占用时隙的情况以及自身的时隙状态信息, 指示节点感知到 的每个时隙的占用状况信息 (也称时隙状态信息、 时隙信息), 对每个时隙给出该时隙的: 时隙占用状态信息, 占用时隙的节点对应的 STI ( Source Temporary Identifier, 节点临时标 识)或可称为节点标识, 占用时隙的节点的优先级状态 (也可认为是占用时隙节点在该时 隙发送的数据对应的优先级状态); 其中, 时隙占用状态信息可以表达时隙的四种占用状 态: (00 )表示时隙为空闲状态, ( 10 )表示时隙已被与本节点相距一跳的其他节点占用(筒 称为一跳邻节点占用)或本节点占用, ( 11 )表示时隙已被与本节点相距两跳的其他节点占 用 (筒称为两跳邻节点占用), (01 )表示时隙已被其他两个以上的节点占用, 即为碰撞状 态; 在非自身占用的时隙, 每个节点通过监听相邻一跳的节点发送的 FI, 能够判断相邻三 跳范围内每个节点占用时隙的情况, 当发现本节点占用的时隙资源与其他节点使用的资源 发生碰撞时, 重新预约新的空闲时隙。 为方便后续描述, 本申请中对 FI及其内部信息内容 统一釆用如下描述方式:
节点发送帧信息称为: FI消息, 也可筒称为 FI;
FI 中指示的每个时隙对应的占用状况信息称为: FI 消息中每个时隙对应的时隙信息 域;
FI中每个时隙对应的占用状况信息中给出的三类信息(即: 时隙占用状态、 节点 STI、 本时隙优先级信息)分别称为: 每个时隙的时隙信息域中包含的时隙占用状态子域、 STI 子域、 优先级子域;
需要说明的是, 上述描述方式只是为了后续描述方便而规定, 当然也可以釆用其他的 描述方式。
在 MS-ALOHA机制下, 在对占用时隙的维护过程中, 节点需要维护 ( N- 1 ) *N时隙 状态緩存表,用来存储对应时隙上接收到的相邻节点发送的 FI消息中携带的各时隙的时隙 信息域。 例如, 参阅图 3所示, 图 3中展示的时隙状态緩存表的维数为 N*N维, 由于节点 本身在所占时隙发送的 FI 消息不需要存储, 因此节点实际维护的时隙状态緩存表为 N-1 行(假设每个节点只占用一个时隙), 本申请后续内容中描述的 (N-1 ) *N 时隙状态緩存 表均是指不保存节点本身占用时隙发送 FI的时隙信息; 其中, 时隙对应的检测域是指占用 该时隙发送的 FI消息中该时隙对应的时隙信息域称为该时隙的"检测域", "非检测域"是指 非占用该时隙发送的 FI中该时隙对应的时隙信息域称为该时隙的非"检测域"。其中 default 值为缺省值。
节点在一个时隙上接收到 FI消息时, 总是用新接收到的 FI消息中携带的时隙信息内 容覆盖时隙状态緩存表中对应时隙所在行的信息内容(即覆盖一个帧周期前记录的内容)。 具体过程如下:
节点在自身占用的时隙(也称发送时隙)生成并发送 FI消息, 需要按照一定规则填写 各个 field (域), 包括时隙占用状态子域、 STI子域以及优先级子域。 发送完毕后, 节点会 清空所发送的 FI信息。
发送完毕后, 清空时隙状态緩存表中 slot p对应的行。 只是此时不需要清空时隙状态 緩存表中 slot p对应的行(因为根本没有维护该行)。
节点在非自身占用的时隙 (也称发送时隙)上, 需要接收周围节点发送的 FI, 并才艮据 接收到的 FI更新时隙状态緩存表,在到达本节点自身占用的时隙前判断自身占用的时隙是 否维护成功及非自身占用时隙各时隙的占用状态, 其中, 当在非自身占用的时隙上没有接 收到 FI, 节点会将时隙状态緩存表中该时隙对应的行的各域填 default值。 Default值当前 按空闲状态 (00 )处理, 当然也可以定义其他处理方式。
例如, 节点维护(N-1 ) *N时隙状态緩存表并且在自占的 slot ( p+X*N )到达前判断 是否维护成功, 从 slot ( p + 1 )开始, 监听 N-1个 slot, 生成(N-1 ) *N时隙状态緩存表, 在 slot ( p + N - 1 ) 的结尾〔也就是 slot ( p + N ) 的开头〕, 判断 slot p对应的列的 N-1 个元素: 确认是否能继续维护此时隙资源。
然而, 现有技术下, 釆用 MS-AL0HA机制却会存在以下问题:
MS-AL0HA机制下, 节点要保存一帧内收到的每一个 FI , 在自占时隙统一处理, 节 点等待到发送时隙 (即自占时隙)处理完才能获取完整的信道占用信息, 进而才能进行时 隙资源的申请, 但是, 此时申请的时隙资源可能不能保证业务数据包的时延需求。
例如, 高层数据包(时延需求为 100ms即 1帧)在帧 N中的 时隙 1到达, 而节点当 前的发送时隙只有时隙 99 , 即节点只有到达了时隙 99时, 才能获取了完整一帧的信道占 用信息并进行申请时隙选择, 假定节点选择了时隙 50 为申请时隙用于发送高层业务包, 即帧 (N+1 ) 中的时隙 50 , 但是, 当帧 N+1中的时隙 1到达时, 在帧 N中的时隙 1便已 接收到的高层数据包此时已经超时丢包了; 显然, 这样会造成系统不必要的丢包, 严重时 会影响系统的传输性能。
另一方面, 在 MS-AL0HA机制下, 节点需要维护 N*N或者(N-1 ) *N大小的二维时 隙状态緩存表, 此种维护操作对存储的要求过高, 容易给节点造成运行负荷。 并且, 在 MS-AL0HA机制下, 节点是在发送 FI之前才对緩存的时隙状态緩存表进行处理, 这样也 会给处理器的处理能力带来一定的负荷。
针对上述种种问题, 需要在不影响系统性能的前提下, 重新设计一种时隙占用状态处 理机制, 能克服上述技术缺陷。 发明内容
本申请实施例提供一种时隙资源占用处理方法及装置, 用以在降低处理复杂度、 保证 系统性能的前提下, 有效满足高层数据包的传输时延要求。
本申请实施例提供的具体技术方案如下:
一种时隙资源占用处理方法, 包括:
第一节点按照预设的与自身关联的重置时隙, 在每个帧周期中的重置时隙到达时, 先 将对应所述重置时隙维护的时隙状态向量(表) 中记录的信息拷贝至对应重置时隙维护的 历史时隙状态向量 (表) 中, 再重置所述时隙状态向量 (表), 以及在下一个重置时隙到 达前,根据接收到的帧信息 FI实时更新所述时隙状态向量(表)和历史时隙状态向量(表); 在任意时刻, 第一节点确定需要申请新的时隙资源时, 根据当前维护的历史时隙状态 向量(表) 中记录的时隙状态信息进行时隙申请。
一种时隙资源占用处理装置, 包括:
第一控制单元, 用于按照预设的与自身关联的重置时隙, 在每个帧周期中的重置时隙 到达时, 先将对应所述重置时隙维护的时隙状态向量(表) 中记录的信息拷贝至对应重置 时隙维护的历史时隙状态向量 (表) 中, 再重置所述时隙状态向量(表), 以及在下一个 重置时隙到达前, 根据接收到的帧信息 FI实时更新所述时隙状态向量(表)和历史时隙状 态向量(表);
第二控制单元, 用于在任意时刻, 当确定需要申请新的时隙资源时, 根据当前维护的 历史时隙状态向量(表) 中记录的时隙状态信息进行新时隙申请。
本申请实施例中, 第一节点按照预设的与自身关联的重置时隙, 在每个帧周期中的重 置时隙到达时, 先将对应重置时隙维护的时隙状态向量(表) 中记录的信息拷贝至对应重 置时隙维护的历史时隙状态向量(表) 中, 再重置该时隙状态向量, 以及在下一个重置时 隙到达前, 根据接收到的 FI实时更新上述时隙状态向量(表)和历史时隙状态向量(表); 并且在任意时刻, 第一节点确定需要申请新的时隙资源时, 根据当前维护的历史时隙状态 向量(表) 中记录的时隙状态信息进行时隙申请。 这样, 由于第一节点会在每个重置时隙 对历史时隙状态向量(表)进行相应更新并且重置时隙状态向量 (表), 因此, 能够保证 发送的 FI 的实时性和准确性, 避免引入错误的历史信息及不必要的负反馈, 并且, 由于 第一节点可以根据当前的时隙状态向量(表) 随时选择申请时隙资源, 从而有效保证了高 层业务包的时延需求, 同时也保证了选择的空闲时隙的可行性和可靠性, 避免了时隙资源 的碰撞, 进一步的, 也可以减轻了因维护历史时隙状态向量(表)而造成的緩存空间负荷, 减少 FI发送前的处理量, 从而有效减少了处理时延, 显著地且全面地提升了系统性能。 附图说明
图 1为背景技术下超帧结构示意图;
图 2为背景技术下一种 FI结构见示意图;
图 3为背景技术及本申请实施例中时隙状态緩存表示意图;
图 4 为本申请实施例中时隙状态向量(表) 示意图;
图 5为本申请实施例中时隙类型示意图; 图 6为本申请实施例中第一节点进行时隙占用处理流程图;
图 7为本申请实施例中第一节点功能结构示意图;
图 8为本申请实施例第一节点设备结构示意图。 具体实施方式
本申请实施例中, 提出一种时隙状态向量(表)结合历史时隙状态向量(表) 的综合 时隙占用处理机制, 在该机制下, 上述两个表是关联在一起的, 统一对应节点的重置时隙 进行维护; 其中, 时隙状态向量(表)主要用于 FI映射, 历史时隙状态向量(表)用于时 隙资源的选择。
下面结合附图对本申请优选的实施方式进行详细说明。
本申请实施例中, 为了降低节点的维护工作量, 节点可以釆用迭代方式对帧中各时隙 的 FI进行维护。即节点仅保存一个关于各时隙当前占用状态的向量,称为时隙状态向量(也 可称作时隙状态表)后续称为时隙状态向量(表), 一种可能的时隙状态向量(表)如图 4 所示, 当节点接收到其他节点发送的 FI时, 根据新接收 FI中各时隙对应的时隙信息域对 本地保存的时隙状态向量(表) 中每一个时隙对应的时隙信息单元进行更新, 通过维护时 隙状态向量(表)的方式来对时隙信息进行维护。 当节点需发送自身判定的 FI时, 会根据 保存的时隙状态向量(表) 中的信息生成要发送的 FI。
需要说明的是, 上述描述方式只是为了后续描述方便而规定, 当然也可以釆用其他的 描述方式。
另一方面, 本申请实施例中, 一个节点可以占用多个时隙资源, 而当节点占用多个时 隙资源时, 为了对节点占用的多个时隙资源进行维护, 将与节点相关的时隙分为以下几类 (具体参阅图 5所示): 自占时隙。
2、 申请时隙: MAC层比较緩存队列中的需要发送的高层数据包的数据量和节点的自 占时隙或使用时隙 (包含申请时隙)可提供的传输容量, 如果数据包的数据量大于自占时 隙或使用时隙 (包含申请时隙)所可以提高的传输容量时申请的新的时隙。 在到达申请时 隙时, 若确定该申请时隙未被其他节点占用, 才会将申请时隙转换为自占时隙。
基于上述技术定义, 节点占用的时隙资源还可以釆用以下方式划分:
1 ) 节点使用时隙 (也可筒称为使用时隙、 发送时隙): 为方便后续描述, 将节点占用 的时隙和节点正在申请的时隙统称为节点使用时隙。 在一些特定场景中, 节点使用时隙也 可以只包括节点占用的时隙。
2 ) 非节点使用时隙 (也可以筒称为接收时隙): 帧中所有时隙中除节点使用时隙以外 的所有其他时隙。
本申请实施例中, 由于第一节点可以申请使用多个时隙, 在每个时隙处第一节点感知 的信道使用状态可能存在差别, 当第一节点使用多个时隙时可以釆用但不限于以下两种方 式来维护各时隙感知的时隙状态向量(表):
第一种方式为: 单表方案。
所谓单表方案即是指: 当第一节点在每一个帧周期中可以占用多个时隙发送高层数据 时, 如果自占时隙和申请时隙的总数目大于 1 , 则第一节点仍可以在本地仅维护一个时隙 状态向量(表) 来记录多个自占时隙和 /或申请时隙的时隙状态信息。
在使用单表方案时, 第一节点在非自身使用的时隙接收到其它节点发送的 FI时,根据 接收到的 FI中各时隙对应的时隙信息域中的信息更新时隙状态向量(表)中每一个时隙对 应的时隙信息单元, 将时隙状态信息的变化体现到更新后的时隙状态向量(表) 中; 第一 节点在到达每一个自占时隙 〔或申请时隙 (当认为申请时隙只有真正发送数据后才能变为 自占时隙时, 才可能出现使用申请时隙发送 FI, 否则 FI只能在自占时隙上发送)〕, 根据 当前的时隙状态向量(表) 内容组织生成 FI并发送。
当釆用时隙状态向量(表) 方式维护时隙状态信息时, 第一节点维护的时隙状态向量 (表)在每帧设定时隙 (如, 重置时隙)处, 在发送 FI后进行重置, 其它时隙发送 FI后 不重置时隙状态向量(表) 中的各时隙对应的信息单元。
第二种方式为: 多表方案。
所谓多表方案即是指: 当第一节点在每一个帧周期中可以占用多个时隙发送高层数据 时, 如果自占时隙和申请时隙总数目大于 1 , 则第一节点可以在本地分别为每一个自占时 隙和申请时隙维护对应的时隙状态向量(表)。
在使用多表方案时, 第一节点在非自身使用的时隙接收到其它节点发送的 FI时,根据 接收到的 FI中各时隙对应的时隙信息域中的信息更新每个对应的时隙状态向量(表)中各 时隙对应的时隙信息单元, 将时隙状态信息的变化体现到更新后的每个时隙对应的时隙状 态向量(表) 中; 第一节点在到达每一个自占时隙 〔或申请时隙 (当认为申请时隙只有正 真发送数据后才能变为自占时隙时, 才可能出现使用申请时隙发送 FI , 否则 FI只能在自 占时隙上发送)〕 时, 根据当前自占时隙 (或申请时隙)对应的时隙状态向量(表) 内容 组织生成 FI并发送; 其中, 所述节点的 FI中的其它自占时隙的信息域内容可以从所述节 点的其它自占时隙对应的时隙状态向量(表) 中获得。 第一节点在某一自占时隙发送 FI后, 当釆用时隙状态向量(表)维护时隙状态信息时, 清除发送 FI的自占时隙对应的时隙状态向量(表)中除了本自占时隙以外的其他时隙对应 的时隙信息单元。
基于上述定义, 参阅图 6所示, 本申请实施例中, 第一节点进行时隙占用处理的详细 流程如下:
步骤 600: 第一节点按照预设的与自身关联的重置时隙, 在每个帧周期中的重置时隙 到达时, 先将对应重置时隙维护的时隙状态向量(表) 中记录的信息拷贝至对应重置时隙 维护的历史时隙状态向量(表) 中, 再重置该时隙状态向量(表), 以及在下一个重置时 隙到达前, 根据接收到的 FI实时更新上述时隙状态向量(表)和历史时隙状态向量(表)。
与现有技术不同, 本申请实施例中, 每一个节点预设关联一个重置时隙, 在该重置时 隙需要维护两类时隙状态信息一一时隙状态向量(表)和历史时隙状态向量(表); 其中, 时隙状态向量(表)主要用于 FI映射, 历史时隙状态向量(表)用于时隙资源的选择。 历 史时隙状态向量(表)与时隙状态向量(表)的结构类似, 都是由多个时隙信息单元构成, 每个时隙信息单元中的时隙占用状态子单元用于指示帧内的一个时隙的状态。
本实施例中, 第一节点在设置自身的重置时隙时, 可以釆用但不限于以下方法: 可以 将重置时隙转换标为申请时隙。 若第一节点当前维护有发送时隙, 则选取任意一个本节点 维护的发送时隙作为重置时隙; 或者, 第一节点将开机时间所在时隙之后的第 (N-1 ) 个 时隙设置为重置时隙, 其中, N表示一帧内的时隙数目; 或者, 若第一节点当前未维护发 送时隙, 则选取任意一个时间点作为重置时隙; 在后续流程中, 若第一节点才 居高层业务 需求判定需要申请新的时隙资源时, 可以将新的申请时隙转换为重置时隙, 这一点将在后 续实施例中进行详述。
另一方面, 第一节点可以釆用单表方式或多表方式维护时隙状态向量(表), 同时还 需要维护历史时隙状态向量 (表), 该历史时隙状态向量 (表)在第一节点的每个帧周期 中的重置时隙更新, 即第一节点会在重置时隙 (也是自占时隙 / 申请时隙)根据当前保存 的时隙状态向量(表)组织并发送自身的 FI, 并在发送 FI后, 在重置时隙状态向量(表) 之前, 将当前时隙状态向量(表) 中记录的内容复制到历史时隙状态向量(表) 中, 覆盖 历史时隙向量(表) 中之前保存的内容, 以及在下一个重置时隙到达前, 根据接收到的 FI (其他节点发送的) 实时更新时隙状态向量(表)和历史时隙状态向量(表)。 这样, 时 隙状态向量(表) 中始终保存有第一节点监听到的至多一帧的时隙状态信息, 而历史时隙 状态向量(表) 中却保存有第一节点监听到的至少一帧至多两帧的时隙状态信息, 从而能 够保证第一节点可以在任意时刻, 都可以获知从当前时刻往前推至少完整一帧时间内的信 道占用情况, 进而可以根据此时的信道占用情况选择申请时隙。
步骤 610: 在任意时刻, 第一节点确定需要申请新的时隙资源时, 根据当前维护的历 史时隙状态向量(表) 中记录的时隙状态信息进行时隙申请。
具体的, 第一节点根据在接收时隙(即非自身使用的时隙, 即自占时隙也非申请时隙) 接收到的 FI确定自身使用的时隙发生碰撞时,根据当前对应重置时隙维护的历史时隙状态 向量(表)中记录的时隙状态信息申请新的时隙资源; 或 /和, 第一节点接收到新的高层业 务包后, 确定本节点当前用于承载高层业务包的时隙数目不能满足发送需求时, 根据当前 维护的历史时隙状态向量(表) 中记录的时隙状态信息申请新的时隙资源。
其中, 在申请新的时隙资源时, 第一节点可以才 居时隙状态信息优先选择空闲时隙作 为新的申请时隙资源, 也可以在不存在空闲时隙的时候, 选择三跳邻节点占用的时隙资源 作为新的申请时隙资源, 较佳的, 后续实施例中, 以在空闲时隙中选择新的时隙资源为例 进行介绍。
另一方面, 第一节点在接收到高层业务包之后, 若确定当前发送时隙数目不能满足发 送需求, 则可以立即根据当前对应重置时隙维护的历史时隙状态向量(表)选择申请时隙; 或者, 也可以在确定本节点的第一个重置时隙已经到达之后, 再才 居当前对应重置时隙维 护的历史时隙状态向量(表)选择申请时隙; 其中, 若第一节点针对自身使用的各个时隙 分别维护相应的时隙状态向量 (即釆用多表方案), 则选择申请时隙后, 第一节点还需要 进一步对应该申请时隙关联相应的时隙状态向量, 如, 在选择新的时隙资源后, 第一节点 选择未来时隙里距离新申请的时隙最近的原自占时隙, 将其关联的时隙状态向量重新关联 至新申请的时隙。
由步骤 600中记录的内容可知, 由于相较于时隙状态向量(表) 而言, 历史时隙状态 向量(表) 中保存有至少完整 1帧的时隙状态信息, 因此, 历史时隙状态向量(表) 中记 录的迭代内容更能准确地反映空闲时隙的真正状态, 即历史时隙状态向量(表) 中记录的 空闲时隙通常为真正的空闲时隙, 因而, 基于历史时隙状态向量(表) 来确定空闲时隙并 申请新的时隙资源, 更能有效地避免新申请的时隙资源发生碰撞, 进而有效避免因资源碰 撞而发生再次申请的情况, 有效地保障的时隙资源的可靠性, 降低了系统运算量。
下面分别针对第一节点选取自占时隙作为重置时隙和选取任意一个时间点作为自占 时隙这两种情况, 对第一节点的时隙占用处理过程进行介绍。 而具体的处理过程又分为时 隙资源正常 (即未发生碰撞)和发生碰撞两类情况, 其中, 对于正常情况, 第一节点需要 考虑申请时隙的处理、 发送处理、 接收处理以及重置处理, 申请时隙的处理可以发生在任 何一个时间点, 而重置时隙由于是第一节点的一个自占时隙, 因此可以将重置处理放在发 送时隙处理。
第一种情况下, 第一节点当前存在自占时隙 (即发送时隙)。
此时, 历史时隙状态向量(表) 必须与时隙状态向量(表)相关联, 即统一使用同 一个重置时隙。 考虑到本申请实施例中, 单表方案中第一节点只维护一个时隙状态向量 (表), 而多表方案中第一节点维护多个时隙状态向量(表), 两者的处理有差别, 这里仍 然针对单表和多表方案进行分别说明。
1、 第一节点釆用单表方案维护时隙状态向量(表), 即无论第一节点同时占用几个时 隙, 第一节点内部针对自身使用的各个时隙只维护一个一维时隙状态向量(表)。
此时, 由于重置时隙是节点的一个自占时隙, 则对应该重置时隙需要维护历史时隙状 态向量(表)和时隙状态向量(表), 而对应其他自占时隙, 则不需要维护任何信息。
在第一节点能够使用的时隙未发生碰撞的情况(即正常情况下), 第一节的处理流程 如下:
接收时隙处理: 重置时隙只是自占时隙之一, 其他时隙不维护任何信息。 在每一个接 收时隙 (即非第一节点自身使用的时隙), 第一节点接收其他节点发送的 FI, 并根据接收 的 FI实时地对维护的时隙状态向量(表) 以及历史时隙状态向量(表)进行更新。 历史时 隙状态向量(表) 的更新规则与时隙状态向量(表)是完全一致的。
发送时隙处理: 第一节点在发送时隙 (即第一节点自身使用的时隙, 如, 自占时隙) 需要做以下两种操作:
Al、 发送 FI。 第一节点在所有的自占时隙都需要发送 FI, 即此时第一节点将当前对 应重置时隙维护的时隙状态向量(表) 映射为 FI发送。
本申请实施例中, "发送 FI "和"将时隙状态向量(表)中的信息拷贝至历史时隙状态向 量(表)中"这两个操作均在重置时隙状态向量(表)之前执行, 但这两个操作之间并没有 特定的执行顺序, 可以并行, 也可以按照设定顺序先后执行。 后续相关操作均按照此种方 式执行, 将不再赘述。
A2、 重置处理。 由于针对非重置时隙所在的自占时隙不维护任何信息, 因而, 在非重 置时隙所在的自占时隙不需要执行任何重置处理; 而在重置时隙所在的自占时隙, 第一节 点在发送完 FI之后, 需要对历史时隙状态向量 (表)和时隙状态向量(表)做重置处理, 即清空历史时隙状态向量(表), 然后将当前对应重置时隙维护的时隙状态向量 (表) 中 记录的内容拷贝至历史时隙状态向量(表) 中, 最后清空该时隙状态向量(表) 中所有时 隙的状态。
时隙申请处理: 当第一节点根据高层业务需求确定需要申请新的时隙资源时, 由于对 应此次申请的时隙资源不需要维护任何信息, 则第一节点只需根据当前对应重置时隙维护 的历史时隙状态向量(表)选择空闲时隙进行申请即可。
当然, 在釆用单表方案实施上述流程的的过程 , 在第一节点进行时隙占用处理过程 中,第一节点使用的时隙很可能会因为与其他节点使用的时隙冲突而发生资源碰撞,此时, 才 居碰撞类型的不同, 第一节点可以作出不同的碰撞处理, 具体为:
Bl、 确定发生碰撞的时隙为重置时隙所在的自占时隙或申请时隙时, 第一节点判断是 否需要申请新的时隙资源, 若是, 则第一节点需要按照当前对应重置时隙维护的历史时隙 状态向量(表) 中记录的空闲时隙申请新的时隙资源, 并重新选择重置时隙, 以及对应重 新选择的重置时隙关联设置相应的时隙状态向量(表)和历史时隙状态向量(表); 否则, 直接重新选择重置时隙, 并在选择完重置时隙之后, 对重新选择的重置时隙关联相应的时 隙状态向量(表)和历史时隙状态向量(表)。
其中, 在选择新的重置时隙时, 较佳的, 第一节点一般选择在未来的时隙里距离当前 执行资源碰撞判定的时隙最近的自占时隙或申请时隙为新的重置时隙, 进一步的, 在对应 重新选择的重置时隙关联设置相应的时隙状态向量(表)和历史时隙状态向量(表) 时, 较佳的, 第一节点可以将原有重置时隙关联的历史时隙状态向量(表) 关联到重新选择的 重置时隙上, 并继续维护, 以及清除原有重置时隙关联的时隙状态向量(表), 并对应重 新选择的重置时隙关联一个初始化为零向量的时隙状态向量(表), 或者, 将原有重置时 隙关联的时隙状态向量(表)进行部分回退后关联至新的重置时隙上。
在确定时隙发生碰撞, 并完成申请新的时隙资源, 选择新的重置时隙、 以及对新的重 置时隙关联相应的时隙状态向量(表)和历史时隙状态向量(表)之后, 在下一个重置时 隙到达之前, 第一节点根据接收到的 FI实时更新上述时隙状态向量和历史时隙状态向量, 并在重新选择的重置时隙到达后, 根据当前维护的时隙状态向量(表)发送 FI, 以及在 FI 发送后, 对当前维护的时隙状态向量进行重置处理, 即重置时隙状态向量(表) 中所有时 隙的状态, 此时不能对对应重置时隙维护的历史时隙状态向量(表)进行拷贝, 因为此时 对应重置时隙维护的时隙状态向量(表) 中的信息是部分时隙状态信息, 需要持续维护历 史时隙状态向量(表)。
B2、 确定发生碰撞的时隙为非重置时隙所在的自占时隙或申请时隙时, 第一节点判断 是否需要申请新的时隙资源, 若是, 则第一节点仅需要按照当前维护的历史时隙状态向量 (表) 中记录的空闲时隙申请新的时隙资源, 此时, 对应新申请的时隙资源不需要维护任 何信息; 否则, 不执行任何操作。
2、 第一节点釆用多表方案维护时隙状态向量(表), 即当第一节点发送数据需要使用 多个时隙时, 分别针对每个自身使用的时隙 (即发送时隙) 维护一个一维时隙状态向量
(表), 则第一节点内部需要维护多个一维时隙状态向量(表)。
此时, 由于重置时隙是第一节点的一个自占时隙, 则该时隙需要维护两套表: 时隙状 态向量(表)和历史时隙状态向量 (表), 对于其他自占时隙, 只需要维护时隙状态向量 (表)信息。
在第一节点能够使用的时隙未发生碰撞的情况下 (即正常情况下), 第一节点的处理 流程如下:
接收时隙处理: 重置时隙只是自占时隙之一, 在其他自占时隙也需要维护相关信息, 因此相较于单表方案接收处理也有所差别。
对于重置时隙所在的自占时隙维护的时隙状态向量(表)和历史时隙状态向量而言, 第一节点根据在每一个非自身使用的时隙(即接收时隙)新接收的 FI实时对该时隙状态向 量(表) 以及历史时隙状态向量(表)进行更新, 历史时隙状态向量(表) 的更新规则与 时隙状态向量(表)是完全一致的。
而对于非重置时隙所在的自占时隙维护的时隙状态向量(表), 第一节点根据在每一 个非自身使用的时隙 (即接收时隙)新接收的 FI对该时隙状态向量(表)进行更新。
发送时隙处理: 第一节点在发送时隙 (即第一节点自身使用的时隙, 如, 自占时隙) 需要做以下两件操作:
Cl、 发送 FL。 第一节点在每一个自占时隙均会将其当前对应的时隙状态向量(表) 映射为 FI发送。
C2、 重置处理。 重置时隙所在的自占时隙与其他自占时隙的处理存在差别。 在第一节 点的重置时隙所在的自占时隙到达时,第一节点发送 FI之后,清空历史时隙状态向量(表), 然后将当前对应重置时隙维护的时隙状态向量(表) 中记录的信息拷贝至历史时隙状态向 量(表) 中, 最后, 清空该时隙状态向量(表) 中所有时隙的状态。 而在第一节点的非重 置时隙所在的自占时隙到达时, 第一节点发送 FI之后,对该自占时隙关联的时隙状态向量 (表)进行重置处理, 即清空该自占时隙关联的时隙状态向量(表)。
时隙申请处理: 当高层业务包到达时, 若第一节点判定需要申请新的时隙资源, 则第 一节点可以根据当前对应重置时隙维护的历史时隙状态向量(表)选择空闲时隙进行申请, 并为新申请的时隙关联相应的时隙状态向量(表)。 当第一节点存在多个自占时隙时, 因 为每一个自占时隙都关联着一个时隙状态向量(表), 因此第一节点可以选择绝对时间轴 靠前的距离选择的新申请的时隙最近的原自占时隙, 将其关联的时隙状态向量(表)进行 拷贝, 得到新申请的时隙相关联的时隙状态向量(表)。 当然, 在釆用多表方案实施上述流程的过程中, 在第一节点进行时隙占用 处理过程中, 第一节点使用的时隙很可能会因为与其他节点使用的时隙冲突而
发生资源碰撞, 此时, 才 居碰撞类型的不同, 第一节点可以作出不同的碰撞处
理, 具体为:
Dl、 确定发生碰撞的时隙为重置时隙所在的自占时隙或申请时隙时, 第一
节点判断是否需要申请新的时隙资源, 若是, 则第一节点需要按照当前对应重置时隙 维护的历史时隙状态向量(表) 中记录的空闲时隙申请新的时隙资源, 并重新选择重置时 隙, 以及对应重新选择的重置时隙关联设置相应的时隙状态向量 (表)和历史状态向量 (表); 否则, 直接重新选择重置时隙, 以及对应重新选择的重置时隙关联设置相应的时 隙状态向量(表)和历史时隙状态向量(表)。
其中, 在选择新的时隙资源后, 第一节点可以选择未来时隙里距离选择的新申请的时 隙最近的原自占时隙, 将其关联的时隙状态向量(表)进行拷贝, 得到新申请的时隙关联 的时隙状态向量(表)。
而另一方面, 无论是否选择了新的时隙资源, 第一节点在重新选择重置时隙时, 较佳 的, 第一节点一般选择在时间轴上靠前的距离当前执行资源碰撞阉割判定的时隙最近的自 占时隙或申请时隙为新的重置时隙, 进一步的, 在对应重新选择的重置时隙关联设置相应 的时隙状态向量(表)和历史时隙状态向量(表) 时, 较佳的, 第一节点可以将原有重置 时隙关联的历史时隙状态向量(表) 关联到重新选择的重置时隙上, 并继续维护, 以及清 除原有重置时隙关联的时隙状态向量(表), 并对重新选择的重置时隙关联一个初始化为 零向量的时隙状态向量(表)。
在确定时隙发生碰撞, 并完成申请新的时隙资源, 选择新的重置时隙、 以及对新的重 置时隙关联相应的时隙状态向量(表)和历史时隙状态向量(表)之后, 在下一个重置时 隙到达之前, 第一节点根据接收到的 FI实时更新对应重置时隙维护的时隙状态向量(表) 和历史状态向量 (表), 以及实时更新对应除重置时隙之外的各个自身使用的时隙维护的 时隙状态向量(表), 并在下一个重置时隙到达后, 根据当前对应重置时隙维护的时隙状 态向量发送 FI, 以及在 FI发送后, 对当前对应重置时隙维护的时隙状态向量(表)进行 重置处理, 即重置该时隙状态向量(表) 中所有时隙的状态。 此时不能对对应重置时隙维 护的历史时隙状态向量(表)进行拷贝, 因为此时对应重置时隙维护的时隙状态向量(表) 中的信息是部分时隙状态信息, 需要持续维护历史时隙状态向量 (表)。 换言之, 在重新 选择的重置时隙到达时, 第一节点清空历史时隙状态向量 (表), 然后将新的重置时隙关 联的时隙状态向量 (表) 当前记录的内容拷贝至历史时隙状态向量(表), 同时, 第一节 点结合当前维护的时隙状态向量(表)生成并发送 FI, 并在 FI发送后重置时隙状态向量
(表) 中所有时隙的状态。
另一方面, 若确定发生碰撞的时隙为非重置时隙所在的自占时隙或申请时隙, 则第一 节点根据当前的历史时隙状态向量(表) 申请新的时隙资源后, 选择未来时隙里距离新申 请的时隙最近的原自占时隙, 将其关联的时隙状态向量(表)进行拷贝, 得到新申请的时 隙相关联的时隙状态向量(表)。
D2、 确定发生碰撞的时隙为非重置时隙所在的自占时隙或申请时隙时, 第一节点判断 是否需要申请新的时隙资源, 若是, 则第一节点仅需要按照当前维护的历史时隙向量(表) 中记录的空闲时隙申请新的时隙资源, 并为新申请的时隙关联相应的时隙状态向量(表), 较佳的, 第一节点可以选择在绝对时间轴上靠前的距离选择的新申请的时隙最近的原自占 时隙, 将其关联的时隙状态向量(表)进行拷贝, 得到新申请的时隙关联的时隙状态向量 (表)。
第二种情况下, 第一节点当前不存在自占时隙。
此时, 第一节点可以将开机所在时隙之后的第 (N-1 )个时隙设置为重置时隙, 并维 护相应的时隙状态向量 (表)和历史时隙状态向量 (表), 在此种情况下, 第一节点没有 发送时隙, 当判定需要申请新的时隙资源时, 则需要进行时隙资源的申请, 整个过程分成 以下两个阶段:
第一阶段为: 还未出现高层业务, 第一阶段可能是任意时长。
此时不存在发送时隙, 第一节点在非自身使用的时隙接收其他节点发送的 FI, 并在重 置时隙到达时, 做相应的维护操作。
接收时隙处理: 第一节点根据每一个接收时隙 (即非第一节点自身使用的时隙)新接 收的 FI对对应重置时隙维护的时隙状态向量(表)以及历史时隙状态向量(表)进行实时 更新。 历史时隙状态向量(表) 的更新规则与时隙状态向量(表)是完全一致的。
在第一节点的重置时隙到达时, 第一节点重置历史时隙状态向量 (表), 然后将现在 的时隙状态向量 (表) 中记录的内容拷贝至历史时隙状态向量 (表), 最后, 重置时隙状 态向量(表) 中所有时隙的状态。
当高层业务包到达时, 若第一节点判定需要申请新的时隙资源, 则第一节点可以根据 当前对应重置时隙维护的历史时隙状态向量(表) 中记录的空闲时隙申请新的时隙资源, 在选择完新的申请时隙之后, 第一节点将新的申请时隙确定为新的重置时隙, 并且还需要 将历史时隙状态向量(表)和时隙状态向量(表) 与新的重置时隙相关联, 即将原有重置 时隙关联的历史时隙状态向量(表) 关联到新的重置时隙上, 并继续维护, 同时, 清除原 有重置时隙关联的时隙状态向量(表), 并为新的重置时隙关联一个初始化为零向量的时 隙状态向量(表)。
第二阶段: 已接收到高层业务包申请了时隙资源之后。
此时,第一节点已经更新了重置时隙,即将新的申请时隙设置为新的重置时隙。那么, 当该申请时隙到达时, 第一节点需要根据当前对应重置维护维护的时隙状态向量(表)发 送 FI, 并在发送 FI后重置时隙状态向量(表) 中所有时隙的状态; 对于历史时隙状态向 量 (表), 由于此时时隙状态向量 (表) 中的信息是部分时隙状态信息, 因此, 需要持续 维护这个表, 不能做重置处理。
当然, 此时, 第一节点在下一个重置时隙到达前, 也需要根据在每一个非自身使用的 时隙接收的 FI 实时地更新对应重置时隙维护的时隙状态向量(表)和历史时隙状态向量 (表)。
下面结合具体的应用场景对上述实施例作出进一步详细说明。
第一种应用场景: 信道接入过程中重置时隙的维护操作。
参阅表 1所示, 假设每 N个 slot (时隙)构成一个 Frame (帧), N = 5 , 节点 A刚启 动, 节点 B占用时隙 2, 以下只讨论节点 A的行为。
frame X slot 0, 节点 A开始启动, 从此时开始监听信道, 假设此时节点 A的高层无数 据发送需求。 节点 A持续监听, 设置 slot 0为重置时隙, 即在时隙 0节点 A关联历史时隙 状态向量(表)和时隙状态向量(表), 因为节点 A刚启动, 因而此时上述历史时隙状态 向量(表)和时隙状态向量都为零。
frame X slot 2,节点 B发送 FI,假设节点 A正确接收解码节点 B发送的 FI,节点 A使 用该 FI中每一个时隙的时隙信息域, 更新本地维护的时隙状态向量(表)以及时隙历史状 态向量(表) 中对应时隙的时隙信息单元。
frame X+ 1 slotO , 此 slotO为节点 A的重置时隙,且此时节点 A并没有申请新的时隙资 源, 则节点 A重置历史时隙状态向量(表), 然后将现有的时隙状态向量(表) 中记录的 信息拷贝至历史时隙状态向量(表)中, 最后重置时隙状态向量(表)中所有时隙的状态。
frame X+1 slot 3 , 此时, 节点 A有高层业务包到达, 需要申请新的时隙资源, 此时, 节点 A根据历史时隙状态向量(表)选择一个空闲时隙 slot 1 , 同时将重置时隙更新为 slot 1 , 以及清除原重置时隙 slot 0关联的时隙状态向量(表), 并为 slot 1关联一个初始化为零 的时隙状态向量(表),再将原重置时隙 slot 0关联的历史时隙状态向量(表)关联到 slot 1。
frame X+2 slot 1 ,此 slotl为新的重置时隙,节点 A将时隙状态向量(表)映射为 FI发 送, 并在 FI发送后重置时隙状态向量(表) 中所有时隙的状态。 frame X+3 Slot 1 , 节点 A维护自占时隙成功, 清空历史时隙状态向量(表), 然后将当 前的时隙状态向量(表) 中记录的信息拷贝至历史时隙状态向量(表) 中, 同时, 结合节 点维护信息将时隙状态向量(表) 映射成 FI发送, 并在 FI发送后重置所有时隙的状态。
表 1
Figure imgf000017_0001
第二种应用场景: 单表方案下重置时隙正常维护和发生碰撞的处理操作。
参阅表 2所示,假设每 N个 slot构成一个 Frame, N = 5 , 节点 A维护两个时隙: slot 0 和 slot 3, 且设置 slot 0为重置时隙, 此时釆用的是单表方案。
frame X slotO , 此 slotO为重置时隙, 关联一个历史时隙状态向量(表)和时隙状态向 量(表)。 此时, 节点 A清空历史时隙状态向量(表), 然后将现有的时隙状态向量(表) 中记录的信息拷贝至历史时隙状态向量(表) 中, 同时结合节点维护信息, 将时隙状态向 量(表) 映射成 FI发送, 并在 FI发送之后重置时隙状态向量(表) 中所有时隙的状态。
frame X slot 3 , 此 slot3为非重置时隙, 不关联任何信息。 此时, 节点 A将 slotO关联 的时隙状态向量(表) 映射成 FI发送。
frame (X+l) slotO , 与 frame X slotO 类似。
frame (X+l) slot3 , 与 frame X slot3 类似。
frame (X+l) slot4 , 节点 A接收到负反馈, 判定 slot 0发生碰撞, 那么, 节点 A根据 当前的历史时隙状态向量(表)在空闲时隙中选择新的时隙资源, 假设选择 slot 1为新申 请的时隙, 则此时, 节点 A有一个申请时隙 slotl和一个自占时隙 slot3 , 那么, 节点 A选 择新的重置时隙为距离当前时隙 slot4最近的 slot 3 , 接着, 节点 A将当前维护的历史时隙 状态向量(表)关联到 slot 3 , 清除 slot 0关联的时隙状态向量(表), 并为 slot 3关联一个 初始化为零的时隙状态向量(表)。
frame (X+2) slotl , 此 slotl为新的重置时隙, 节点 A结合节点维护信息, 将时隙状态 向量(表) 映射成 FI发送, 并在 FI发送后重置时隙状态向量(表) 中所有时隙的状态。
frame (X+2) slot3 , 此 slot3为非重置时隙, 不关联任何信息。 此时, 节点 A结合节点 维护信息, 将 slotl关联的时隙状态向量(表) 映射成 FI发送。
frame (X+3) slotl , 此 slotl为重置时隙, 节点 A清空历史时隙状态向量(表), 然后将 时隙状态向量(表) 中记录的信息拷贝至历史时隙状态向量(表) 中, 再结合节点维护信 息, 将时隙状态向量(表) 映射成 FI发送, 并在 FI发送后重置时隙状态向量(表) 中所 有时隙的状态。
表 2
Figure imgf000018_0001
第三种应用场景: 多表方案下重置时隙正常维护和发生碰撞的处理操作。
参阅表 3所示, 假设每 N个 slot构成一个 Frame, N = 5 , 节点 A维护两个时隙: slotO 和 slot 3, 且设置 slot 0为重置时隙, 此时釆用的是多表方案。
frame X slotO , 此 slot 0为重置时隙, 关联一个历史时隙状态向量(表)和时隙状态向 量(表)。 此时, 节点 A清空历史时隙状态向量(表), 然后将当前时隙状态向量(表) 中 记录的信息拷贝至历史时隙状态向量(表) 中, 同时结合节点维护信息, 将时隙状态向量 (表) 映射成 FI发送, 并在 FI发送之后重置时隙状态向量(表) 中所有时隙的状态。
frameX slot 3 ,此 slot3为非重置时隙,只关联一个时隙状态向量(表)。此时节点 A将 时隙状态向量(表)映射成 FI , 并在 FI发送之后重置时隙状态向量(表) 中所有时隙的 状态。
frame (X+l) slotO 与 frame X slotO 类似;
frame (X+l) slot3与 frame X slot3 类似;
frame (X+l) slot4 , 节点 A接收到负反馈, 判定 slot 0发生碰撞。 节点 A根据当前的 历史时隙状态向量(表)在空闲时隙中选择新的时隙资源, 假设节点 A选择 slot 1为新申 请的时隙, 则节点 A为其关联时隙状态向量(表), 此时, 由于在 slotl的前面只有一个自 占时隙 slot 3 , 则节点 A将对应 slot 3维护的时隙状态向量(表)进行拷贝, 得到 slot 1关 联的时隙状态向量(表); 那么, 节点 A当前只有一个自占时隙 slot 3 , 则节点 A选择新的 重置时隙为 slot 3 , 接着, 节点 A将当前维护的历史时隙状态向量(表) 关联到 slot 3 , 清 除 slot 0关联的时隙状态向量(表)。
frame (X+2) slotl , 此 slotl为非重置时隙, 只关联一个时隙状态向量(表)。 此时, 节 点 A将此 slotl关联的时隙状态向量(表)映射成 FI发送, 并在 FI发送之后重置时隙状 态向量(表) 中所有时隙的状态。
frame (X+2) slot3 , 此 slot3为新的重置时隙, 节点 A清空此 slot3关联的历史时隙状态 向量(表), 然后将关联的时隙状态向量(表)中记录的信息拷贝至历史时隙状态向量(表) 中, 再结合节点维护信息, 将时隙状态向量(表)映射成 FI发送, 并在 FI发送后重置时 隙状态向量(表) 中所有时隙的状态。
表 3
Figure imgf000019_0001
基于上述实施例中, 参阅图 7所示, 本申请实施例中, 第一节点包括第一控制单元 70 和第二控制单元 71 , 其中,
第一控制单元 70 , 用于按照预设的与自身关联的重置时隙, 在每个帧周期中的重置时 隙到达时, 先将对应重置时隙维护的时隙状态向量(表) 中记录的信息拷贝至对应重置时 隙维护的历史时隙状态向量 (表) 中, 再重置该时隙状态向量 (表), 并在到下一个重置 时隙到达前,根据接收到的 FI实时更新上述时隙状态向量(表)和历史时隙状态向量(表); 第二控制单元 71 , 用于在任意时刻, 当确定需要申请新的时隙资源时, 根据当前维护 的历史时隙状态向量(表) 中记录的时隙状态信息进行时隙申请。
如图 8所示, 本申请实施例第一节点设备包括:
处理器 800, 用于按照预设的与自身关联的重置时隙, 在每个帧周期中的重置时隙到 达时, 先将对应重置时隙维护的时隙状态向量(表) 中记录的信息拷贝至对应重置时隙维 护的历史时隙状态向量 (表) 中, 再重置该时隙状态向量 (表), 并在到下一个重置时隙 到达前, 根据通过收发机 810接收到的 FI实时更新上述时隙状态向量(表)和历史时隙状 态向量(表),, 在任意时刻, 当确定需要申请新的时隙资源时, 根据当前维护的历史时隙 状态向量(表) 中记录的时隙状态信息进行时隙申请;
收发机 810, 用于在处理器 800的控制下收发数据。
其中, 在图 8中, 总线架构可以包括任意数量的互联的总线和桥, 具体由处理器 800 代表的一个或多个处理器和存储器 820代表的存储器的各种电路链接在一起。 总线架构还 可以将诸如外围设备、 稳压器和功率管理电路等之类的各种其他电路链接在一起, 这些都 是本领域所公知的, 因此,本文不再对其进行进一步描述。 总线接口提供接口。 收发机 810 可以是多个元件, 即包括发送机和接收机, 提供用于在传输介盾上与各种其他装置通信的 单元。 处理器 800负责管理总线架构和通常的处理, 存储器 820可以存储处理器 800在执 行操作时所使用的数据。
处理器 800负责管理总线架构和通常的处理, 存储器 820可以存储处理器 800在执行 操作时所使用的数据。
综上, 本申请实施例中, 第一节点按照预设的与自身关联的重置时隙, 在每个帧周期 中的重置时隙到达时, 在重置对应重置时隙维护的时隙状态向量(表)之前, 将该时隙状 态向量(表) 中记录的信息拷贝至对应重置时隙维护的历史时隙状态向量(表) 中, 以及 在重置该时隙状态向量之后到下一个重置时隙到达前,根据接收到的 FI实时更新上述时隙 状态向量 (表)和历史时隙状态向量(表); 并且在任意时刻, 第一节点确定需要申请新 的时隙资源时, 根据当前维护的历史时隙状态向量(表) 中记录的时隙状态信息进行时隙 申请。 这样, 由于第一节点会在每个重置时隙对历史时隙状态向量(表)进行相应更新并 且重置时隙状态向量(表), 因此, 能够保证发送的 FI的实时性和准确性, 避免引入错误 的历史信息及不必要的负反馈, 并且, 由于第一节点可以根据当前的时隙状态向量(表) 随时选择申请时隙资源, 从而有效保证了高层业务包的时延需求, 同时也保证了选择的空 闲时隙的可行性和可靠性, 避免了时隙资源的碰撞, 进一步的, 也可以减轻了因维护历史 时隙状态向量(表)而造成的緩存空间负荷, 减少 FI发送前的处理量, 从而有效减少了处 理时延, 显著地且全面地提升了系统性能。
此外, 本申请实施例中还记载了节点在拥有自占时隙情况下, 重置时隙与自占时隙的 关联关系, 以及节点在无自占时隙情况下, 节点维护重置时隙的方式, 以及引入重置时隙 之后, 节点具体的处理操作行为, 包括正常流程下 (申请时隙处理、 发送时隙处理、 接收 时隙处理、 重置处理) 以及异常处理(主要是时隙碰撞情况下)。 这样, 进一步完善了本 申请实施例中设计新的时隙占用处理机制, 使该机制可以得到有效实施。
本领域内的技术人员应明白, 本申请的实施例可提供为方法、 系统、 或计算机程序产 品。 因此, 本申请可釆用完全硬件实施例、 完全软件实施例、 或结合软件和硬件方面的实 施例的形式。 而且, 本申请可釆用在一个或多个其中包含有计算机可用程序代码的计算机 可用存储介盾 (包括但不限于磁盘存储器、 CD-ROM、 光学存储器等)上实施的计算机程 序产品的形式。
本申请是参照根据本申请实施例的方法、 设备(系统)、 和计算机程序产品的流程图 和 /或方框图来描述的。 应理解可由计算机程序指令实现流程图和 /或方框图中的每一流 程和 /或方框、 以及流程图和 /或方框图中的流程和 /或方框的结合。 可提供这些计算机 程序指令到通用计算机、 专用计算机、 嵌入式处理机或其他可编程数据处理设备的处理器 以产生一个机器, 使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用 于实现在流程图一个流程或多个流程和 /或方框图一个方框或多个方框中指定的功能的 装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方 式工作的计算机可读存储器中, 使得存储在该计算机可读存储器中的指令产生包括指令装 置的制造品, 该指令装置实现在流程图一个流程或多个流程和 /或方框图一个方框或多个 方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上, 使得在计算机 或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理, 从而在计算机或其他 可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和 /或方框图一个 方框或多个方框中指定的功能的步骤。
尽管已描述了本申请的优选实施例, 但本领域内的技术人员一旦得知了基本创造性概 念, 则可对这些实施例作出另外的变更和修改。 所以, 所附权利要求意欲解释为包括优选 实施例以及落入本申请范围的所有变更和修改。
显然, 本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实 施例的精神和范围。 这样, 倘若本申请实施例的这些修改和变型属于本申请权利要求及其 等同技术的范围之内, 则本申请也意图包含这些改动和变型在内。

Claims

权 利 要 求
1、 一种时隙资源占用处理方法, 其特征在于, 包括:
第一节点按照预设的与自身关联的重置时隙, 在每个帧周期中的重置时隙到达时, 先 将对应所述重置时隙维护的时隙状态向量中记录的信息拷贝至对应重置时隙维护的历史 时隙状态向量中, 再重置所述时隙状态向量, 以及在下一个重置时隙到达前, 根据接收到 的帧信息 FI实时更新所述时隙状态向量和历史时隙状态向量;
在任意时刻, 所述第一节点确定需要申请新的时隙资源时, 根据当前维护的历史时隙 状态向量中记录的时隙状态信息进行时隙申请。
2、 如权利要求 1 所述的方法, 其特征在于, 所述第一节点设置与自身关联的重置时 隙, 包括:
若所述第一节点当前维护有发送时隙, 则选取任意一个本节点维护的发送时隙作为重 置时隙; 或者,
所述第一节点将开机所在时隙之后的第 (N-1 )个时隙设置为重置时隙, 其中, N 向 量示一帧内的时隙数目; 或者,
若所述第一节点当前未维护发送时隙, 则选取任意一个时间点作为重置时隙。
3、 如权利要求 2 所述的方法, 其特征在于, 在任意时刻, 所述第一节点确定需要申 请新的时隙资源时, 居当前维护的历史时隙状态向量中记录的时隙状态信息进行时隙申 请, 包括:
所述第一节点根据在非自身使用的时隙接收到的 FI确定自身使用的时隙发生碰撞时, 当前维护的历史时隙状态向量中记录的时隙状态信息进行时隙申请; 或 /和
所述第一节点接收到新的高层业务包后, 确定本节点当前用于承载高层业务包的时隙 数目不能满足发送需求时, 根据当前维护的历史时隙状态向量中记录的时隙状态信息进行 时隙申请。
4、 如权利要求 3所述的方法, 其特征在于, 所述第一节点在接收到高层业务包之后, 立即才 居当前维护的历史时隙状态向量选择申请时隙; 或者, 在确定本节点的第一个重置 时隙已经到达之后, 再根据当前维护的历史时隙状态向量选择申请时隙;
其中, 若所述第一节点针对自身使用的各个时隙分别维护相应的时隙状态向量, 则选 择申请时隙后, 所述第一节点对应该申请时隙关联相应的时隙状态向量。
5、 如权利要求 2、 3或 4所述的方法, 其特征在于, 若所述第一节点选取任意一个发 送时隙作为重置时隙, 且所述第一节点针对自身使用的各个时隙在重置时隙维护统一的时 隙状态向量,则所述第一节点在重置时隙到达时 #>据当前维护的时隙状态向量发送 FI并重 置所述时隙状态向量, 以及在下一个重置时隙到达前, 在每一个非自身使用的时隙接收其 他节点发送的 FI, 并# ^据收到的 FI实时更新所述时隙状态向量和历史时隙状态向量。
6、 如权利要求 5所述的方法, 其特征在于, 所述第一节点在重置时隙发送 FI并重置 时隙状态向量后, 在下一个重置时隙到达前, 在每一个自身使用的时隙根据当前统一维护 的时隙状态向量生成并发送 FI。
7、 如权利要求 5 所述的方法, 其特征在于, 所述发送时隙为自占时隙或申请时隙; 若所述第一节点判定自身使用的时隙发生碰撞, 则按照以下方式进行处理:
若确定发生碰撞的时隙为重置时隙所在的自占时隙或申请时隙, 则所述第一节点判断 是否需要申请新的时隙资源, 若是, 则按照当前维护的历史时隙状态向量中记录的空闲时 隙申请新的时隙资源, 并重新选择重置时隙; 否则, 直接重新选择重置时隙, 并在选择完 重置时隙之后 , 对重新选择的重置时隙关联相应的时隙状态向量和历史时隙状态向量; 若确定发生碰撞的时隙为非重置时隙所在的自占时隙或申请时隙, 则所述第一节点判 断是否需要申请新的时隙资源, 若是, 则按照当前维护的历史时隙状态向量中记录的空闲 时隙申请新的时隙资源; 否则, 不执行任何操作。
8、 如权利要求 7 所述的方法, 其特征在于, 所述第一节点重新选择重置时隙, 并对 重新选择的重置时隙关联相应的时隙状态向量和历史时隙状态向量, 包括: 将未来时隙里 距离执行资源碰撞判定的时隙最近的自占时隙或申请时隙确定为新的重置时隙, 将原有重 置时隙关联的历史时隙状态向量关联至重新选择的重置时隙上并继续维护, 以及清除原有 重置时隙关联的时隙状态向量, 并对应重新选择的重置时隙关联一个初始化为零向量的时 隙状态向量或者将原有重置时隙关联的时隙状态向量进行部分回退后关联到新的重置时 隙上。
9、 如权利要求 7 所述的方法, 其特征在于, 在确定时隙发生碰撞, 并完成申请新的 时隙资源, 选择新的重置时隙、 以及对新的重置时隙关联相应的时隙状态向量和历史时隙 状态向量之后,在下一个重置时隙到达之前,所述第一节点根据接收到的 FI实时更新所述 时隙状态向量和历史时隙状态向量, 并在下一个重置时隙到达后, 据当前维护的时隙状 态向量发送 FI, 以及在 FI发送后, 对当前维护的时隙状态向量进行重置处理。
10、 如权利要求 2、 3或 4所述的方法, 其特征在于, 若所述第一节点选取任意一个 发送时隙作为重置时隙, 且所述第一节点针对自身使用的各个时隙分别维护相应的时隙状 态向量, 则所述第一节点在重置时隙到达时 #>据当前对应该重置时隙维护的时隙状态向量 发送 FI, 并在发送 FI之后重置所述时隙状态向量, 以及在下一个重置时隙到达前, 在每 一个非自身使用的时隙接收其他节点发送的 FI, 并根据收到的 FI实时更新对应所述重置 时隙设置的时隙状态向量和历史时隙状态向量, 以及实时更新对应每一个非重置时隙分别 设置的时隙状态向量。
11、 如权利要求 10所述的方法, 其特征在于, 所述第一节点在重置时隙发送 FI并重 置时隙状态向量后, 在下一个重置时隙到达前, 在每一个自身使用的时隙根据当前对应该 时隙维护的时隙状态向量生成并发送 FI, 并在发送 FI之后重置相应的时隙状态向量。
12、 如权利要求 10 所述的方法, 其特征在于, 若所述第一节点判定自身使用的时隙 发生碰撞, 则按照以下方式进行处理:
若确定发生碰撞的时隙为重置时隙所在的自占时隙或申请时隙, 则所述第一节点判断 是否需要申请新的时隙资源, 若是, 则按照当前维护的历史时隙状态向量中记录的空闲时 隙申请新的时隙资源, 并对应新申请的时隙设置关联的时隙状态向量, 以及重新选择重置 时隙; 否则, 直接重新选择重置时隙, 以及对应重新选择的重置时隙关联设置相应的时隙 状态向量和历史时隙状态向量;
若确定发生碰撞的时隙为非重置时隙所在的自占时隙或申请时隙, 则所述第一节点判 断是否需要申请新的时隙资源, 若是, 则按照当前维护的历史时隙状态向量中记录的空闲 时隙申请新的时隙资源, 并对应新申请的时隙设置关联的时隙状态向量; 否则, 不执行任 何操作。
13、 如权利要求 4或 12所述的方法, 其特征在于, 所述第一节点对应新申请的时隙 设置关联的时隙状态向量, 包括:
在选择新的时隙资源后, 所述第一节点选择未来时隙里距离新申请的时隙最近的原自 占时隙, 将其关联的时隙状态向量重新关联至新申请的时隙。
14、 如权利要求 12 所述的方法, 其特征在于, 所述第一节点重新选择重置时隙, 并 对应重新选择的重置时隙关联设置相应的时隙状态向量和历史时隙状态向量, 包括: 将在未来时隙里面距离执行资源碰撞判定的时隙最近的自占时隙或申请时隙确定为 新的重置时隙, 将原有重置时隙关联的历史时隙状态向量关联至重新选择的重置时隙上并 继续维护, 以及清除原有重置时隙关联的时隙状态向量, 并对重新选择的重置时隙关联一 个初始化为零向量的时隙状态向量。
15、 如权利要求 12 所述的方法, 其特征在于, 若确定发生碰撞的时隙为非重置时隙 所在的自占时隙或申请时隙, 则所述第一节点才 居当前的历史时隙状态向量申请新的时隙 资源后, 选择未来时隙里距离新申请的时隙最近的原自占时隙, 将其关联的时隙状态向量 进行拷贝, 得到新申请的时隙相关联的时隙状态向量。
16、 如权利要求 12 所述的方法, 其特征在于, 在确定时隙发生碰撞, 并完成申请新 的时隙资源, 选择新的重置时隙、 以及对新的重置时隙关联相应的时隙状态向量和历史时 隙状态向量之后,在下一个重置时隙到达之前, 所述第一节点根据接收到的 FI实时更新对 应重置时隙维护的时隙状态向量和历史时隙状态向量, 以及实时更新对应并在下一个重置 时隙到达后, 才 居当前维护的时隙状态向量发送 FI, 以及在 FI发送后, 对当前维护的时 隙状态向量进行重置处理。
17、 如权利要求 2、 3或 4所述的方法, 其特征在于, 若所述第一节点选取开机所在 时隙之后的第 (N-1 )个时隙作为重置时隙且尚未接收到高层业务包, 则所述第一节点在 重置时隙到达时重置对应所述重置时隙维护的时隙状态向量, 以及在下一个重置时隙到达 前, 在每一个非自身使用的时隙接收其他节点发送的 FI, 并根据收到的 FI实时更新对应 所述重置时隙设置的时隙状态向量和历史时隙状态向量。
18、 如权利要求 17 所述的方法, 其特征在于, 当高层业务包到达时, 若所述第一节 点判定需要申请新的时隙资源, 则所述第一节点根据当前对应重置时隙维护的历史时隙状 态向量中记录的时隙状态信息申请新的时隙资源, 并将选择的新的申请时隙设置为新的重 置时隙, 以及将原有重置时隙关联的历史时隙状态向量关联到新的重置时隙上继续维护, 同时清除原有重置时隙关联的时隙状态向量, 并为新的重置时隙关联一个初始化为零向量 的时隙状态向量。
19、 如权利要求 2、 3或 4所述的方法, 其特征在于, 若所述第一节点选取开机所在 时隙之后的第 (N-1 )个时隙作为重置时隙且已接收到高层业务包并申请了新的时隙资源, 则所述第一节点将新申请的时隙设置为新的重置时隙, 并在新的重置时隙到达时, 根据当 前对应重置时隙维护的时隙状态向量发送 FI并重置所述时隙状态向量,以及在下一个重置 时隙到达前, 在每一个非自身使用的时隙接收其他节点发送的 FI, 并根据收到的 FI实时 更新对应所述重置时隙设置的时隙状态向量和历史时隙状态向量。
20、 一种时隙资源占用处理装置, 其特征在于, 包括:
第一控制单元, 用于按照预设的与自身关联的重置时隙, 在每个帧周期中的重置时隙 到达时, 先将对应所述重置时隙维护的时隙状态向量中记录的信息拷贝至对应重置时隙维 护的历史时隙状态向量中, 再重置所述时隙状态向量, 以及在下一个重置时隙到达前, 才艮 据接收到的帧信息 FI实时更新所述时隙状态向量和历史时隙状态向量;
第二控制单元, 用于在任意时刻, 当确定需要申请新的时隙资源时, 根据当前维护的 历史时隙状态向量中记录的时隙状态信息进行时隙申请。
21、 如权利要求 20所述的装置, 其特征在于, 所述第一控制单元具体用于: 在设置与自身关联的重置时隙时, 若当前维护有发送时隙, 则选取任意一个本装置维 护的发送时隙作为重置时隙; 或者, 将开机所在时隙之后的第 (N-1 ) 个时隙设置为重置 时隙, 其中, N向量示一帧内的时隙数目。
22、 如权利要求 21 所述的装置, 其特征在于, 在任意时刻, 所述第二控制单元具体 用于:
在确定需要申请新的时隙资源时, 根据当前维护的历史时隙状态向量中记录的时隙状 态信息进行时隙申请时,根据在非自身使用的时隙接收到的 FI确定自身使用的时隙发生碰 撞时, 根据当前维护的历史时隙状态向量中记录的时隙状态信息进行时隙申请; 或 /和, 接 收到新的高层业务包后, 确定本节点当前用于承载高层业务包的时隙数目不能满足发送需 求时, 才 据当前维护的历史时隙状态向量中记录的时隙状态信息进行时隙申请。
23、 如权利要求 22所述的装置, 其特征在于, 所述第二控制单元还用于: 在接收到高层业务包之后, 立即根据当前维护的历史时隙状态向量选择申请时隙; 或 者, 在确定本装置的第一个重置时隙已经到达之后, 再才 居当前维护的历史时隙状态向量 选择申请时隙; 其中, 若第二控制单元针对自身使用的各个时隙分别维护相应的时隙状态 向量, 则选择申请时隙后, 第二控制单元对应该申请时隙关联相应的时隙状态向量。
24、 如权利要求 21、 22或 23所述的装置, 其特征在于, 所述第一控制单元还用于: 若选取任意一个发送时隙作为重置时隙, 且针对自身使用的各个时隙在重置时隙维护 统一的时隙状态向量, 则所述第一控制单元在重置时隙到达时才 居当前维护的时隙状态向 量发送 FI并重置所述时隙状态向量, 以及在下一个重置时隙到达前,在每一个非自身使用 的时隙接收其他节点发送的 FI, 并根据收到的 FI实时更新所述时隙状态向量和历史时隙 状态向量。
25、 如权利要求 24所述的装置, 其特征在于, 所述第一控制单元还用于: 在重置时隙发送 FI并重置时隙状态向量后,在下一个重置时隙到达前,在每一个自身 使用的时隙根据当前统一维护的时隙状态向量生成并发送 FI。
26、 如权利要求 24所述的装置, 其特征在于, 所述第二控制单元还拥有: 若判定自身使用的时隙发生碰撞, 则按照以下方式进行处理: 若确定发生碰撞的时隙 为重置时隙所在的自占时隙或申请时隙, 则判断是否需要申请新的时隙资源, 若是, 则按 照当前维护的历史时隙状态向量中记录的空闲时隙申请新的时隙资源, 并重新选择重置时 隙; 否则, 直接重新选择重置时隙, 并在选择完重置时隙之后, 对重新选择的重置时隙关 联相应的时隙状态向量和历史时隙状态向量; 若确定发生碰撞的时隙为非重置时隙所在的 自占时隙或申请时隙, 则判断是否需要申请新的时隙资源, 若是, 则按照当前维护的历史 时隙状态向量中记录的空闲时隙申请新的时隙资源; 否则, 不执行任何操作。
27、 如权利要求 26所述的装置, 其特征在于, 所述第二控制单元还拥有: 在重新选择重置时隙, 并对重新选择的重置时隙关联相应的时隙状态向量和历史时隙 状态向量时, 将未来时隙里距离执行资源碰撞判定的时隙最近的自占时隙或申请时隙确定 为新的重置时隙, 将原有重置时隙关联的历史时隙状态向量关联至重新选择的重置时隙上 并继续维护, 以及清除原有重置时隙关联的时隙状态向量, 并对应重新选择的重置时隙关 联一个初始化为零向量的时隙状态向量或者将原有重置时隙关联的时隙状态向量进行部 分回退后关联到新的重置时隙上。
28、 如权利要求 26所述的装置, 其特征在于, 所述第二控制单元还用于: 在确定时隙发生碰撞, 并完成申请新的时隙资源, 选择新的重置时隙、 以及对新的重 置时隙关联相应的时隙状态向量和历史时隙状态向量之后 , 在下一个重置时隙到达之前, 第一控制单元根据接收到的 FI实时更新所述时隙状态向量和历史时隙状态向量,并在下一 个重置时隙到达后, 才 居当前维护的时隙状态向量发送 FI, 以及在 FI发送后, 对当前维 护的时隙状态向量进行重置处理。
29、 如权利要求 21、 22或 23所述的装置, 其特征在于, 所述第一控制单元还用于: 若选取任意一个发送时隙作为重置时隙, 且针对自身使用的各个时隙分别维护相应的 时隙状态向量, 则在重置时隙到达时根据当前对应该重置时隙维护的时隙状态向量发送 FI, 并在发送 FI之后重置所述时隙状态向量, 以及在下一个重置时隙到达前, 在每一个非 自身使用的时隙接收其他节点发送的 FI, 并根据收到的 FI实时更新对应所述重置时隙设 置的时隙状态向量和历史时隙状态向量, 以及实时更新对应每一个非重置时隙分别设置的 时隙状态向量。
30、 如权利要求 29所述的装置, 其特征在于, 所述第一控制单元还用于: 在重置时隙发送 FI并重置时隙状态向量后,在下一个重置时隙到达前,在每一个自身 使用的时隙根据当前对应该时隙维护的时隙状态向量生成并发送 FI, 并在发送 FI之后重 置相应的时隙状态向量。
31、 如权利要求 29所述的装置, 其特征在于, 所述第二控制单元还用于: 判定自身使用的时隙发生碰撞, 则按照以下方式进行处理:
若确定发生碰撞的时隙为重置时隙所在的自占时隙或申请时隙, 则判断是否需要申请 新的时隙资源, 若是, 则按照当前维护的历史时隙状态向量中记录的空闲时隙申请新的时 隙资源, 并对应新申请的时隙设置关联的时隙状态向量, 以及重新选择重置时隙; 否则, 直接重新选择重置时隙, 以及对应重新选择的重置时隙关联设置相应的时隙状态向量和历 史时隙状态向量; 若确定发生碰撞的时隙为非重置时隙所在的自占时隙或申请时隙, 则判断是否需要申 请新的时隙资源, 若是, 则按照当前维护的历史时隙状态向量中记录的空闲时隙申请新的 时隙资源, 并对应新申请的时隙设置关联的时隙状态向量; 否则, 不执行任何操作。
32、 如权利要求 23或 31所述的装置, 其特征在于, 所述第二控制单元还用于: 在选择新的时隙资源后, 第二控制单元选择未来时隙里距离新申请的时隙最近的原自 占时隙, 将其关联的时隙状态向量重新关联至新申请的时隙。
33、 如权利要求 31所述的装置, 其特征在于, 所述第二控制单元还用于: 在重新选择重置时隙, 并对应重新选择的重置时隙关联设置相应的时隙状态向量和历 史时隙状态向量时, 将在未来时隙里面距离执行资源碰撞判定的时隙最近的自占时隙或申 请时隙确定为新的重置时隙, 将原有重置时隙关联的历史时隙状态向量关联至重新选择的 重置时隙上并继续维护, 以及清除原有重置时隙关联的时隙状态向量, 并对重新选择的重 置时隙关联一个初始化为零向量的时隙状态向量。
34、 如权利要求 31所述的装置, 其特征在于, 所述第二控制单元还用于: 若确定发生碰撞的时隙为非重置时隙所在的自占时隙或申请时隙, 则才 居当前的历史 时隙状态向量申请新的时隙资源后, 选择未来时隙里距离新申请的时隙最近的原自占时 隙, 将其关联的时隙状态向量进行拷贝, 得到新申请的时隙相关联的时隙状态向量。
35、 如权利要求 21所述的装置, 其特征在于, 所述第二控制单元还用于: 确定时隙发生碰撞, 并完成申请新的时隙资源, 选择新的重置时隙、 以及对新的重置 时隙关联相应的时隙状态向量和历史时隙状态向量之后, 在下一个重置时隙到达之前, 第 一控制单元根据接收到的 FI 实时更新对应重置时隙维护的时隙状态向量和历史时隙状态 向量, 以及实时更新对应并在下一个重置时隙到达后, 根据当前维护的时隙状态向量发送 FI, 以及在 FI发送后, 对当前维护的时隙状态向量进行重置处理。
36、 如权利要求 21、 22或 23所述的装置, 其特征在于, 所述第一控制单元还用于: 选取开机所在时隙之后的第 (N-1 )个时隙作为重置时隙且尚未接收到高层业务包, 则第一控制单元在重置时隙到达时重置对应所述重置时隙维护的时隙状态向量, 以及在下 一个重置时隙到达前, 在每一个非自身使用的时隙接收其他节点发送的 FI, 并根据收到的 FI实时更新对应所述重置时隙设置的时隙状态向量和历史时隙状态向量。
37、 如权利要求 36所述的装置, 其特征在于, 所述第二控制单元还用于: 当高层业务包到达时, 判定需要申请新的时隙资源, 则根据当前对应重置时隙维护的 历史时隙状态向量中记录的时隙状态信息申请新的时隙资源, 并将选择的新的申请时隙设 置为新的重置时隙, 以及将原有重置时隙关联的历史时隙状态向量关联到新的重置时隙上 继续维护, 同时清除原有重置时隙关联的时隙状态向量, 并为新的重置时隙关联一个初始 化为零向量的时隙状态向量。
38、 如权利要求 21、 22或 23所述的装置, 其特征在于, 所述第一控制单元还用于: 选取开机所在时隙之后的第 (N-1 )个时隙作为重置时隙且已接收到高层业务包并申 请了新的时隙资源, 则将新申请的时隙设置为新的重置时隙, 并在新的重置时隙到达时, 才艮据当前对应重置时隙维护的时隙状态向量发送 FI并重置所述时隙状态向量,以及在下一 个重置时隙到达前, 在每一个非自身使用的时隙接收其他节点发送的 FI, 并根据收到的 FI 实时更新对应所述重置时隙设置的时隙状态向量和历史时隙状态向量。
PCT/CN2013/086264 2012-11-21 2013-10-30 一种时隙资源占用处理方法及装置 WO2014079308A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210477416.3A CN103841562B (zh) 2012-11-21 2012-11-21 一种时隙资源占用处理方法及装置
CN201210477416.3 2012-11-21

Publications (1)

Publication Number Publication Date
WO2014079308A1 true WO2014079308A1 (zh) 2014-05-30

Family

ID=50775516

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/086264 WO2014079308A1 (zh) 2012-11-21 2013-10-30 一种时隙资源占用处理方法及装置

Country Status (2)

Country Link
CN (1) CN103841562B (zh)
WO (1) WO2014079308A1 (zh)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105430749B (zh) * 2014-09-18 2019-04-02 电信科学技术研究院 一种时隙选择的方法及装置
CN104684094B (zh) * 2015-02-10 2018-03-23 迈锐数据(北京)有限公司 无线传感器网自动管理时隙方法
CN108024292B (zh) * 2016-11-04 2019-09-17 电信科学技术研究院 一种资源排除方法及装置
CN109429206B (zh) * 2018-05-30 2021-10-26 展讯通信(上海)有限公司 一种蓝牙数据传输方法、装置及用户设备
US11405943B2 (en) * 2018-09-28 2022-08-02 Apple Inc. Cross-slot scheduling for New Radio
CN112398888B (zh) * 2019-08-15 2023-02-28 北京华为数字技术有限公司 一种通信方法及装置
CN110572794B (zh) * 2019-09-30 2021-07-13 展讯通信(上海)有限公司 拥塞控制方法及装置、存储介质、用户设备

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102386991A (zh) * 2011-10-21 2012-03-21 哈尔滨工程大学 一种无线移动自组织网络时分多址接入系统的时隙交换操作方法
CN102413581A (zh) * 2011-12-02 2012-04-11 电信科学技术研究院 一种初始接入节点预约信道时隙的方法及系统

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101895971B (zh) * 2009-05-21 2013-04-17 华为技术有限公司 调整功放电压和控制时隙的方法、设备及系统

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102386991A (zh) * 2011-10-21 2012-03-21 哈尔滨工程大学 一种无线移动自组织网络时分多址接入系统的时隙交换操作方法
CN102413581A (zh) * 2011-12-02 2012-04-11 电信科学技术研究院 一种初始接入节点预约信道时隙的方法及系统

Also Published As

Publication number Publication date
CN103841562B (zh) 2017-08-18
CN103841562A (zh) 2014-06-04

Similar Documents

Publication Publication Date Title
WO2014079308A1 (zh) 一种时隙资源占用处理方法及装置
US8457553B2 (en) Removal of ambiguities in forming new piconet controller (PNC) when the current PNC controller is suddenly unavailable
WO2014075555A1 (zh) 一种时隙资源的调度方法及装置
US20040151126A1 (en) Communication system, communication control method and communication control method
CN103378919B (zh) 一种fi消息的传输方法及装置
JP2008523697A (ja) 競争に基づく分散型macを用いた無線ネットワークにおけるトラフィックの受信可否の通知方法及びアクティブ又は非アクティブ状態の決定方法
JP2012095273A (ja) ワイヤレス通信ネットワークに用いられる通信方法及びノード
WO2013152649A1 (zh) 一种资源碰撞的判定方法和装置
CN109495383B (zh) 一种数据处理方法、装置、通信系统及网络设备
WO2020029825A1 (zh) 资源调度方法、终端及网络设备
WO2016045568A1 (zh) 一种d2d资源分配方法及装置
JP2002057699A (ja) パケット伝送方式、パケット伝送方法及び記録媒体
US8717991B2 (en) Apparatus and method for operating multi-channel based on wireless access in vehicular environments
WO2014036964A1 (zh) 一种多时隙或子帧资源的处理方法及装置
WO2014180151A1 (zh) 时隙状态更新方法和设备
WO2016041420A1 (zh) 一种时隙选择的方法及装置
WO2020063401A1 (zh) 一种模式切换方法、数据流分流方法及装置
WO2022142277A1 (zh) 一种通信架构的动态调节方法及系统
US8855693B2 (en) Method and apparatus for controlling wireless devices
WO2019015036A1 (zh) 一种中继器桥接方法和网关
WO2014127633A1 (zh) Lldp报文传输方法及dcb设备
CN104581819A (zh) 一种时隙资源碰撞的确定方法及装置
JP2009130751A (ja) リソース予約装置、システム、方法
WO2022222611A1 (zh) 数据传输方法、装置、终端、存储介质
WO2021228163A1 (zh) 确定资源的方法、装置及系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13857511

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13857511

Country of ref document: EP

Kind code of ref document: A1