WO2014114201A1 - 一种时隙状态的发送以及确定的方法、装置 - Google Patents

一种时隙状态的发送以及确定的方法、装置 Download PDF

Info

Publication number
WO2014114201A1
WO2014114201A1 PCT/CN2014/070678 CN2014070678W WO2014114201A1 WO 2014114201 A1 WO2014114201 A1 WO 2014114201A1 CN 2014070678 W CN2014070678 W CN 2014070678W WO 2014114201 A1 WO2014114201 A1 WO 2014114201A1
Authority
WO
WIPO (PCT)
Prior art keywords
time slot
node
specific time
occupied
priority
Prior art date
Application number
PCT/CN2014/070678
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 WO2014114201A1 publication Critical patent/WO2014114201A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446Resources in time domain, e.g. slots or frames

Definitions

  • the present invention claims a method and a device for transmitting and determining a time slot state, which is submitted to the Chinese Patent Office on January 24, 2013, and whose application number is 201310028010.1. The priority of the Chinese Patent Application, the entire contents of which is incorporated herein by reference.
  • the present application relates to the field of mobile communications, and in particular, to a method and apparatus for transmitting and determining a slot state. Background technique
  • each N time slots form a frame
  • FI Framework Information
  • the FI message sent to other nodes in the N time slots is intercepted.
  • the indication message of the occupation information of each time slot in the FI message sent by the node is composed of 12 bits, as shown in FIG. 1 , and includes the following contents:
  • Time slot occupancy status (2bit) The time slot status in FI is defined as: idle state (00), — hop neighbor occupancy and own node occupation state (10), collision state (01), two-hop neighbor node occupation Status (11).
  • PSF Primary Status Field
  • PSF [01] - Safety, communication for general road safety purposes for general vehicles. Each vehicle establishes a traffic channel for communication for general road safety purposes after startup. Each vehicle can only occupy 1 time slot for this purpose;
  • Step 1 Listen for one frame.
  • the node obtains slot state information maintained in the form of an N*N matrix, as shown in FIG. 3; wherein any element has five possible states, namely, the aforementioned four Status and default default status.
  • the default state can also be combined with the idle state (00) into one state.
  • Step 2 Select an available slot.
  • the slot is considered to be freely available only if the slot in the N*N slot state cache table satisfies the following conditions:
  • Each element in the column is either idle (00) or default.
  • Step 3 Wait for the selected slot to arrive and confirm again that it is free.
  • step 2 Assume in step 2 that the selected slot p is empty. Then, before the slot p arrives, the slots are continuously monitored, and the old slot information in the above table is overwritten with the new slot information (that is, the information of the last N slots is always maintained in the window). Wait until the end of slot p-1, and use the N*N slot state cache table to check whether slot p still meets the conditions in step 2 (including the priority consideration when there is no idle slot):
  • step 2 If not, go to step 2 immediately.
  • Step 4 Send the subframe subframe in slot p.
  • N in the column -1 element is idle state (00), default state or two-hop occupancy state (;11).
  • Step 5 Monitor the feedback and confirm if it is successful.
  • the access is considered successful. Otherwise, if one or more of the N-1 elements have different occupancy states (10) than their own STIs, the priority is determined:
  • the channel maintenance process is still premised on the continuous transmission of FI.
  • the channel maintenance process there are two types of cases:
  • the FI fill method is exactly the same as step 4 above. 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).
  • Receive slot Maintain (N-1)*N slot status cache table and judge whether it is successful before slot p+X*N of the node.
  • the method is exactly the same as step 5 above.
  • the node only needs to maintain the (N-1)*N slot state cache table, and does not need to maintain the N*N slot state cache table.
  • the nodes can be processed into two types of slots that are judged to be collisions:
  • the priorities of the nodes occupying the time slot resources are the same, in this case, randomly selecting a user, recording the priority and the STI of the user;
  • the receiving node determines the collision situation of the time slot occupied by itself. If its own PSF is higher than other PSFs, that is, the node is the only node with the highest PSF, then the node is considered to be connected (maintained). The time slot resource is successful. If the PSF of the node is not the highest, the access is considered to be failed, and the idle slot is immediately reselected.
  • the node is considered to be successfully accessing (maintaining) the time slot resource with a certain probability;
  • the transmission occurs on the time slot maintained by the node, and if this happens again, the probability p is sent on the time slot where the maintenance of the node occurs for the first time from the judgment time slot, and the probability (1-P) is considered.
  • the transmission failed and the free slot is reselected immediately.
  • the embodiment of the present application provides a method and a device for transmitting and determining a time slot state, which are used to determine whether a occupied node with the highest priority is the only one in the time slot in which the collision occurs, and determines to continue to maintain the time slot or abandon the time slot. It is avoided that the long-term collision problem caused by the probabilistic access mechanism can only be used if it is not known whether the occupied node with the highest priority is unique.
  • the occupation information of the specific time slot in the FI, and the node of the node Temporary standard Identify the STI and the priority of the service occupying a specific time slot, and determine whether to continue to occupy the specific time slot.
  • a specific time slot determining unit configured to determine, according to the received frame information FI of each time slot, a specific time slot indicated by the plurality of nodes other than the local node in the FI, and a specific occupation of multiple nodes occupying the specific time slot
  • the occupant information sending unit is configured to determine the specific occupation information of the plurality of nodes occupying the specific time slot, determine the service priority of the plurality of nodes occupying the specific time slot, and determine the node with the highest service priority.
  • a receiving unit configured to receive frame information FI
  • a determining unit configured to: when the received FI indicates that the time slot occupied by the node is occupied by a node with the highest priority or a specific time slot in which a resource collision occurs, the occupancy information of the specific time slot in the FI And the node of the local node temporarily identifies the STI and the service priority of occupying a specific time slot, and determines whether to continue to occupy the specific time slot.
  • a specific time slot indicated by the plurality of nodes other than the local node in the FI, and a plurality of nodes occupying the specific time slot are determined.
  • the occupation information of the plurality of nodes occupying the specific time slot determining the service priority of the plurality of nodes occupying the specific time slot, and determining whether the node with the highest service priority is unique, and if so, Setting the occupation information of the specific time slot in the FI sent by the local node indicates that the specific time slot is occupied by the node with the highest service priority; otherwise, setting the occupation information of the specific time slot in the FI sent by the local node to indicate the specific A resource collision occurs in a time slot.
  • the occupied information is used to distinguish whether there is a unique node with the highest priority, so that the occupied node of the time slot in which the resource collides occurs, after receiving the FI, can perform corresponding processing according to the occupied information in the FI, that is, determine to continue to occupy or Determining the maintenance failure release time slot; the method provided by the present application avoids the probabilistic access mechanism may be caused by the method according to the prior art that the node received in the prior art cannot distinguish whether there is a unique node with the highest priority.
  • the long-term collision problem improves the processing scheme of time slot collision and can more accurately process time slot collisions.
  • FIG. 1 is a schematic view of a FI structure of the background art
  • FIG. 2 is a schematic diagram of a process of a time slot application of the background art
  • FIG. 4 is a schematic flowchart of a method for sending a slot state according to an embodiment of the present disclosure
  • FIG. 5 is a schematic flowchart of a method for determining a slot state according to an embodiment of the present disclosure
  • FIG. 6 is a schematic structural diagram of a device for sending a slot state according to an embodiment of the present disclosure
  • FIG. 7 is a schematic structural diagram of a device for determining a slot state according to an embodiment of the present disclosure.
  • FIG. 8 is a schematic structural diagram of another apparatus for transmitting a slot state according to an embodiment of the present disclosure.
  • FIG. 9 is a schematic structural diagram of another apparatus for determining a slot state according to an embodiment of the present disclosure. detailed description
  • the embodiment of the present application provides a method and a device for sending and determining a slot state, so as to avoid that the occupied node of the collision slot can only be used if the occupied node with the highest priority is not known. Long-term collision problems caused by probabilistic access mechanisms.
  • the node that collides is an access/maintenance failure and should be re-accessed.
  • the nodes with the highest priority corresponding to the collision of the time slot resources in the system are not unique and unique. Therefore, in order to achieve the same understanding between the nodes, it is necessary to also generate resources in the time slot. The case where the node with the highest priority among the colliding nodes is unique is taken into account.
  • a method for sending a slot state includes:
  • determining the specific occupation information of the plurality of nodes occupying the specific time slot determining the service priority of the plurality of nodes occupying the specific time slot, and determining whether the node with the highest service priority is unique, and if yes,
  • the occupation information of the specific time slot in the FI sent by the local node indicates that the specific time slot is occupied by the node with the highest service priority; otherwise, the occupation information of the specific time slot is set in the FI sent by the local node to indicate the specific time.
  • a resource collision occurs in the gap.
  • the occupancy information includes a slot occupancy status, a node temporary identifier STI of the occupied node, and an occupied node priority.
  • the setting of the occupation information of the specific time slot in the FI sent by the node indicates that the specific time slot is occupied by the node with the highest service priority, including: setting a specific time in the FI sent by the node
  • the slot occupancy state of the slot is a collision state
  • the STI of the occupied node of the specific slot is the STI of the node with the highest service priority
  • the service priority of the occupied node of the specific slot is the unique service priority.
  • the setting of the occupation information of the specific time slot in the FI sent by the local node indicates that the resource collision occurs in the specific time slot, including: setting the time slot occupation state of the specific time slot to the collision state in the FI sent by the local node, and the specific time slot
  • the STI of the occupied node is a preset STI
  • the service priority of the occupied node of the specific time slot is the highest occupation priority among the service priorities of the multiple nodes.
  • the node determines the time slot in which the collision occurs as the collision state, and the preset STI designed by the present application is not the unique identifier of the STI of the node with the highest priority.
  • the setting of the occupation information of the specific time slot in the FI sent by the node indicates that the specific time slot is occupied by the node with the highest priority of the service, including: setting in the FI sent by the node.
  • the slot occupancy status of the specific time slot is the occupied state
  • the STI of the occupied node of the specific time slot is the STI of the node with the highest service priority
  • the service priority of the occupied node of the specific time slot is the unique service.
  • the setting of the occupation information of the specific time slot in the FI sent by the local node indicates that the resource collision occurs in the specific time slot, including: setting the time slot occupation state of the specific time slot to the collision state in the FI sent by the local node, and the specific time slot
  • the STI of the occupied node is a preset STI
  • the service priority of the occupied node of the specific time slot is the highest service priority among the service priorities of the multiple nodes.
  • the node determines the slot occupancy state of the node with the highest priority as the occupied state. After receiving the information of the occupied state, the other nodes process according to the time slot of the normal occupied state; preferably, The node determines whether the node with the highest priority is a one-hop neighboring node or a two-hop neighboring node of the current node, and determines, according to the judgment result, whether the time slot occupied state is occupied state or two-hop occupied state in the FI.
  • the value of the STI is divided into two types, where a part of the STI is defined as a normal STI, and is used to identify each UE; another part of the STI is defined as a preset special STI, and the STI does not point to any UE, and is available. It indicates that a time slot has collided; wherein each node knows a common STI and a special STI in advance.
  • a method for determining a slot state provided by an embodiment of the present application includes:
  • the received FI indicates that the time slot occupied by the local node is occupied by a node with the highest priority or a specific time slot in which a resource collision occurs, the occupation information of the specific time slot in the FI, and the current node.
  • the node temporarily identifies the STI and the service priority occupying a particular time slot, and determines whether to continue to occupy the particular time slot.
  • the occupancy information includes: a slot occupancy state, an STI of the occupied node, and an occupied node priority.
  • determining whether to continue to occupy the specific time slot according to the occupation information of the specific time slot in the FI, and the STI of the local node and the service priority of occupying the specific time slot include: when determining that the node occupies a specific time slot The service priority is the same as the service priority of the occupied node of the specific time slot in the FI, and when the STI of the occupied node of the specific time slot in the FI is the same as the STI of the local node, it is determined to continue to occupy the specific time slot; When the service priority of a node occupying a specific time slot is higher than the service priority of the occupied node of a specific time slot in the FI, it is determined that the specific time slot continues to be occupied; otherwise, the local node releases the specific time slot and re-applies for the time slot.
  • the determining that the received FI indicates that the time slot occupied by the local node is a specific time slot in which a resource collision occurs, and includes: when the FI indicates that the time slot occupied state of the time slot occupied by the node is a collision state, the occupied node
  • the STI is a preset STI, it determines that a resource collision occurs in the time slot occupied by the node.
  • determining whether to continue to occupy the specific time slot according to the occupation information of the specific time slot in the FI, and the STI of the local node and the service priority of occupying the specific time slot include: when determining that the node occupies a specific time slot When the service priority is lower than the service priority of the occupied node of a specific time slot in the FI, the local node releases the specific time slot and re-applies the time slot; when determining that the node occupies the service priority of the specific time slot and the specificity in the FI When the service priority of the occupied nodes of the time slot is the same, the local node releases the specific time slot and re-applies the time slot; when determining that the service priority of the local time slot occupying the specific time slot is higher than that of the occupied time zone of the specific time slot in the FI At the level, it is determined to continue to occupy a specific time slot.
  • the specific time slot occupied by the local node that is instructed to have collided is processed accordingly.
  • the received FI includes more accurate occupation information, that is, whether the node occupying the highest priority is unique, and the node can determine whether to continue to occupy a specific time slot or determine the occupation according to the received FI.
  • Maintenance failure re-application time slot When it is determined that there are other nodes with the same priority as the current node, the specific time slot is released and the time slot is re-applied, and the probability access is no longer performed.
  • Embodiment 1 There are multiple nodes in the network. Here, only node A and node B are considered. Node A and node B are one-hop neighbors, node A occupies slot 1, and node B occupies slot 2, in slot 1. After Node B receives the FI sent by Node A, Node B needs to update the state of each time slot in conjunction with the slot state table currently maintained by the Node.
  • the occupancy information of each time slot is represented by the slot occupancy status + the service priority of the occupied node (pri) + the STI of the occupied node.
  • the following two cases are mainly considered:
  • the slot 3 is indicated as a collision, and the slot state of the slot 3 currently maintained by the node B is a collision or is occupied by a hop neighbor node, and the latest state of the node B updating the slot 3 is a collision.
  • priority and STI's The body instructions need to be processed separately:
  • the STI is the STI of the higher priority user.
  • the STI is the priority of the higher priority user.
  • the STI is the priority of the higher priority user.
  • the STI is the priority of the higher priority user. .
  • the FI and the currently maintained slot state table When it is determined according to the FI and the currently maintained slot state table that the highest priority user among the plurality of users occupying slot 3 is not unique, that is, if the FI and the currently maintained slot state table have different slots with the same priority STI If the STIs with different priorities but the higher priority levels are special STIs, or if the STIs are of the same STI, the latest priority of the slot 3 needs to be updated to a higher priority. , but STI is a special STI.
  • the slot 3 In the FI of the node A, the slot 3 is indicated as being occupied by its one-hop neighboring node, and the slot state of the slot 3 currently maintained by the node B is occupied by its one-hop neighboring node. At this time, the node B needs to combine the FI and the current maintenance.
  • the slot status table updates the latest status of slot 3:
  • the priority of updating the latest state of the slot 3 is the priority of the higher priority user, STI The STI for this higher priority user.
  • the slot 3 is updated.
  • the latest state of STI is a special STI.
  • the FI and the currently maintained slot state table match the STI and the priority in the indication of the slot, that is, the FI and the currently maintained slot state table indicate the same node occupation, and the slot 3 is updated at this time.
  • the latest status is: It is occupied by a hop neighbor, and the priority of the node and the STI are recorded.
  • the collision +pril+ STIl is determined by a hop neighbor to collide with the time slot, as follows:
  • the sending node indicates that "one hop is not matched by a hop neighbor node, such as STI or pri, then it is determined that the time slot collides, as the node occupies +pril + STIl occupies +pri2 + STI2:
  • the latest state of the updated slot 1 is a collision, and the specific priority and the STI indication need to be processed separately: when the higher priority is determined among the plurality of users occupying the slot 1 according to the FI and the currently maintained slot state table.
  • the priority of updating the latest state of slot 1 is the priority of the higher priority user
  • the STI is the STI of the higher priority user; when the slot is determined according to the FI and the currently maintained slot state table If the higher priority users among the multiple users of 1 are not unique, that is, the priorities indicated by slot 1 are the same but the STIs are different, the STI of the latest state of slot 1 is updated to be a special STL.
  • the FI and the currently maintained slot state table match the STI and the priority in the indication of the slot, that is, the FI and the currently maintained slot state table indicate the same node, and the latest update of slot 1 is updated.
  • the status is: a hop node Occupy, record the priority of the node and STI.
  • the node receives negative feedback, and the node restarts listening for channel access or performs time slot selection according to the channel status information maintained by the current node. Conversely, if the priority of the Node B itself is higher than the priority indicated in the FI, the node can continue to maintain the time slot resource.
  • the Node B considers that negative feedback is received, and the node can restart listening for channel access or perform time slot selection according to the channel condition information currently maintained by the current node. If the priority of the Node B itself and the STI are the same as the indicated priority and the STI, the Node B can be considered as the local node, that is, the Node B believes that positive feedback is received, and the time slot resource can be maintained. When the priority of the Node B itself is higher than the indicated priority, in order to guarantee the priority of the high priority node, the Node B continues to maintain the time slot resource.
  • Table 3
  • Node A and Node B are one-hop neighbors. Node A occupies slot 1, node B occupies slot 2, and node 1 receives the node at slot 1. After the FI sent by A, the Node B needs to update the internal state of each time slot in conjunction with the time slot status table currently maintained by the node.
  • the node B updates the latest state of the slot 3 as a collision, and records the FI and the currently maintained slot state. The higher priority of slot 3.
  • the priority of the slot state of the currently maintained slot 3 is not higher than the indication in the FI.
  • Priority update the latest state of slot 3 as a collision, and record the priority indicated in the FI; if the slot state of the currently maintained slot 3 has a higher priority than the priority indicated in the FI, no update, record is required Maintain the original state.
  • slot1 the indication of slot 1 by node A must be "occupied by this node".
  • the Node B needs to update the latest state of the slot1 in combination with the FI and the currently maintained slot state information: if the higher priority of the two is unique, update the latest priority of slot 1 and the higher priority of the STI. And according to the higher priority information, it is determined whether it is occupied by a hop node or a second hop node; if there is no unique higher priority in the two, the latest state of the updated slot 1 is a collision, and the priority is recorded.
  • Node B may receive a collision indication and may also receive a non-collision indication, as shown in Table 6.
  • the indication of the received FI is "collision +pril"
  • the priority of the node B itself is not higher than
  • the priority indicated in the FI is that the node B considers that negative feedback has been received, and the node can restart listening for channel access or perform time slot selection according to the channel condition information currently maintained by the current node.
  • the Node B When the priority of the Node B itself is higher than the indicated priority, in order to guarantee the priority of the high priority node, the Node B continues to maintain the time slot resource.
  • the apparatus for transmitting a time slot state is also provided in the embodiment of the present application. Since the principle of solving the problem is similar to the method for transmitting the time slot state, the implementation of the sending device can be implemented by referring to the method. It will not be repeated here.
  • a slot state sending apparatus provided by an embodiment of the present application includes:
  • the specific time slot determining unit 51 is configured to determine, according to the received frame information FI of each time slot, a specific time slot indicated by the plurality of nodes other than the local node in the FI, and specific multiple nodes occupying the specific time slot.
  • the occupation information sending unit 52 is configured to determine the specific occupation information of the plurality of nodes occupying the specific time slot, determine the service priority of the plurality of nodes occupying the specific time slot, and determine that the service priority is the highest.
  • setting the occupation information of the specific time slot in the FI sent by the node indicates that the specific time slot is occupied by the node with the highest service priority; otherwise, setting the FI in the FI sent by the node
  • the occupation information of a specific time slot indicates a specific time slot A resource collision has occurred.
  • the occupancy information transmitting unit 52 is configured to: when the occupation information of the specific time slot is set in the FI sent by the local node to indicate that the specific time slot is occupied by the node with the highest service priority, the specific usage is:
  • the slot occupancy state of the specific time slot in the FI is the collision state
  • the STI of the occupied node of the specific time slot is the STI of the node with the highest service priority
  • the service priority of the occupied node of the specific time slot is The business priority of the node with the highest business priority.
  • the occupancy information transmitting unit 52 is configured to: when the occupation information of the specific time slot is set in the FI sent by the local node, the specific time slot is occupied by the node with the highest service priority, specifically: The slot occupancy state of the specific slot in the sent FI is the occupied state, and the STI of the occupied node of the specific slot is the STI of the node with the highest service priority, and the service priority of the occupied node of the specific slot is The service priority of the node with the highest priority of the service.
  • the occupancy information transmitting unit 52 is configured to: when the occupation information of the specific time slot is set in the FI sent by the local node to indicate that a resource collision occurs in a specific time slot, specifically: setting a specific time slot in the FI sent by the local node.
  • the slot occupancy state is a collision state
  • the STI of the occupied node of the specific time slot is a preset STI
  • the service priority of the occupied node of the specific time slot is the highest service priority among the service priorities of the multiple nodes.
  • the apparatus for determining the state of the time slot is further provided in the embodiment of the present application. Since the principle of solving the problem by the determining device is similar to the method for determining the state of the time slot, the implementation of the determining device can be implemented by referring to the method. It will not be repeated here.
  • a device for determining a slot state includes:
  • the receiving unit 61 is configured to receive frame information FI;
  • the determining unit 62 is configured to: when determining that the received FI indicates that the time slot occupied by the local node is occupied by a node with the highest priority or a specific time slot in which a resource collision occurs, according to the occupation information of the specific time slot in the FI And the node of the local node temporarily identifies the STI and the service priority of occupying a specific time slot, and determines whether to continue to occupy the specific time slot.
  • the determining unit 62 is configured to: when the received FI indicates that the time slot occupied by the node is a specific time slot occupied by the node with the highest priority, specifically, when the FI indicates that the node is occupied by the node.
  • the slot occupancy status of the slot is the collision state.
  • the STI of the occupied node is not the preset STI, or when the FI indicates that the slot occupancy status of the slot occupied by the node is occupied, the STI of the occupied node is not pre-
  • the STI is set, it is determined that the time slot occupied by the node is a specific time slot occupied by the node with the highest priority.
  • the determining unit 62 is configured to determine whether to continue to occupy the specific time slot according to the occupancy information of the specific time slot in the FI, and the STI of the local node and the service priority of occupying a specific time slot.
  • the service priority of the node occupying a specific time slot is the same as the service priority of the occupied node of the specific time slot in the FI, and in the FI
  • the STI of the occupied node of the specific time slot is the same as the STI of the local node, it is determined to continue to occupy a specific time slot; when it is determined that the service priority of the node occupying a specific time slot is higher than that of the occupied time slot of the specific time slot in the FI
  • the node releases a specific time slot and re-applies for a time slot.
  • the determining unit 62 is configured to: when the received FI indicates that the time slot occupied by the node is a specific time slot in which a resource collision occurs, specifically, when the FI indicates the time slot of the time slot occupied by the node.
  • the occupied state is a collision state
  • the STI of the occupied node is a preset STI, it is determined that a resource collision occurs in the time slot occupied by the node.
  • the determining unit 62 is configured to determine whether to continue to occupy the specific time slot according to the occupancy information of the specific time slot in the FI, and the STI of the local node and the service priority of occupying a specific time slot.
  • the local node releases the specific time slot and re-applies the time slot;
  • the service priority of the slot is the same as the service priority of the occupied node of the specific time slot in the FI, the node releases the specific time slot and re-applies the time slot; when determining that the service priority of the node occupying a specific time slot is higher than that in the FI
  • the service priority of the occupied node of a particular time slot is determined, it is determined that the specific time slot continues to be occupied.
  • another apparatus for transmitting a slot state includes:
  • the processor 800 is configured to determine, according to the received frame information FI of each time slot, by multiple nodes other than the local node.
  • the service priority of the node is determined whether the node with the highest priority is unique. If yes, the occupation information of the specific time slot is set in the FI sent by the local node through the transceiver 810, indicating that the specific time slot is the highest priority of the service.
  • the node is occupied; otherwise, the occupation information of the specific time slot is set in the FI sent by the local node through the transceiver 810 to indicate that a resource collision occurs in a specific time slot; the transceiver 810 is configured to receive and transmit data under the control of the processor 800.
  • the processor 800 is configured to: when the occupation information of the specific time slot is set in the FI sent by the local node, the specific time slot is occupied by the node with the highest service priority, and is specifically used for: Setting the slot occupancy state of the specific time slot to the collision state, the STI of the occupied node of the specific time slot is the STI of the node with the highest service priority, and the service priority of the occupied node of the specific time slot is the unique The business priority of the node with the highest service priority.
  • the processor 800 is configured to: when the occupation information of the specific time slot is set in the FI sent by the local node to indicate that the specific time slot is occupied by the node with the highest priority of the service, specifically: The slot occupancy state of the specific time slot in the FI is the occupied state, and the STI of the occupied node of the specific time slot is the STI of the node with the highest service priority, and the service priority of the occupied node of the specific time slot is The business priority of the node with the highest business priority.
  • the processor 800 is configured to: when the occupation information of the specific time slot is set in the FI sent by the local node to indicate that a resource collision occurs in a specific time slot, the processor 800 is configured to: set a time slot of a specific time slot in the FI sent by the local node.
  • the occupied state is a collision state
  • the STI of the occupied node of the specific time slot is a preset STI
  • the service priority of the occupied node of the specific time slot is the highest service priority among the service priorities of the multiple nodes.
  • 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.
  • another apparatus for determining a slot state includes:
  • the processor 900 is configured to receive the frame information FI by the transceiver 910; when it is determined that the received FI indicates that the time slot occupied by the node is occupied by a node with the highest priority or a specific time slot in which a resource collision occurs, The occupation information of the specific time slot in the specific time slot, and the node temporary identifier STI of the node and the service priority of occupying a specific time slot, determining whether to continue occupying the specific time slot;
  • the transceiver 910 is configured to receive and transmit data under the control of the processor 900.
  • the processor 900 is configured to: when the received FI indicates that the time slot occupied by the node is a specific time slot occupied by the node with the highest priority, specifically, when the FI indicates that the node is occupied by the node.
  • the slot occupancy state of the slot is the collision state.
  • the STI of the occupied node is not the preset STI, or when the FI indicates that the slot occupancy status of the slot occupied by the node is occupied, the STI of the occupied node is not the preset STI.
  • the time slot occupied by the node is a specific time slot occupied by the node with the highest priority.
  • the processor 900 is configured to determine whether to continue to occupy the specific time slot according to the occupation information of the specific time slot in the FI, and the STI of the local node and the service priority of the specific time slot.
  • the service priority of the specific time slot occupied by the node is the same as the service priority of the occupied node of the specific time slot in the FI
  • the STI of the occupied node of the specific time slot in the FI is the same as the STI of the local node, it is determined to continue.
  • the processor 900 is configured to: when the received FI indicates that the time slot occupied by the node is a specific time slot in which a resource collision occurs, specifically, when the FI indicates the time slot occupation status of the time slot occupied by the node.
  • the processor 900 is configured to determine whether to continue to occupy the specific time slot according to the occupation information of the specific time slot in the FI, and the STI of the local node and the service priority of the specific time slot.
  • the local node When it is determined that the service priority of the specific time slot of the node is lower than the service priority of the occupied node of the specific time slot in the FI, the local node releases the specific time slot and re-applies the time slot; when determining that the node occupies a specific time slot When the service priority is the same as the service priority of the occupied node of the specific time slot in the FI, the local node releases the specific time slot and re-applies the time slot; when determining that the service priority of the local time slot occupied by the node is higher than the specific one in the FI When the service priority of the occupied node of the time slot is determined, it is determined that the specific time slot continues to be occupied.
  • the bus architecture may include any number of interconnected buses and bridges, specifically linked by one or more processors represented by processor 900 and various circuits of memory represented by memory 920.
  • 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 910 can be a plurality of components, including a transmitter and a receiver, providing means for communicating with various other devices on the transport interface.
  • the processor 900 is responsible for managing the bus architecture and general processing, and the memory 920 can store data used by the processor 900 in performing operations.
  • the embodiment of the present application provides a method and an apparatus for transmitting and determining a slot state, which are used to avoid collision time slots without knowing whether the occupied node with the highest occupation priority is unique.
  • the occupied node can only use the long-term collision problem caused by the probability access mechanism.
  • 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 utilized in the form of a computer program product embodied on one or more computer-usable storage interfaces (including but not limited to disk storage and optical storage, etc.) in which computer usable program code is embodied.
  • 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 include instructions.
  • the manufacturing device, the instruction device implements the functions specified in one or more blocks of a flow or a flow and/or a 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)
  • Small-Scale Networks (AREA)

