WO2013152649A1 - 一种资源碰撞的判定方法和装置 - Google Patents

一种资源碰撞的判定方法和装置 Download PDF

Info

Publication number
WO2013152649A1
WO2013152649A1 PCT/CN2013/072473 CN2013072473W WO2013152649A1 WO 2013152649 A1 WO2013152649 A1 WO 2013152649A1 CN 2013072473 W CN2013072473 W CN 2013072473W WO 2013152649 A1 WO2013152649 A1 WO 2013152649A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
time slot
slot
occupied
state
Prior art date
Application number
PCT/CN2013/072473
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 WO2013152649A1 publication Critical patent/WO2013152649A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W48/00Access restriction; Network selection; Access point selection
    • H04W48/08Access restriction or access information delivery, e.g. discovery data delivery
    • H04W48/10Access restriction or access information delivery, e.g. discovery data delivery using broadcasted information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA

Definitions

  • the present invention relates to network management technologies, and in particular, to a method and apparatus for determining resource collisions. Background technique
  • DSRC Dedicated Short Range Communications
  • the Mobile Slotted Aloha (MS-ALOHA) mechanism is a DSRC media access control (MAC) layer access and resource allocation mechanism based on time-sharing.
  • the resource allocation is based on the frame structure.
  • the slot is in units. Referring to FIG. 1A, each N slots form a frame, and the slot number in each frame is 0 N-1, which is repeated between frames. Only one vehicle is allowed to transmit in each slot, that is, the time division multiple access (TDMA) mode between the vehicles.
  • the vehicle not only transmits the data of the application layer in the occupied time slot, but also needs to transmit frame information (FI), which indicates the occupation status of each slot in a frame, for example, a possible FI.
  • FI frame information
  • the basic idea of the MS-AL0HA mechanism is: When any node (for example, a vehicle) joins the network, it needs to occupy one time slot by using the idle time slot resource in the listening frame. If the node does not actively give up the time slot resource occupied by the node, The data can then be transmitted using the occupied time slot, during which other nodes cannot use the time slot. On the occupied time slot, the node needs to periodically send the FI, and the information carried by the node in the FI that is occupied by the node within two hops of the node occupies the time slot, and indicates the occupancy status information of each time slot perceived by the node.
  • the information of the time slot is given to each time slot, including: time slot occupation status information, a Temporary Resource Identifier (STI) corresponding to the node occupying the time slot, or a node that can be called a node identifier and occupying a time slot.
  • STI Temporary Resource Identifier
  • the priority status (which can also be considered as the priority status corresponding to the data that the slot node sends in the time slot); wherein the slot occupancy status information can express the four occupied states of the time slot: (00) represents the time slot In the idle state, (10) indicates that the time slot has been occupied by other nodes that are one hop away from the local node (the cylinder is called a hop node) or the local node occupies, and (11) indicates that the time slot has been separated from the local node by two hops.
  • the other nodes occupy (the cylinder is called a two-hop node), (01) indicates that the time slot has been occupied by two or more other nodes, that is, the collision state; in the time slot not occupied by itself, Each node can judge the adjacent three by listening to the FI sent by the node of the adjacent one hop. In the case where each node occupies a time slot in the hop range, when it is found that the time slot resource occupied by the node collides with the resources used by other nodes, a new idle time slot is reserved.
  • the FI and its internal information content are uniformly described as follows:
  • the node sends frame information (FI ) 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, slot occupancy status, STI, and priority information given in the occupancy status information corresponding to each time slot in the FI are respectively called: time slots included in the slot information field of each slot. Occupied state subdomain, STI subdomain, priority subdomain;
  • the node In the maintenance process of the occupied time slot, the node needs to maintain a (N-1)*N-dimensional slot state buffer table for storing the neighbor nodes received on the corresponding time slot.
  • the slot information field of each slot carried in the FI message For example, referring to FIG. 2, the dimension of the slot state buffer table shown in FIG. 2 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 slot state cache table whose dimension is (N-1) *N described in the subsequent content refers to not occupying the node itself.
  • the time slot information of the FI is sent by the slot; 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 by the time slot, and the detection field called the time slot, and the non-detection domain refers to The slot information field corresponding to the slot in the FI that is not occupied by the slot is called the non-detection domain of the 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:
  • the node generates and sends an FI message in the time slot occupied by the node.
  • 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 node needs to receive the FI message sent by the surrounding node on the time slot that is not occupied by itself, and update the time slot state cache table according to the received FI message, and determine whether the time slot occupied by the node is before reaching the time slot occupied by the node itself.
  • the node fills in the fields of the line corresponding to the time slot in the time slot status cache table. value.
  • the Default value is currently processed in the idle state (00). Of course, other processing methods can also be defined.
  • any node can determine the collision of time slot resources in the following two cases:
  • One or more slots in the slot information corresponding to the N1 elements indicate that the time slot is occupied by another node different from the node STI (the corresponding slot occupancy status indication is 10), and the priority of the node itself is not occupied.
  • the highest of all the nodes of the slot (including the other node in the slot information corresponding to the local node and the N-1 elements indicating the same slot as the local node).
  • One or more slots in the slot information corresponding to the N1 elements indicate that the time slot is occupied by another node different from the node STI (the corresponding slot occupancy status indication is 10), and the priority of the node is occupied. All the nodes of the slot (including the highest priority but not the only highest priority node among all the nodes in the slot information corresponding to the local node and the N-1 elements indicating the same slot as the local node) (because only 4 Priority levels, so multiple nodes with the same priority level may appear). Then the node may choose to send the FI on the slot +N currently occupied by itself. In the subsequent process, if this happens again, the node may send the probability p again in slot p+2*N, with probability (1-P). It is considered that a slot resource collision occurs.
  • slot state buffer table For N-1 elements in the slot state buffer table corresponding to the slot occupied by any non-node itself, two or more slot information appear indicating that the slot is two or more nodes (ie: STI Differently occupied (corresponding to the slot occupancy status indication is 10), it is determined that the slot resource collides.
  • the node when a node determines that a resource collision occurs in a time slot occupied by itself, the node re-initiates the access process to regain the time slot resource.
  • the slot state information of the collision slot will be filled in (01) in the FI sent by itself, and the corresponding STI fills in the highest priority among the nodes that collide.
  • the STI corresponding to the node the priority information fills in the priority of the node with the highest priority.
  • the nodes with the same collision have the same priority, randomly select an STI to fill in, and the priority information fills in the highest priority.
  • any node fills in each sub-domain in the slot information domain corresponding to each slot in the FI message (including the slot occupancy state sub-domain, the STI sub-domain, and the priority).
  • the rules of the sub-domain are as follows: (1) For the slot occupied by the node itself, the slot occupancy status sub-domain fills the occupied state (10), and the STI sub-domain and the priority sub-domain respectively fill in their own STI and priority information;
  • the slot occupancy status subfield of the slot is filled in as Idle state (00), and does not fill in the STI subdomain and priority subdomain;
  • the slot occupancy status in the detection domain of the slot is indicated as the occupied state (10), and the slot occupancy status of the other N-2 elements is indicated as the idle state (00), the default state, and the two-hop node occupancy state (11)
  • the slot occupancy status in the detection domain of the slot is indicated as an occupied state (10)
  • the slot occupancy status of the other N-2 elements is indicated.
  • the slot occupancy status subfield of the slot is filled in the occupied state (10)
  • the STI subdomain is filled according to the corresponding STI and priority information. And priority subdomains.
  • the slot occupancy status subfield of the slot is filled in the collision state (01), and the STI subdomain is filled in the STI of the node with the highest priority, when there are multiple highest priorities.
  • the STI of the highest priority node is randomly selected to fill in the STI subdomain, and the priority subdomain is filled in with the priority corresponding to the highest priority node.
  • the slot occupancy status of the detection domain corresponding to the slot is indicated as the default state, and the other N-1 elements, the slot occupancy status of one or more elements is indicated as the occupied state (10), and their corresponding STIs are If the same, the slot occupancy status subfield of the slot is filled in the two-hop occupation state (11), and the corresponding STI and priority information are filled in the STI sub-domain and the priority sub-domain.
  • the method for judging the slot resource collision by using the MS-AL0HA mechanism may cause the following problems: First, the judgment rule of the slot resource may cause an unnecessary resource collision indication.
  • the condition that the time slot occupation status information is filled in the collision state (01) is: Among the N-1 elements, two or more occupied states (10) appear, and the STI is different.
  • two nodes that are instructed to occupy the same time slot and have different STIs may be four-hop nodes, and when the two nodes are four-hop nodes, the resource multiplexing specified by the MS-AL0HA mechanism is satisfied.
  • the requirement of the distance that is, greater than three hops), therefore, the existing slot resource collision judgment condition of the MS-AL0HA mechanism will reduce the resource multiplexing efficiency. For example, as shown in FIG.
  • the node B notifies the node A through the FI
  • the hop node C occupies the slot n
  • the node D notifies the node A through the FI
  • the hop node E occupies the slot n
  • the node A learns the two hop node.
  • C and the two-hop node E occupy the time slot n at the same time, then the node A considers that the resources on the time slot n collide, but the node C and the node E are four-hop nodes, and the resources of the time slot n can be utilized. Node A determines that resources collide, which reduces resource utilization efficiency.
  • the time slot in the slot information field corresponding to the time slot in the FI is not considered to be occupied by the FI received by the node.
  • the processing mode when the state is ( 01 ), that is, when a certain time slot in the FI received by the node indicating that the non-node is occupied has been occupied by two or more other nodes, the node cannot determine the state of the time slot according to the existing rules. And make relevant processing. Summary of the invention
  • Embodiments of the present invention provide a method for determining a resource collision, which is used to improve resource multiplexing efficiency.
  • a method for determining a time-frequency resource collision includes:
  • the first node receives frame information FI sent by other nodes; Determining, by the first node, a slot that is not occupied by the local node, according to the received FI, determining that the time slot is at least one of the first set hop count node and the second set hop count range is not the first set When other nodes of the hop count node are simultaneously occupied, it is determined that a resource collision occurs in the time slot.
  • a device for determining a collision of resources comprising:
  • a communication unit configured to receive frame information FI sent by other nodes
  • a processing unit configured to determine, for a time slot occupied by the device, that the time slot is at least one of the first set hop count node and the second set hop count range is not the first set according to the received FI When other nodes of the hop count node are simultaneously occupied, it is determined that a resource collision occurs in the time slot.
  • the first node analyzes whether the time slot occupied by one hop node of the node is the same as the time slot occupied by another node according to the FI sent by other nodes.
  • FIG. 1A is a schematic diagram of a superframe structure in the prior art
  • FIG. 1B is a schematic view showing a FI structure in the prior art
  • FIG. 2 is a schematic diagram of a time slot state cache table in the prior art
  • FIG. 3 is a schematic diagram of logical relationships between nodes in the prior art
  • 4A is a flowchart of determining a resource collision by a node according to an embodiment of the present invention
  • 4B is a schematic diagram of a slot state vector according to an embodiment of the present invention.
  • FIG. 5 is a schematic structural diagram of a function of a first node according to an embodiment of the present invention. detailed description
  • the first node determines whether the time slot occupied by the node collides, and the manner of processing when the received other node sends a collision indicating that the time slot of the node is occupied, and the specific implementation manner is as follows. :
  • the first node When the first node receives the time slot occupied by the other node, when the node receives the FI message sent by the other node, the first node indicates that the time slot of the time slot in the time slot information field corresponding to the time slot occupied by the first node indicates that the node is occupied by the node. Gap When the collision occurs, it is determined that the time slot occupied by the node has collided, or when the node receives the FI message sent by the other node, the first node indicates the time slot of the time slot corresponding to the time slot occupied by the first node. When other nodes are occupied, it is determined that the time slot occupied by the node collides; at this time, the node application releases the time slot resource occupied by itself, and re-initiates the access process to regain the time slot resource.
  • the embodiment of the present invention provides a new method for determining resource collision, which is mainly applied to the application scenario that the first node is for a time slot occupied by the non-node.
  • the specific process is as follows:
  • Step 400 The first node receives an FI message sent by another node.
  • the first node uses the duration between two adjacent time slots occupied by itself as one frame period, and each of the time slots included in the one frame period except the time slot occupied by the local node The FI message sent by other nodes is received in the time slot.
  • the FI received by the first node may be the FI received from the set time point to the current time, or the FI received in the frame time from the current time, wherein the setting is
  • the time point may be a time slot occupied by the first node, and may be a FI receiving reference time slot determined by the first node, or may be a time slot in which the first node starts to monitor the channel.
  • the process of processing a time slot resource by a node may be divided into a channel access process and a channel maintenance process.
  • the channel access procedure is used to perform time slot resource application; the channel maintenance process is used to maintain self-occupied time slots.
  • the channel access process is divided into the following five steps:
  • Step 1 Listen for one frame (also known as the listening phase).
  • the node listens to all slots in a frame and stores the received FI message in the corresponding location in the N*N slot state buffer table. After the end of one frame, the nodes in the self-organizing network obtain the time slot state information maintained in the form of the N*N matrix as shown in FIG. 2, and perform step two.
  • Step 2 Select an available slot.
  • the time slot state cache table if there is an idle slot, select the slot; if there are more than one free slot, randomly select one; if there is no free slot, then the slot with lower current priority is used as the idle slot. Make a choice.
  • Step 3 Wait for the selected slot to arrive and confirm again that it is free.
  • step two select the empty slot p. Then, before the slot p arrives, continuously monitor each slot, and cover the FI information received in the corresponding old slot in FIG. 2 with the FI information received in the new slot. Wait until the end of slot p-1, check whether slot p still meets the conditions in step 2 (including the priority consideration when there is no idle slot):
  • step four If yes, go to step four (ie send FI).
  • Step 4 Send the generated FI message in slot p. After the sending is complete, go to step 5.
  • Step 5 Monitor the feedback and confirm whether the time slot is successfully occupied.
  • the channel maintenance consists of two parts: one is to send FI information on the time slot occupied by itself; the other is to receive FI information on the time slot not occupied by itself, and update the maintenance according to the received FI information.
  • the time slot status table determines whether the time slot occupied by the time slot is occupied. When a collision occurs, the channel access process is restarted to reserve a new time slot resource.
  • Transmit time slot Generate FI information according to the current slot status table and send it.
  • Receiving time slot update the time slot information unit corresponding to each time slot in the slot state table maintained by the slot information field corresponding to each time slot in the received FI information.
  • the channel maintenance process ends, the channel access process is re-entered, the idle time slot is monitored, and a new time slot resource is reserved.
  • the time slot of the first node starting to listen to the channel mentioned in the above step 400 may start from the time slot in which the channel access procedure is performed, or may start from the channel maintenance process.
  • Step 410 The first node determines, according to the received FI message, that the time slot is at least one of the first set hop count node and the second set hop count range other than the first set according to the received FI message. When other nodes of the hop count node are simultaneously occupied, it is determined that a resource collision occurs in the above time slot.
  • the first node may perform the foregoing determining operation when determining that the node needs to send the FI, may perform the foregoing determining operation every time the FI is received, or perform the foregoing determining operation at the end of the listening phase in the access process, It is also possible to perform the above-described determination operation at other set time points.
  • the first set hop count node is a hop node, that is, a node that is one hop away from the first node, and then, when step 410 is performed, the first node occupies the first time when the node is not occupied by the node. And determining, according to the received FI, that the first time slot is occupied by one hop node and at least one other node other than the one hop node, determining that a resource collision occurs in the first time slot.
  • the node A determines that the time slot n is simultaneously occupied by the one-hop node B and the two-hop node E according to the received FI, and then determines that the resource of the time slot n collides, and judges the slot occupancy state as the collision state.
  • the node A determines that the time slot n is occupied by the one-hop node B according to the received FI, and the other node except the one-hop node B indicates that the time slot n is the "collision state", and then determines the resource occurrence of the time slot n. Collision, and judge its slot occupancy status as a collision state.
  • the first node according to the received FI sent by other nodes, knows that other nodes indicate that a certain time slot is a "collision state", and only if one of the own hop nodes also occupies the time slot, The time slot occupied state of the time slot is determined as a collision state. Otherwise, the time slot resources are not considered to collide. In this way, the situation that the nodes that are four hops cannot be multiplexed with the time slot resources can be effectively avoided, and the resource multiplexing efficiency is effectively improved.
  • the first set hop count node is a one hop node
  • the second set hop count range is a two hop range.
  • the technical personnel may refer to the following embodiments. Related technical solutions Used in other suitable application scenarios.
  • the first set hop count may also be two hops, three hops, etc.
  • the second set hop count range may also be a three-hop range, a four-hop range, and the like, and details are not described herein again.
  • step 410 In the actual application, after the first node receives the FI message sent by other nodes in the frame period, there are two FI information storage modes. In different FI information storage modes, the execution mode of step 410 is slightly different. The following describes the execution modes of step 410 in the two FI information saving modes.
  • the first FI information is saved in the following manner: FI
  • FI is saved in the cumulative mode. That is, in one frame period, the node receives the FI sent by other nodes in the time slot occupied by other nodes, and sends the FI message in the time slot occupied by the node. Previously, the FIs sent by other nodes received are processed in a unified manner to obtain the FIs that the node needs to send.
  • the node can save the slot state cache table based on the MS-ALOHA mechanism as shown in Figure 2.
  • One row stores the slot information in the FI received by the corresponding node in a certain time slot.
  • each column in the table stores the slot information of the corresponding node received in the FI in a certain time slot.
  • use other data structures such as data and linked lists to store time slot information in the FI received by the node in a certain time slot.
  • the slot information cache table is used to store the FI received by the node, and each row in the table stores the slot information in the FI received by the corresponding node in a certain slot as an example.
  • step 410 The slot state buffer table of (N-1)*N obtained by the FI sent by other nodes previously received by the first node before transmitting the FI in the slot occupied by the node (the FI sent by the slot occupied by the node is not saved) ), can determine the current occupancy status of each time slot.
  • the specific execution manner of step 410 is as follows:
  • the first node indicates that any one of the time slots occupied by the local node indicates that the detection domain information corresponding to the any one time slot indicates that the arbitrary one time slot has been occupied by the one-hop node, and the at least one non-detection domain information corresponding to the any one time slot indicates
  • the any one time slot is occupied by another node other than the one-hop node, it is determined that the any one time slot is in a collision state; and/or, the first node corresponds to any time slot occupied by the non-local node, and the corresponding one time slot is confirmed.
  • the detection domain information indicates that any one time slot has been occupied by a hop node, and the at least one non-detection domain information corresponding to the any one time slot indicates that the arbitrary one time slot is in a collision state, and the arbitrary one time slot is determined to be a collision state.
  • the first node detects a column corresponding to the slot n in the (N-1)*N-dimensional slot state buffer table (ie, slot information sent by other nodes for slot n, denoted as N-1 elements): That is, detecting the slot information of the slot n indicated by the different node, if it is determined that the detection domain information corresponding to the slot n indicates that the slot n is occupied by one hop node, and at least one non-detection domain information indicates that the slot n is another hopping Node occupies (this hop node is different from the hop node indicated by the detection domain.
  • the hop node in the detection domain occupies a hop distance from the first node, and the hop node in the non-detection domain is the corresponding FI message sent.
  • the node hops the distance of the node, so the one hop node indicated in the non-detection domain is a two-hop node for the first node, and the slot n is determined to be the collision state.
  • the first node detects (N-1) *N-dimensional slot state cache table corresponding to the slot n (ie, the slot information sent by other nodes for slot n, denoted as N-1 elements) ), that is, when detecting the time slot n indicated by different nodes
  • the slot information determines that the slot n is determined to be a collision state if it is determined that the detection domain information corresponding to the slot n indicates that the slot n is occupied by a hop node and the at least one non-detection domain information indicates that the slot n is in a collision state.
  • the first node detects (N-1) * the column corresponding to the slot n in the N-dimensional slot state buffer table (N-1 elements), if the detection domain information corresponding to the slot n indicates that the slot n is a hop node Occupied, and at least one non-detection domain information indicates that the time slot n is a collision state, and the time slot n is determined as a collision state;
  • the first node will determine the time slot state of the time slot n.
  • the N-1 elements in the column corresponding to the slot n ie, the detection domain and the non-detection domain
  • the element content indicating that the slot n is in the non-collision state ie, the non-detection indicating the slot n as the collision state is not considered. The impact of domain content).
  • the second FI information is saved in the following manner: ⁇
  • the FI information is stored in an iterative manner, that is, the node only stores a vector about the current occupation status of each time slot, which is called a time slot status vector (also referred to as a time slot status table).
  • a slot state vector (table)
  • a possible slot state vector (table) is shown in FIG. 4B.
  • the node receives the FI sent by other nodes, it according to the slot information corresponding to each slot in the newly received FI.
  • the field updates the slot information element corresponding to each slot in the locally saved slot state vector (table).
  • the node needs to send the FI of its own decision, it will generate the FI to be transmitted according to the information in the saved slot state vector (table).
  • time slot state vector (table) and its internal information content are uniformly used in the present invention as follows:
  • the format of the current occupation status information of each time slot recorded by the node is called: a time slot status vector, or a time slot status table; the occupation status information corresponding to each time slot indicated in the time slot status vector (table) is called: a slot information element corresponding to each slot in the slot state vector (table);
  • the three types of information ie, slot occupancy status, STI, and priority information given in the occupancy status information corresponding to each time slot in the time slot status vector (table) are respectively called: time slot information of each time slot.
  • the slot occupied by the unit occupies the status sub-unit (here, the content in the slot occupancy status sub-unit does not need to be exactly the same as the sub-area occupancy status sub-domain in the FI, but a mapping relationship is required, such as:
  • the state table may set two states of "self-occupation" and "one-hop node occupation" to indicate the occupation status of the time slot, and the node maps the information content in the saved time slot status table to the FI message to be sent.
  • the slot occupancy status subfields in the slot information field corresponding to the slots of the two states in the FI may all be mapped to "10", and the positions of the slot information fields after other nodes receive the FI (whether the detection domain or the non-detection).
  • the field is used to determine whether the "10" in the slot occupancy status subfield of the corresponding slot information field refers to whether the transmitting node is occupied by the transmitting node or the one-hop node of the transmitting node, the STI subunit, and the priority subunit.
  • the node may receive the time slot information unit of each time slot indicated in the currently saved slot state vector (table).
  • the saved slot state vector indicates the slot information unit corresponding to the any one slot
  • the time slot information field corresponding to the any one time slot in the receiving FI indicates that the arbitrary one time slot is occupied by another two-hop node other than the one-hop node, and any one of the time slots is determined.
  • the slot information unit corresponding to the any one slot indicates that the any one slot has been It is occupied by a hop node, and the slot information field corresponding to the any one slot in the receiving FI indicates that the any one slot is in a collision state, and it is determined that any one of the slots is a collision. Hit the state.
  • the determination rule of whether any one time slot is a collision state may adopt one or any combination of the following rules, and is not limited to the following rules:
  • the first node determines that the time slot n has been occupied by a hop node for the time slot n occupied by the non-own node in the frame period, and the slot state vector (table) in the slot m-1 is determined.
  • the first node determines, according to the corresponding slot information field in the newly received FI in the slot m, that the slot n is indicated as being occupied by another two-hop node other than the one-hop node, and the first node is saved.
  • the slot occupancy status sub-cell content corresponding to slot n is updated to the collision state, and the update rules of the corresponding STI sub-unit and priority sub-unit are described later.
  • the slot occupancy state of the slot n is recorded as being occupied by a hop node B in the slot state vector (table) saved by the node A.
  • the node A receives the FI sent by the node C.
  • the FI indicates that the slot n is occupied by the two-hop node E of the node A (the STIs of the node E and the node B are different), and the node A updates the slot occupancy status of the slot n in the saved slot state vector (table) to the collision.
  • the first node determines, for the slot n occupied by the non-own node in the frame period, that the slot n has been occupied by the two-hop node in the saved slot state vector (table) in the slot n-1, and The first node determines that the time slot n is indicated as being occupied by another hop node other than the two hop nodes according to the corresponding slot information field in the newly received FI in the slot n, then the first node will In the saved slot state vector (table), the slot occupancy status sub-cell content corresponding to slot n is updated to the collision state, and the update rules of the corresponding STI sub-unit and priority sub-unit are described later.
  • the first node determines that the slot n has been occupied by a hop node for the slot n that is not occupied by the node in the frame period, and the slot state vector (table) that is saved in the slot m-1.
  • the first node determines, according to the corresponding slot information field in the newly received FI in the slot m, that the slot n is indicated as a collision state, and the slot in the slot state vector (table) that the first node will save
  • the content of the corresponding slot sub-unit sub-unit is updated to the collision state, and the update rules of the corresponding STI sub-unit and priority sub-unit are described later.
  • the first node determines, for the slot n occupied by the non-own node in the frame period, the slot state vector (table) saved in the slot m-1 to determine the slot occupancy state of the slot n is a collision state, then Regardless of the slot information field in the newly received FI in the slot m, indicating which slot state the slot n is, (eg, being occupied by the first node, being hopped).
  • the node is occupied by the two-hop node, the idle state, and the collision state.
  • the first node maintains the slot occupancy state of the slot n as a collision state in the saved slot state vector (table).
  • the slot occupancy status of the slot n is recorded as "one-hop node occupancy" according to the saved slot state vector (table)
  • the slot n is indicated.
  • the slot occupancy state is the collision state
  • the slot occupancy status of the slot n is updated to the collision state.
  • the slot occupancy status of the slot n is recorded as non-"one-hop node occupancy" according to the saved slot status vector (table)
  • the slot is indicated in the FI sent by the other node.
  • the slot occupancy state is the collision state
  • the original slot occupancy state of the slot n is maintained unchanged.
  • the resource sent by the node indicates that the resource collision occurs in any one time slot
  • the node priority may be combined.
  • the information and the node identification information determine an indication manner indicating that the any one time slot is a collision state in the FI. For example, when the first node determines that any time slot occupied by the local node is in a collision state, if the time slot resources of the high priority node and the low priority node collide on the any one time slot, the first node is in the FI.
  • the slot information corresponding to the any one slot that is sent in the slot indicates the STI corresponding to the high priority node and the priority information corresponding to the high priority node.
  • the arbitrary time slot in the slot state vector (table) saved by the node indicates that the any one slot is a collision state.
  • the node priority information and the node identifier information may be combined to determine that the slot state vector (table) indicates the random state.
  • a time slot is an indication of the collision state.
  • the first node determines that any time slot occupied by the local node is in a collision state, if the time slot resources of the high priority node and the low priority node collide on the any one time slot, the first node saves In the slot information vector (table), the slot information unit corresponding to the arbitrary one slot indicates the STI corresponding to the high priority node and the priority information corresponding to the high priority node.
  • the first node determines that a resource collision occurs in any one slot occupied by the local node
  • the first node maintains the slot state vector (table)
  • the saved slot state In the table, the slot occupancy state subunit in the slot information unit corresponding to the slot in which the collision state is determined is set to the collision state. If the first node does not maintain the slot state table, the result is generated after the judgment is used.
  • the time slot occupied by the time slot in the time slot information field corresponding to the time slot determined as the collision state in the FI is set to the collision state;
  • the node priority information and the node identifier information are updated in the saved slot state table. a node identifier subunit and a priority subunit in the slot information unit corresponding to the slot in which the collision state is determined; for example,
  • the first node determines the time slot determined to be the collision state, the resources of the high priority node and the low priority node occur.
  • the first node sets the node identifier (ie, STI) sub-unit as the node identifier corresponding to the high-priority node in the slot information unit corresponding to the slot in which the collision occurs in the slot state vector (table), and
  • the priority subunit is set to the priority information corresponding to the high priority node.
  • the node priority information and the node identifier information are used to determine the time slot corresponding to the collision state determined in the FI.
  • the node in the slot information field identifies the subdomain and the priority subdomain; for example,
  • the first node determines that the resources of the high priority node and the low priority node collide on the time slot determined to be in the collision state, the first node sends the time slot information field corresponding to the time slot in which the collision occurs in the FI,
  • the node identifier sub-domain is set as the node identifier corresponding to the high-priority node, and the priority sub-domain is set as the priority information corresponding to the high-priority node.
  • the first application scenario is as follows: The collision determination method for maintaining slot information by using the N*N-dimensional slot state cache table (ie, using the first FI save mode), wherein it is assumed that one frame contains 6 slots. Node A occupies slot 3, and at the end of slot 2, the N*N-dimensional slot state cache table saved by node A is as shown in Table 1 (priority-related information is not considered in this embodiment):
  • Node A determines the status of each slot based on the saved slot status buffer table before transmitting its own FI. details as follows: Time slot 1: collision status.
  • the nodes of the time slot are different.
  • Time slot 3 Occupied by node A.
  • the non-detection field corresponding to time slot 3 does not indicate that time slot 3 is still occupied by other nodes, that is, the time slots occupied by the node itself do not collide.
  • Time slot 4 Collision status.
  • the detection field corresponding to time slot 4 indicates that the time slot 4 node F is occupied (that is, the detection field indication is 10), but a non-detection field corresponding to time slot 4 indicates that time slot 4 is a collision state ( 01 ).
  • Time slot 5 Collision status.
  • the detection domain corresponding to slot 5 and the at least one non-detection domain both indicate that slot 5 is occupied, but the nodes indicating occupied slot 5 are different.
  • the first node when determining the slot state of the time slot, the first node according to the slot N corresponding to the slot n
  • the content of the element indicating the time slot as a non-collision state within one element ie, the detection domain and the non-detection domain
  • the state of the time slot 6 is determined to be occupied by the node H.
  • the node A can determine the status information of each current time slot according to Table 1, as shown in Table 2:
  • the node generates the FI to be sent according to the status information of each time slot as shown in Table 2.
  • the node A adds the corresponding STI and priority information of each time slot in the FI.
  • the FI to be sent may be generated from Table 1 and then generated, or the FI to be sent may be directly generated by Table 1 according to the judgment method of the present invention.
  • the time slot occupancy state corresponding to each time slot of the slot state vector (table) maintained by the node is defined as follows (the priority related information is not considered in this embodiment). ):
  • Node A updates its own saved slot state vector (table) according to the slot information carried in the FI sent by Node B, as follows:
  • Time slot 1 state Collision state.
  • Time slot 2 Collision status.
  • Node A confirms that slot 2 is occupied by one hop node C according to the slot information in the slot status vector (table). Then, node A determines that slot 2 is simultaneously hopped by two hops based on FI sent by one hop node B. Occupied.
  • Time slot 3 Collision status.
  • Node A confirms that slot 3 is occupied by one hop node D according to the slot information in the slot status vector (table). Then, node A has determined that a resource collision has occurred according to the FI decision slot 3 sent by one hop node B.
  • Time slot 4 Collision status.
  • Node A confirms that slot 4 is occupied by two hop nodes F according to the slot information in the slot status vector (table). Then, node A receives the FI sent by one hop node B on slot 4, indicating the slot. 4 is occupied by a hop node B.
  • Time slot 5 Own by node A itself. Cause: Node A has considered that slot 5 is occupied by itself according to the slot information in the slot status vector (table). The FI sent by Node B does not indicate that the slot is occupied by other nodes.
  • the slot status vector (table) updated by the node A according to the FI sent by the Node B received in the slot 4 is as shown in Table 5:
  • node A Upon arrival of time slot 5, node A generates the transmitted FI based on the time slot information (Table 5) in the saved slot state vector (table).
  • the slot state vector (table). Different states of the slot occupancy are distinguished. It can be seen from the above that 00 indicates two different slot states, one is idle state, and the other is occupied by three-hop nodes, although the FI sent to the node is generated according to the internal state. Whether the idle time slot or the time slot occupied by the three-hop node will be indicated as 00, but the two different states have an influence on the resource selection when the resource collision occurs in the node itself, for example, the time slot resource occupied by the three-hop node. Can't be selected.
  • the node when the node maintains its own slot occupancy state vector (table), it can distinguish between the idle state and the occupied state of the three-hop node, and may add other according to the requirements of the specific algorithm.
  • the time slot occupancy state distinguishes parameters.
  • each node occupies only one of the N time slots in one frame.
  • the node receives the most FI sent by N-1 other nodes.
  • the node can receive at most The FIs sent by the N-2 other nodes.
  • the first node includes a communication unit 50 and a processing unit 51, where
  • a communication unit 50 configured to receive FI sent by other nodes
  • the processing unit 51 is configured to determine, for the time slot occupied by the device, that the time slot is at least one of the first set hop count node and the second set hop count range is not the first one according to the received FI When other nodes of the hop count node are simultaneously occupied, it is determined that a resource collision occurs in the time slot.
  • the first set hop count node used by the processing unit 51 is a hop node
  • the second set hop count range is a two hop range.
  • the FI received by the communication unit 50 is the FI received from the set time point to the current time, or the FI received from the current time to the previous frame time.
  • the set time point used by the communication unit 50 is a self-occupied master time slot determined by the device; or, the FI receives the reference time slot determined by the device; or, the time slot of the device starting to monitor the channel .
  • the method includes:
  • the processing unit 51 performs the determining operation when the device determines that the FI needs to be sent.
  • the processing unit 51 performs a judgment operation each time a FI is newly received.
  • the processing unit 51 performs the determining operation at the end of the listening phase in the access process.
  • the processing unit 51 performs the determining operation at other set time points.
  • the processing unit 51 determines, according to the received FI, the time slot that the time slot is at least one of the first set hop count node and the second set hop count range for the time slot not occupied by the local device.
  • determining that a resource collision occurs in the time slot includes: The processing unit 51 confirms that the time slot is respectively indicated by the first set hop node and at least one of the second set hop count range according to the received FI for the time slot occupied by the device.
  • determining that a resource collision occurs in the time slot includes: The processing unit 51 confirms that the time slot is respectively indicated by the first set hop node and at least one of the second set hop count range according to the received FI for the time slot occupied by the device.
  • the processing unit 51 determines, according to the received FI, that the time slot is respectively indicated by the first set hop node and the collision state according to the received FI, determining the time slot occurrence resource. collision.
  • the processing unit 51 confirms that the time slot is respectively indicated by the first set hop node and by the second set hop count range according to the received FI for the time slot occupied by the device.
  • determining that a resource collision occurs in the time slot includes:
  • the processing unit 51 determines, according to the FI received in the time slot that is not occupied by the device, that the detection domain information corresponding to the time slot indicates that the time slot is occupied by the first set hop node, and the time slot is occupied.
  • the corresponding at least one non-detection domain information indicates that the time slot is occupied by another node that is not the first set hop count node within the second set hop count range, and determines that the time slot resource collision occurs.
  • the processing unit 51 determines, according to the received FI, the time slot that is not occupied by the local device, when the time slot is indicated to be occupied by the first set hop node and the collision state respectively.
  • Resource collisions occur in the gap, including:
  • the processing unit 51 determines, according to the FI received in the time slot occupied by the device, that the detection domain information corresponding to the time slot indicates that the time slot is occupied by the first set hop node, and the time slot When the corresponding at least one non-detection domain information indicates that the time slot is in a collision state, it is determined that a resource collision occurs in the time slot.
  • the processing unit 51 determines that the detection domain information corresponding to the time slot indicates that the time slot is not occupied by the first set hop count point, and the at least one non-detection domain information corresponding to the time slot indicates the When the time slot is in the collision state, the current time slot state of the time slot is determined according to the non-detection domain information that does not indicate that the time slot is a collision state.
  • the processing unit 51 confirms that the time slot is respectively indicated by the first set hop node and by the second set hop count range according to the received FI for the time slot occupied by the device.
  • determining that a resource collision occurs in the time slot includes:
  • the processing unit 51 determines, according to the FI received in the current time slot, the locally saved slot state table, that the locally saved slot state table indicates that the slot is occupied by a hop node, and the newly received FI is in the FI.
  • the time slot information field corresponding to the time slot indicates that the time slot is occupied by another two hop node, determining that the time slot has a resource collision; or determining that the saved time slot occupation status table indicates that the time slot is two
  • the time slot information field corresponding to the time slot in the newly received FI indicates that the time slot is occupied by another hop node, and the resource collision occurs in the time slot.
  • the processing unit 51 determines, according to the received FI, the time slot that is not occupied by the local device, when the time slot is indicated to be occupied by the first set hop node and the collision state respectively. Resource collisions occur in the gap, including: The processing unit 51 determines, according to the FI received in the current time slot, the locally saved slot state table, that the locally saved slot state table indicates that the slot is occupied by a hop node, and the newly received FI is in the FI.
  • the processing unit determines that the saved time slot status table indicates that the time slot is a collision state, and When the time slot information of the time slot in the newly received FI indicates that the time slot is occupied by a hop node, it is determined that a resource collision occurs in the time slot.
  • the processing unit 51 determines that the saved slot state table indicates that the slot is not occupied by a hop node, and the slot information field corresponding to the slot in the newly received FI indicates that the slot is In the collision state, the original slot state of the slot is maintained unchanged.
  • the processing unit 51 determines that the time slot has a resource collision, the following operations are performed: If the processing unit maintains the slot status table, the time slot determined to be the collision status is corresponding to the saved slot status table.
  • the time slot occupation state subunit in the time slot information unit is set to a collision state;
  • the processing unit does not maintain the slot status table, when the FI sent by the unit is determined by the result of the determination, the sub-area of the slot occupancy status corresponding to the slot in the FI determined to be the collision status is set to Collision state.
  • the processing unit 51 determines that a resource collision occurs in a time slot not occupied by the device, the processing unit 51 performs the following operations:
  • the node identifier subunit in the slot information unit corresponding to the slot determined to be the collision status is updated in the saved slot status table in combination with the node priority information and the node identification information.
  • the processing unit does not maintain the slot status table, when the FI generated by the determined result generating unit is used, the time slot corresponding to the time slot determined to be in the collision state in the FI is determined by combining the node priority information and the node identification information.
  • the node in the information domain identifies the subdomain and the priority subdomain.
  • the processing unit 51 determines, in the FI sent by the device, the node identifier sub-domain and the priority sub-domain in the slot information domain corresponding to the slot determined to collide in the FI, in combination with the node priority information and the node identifier information.
  • the method includes: if the processing unit determines that the resources of the high priority node and the low priority node collide in the time slot, the node is in a time slot information field corresponding to the time slot in which the collision is sent in the FI, The node identifier sub-domain is set as the node identifier corresponding to the high-priority node, and the priority sub-domain is set as the priority information corresponding to the high-priority node.
  • a method for determining a resource collision is proposed.
  • the first node analyzes the time slot occupied by the one-hop node of the node and the other node according to the FI sent by the other node. Whether the time slots are the same, determining whether the time slot (the non-owner occupies the time slot) is determined as the collision state, and determining whether the hop unit of the node occupies the collision time slot indicated by the other node,
  • the time slot (the non-local node occupying the time slot is determined to be a collision state), so that the node can be effectively prevented from misinterpreting the reusable time slot resource as a collision time slot, thereby avoiding unnecessary expansion due to the extended propagation of the collision indication information.
  • the waste of time slot resources improves the efficiency of resource reuse.
  • the first node receives the FI indication sent by other nodes, and is not in this section.
  • the processing method when the resource is collided in the time slot is occupied, and the processing method of the FI under the MS-ALOHA mechanism is improved.
  • the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware.
  • the present invention is in the form of a computer program product embodied on one or more computer-usable storage media (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 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)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