Abstract

本申请实施例提供了一种时隙状态的发送以及确定的方法、装置,用以避免在不知道所述占用优先级最高的占用节点是否唯一的情况下,碰撞时隙的占用节点只能使用概率接入机制导致的长时间碰撞问题。该方法包括:根据接收的各个时隙的帧信息FI,确定由本节点以外的多个节点在FI中指示占用的特定时隙,以及占用该特定时隙的多个节点的具体占用信息;根据所述占用该特定时隙的多个节点的具体占用信息,确定占用该特定时隙的多个节点的业务优先级,判断业务优先级为最高的节点是否唯一,如果是,在本节点发送的FI中设置该特定时隙的占用信息指示该特定时隙被唯一的业务优先级最高的节点占用;否则,在本节点发送的FI中设置该特定时隙的占用信息指示特定时隙发生资源碰撞。

Description

一种时隙状态的发送以及确定的方法、 装置 本申请要求在 2013年 01月 24 日提交中国专利局、 申请号为 201310028010.1、 申请 名称为"一种时隙状态的发送以及确定的方法、 装置"的中国专利申请的优先权, 其全部内 容通过引用结合在本申请中。
技术领域
本申请涉及移动通信领域, 尤其涉及一种时隙状态的发送以及确定的方法、 装置。 背景技术
MS-ALOHA ( Mobile Slotted ALOHA, 移动时隙 ALOHA协议) 中, 每 N个时隙构成 一个帧, FI(Frame Information, 帧信息)是一个由 N个时隙状态消息组成的向量, 由节点在 前 N个时隙中对其他节点发送的 FI消息监听获得。 节点发送的 FI消息中每个时隙的占用 信息的指示消息由 12 bit构成, 如图 1所示, 包括以下内容:
1、 时隙占用状态 (2bit): FI 中时隙状态, 定义为: 空闲状态 (00), —跳邻占用以及本 节点自己占用状态(10), 碰撞状态 (01), 两跳邻节点占用状态(11)。
2、 占用此时隙的节点的 STI (Source Temporary Identifier, 节点临时标识 )(8bit)。
3、 占用此时隙的节点的业务优先级 (2bit): 定义了四个等级。
MS-ALOHA定义了时隙占用的四个等级的业务优先级的含义:
PSF(Priority Status Field, 优先级状态域) = [00] - Emergency (紧急), 只给紧急车辆使 用, 每个紧急车辆只能占用 1个时隙用于此目的;
PSF = [01] - Safety (安全), 用于普通车辆的一般性道路安全目的的通信。每个车在启 动后都建立用于一般性道路安全目的的通信的业务信道。 每个车辆只能占用 1个时隙用于 此目的;
PSF = [10] - Auxiliary (辅助), 用于辅助目的 (具体含义未明确), 每个车辆只能占用 1个时隙用于此目的;
PSF = [11] - Entertainment (娱乐), 用于娱乐目的的通信, 每个车辆可以占用多个时 隙用于此目的。
各个优先级的高低关系为: [00] >[01]> [10]> [11]。
下面对信道占用过程进行描述。以 FI连续发送为前提,节点行为分为 5个步骤:监听、 选择空闲时隙 slot、 等待并确认该 slot空闲、 发送、 监听反馈。 大体流程见图 2。 各个步骤 详细定义如下: 步骤 1 : 监听一帧。
节点监听一帧中的所有 slot,并将信息填入下面的 N*N时隙状态緩存表中。具体而言: 如果在 slot η ( 0<=η<=Ν-1 )上收到了 FI, 则将该 FI中的 N个域 field填入下表中 slot n对应的行中 (每个 field有 4种取值, 图中表示为 XX ); 如果在 slot n上节点没有收到任 何内容时, 则将 N列 "default状态"填入下表中 slot n对应的行中。
通过上述方式, 在一帧结束后, 节点获得了 N*N矩阵形式维护的时隙状态信息, 如图 3所示; 其中,任一个元素有 5种可能的状态, 即前面提到的 4种状态和缺省 default状态。
注: default状态也可以和空闲状态 (00)合并为一个状态。
步骤 2: 选择一个空闲时隙 ( available slot )。
对于某个 slot,仅当该 slot在 N*N时隙状态緩存表中的列满足以下条件时,认为该 slot 是空闲可用 ( available ) 的:
列中各个元素, 或者为空闲状态 (00) , 或者为 default状态。
如果有空闲 slot, 选择该 slot; 如果空闲 slot多于一个, 从中随机选一个; 如果没有空 闲 slot, 那么将比本节点当前优先级低的 slot看做为空闲进行选择。
选择空闲 slot后, 执行步骤 3。
步骤 3 : 等待选定的 slot到达, 再次确认是否空闲。
假设步骤 2中, 选择的空闲 slot p。 那么在 slot p到达前, 持续监听各个 slot, 用新的 slot信息覆盖上表中的旧的 slot信息(即窗口中始终保持最近 N个 slot的信息)。 等到 slot p-1的结尾, 利用 N*N时隙状态緩存表, 检查 slot p是否仍然满足步骤 2中的条件(包括 无空闲 slot时的优先级考虑的方式):
如满足, 则执行步骤 4;
如不满足, 此刻立即执行步骤 2。
步骤 4: 在 slot p发送子帧 subframe。
此时在 subframe的 FI中, 按照如下规则填写各个 field:
对于当前 slot, 填写占用状态 (10) , 且填写本节点的 STI和优先级信息;
对于其他 slot, 考察 (N-1)*N时隙状态緩存表中对应的列, 将该 slot状态填写为空闲状 态 (00) (不填写 STI和优先级信息), 条件是: 列中的 N-1个元素都是空闲状态 (00)、 default 状态或两跳占用状态 (;11)。
将该 slot状态填写为占用状态 (10) (填写对应的 STI和优先级信息), 条件是: slot的 检测域为占用状态(10) , 而且其他 N-1个元素都是空闲状态 (00)、 default状态、 两跳占用状 态( 11 ) , 或与检测域 STI相同的占用状态( 10)。 将该 slot状态填写为碰撞状态 (01) (多个时隙发生碰撞, 也可称作碰撞状态, 填写优 先级最高的 STI, 当优先级相同时, 随机选一个填写, 填写最高的优先级), 条件是: N-1 个元素中, 出现了 2个及其以上的占用状态(10), 且 STI不同。
将该 slot状态填写为两跳占用状态 (11) (填写 STI和优先级), 条件是: 对应的 slot的 检测域为 default状态, 而且在剩下的 N-1个元素中, 一个或多个为占用状态(10), 且它们 的 STI都相同。
发送完毕后, 清空时隙状态緩存表中 slot p对应的行。 执行步骤 5。
步骤 5: 监听反馈, 确认是否成功。
从 slot p+1开始, 监听 N-1个 slot, 生成 (N-1)*N时隙状态緩存表, 在 slot p+N-1的结 尾(也就是 slot p+N的开头), 判断 slot p对应的列的 N- 1个元素:
如果 N-1个元素为 default状态、 空闲状态 (00), 或者为占用状态(10)且 STI与自身的 STI相同, 则认为接入成功。 否则, 如果 N-1个元素中, 出现了一个或多个 STI与自身 STI 不同的占用状态 (10), 则判断优先级:
如果自身的 PSF比其他 PSF都高, 则认为成功, slot p+N可以继续发送, 否则, 如果 本节点的 PSF不是其中最高的, 则认为接入失败, 立即重新选择空闲 slot (从上面的步骤 2开始)。
如果有和本节点一样的 PSF的 STI (即大家都是最高的优先级),则可以在 slot p+N发 送, 然后如果再次出现这种情况, 则以概率 p再次在 slot p+2*N发送, 以概率(1-p)认为发 送失败, 立即重新选择空闲 slot, 执行步骤 2。
当上面判断成功时, 自然进入下面的信道维护过程。
信道维护过程仍以 FI连续发送为前提。 信道维护过程中, 分为 2类情况:
发送 slot: 此时 FI填写方法与上面的步骤 4完全一致。 只是此时不需要清空时隙状态 緩存表中 slot p对应的行(因为根本没有维护该行)。
接收 slot: 维护 (N-1)*N时隙状态緩存表并且在本节点的 slot p+X*N前判断是否成功, 方法与上面的步骤 5也完全一致。
总之,在信道维护过程中,节点只需要维护 (N-1)*N时隙状态緩存表,不需要维护 N*N 时隙状态緩存表。
综上所述, 节点通过处理, 可以将判断为碰撞的时隙可以分成两类:
1 ) 占用此时隙资源的节点的优先级都相同, 在这种情况下, 随机选择一个用户, 记 录此优先级以及该用户的 STI;
2 ) 占用此时隙资源的节点的优先级不同,在这种情况下,记录优先级高的节点的 PSF 以及 STI。
以上记录通过 FI发送出去之后,接收的节点判断自己占用的时隙的碰撞情况,如果自 身的 PSF比其他 PSF都高, 即本节点是唯一的 PSF最高的节点, 则认为本节点接入(维 护)时隙资源成功; 如果本节点的 PSF不是其中最高的, 则认为接入失败, 立即重新选择 空闲 slot。 否则, 如果有和本节点一样的优先级的 STI (即大家都是最高的 PSF ), 则认为 本节点以一定的概率接入(维护) 时隙资源成功; 可以在从判断时隙开始第一次出现本节 点维护的时隙上发送, 然后如果再次出现这种情况, 则以概率 p在从判断时隙开始第一次 出现本节点维护的时隙上发送, 以概率(1-P)认为发送失败, 立即重新选择空闲 slot。
发送节点对非本节点占用时隙的状态的指示, 判断此时隙发生碰撞的准则是不合理 的, 这里我们认为该方案中针对在某时隙上发生碰撞的用户业务中最高优先级的用户不唯 一时, 即多个同优先级业务发生碰撞时的处理, 存在以下问题: 根据车联网业务特征, 绝 大多数车辆启动之后, 首先请求资源, 用于发送周期性的安全业务。 在这种机制下, 如果 相同优先级车辆 (服务)发生碰撞或者资源抢占, 会造成相同优先级车辆 (服务)碰撞持 续很长时间, 系统性能恶化。 发明内容
本申请实施例提供了一种时隙状态的发送以及确定的方法、 装置, 用以才 居发生碰撞 的时隙的占用优先级最高的占用节点是否唯一, 确定继续维护时隙或者放弃时隙, 避免了 在不知道所述占用优先级最高的占用节点是否唯一的情况下, 只能使用概率接入机制导致 的长时间碰撞问题。
本申请实施例提供的一种时隙状态的发送方法包括:
根据接收的各个时隙的帧信息 FI, 确定由本节点以外的多个节点在 FI中指示占用的 特定时隙, 以及占用该特定时隙的多个节点的具体占用信息;
才艮据占用所述特定时隙的多个节点的具体占用信息, 确定占用该特定时隙的多个节点 的业务优先级, 判断业务优先级为最高的节点是否唯一, 如果是, 在本节点发送的 FI中设 置该特定时隙的占用信息指示该特定时隙被唯一的业务优先级最高的节点占用; 否则, 在 本节点发送的 FI中设置该特定时隙的占用信息指示特定时隙发生资源碰撞。
本申请实施例提供的一种时隙状态的确定方法包括:
接收帧信息 FI;
当确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高的节点占用或者发 生资源碰撞的特定时隙时, 居 FI中所述特定时隙的占用信息, 以及本节点的节点临时标 识 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙。
本申请实施例提供的一种时隙状态的发送装置包括:
特定时隙确定单元, 用于根据接收的各个时隙的帧信息 FI, 确定由本节点以外的多个 节点在 FI中指示占用的特定时隙, 以及占用该特定时隙的多个节点的具体占用信息; 占用信息发送单元, 用于才 居所述占用该特定时隙的多个节点的具体占用信息, 确定 占用该特定时隙的多个节点的业务优先级, 判断业务优先级为最高的节点是否唯一, 如果 是,在本节点发送的 FI中设置该特定时隙的占用信息指示该特定时隙被唯一的业务优先级 最高的节点占用; 否则,在本节点发送的 FI中设置该特定时隙的占用信息指示特定时隙发 生资源碰撞。
本申请实施例提供的一种时隙状态的确定装置包括:
接收单元, 用于接收帧信息 FI;
确定单元,用于当确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高的节 点占用或者发生资源碰撞的特定时隙时,才 居 FI中所述特定时隙的占用信息, 以及本节点 的节点临时标识 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙。
通过以上技术方案可知, 本申请中根据接收的各个时隙的帧信息 FI, 确定由本节点以 外的多个节点在 FI中指示占用的特定时隙,以及占用该特定时隙的多个节点的具体占用信 息; 才 居所述占用该特定时隙的多个节点的具体占用信息, 确定占用该特定时隙的多个节 点的业务优先级, 判断业务优先级为最高的节点是否唯一, 如果是, 在本节点发送的 FI 中设置该特定时隙的占用信息指示该特定时隙被唯一的业务优先级最高的节点占用; 否 则, 在本节点发送的 FI中设置该特定时隙的占用信息指示特定时隙发生资源碰撞。 在 FI 中通过占用信息区分是否存在唯一的占用优先级最高的节点, 使得发生资源碰撞的时隙的 占用节点在接收 FI之后, 能够根据 FI中的占用信息作出相应的处理, 即确定继续占用或 者确定维护失败释放时隙; 相比于背景技术中接收的节点因不能区分是否存在唯一的占用 优先级最高的节点而使用的概率接入机制, 本申请提供的方法避免了概率接入机制可能导 致的长时间碰撞问题,完善了时隙碰撞的处理方案,能够对时隙碰撞进行更加准确地处理。 附图说明
图 1为背景技术的 FI结构示意图;
图 2为背景技术的时隙申请的过程示意图;
图 3为背景技术的时隙状态信息维护表;
图 4为本申请实施例提供的一种时隙状态的发送方法的流程示意图; 图 5为本申请实施例提供的一种时隙状态的确定方法的流程示意图;
图 6为本申请实施例提供的一种时隙状态的发送装置的结构示意图;
图 7为本申请实施例提供的一种时隙状态的确定装置的结构示意图;
图 8为本申请实施例提供的另一种时隙状态的发送装置的结构示意图;
图 9为本申请实施例提供的另一种时隙状态的确定装置的结构示意图。 具体实施方式
本申请实施例提供了一种时隙状态的发送以及确定的方法、 装置, 用以避免在不知道 所述占用优先级最高的占用节点是否唯一的情况下, 碰撞时隙的占用节点只能使用概率接 入机制导致的长时间碰撞问题。
当确定时隙上发生碰撞的节点中最高占用优先级的节点不唯一时, 发生碰撞的节点都 为接入 /维护失败, 应该重新接入。 但在实施过程中, 对于系统中时隙资源发生碰撞对应最 高优先级的节点不唯一和唯一是都可能存在的, 为了节点之间达成一个相同的理解, 必然 也需要将在该时隙资源发生碰撞的节点中最高占用优先级的节点唯一时的情况考虑进去。 我们仍然沿用 MS-ALOHA优先级处理思想, 即允许这唯一的一个最高优先级的用户接入 / 继续维护该信道, 但该时隙的占用指示可以釆纳 MS-ALOHA中的碰撞状态( 01 ), 也可以 釆用指示占用 (10 ), 与具体的实现方式有关。
参见图 4, 本申请实施例提供的一种时隙状态的发送方法包括:
5301、 根据接收的各个时隙的帧信息 FI, 确定由本节点以外的多个节点在 FI中指示 占用的特定时隙, 以及占用该特定时隙的多个节点的具体占用信息;
5302、 才 居所述占用该特定时隙的多个节点的具体占用信息, 确定占用该特定时隙的 多个节点的业务优先级, 判断业务优先级为最高的节点是否唯一, 如果是, 在本节点发送 的 FI中设置该特定时隙的占用信息指示该特定时隙被唯一的业务优先级最高的节点占用; 否则, 在本节点发送的 FI中设置该特定时隙的占用信息指示特定时隙发生资源碰撞。
其中, 所述占用信息, 包括时隙占用状态、 占用节点的节点临时标识 STI和占用节点 优先级。
具体如何实现 S302, 本申请提出两套方案:
方案一、较佳的, 所述在本节点发送的 FI中设置特定时隙的占用信息指示特定时隙被 唯一的业务优先级最高的节点占用, 包括: 在本节点发送的 FI中设置特定时隙的时隙占用 状态为碰撞状态,特定时隙的占用节点的 STI为所述唯一的业务优先级最高的节点的 STI, 特定时隙的占用节点的业务优先级为所述唯一的业务优先级最高的节点的业务优先级。 所述在本节点发送的 FI 中设置特定时隙的占用信息指示特定时隙发生资源碰撞, 包 括: 在本节点发送的 FI中设置特定时隙的时隙占用状态为碰撞状态,特定时隙的占用节点 的 STI为预设 STI, 特定时隙的占用节点的业务优先级为所述多个节点的业务优先级中的 最高的占用优先级。
节点将发生碰撞的时隙均确定为碰撞状态, 而由本申请所设计的预设 STI, 作为优先 级最高的节点的 STI不唯一的标识。
方案二、较佳的, 所述在本节点发送的 FI中设置特定时隙的占用信息指示特定时隙被 所述唯一的业务优先级最高的节点占用, 包括: 在本节点发送的 FI中设置特定时隙的时隙 占用状态为占用状态, 特定时隙的占用节点的 STI为所述唯一的业务优先级最高的节点的 STI, 特定时隙的占用节点的业务优先级为所述唯一的业务优先级最高的节点的业务优先 级。
所述在本节点发送的 FI 中设置特定时隙的占用信息指示特定时隙发生资源碰撞, 包 括: 在本节点发送的 FI中设置特定时隙的时隙占用状态为碰撞状态,特定时隙的占用节点 的 STI为预设 STI, 特定时隙的占用节点的业务优先级为所述多个节点的业务优先级中的 最高的业务优先级。
方案二中, 本节点将优先级最高的节点唯一时的时隙占用状态确定为占用状态, 其它 节点在接收到该占用状态的信息后, 按照正常占用状态的时隙进行处理; 较佳的, 本节点 判断所述优先级最高的节点是本节点的一跳邻节点还是二跳邻节点, 并根据判断结果确定 在 FI中指示时隙占用状态是占用状态还是二跳占用状态。
较佳的, 本申请中, STI的取值分为两种, 其中一部分 STI定义为普通 STI, 用于标 识各个 UE; 另一部分 STI定义为预设的特殊 STI, 该 STI不指向任何 UE, 可用于表示时 隙发生了碰撞; 其中, 各节点预先获知普通 STI和特殊 STI。
参见图 5 , 本申请实施例提供的一种时隙状态的确定方法包括:
S401、 接收帧信息 FI;
S402、当确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高的节点占用或 者发生资源碰撞的特定时隙时, 居 FI中所述特定时隙的占用信息, 以及本节点的节点临 时标识 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙。
其中, 所述占用信息, 包括: 时隙占用状态、 占用节点的 STI和占用节点优先级。 较佳的,所述确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高的节点占 用的特定时隙, 包括: 当 FI指示本节点所占用的时隙的时隙占用状态为碰撞状态, 占用节 点的 STI不为预设 STI时,或者当 FI指示本节点所占用的时隙的时隙占用状态为占用状态, 占用节点的 STI不为预设 STI时, 确定本节点所占用的时隙为被唯一的优先级最高的节点 占用的特定时隙。
较佳的,根据 FI中所述特定时隙的占用信息, 以及本节点的 STI和占用特定时隙的业 务优先级, 确定是否继续占用该特定时隙, 包括: 当确定本节点占用特定时隙的业务优先 级与 FI中的特定时隙的占用节点的业务优先级相同,且 FI中的特定时隙的占用节点的 STI 与本节点的 STI相同时, 确定继续占用特定时隙; 当确定本节点占用特定时隙的业务优先 级高于 FI中的特定时隙的占用节点的业务优先级时, 确定继续占用特定时隙; 否则, 本节 点释放特定时隙并重新申请时隙。
较佳的, 所述确定接收的 FI指示本节点所占用的时隙为发生资源碰撞的特定时隙, 包 括: 当 FI指示本节点所占用的时隙的时隙占用状态为碰撞状态, 占用节点的 STI为预设 STI时, 确定本节点所占用的时隙发生资源碰撞。
较佳的,根据 FI中所述特定时隙的占用信息, 以及本节点的 STI和占用特定时隙的业 务优先级, 确定是否继续占用该特定时隙, 包括: 当确定本节点占用特定时隙的业务优先 级低于 FI 中的特定时隙的占用节点的业务优先级时, 本节点释放特定时隙并重新申请时 隙;当确定本节点占用特定时隙的业务优先级与 FI中的特定时隙的占用节点的业务优先级 相同时, 本节点释放特定时隙并重新申请时隙; 当确定本节点占用特定时隙的业务优先级 高于 FI中的特定时隙的占用节点的业务优先级时, 确定继续占用特定时隙。
根据接收到的 FI的特定时隙的占用信息,对被指示发生了碰撞的本节点所占用的特定 时隙进行相应的处理。由于本申请提供的方法中,所接收的 FI包含有更加准确的占用信息, 即表达了占用优先级最高的节点是否唯一的信息,本节点能够根据接收的 FI确定继续占用 特定时隙还是确定占用 /维护失败重新申请时隙: 当确定有与本节点占用优先级相同的其它 节点时, 释放该特定时隙并重新申请时隙, 不再进行概率接入。
下面给出几个本申请的具体实施例。
具体实施例 1 : 网络中存在多个节点, 这里只考虑节点 A和节点 B, 节点 A和节点 B 互为一跳邻节点, 节点 A 占用时隙 1 , 节点 B 占用时隙 2, 在 slot 1节点 B接收到节点 A 发送的 FI后, 节点 B需要结合本节点当前维护的时隙状态表, 对各个时隙的状态进行更 新。
首先考虑对 slot 3的处理,各个时隙的占用信息用时隙占用状态 +占用节点的业务优先 级 (pri)+占用节点的 STI表示, 如表 1所示, 主要考虑以下两类情况:
1 ) 节点 A的 FI中对 slot 3指示为碰撞,且节点 B当前维护的 slot 3的时隙状态为碰撞 或者被一跳邻节点占用时, 节点 B更新 slot 3的最新状态为碰撞。 但优先级以及 STI的具 体指示需要分情况处理:
当根据 FI和当前维护的时隙状态表判定占用 slot 3的多个用户中最高优先级的用户唯 一时, 即如果 FI和当前维护的时隙状态表中 slot 3的优先级相同且 STI不为特殊 STI, 或 者优先级不同但较高优先级对应的 STI不是特殊 STI时, 需要更新 slot 3的最新优先级指 示为该较高优先级用户的优先级, STI为该较高优先級用户的 STI。
当根据 FI和当前维护的时隙状态表判定占用 slot 3的多个用户中最高优先级的用户不 唯一时, 即如果 FI和当前维护的时隙状态表中存在优先级相同 STI不同的时隙,或者优先 级不同但较高优先级对应的 STI为特殊的 STI, 或者优先级相同且 STI都为特殊的 STI的 情况下, 此时需要更新 slot 3的最新优先级指示为较高的优先级, 但 STI为特殊的 STI。
节点 A的 FI中对 slot 3指示为被其一跳邻节点占用,且节点 B当前维护的 slot 3的时隙 状态为被其一跳邻节点占用, 此时, 节点 B需要结合 FI和当前维护的时隙状态表更新 slot 3的最新状态:
当根据 FI和当前维护的时隙状态表判定占用 slot 3的多个用户中较高优先级的用户唯 一时,更新 slot 3的最新状态的优先级为该较高优先级用户的优先级, STI为该较高优先级 用户的 STI。
当根据 FI和当前维护的时隙状态表判定占用 slot 3的多个用户中较高优先级的用户不 唯一时, 即两者中对 slot 3指示的优先级相同但是 STI不同, 则更新 slot 3的最新状态的 STI为特殊 STI。
当 FI和当前维护的时隙状态表中对此时隙的指示中的 STI和优先级都匹配, 即 FI和 当前维护的时隙状态表中指示的是同一节点占用, 此时更新 slot 3的最新状态为: 被一跳 邻节点占用, 同时记录该节点的优先级以及 STI。
表 1
Figure imgf000011_0001
1 )如果 pril > pri2, 则"碰撞 +pril+STIl"
2 )如果 pril = pri2且 STI1 = STI2, 则"碰撞 +pril+STIl"
3 )如果 pril = pri2且 STI不同, 则"碰撞 +pril+特珠 STI"
4 )如果 pril < pri2, 则"碰撞 +pri2+STI2"
碰撞 +pril+ STIl 碰撞 +pri2+特 判定该时隙发生碰撞, 具体如下:
殊 STI 1 )如果 pnl > pri2, 则"碰撞 +pril+STIl"
2 )如果 pril = pri2, 则"碰撞 +pril+特殊 STI"
3 )如果 pril < pri2, 则"碰撞 +pri2+特殊 STI" 碰撞 +pril+特珠 STI 被一跳邻节点 判定该时隙发生碰撞, 具体如下:
占用 +pri2+STn 1 )如果 pril > pri2, 则"石並撞 +pril+特殊 STI"
2 )如果 pril = pri2, 则"碰撞 +pril+特殊 ST
3 )如果 pril < pri2, 则"碰撞 +pri2+ STI1"
碰撞 +pril+ STIl 被一跳邻节点 判定该时隙发生碰撞, 具体如下:
占用 +pri2+STI2 1 )如果 pril > pri2, 则"碰撞 +pril+STIl"
2 )如果 pril = pri2且 STI不同, 则"碰撞 +pril+特殊 STI"
3 )如果 pril = pri2且 STI1 = STI2, 则"碰撞 +pnl+STIl"
4 )如果 pril < pri2, 则"碰撞 +pri2+STI2"
发送节点指示 "一跳 被一跳邻节点 如 STI或 pri不匹配, 则判定该时隙发生发生碰撞, 具体如 节点占用 +pril +STIl 占用 +pri2 +STI2 下:
1 ) 如果 pnl > pri2, 则"石並撞 +pril+STIl"
2 ) 如果 pril = pri2且 STI不同, 则"碰撞 +pril+特殊 STI"
3 ) 如杲 pril = pri2 且 STI1=STI2,, 则"被一跳节点占用 +pril+STIl"
4 ) 如果 pril < pri2, 则"碰撞 +pri2+STI2" 然后考虑对 slot 1的处理, 在 slotl,节点 A对 slot 1的指示必然为 "被本节点占用", 这 里只考虑节点 B当前维护的 slot 1的时隙状态为 "被本节点的二跳邻节点占用"的情况。 如 表 2所示, 此时, 节点 B需要结合 FI和当前维护的时隙状态表更新 slotl的最新状态: 当 FI和当前维护的时隙状态表中对此时隙的指示中的 STI或者优先级不匹配时,更新 slot 1的最新状态为碰撞, 具体的优先级以及 STI指示需要分情况处理: 当根据 FI和当前 维护的时隙状态表判定占用 slot 1的多个用户中较高优先级的用户唯一时,更新 slot 1的最 新状态的优先级为该较高优先级用户的优先级, STI 为该较高优先级用户的 STI; 当根据 FI和当前维护的时隙状态表判定占用 slot 1的多个用户中较高优先级的用户不唯一时, 即 两者中对 slot 1指示的优先级相同但是 STI不同, 则更新 slot 1的最新状态的 STI为特殊 STL
当 FI和当前维护的时隙状态表中对此时隙的指示中的 STI和优先级都匹配, 即 FI和 当前维护的时隙状态表中指示的是同一节点, 此时更新 slot 1的最新状态为: 被一跳节点 占用, 同时记录该节点的优先级以及 STI。 表 2
Figure imgf000013_0001
最后考虑对 slot2的处理,这里主要考虑 slot 1中节点 A发送的 FI对 slot2的指示为碰 撞的情况, 如表 3所示。
首先考虑接收到的 FI的指示为"碰撞 +pril+特殊 STI "的情况。 如果节点自身的优先级 不大于 FI中指示的优先级, 则节点收到了负反馈, 节点重新开始监听进行信道接入或者根 据当前本节点维护的信道状况信息进行时隙选择。反之, 如果节点 B自身的优先级高于 FI 中指示的优先级, 则节点可以继续维护该时隙资源。
然后考虑接收到的 FI的指示为"碰撞 +pril+普通 STI ( STI1 ) "的情况, 如果节点 B自 身的优先级低于指示的优先级或者节点 B 自身的优先级与 FI中指示的优先级相同但 STI 不同, 则节点 B认为收到了负反馈, 节点可以重新开始监听进行信道接入或者根据当前本 节点维护的信道状况信息进行时隙选择。如果节点 B自身的优先级以及 STI与指示的优先 级以及 STI—致, 可以认为指示的就是节点 B本节点, 即节点 B认为接收到了正反馈, 可 以继续维护该时隙资源。 当节点 B自身的优先级高于指示的优先级的话, 为了保证高优先 级节点的优先权, 节点 B继续维护该时隙资源。 表 3
Figure imgf000014_0001
具体实施例 2:
网络中存在多个节点, 这里只考虑节点 A和节点 B, 节点 A和节点 B互为一跳邻节 点, 节点 A 占用时隙 1 , 节点 B 占用时隙 2,在 slot 1节点 B接收到节点 A发送的 FI后, 节点 B需要结合本节点当前维护的时隙状态表, 对各个时隙的内部状态进行更新。
首先考虑对 slot 3的处理, 如下表 4所示, 主要考虑以下三种情况:
当节点 A的 FI中对 slot 3指示为碰撞,且节点 B当前维护的 slot 3的时隙状态为碰撞时, 节点 B更新 slot 3的最新状态为碰撞, 并记录 FI和当前维护的时隙状态中 slot 3的较高优 先级。
当节点 A的 FI中对 slot 3指示为碰撞,且节点 B当前维护的 slot3的时隙状态为被一跳 节点占用时, 如果当前维护的 slot3的时隙状态的优先级不高于 FI中指示的优先级, 则更 新 slot 3的最新状态为碰撞, 并记录 FI 中指示的优先级; 如果当前维护的 slot3的时隙状 态的优先级高于 FI 中指示的优先级, 则不需要更新, 记录维持原有状态。
当节点 A的 FI 中对 slot 3指示为被一跳节点占用,且节点 B当前维护的 slot 3的时隙 状态为 "被一跳节点占用" 时, 如果两者中较高优先级唯一时, 更新 slot 3的最新优先级 以及 STI为此较高的优先级, 并根据此较高优先级的信息确定是被一跳节点还是二跳节点 占用; 如果两者中不存在唯一的较高优先级时, 更新 slot 3的最新状态为碰撞, 并记录此 优先级。
表 4
Figure imgf000015_0001
然后考虑对 slot 1的处理, 如下表 5所示。 在 slotl,节点 A对 slot 1的指示必然为 "被 本节点占用", 这里只考虑节点 B当前维护的 slot 1的时隙状态为 "被本节点的二跳邻节点 占用"的情况。此时,节点 B需要结合 FI和当前维护的时隙状态信息更新 slotl的最新状态: 如果两者中较高优先级唯一时, 更新 slot 1的最新优先级以及 STI 为此较高的优先级, 并 根据此较高优先级的信息确定是被一跳节点还是二跳节点占用; 如果两者中不存在唯一的 较高优先级时, 更新 slot 1的最新状态为碰撞, 并记录此优先级。
表 5
Figure imgf000015_0002
最后考虑对 slot 2的处理, 节点 B可能收到碰撞指示, 也可能收到非碰撞指示, 如表 6所示。 首先考虑接收到的 FI的指示为"碰撞 +pril"的情况, 如果节点 B自身的优先级不高于
FI中指示的优先级则节点 B认为收到了负反馈,节点可以重新开始监听进行信道接入或者 根据当前本节点维护的信道状况信息进行时隙选择。
当节点 B自身的优先级高于指示的优先级的话, 为了保证高优先级节点的优先权, 节 点 B继续维护该时隙资源。
表 6
Figure imgf000016_0001
基于同一发明构思, 本申请实施例中还提供了时隙状态的发送装置, 由于该发送装置 解决问题的原理与时隙状态的发送方法相似, 因此该发送装置的实施可以参见方法的实 施, 重复之处不再赘述。
参见图 6, 本申请实施例提供的一种时隙状态的发送装置包括:
特定时隙确定单元 51 , 用于根据接收的各个时隙的帧信息 FI,确定由本节点以外的多 个节点在 FI中指示占用的特定时隙, 以及占用该特定时隙的多个节点的具体占用信息; 占用信息发送单元 52, 用于才 居所述占用该特定时隙的多个节点的具体占用信息, 确 定占用该特定时隙的多个节点的业务优先级, 判断业务优先级为最高的节点是否唯一, 如 果是,在本节点发送的 FI中设置该特定时隙的占用信息指示该特定时隙被唯一的业务优先 级最高的节点占用; 否则,在本节点发送的 FI中设置该特定时隙的占用信息指示特定时隙 发生资源碰撞。
较佳的, 占用信息发送单元 52用于在本节点发送的 FI中设置特定时隙的占用信息指 示特定时隙被唯一的业务优先级最高的节点占用时,具体用于: 在本节点发送的 FI中设置 特定时隙的时隙占用状态为碰撞状态, 特定时隙的占用节点的 STI为所述唯一的业务优先 级最高的节点的 STI, 特定时隙的占用节点的业务优先级为所述唯一的业务优先级最高的 节点的业务优先级。
较佳的, 占用信息发送单元 52用于在本节点发送的 FI中设置特定时隙的占用信息指 示特定时隙被所述唯一的业务优先级最高的节点占用时, 具体用于: 在本节点发送的 FI 中设置特定时隙的时隙占用状态为占用状态, 特定时隙的占用节点的 STI为所述唯一的业 务优先级最高的节点的 STI, 特定时隙的占用节点的业务优先级为所述唯一的业务优先级 最高的节点的业务优先级。
较佳的, 占用信息发送单元 52用于在本节点发送的 FI中设置特定时隙的占用信息指 示特定时隙发生资源碰撞时,具体用于: 在本节点发送的 FI中设置特定时隙的时隙占用状 态为碰撞状态, 特定时隙的占用节点的 STI为预设 STI, 特定时隙的占用节点的业务优先 级为所述多个节点的业务优先级中的最高的业务优先级。
基于同一发明构思, 本申请实施例中还提供了时隙状态的确定装置, 由于该确定装置 解决问题的原理与时隙状态的确定方法相似, 因此该确定装置的实施可以参见方法的实 施, 重复之处不再赘述。
参见图 7, 本申请实施例提供的一种时隙状态的确定装置包括:
接收单元 61 , 用于接收帧信息 FI;
确定单元 62, 用于当确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高 的节点占用或者发生资源碰撞的特定时隙时,根据 FI中所述特定时隙的占用信息, 以及本 节点的节点临时标识 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙。
较佳的, 所述确定单元 62用于确定接收的 FI指示本节点所占用的时隙为被唯一的优 先级最高的节点占用的特定时隙时,具体用于: 当 FI指示本节点所占用的时隙的时隙占用 状态为碰撞状态, 占用节点的 STI不为预设 STI时,或者当 FI指示本节点所占用的时隙的 时隙占用状态为占用状态, 占用节点的 STI不为预设 STI时, 确定本节点所占用的时隙为 被唯一的优先级最高的节点占用的特定时隙。
较佳的,所述确定单元 62用于根据 FI中所述特定时隙的占用信息,以及本节点的 STI 和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙时, 具体用于: 当确定本节 点占用特定时隙的业务优先级与 FI中的特定时隙的占用节点的业务优先级相同, 且 FI中 的特定时隙的占用节点的 STI与本节点的 STI相同时, 确定继续占用特定时隙; 当确定本 节点占用特定时隙的业务优先级高于 FI中的特定时隙的占用节点的业务优先级时,确定继 续占用特定时隙; 否则, 本节点释放特定时隙并重新申请时隙。
较佳的, 所述确定单元 62用于确定接收的 FI指示本节点所占用的时隙为发生资源碰 撞的特定时隙时, 具体用于: 当 FI指示本节点所占用的时隙的时隙占用状态为碰撞状态, 占用节点的 STI为预设 STI时, 确定本节点所占用的时隙发生资源碰撞。
较佳的,所述确定单元 62用于根据 FI中所述特定时隙的占用信息,以及本节点的 STI 和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙时, 具体用于: 当确定本节 点占用特定时隙的业务优先级低于 FI中的特定时隙的占用节点的业务优先级时,本节点释 放特定时隙并重新申请时隙;当确定本节点占用特定时隙的业务优先级与 FI中的特定时隙 的占用节点的业务优先级相同时, 本节点释放特定时隙并重新申请时隙; 当确定本节点占 用特定时隙的业务优先级高于 FI中的特定时隙的占用节点的业务优先级时,确定继续占用 特定时隙。
参见图 8, 本申请实施例提供的另一种时隙状态的发送装置包括:
处理器 800, 用于根据接收的各个时隙的帧信息 FI, 确定由本节点以外的多个节点在
FI中指示占用的特定时隙, 以及占用该特定时隙的多个节点的具体占用信息; 根据所述占 用该特定时隙的多个节点的具体占用信息, 确定占用该特定时隙的多个节点的业务优先 级, 判断业务优先级为最高的节点是否唯一, 如果是, 在本节点通过收发机 810发送的 FI 中设置特定时隙的占用信息指示特定时隙被唯一的业务优先级最高的节点占用; 否则, 在 本节点通过收发机 810发送的 FI中设置特定时隙的占用信息指示特定时隙发生资源碰撞; 收发机 810, 用于在处理器 800的控制下接收和发送数据。
较佳的,处理器 800用于在本节点发送的 FI中设置特定时隙的占用信息指示特定时隙 被唯一的业务优先级最高的节点占用时,具体用于: 在本节点发送的 FI中设置特定时隙的 时隙占用状态为碰撞状态, 特定时隙的占用节点的 STI为所述唯一的业务优先级最高的节 点的 STI, 特定时隙的占用节点的业务优先级为所述唯一的业务优先级最高的节点的业务 优先级。
较佳的,处理器 800用于在本节点发送的 FI中设置特定时隙的占用信息指示特定时隙 被所述唯一的业务优先级最高的节点占用时,具体用于: 在本节点发送的 FI中设置特定时 隙的时隙占用状态为占用状态, 特定时隙的占用节点的 STI为所述唯一的业务优先级最高 的节点的 STI, 特定时隙的占用节点的业务优先级为所述唯一的业务优先级最高的节点的 业务优先级。 较佳的,处理器 800用于在本节点发送的 FI中设置特定时隙的占用信息指示特定时隙 发生资源碰撞时,具体用于: 在本节点发送的 FI中设置特定时隙的时隙占用状态为碰撞状 态, 特定时隙的占用节点的 STI为预设 STI, 特定时隙的占用节点的业务优先级为所述多 个节点的业务优先级中的最高的业务优先级。
其中, 在图 8中, 总线架构可以包括任意数量的互联的总线和桥, 具体由处理器 800 代表的一个或多个处理器和存储器 820代表的存储器的各种电路链接在一起。 总线架构还 可以将诸如外围设备、 稳压器和功率管理电路等之类的各种其他电路链接在一起, 这些都 是本领域所公知的, 因此,本文不再对其进行进一步描述。 总线接口提供接口。 收发机 810 可以是多个元件, 即包括发送机和接收机, 提供用于在传输介盾上与各种其他装置通信的 单元。 处理器 800负责管理总线架构和通常的处理, 存储器 820可以存储处理器 800在执 行操作时所使用的数据。
参见图 9, 本申请实施例提供的另一种时隙状态的确定装置包括:
处理器 900, 用于通过收发机 910接收帧信息 FI; 当确定接收的 FI指示本节点所占用 的时隙为被唯一的优先级最高的节点占用或者发生资源碰撞的特定时隙时, 居 FI中所述 特定时隙的占用信息, 以及本节点的节点临时标识 STI和占用特定时隙的业务优先级, 确 定是否继续占用该特定时隙;
收发机 910, 用于在处理器 900的控制下接收和发送数据。
较佳的,处理器 900用于确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最 高的节点占用的特定时隙时,具体用于: 当 FI指示本节点所占用的时隙的时隙占用状态为 碰撞状态, 占用节点的 STI不为预设 STI时,或者当 FI指示本节点所占用的时隙的时隙占 用状态为占用状态, 占用节点的 STI不为预设 STI时, 确定本节点所占用的时隙为被唯一 的优先级最高的节点占用的特定时隙。
较佳的, 处理器 900用于根据 FI中所述特定时隙的占用信息, 以及本节点的 STI和占 用特定时隙的业务优先级, 确定是否继续占用该特定时隙时, 具体用于: 当确定本节点占 用特定时隙的业务优先级与 FI中的特定时隙的占用节点的业务优先级相同, 且 FI中的特 定时隙的占用节点的 STI与本节点的 STI相同时, 确定继续占用特定时隙; 当确定本节点 占用特定时隙的业务优先级高于 FI中的特定时隙的占用节点的业务优先级时,确定继续占 用特定时隙; 否则, 本节点释放特定时隙并重新申请时隙。
较佳的,处理器 900用于确定接收的 FI指示本节点所占用的时隙为发生资源碰撞的特 定时隙时, 具体用于: 当 FI指示本节点所占用的时隙的时隙占用状态为碰撞状态, 占用节 点的 STI为预设 STI时, 确定本节点所占用的时隙发生资源碰撞。 较佳的, 处理器 900用于根据 FI中所述特定时隙的占用信息, 以及本节点的 STI和占 用特定时隙的业务优先级, 确定是否继续占用该特定时隙时, 具体用于: 当确定本节点占 用特定时隙的业务优先级低于 FI中的特定时隙的占用节点的业务优先级时,本节点释放特 定时隙并重新申请时隙;当确定本节点占用特定时隙的业务优先级与 FI中的特定时隙的占 用节点的业务优先级相同时, 本节点释放特定时隙并重新申请时隙; 当确定本节点占用特 定时隙的业务优先级高于 FI中的特定时隙的占用节点的业务优先级时,确定继续占用特定 时隙。
其中, 在图 9中, 总线架构可以包括任意数量的互联的总线和桥, 具体由处理器 900 代表的一个或多个处理器和存储器 920代表的存储器的各种电路链接在一起。 总线架构还 可以将诸如外围设备、 稳压器和功率管理电路等之类的各种其他电路链接在一起, 这些都 是本领域所公知的, 因此,本文不再对其进行进一步描述。 总线接口提供接口。 收发机 910 可以是多个元件, 即包括发送机和接收机, 提供用于在传输介盾上与各种其他装置通信的 单元。 处理器 900负责管理总线架构和通常的处理, 存储器 920可以存储处理器 900在执 行操作时所使用的数据。
综上所述, 本申请实施例提供了一种时隙状态的发送以及确定的方法、 装置, 用于避 免在不知道所述占用优先级最高的占用节点是否唯一的情况下, 碰撞时隙的占用节点只能 使用概率接入机制导致的长时间碰撞问题。
本领域内的技术人员应明白, 本申请的实施例可提供为方法、 系统、 或计算机程序产 品。 因此, 本申请可釆用完全硬件实施例、 完全软件实施例、 或结合软件和硬件方面的实 施例的形式。 而且, 本申请可釆用在一个或多个其中包含有计算机可用程序代码的计算机 可用存储介盾 (包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形 式。
本申请是参照根据本申请实施例的方法、 设备(系统)、 和计算机程序产品的流程图 和 /或方框图来描述的。 应理解可由计算机程序指令实现流程图和 /或方框图中的每一流 程和 /或方框、 以及流程图和 /或方框图中的流程和 /或方框的结合。 可提供这些计算机 程序指令到通用计算机、 专用计算机、 嵌入式处理机或其他可编程数据处理设备的处理器 以产生一个机器, 使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用 于实现在流程图一个流程或多个流程和 /或方框图一个方框或多个方框中指定的功能的 装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方 式工作的计算机可读存储器中, 使得存储在该计算机可读存储器中的指令产生包括指令装 置的制造品, 该指令装置实现在流程图一个流程或多个流程和 /或方框图一个方框或多个 方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上, 使得在计算机 或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理, 从而在计算机或其他 可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和 /或方框图一个 方框或多个方框中指定的功能的步骤。
显然, 本领域的技术人员可以对本申请进行各种改动和变型而不脱离本申请的精神和 范围。这样,倘若本申请的这些修改和变型属于本申请权利要求及其等同技术的范围之内, 则本申请也意图包含这些改动和变型在内。

Claims

权 利 要 求
1、 一种时隙状态的发送方法, 其特征在于, 该方法包括:
根据接收的各个时隙的帧信息 FI, 确定由本节点以外的多个节点在 FI中指示占用的 特定时隙, 以及占用该特定时隙的多个节点的具体占用信息;
才 居占用所述特定时隙的多个节点的具体占用信息, 确定占用该特定时隙的多个节点 的业务优先级, 判断业务优先级为最高的节点是否唯一, 如果是, 在本节点发送的 FI中设 置该特定时隙的占用信息指示该特定时隙被唯一的业务优先级最高的节点占用; 否则, 在 本节点发送的 FI中设置该特定时隙的占用信息指示特定时隙发生资源碰撞。
2、 如权利要求 1所述的方法, 其特征在于, 所述在本节点发送的 FI中设置特定时隙 的占用信息指示特定时隙被唯一的业务优先级最高的节点占用, 具体包括:
在本节点发送的 FI中设置特定时隙的时隙占用状态为碰撞状态,特定时隙的占用节点 的 STI为所述唯一的业务优先级最高的节点的 STI, 特定时隙的占用节点的业务优先级为 所述唯一的业务优先级最高的节点的业务优先级。
3、 如权利要求 1所述的方法, 其特征在于, 所述在本节点发送的 FI中设置特定时隙 的占用信息指示特定时隙被所述唯一的业务优先级最高的节点占用, 具体包括:
在本节点发送的 FI中设置特定时隙的时隙占用状态为占用状态,特定时隙的占用节点 的 STI为所述唯一的业务优先级最高的节点的 STI, 特定时隙的占用节点的业务优先级为 所述唯一的业务优先级最高的节点的业务优先级。
4、 如权利要求 1-3任一权项所述的方法, 其特征在于, 所述在本节点发送的 FI中设 置特定时隙的占用信息指示特定时隙发生资源碰撞, 具体包括:
在本节点发送的 FI中设置特定时隙的时隙占用状态为碰撞状态,特定时隙的占用节点 的 STI为预设 STI, 特定时隙的占用节点的业务优先级为所述多个节点的业务优先级中的 最高的业务优先级。
5、 一种时隙状态的确定方法, 其特征在于, 该方法包括:
接收帧信息 FI;
当确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高的节点占用或者发 生资源碰撞的特定时隙时, 居 FI中所述特定时隙的占用信息, 以及本节点的节点临时标 识 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙。
6、 如权利要求 5所述的方法, 其特征在于, 所述确定接收的 FI指示本节点所占用的 时隙为被唯一的优先级最高的节点占用的特定时隙, 具体包括:
当 FI指示本节点所占用的时隙的时隙占用状态为碰撞状态,占用节点的 STI不为预设 STI时, 或者当 FI指示本节点所占用的时隙的时隙占用状态为占用状态, 占用节点的 STI 不为预设 STI时,确定本节点所占用的时隙为被唯一的优先级最高的节点占用的特定时隙。
7、 如权利要求 6所述的方法, 其特征在于, 根据 FI中所述特定时隙的占用信息, 以 及本节点的 STI和占用特定时隙的业务优先级,确定是否继续占用该特定时隙,具体包括: 当确定本节点占用特定时隙的业务优先级与 FI 中的特定时隙的占用节点的业务优先 级相同,且 FI中的该特定时隙的占用节点的 STI与本节点的 STI相同时,确定继续占用该 特定时隙;
当确定本节点占用特定时隙的业务优先级高于 FI 中的特定时隙的占用节点的业务优 先级时, 确定继续占用该特定时隙;
否则, 本节点释放特定时隙并重新申请时隙。
8、 如权利要求 5或 6所述的方法, 其特征在于, 所述确定接收的 FI指示本节点所占 用的时隙为发生资源碰撞的特定时隙, 具体包括:
当 FI指示本节点所占用的时隙的时隙占用状态为碰撞状态, 占用节点的 STI为预设 STI时, 确定本节点所占用的时隙发生资源碰撞。
9、 如权利要求 8所述的方法, 其特征在于, 根据 FI中所述特定时隙的占用信息, 以 及本节点的 STI和占用特定时隙的业务优先级,确定是否继续占用该特定时隙,具体包括: 当确定本节点占用特定时隙的业务优先级低于 FI 中的特定时隙的占用节点的业务优 先级时, 本节点释放特定时隙并重新申请时隙;
当确定本节点占用特定时隙的业务优先级与 FI 中的特定时隙的占用节点的业务优先 级相同时, 本节点释放特定时隙并重新申请时隙;
当确定本节点占用特定时隙的业务优先级高于 FI 中的特定时隙的占用节点的业务优 先级时, 确定继续占用特定时隙。
10、 一种时隙状态的发送装置, 其特征在于, 该装置包括:
特定时隙确定单元, 用于根据接收的各个时隙的帧信息 FI, 确定由本节点以外的多个 节点在 FI中指示占用的特定时隙, 以及占用该特定时隙的多个节点的具体占用信息; 占用信息发送单元, 用于才 居所述占用该特定时隙的多个节点的具体占用信息, 确定 占用该特定时隙的多个节点的业务优先级, 判断业务优先级为最高的节点是否唯一, 如果 是,在本节点发送的 FI中设置该特定时隙的占用信息指示该特定时隙被唯一的业务优先级 最高的节点占用; 否则,在本节点发送的 FI中设置该特定时隙的占用信息指示特定时隙发 生资源碰撞。
11、 如权利要求 10所述的装置, 其特征在于, 所述占用信息发送单元具体用于: 在本节点发送的 FI 中设置特定时隙的占用信息指示特定时隙被唯一的业务优先级最 高的节点占用时,在本节点发送的 FI中设置特定时隙的时隙占用状态为碰撞状态,特定时 隙的占用节点的 STI为所述唯一的业务优先级最高的节点的 STI, 特定时隙的占用节点的 业务优先级为所述唯一的业务优先级最高的节点的业务优先级。
12、 如权利要求 10所述的装置, 其特征在于, 所述占用信息发送单元具体用于: 在本节点发送的 FI 中设置特定时隙的占用信息指示特定时隙被所述唯一的业务优先 级最高的节点占用时,在本节点发送的 FI中设置特定时隙的时隙占用状态为占用状态,特 定时隙的占用节点的 STI为所述唯一的业务优先级最高的节点的 STI, 特定时隙的占用节 点的业务优先级为所述唯一的业务优先级最高的节点的业务优先级。
13、 如权利要求 10-12任一权项所述的装置, 其特征在于, 所述占用信息发送单元具 体用于:
在本节点发送的 FI中设置特定时隙的占用信息指示特定时隙发生资源碰撞时,在本节 点发送的 FI中设置特定时隙的时隙占用状态为碰撞状态,特定时隙的占用节点的 STI为预 设 STI, 特定时隙的占用节点的业务优先级为所述多个节点的业务优先级中的最高的业务 优先级。
14、 一种时隙状态的确定装置, 其特征在于, 该装置包括:
接收单元, 用于接收帧信息 FI;
确定单元,用于当确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高的节 点占用或者发生资源碰撞的特定时隙时,才 居 FI中所述特定时隙的占用信息, 以及本节点 的节点临时标识 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙。
15、 如权利要求 14所述的装置, 其特征在于, 所述确定单元具体用于:
确定接收的 FI指示本节点所占用的时隙为被唯一的优先级最高的节点占用的特定时 隙时, 当 FI指示本节点所占用的时隙的时隙占用状态为碰撞状态, 占用节点的 STI不为预 设 STI时, 或者当 FI指示本节点所占用的时隙的时隙占用状态为占用状态, 占用节点的 STI不为预设 STI时, 确定本节点所占用的时隙为被唯一的优先级最高的节点占用的特定 时隙。
16、 如权利要求 15所述的装置, 其特征在于, 所述确定单元具体用于:
才艮据 FI中所述特定时隙的占用信息,以及本节点的 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙时,当确定本节点占用特定时隙的业务优先级与 FI中的特定 时隙的占用节点的业务优先级相同, 且 FI中的特定时隙的占用节点的 STI与本节点的 STI 相同时, 确定继续占用特定时隙; 当确定本节点占用特定时隙的业务优先级高于 FI 中的特定时隙的占用节点的业务优 先级时, 确定继续占用特定时隙;
否则, 本节点释放特定时隙并重新申请时隙。
17、 如权利要求 14或 15所述的装置, 其特征在于, 所述确定单元具体用于: 确定接收的 FI指示本节点所占用的时隙为发生资源碰撞的特定时隙时, 当 FI指示本 节点所占用的时隙的时隙占用状态为碰撞状态, 占用节点的 STI为预设 STI时, 确定本节 点所占用的时隙发生资源碰撞。
18、 如权利要求 17所述的装置, 其特征在于, 所述确定单元具体用于:
才艮据 FI中所述特定时隙的占用信息,以及本节点的 STI和占用特定时隙的业务优先级, 确定是否继续占用该特定时隙时,当确定本节点占用特定时隙的业务优先级低于 FI中的特 定时隙的占用节点的业务优先级时, 本节点释放特定时隙并重新申请时隙;
当确定本节点占用特定时隙的业务优先级与 FI 中的特定时隙的占用节点的业务优先 级相同时, 本节点释放特定时隙并重新申请时隙;
当确定本节点占用特定时隙的业务优先级高于 FI 中的特定时隙的占用节点的业务优 先级时, 确定继续占用特定时隙。
PCT/CN2014/070678 2013-01-24 2014-01-15 一种时隙状态的发送以及确定的方法、装置 WO2014114201A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310028010.1A CN103974301B (zh) 2013-01-24 2013-01-24 一种时隙状态的发送以及确定的方法、装置
CN201310028010.1 2013-01-24

Publications (1)

Publication Number Publication Date
WO2014114201A1 true WO2014114201A1 (zh) 2014-07-31

Family

ID=51226920

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/070678 WO2014114201A1 (zh) 2013-01-24 2014-01-15 一种时隙状态的发送以及确定的方法、装置

Country Status (3)

Country Link
CN (1) CN103974301B (zh)
TW (1) TW201433127A (zh)
WO (1) WO2014114201A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106176115A (zh) * 2016-07-08 2016-12-07 上海市杨浦区中心医院 信息化医院用护理车

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109121211B (zh) * 2017-06-23 2020-08-25 维沃移动通信有限公司 一种指示方法、基站和eMBB UE

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2256993A1 (en) * 2009-05-29 2010-12-01 Istituto Superiore Mario Boella sulle Technologie dell' Informazione e delle Telecommunicazioni Method for accessing a communication channel for communication networks
CN102300160A (zh) * 2011-08-22 2011-12-28 哈尔滨工业大学 车载无线自组网的n次幂广播方法

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI375426B (en) * 2004-10-01 2012-10-21 Qualcomm Inc Multi-carrier incremental redundancy for packet-based wireless communications
EP1915007B9 (en) * 2005-07-21 2013-01-09 Kabushiki Kaisha Toyota Chuo Kenkyusho Communication terminal apparatus
US20080147916A1 (en) * 2006-12-19 2008-06-19 Via Technologies, Inc. Data synchronization method of data buffer device
US8094641B2 (en) * 2007-12-20 2012-01-10 Mediatek Inc. TD-SCDMA uplink processing
CN101657030B (zh) * 2008-12-19 2011-11-09 重庆邮电大学 基于IEEE802.16 Mesh网络的三次握手方法
JP2012019472A (ja) * 2010-07-09 2012-01-26 Toyota Central R&D Labs Inc 通信端末装置
CN102413581B (zh) * 2011-12-02 2014-08-06 电信科学技术研究院 一种初始接入节点预约信道时隙的方法及系统

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2256993A1 (en) * 2009-05-29 2010-12-01 Istituto Superiore Mario Boella sulle Technologie dell' Informazione e delle Telecommunicazioni Method for accessing a communication channel for communication networks
CN102300160A (zh) * 2011-08-22 2011-12-28 哈尔滨工业大学 车载无线自组网的n次幂广播方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
EUROPEAN TELECOMMUNICATIONS STANDARDS INSTITUTION.: "ETSI TR 102 862 VI. 1.1", INTELLIGENT TRANSPORT SYSTEMS (ITS); PERFORMANCE EVALUATION OF SELF-ORGANIZING TDMA AS MEDIUM ACCESS CONTROL METHOD APPLIED TO ITS; ACCESS LAYER PART, 31 December 2011 (2011-12-31) *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106176115A (zh) * 2016-07-08 2016-12-07 上海市杨浦区中心医院 信息化医院用护理车

Also Published As

Publication number Publication date
TW201433127A (zh) 2014-08-16
TWI562576B (zh) 2016-12-11
CN103974301A (zh) 2014-08-06
CN103974301B (zh) 2018-01-19

Similar Documents

Publication Publication Date Title
US11690049B2 (en) Method and apparatus for selecting resources in V2X communications
WO2014075556A1 (zh) 一种时隙资源的碰撞处理方法及装置
JP5837180B2 (ja) ワイヤレス通信デバイスのスロット付きアクセスおよびその制御
JP4391316B2 (ja) ワイヤレスlan用のメディア・アクセス・コントロール装置
WO2014075555A1 (zh) 一种时隙资源的调度方法及装置
RU2216107C2 (ru) Способ для назначения обратного общего канала для выделенной связи в системе мобильной связи и устройство для его осуществления
JP2009118508A (ja) 無線通信システムのデッドロックを避けるための強化ポーリング法
CN110351687B (zh) V2v资源调配方法和装置
WO2013163918A1 (zh) 一种fi消息的传输方法及装置
WO2013152649A1 (zh) 一种资源碰撞的判定方法和装置
CN113271563A (zh) 第一无线电终端、其操作方法以及操作无线电通信网络的方法
CN111225446B (zh) 一种车与车通信的资源调配方法及装置
JP2013131834A (ja) 無線通信装置および無線通信方法
WO2013170609A1 (zh) 控制数据传输的方法和装置
WO2017076196A1 (zh) 一种数据传输资源预约方法及装置
JP5932162B2 (ja) 一時的媒体ハンドオーバ
CN103248463A (zh) 一种传输帧信息的方法及设备
CN111836370B (zh) 一种基于竞争的资源预约方法及设备
WO2019154330A1 (zh) 一种反馈方法、系统、电子设备和计算机可读存储介质
CN113542150B (zh) 一种数据传输方法、装置及中心端网桥
US20120099541A1 (en) Apparatus and method for operating multi-channel based on wireless access in vehicular environments
WO2014114201A1 (zh) 一种时隙状态的发送以及确定的方法、装置
EP2256993B1 (en) Method for accessing a communication channel for communication networks
JP2003060645A (ja) 無線パケット通信伝送方法・無線パケット通信システム
CN109644502A (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: 14743899

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: 14743899

Country of ref document: EP

Kind code of ref document: A1