本申请公开了一种资源碰撞的判定方法及装置,用以提高资源复用效率。该方法为:第一节点根据接收到的其他节点发送的FI,通过分析本节点的一跳节点占用的时隙和另一节点占用的时隙是否相同,确定是否将此时隙(非本节点占用时隙)判定为碰撞状态,以及通过分析本节点的一跳节点占用的时隙是否被其他节点指示为碰撞状态,确定是否将此时隙(非本节点占用时隙)判定为碰撞状态,这样,可以有效避免节点将可复用的时隙资源误判为碰撞时隙,从而避免了因碰撞指示信息的扩展传播导致不必要的时隙资源浪费,提高了资源复用效率。

Description

一种资源碰撞的判定方法和装置 本申请要求在 2012年 04月 12 日提交中国专利局、 申请号为 201210107002.1、 发明 名称为 "一种资源碰撞的判定方法和装置 "的中国专利申请的优先权, 其全部内容通过引用 结合在本申请中。 技术领域
本发明涉及网络管理技术, 特别涉及一种资源碰撞的判定方法和装置。 背景技术
随着车载通信系统的发展和移动自组网技术的逐渐成熟, 为了实现对车辆的实时、 动 态、 智能化管理, 国际上专门开发了针对车联网的专用短程通信(Dedicated Short Range Communications, DSRC )协议。 DSRC通过信息的双向传输, 将车辆与车辆、 车辆和路侧 的信息釆集设备有机的连接起来, 支持点对点、 点对多点通信。
移动分时隙 ALOHA ( Mobile Slotted Aloha, MS-ALOHA )机制是一种基于分时方式 的 DSRC媒体接入控制 (Medium Access Control, MAC )层接入和资源分配机制, 资源分 配基于帧结构以时隙 (slot ) 为单位。 参阅图 1A所示, 每 N个 slot构成一个帧 (Frame ), 每个帧中的 slot的编号为 0 N-1 , 在帧之间循环往复。 每个 slot中只允许一个车辆进行发 送, 即车辆之间为时分复用接入(Time Division Multiple Access, TDMA )模式。 车辆在所 占用的时隙上中不仅发送应用层的数据, 而且还需要发送桢信息 ( Frame Information, FI ), 在 FI中会指示一个帧中各个 slot的占用状态,例如, 一种可能的 FI结构如图 1B所示。
MS-AL0HA机制的基本思想是: 任意一节点 (如, 车辆)加入网络时, 需要通过监 听帧中的空闲时隙资源占用一个时隙, 如果节点不主动放弃该节点所占用的时隙资源, 则 可一直使用占用的时隙传输数据, 在这期间其他节点不能使用该时隙。 在占用的时隙上, 节点需要周期性发送 FI, FI中携带节点获得的与该节点相距两跳范围内的其他节点占用时 隙的情况, 指示节点感知到的每个时隙的占用状况信息, 对每个时隙给出该时隙的信息包 括:时隙占用状态信息, 占用时隙的节点对应的临时资源标识( Source Temporary Identifier, STI )或可称为节点标识, 占用时隙的节点的优先级状态 (也可认为是占用时隙节点在该 时隙发送的数据对应的优先级状态); 其中, 时隙占用状态信息可以表达时隙的四种占用 状态: (00 )表示时隙为空闲状态, (10 )表示时隙已被与本节点相距一跳的其他节点占用 (筒称为一跳节点占用)或本节点占用, ( 11 )表示时隙已被与本节点相距两跳的其他节点 占用 (筒称为两跳节点占用), (01 )表示时隙已被其他两个以上的节点占用, 即为碰撞状 态; 在非自身占用的时隙, 每个节点通过监听相邻一跳的节点发送的 FI, 能够判断相邻三 跳范围内每个节点占用时隙的情况, 当发现本节点占用的时隙资源与其他节点使用的资源 发生碰撞时, 重新预约新的空闲时隙。 为方便后续描述, 对 FI及其内部信息内容统一釆用 如下描述方式:
节点发送帧信息 (FI )称为: FI消息, 也可筒称为 FI;
FI 中指示的每个时隙对应的占用状况信息称为: FI 消息中每个时隙对应的时隙信息 域;
FI 中每个时隙对应的占用状况信息中给出的三类信息 (即: 时隙占用状态、 STI、 优 先级信息)分别称为: 每个时隙的时隙信息域中包含的时隙占用状态子域、 STI子域、 优 先级子域;
需要说明的是, 上述描述方式只是为了后续描述方便而规定, 当然也可以釆用其他的 描述方式。
在 MS-ALOHA机制下, 在对占用时隙的维护过程中, 节点需要维护 ( N- 1 ) *N维的 时隙状态緩存表,用来存储对应时隙上接收到的相邻节点发送的 FI消息中携带的各时隙的 时隙信息域。 例如, 参阅图 2所示, 图 2中展示的时隙状态緩存表的维数为 N*N维, 由于 节点本身在所占时隙发送的 FI 消息不需要存储, 因此节点实际维护的时隙状态緩存表为 N-1行(假设每个节点只占用一个时隙), 后续内容中描述的维数为 (N-1 ) *N的时隙状态 緩存表均是指不保存节点本身占用时隙发送 FI的时隙信息; 其中, 时隙对应的检测域是指 占用该时隙发送的 FI消息中该时隙对应的时隙信息域称为该时隙的检测域,非检测域是指 非占用该时隙发送的 FI 中该时隙对应的时隙信息域称为该时隙的非检测域。 其中 default 值为缺省值。
节点在一个时隙上接收到 FI消息时, 总是用新接收到的 FI消息中携带的时隙信息内 容覆盖时隙状态緩存表中对应时隙所在行的信息内容(即覆盖一个帧周期前记录的内容)。 具体过程如下:
节点在自身占用的时隙生成并发送 FI消息, 需要按照一定规则填写各个 field (域), 包括时隙占用状态子域、 STI子域以及优先级子域。 发送完毕后, 节点会清空所发送的 FI 信息。
节点在非自身占用的时隙上, 需要接收周围节点发送的 FI消息, 并根据接收到的 FI 消息更新时隙状态緩存表, 在到达本节点自身占用的时隙前判断自身占用的时隙是否维护 成功及非自己占用的各时隙的占用状态, 其中, 当在非自身占用的时隙上没有接收到 FI, 节点会将时隙状态緩存表中该时隙对应的行的各域填 default值。 Default值当前按空闲状 态 (00 )处理, 当然也可以定义其他处理方式。
在 MS-ALOHA机制下, 任意一节点判断时隙资源发生碰撞有以下两种情况:
1 ) 节点自身占用的时隙资源发生碰撞。 在(N-l ) *N时隙状态緩存表中, 节点自身占用的时隙对应的列 (N-1个元素)上所 指示的时隙信息中出现以下任意一种情况, 则认为节点自身占用的时隙发生碰撞:
a、 N-l个元素对应的时隙信息中存在一个或多个指示本时隙被与节点 STI不同的其他 节点占用 (对应的时隙占用状态指示为 10 ), 且节点自身的优先级不是占用该时隙的所有 节点(包括本节点和 N-1个元素对应的时隙信息中指示与本节点占用相同时隙的所有其他 节点) 中最高的。
b、 N-l个元素对应的时隙信息中存在一个或多个指示本时隙被与节点 STI不同的其他 节点占用(对应的时隙占用状态指示为 10 ),且节点的优先级为占用该时隙的所有节点(包 括本节点和 N-1个元素对应的时隙信息中指示与本节点占用相同时隙的所有其他节点)中 的最高优先级但不是唯一的最高优先级节点 (由于只有 4个优先等级, 因此可能出现优先 等级相同的多个节点)。 则节点可以选择在自身当前占用的时隙 +N上发送 FI, 在之后的流 程中, 如果再次出现这种情况, 节点可以概率 p再次在 slot p+2*N发送, 以概率(1-P )认 为发生时隙资源碰撞。
2 ) 非节点自身占用的时隙资源发生碰撞。
对于任一非节点自身占用的时隙对应的时隙状态緩存表中的 N-1个元素中, 出现了两 个及以上的时隙信息指示该时隙被两个及以上节点 (即: STI 不同) 占用 (对应时隙占用 状态指示为 10 ), 则确定该时隙资源发生碰撞。
现有技术下, 当节点判断自身占用的时隙发生资源碰撞时, 将重新发起接入过程重新 获得时隙资源。 当节点判断非自身占用的时隙资源发生碰撞时,将在自身发送的 FI中将发 生碰撞时隙的时隙状态信息填为 (01 ), 对应的 STI填写发生碰撞的节点中优先级最高的 节点对应的 STI, 优先级信息填写优先级最高的节点的优先级; 当发生碰撞的节点优先级 相同时, 随机选一个 STI填写, 而优先级信息填写最高的优先级。
另一方面, 现有技术下, MS-ALOHA机制中, 任意一节点填写 FI消息中每个时隙对 应的时隙信息域中各子域(包括时隙占用状态子域、 STI子域和优先级子域)的规则如下: ( 1 )对于节点自身占用的 slot, 时隙占用状态子域填写占用状态( 10 ), STI子域和优 先级子域分别填写自身的 STI和优先级信息;
( 2 )对于其他 slot, 分别考察(N-l ) *N时隙状态緩存表中对应的列:
如果 slot对应的列中的 N-1 个元素中时隙占用状态都指示为空闲状态 (00 )、 default 状态或两跳节点占用状态 (11 ), 则该 slot的时隙占用状态子域填写为空闲状态 ( 00 ), 且 不填写 STI子域和优先级子域;
如果 slot的检测域中时隙占用状态指示为占用状态 ( 10 ), 且其他 N-2个元素中时隙 占用状态都指示为空闲状态 (00 )、 default状态及两跳节点占用状态 ( 11 ), 或者, 时隙的 检测域中时隙占用状态指示为占用状态 ( 10 ), 且其他 N-2个元素中时隙占用状态都指示 为占用状态 (10 ) 并且 STI指示与检测域中的 STI指示相同, 则将该 slot的时隙占用状态 子域填写为占用状态 ( 10 ), 同时根据对应的 STI和优先级信息填写 STI子域和优先级子 域。 ( 10 ), 且各自对应的 STI不同, 则将该 slot的时隙占用状态子域填写为碰撞状态 ( 01 ), 同时, STI子域填写优先级最高的节点的 STI, 当存在多个最高优先级节点时, 随机选一 个最高优先级节点的 STI填写 STI子域, 优先级子域填写最高优先级节点对应的优先级。
如果 slot对应的检测域中时隙占用状态指示为 default状态, 且其他 N-1个元素中, 存 在一个或多个元素的时隙占用状态指示为占用状态 (10 ), 而且它们对应的 STI都相同, 则将该 slot的时隙占用状态子域填写为两跳占用状态( 11 ), 同时, 才 居对应的 STI和优先 级信息填写 STI子域和优先级子域。
现有技术下, 釆用 MS-AL0HA机制进行时隙资源碰撞判断的方法会产生以下问题: 首先, 时隙资源的判断规则会导致不必要的资源碰撞指示。
例如, 上述时隙占用状态信息填写为碰撞状态 (01 ) 的条件是: N-1 个元素中, 出现 了 2个及其以上的占用状态 ( 10 ), 且 STI不同。 但是, 实际应用中, 被指示占用同一个 时隙且 STI 不同的两个节点可能互为四跳节点, 而当两个节点互为四跳节点时, 已满足 MS-AL0HA机制规定的资源复用距离的要求 (即大于三跳), 因此釆用 MS-AL0HA机制 现有的时隙资源碰撞判断条件将会降低资源复用效率。 如, 参阅图 3所示, 节点 B通过 FI 通知节点 A, —跳节点 C占用时隙 n, 而节点 D通过 FI通知节点 A, —跳节点 E占用时 隙 n, 则节点 A获知两跳节点 C和两跳节点 E同时占用时隙 n, 则节点 A认为时隙 n上的 资源发生碰撞, 但是, 节点 C和节点 E互为四跳节点, 可以利用时隙 n的资源, 此时, 若 节点 A判定资源发生碰撞, 则会降低资源利用效率。
其次, FI的处理流程不完善。
目前, 在 FI的生成规则中, 没有考虑当节点接收到的 FI中指示非本节点占用的时隙 发生碰撞, 即 FI中该时隙对应的时隙信息域的时隙占用状态子域为占用状态为( 01 )时的 处理方式,即当节点接收到的 FI中指示非节点占用的某一时隙已被两个及以上的其他节点 占用时, 节点无法根据现有规则确定该时隙的状态并作出相关处理。 发明内容
本发明实施例提供一种资源碰撞的判定方法, 用以提高资源复用效率。
本发明实施例提供的具体技术方案如下:
一种时频资源碰撞的判定方法, 包括:
第一节点接收其他节点发送的帧信息 FI; 所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 判断所述时隙被第一设定 跳数节点和第二设定跳数范围内至少一个非所述第一设定跳数节点的其他节点同时占用 时, 确定所述时隙发生资源碰撞。
一种资源碰撞的判定装置, 包括:
通信单元, 用于接收其他节点发送的帧信息 FI;
处理单元, 用于对于非本装置占用的时隙, 根据接收到的 FI, 判断所述时隙被第一设 定跳数节点和第二设定跳数范围内至少一个非所述第一设定跳数节点的其他节点同时占 用时, 确定所述时隙发生资源碰撞。
本发明实施例中, 提出一种资源碰撞的判定方法, 第一节点根据接收到的其他节点发 送的 FI, 通过分析本节点的一跳节点占用的时隙和另一节点占用的时隙是否相同, 确定是 否将此时隙 (非本节点占用时隙)判定为碰撞状态, 以及通过分析本节点的一跳节点占用 的时隙是否被其他节点指示为碰撞状态, 确定是否将此时隙 (非本节点占用时隙)判定为 碰撞状态, 这样, 可以有效避免节点将可复用的时隙资源误判为碰撞时隙, 从而避免了因 碰撞指示信息的扩展传播导致不必要的时隙资源浪费, 提高了资源复用效率。 附图说明
图 1 A为现有技术下超帧结构示意图;
图 1B为现有技术下一种 FI结构见示意图;
图 2为现有技术下时隙状态緩存表示意图;
图 3为现有技术下节点间逻辑关系示意图;
图 4A为本发明实施例中节点进行资源碰撞的判定流程图;
图 4B为本发明实施例中一种时隙状态向量示意图;
图 5为本发明实施例中第一节点功能结构示意图。 具体实施方式
为了解决 MS-ALOHA机制中所存在的资源碰撞判断失误问题, 以及在 FI生成时, 无 法对接收到的其他节点发送的 FI中携带的碰撞状态指示信息(01 )准确处理的问题, 提出 一种新的资源碰撞的判定方法, 具体介绍如下。
目前, 第一节点对于本节点占用的时隙是否发生碰撞的判断, 以及对接收到的其他节 点发送的指示本节点占用时隙发生碰撞时的处理方式均属于现有技术, 其具体实施方式如 下:
第一节点对于自身占用的时隙,当节点接收到其他节点发送的 FI消息中第一节点对于 自身占用的时隙对应的时隙信息域中的时隙占用状态子域指示本节点占用的时隙发生碰 撞时, 则确定本节点占用的时隙发生了碰撞, 或者, 当节点接收到其他节点发送的 FI消息 中第一节点对于自身占用的时隙对应的时隙信息域指示本节点占用时隙被其他节点占用 时, 则确定本节点占用的时隙发生了碰撞; 此时, 节点应用释放自身所占用的时隙资源, 并重新发起接入过程重新获得时隙资源。
而本发明实施例提出一种新的资源碰撞的判定方法, 主要是应用于 "第一节点对于非 本节点占用的时隙" 这一应用场景的。 参阅图 4A所示, 其具体流程如下:
步骤 400: 第一节点接收其他节点发送的 FI消息。
本实施例中, 较佳的, 第一节点均以自身占用的两个相邻时隙之间的时长为一个帧周 期, 并在一个帧周期包含的除本节点占用的时隙之外的各个时隙内接收其他节点发送的 FI 消息。
另一方面, 第一节点接收到的 FI, 可以为从设定时间点开始到当前时间接收的 FI, 或 者, 为从当前时间往前倒推一帧时间内接收的 FI, 其中, 所谓设定时间点, 可以是第一节 点占用的时隙,可以是第一节点确定的 FI接收参考时隙,也可以是第一节点开始监听信道 的时隙。
实际应用中, 节点处理时隙资源的过程可以分为信道接入过程和信道维护过程。 信道 接入过程用于进行时隙资源申请; 信道维护过程用于对自占的时隙进行维护。 信道接入过 程分为以下 5个步骤:
步骤一: 监听一帧 (又称监听阶段)。
节点监听一帧中的所有 slot, 并将接收到的 FI消息存入 N*N时隙状态緩存表中的对 应位置。在一帧结束后, 自组织网络中的节点获得了如图 2所示的 N*N矩阵形式维护的时 隙状态信息, 并执行步骤二。
步骤二: 选择一个空闲时隙 ( available slot )。
根据时隙状态緩存表保存的信息确定: 如果有空闲 slot, 选择该 slot; 如果空闲 slot 多于一个, 从中随机选一个; 如果没有空闲 slot, 那么将比自己当前优先级低的 slot作为 空闲 slot进行选择。
选择空闲 slot后, 执行步骤三。
步骤三: 等待选定的 slot到达, 再次确认是否空闲。
假设步骤二中, 选择空闲 slot p。 那么, 在 slot p到达前, 持续监听各个 slot, 用新的 slot中接收的 FI信息覆盖图 2中的相应的旧的 slot中接收的 FI信息。等到 slot p-1的结尾, 检查 slot p是否仍然满足步骤二中的条件(包括无空闲 slot时的优先级考虑的方式):
如满足, 则执行步骤四 (即发送 FI )。
如不满足, 此刻立即执行步骤二。
步骤四: 在 slot p发送生成的 FI消息。 发送完毕后, 执行步骤五。
步骤五: 监听反馈, 确认是否成功占用时隙。
信道维护由两部分操作构成:一方面是要在自己占用的时隙上发送 FI信息; 另一方面 是在非自己占用的时隙上接收 FI信息, 并根据接收到的 FI信息更新自己维护的时隙状态 表以判断自己占用时隙是否发生碰撞, 当发生碰撞时, 重新开始信道接入过程预约新的时 隙资源。
发送时隙: 根据当前的时隙状态表生成 FI信息, 并发送。
接收时隙:根据接收到的 FI信息中各时隙对应的时隙信息域对自己维护的时隙状态表 中各时隙对应的时隙信息单元进行更新。 当自己占用的时隙判断为发生碰撞时, 则信道维 护过程结束, 重新进入信道接入过程, 监听空闲时隙, 预约新的时隙资源。
上述步骤 400中提及的第一节点开始监听信道的时隙, 可以从信道接入过程执行步骤 一的时隙开始, 也可以从信道维护过程开始。
步骤 410: 第一节点对于非本节点占用的时隙, 根据接收到的 FI消息, 判断上述时隙 被第一设定跳数节点和第二设定跳数范围内至少一个非上述第一设定跳数节点的其他节 点同时占用时, 确定上述时隙发生资源碰撞。
较佳的, 第一节点可以在确定本节点需要发送 FI时执行上述判断操作,可以在每次接 收到 FI时执行上述判断操作,也可以在接入过程中监听阶段结束时执行上述判断操作,还 可以在其他设定时间点执行上述判断操作。
较佳的, 上述第一设定跳数节点为一跳节点, 即是指与第一节点相距一跳的节点, 那 么, 在执行步骤 410时, 第一节点对于非本节点占用的第一时隙, 根据接收到的 FI, 确认 上述第一时隙被一跳节点和至少一个非该一跳节点的其他节点同时占用时, 确定该第一时 隙发生资源碰撞。
例如: 节点 A根据接收到的 FI确定时隙 n被一跳节点 B和两跳节点 E同时占用, 则 确定时隙 n的资源发生碰撞, 并将其时隙占用状态判断为碰撞状态。
又例如: 节点 A根据接收到的 FI确定时隙 n被一跳节点 B占用, 并且除一跳节点 B 之外的其他节点指示时隙 n为 "碰撞状态", 则确定时隙 n的资源发生碰撞, 并将其时隙 占用状态判断为碰撞状态。
根据上述举例可以看出, 第一节点根据接收到的其他节点发送的 FI, 获知其他节点指 示某一时隙为 "碰撞状态" 时, 只有在自身的一跳节点也占用该时隙的情况下, 才会将该 时隙的时隙占用状态判断为碰撞状态, 否则, 不认为时隙资源发生碰撞。 这样, 可以有效 避免相距四跳的节点无法复用时隙资源的情况出现, 有效提高了资源的复用效率。
基于上述实施例, 以下实施例中, 仅以第一设定跳数节点为一跳节点, 第二设定跳数 范围是两跳范围为例进行介绍, 技术人员可以根据将以下实施例中记载的相关技术方案应 用于其他相适合的应用场景中。 当然第一设定跳数也可以是两跳、 三跳等, 第二设定跳数 范围也可以是三跳范围、 四跳范围等, 在此不再赘述。
实际应用中, 第一节点在帧周期内接收其他节点发送的 FI消息后, 会有两种 FI信息 保存方式, 在不同的 FI信息保存方式下, 步骤 410的执行方式也略有不同。 下面对两种 FI信息保存方式下步骤 410的执行方式分别作出介绍。
第一种 FI信息保存方式为: 釆用累积方式保存 FI, 即在一个帧周期内, 节点在其他 节点占用的时隙内接收其他节点发送的 FI, 并在本节点占用的时隙发送 FI消息之前, 对 接收到的其他节点发送的 FI统一进行处理, 获得本节点需要发送的 FI。
釆用第一种 FI保存方式时, 节点接收到所有其他节点发送的 FI后, 可以釆用如图 2 所示的基于 MS-ALOHA机制的时隙状态緩存表的方式进行保存, 表中的每一行存储对应 节点在某一时隙接收到的 FI中的时隙信息, 当然, 也可以釆用其他实现方式, 如, 表中的 每一列存储对应节点在某一时隙接收到 FI中的时隙信息,或釆用数据、链表等其他数据结 构来存储节点在某一时隙接收到的 FI中的时隙信息)。 下面以釆用时隙状态緩存表来保存 节点收到的 FI且表中的每一行存储对应节点在某一时隙接收到的 FI中的时隙信息为例进 行介绍。
第一节点在本节点占用的时隙发送 FI前, 基于之前接收的其他节点发送的 FI得到的 ( N-1 ) *N的时隙状态緩存表(设不保存本节点占用时隙发送的 FI ), 能够判断各个时隙 当前的占用状态。 此时, 步骤 410的具体执行方式如下:
第一节点对于非本节点占用的任意一时隙, 当确认该任意一时隙对应的检测域信息指 示该任意一时隙已被一跳节点占用, 且该任意一时隙对应的至少一个非检测域信息指示该 任意一时隙被非上述一跳节点的另一节点占用时, 判断该任意一时隙为碰撞状态; 和 /或, 第一节点对于非本节点占用的任意一时隙, 当确认该任意一时隙对应的检测域信息指示该 任意一时隙已被一跳节点占用, 且该任意一时隙对应的至少一个非检测域信息指示该任意 一时隙为碰撞状态时, 判断该任意一时隙为碰撞状态。
例如, 第一节点检测 ( N-1 ) *N维时隙状态緩存表中时隙 n所对应的列 (即其他节点 针对时隙 n发送的时隙信息, 记为 N-1个元素): 即检测不同节点指示的时隙 n的时隙信 息, 若确定时隙 n对应的检测域信息指示时隙 n被一跳节点占用, 而至少一个非检测域信 息指示时隙 n被另——跳节点占用 (此一跳节点与检测域指示的一跳节点不同, 检测域中 的一跳节点占用是距第一节点一跳距离的节点, 非检测域中的一跳节点是距发送对应 FI 消息节点一跳距离的节点, 因此非检测域中指示的一跳节点对于第一节点来说是两跳节 点) , 则将时隙 n判定为碰撞状态。
又例如: 第一节点检测 ( N-1 ) *N维的时隙状态緩存表中时隙 n所对应的列 (即其他 节点针对时隙 n发送的时隙信息, 记为 N-1个元素), 即检测不同节点指示的时隙 n的时 隙信息, 若确定时隙 n对应的检测域信息指示时隙 n被一跳节点占用, 而至少一个非检测 域信息指示时隙 n为碰撞状态, 则将时隙 n判定为碰撞状态。
从上述实施例可以看出, 本发明实施例中, 第一节点被其他节点通知非本节点占用的 时隙 n发生碰撞时, 其处理方式为:
第一节点检测( N- 1 ) *N维时隙状态緩存表中时隙 n所对应的列 ( N- 1个元素), 如果 时隙 n对应的检测域信息指示时隙 n被一跳节点占用, 而至少一个非检测域信息指示时隙 n为碰撞状态, 则将时隙 n判断为碰撞状态;
如果时隙 n对应的检测域指示为 default状态 \空闲状态, 而至少一个非检测域信息指 示时隙 n为碰撞状态, 那么, 第一节点在确定时隙 n的时隙状态时, 会才 居时隙 n对应的 列中 N-1个元素(即检测域和非检测域)内将时隙 n指示为非碰撞状态的元素内容决定(即 不考虑将时隙 n指示为碰撞状态的非检测域内容的影响)。
第二种 FI信息保存方式为: 釆用迭代方式保存 FI信息, 即节点仅保存一个关于各时 隙当前占用状态的向量, 称为时隙状态向量(也可称作时隙状态表)后续称为时隙状态向 量(表), 一种可能的时隙状态向量(表)如图 4B所示, 当节点接收到其他节点发送的 FI 时, 根据新接收 FI中各时隙对应的时隙信息域对本地保存的时隙状态向量(表)中每一个 时隙对应的时隙信息单元进行更新。 当节点需发送自身判定的 FI时,会# ^据保存的时隙状 态向量(表) 中的信息生成要发送的 FI。
为方便后续描述, 本发明中对时隙状态向量(表)及其内部信息内容统一釆用如下描 述方式:
节点保存的记录各时隙当前占用状态信息的格式称为: 时隙状态向量,或时隙状态表; 时隙状态向量(表)中指示的每个时隙对应的占用状况信息称为: 时隙状态向量(表) 中每个时隙对应的时隙信息单元;
时隙状态向量(表) 中每个时隙对应的占用状况信息中给出的三类信息 (即: 时隙占 用状态、 STI、 优先级信息)分别称为: 每个时隙的时隙信息单元中包含的时隙占用状态 子单元(这里,时隙占用状态子单元中内容不需要和 FI中时隙占用状态子域内容完全相同, 但需要有映射关系, 如: 对于节点保存的时隙状态表中可以设 "自占"和 "一跳节点占用" 两个状态来表明时隙的占用状态, 而节点将保存的时隙状态表中的信息内容映射到要发送 的 FI消息中时, FI中两种状态的时隙对应的时隙信息域中的时隙占用状态子域可以都映 射为 "10" , 其他节点接收到 FI后通过时隙信息域所在位置 (是检测域还是非检测域) 来 判断对应时隙信息域的时隙占用状态子域中的 "10" 指的是发送节点自占还是发送节点的 一跳节点占用)、 STI子单元和优先级子单元。
需要说明的是, 上述描述方式只是为了后续描述方便而规定, 当然也可以釆用其他的 描述方式。 釆用第二种 FI保存方式时, 节点在某个时隙中接收到其他节点发送的 FI消息后, 可 以对当前保存的时隙状态向量(表) 中指示的各时隙的时隙信息单元内容进行更新时, 其 中, 第一节点对于非本节点占用的任意一时隙, 根据接收到的 FI, 当确认已保存的时隙状 态向量(表) 中该任意一时隙对应的时隙信息单元指示该任意一时隙已被一跳节点占用, 而接收 FI 中该任意一时隙对应的时隙信息域指示该任意一时隙被非上述一跳节点的另一 两跳节点占用时, 判断上述任意一时隙为碰撞状态; 和 /或, 第一节点对于非本节点占用的 任意一时隙, 当确认已保存的时隙状态向量(表) 中该任意一时隙对应的时隙信息单元指 示该任意一时隙已被一跳节点占用,而接收 FI中该任意一时隙对应的时隙信息域指示该任 意一时隙为碰撞状态时, 判断上述任意一时隙为碰撞状态。
上述实施例中, 对于任意一时隙是否为碰撞状态的判定规则可以釆用以下规则之一或 任意组合, 并且并不限于以下几种规则:
例如, 第一节点对于帧周期内非本节点占用的时隙 n, 才 居时隙 m-1中已保存的时隙 状态向量(表)确定时隙 n已被一跳节点占用, 同时, 上述第一节点根据在时隙 m中新接 收的 FI中对应的时隙信息域,确定时隙 n被指示为被非上述一跳节点的另一两跳节点所占 用, 则上述第一节点将保存的时隙状态向量(表) 中时隙 n对应的时隙占用状态子单元内 容更新为碰撞状态, 对应的 STI子单元和优先级子单元的更新规则见后续描述。
如, 参阅图 3所示, 节点 A保存的时隙状态向量(表) 中将时隙 n的时隙占用状态记 录为被一跳节点 B占用, 此时节点 A收到节点 C发送的 FI, FI指示时隙 n被节点 A的两 跳节点 E占用 (节点 E和节点 B的 STI不同), 则节点 A将保存的时隙状态向量(表) 中 时隙 n的时隙占用状态更新为碰撞状态;
又例如, 第一节点对于帧周期内非本节点占用的时隙 n, 才 居时隙 n-1 中已保存的时 隙状态向量(表)确定时隙 n已被两跳节点占用, 同时, 上述第一节点根据在时隙 n中新 接收的 FI中对应的时隙信息域,确定时隙 n被指示为被非上述两跳节点的另——跳节点所 占用, 则上述第一节点将保存的时隙状态向量(表) 中时隙 n对应的时隙占用状态子单元 内容更新为碰撞状态, 对应的 STI子单元和优先级子单元的更新规则见后续描述。
又例如, 第一节点对于帧周期内非本节点占用的时隙 n, 才 居时隙 m-1中已保存的时 隙状态向量(表)确定时隙 n已被一跳节点占用, 同时, 上述第一节点根据在时隙 m中新 接收的 FI中对应的时隙信息域,确定时隙 n被指示为碰撞状态, 则上述第一节点将保存的 时隙状态向量(表)中时隙 n对应的时隙占用状态子单元内容更新为碰撞状态,对应的 STI 子单元和优先级子单元的更新规则见后续描述。
又例如, 第一节点对于帧周期内非本节点占用的时隙 n, 才 居时隙 m-1中保存的时隙 状态向量(表)确定时隙 n的时隙占用状态为碰撞状态, 那么不论在时隙 m中新接收的 FI中对应的时隙信息域指示时隙 n是何种时隙状态, (如, 被上述第一节点占用、 被一跳 节点占用、 被两跳节点占用、 空闲状态、 碰撞状态), 上述第一节点在保存的时隙状态向 量(表) 中均将时隙 n的时隙占用状态保持为碰撞状态。
从上述实施例可以看出, 本发明实施例中, 第一节点对被其他节点通知非本节点占用 的时隙 n发生碰撞时, 其处理方式为:
如果第一节点根据已保存的时隙状态向量(表), 确定时隙 n 的时隙占用状态被记录 为 "一跳节点占用", 则当接收到其他节点发送的 FI中指示时隙 n的时隙占用状态为碰撞 状态时, 将时隙 n的时隙占用状态更新为碰撞状态。
如果第一节点根据已保存的时隙状态向量(表), 确定时隙 n 的时隙占用状态被记录 为非 "一跳节点占用", 则当接收到其他节点发送的 FI中指示时隙 n的时隙占用状态为碰 撞状态时, 维持时隙 n原有的时隙占用状态不变。
在上述各实施例中, 当第一节点判断非本节点占用的任意一时隙发生了资源碰撞时, 在本节点发送的 FI中指示该任意一时隙发生资源碰撞,进一步地,可以结合节点优先级信 息和节点标识信息, 确定在 FI中指示该任意一时隙为碰撞状态的指示方式。 例如, 第一节 点确定非本节点占用的任意一时隙为碰撞状态时, 若在该任意一时隙上, 高优先级节点和 低优先级节点的时隙资源发生碰撞,则上述第一节点在 FI中发送的该任意一时隙对应的时 隙信息中指示高优先级节点对应的 STI以及高优先级节点对应的优先级信息。 另外, 当釆 用第二种 FI信息保存方式时,当第一节点判断非本节点占用的任意一时隙发生了资源碰撞 时, 在本节点保存的时隙状态向量(表) 中该任意一时隙对应的时隙信息单元的时隙占用 状态子单元中指示该任意一时隙为碰撞状态, 进一步地, 可以结合节点优先级信息和节点 标识信息, 确定在时隙状态向量(表)中指示该任意一时隙为碰撞状态的指示方式。 例如, 第一节点确定非本节点占用的任意一时隙为碰撞状态时, 若在该任意一时隙上, 高优先级 节点和低优先级节点的时隙资源发生碰撞, 则在第一节点保存的时隙状态向量(表) 中该 任意一时隙对应的时隙信息单元中指示高优先级节点对应的 STI以及高优先级节点对应的 优先级信息。
由上述内容可以看出, 本发明实施例中, 第一节点确定非本节点占用的任意一时隙发 生资源碰撞后, 若第一节点维护时隙状态向量(表), 则在保存的时隙状态表中将判断为 碰撞状态的时隙对应的时隙信息单元中的时隙占用状态子单元置为碰撞状态, 若第一节点 未维护时隙状态表, 则当釆用判断后的结果生成第一节点发送的 FI时, 将 FI中判断为碰 撞状态的时隙对应的时隙信息域中时隙占用状态子域置为碰撞状态;
另一方面, 第一节点确定非本节点占用的任意一时隙发生资源碰撞后, 若第一节点维 护时隙状态表, 则结合节点优先级信息和节点标识信息在保存的时隙状态表中更新判断为 碰撞状态的时隙对应的时隙信息单元中的节点标识子单元和优先级子单元; 如,
若第一节点确定判断为碰撞状态的时隙上, 高优先级节点和低优先级节点的资源发生 碰撞, 则第一节点在时隙状态向量(表) 中发生碰撞的时隙对应的时隙信息单元中, 将节 点标识(即 STI )子单元置为高优先级节点对应的节点标识, 以及将优先级子单元置为高 优先级节点对应的优先级信息。
若第一节点未维护时隙状态表, 则当釆用判断后的结果生成第一节点发送的 FI时, 结 合节点优先级信息和节点标识信息确定 FI 中判断为碰撞状态的时隙对应的时隙信息域中 节点标识子域和优先级子域; 如,
若第一节点确定判断为碰撞状态的时隙上, 高优先级节点和低优先级节点的资源发生 碰撞, 则第一节点在 FI中发送的发生碰撞的时隙对应的时隙信息域中,将节点标识子域置 为高优先级节点对应的节点标识, 以及将优先级子域置为高优先级节点对应的优先级信 息。
下面以两个具体的应用场景为例对上述流程进行详细说明。
第一种应用场景为: 釆用 N*N维时隙状态緩存表维护时隙信息的碰撞判定方法(即釆 用第一种 FI保存方式), 其中, 假设设一个帧中包含 6个时隙, 节点 A占用时隙 3 , 在时 隙 2结束时, 节点 A保存的 N*N维时隙状态緩存表如表 1所示 (本实施例中没有考虑优 先级相关信息):
Figure imgf000014_0001
表 1 (节点 A时隙占用状态) 节点 A在发送自身的 FI之前, 根据已保存的时隙状态緩存表确定各时隙的状态。 具 体如下: 时隙 1 : 碰撞状态。
原因: 时隙 1的检测域和至少一个非检测域都指示时隙 1被占用, 但占用
时隙的节点不同。
时隙 2: 被节点 G。
原因: 除时隙 2对应的检测域指示时隙 2被节点 G占用外, 时隙 2对应列上的非检测 域均指示时隙 2为空闲状态或 default状态。
时隙 3: 被节点 A占用。
原因: 时隙 3对应的非检测域没有指示时隙 3还被其他节点占用, 即: 节点自身占用 的时隙没有发生碰撞。
时隙 4: 碰撞状态。
原因: 时隙 4对应的检测域指示时隙 4节点 F占用 (即检测域指示为 10 ), 但时隙 4 对应的一个非检测域指示时隙 4为碰撞状态 ( 01 )。
时隙 5: 碰撞状态。
原因: 时隙 5对应的检测域和至少一个非检测域都指示时隙 5被占用, 但指示占用时 隙 5的节点不同。
时隙 6: 被节点 H占用。
原因: 虽然在时隙 5接收到节点 C发送的时隙状态信息中指示时隙 6为碰撞状态, 由 于时隙 6的检测域指示为 default状态,根据前述判断规则 "如果时隙对应的检测域指示为 default状态 \空闲状态, 而至少一个非检测域信息指示该时隙为碰撞状态, 那么, 第一节点 在确定该时隙的时隙状态时,会根据时隙 n对应的列中 N- 1个元素(即检测域和非检测域 ) 内将该时隙指示为非碰撞状态的元素内容决定", 因此确定时隙 6的状态为被节点 H占用。
这样 , 节点 A根据表 1可以确定出当前各个时隙的状态信息, 具体如表 2所示:
Figure imgf000015_0001
表 2
节点根据确定如表 2所示的各时隙的状态信息生成要发送的 FI, 其中, 节点 A会在 FI中添加各时隙对应 STI和优先级信息。 实际实施过程中, 可以釆用从表 1先生成表 2然 后再生成要发送的 FI,也可以釆用根据本发明所述的判断方法直接由表 1生成要发送的 FI 另一种应用场景为: 釆用时隙状态向量(表)维护时隙信息的碰撞判定方法。 假设一 个帧中包含 5个时隙, 节点 A占用时隙 5 , 节点内部维护的时隙状态向量(表)各时隙对 应的时隙占用状态定义如下 (本实施例中没有考虑优先级相关信息):
10被一跳节点占用或自己占用;
11 被两跳节点占用;
01 碰撞时隙; 00 空闲时隙或被三跳节点占用时隙。
假设在时隙 3结束时, 节点 A保存的时隙状态向量(表)如表 3所示:
01 C: 10 D: 10 F: 11 A: 10
表 3 而假设节点 A在时隙 4接收到的节点 B发送的 FI中携带的时隙信息如表 4所示:
G; 10 E: 10 01 B: 10 00 表 4 则节点 A根据节点 B发送的 FI中携带的时隙信息更新自己保存的时隙状态向量(表), 具体如下:
时隙 1状态: 碰撞状态。
原因: 节点 A之前保存的 FI确认时隙 1发生资源碰撞。
时隙 2: 碰撞状态。
原因: 节点 A根据时隙状态向量(表) 中的时隙信息确认时隙 2被一跳节点 C占用, 接着, 节点 A根据一跳节点 B发送的 FI判定时隙 2同时被两跳节点 E占用。
时隙 3: 碰撞状态。
原因: 节点 A根据时隙状态向量(表) 中的时隙信息确认时隙 3被一跳节点 D占用, 接着, 节点 A根据一跳节点 B发送的 FI判定时隙 3已发生资源碰撞。
时隙 4: 碰撞状态。
原因: 节点 A根据时隙状态向量(表) 中的时隙信息确认时隙 4被两跳节点 F占用, 接着, 节点 A在时隙 4上接收到一跳节点 B发送的 FI , 指示时隙 4被一跳节点 B占用。
时隙 5: 被节点 A自己占用。 原因: 节点 A根据时隙状态向量(表) 中的时隙信息已 认为时隙 5被自己占用, 在接收到节点 B发送的 FI中没有指示该时隙被其他节点占用。
节点 A根据在时隙 4接收到的节点 B发送的 FI更新后的时隙状态向量(表)具体如 表 5所示:
Figure imgf000016_0001
表 5
在到达时隙 5时, 节点 A根据保存的时隙状态向量(表) 中的时隙信息 (表 5 )生成 发送的 FI。
需要说明的是, 在第二种应用场景下, 当前只使用了两个 bit来在时隙状态向量(表) 中区分不同的时隙占用状态, 由上可以看出, 00表示两种不同的时隙状态, 一个是空闲状 态,一个是被三跳节点占用,尽管根据内部状态生成向节点发送的 FI中不管是空闲时隙还 是被三跳节点占用时隙都将指示为 00,但这两个不同的状态对节点本身发生资源碰撞时资 源的选择还是有影响的, 如, 三跳节点占用的时隙资源, 不能被选择。 为了更加明确地区 分不同的时隙占用状态, 在节点维护自身的时隙占用状态向量(表) 时, 可以对空闲状态 和被三跳节点占用状态进行区分, 根据具体算法的要求还可以增加其他的时隙占用状态区 分参量。
另一方面, 本实施例中, 以上的描述中均 支设每个节点在一个帧中只占用 N个时隙中 的 1个时隙, 例如, 节点的时隙信息釆用累积方式保存时, 节点最多收到的是 N-1个其他 节点发送的 FI。 需要指出的是, 对于节点同时占用 1个以上时隙的情况(例如, 节点在帧 中占用 2个时隙, 那么, 当节点的时隙状态信息釆用累积方式保存时, 节点最多可以收到 N-2个其他节点发送的 FI ),仍然适用于本发明实施例所提出的判定处理方法,按照相同的 逻辑执行即可。
基于上述实施例, 参阅图 5所示, 本发明实施例中, 第一节点包括通信单元 50和处 理单元 51 , 其中,
通信单元 50, 用于接收其他节点发送的 FI;
处理单元 51 , 用于对于非本装置占用的时隙, 根据接收到的 FI, 判断所述时隙被第一 设定跳数节点和第二设定跳数范围内至少一个非所述第一设定跳数节点的其他节点同时 占用时, 确定该时隙发生资源碰撞。
进一步的, 所述处理单元 51 釆用的第一设定跳数节点为一跳节点, 第二设定跳数范 围为两跳范围。
进一步的, 所述通信单元 50接收到的 FI, 为从设定时间点开始到当期时间接收的 FI, 或者, 为从当前时间往前一帧时间内接收的 FI。
进一步的, 所述通信单元 50 釆用的设定时间点为本装置确定的自占主时隙; 或者, 为本装置确定的 FI接收参考时隙; 或者, 为本装置开始监听信道的时隙。
进一步的, 所述处理单元 51执行所述判断操作时, 包括:
所述处理单元 51在本装置确定需要发送 FI时执行所述判断操作; 或者,
所述处理单元 51在每次新接收到 FI时执行判断操作; 或者,
所述处理单元 51在接入过程中监听阶段结束时执行所述判断操作; 或者,
所述处理单元 51在其他设定时间点执行所述判断操作。
进一步的, 所述处理单元 51对于非本装置占用的时隙, 根据接收到的 FI, 判断所述 时隙被第一设定跳数节点和第二设定跳数范围内至少一个非所述第一设定跳数节点的其 他节点同时占用时, 确定所述时隙发生资源碰撞, 包括: 所述处理单元 51对于非本装置占用的时隙, 根据接收到的 FI, 确认所述时隙被分别 指示为由第一设定跳数节点占用和由第二设定跳数范围内至少一个非所述第一设定跳数 节点的其他节点占用时, 确定所述时隙发生资源碰撞;
和 /或,
所述处理单元 51对于非本装置占用的时隙, 根据接收到的 FI, 确认所述时隙被分别 指示为由第一设定跳数节点占用和碰撞状态时, 确定所述时隙发生资源碰撞。
进一步的, 所述处理单元 51对于非本装置占用的时隙, 根据接收到的 FI, 确认所述 时隙被分别指示为由第一设定跳数节点占用和由第二设定跳数范围内至少一个非所述第 一设定跳数节点的其他节点占用时, 确定所述时隙发生资源碰撞, 包括:
所述处理单元 51根据在非本装置占用的时隙内接收到的 FI, 判断所述时隙对应的检 测域信息指示所述时隙由第一设定跳数节点占用, 且所述时隙对应的至少一个非检测域信 息指示所述时隙被第二设定跳数范围内非所述第一设定跳数节点的另一节点占用时, 确定 所述时隙发生资源碰撞。
进一步的, 所述处理单元 51对于非本装置占用的时隙, 根据接收到的 FI, 确认所述 时隙被分别指示为由第一设定跳数节点占用和碰撞状态时, 确定所述时隙发生资源碰撞, 包括:
所述处理单元 51根据在非本装置占用的时隙内接收到的 FI, 判断所述时隙对应的检 测域信息指示所述时隙被第一设定跳数节点占用, 且所述时隙对应的至少一个非检测域信 息指示所述时隙为碰撞状态时, 确定所述时隙发生资源碰撞。
进一步的, 所述处理单元 51 判断所述时隙对应的检测域信息指示所述时隙未被第一 设定跳数点占用, 且所述时隙对应的至少一个非检测域信息指示所述时隙为碰撞状态时, 根据未指示所述时隙为碰撞状态的非检测域信息确定所述时隙当前的时隙状态。
进一步的, 所述处理单元 51对于非本装置占用的时隙, 根据接收到的 FI, 确认所述 时隙被分别指示为由第一设定跳数节点占用和由第二设定跳数范围内至少一个非所述第 —设定跳数节点的其他节点占用时, 确定所述时隙发生资源碰撞, 包括:
所述处理单元 51根据在当前时隙接收到的 FI, 结合本地保存的时隙状态表, 判断本地保存的时隙状态表指示所述时隙被一跳节点占用,且新接收的 FI中所述时隙 对应的时隙信息域指示所述时隙被另一两跳节点占用时, 确定所述时隙发生资源碰撞; 或 者,判断已保存的时隙占用状态表指示所述时隙被两跳节点占用,且新接收的 FI中所述时 隙对应的时隙信息域指示所述时隙被另——跳节点占用时, 确定所述时隙发生资源碰撞。
进一步的, 所述处理单元 51对于非本装置占用的时隙, 根据接收到的 FI, 确认所述 时隙被分别指示为由第一设定跳数节点占用和碰撞状态时, 确定所述时隙发生资源碰撞, 包括: 所述处理单元 51根据在当前时隙接收到的 FI, 结合本地保存的时隙状态表, 判断本 地保存的时隙状态表指示所述时隙被一跳节点占用,且新接收的 FI中所述时隙的时隙信息 指示所述时隙为碰撞状态时, 确定所述时隙发生资源碰撞; 或者, 所述处理单元判断已保 存的时隙状态表指示所述时隙为碰撞状态,且新接收的 FI中所述时隙的时隙信息指示所述 时隙被一跳节点占用时, 确定所述时隙发生资源碰撞。
进一步的, 所述处理单元 51 判断已保存的时隙状态表指示所述时隙未被一跳节点占 用,且新接收的 FI中所述时隙对应的时隙信息域指示所述时隙为碰撞状态时, 维持所述时 隙原有的时隙状态不变。
进一步的, 所述处理单元 51确定所述时隙发生资源碰撞后, 执行以下操作: 若处理单元维护时隙状态表, 则在保存的时隙状态表中将判断为碰撞状态的时隙对应 的时隙信息单元中的时隙占用状态子单元置为碰撞状态;
若处理单元未维护时隙状态表, 则当釆用判断后的结果生成单元发送的 FI时, 将 FI 中判断为碰撞状态的时隙对应的时隙信息域中时隙占用状态子域置为碰撞状态。
进一步的, 所述处理单元 51 确定非本装置占用的时隙发生资源碰撞后, 执行以下操 作:
若所述处理单元维护时隙状态表, 则结合节点优先级信息和节点标识信息在保存的时 隙状态表中更新判断为碰撞状态的时隙对应的时隙信息单元中的节点标识子单元和优先 级子单元;
若所述处理单元未维护时隙状态表, 则当釆用判断后的结果生成单元发送的 FI时, 结 合节点优先级信息和节点标识信息确定 FI 中判断为碰撞状态的时隙对应的时隙信息域中 节点标识子域和优先级子域。
进一步的, 所述处理单元 51在本装置发送的 FI中结合节点优先级信息和节点标识信 息确定 FI中判断为碰撞的时隙对应的时隙信息域中节点标识子域和优先级子域, 包括: 若所述处理单元确定所述时隙上, 高优先级节点和低优先级节点的资源发生碰撞, 则 所述节点在 FI中发送的发生碰撞的时隙对应的时隙信息域中,将节点标识子域置为高优先 级节点对应的节点标识, 以及将优先级子域置为高优先级节点对应的优先级信息。
综上所述, 本发明实施例中, 提出一种资源碰撞的判定方法, 第一节点根据接收到的 其他节点发送的 FI, 通过分析本节点的一跳节点占用的时隙和另一节点占用的时隙是否相 同, 确定是否需要此时隙 (非本节点占用时隙)判定为碰撞状态, 以及通过分析本节点的 一跳节点是否占用了其他节点指示的碰撞时隙, 确定是否需要将此时隙 (非本节点占用时 隙判定为碰撞状态), 这样, 可以有效避免节点将可复用的时隙资源误判为碰撞时隙, 从 而避免了因碰撞指示信息的扩展传播导致不必要的时隙资源浪费, 提高了资源复用效率。
进一步地,本发明实施例中,还提出了第一节点接收到其他节点发送的 FI指示非本节 点占用时隙发生资源碰撞时的处理方式、 从而完善了 MS-ALOHA机制下 FI的处理方式。 本领域内的技术人员应明白, 本发明的实施例可提供为方法、 系统、 或计算机程序产 品。 因此, 本发明可釆用完全硬件实施例、 完全软件实施例、 或结合软件和硬件方面的实 施例的形式。 而且, 本发明可釆用在一个或多个其中包含有计算机可用程序代码的计算机 可用存储介盾 (包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形 式。
本发明是参照根据本发明实施例的方法、 设备(系统)、 和计算机程序产品的流程图 和 /或方框图来描述的。 应理解可由计算机程序指令实现流程图和 /或方框图中的每一流 程和 /或方框、 以及流程图和 /或方框图中的流程和 /或方框的结合。 可提供这些计算机 程序指令到通用计算机、 专用计算机、 嵌入式处理机或其他可编程数据处理设备的处理器 以产生一个机器, 使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用 于实现在流程图一个流程或多个流程和 /或方框图一个方框或多个方框中指定的功能的 装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方 式工作的计算机可读存储器中, 使得存储在该计算机可读存储器中的指令产生包括指令装 置的制造品, 该指令装置实现在流程图一个流程或多个流程和 /或方框图一个方框或多个 方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上, 使得在计算机 或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理, 从而在计算机或其他 可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和 /或方框图一个 方框或多个方框中指定的功能的步骤。
显然, 本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和 范围。这样,倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内, 则本发明也意图包含这些改动和变型在内。

Claims

权 利 要 求
1、 一种时频资源碰撞的判定方法, 其特征在于, 包括:
第一节点接收其他节点发送的帧信息 FI;
所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 判断所述时隙被第一设定 跳数节点和第二设定跳数范围内至少一个非所述第一设定跳数节点的其他节点同时占用 时, 确定所述时隙发生资源碰撞。
2、 如权利要求 1 所述的方法, 其特征在于, 所述第一设定跳数节点为一跳节点, 第 二设定跳数范围为两跳范围。
3、 如权利要求 1所述的方法, 其特征在于, 所述第一节点接收到的 FI, 为从设定时 间点开始到当前时间接收的 FI, 或者, 为在当前时间前一帧时间内接收的 FI。
4、 如权利要求 3所述的方法, 其特征在于, 所述设定时间点为第一节点占用的时隙; 或者, 为第一节点确定的 FI接收参考时隙; 或者, 为第一节点开始监听信道的时隙。
5、 如权利要求 1 - 4任一项所述的方法, 其特征在于, 所述第一节点执行所述判断 操作时, 包括:
所述第一节点在确定本节点需要发送 FI时执行所述判断操作; 或者,
所述第一节点在每次接收到 FI时执行判断操作; 或者,
所述第一节点在接入过程中监听阶段结束时执行所述判断操作; 或者,
所述第一节点在其他设定时间点执行所述判断操作。
6、 如权利要求 1 _ 4任一项所述的方法, 其特征在于, 所述第一节点对于非本节点占 用的时隙, 根据接收到的 FI, 判断所述时隙被第一设定跳数节点和第二设定跳数范围内至 少一个非所述第一设定跳数节点的其他节点同时占用时, 确定所述时隙发生资源碰撞, 包 括:
所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示 为由第一设定跳数节点占用和由第二设定跳数范围内至少一个非所述第一设定跳数节点 的其他节点占用时, 确定所述时隙发生资源碰撞;
和 /或,
所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示 为由第一设定跳数节点占用和碰撞状态时, 确定所述时隙发生资源碰撞。
7、 如权利要求 6所述的方法, 其特征在于, 所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示为由第一设定跳数节点占用和由第二设定跳数 范围内至少一个非所述第一设定跳数节点的其他节点占用时, 确定所述时隙发生资源碰 撞, 包括:
所述第一节点根据在非本节点占用的时隙内接收到的 FI, 判断所述时隙对应的检测域 信息指示所述时隙由第一设定跳数节点占用, 且所述时隙对应的至少一个非检测域信息指 示所述时隙被第二设定跳数范围内非所述第一设定跳数节点的另一节点占用时, 确定所述 时隙发生资源碰撞。
8、 如权利要求 6所述的方法, 其特征在于, 所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示为由第一设定跳数节点占用和碰撞状态时, 确 定所述时隙发生资源碰撞, 包括:
所述第一节点根据在非本节点占用的时隙内接收到的 FI, 判断所述时隙对应的检测域 信息指示所述时隙被第一设定跳数节点占用, 且所述时隙对应的至少一个非检测域信息指 示所述时隙为碰撞状态时, 确定所述时隙发生资源碰撞。
9、 如权利要求 8 所述的方法, 其特征在于, 所述第一节点判断所述时隙对应的检测 域信息指示所述时隙未被第一设定跳数点占用, 且所述时隙对应的至少一个非检测域信息 指示所述时隙为碰撞状态时, 根据未指示所述时隙为碰撞状态的非检测域信息确定所述时 隙当前的时隙状态。
10、如权利要求 6所述的方法, 其特征在于, 所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示为由第一设定跳数节点占用和由第二设定跳数 范围内至少一个非所述第一设定跳数节点的其他节点占用时, 确定所述时隙发生资源碰 撞, 包括:
所述第一节点根据在当前时隙接收到的 FI, 结合本地保存的时隙状态表,
判断本地保存的时隙状态表指示所述时隙被一跳节点占用,且新接收的 FI中所述时隙 对应的时隙信息域指示所述时隙被另一两跳节点占用时, 确定所述时隙发生资源碰撞; 或 者,判断已保存的时隙占用状态表指示所述时隙被两跳节点占用,且新接收的 FI中所述时 隙对应的时隙信息域指示所述时隙被另——跳节点占用时, 确定所述时隙发生资源碰撞。
11、如权利要求 6所述的方法, 其特征在于, 所述第一节点对于非本节点占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示为由第一设定跳数节点占用和碰撞状态时, 确 定所述时隙发生资源碰撞, 包括:
所述第一节点根据在当前时隙接收到的 FI, 结合本地保存的时隙状态表, 判断本地保 存的时隙状态表指示所述时隙被一跳节点占用,且新接收的 FI中所述时隙对应的时隙信息 指示所述时隙为碰撞状态时, 确定所述时隙发生资源碰撞; 或者, 所述第一节点判断已保 存的时隙状态表指示所述时隙为碰撞状态,且新接收的 FI中所述时隙对应的时隙信息指示 所述时隙被一跳节点占用时, 确定所述时隙发生资源碰撞。
12、如权利要求 11所述的方法, 其特征在于, 所述第一节点判断已保存的时隙状态表 指示所述时隙未被一跳节点占用,且新接收的 FI中所述时隙对应的时隙信息域指示所述时 隙为碰撞状态时, 维持所述时隙原有的时隙状态不变。
13、 如权利要求 1 - 4任一项所述的方法, 其特征在于, 确定所述时隙发生资源碰撞 后, 执行以下操作:
若第一节点维护时隙状态表, 则在保存的时隙状态表中将判断为碰撞状态的时隙对应 的时隙信息单元中的时隙占用状态子单元置为碰撞状态;
若第一节点未维护时隙状态表, 则当釆用判断后的结果生成第一节点发送的 FI时,将
FI中判断为碰撞状态的时隙对应的时隙信息域中时隙占用状态子域置为碰撞状态。
14、 如权利要求 1-4任一项所述的方法, 其特征在于, 所述节点确定非本节点占用的 时隙发生资源碰撞后, 执行以下操作:
若第一节点维护时隙状态表, 则结合节点优先级信息和节点标识信息在保存的时隙状 态表中更新判断为碰撞状态的时隙对应的时隙信息单元中的节点标识子单元和优先级子 单元;
若第一节点未维护时隙状态表, 则当釆用判断后的结果生成第一节点发送的 FI时, 结 合节点优先级信息和节点标识信息确定 FI 中判断为碰撞状态的时隙对应的时隙信息域中 节点标识子域和优先级子域。
15、 如权利要求 14所述的方法, 其特征在于, 所述第一节点在本节点发送的 FI中结 合节点优先级信息和节点标识信息确定 FI 中判断为碰撞的时隙对应的时隙信息域中节点 标识子域和优先级子域, 包括:
若所述节点确定所述时隙上, 高优先级节点和低优先级节点的资源发生碰撞, 则所述 节点在 FI中发送的发生碰撞的时隙对应的时隙信息域中,将节点标识子域置为高优先级节 点对应的节点标识, 以及将优先级子域置为高优先级节点对应的优先级信息。
16、 一种资源碰撞的判定装置, 其特征在于, 包括:
通信单元, 用于接收其他节点发送的帧信息 FI;
处理单元, 用于对于非本装置占用的时隙, 根据接收到的 FI, 判断所述时隙被第一设 定跳数节点和第二设定跳数范围内至少一个非所述第一设定跳数节点的其他节点同时占 用时, 确定所述时隙发生资源碰撞。
17、 如权利要求 16 所述的装置, 其特征在于, 所述处理单元釆用的第一设定跳数节 点为一跳节点, 第二设定跳数范围为两跳范围。
18、 如权利要求 16所述的装置, 其特征在于, 所述通信单元接收到的 FI, 为从设定 时间点开始到当期时间接收的 FI, 或者, 为从当前时间往前一帧时间内接收的 FI。
19、 如权利要求 18所述的装置, 其特征在于, 所述通信单元釆用的设定时间点为本 装置确定的自占主时隙; 或者, 为本装置确定的 FI接收参考时隙; 或者, 为本装置开始监 听信道的时隙。
20、 如权利要求 16-19任一项所述的装置, 其特征在于, 所述处理单元执行所述判断 操作时, 包括:
所述处理单元在本装置确定需要发送 FI时执行所述判断操作; 或者,
所述处理单元在每次新接收到 FI时执行判断操作; 或者,
所述处理单元在接入过程中监听阶段结束时执行所述判断操作; 或者,
所述处理单元在其他设定时间点执行所述判断操作。
21、 如权利要求 16-19任一项所述的装置, 其特征在于, 所述处理单元对于非本装置 占用的时隙, 根据接收到的 FI, 判断所述时隙被第一设定跳数节点和第二设定跳数范围内 至少一个非所述第一设定跳数节点的其他节点同时占用时, 确定所述时隙发生资源碰撞, 包括:
所述处理单元对于非本装置占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示 为由第一设定跳数节点占用和由第二设定跳数范围内至少一个非所述第一设定跳数节点 的其他节点占用时, 确定所述时隙发生资源碰撞;
和 /或,
所述处理单元对于非本装置占用的时隙, 根据接收到的 FI, 确认所述时隙被分别指示 为由第一设定跳数节点占用和碰撞状态时, 确定所述时隙发生资源碰撞。
22、 如权利要求 21 所述的装置, 其特征在于, 所述处理单元对于非本装置占用的时 隙, 根据接收到的 FI, 确认所述时隙被分别指示为由第一设定跳数节点占用和由第二设定 跳数范围内至少一个非所述第一设定跳数节点的其他节点占用时, 确定所述时隙发生资源 碰撞, 包括:
所述处理单元根据在非本装置占用的时隙内接收到的 FI, 判断所述时隙对应的检测域 信息指示所述时隙由第一设定跳数节点占用, 且所述时隙对应的至少一个非检测域信息指 示所述时隙被第二设定跳数范围内非所述第一设定跳数节点的另一节点占用时, 确定所述 时隙发生资源碰撞。
23、 如权利要求 22 所述的装置, 其特征在于, 所述处理单元对于非本装置占用的时 隙,根据接收到的 FI,确认所述时隙被分别指示为由第一设定跳数节点占用和碰撞状态时, 确定所述时隙发生资源碰撞, 包括:
所述处理单元根据在非本装置占用的时隙内接收到的 FI, 判断所述时隙对应的检测域 信息指示所述时隙被第一设定跳数节点占用, 且所述时隙对应的至少一个非检测域信息指 示所述时隙为碰撞状态时, 确定所述时隙发生资源碰撞。
24、 如权利要求 23 所述的装置, 其特征在于, 所述处理单元判断所述时隙对应的检 测域信息指示所述时隙未被第一设定跳数点占用, 且所述时隙对应的至少一个非检测域信 息指示所述时隙为碰撞状态时, 根据未指示所述时隙为碰撞状态的非检测域信息确定所述 时隙当前的时隙状态。
25、 如权利要求 21 所述的装置, 其特征在于, 所述处理单元对于非本装置占用的时 隙, 根据接收到的 FI, 确认所述时隙被分别指示为由第一设定跳数节点占用和由第二设定 跳数范围内至少一个非所述第一设定跳数节点的其他节点占用时, 确定所述时隙发生资源 碰撞, 包括:
所述处理单元根据在当前时隙接收到的 FI, 结合本地保存的时隙状态表,
判断本地保存的时隙状态表指示所述时隙被一跳节点占用,且新接收的 FI中所述时隙 对应的时隙信息域指示所述时隙被另一两跳节点占用时, 确定所述时隙发生资源碰撞; 或 者,判断已保存的时隙占用状态表指示所述时隙被两跳节点占用,且新接收的 FI中所述时 隙对应的时隙信息域指示所述时隙被另——跳节点占用时, 确定所述时隙发生资源碰撞。
26、 如权利要求 21 所述的装置, 其特征在于, 所述处理单元对于非本装置占用的时 隙,根据接收到的 FI,确认所述时隙被分别指示为由第一设定跳数节点占用和碰撞状态时, 确定所述时隙发生资源碰撞, 包括:
所述处理单元根据在当前时隙接收到的 FI, 结合本地保存的时隙状态表, 判断本地保 存的时隙状态表指示所述时隙被一跳节点占用,且新接收的 FI中所述时隙的时隙信息指示 所述时隙为碰撞状态时, 确定所述时隙发生资源碰撞; 或者, 所述处理单元判断已保存的 时隙状态表指示所述时隙为碰撞状态,且新接收的 FI中所述时隙的时隙信息指示所述时隙 被一跳节点占用时, 确定所述时隙发生资源碰撞。
27、 如权利要求 26 所述的装置, 其特征在于, 所述处理单元判断已保存的时隙状态 表指示所述时隙未被一跳节点占用,且新接收的 FI中所述时隙对应的时隙信息域指示所述 时隙为碰撞状态时, 维持所述时隙原有的时隙状态不变。
28、 如权利要求 16-19任一项所述的装置, 其特征在于, 所述处理单元确定所述时隙 发生资源碰撞后, 执行以下操作:
若处理单元维护时隙状态表, 则在保存的时隙状态表中将判断为碰撞状态的时隙对应 的时隙信息单元中的时隙占用状态子单元置为碰撞状态;
若处理单元未维护时隙状态表, 则当釆用判断后的结果生成单元发送的 FI时, 将 FI 中判断为碰撞状态的时隙对应的时隙信息域中时隙占用状态子域置为碰撞状态。
29、 如权利要求 16-19任一项所述的装置, 其特征在于, 所述处理单元确定非本装置 占用的时隙发生资源碰撞后, 执行以下操作:
若所述处理单元维护时隙状态表, 则结合节点优先级信息和节点标识信息在保存的时 隙状态表中更新判断为碰撞状态的时隙对应的时隙信息单元中的节点标识子单元和优先 级子单元;
若所述处理单元未维护时隙状态表, 则当釆用判断后的结果生成单元发送的 FI时, 结 合节点优先级信息和节点标识信息确定 FI 中判断为碰撞状态的时隙对应的时隙信息域中 节点标识子域和优先级子域。
30、 如权利要求 29所述的装置, 其特征在于, 所述处理单元在本装置发送的 FI中结 合节点优先级信息和节点标识信息确定 FI 中判断为碰撞的时隙对应的时隙信息域中节点 标识子域和优先级子域, 包括:
若所述处理单元确定所述时隙上, 高优先级节点和低优先级节点的资源发生碰撞, 则 所述节点在 FI中发送的发生碰撞的时隙对应的时隙信息域中,将节点标识子域置为高优先 级节点对应的节点标识, 以及将优先级子域置为高优先级节点对应的优先级信息。
PCT/CN2013/072473 2012-04-12 2013-03-12 一种资源碰撞的判定方法和装置 WO2013152649A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210107002.1A CN103379650B (zh) 2012-04-12 2012-04-12 一种资源碰撞的判定方法和装置
CN201210107002.1 2012-04-12

Publications (1)

Publication Number Publication Date
WO2013152649A1 true WO2013152649A1 (zh) 2013-10-17

Family

ID=49327071

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/072473 WO2013152649A1 (zh) 2012-04-12 2013-03-12 一种资源碰撞的判定方法和装置

Country Status (2)

Country Link
CN (1) CN103379650B (zh)
WO (1) WO2013152649A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104581819A (zh) * 2013-10-25 2015-04-29 电信科学技术研究院 一种时隙资源碰撞的确定方法及装置
CN109219144A (zh) * 2018-11-09 2019-01-15 北京通广龙电子科技有限公司 无线Ad-hoc网络分布式资源分配的方法
CN109548156A (zh) * 2018-12-24 2019-03-29 西安空间无线电技术研究所 一种单信道时分多址星簇自组网时隙资源分配方法

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103684645B (zh) * 2012-09-07 2017-11-21 大唐电信科技产业控股有限公司 一种时隙碰撞的处理方法及装置
CN105450700B (zh) * 2014-08-26 2019-04-19 大唐电信科技产业控股有限公司 一种分布式资源分配方法和节点设备
CN105450334B (zh) * 2014-08-26 2018-08-07 大唐电信科技产业控股有限公司 一种车联网系统中的数据发送方法和节点设备
CN105430749B (zh) * 2014-09-18 2019-04-02 电信科学技术研究院 一种时隙选择的方法及装置
CN105991207B (zh) * 2015-03-06 2018-12-11 大唐电信科技产业控股有限公司 一种时隙资源选择方法和装置
WO2021128039A1 (zh) * 2019-12-25 2021-07-01 鹤壁天海电子信息系统有限公司 一种基于无中心自组网的语音会议的通信方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101282256A (zh) * 2007-04-06 2008-10-08 华为技术有限公司 在无线网状网中建立时隙的方法及节点
CN101286192A (zh) * 2008-06-05 2008-10-15 复旦大学 适用于动态环境的时隙aloha防碰撞算法
CN101360339A (zh) * 2008-09-28 2009-02-04 熊猫电子集团有限公司 融合时分同步码分多址蜂窝网与自组网的接入控制方法
CN101657030A (zh) * 2008-12-19 2010-02-24 重庆邮电大学 基于IEEE802.16 Mesh网络的三次握手方法
KR101032604B1 (ko) * 2010-10-28 2011-05-06 삼성탈레스 주식회사 분산된 TDMA Ad-hoc 네트워크에서 데이터 슬롯 예약 방법

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101282256A (zh) * 2007-04-06 2008-10-08 华为技术有限公司 在无线网状网中建立时隙的方法及节点
CN101286192A (zh) * 2008-06-05 2008-10-15 复旦大学 适用于动态环境的时隙aloha防碰撞算法
CN101360339A (zh) * 2008-09-28 2009-02-04 熊猫电子集团有限公司 融合时分同步码分多址蜂窝网与自组网的接入控制方法
CN101657030A (zh) * 2008-12-19 2010-02-24 重庆邮电大学 基于IEEE802.16 Mesh网络的三次握手方法
KR101032604B1 (ko) * 2010-10-28 2011-05-06 삼성탈레스 주식회사 분산된 TDMA Ad-hoc 네트워크에서 데이터 슬롯 예약 방법

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104581819A (zh) * 2013-10-25 2015-04-29 电信科学技术研究院 一种时隙资源碰撞的确定方法及装置
CN109219144A (zh) * 2018-11-09 2019-01-15 北京通广龙电子科技有限公司 无线Ad-hoc网络分布式资源分配的方法
CN109219144B (zh) * 2018-11-09 2022-11-11 北京通广龙电子科技有限公司 无线Ad-hoc网络分布式资源分配的方法
CN109548156A (zh) * 2018-12-24 2019-03-29 西安空间无线电技术研究所 一种单信道时分多址星簇自组网时隙资源分配方法
CN109548156B (zh) * 2018-12-24 2022-12-27 西安空间无线电技术研究所 一种单信道时分多址星簇自组网时隙资源分配方法

Also Published As

Publication number Publication date
CN103379650B (zh) 2016-04-20
CN103379650A (zh) 2013-10-30

Similar Documents

Publication Publication Date Title
WO2013152649A1 (zh) 一种资源碰撞的判定方法和装置
JP4845871B2 (ja) 通信システム
JP5149908B2 (ja) 動的自動再構成可能な時分割多元接続
CN102026297B (zh) 信道协商方法、系统和节点
CN108093469B (zh) 基于tdma的无线传输系统的分布式接入方法
WO2014075555A1 (zh) 一种时隙资源的调度方法及装置
JP2012095273A (ja) ワイヤレス通信ネットワークに用いられる通信方法及びノード
KR20090107031A (ko) 무선 메쉬 네트워크에서의 정체 관리 방법
JP2007266697A (ja) 無線通信方法、無線通信装置、および無線通信プログラム
WO2013163918A1 (zh) 一种fi消息的传输方法及装置
WO2014079308A1 (zh) 一种时隙资源占用处理方法及装置
CN103248463B (zh) 一种传输帧信息的方法及设备
WO2014036964A1 (zh) 一种多时隙或子帧资源的处理方法及装置
US8717991B2 (en) Apparatus and method for operating multi-channel based on wireless access in vehicular environments
WO2014180151A1 (zh) 时隙状态更新方法和设备
CN104618245A (zh) 基于簇首协调的mac/路由一体化自组织网络设计方法
WO2016041420A1 (zh) 一种时隙选择的方法及装置
CN111836312B (zh) 一种基于竞争的资源预约方法和设备
WO2015165355A1 (zh) 一种时隙状态维护方法和装置
US20110206033A1 (en) Communication method between wireless nodes
EP2256993A1 (en) Method for accessing a communication channel for communication networks
Cozzetti et al. RR-Aloha+: A slotted and distributed MAC protocol for vehicular communications
CN104581819A (zh) 一种时隙资源碰撞的确定方法及装置
Joe et al. Reservation csma/ca for multimedia traffic over mobile ad-hoc networks
WO2013152650A1 (zh) 一种帧信息fi消息的传输方法及装置

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

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

Country of ref document: EP

Kind code of ref document: A1