WO2014075556A1 - 一种时隙资源的碰撞处理方法及装置 - Google Patents
一种时隙资源的碰撞处理方法及装置 Download PDFInfo
- Publication number
- WO2014075556A1 WO2014075556A1 PCT/CN2013/086272 CN2013086272W WO2014075556A1 WO 2014075556 A1 WO2014075556 A1 WO 2014075556A1 CN 2013086272 W CN2013086272 W CN 2013086272W WO 2014075556 A1 WO2014075556 A1 WO 2014075556A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- time
- time slot
- data packet
- data packets
- node
- Prior art date
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 49
- 230000005540 biological transmission Effects 0.000 claims description 173
- 230000008569 process Effects 0.000 claims description 29
- 238000012545 processing Methods 0.000 claims description 23
- 238000004891 communication Methods 0.000 claims description 11
- 230000004044 response Effects 0.000 claims 1
- 238000005516 engineering process Methods 0.000 abstract description 3
- 230000001174 ascending effect Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 9
- 238000012423 maintenance Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 6
- 238000007726 management method Methods 0.000 description 5
- 230000007246 mechanism Effects 0.000 description 5
- 238000001514 detection method Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 230000001960 triggered effect Effects 0.000 description 3
- 235000008694 Humulus lupulus Nutrition 0.000 description 2
- 238000013468 resource allocation Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
Definitions
- the present application relates to network management technologies, and in particular, to a collision processing method and apparatus for time slot resources. Background technique
- DSRC Dedicated Short Range Communications
- the MS-ALOHA (Mobile Slotted Aloha) mechanism is a DSRC MAC (Medium Access Control) layer access and resource allocation mechanism based on time-sharing.
- the resource allocation is based on the ⁇ structure with slot. (time slot) is a unit. Referring to Figure 1, each N slots form a frame (denoted as Frame), and the slot number in each frame is 0 N-1, which cycles back and forth between frames. Only one vehicle is allowed to be sent in each slot, that is, TDMA (Time Division Multiple Access) mode between vehicles. The vehicle not only transmits the data of the application layer in the occupied time slot, but also needs to send FI (Frame Information), which indicates the occupation status of each slot in a frame, for example, a possible FI.
- FI Full Access 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 occupied time slot resource, then Data can always be transmitted using occupied time slots 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 slot occupancy status information of the time slot is given to each time slot, and the STI (Source Temporary Identifier) corresponding to the time slot node may be A node identifier, a priority state of a node occupying a time slot (which may also be considered as a priority state corresponding to data that the slot node transmits in the time slot); wherein the slot occupancy state information may express the fourth slot Occupancy status: (00) indicates that the time slot is idle, and (10) indicates that the time slot has been occupied by other nodes that are one hop away from the node (the cylinder is called a hop node) or the node is occupied, (11) indicates The time slot has been occupied by other nodes that are two hops away from the node (referred to as two-hop nodes), and (01) indicates that the time slot has been occupied by two or more other nodes, that is, collision ; Non-self in the time slot occupied by each node hop by listening to neighboring transmitting no
- 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 Under the MS-ALOHA mechanism, during the maintenance of the occupied time slot, the node needs to maintain a (N-1) *N slot state cache table for storing the FI message sent by the neighboring node received on the corresponding time slot.
- the slot information field of each slot carried in.
- the dimension of the slot state cache table shown in FIG. 3 is N*N-dimensional. Since the FI message sent by the node itself in the occupied slot does not need to be stored, the node actually maintains the time.
- the slot state buffer table is N-1 lines (assuming each node occupies only one time slot), and the (N-1) * slot state cache table described in the subsequent content of the present application refers to not storing the slot occupied by the node itself.
- the time slot information of the FI wherein the detection field corresponding to the time slot refers to the time slot information field corresponding to the time slot in the FI message sent in the time slot, which is called the "detection domain" of the time slot, and the "non-detection domain"
- the time slot information field corresponding to the time slot in the FI that is not occupied by the time slot is referred to as a non-detection domain of the time slot. Where default is the default.
- the node When receiving a FI message on a time slot, the node always overwrites the information content of the row corresponding to the time slot in the slot state buffer table with the slot information content carried in the newly received FI message (ie, covers one frame period before Recorded content).
- the specific process is as follows:
- 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 maintenance is successful and the occupied state of each time slot of the time slot is not occupied by itself.
- the node fills in the fields of the row corresponding to the time slot in the time slot state cache table. The default value.
- the Default value is currently processed in the idle state (00). Of course, other processing methods can also be defined. Under the MS-ALOHA mechanism, any node can determine that a time slot resource collides with the following two situations: 1) The time slot resources occupied by the node itself collide.
- One or more slots in the slot information corresponding to the N-1 element indicate that the 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 time slot (including the other node in the slot information corresponding to the local node and the N-1 element indicating the same time slot as the own node).
- One or more slots in the slot information corresponding to the N-1 element 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.
- the highest priority but not the only highest priority node among all the nodes of the time slot (including the other node in the slot information corresponding to the local node and the N-1 element indicating the same time slot as the local node) (since only 4) Priority levels, so multiple nodes with the same priority level may appear).
- 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.
- the embodiment of the present invention provides a collision processing method and device for a time slot resource, which is used to ensure that a newly applied time slot resource satisfies a transmission delay requirement of a data packet when a time slot resource collides in the vehicle network.
- a method for colliding a time slot resource includes:
- the first node saves the new data packet by receiving a new data packet sent by the upper layer, and maintains the remaining transmission time of the new data packet according to the sending delay corresponding to the new data packet;
- the first node determines the set data packet in the saved data packet
- the first node starts from the set data packet in the saved data packet, and sequentially performs time slot resource determination for each data packet according to the order of the remaining time of transmission, wherein, determining any one of the data packets When the number of data packets to be transmitted is greater than the number of time slots for which the first node does not collide, the new time slot resource is requested based on the remaining transmission time of the any one of the data packets.
- a collision processing device for a time slot resource includes:
- a communication unit configured to save the new data packet by receiving a new data packet sent by a high layer, and maintain a remaining time of sending the new data packet according to a sending delay corresponding to the new data packet;
- a determining unit configured to determine, according to the received FI sent by another node, a set of data packets in the saved data packet when the time slot used by the slot is determined to be collided;
- a main control unit configured to start, in the saved data packet, from the set data packet, perform slot resource determination for each data packet in an order from small to large, in which the remaining time is determined, where When the number of data packets to be transmitted is greater than the number of time slots for which the first node is currently not used for the remaining time of transmission of a data packet, a new time slot resource is requested based on the remaining transmission time of the any one of the data packets.
- a collision processing device for a time slot resource includes:
- a processor configured to save a new data packet to a memory by receiving a new data packet sent by a high layer, and maintain a remaining time of sending the new data packet according to a sending delay corresponding to the new data packet, and according to
- the set data packet is determined in the saved data packet, and the saved data packet starts from the set data packet.
- the slot resource determination is performed for each data packet in turn, wherein, in determining the remaining transmission time corresponding to any one of the data packets, the number of data packets to be sent is greater than the current use of the first node.
- Memory for storing data.
- the time slot collision processing method in the vehicle networking is redesigned, and the set data packet is proposed when the node determines that the time slot resource used by the node (including the self-occupied time slot and the application time slot) collides.
- time slot resource determination is performed on each data packet in the transmission buffer according to the order of increasing the remaining time of transmission, and the number of data packets to be transmitted is greater than the current use of the first node in determining the remaining transmission time corresponding to any one of the data packets.
- a new time slot resource is requested based on the remaining time of transmission of the arbitrary one of the data packets.
- FIG. 1 is a schematic view of a super-twisted structure in the background art
- FIG. 2 is a schematic view showing a FI structure of the background art
- FIG. 3 is a schematic diagram of a time slot state cache table in the background art and the embodiment of the present application;
- FIG. 4 is a schematic diagram of a time slot state vector (table) in the embodiment of the present application.
- FIG. 5 is a schematic diagram of a slot type in an embodiment of the present application.
- FIG. 6 is a flowchart of a time slot resource collision processing performed by a first node according to an embodiment of the present application
- FIG. 7 and FIG. 8 are schematic diagrams showing an example of scheduling two time slot resources in the embodiment of the present application.
- FIG. 9 is a schematic structural diagram of a function of a first node in an embodiment of the present application.
- FIG. 10 is a schematic structural diagram of a first node device according to an embodiment of the present application. detailed description
- the manner in which each node maintains the FI of each time slot in the frame can be classified into the following two types:
- the first maintenance mode is as follows:
- the FI is saved in an accumulated manner. That is, in one frame period, the node receives the FI sent by other nodes in the time slot occupied by other nodes, and obtains the slot state information of each time slot by analyzing the saved FI, as shown in FIG. 3 .
- the second maintenance method is: Save the FI in an iterative manner. That is, the node only stores a vector about the current occupied state of each time slot, which is called a slot state vector (also called a slot state table), which is hereinafter referred to as a slot state vector (table), a possible slot state vector. (Table)
- a slot state vector also called a slot state table
- table a possible slot state vector.
- Table As shown in FIG. 4, when the node receives the FI sent by the other node, each time slot in the locally saved slot state vector (table) is obtained according to the slot information field corresponding to each slot in the newly received FI. The corresponding slot information unit is updated, and the slot information is maintained by maintaining the slot status vector (table). Festival When the FI needs to send its own FI, it will generate the FI to be sent according to the information in the saved slot status vector (table). The above description is only for the convenience of subsequent description. Of course, other methods can also be used. Description method.
- one node may occupy multiple time slot resources, and when the node occupies multiple time slot resources, in order to maintain multiple time slot resources occupied by the node, the time associated with the node.
- the gaps are divided into the following categories (see Figure 5 for details):
- a self-occupied time slot is defined in the embodiment of the present application.
- the time slot in which the node successfully occupies the FI and/or the data packet is a self-occupied time slot of the node, that is, only when the node sends the FI and/or in the corresponding time slot.
- the data packet then the node starts from transmitting the FI and/or data packet in the time slot, until the node releases the time slot, and considers the time slot as its own self-occupied time slot.
- the self-occupied time slots of the nodes can be further divided into the following two types:
- Self-occupied master time slot A specific time slot in a self-occupied time slot of a node. Each node can determine a time slot in the self-occupied time slot as its own primary time slot. The node performs slot management operations in the primary time slot.
- Self-occupied time slot In the self-occupied time slot, the nodes other than the main time slot occupy other self-occupied time slots. The node performs only FI and/or data transmission on the self-occupied time slot, and does not perform operations such as slot management and slot status vector (table) clearing.
- the node may also not make the above distinction for the self-occupied time slot.
- Application time slot The MAC layer compares the data volume of the high-level data packet to be sent in the buffer queue and the transmission capacity of the node's self-occupied time slot or the use time slot (including the application time slot), if the data of the data packet.
- the new time slot is applied when the amount is greater than the self-occupied time slot or the transmission capacity that can be increased by using the time slot (including the application time slot).
- the application time slot can be converted into a self-occupied time slot only after the node determines to use the application time slot to send a data packet or after using the application time slot to send a data packet;
- time slot resources occupied by the nodes can also be divided in the following manner:
- Nodes use time slots: For the convenience of subsequent description, the time slots occupied by the nodes and the time slots that the nodes are applying for are collectively referred to as the node usage time slots. In some specific scenarios, a node may also use a time slot to include only time slots occupied by the node.
- Non-node use time slot All other time slots except the node use time slot in all time slots in the frame.
- a corresponding transmission delay is associated with each data packet, and different data packets may correspond to different transmission delays, and each of the first nodes receives one.
- the data packet will be set according to the delay requirement of the data packet.
- the timer expires, it is the time when the maximum transmission delay is reached, and the corresponding data packet must be sent before this time. Since the time is constantly changing, the duration of the timer maintained by each packet is also decreasing. In this embodiment, for any one of the data packets, the latest delay from the current time to the transmission delay of the data packet is corresponding.
- the length of time between transmission time points called the remaining time of transmission of any one of the data packets
- the data packets in the buffer usually correspond to different transmission remaining times, and the timer corresponding to each data packet is used to indicate the remaining time of transmission of the corresponding data packet. If the packet fails to be sent before the corresponding timer expires, the packet is discarded.
- Step 600 The first node saves a new data packet by receiving a new data packet sent by the upper layer. And maintaining the remaining transmission time of the new data packet according to the transmission delay corresponding to the new data packet.
- the first node sequentially receives the data packet sent by the upper layer according to the set order, and each time a new data packet is received, the first node saves the new data packet to the local MAC cache, and according to The transmission delay corresponding to the new data packet sets a timer associated with the new data packet, and the timer maintains the remaining transmission time of the new data packet.
- Step 610 The first node determines, according to the received FI sent by other nodes, that the time slot used by the first node collides, and determines the set data packet in the saved data packet.
- step 600 and step 610 are two mutually independent operation processes, which are triggered by different events (step 600 is triggered by receiving a high-level data packet; step 610 is triggered by receiving FI sent by other nodes), and the execution process is performed. There is no relationship.
- the first node may perform collision judgment on the time slot used by itself by using, but not limited to: the self-occupied time slot collision determination mode: if the first node determines the self-occupation time according to the received FI sent by other nodes If the slot is occupied by other nodes (such as one-hop node occupancy, two-hop node occupancy, three-hop node occupancy, ...) or collision, it is determined that the self-occupied time slot has collided.
- the self-occupied time slot collision determination mode if the first node determines the self-occupation time according to the received FI sent by other nodes If the slot is occupied by other nodes (such as one-hop node occupancy, two-hop node occupancy, three-hop node occupancy, ...) or collision, it is determined that the self-occupied time slot has collided.
- the newly applied time slot collision judgment mode Before the new application time slot arrives, if the first node determines, according to the received FI sent by other nodes, the newly applied time slot is occupied by other nodes (for example, one-hop node occupation, two-hop node) If the occupancy, the three-hop node occupancy, ...) or a collision occurs, it is determined that the newly applied time slot has collided.
- the first node when the first node determines the specific location of the set data packet in the data packet that exists in the ⁇ , the first node may adopt the following two modes: The node determines that the data packet with the smallest remaining time in the MAC buffer is the data packet set as described above.
- the second mode is: the first node determines, in the MAC cache, that the data packet with the smallest remaining transmission time starts, and the N+1 data packets arranged in the order of increasing the remaining time of transmission are the set data packets, where N is a slave packet.
- Step 620 The first node starts from the set data packet in the saved data packet, according to the remaining time of sending In the order of small to large, the slot resource determination is performed for each data packet in turn, wherein, in determining the remaining transmission time corresponding to any one of the data packets, the number of data packets to be transmitted is greater than the current collision of the first node. When the number of slots is exceeded, a new slot resource is requested based on the remaining transmission time of any one of the packets.
- the FI may also have other names, such as SI (slot information).
- SI slot information
- the first node is in the MAC cache. , starting from the time when the data packet with the smallest remaining time is transmitted, the time slot resource determination is performed for each data packet in the order of increasing the remaining time of the transmission.
- the first node After the first node determines the set data packet by using the second method, the first node starts from N 1 data packets in the MAC cache, and sequentially performs time slot resources for each data packet according to the order of increasing the remaining time of transmission. determination. This is because, from the beginning of the data packet with the smallest transmission time to the Nth data packet, the data packet of this part can be guaranteed to pass through the time slot that the first node can use from the current time to the time slot where the collision occurred. Transmission, therefore, in order to save computation and improve collision processing efficiency, the first node can directly perform slot resource determination from N + 1 data packets.
- the slot resource determination mentioned in the above two manners refers to: determining whether the number of data packets to be sent is greater than the number of timeslots currently used by the first node that have not collided, if yes, Then, a new time slot resource is requested based on the remaining transmission time of the data packet; otherwise, the next data packet in the MAC buffer is read to continue the time slot resource determination.
- the first node when the first node applies for a new slot resource based on the remaining transmission time of any one of the data packets (hereinafter referred to as the data packet X), the first node may first determine according to the remaining transmission time of the data packet X.
- the gap resource application interval, the application interval includes a duration from the current time to the end of the transmission of the packet X, and then the first node selects an appropriate time slot as the new application slot in the determined application interval.
- the first node determines the transmission corresponding to the data packet X from the current time according to the locally maintained slot state information (that is, the locally maintained slot state cache table or the slot state vector). Whether there is a free time slot in the system before the end of the remaining time; if yes, a time slot is randomly selected in the idle time slot as the newly applied time slot, and the newly applied time slot is used to transmit the data packet X; otherwise, it may be adopted Three processing methods, one is to discard the data packet X, one is to put the data packet X in the buffer and terminate the application of the time slot process (that is, the application caused by the time slot resource determination for the data packet X) The time slot process continues to determine the time slot resource for the next data packet.
- the locally maintained slot state information that is, the locally maintained slot state cache table or the slot state vector.
- the last one is to select a low priority data from the saved data packet that has a remaining time lower than the data packet X and has a lower priority than the data packet X.
- Packet, and the selected low priority data packet is deleted from the cache, preferably, when there are multiple low priority data packets whose remaining time is lower than the data packet X and the priority is lower than the data packet X , in which the lowest priority packet is sent The smallest (or largest) packet with the remaining time is discarded.
- the first node may set a delay margin for the packet X.
- the delay margin is a timer that sets the length of the maintenance transmission time according to the length of the transmission delay when the first node sets the length of the timer for maintaining the transmission remaining time according to the transmission delay of the data packet X. Length, but leave a certain delay margin, which is used to update the length of the timer for maintaining the remaining time according to the delay margin when the packet X cannot be successfully transmitted within the initial set transmission time, thereby increasing Packet X sends a successful chance within its latency requirements.
- the transmission success rate of different priority data packets can be guaranteed by setting a different delay margin.
- the delay margin is 20ms, then the timer length of the initial maintenance maintenance transmission time is equal to the transmission delay (100ms) minus the delay margin (20ms) is 80ms. (Note that the maintenance transmission is set here.
- the timer length of time only considers the delay margin. In the actual system, other margins may also need to be considered, such as the processing time margin of the hardware. At this time, the length of the timer for maintaining the remaining time of the transmission needs to be other.
- the margin value is also removed. For example, in addition to the 20ms delay margin, the hardware processing time margin of 5ms should be considered.
- the remaining transmission time is 75ms.
- a node updates the transmission remaining time according to the delay margin value to 100ms (ie, adds the delay margin value to the remaining time, then sets the delay margin value to 0), and then applies for a new one within the updated transmission remaining time range. Time slot resource.
- the setting method of the packet delay margin can be used in one level (the instant delay value is released once), or it can be multi-level (instant delay value is divided into multiple releases), due to the delay margin
- the setting method is not within the scope of the invention and will not be described in detail here.
- the first node may also adopt the following processing manner: update the transmission remaining time corresponding to the data packet X according to the time length indicated by the delay margin, and apply the interval determined by the updated transmission remaining time.
- the idle time slot is selected as the new application time slot. If there is still no free time slot in the updated transmission remaining time, the data packet X is discarded, and the time slot resource determination for the subsequent data packet is stopped, or the data packet X is reserved.
- Stop the time slot application process for the data packet X and continue to perform time slot resource determination for the subsequent data packet, or select one of the saved data packets from the saved data packet to be less than the data packet X and have a lower priority than the data packet X.
- Low priority packets, and the selected low priority packets are removed from the cache, preferably, when there are multiple send remaining When the time is less than X and the data packet with a low priority is lower than priority packets is packet X, in which the lowest-priority packets shortest remaining time of packet drop.
- the new time slot resource may be applied by using the foregoing method, and details are not described herein again.
- the first node needs to add the newly applied time slot to the application time slot list, and update the newly applied time slot.
- the first application scenario is as follows: Node A determines that the self-occupied time slot collides according to the FI sent by other nodes, and starts sending the data packet with the smallest remaining time from the MAC cache, according to the sequence of sending the remaining time, respectively, for each The packet begins to perform slot resource determination.
- the current time point is time slot 0 of Frame 2, and one frame contains 8 time slots, and node A occupies three time slots in one frame period: 2.
- Each data packet is stored in the transmission buffer according to the order from the upper layer to the MAC layer (in this case, not according to the data packet)
- the correspondence between the three data packets and the remaining time of transmission is as shown in Table 1.
- the slot state vector (table) currently maintained by node A is specifically as shown in Table 2.
- the occupied state of each slot in the slot state vector (table) is defined as: 10 indicates occupied by a 1-hop node; 11 indicates a two-hop node Occupied; 01 indicates a collision time slot; 00 indicates an idle time slot or is occupied by a three-hop node:
- Node A receives the FI sent by Node B in slot 1 of Frame 2 as follows:
- Node A updates the slot state vector (table) maintained by itself according to the FI sent by other nodes, as shown in Table 4: Table 4
- Node A determines that the self-occupied time slot 5 has collided according to the updated slot state vector (table), and deletes the self-occupied time slot 5 from the self-occupied slot list. At the same time, the node A starts from the data packet with the smallest remaining time in the transmission buffer, and performs time slot resource determination for each data packet in the order of increasing the transmission remaining time corresponding to the data packet, as follows:
- the process of applying for a new time slot resource is started, and the application interval of the new time slot resource is from the current time to the end of the transmission remaining time maintained by the timer corresponding to the current data packet.
- the foregoing slot resource determination is specifically:
- Node A first checks the packet b with the smallest remaining transmission time, and judges that the number of packets to be transmitted in its remaining transmission time (ie, 2 slots) is 1 (only one packet b exists), which is less than or equal to node A's current Using the number of slots 1 (ie, one slot 2), therefore, the node A performs slot resource determination on the data packet with the smallest remaining transmission time in the transmission buffer (ie, packet a);
- Node A checks the data packet a, and judges that the number of data packets to be transmitted within its transmission remaining time (ie, 5 time slots) is 2 (ie, data packet a and data packet b), which is greater than the current number of used time slots of node A. (ie, one time slot 2), therefore, node A needs to apply for a new time slot resource within the remaining time of transmission of data packet a.
- the time slot state vector (table) that the node A currently maintains locally knows that the idle time slots currently existing in the remaining transmission time of the data packet a are: time slot 3, time slot 4, and In slot 6, node A randomly selects slot 3 as the new application slot, adds the application slot slot 3 to the application slot list of node A, and then sends the smallest packet with the smallest remaining time in the transmission buffer (ie, Packet c) performing slot resource determination;
- Node A checks the data packet c and judges that the number of data packets to be transmitted in the remaining time (ie, 7 time slots) is 3 (ie, data packet, data packet b, and data packet c), which is less than or equal to the current usage of node A.
- the number of slots 3 ie, slot 2, slot 5, and slot 7
- the collision process ends and will be processed in the normal data transceiving process.
- the slot state vector (table) maintained by the node A mentioned in the embodiment of the present application may be a slot state vector (table) used by the node A in the normal update process, or may be maintained by the node A.
- slot state vector (table) for time slot resources Selected slot state vector (table) [such as "temporary slot state vector (table)” or “historical slot state vector (table), '])
- slot state vector (table) for slot resource selection may Obtained by various means, the application is not limited, as can be generated by a slot state buffer table or historical slot state information recorded by a node. It is possible to select an application by temporarily storing a slot state vector (table).
- the time slot is because, in some slot state vector (table) maintenance mode, the slot state vector (table) maintained by node A is periodically cleared.
- the slot state vector (table) is maintained in this way, After the slot state vector (table) has just been emptied, the node A finds that the slot resource used by itself has collided. At this time, since the node A cannot obtain the accurate slot occupancy information, it still performs according to the currently perceived idle slot.
- the time slot selection is applied, so that the time slots occupied by other nodes may be selected, thereby affecting the packet transmission of itself and other nodes.
- the node may transfer or partially transfer the slot state information recorded in the slot state vector (table) to the temporary slot state vector before the node resets the slot state vector (table) each time (the table).
- the slot state information in the temporary slot state vector (table) may be based on the FI or node A sent by other nodes received in the new reset period, and the slot status indication information (or capable of Other information used to determine the state of the time slot) to update, currently, may not use this information to update the temporary slot state vector (table), but to make the contents of the temporary slot state (vector) table only at each time When the gap state vector (table) is reset, it is updated according to the contents of the slot status vector (table).
- the slot state and the slot state vector reflected in the temporary slot state vector (table) (Table)
- the time slot status difference in real-time update is not very large.
- the temporary slot status table is used to apply for the time slot resource to meet the application requirements.
- the second application scenario is as follows: Node A determines that the self-occupied time slot collides according to the FI sent by other nodes, and starts from the N+1th data packet set in the MAC cache, according to the sequence of sending the remaining time. The slot resource determination is started for each data packet separately.
- the current time point is time slot 0 of Frame 2
- one frame includes 8 time slots
- node A has three used time slots in one frame period, where the time slot 2 and time slot 7 are self-occupied time slots
- time slot 5 is an application time slot.
- the slot status vector (table) currently maintained by node A is specifically as shown in Table 6.
- the occupancy status of each slot in the slot status vector (table) is defined as: 10 means occupied by 1 hop node; 11 means double hop node Occupied; 01 indicates a collision time slot; 00 indicates an idle time slot or is occupied by a three-hop node: table 5 Table 6
- Node A receives the FI sent by Node B in slot 1 of Frame 2, as shown in Table 7:
- Node A updates the slot status vector (table) maintained by itself according to the received FI, as shown in the table:
- the process of applying for a new time slot resource is started, and the application interval of the new time slot resource is from the current time to the end of the transmission remaining time maintained by the timer corresponding to the current data packet.
- the foregoing slot resource determination is specifically:
- Node A checks the data packet a, and judges that the number of data packets to be transmitted within its transmission remaining time (ie, 5 time slots) is 2 (ie, data packet a and data packet b), which is greater than the current number of used time slots of node A. (Slot 2 only), therefore, Node A needs to apply for a new slot resource for the remaining time of transmission of packet a.
- the node A is based on the locally maintained slot state vector (table) (for example, Table 8).
- the idle slots currently present in the remaining transmission time of the packet a are: slot 3, slot 4 And time slot 6, node A randomly selects time slot 3 as a new application time slot, adds the application time slot time slot 3 to the application time slot list of node A, and then sends the data packet with the smallest remaining time in the next transmission buffer ( That is, the packet c) performs slot resource determination.
- Node A checks the data packet c and judges that the number of data packets to be transmitted in the remaining time (ie, 7 time slots) is 3 (ie, data packet, data packet b, and data packet c), which is less than or equal to the current usage of node A.
- the number of slots 3 ie, slot 2, slot 5, and slot 7
- the collision process ends and will be processed in the normal data transceiving process.
- the first node includes a communication unit 90, a determining unit 91, and a main control unit 92, where
- the communication unit 90 is configured to save a new data packet by receiving a new data packet sent by a high layer, and maintain a remaining time of sending the new data packet according to a sending delay corresponding to the new data packet;
- a determining unit 91 configured to determine, according to the received FI sent by another node, a set of data packets in the saved data packet when the time slot used by the slot is determined to be collided;
- the main control unit 92 is configured to perform time slot resource determination for each data packet in order from the above-mentioned data packet in the saved data packet according to the sequence of the remaining time of the transmission, where When the number of data packets to be transmitted is greater than the number of time slots for which the first node is currently not used for the remaining time of transmission of a data packet, a new time slot resource is requested based on the remaining transmission time of any one of the foregoing data packets.
- the communication unit 90 is specifically configured to:
- the main control unit 92 is specifically configured to:
- the determining unit 91 is specifically configured to:
- the N + 1 data packets arranged in the order of increasing the remaining time of transmission are the set data packets, where N is the first collision from the current time to the backward The number of time slots that the first node can use between time slots.
- the main control unit 92 applies for a new time slot resource based on the remaining transmission time of any one of the data packets, and includes: determining an application interval based on a transmission remaining time of any one of the data packets, where the duration of the application interval is from the current time slot Start the end of the transmission to the end of any one of the data packets;
- the main control unit 92 applies for a new time slot resource in the application interval, including:
- the transmission remaining time corresponding to any one of the data packets is updated according to the time length indicated by the delay margin, and is transmitted after the update.
- the idle time slot is selected as the new application time slot in the remaining time, wherein if there is still no free time slot in the remaining time after the update, any one of the data packets is discarded, and the time slot resource determination for the subsequent data packet is stopped; or, Any one of the data packets, stopping the time slot application process for the any one of the data packets, and continuing to perform time slot resource determination for the subsequent data packets; or selecting one of the saved data packets from the saved data packet to be less than any one of the data packets and giving priority to A low priority packet with a level lower than any one of the packets, and the selected low priority packet is deleted from the cache.
- the first node device in this embodiment of the present application includes: The processor 1000 is configured to save a new data packet to the memory 1020 by receiving a new data packet sent by the upper layer by the transceiver 1010, and maintain the remaining transmission time of the new data packet according to the sending delay corresponding to the new data packet. And determining, according to the FI sent by the other node received by the transceiver 1010, that the time slot used by itself is collided, determining the set data packet in the saved data packet, and setting the above data in the saved data packet.
- the start of the data packet in the order of the remaining time of transmission, from small to large, the time slot resource determination is performed for each data packet in turn, wherein the number of data packets that need to be sent is greater than the number of times that the transmission time corresponding to any one of the data packets is determined.
- the new time slot resource is applied based on the remaining time of the transmission of any one of the foregoing data packets; the transceiver 1010 is configured to send and receive data under the control of the processor 1000;
- the memory 1020 is configured to store data.
- the processor 1000 is specifically configured to:
- a timer for maintaining a transmission remaining time associated with the new data packet according to the transmission delay wherein the remaining time of the transmission represents a duration between a current transmission time and a latest transmission time point corresponding to a transmission delay of the new data packet length.
- the processor 1000 is specifically configured to:
- the processor 1000 is specifically configured to:
- the N + 1 data packets arranged in the order of increasing the remaining time of transmission are the set data packets, where N is the first collision from the current time to the backward The number of time slots that the first node can use between time slots.
- the processor 1000 applies for a new time slot resource based on the remaining transmission time of any one of the data packets, including: determining an application interval based on a remaining time of transmission of any one of the data packets, where the duration of the application interval is from the current time slot. End of the transmission to the end of any one of the data packets;
- the processor 1000 applies for a new time slot resource in the application interval, including:
- the transmission remaining time corresponding to any one of the data packets is updated according to the time length indicated by the delay margin, and is transmitted after the update.
- the idle time slot is selected as the new application time slot in the remaining time, wherein if there is still no free time slot in the remaining time after the update, any one of the data packets is discarded, and the time slot resource determination for the subsequent data packet is stopped; or, Any one of the data packets, stopping the time slot application process for the any one of the data packets, and continuing to perform time slot resource determination for the subsequent data packets; or selecting one of the saved data packets from the saved data packet to be less than any one of the data packets and giving priority to A low priority packet with a level lower than any one of the packets, and the selected low priority packet is deleted from the cache.
- the bus architecture can include any number of interconnected buses and bridges, specifically linked by one or more processors represented by processor 1000 and various circuits of memory represented by memory 1020.
- 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 1010 can be a plurality of components, including a transmitter and a receiver, providing means for communicating with various other devices on a transmission medium.
- the processor 1000 is responsible for managing the bus architecture and the usual processing, and the memory 1020 can store data used by the processor 1000 in performing operations.
- the processor 1000 is responsible for managing the bus architecture and the usual processing, and the memory 1020 can store data used by the processor 1000 in performing operations.
- the time slot collision processing method in the Internet of Vehicles is redesigned, and when the node determines that the time slot resource used by the node (including the self-occupied time slot and the application time slot) collides, the slave setting The start of the data packet, the time slot resource determination is performed for each data packet in the transmission buffer according to the order of increasing the remaining time of the transmission, and the number of data packets to be transmitted is greater than the first time in determining the remaining transmission time corresponding to any one of the data packets.
- a new time slot resource is requested based on the remaining transmission time of the arbitrary one of the data packets.
- the newly applied time slot resource can meet the delay requirement of the high-level data packet transmission, thereby ensuring timely delivery of the message, thereby effectively ensuring The performance of the car network.
- embodiments of the present application can be provided as a method, system, or computer program product. Therefore, the present application may employ an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. The form of the case. Moreover, the application can be in the form of a computer program product embodied on one or more computer-usable storage interfaces (including but not limited to disk storage, CD-ROM, optical storage, etc.) 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)
- Mobile Radio Communication Systems (AREA)
Abstract
本申请涉及网络管理技术,特别涉及一种时隙资源的碰撞处理方法及装置。该方法为:重新设计了车联网中的时隙碰撞处理方法,提出当节点判断自身使用的时隙资源(包括自占时隙和申请时隙)发生碰撞时,从设定的数据包开始,按照发送剩余时间递增顺序,对发送缓存中的每一个数据包进行时隙资源判定,并在确定任意一个数据包对应的发送剩余时间内,需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙数目时,基于该任意一个数据包的发送剩余时间申请新的时隙资源。这样,在车联网时分***中,确定了当节点使用的时隙资源发生碰撞后,新申请的时隙资源能够满足高层数据包发送的时延要求,保证了消息的及时发送,从而有效保障的车联网的性能。
Description
一种时隙资源的碰撞处理方法及装置
本申请要求在 2012年 11月 14日提交中国专利局、 申请号为 201210457375.1、发明名 称为"一种时隙资源的碰撞处理方法及装置"的中国专利申请的优先权, 其全部内容通过引 用结合在本申请中。
技术领域
本申请涉及网络管理技术, 特别涉及一种时隙资源的碰撞处理方法及装置。 背景技术
随着车载通信***的发展和移动自组网技术的逐渐成熟, 为了实现对车辆的实时、 动 态、 智能化管理, 国际上专门开发了针对车联网的 DSRC ( Dedicated Short Range Communications, 专用短程通信)协议。 DSRC通过信息的双向传输, 将车辆与车辆、 车辆 和路側的信息采集设备有机的连接起来, 支持点对点、 点对多点通信。
MS-ALOHA ( Mobile Slotted Aloha, 移动分时隙 ALOHA )机制是一种基于分时方式 的 DSRC MAC ( Medium Access Control; 媒体接入控制)层接入和资源分配机制, 资源分 配基于桢结构以 slot(时隙)为单位。参阅图 1所示,每 N个 slot构成一个帧(记为 Frame ), 每个帧中的 slot的编号为 0 N-1 , 在帧之间循环往复。 每个 slot中只允许一个车辆进行发 送, 即车辆之间为 TDMA ( Time Division Multiple Access, 时分复用接入)模式。 车辆在 所占用的时隙上中不仅发送应用层的数据, 而且还需要发送 FI ( Frame Information, 帧信 息),在 FI中会指示一个帧中各个 slot的占用状态,例如,一种可能的 FI结构如图 2所示)。
MS-AL0HA机制的基本思想是: 任意一节点 (如, 车辆)加入网络时, 需要通过监 听帧中的空闲时隙资源占用一个时隙, 如果节点不主动放弃该所占用的时隙资源, 则可一 直使用占用的时隙传输数据, 在这期间其他节点不能使用该时隙。 在占用的时隙上, 节点 需要周期性发送 FI, FI中携带节点获得的与该节点相距两跳范围内的其他节点占用时隙的 情况, 指示节点感知到的每个时隙的占用状况信息 (也称时隙状态信息、 时隙信息), 对 每个时隙给出该时隙的:时隙占用状态信息,占用时隙的节点对应的 STI( Source Temporary Identifier, 临时资源标识)或可称为节点标识, 占用时隙的节点的优先级状态 (也可认为 是占用时隙节点在该时隙发送的数据对应的优先级状态); 其中, 时隙占用状态信息可以 表达时隙的四种占用状态: ( 00 )表示时隙为空闲状态, (10〕表示时隙已被与本节点相距 一跳的其他节点占用(筒称为一跳节点占用)或本节点占用, ( 11 )表示时隙已被与本节点 相距两跳的其他节点占用 (简称为两跳节点占用), (01 )表示时隙已被其他两个以上的节 点占用, 即为碰撞状态; 在非自身占用的时隙, 每个节点通过监听相邻一跳的节点发送的
FI, 能够判断相邻三跳范围内每个节点占用时隙的情况, 当发现本节点占用的时隙资源与 其他节点使用的资源发生碰撞时, 重新预约新的空闲时隙。 为方便后续描述, 本申请中对 FI及其内部信息内容统一采用如下描述方式:
节点发送帧信息 (FI )称为: FI消息, 也可筒称为 FI;
FI 中指示的每个时隙对应的占用状况信息称为: FI 消息中每个时隙对应的时隙信息 域;
FI 中每个时隙对应的占用状况信息中给出的三类信息 (即: 时隙占用状态、 STI、 优 先级信息)分别称为: 每个时隙的时隙信息域中包含的时隙占用状态子域、 STI 子域、 优 先级子域;
需要说明的是, 上述描述方式只是为了后续描述方便而规定, 当然也可以采用其他的 描述方式。
在 MS-ALOHA机制下, 在对占用时隙的维护过程中, 节点需要维护 ( N- 1 ) *N时隙 状态緩存表,用来存储对应时隙上接收到的相邻节点发送的 FI消息中携带的各时隙的时隙 信息域。 例如, 参阅图 3所示, 图 3中展示的时隙状态緩存表的维数为 N*N维, 由于节点 本身在所占时隙发送的 FI 消息不需要存储, 因此节点实际維护的时隙状态緩存表为 N-1 行(假设每个节点只占用一个时隙), 本申请后续内容中描述的 (N-1 ) * 时隙状态緩存 表均是指不保存节点本身占用时隙发送 FI的时隙信息; 其中, 时隙对应的检测域是指占用 该时隙发送的 FI消息中该时隙对应的时隙信息域称为该时隙的"检测域 ", "非检测域 "是指 非占用该时隙发送的 FI中该时隙对应的时隙信息域称为该时隙的非"检测域 "。其中 default 值为缺省值。
节点在一个时隙上接收到 FI消息时, 总是用新接收到的 FI消息中携带的时隙信息内 容覆盖时隙状态緩存表中对应时隙所在行的信息内容(即覆盖一个帧周期前记录的内容)。 具体过程如下:
节点在自身占用的时隙生成并发送 FI消息, 需要按照一定规则填写各个 field (域), 包括时隙占用状态子域、 STI子域以及优先级子域。 发送完毕后, 节点会清空所发送的 FI 信息。
节点在非自身占用的时隙上, 需要接收周围节点发送的 FI消息, 并根据接收到的 FI 消息更新时隙状态緩存表, 在到达本节点自身占用的时隙前判断自身占用的时隙是否维护 成功及非自身占用时隙各时隙的占用状态,其中,当在非自身占用的时隙上没有接收到 FI, 节点会将时隙状态緩存表中该时隙对应的行的各域填 default值。 Default值当前按空闲状 态 (00 ) 处理, 当然也可以定义其他处理方式。
在 MS-ALOHA机制下, 任意一节点判断时隙资源发生碰撞有以下两种情况: 1 ) 节点自身占用的时隙资源发生碰撞。
在 (N-1 ) *N时隙状态緩存表中, 节点自身占用的时隙对应的列 (N-1个元素)上所 指示的时隙信息中出现以下任意一种情况, 则认为节点自身占用的时隙发生碰撞:
a、 N-1元素对应的时隙信息中存在一个或多个指示本时隙被与节点 STI不同的其他节 点占用 (对应的时隙占用状态指示为 10 ), 且节点自身的优先级不是占用该时隙的所有节 点(包括本节点和 N-1元素对应的时隙信息中指示与本节点占用相同时隙的所有其他节点) 中最高的。
b、 N-1元素对应的时隙信息中存在一个或多个指示本时隙被与节点 STI不同的其他节 点占用 (对应的时隙占用状态指示为 10 ), 且节点的优先级为占用该时隙的所有节点 (包 括本节点和 N-1元素对应的时隙信息中指示与本节点占用相同时隙的所有其他节点)中的 最高优先级但不是唯一的最高优先级节点 (由于只有 4个优先等级, 因此可能出现优先等 级相同的多个节点)。 则节点可以选择在自身当前占用的时隙 +N上发送 FI, 在之后的流程 中, 如果再次出现这种情况, 节点可以概率 p再次在 slot p+2*N发送, 以概率(1-p )认为 发生时隙资源碰撞。
2 ) 非节点自身占用的时隙资源发生磁撞。
对于任一非节点自身占用的时隙对应的时隙状态緩存表中的 N-1个元素中, 出现了两 个及以上的时隙信息指示该时隙被两个及以上节点 (即: STI 不同) 占用 (对应时隙占用 状态指示为 10 ), 则确定该时隙资源发生碰撞。
现有技术下, 当节点判断自身占用的时隙发生资源碰撞时, 将重新发起接入过程重新 获得时隙资源。 当节点判断非自身占用的时隙资源发生碰撞时, 将在自身发送的 FI中将发 生碰撞时隙的时隙状态信息填为 (01 ), 对应的 STI填写发生碰撞的节点中优先级最高的 节点对应的 STI, 优先级信息填写优先级最高的节点的优先级; 当发生碰撞的节点优先级 相同时, 随机选一个 STI填写, 而优先级信息填写最高的优先级。
如上所述, 现有技术中, 当节点判断自身占用的时隙资源发生碰撞时, 将重新发起接 入过程重新获得时隙资源, 即监听帧中存在的空闲时隙并从中随机选择一个时隙作为自身 新申请的时隙, 然而, 这种方法却没有考虑新申请的时隙资源是否能够满足高层要发送数 据包的时延要求。
目前, 车联网短距通信应用要解决的一个主要问题是通过及时的车车、 车路通信来提 高行车安全, 行车安全类应用消息的发送时延通常有严格的发送时延要求, 如 100ms。 因 此, 当前的碰撞处理技术不能满足实际应用对数据包发送时延的要求。
发明内容
本申请实施例提供一种时隙资源的碰撞处理方法及装置, 用以在车联网中, 当时隙资 源发生碰撞时, 保证新申请的时隙资源满足数据包的发送时延要求。
本申请实施例提供的具体技术方案如下:
一种时隙资源的碰撞处理方法, 包括:
第一节点每接收到一个高层下发的新数据包, 将所述新数据包进行保存, 并根据所述 新数据包对应的发送时延维护该新数据包的发送剩余时间;
第一节点根据接收到的其他节点发送的 FI确定自身使用的时隙发生碰撞时,在已保存 的数据包中确定设定的数据包;
第一节点在已保存的数据包中从所述设定的数据包开始, 按照发送剩余时间从小到大 的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包对应的发 送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙数目 时, 基于所述任意一个数据包的发送剩余时间申请新的时隙资源。
一种时隙资源的碰撞处理装置, 包括:
通信单元, 用于每接收到一个高层下发的新数据包, 将所述新数据包进行保存, 并根 据所述新数据包对应的发送时延维护该新数据包的发送剩余时间;
确定单元, 用于根据接收到的其他节点发送的 FI确定自身使用的时隙发生碰撞时,在 已保存的数据包中确定设定的数据包;
主控单元, 用于在已保存的数据包中从所述设定的数据包开始, 按照发送剩余时间从 小到大的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包对 应的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙 数目时, 基于所述任意一个数据包的发送剩余时间申请新的时隙资源。
一种时隙资源的碰撞处理装置, 包括:
处理器, 用于通过收发机每接收到一个高层下发的新数据包, 将新数据包保存到存储 器, 并根据新数据包对应的发送时延维护该新数据包的发送剩余时间, 并根据通过收发机 接收到的其他节点发送的 FI确定自身使用的时隙发生碰撞时,在已保存的数据包中确定设 定的数据包, 在已保存的数据包中从上述设定的数据包开始, 按照发送剩余时间从小到大 的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包对应的发 送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙数目 时, 基于上述任意一个数据包的发送剩余时间申请新的时隙资源;
收发机, 用于在处理器的控制下收发数据;
存储器, 用于存储数据。
本申请实施例中, 重新设计了车联网中的时隙碰撞处理方法, 提出当节点判断自身使 用的时隙资源 (包括自占时隙和申请时隙)发生碰撞时, 从设定的数据包开始, 按照发送 剩余时间递增顺序, 对发送緩存中的每一个数据包进行时隙资源判定, 并在确定任意一个 数据包对应的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰 撞的时隙数目时, 基于该任意一个数据包的发送剩余时间申请新的时隙资源。 这样, 在车 联网时分***中, 确定了当节点使用的时隙资源发生碰撞后, 新申请的时隙资源能够满足 高层数据包发送的时延要求, 保证了消息的及时发送, 从而有效保障的车联网的性能。 附图说明
图 1为背景技术下超桢结构示意图;
图 2为背景技术下一种 FI结构见示意图;
图 3为背景技术及本申请实施例中时隙状态緩存表示意图;
图 4 为本申请实施例中时隙状态向量 (表) 示意图;
图 5为本申请实施例中时隙类型示意图;
图 6为本申请实施例中第一节点进行时隙资源碰撞处理流程图;
图 7和图 8为本申请实施例中两种时隙资源调度举例示意图;
图 9为本申请实施例中第一节点功能结构示意图;
图 10为本申请实施例第一节点设备结构示意图。 具体实施方式
本申请实施例中, 各节点对帧中各时隙的 FI的维护方式可以分为以下两类: 第一种维护方式为: 采用累积方式保存 FI。 即在一个帧周期内, 节点在其他节点占用 的时隙内接收其他节点发送的 FI, 通过对保存的 FI进行分析获得各时隙的时隙状态信息, 具体如图 3所示。
第二种维护方式为: 采用迭代方式保存 FI。 即节点仅保存一个关于各时隙当前占用状 态的向量, 称为时隙状态向量 (也可称作时隙状态表)后续称为时隙状态向量(表), 一 种可能的时隙状态向量(表)如图 4所示, 当节点接收到其他节点发送的 FI时, 根据新接 收 FI中各时隙对应的时隙信息域对本地保存的时隙状态向量(表 )中每一个时隙对应的时 隙信息单元进行更新, 通过维护时隙状态向量(表) 的方式来对时隙信息进行维护。 当节
点需发送自身判定的 FI时, 会根据保存的时隙状态向量(表) 中的信息生成要发送的 FI 需要说明的是, 上述描述方式只是为了后续描述方便而规定, 当然也可以采用其他的 描述方式。
另一方面, 本申请实施例中, 一个节点可以占用多个时隙资源, 而当节点占用多个时 隙资源时, 为了对节点占用的多个时隙资源进行维护, 将与节点相关的时隙分为以下几类 (具体参阅图 5所示):
1、 自占时隙: 本申请实施例中定义节点成功占用发送 FI和 /或数据包的时隙为节点的 自占时隙, 即: 只有当节点在对应的时隙发送了 FI和 /或数据包, 那么节点从占用该时隙 发送 FI和 /或数据包开始, 到节点释放该时隙为止, 认为该时隙为自身的自占时隙。
而具体的, 节点的自占时隙又可以进一步分为以下两种:
自占主时隙: 节点自占时隙中某个特定的时隙。 每个节点可以将自占时隙中的某个时 隙确定为自身的主时隙。 节点在主时隙时进行时隙管理操作。
自占从时隙: 自占时隙中, 除主时隙外的节点其它自占时隙。 节点在自占从时隙上只 进行 FI和 /或数据发送, 不进行时隙管理、 时隙状态向量 (表)清空等操作。
当然, 节点也可以不对自占时隙作上述区分。
2、 申请时隙: MAC层比较緩存队列中的需要发送的高层数据包的数据量和节点的自 占时隙或使用时隙 (包含申请时隙)可提供的传输容量, 如果数据包的数据量大于自占时 隙或使用时隙 (包含申请时隙) 所可以提高的传输容量时申请的新的时隙。 申请时隙只有 在节点确定使用该申请时隙发送数据包或在使用该申请时隙发送数据包后才能转换为自 占时隙;
基于上述技术定义, 节点占用的时隙资源还可以采用以下方式划分:
1 ) 节点使用时隙: 为方便后续描述, 将节点占用的时隙和节点正在申请的时隙统称 为节点使用时隙。 在一些特定场景中, 节点使用时隙也可以只包括节点占用的时隙。
2 ) 非节点使用时隙: 帧中所有时隙中除节点使用时隙以外的所有其他时隙。
下面结合附图对本申请优选的实施方式进行详细说明。
本申请实施例中, 高层在向第一节点下发数据包时, 会针对每一个数据包关联相应的 发送时延, 不同的数据包可能对应不同的发送时延, 第一节点每接收到一个数据包, 均会 根据该数据包的时延要求设置一定时器,待定时器超时时, 即是达到最大发送时延的时刻, 相应的数据包必须在这一时刻之前发送。 由于时间在不停推移, 每个数据包的定时器所维 护的时长也在不断减少, 本实施例中, 针对任意一个数据包, 将从当前时间开始到数据包 的发送时延对应的最晚发送时间点之间的时长长度, 称为该任意一个数据包的发送剩余时
间, 显然, 缓存中的数据包通常对应着不同的发送剩余时间, 每一个数据包对应的定时器 用于指示相应数据包的发送剩余时间。 如果数据包在相应的定时器超时前未能成功发送, 则丢弃该数据包。
参阅图 6所示, 本申请实施例中, 第一节点进行时隙资源碰撞处理的详细流程如下: 步骤 600: 第一节点每接收到一个高层下发的新数据包, 将新数据包进行保存, 并根 据新数据包对应的发送时延维护该新数据包的发送剩余时间。
本申请实施例中, 第一节点按照设定顺序依次接收高层下发的数据包, 每接收一个新 的数据包, 第一节点均会将该新数据包保存至本地 MAC緩存中, 同时, 根据该新数据包 对应的发送时延设置与该新数据包关联的定时器, 该定时器维护的是新数据包的发送剩余 时间。
步骤 610:第一节点根据接收到的其他节点发送的 FI确定自身使用的时隙发生碰撞时, 在已保存的数据包中确定设定的数据包。
本申请实施例中, 步骤 600和步骤 610是两个相互独立的操作过程, 受不同的事件触 发(步骤 600由接收到高层数据包触发; 步骤 610由接收其他节点发送的 FI触发), 执行 过程没有先后关系。
本实施例中, 第一节点可以采用但不限于以下方式对自身使用的时隙进行碰撞判断: 自占时隙碰撞判断方式:若第一节点根据接收到的其他节点发送的 FI确定自占时隙被 其他节点占用 (如一跳节点占用、 两跳节点占用、 三跳节点占用、 ...)或发生碰撞, 则判 定自占时隙发生了碰撞。
新申请的时隙碰撞判断方式: 在新申请的时隙到达前, 若第一节点根据接收到的其他 节点发送的 FI确定新申请的时隙被其他节点占用(如一跳节点占用、 两跳节点占用、三跳 节点占用、 ...)或发生碰撞, 则判定新申请的时隙发生了碰撞。
另一方面, 本申请实施例中, 第一节点在巳存在的数据包中确定上述设定的数据包的 具***置时, 可以采用但不限于以下两种方式: 第一种方式为: 第一节点确定 MAC緩存中发送剩余时间最小的数据包为上述设定的 数据包。
第二种方式为: 第一节点确定 MAC緩存中从发送剩余时间最小的数据包开始, 按照 发送剩余时间递增顺序排列的第 N + 1个数据包为设定的数据包, 其中, N为从当前时间 开始到向后第一个发生碰撞的时隙之间, 第一节点能够使用的时隙数目。
步骤 620: 第一节点在已保存的数据包中从设定的数据包开始, 按照发送剩余时间从
小到大的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包对 应的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙 数目时, 基于任意一个数据包的发送剩余时间申请新的时隙资源。
实际应用中, FI也可以有其他称呼, 如 SI ( slot information, 时隙信息) 本申请实施例中, 第一节点采用第一种方式确定设定的数据包后, 第一节点在 MAC 緩存中, 从发送剩余时间最小的数据包开始, 按照发送剩余时间递增的顺序, 依次对每一 个数据包进行时隙资源判定。
第一节点采用第二种方式确定设定的数据包后, 第一节点在 MAC 緩存中, 从 N 1 个数据包开始, 按照发送剩余时间递增的顺序, 依次对每一个数据包进行时隙资源判定。 这是因为, 从发送时间最小的数据包开始到第 N个数据包, 这一部分的数据包已经可以保 证通过从当前时间开始到发生碰撞的时隙之间,第一节点能够使用的时隙进行发送, 因此, 为了节省计算量, 提高碰撞处理效率, 第一节点可以直接从 N + 1个数据包开始进行时隙 资源判定。
上述两种方式中提及的时隙资源判定即是指: 判定数据包对应的发送剩余时间内, 需 要发送的数据包数 是否大于第一节点当前使用的未发生碰撞的时隙数目, 若是, 则基于 数据包的发送剩余时间申请新的时隙资源, 否则, 读取 MAC緩存中的下一个数据包继续 进行时隙资源判定。
另一方面, 本申请实施例中, 第一节点基于任意一个数据包(以下简称为数据包 X ) 的发送剩余时间申请新的时隙资源时,可以先根据数据包 X的发送剩余时间确定时隙资源 申请区间, 该申请区间包含的时长为从当前时间开始到数据包 X的发送剩余时间结束, 然 后, 第一节点在确定的申请区间中选取合适的时隙作为新的申请时隙,
例如, 本申请实施例中, 第一节点才艮据本地维护的时隙状态信息 (即本地维护的时隙 状态緩存表或时隙状态向量), 判断从当前时间开始到数据包 X对应的发送剩余时间结束 前, ***内是否存在空闲时隙; 若是, 则在空闲时隙内随机选择一个时隙作为新申请的时 隙, 该新申请的时隙用于发送数据包 X; 否则, 可以采用三种处理方式,一种是将数据包 X丢弃,一种是将数据包 X仍放在緩存中并终止本次申请时隙过程(即由对数据包 X进行 时隙资源判定而引起的申请时隙过程)继续对下一个数据包进行时隙资源判定, 最后一种 是从已保存的数据包中选取一个发送剩余时间低于数据包 X且优先级低于数据包 X的低优 先级数据包, 并将选取的低优先级数据包从緩存中删除, 较优地, 当存在多个剩余时间低 于数据包 X且优先级低于数据包 X的低优先级数据包时,将其中优先级最低的数据包中发
送剩余时间最小 (或最大) 的数据包丢弃。 需要说明的是, 为了增加数据包发送成功的机 会, 第一节点可能会为数据包 X设置时延裕量。 所谓时延裕量是指第一节点在根据数据包 X的发送时延设置维护发送剩余时间的定时器长度时, 并不是严格按照发送时延要求的长 度来设定维护发送剩余时间的定时器长度, 而是留出一定的时延裕量, 用于当数据包 X在 初始设置的发送剩余时间内不能成功发送时, 再根据时延裕量更新维护发送剩余时间的定 时器长度, 从而增加数据包 X在其时延要求范围内发送成功的机会。 特别地, 当不同数据 包对应的优先级不同时, 可以通过设置有差别的时延裕量来对不同优先等级数据包的发送 成功率进行保证。 使用时延裕量的一个例子为: 设数据包 X的发送时延为 100ms , 即要求 数据包 X在 100ms内发送出去, 根据数据包 X的优先等级(或根据其他规则)确定数据 包 X的时延裕量为 20ms, 则此时初始设置的维护发送剩余时间的定时器长度等于发送时 延( 100ms )减去时延裕量(20ms )为 80ms (需要说明的是, 这里设置维护发送剩余时间 的定时器长度仅考虑了时延裕量, 在实际***中可能还需要考虑其他裕量, 如硬件的处理 时间裕量等, 此时, 维护发送剩余时间的定时器长度中还需要把其他的裕量值也去掉, 如 除 20ms 的时延裕量外还要考虑 5ms 的硬件处理时间裕量, 此时的发送剩余时间就为 75ms )。 假设当需要在数据包 X的发送剩余时间 (80ms ) 内申请新的时隙资源时, 发现没 有空闲时隙, 而此时数据包 X的时延裕量不为 0 (为 20ms ), 则第一节点根据时延裕量值 更新发送剩余时间为 100ms (即将时延裕量值加入剩余时间中, 然后将时延裕量值置 0 ), 然后在更新后的发送剩余时间范围内申请新的时隙资源。 数据包时延裕量的设置方式, 可 以采用一级的 (即时延裕量值一次释放完), 也可以采用多级的 (即时延裕量值分多次释 放), 由于时延裕量的设置方式不属于发明范围, 这里不进行详细描述。
基于上述分析, 当为数据包 X设置了时延裕量, 且对应的时延裕量不为 0时, 如果需 要在数据包 X的发送剩余时间内申请新的时隙资源但没有空闲时隙 ,则除上述三种处理方 式外, 第一节点还可以采用以下处理方式: 根据时延裕量指示的时间长度更新数据包 X对 应的发送剩余时间, 在更新后的发送剩余时间确定的申请区间内选择空闲时隙作为新申请 时隙, 如果在更新后的发送剩余时间内仍然没有空闲时隙, 则丢弃数据包 X, 并停止针对 后续数据包进行时隙资源判定,或者,保留数据包 X,停止针对数据包 X的时隙申请过程, 并继续针对后续数据包进行时隙资源判定, 或者, 从已保存的数据包中选取一个发送剩余 时间小于数据包 X且优先级低于数据包 X的低优先级数据包,并将选取的低优先级数据包 从緩存中删除,较优地, 当存在多个发送剩余时间小于数据包 X且优先级低于数据包 X的 低优先级数据包时, 将其中优先级最低的数据包中剩余时间最短的数据包丢弃。
针对判定的任意一个数据包,均可以釆用上述方法申请新的时隙资源,在此不再赘述。
另一方面, 在空闲时隙中选取了新申请的时隙后, 第一节点需要将新申请的时隙添加到申 请时隙列表中, 并更新该新申请的时隙
下面采用几个具体的应用场景对上述实施例作出进一步的详细说明。
第一种应用场景为: 节点 A根据接收的其他节点发送的 FI判断自占时隙发生碰撞, 并从 MAC緩存中发送剩余时间最小的数据包开始, 按照发送剩余时间递增顺序, 分别针 对每一个数据包开始执行时隙资源判定。
参阅图 7所示, 本申请实施例中, 假设当前时间点为 Frame 2的时隙 0, —个 Frame 中包含 8个时隙, 节点 A在一个帧周期中占用了三个时隙: 时隙 2、 时隙 5和时隙 7。 当 前发送緩存中存在 3个待发送的数据包, 即数据包&、数据包 b和数据包 c, 各数据包按照 从高层到达 MAC层的先后次序保存在发送緩存中 (此时不是按数据包对应的发送剩余时 间排序), 三个数据包与发送剩余时间的对应关系具体如表 1所示。
节点 A当前维护的时隙状态向量(表)具体如表 2所示, 时隙状态向量(表) 中各时 隙的占用状态定义为: 10表示被 1跳节点占用; 11表示被两跳节点占用; 01表示碰撞时 隙; 00表示空闲时隙或被三跳节点占用时隙:
那么, 节点 A进行时隙资源碰撞处理的具体过程如下:
1 ): 节点 A在 Frame 2的时隙 1接收到节点 B发送的 FI如下:
3 ): 节点 A根据更新后的时隙状态向量(表)判断自占时隙时隙 5发生碰撞, 将自占 时隙时隙 5从自占时隙列表中删除。 同时, 节点 A在发送緩存中从发送剩余时间最小的数 据包开始, 按数据包对应的发送剩余时间递增的顺序依次对每一个数据包执行时隙资源判 定, 具体如下:
判断当前的数据包对应的定时器指示的发送剩余时间内, 需要发送的数据包数目是否 小于等于节点 A使用的时隙资源数目 (包括自占时隙和申请时隙)
若是, 则对发送緩存中下一个数据包进行处理;
否则, 启动申请新时隙资源的流程, 新时隙资源的申请区间为从当前时间开始到当前 数据包对应的定时器所维护的发送剩余时间结束。
在本实施例中, 上述时隙资源判定具体为:
节点 A先检查发送剩余时间最小的数据包 b, 判断在其发送剩余时间 (即 2个时隙) 内要发送的数据包数目为 1 (仅存在一个数据包 b ), 小于等于节点 A当前的使用时隙数目 1 (即一个时隙 2 ), 因此, 节点 A对发送緩存中下一个发送剩余时间最小的数据包(即数 据包 a )进行时隙资源判定;
节点 A检查数据包 a, 判断在其发送剩余时间 (即 5个时隙) 内要发送的数据包数目 为 2 (即数据包 a和数据包 b ), 大于节点 A当前的使用时隙数目 1 (即一个时隙 2 ), 因此, 节点 A需要在数据包 a的发送剩余时间内申请新的时隙资源。
此时, 节点 A 居本地当前维护的时隙状态向量(表)(如, 表 4 )可知, 当前在数据 包 a的发送剩余时间内存在的空闲时隙有: 时隙 3、 时隙 4和时隙 6, 节点 A随机选择时 隙 3作为新的申请时隙, 将申请时隙时隙 3加入节点 A的申请时隙列表, 然后对发送緩存 中下一个发送剩余时间最小的数据包(即数据包 c )进行时隙资源判定;
节点 A检查数据包 c, 判断其发送剩余时间 (即 7个时隙) 内要发送的数据包数目为 3 (即数据包 、数据包 b和数据包 c ), 小于等于节点 A当前的使用时隙数目 3 (即时隙 2、 时隙 5和时隙 7 ), 由于发送緩存中已不存在其他数据包, 因此, 此次碰撞处理过程结束, 后续将按正常的数据收发过程处理。
需要说明的是, 本申请实施例中提及的节点 A维护的时隙状态向量(表), 可以是节 点 A在正常更新过程中使用的时隙状态向量(表), 也可以是节点 A维护的用于时隙资源
选择的时隙状态向量(表)〔如 "临时时隙状态向量(表) "或 "历史时隙状态向量(表),'〕, 用于时隙资源选择的时隙状态向量 (表)可以通过各种方式获得, 本申请不进行限定, 如 可以通过时隙状态緩存表生成或由节点记录的历史时隙状态信息生成。 之所以可能通过临 时保存的时隙状态向量(表) 来选择申请时隙, 是由于在某些时隙状态向量(表)维护方 式中, 节点 A维护的时隙状态向量(表)会周期清空, 当采用这种方式维护时隙状态向量 (表〕 时, 如果在时隙状态向量(表)刚清空后, 节点 A发现自身使用的时隙资源发生碰 撞, 此时由于节点 A不能获得准确的时隙占用情况信息, 则仍会按照当前感知的空闲时隙 进行申请时隙选择, 从而可能会选择到其他节点已占用的时隙, 进而对自身和其他节点的 数据包发送造成影响。
在这种情况下, 节点可能会在节点每次重置时隙状态向量(表)之前, 将时隙状态向 量(表) 中记录的时隙状态信息转移或部分转移到临时时隙状态向量(表) 中, 临时时隙 状态向量(表)中的时隙状态信息可以根据在新的重置周期中接收到的其他节点发送的 FI 或节点 A低居递交的时隙状态指示信息(或能够用来确定时隙状态的其他信息) 来更新, 当前, 也可以不使用这些信息来更新临时时隙状态向量 (表), 而是令临时时隙状态 (向 量)表中内容仅在每次时隙状态向量(表〕 重置时, 根据时隙状态向量 (表) 中的内容来 更新。
当时隙状态向量(表)的更新周期比较短, 如 100ms, 且节点的周期性拓朴变化不是 很大时, 临时时隙状态向量(表) 中反映的时隙状态与时隙状态向量(表) 中实时更新的 时隙状态差异不会很大, 此时, 采用临时时隙状态表来进行时隙资源申请能够满足应用需 求。
第二种应用场景为: 节点 A根据接收的其他节点发送的 FI判断自占时隙发生碰撞, 且从 MAC緩存中设定的第 N + 1个的数据包开始, 按照发送剩余时间递增顺序, 分别针 对每一个数据包开始执行时隙资源判定。
参阅图 8所示, 本申请实施例中, 假设当前时间点为 Frame 2的时隙 0, —个 Frame 中包含 8个时隙, 节点 A在一个帧周期中有三个使用时隙, 其中时隙 2和时隙 7是自占时 隙, 时隙 5为申请时隙。 当前发送緩存中存在 3个待发送的数据包, 即数据包 a、 数据包 b 和数据包 c, 各数据包进入发送緩存后按发送剩余时间从小到大排序, 三个数据包与发送 剩余时间的对应关系具体如表 5所示。
节点 A当前维护的时隙状态向量(表)具体如表 6所示, 时隙状态向量(表) 中各时 隙的占用状态定义为: 10表示 被 1跳节点占用; 11表示被两跳节点占用; 01表示碰撞时 隙; 00表示空闲时隙或被三跳节点占用时隙:
表 5
表 6
1 ): 节点 A在 Frame 2的时隙 1接收到节点 B发送的 FI具体如表 7所示:
表 7
2 ): 节点 A根据接收到的 FI对自身維护的时隙状态向量 (表)进行更新, 具体如表 所示:
表 8
3 ): 节点 A根据更新后的时隙状态向量(表)判断申请时隙时隙 5被节点 C占用, 即 发生碰撞, 节点 A将申请时时隙隙 5从申请时隙列表中删除。 然后确定从当前时间开始到 发生碰撞的时隙之间节点 A可使用的时隙数 N (此时只有一个使用时隙, 即自占时隙时隙 2, N = 1 ), 节点 A从发送緩存中读取按照发送剩余时间排序后 (递增) 的第 N+1 ( N + 1 取值为 2 )个数据包, 即数据包 a, 然后, 从数据包 a开始, 按各数据包对应的发送剩余时 间递增顺序, 依次对数据包 a (包含数据包 a )之后的每一个数据包进行时隙资源判定, 具 体如下:
判断当前的数据包对应的定时器指示的发送剩余时间内, 需要发送的数据包数目是否
小于等于节点 A使用的时隙资源数目 (包括自占时隙和申请时隙)
若是, 则对发送缓存中下一个数据包进行处理;
否则, 启动申请新时隙资源的流程, 新时隙资源的申请区间为从当前时间开始到当前 数据包对应的定时器所维护的发送剩余时间结束。
在本实施例中, 上述时隙资源判定具体为:
节点 A检查数据包 a, 判断在其发送剩余时间 (即 5个时隙) 内要发送的数据包数目 为 2 (即数据包 a和数据包 b ), 大于节点 A当前的使用时隙数目 1 (仅时隙 2 ), 因此, 节 点 A需要在数据包 a的发送剩余时间内申请新的时隙资源。
此时, 节点 A才 据本地当前维护的时隙状态向量(表)(如, 表 8 )可知, 当前在数据 包 a的发送剩余时间内存在的空闲时隙有: 时隙 3、 时隙 4和时隙 6, 节点 A随机选择时 隙 3作为新的申请时隙, 将申请时隙时隙 3加入节点 A的申请时隙列表, 然后对发送緩存 中下一个发送剩余时间最小的数据包(即数据包 c )进行时隙资源判定。
节点 A检查数据包 c, 判断其发送剩余时间 (即 7个时隙) 内要发送的数据包数目为 3 (即数据包 、数据包 b和数据包 c ), 小于等于节点 A当前的使用时隙数目 3 (即时隙 2、 时隙 5和时隙 7 ), 由于发送緩存中已不存在其他数据包, 因此, 此次碰撞处理过程结束, 后续将按正常的数据收发过程处理。
基于上述实施例, 参阅图 9所示, 本申请实施例中, 第一节点包括通信单元 90、 确定 单元 91和主控单元 92, 其中,
通信单元 90, 用于每接收到一个高层下发的新数据包, 将新数据包进行保存, 并根据 新数据包对应的发送时延维护该新数据包的发送剩余时间;
确定单元 91 , 用于根据接收到的其他节点发送的 FI确定自身使用的时隙发生碰撞时, 在已保存的数据包中确定设定的数据包;
主控单元 92, 用于在已保存的数据包中从上述设定的数据包开始, 按照发送剩余时间 从小到大的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包 对应的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时 隙数目时, 基于上述任意一个数据包的发送剩余时间申请新的时隙资源。
较佳地, 通信单元 90具体用于:
接收到新数据包后, 确定对应新数据包预设的发送时延;
根据发送时延设置与新数据包关联的用于维护发送剩余时间的定时器, 其中, 发送剩 余时间表征从当前时间开始到新数据包的发送时延对应的最晚发送时间点之间的时长长 度。
较佳地, 主控单元 92具体用于:
若根据接收到的其他节点发送的 FI确定自占时隙被其他节点占用或发生碰撞,则判定 自占时隙发生了碰撞;
在新申请的时隙到达前,若根据接收到的其他节点发送的 FI确定新申请的时隙被其他 节点占用或发生碰撞, 则判定新申请的时隙发生了碰撞。
较佳地, 确定单元 91具体用于:
确定发送剩余时间最小的数据包为设定的数据包; 或者,
确定从发送剩余时间最小的数据包开始, 按照发送剩余时间递增顺序排列的第 N + 1 个数据包为设定的数据包,其中, N为从当前时间开始到向后第一个发生碰撞的时隙之间, 第一节点能够使用的时隙数目。
较佳地, 主控单元 92基于任意一个数据包的发送剩余时间申请新的时隙资源, 包括: 基于任意一个数据包的发送剩余时间确定申请区间, 该申请区间对应的时长为从当前 时隙开始到任意一个数据包的发送剩余时间结结束;
在申请区间内申请新的时隙资源。
较佳地, 主控单元 92在申请区间内申请新的时隙资源, 包括:
根据本地维护的时隙状态信息, 判断任意一个数据包对应的申请区间内 , ***是否存 在空闲时隙;
若是, 则在空闲时隙内选择一个时隙作为新申请的时隙;
否则, 丢弃任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留任意一个数据包, 停止针对该任意一个数据包的时隙申请过程 , 并继续针对后续 数据包进行时隙资源判定; 或者,
从已保存的数据包中选取一个发送剩余时间小于任意一个数据包且优先级低于任意 一个数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删除; 或者,
当对应任意一个数据包设定了时延裕量且该时延裕量不为 0时, 根据时延裕量指示的 时间长度更新任意一个数据包对应的发送剩余时间, 并在更新后的发送剩余时间内选择空 闲时隙作为新申请时隙, 其中, 若更新后的剩余时间内仍然没有空闲时隙, 则丢弃任意一 个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留任意一个数据包, 停止 针对该任意一个数据包的时隙申请过程 , 并继续针对后续数据包进行时隙资源判定; 或者 从已保存的数据包中选取一个发送剩余时间小于任意一个数据包且优先级低于任意一个 数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删除。
如图 10所示, 本申请实施例第一节点设备包括:
处理器 1000, 用于通过收发机 1010每接收到一个高层下发的新数据包, 将新数据包 保存到存储器 1020, 并根据新数据包对应的发送时延维护该新数据包的发送剩余时间, 并 根据通过收发机 1010接收到的其他节点发送的 FI确定自身使用的时隙发生碰撞时, 在已 保存的数据包中确定设定的数据包, 在已保存的数据包中从上述设定的数据包开始, 按照 发送剩余时间从小到大的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任 意一个数据包对应的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未 发生碰撞的时隙数目时, 基于上述任意一个数据包的发送剩余时间申请新的时隙资源; 收发机 1010, 用于在处理器 1000的控制下收发数据;
存储器 1020, 用于存储数据。
较佳地, 处理器 1000具体用于:
接收到新数据包后, 确定对应新数据包预设的发送时延;
根据发送时延设置与新数据包关联的用于维护发送剩余时间的定时器, 其中, 发送剩 余时间表征从当前时间开始到新数据包的发送时延对应的最晚发送时间点之间的时长长 度。
较佳地, 处理器 1000具体用于:
若根据接收到的其他节点发送的 FI确定自占时隙被其他节点占用或发生碰撞,则判定 自占时隙发生了碰撞;
在新申请的时隙到达前,若根据接收到的其他节点发送的 FI确定新申请的时隙被其他 节点占用或发生碰撞, 则判定新申请的时隙发生了碰撞。
较佳地, 处理器 1000具体用于:
确定发送剩余时间最小的数据包为设定的数据包; 或者,
确定从发送剩余时间最小的数据包开始, 按照发送剩余时间递增顺序排列的第 N + 1 个数据包为设定的数据包,其中, N为从当前时间开始到向后第一个发生碰撞的时隙之间, 第一节点能够使用的时隙数目。
较佳地, 处理器 1000基于任意一个数据包的发送剩余时间申请新的时隙资源, 包括: 基于任意一个数据包的发送剩余时间确定申请区间, 该申请区间对应的时长为从当前 时隙开始到任意一个数据包的发送剩余时间结结束;
在申请区间内申请新的时隙资源。
较佳地, 处理器 1000在申请区间内申请新的时隙资源 , 包括:
根据本地维护的时隙状态信息, 判断任意一个数据包对应的申请区间内 ' ***是否存 在空闲时隙;
若是, 则在空闲时隙内选择一个时隙作为新申请的时隙;
否则, 丢弃任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留任意一个数据包, 停止针对该任意一个数据包的时隙申请过程 , 并继续针对后续 数据包进行时隙资源判定; 或者,
从已保存的数据包中选取一个发送剩余时间小于任意一个数据包且优先级低于任意 一个数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删除; 或者,
当对应任意一个数据包设定了时延裕量且该时延裕量不为 0时, 根据时延裕量指示的 时间长度更新任意一个数据包对应的发送剩余时间, 并在更新后的发送剩余时间内选择空 闲时隙作为新申请时隙, 其中, 若更新后的剩余时间内仍然没有空闲时隙, 则丢弃任意一 个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留任意一个数据包, 停止 针对该任意一个数据包的时隙申请过程, 并继续针对后续数据包进行时隙资源判定; 或者 从已保存的数据包中选取一个发送剩余时间小于任意一个数据包且优先级低于任意一个 数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删除。
其中,在图 10中,总线架构可以包括任意数量的互联的总线和桥,具体由处理器 1000 代表的一个或多个处理器和存储器 1020 代表的存储器的各种电路链接在一起。 总线架构 还可以将诸如***设备、 稳压器和功率管理电路等之类的各种其他电路链接在一起, 这些 都是本领域所公知的, 因此, 本文不再对其进行进一步描述。 总线接口提供接口。 收发机 1010可以是多个元件, 即包括发送机和接收机, 提供用于在传输介质上与各种其他装置通 信的单元。处理器 1000负责管理总线架构和通常的处理,存储器 1020可以存储处理器 1000 在执行操作时所使用的数据。
处理器 1000负责管理总线架构和通常的处理, 存储器 1020可以存储处理器 1000在 执行操作时所使用的数据。
综上, 本申请实施例中, 重新设计了车联网中的时隙碰撞处理方法, 提出当节点判断 自身使用的时隙资源 (包括自占时隙和申请时隙)发生碰撞时, 从设定的数据包开始, 按 照发送剩余时间递增顺序, 对发送緩存中的每一个数据包进行时隙资源判定, 并在确定任 意一个数据包对应的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未 发生碰撞的时隙数目时,基于该任意一个数据包的发送剩余时间申请新的时隙资源。这样, 在车联网时分***中, 确定了当节点使用的时隙资源发生碰撞后, 新申请的时隙资源能够 满足高层数据包发送的时延要求,保证了消息的及时发送,从而有效保障的车联网的性能。
本领域内的技术人员应明白, 本申请的实施例可提供为方法、 ***、 或计算机程序产 品。 因此, 本申请可采用完全硬件实施例、 完全软件实施例、 或结合软件和硬件方面的实
施例的形式。 而且, 本申请可釆用在一个或多个其中包含有计算机可用程序代码的计算机 可用存储介盾 (包括但不限于磁盘存储器、 CD-ROM、 光学存储器等)上实施的计算机程 序产品的形式。
本申请是参照根据本申请实施例的方法、 设备(***)、 和计算机程序产品的流程图 和 /或方框图来描述的。 应理解可由计算机程序指令实现流程图和 /或方框图中的每一流 程和 /或方框、 以及流程图和 /或方框图中的流程和 /或方框的结合。 可提供这些计算机 程序指令到通用计算机、 专用计算机、 嵌入式处理机或其他可编程数据处理设备的处理器 以产生一个机器, 使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用 于实现在流程图一个流程或多个流程和 /或方框图一个方框或多个方框中指定的功能的 装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方 式工作的计算机可读存储器中, 使得存储在该计算机可读存储器中的指令产生包括指令装 置的制造品, 该指令装置实现在流程图一个流程或多个流程和 /或方框图一个方框或多个 方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上, 使得在计算机 或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理, 从而在计算机或其他 可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和 /或方框图一个 方框或多个方框中指定的功能的步骤。
尽管已描述了本申请的优选实施例, 但本领域内的技术人员一旦得知了基本创造性概 念, 则可对这些实施例作出另外的变更和修改。 所以, 所附权利要求意欲解释为包括优选 实施例以及落入本申请范围的所有变更和修改。
显然, 本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实 施例的精神和范围。 这样, 倘若本申请实施例的这些修改和变型属于本申请权利要求及其 等同技术的范围之内, 则本申请也意图包含这些改动和变型在内。
Claims
1、 一种时隙资源的碰撞处理方法, 其特征在于, 包括:
第一节点每接收到一个高层下发的新数据包, 将所述新数据包进行保存, 并根据所述 新数据包对应的发送时延维护该新数据包的发送剩余时间;
所述第一节点根据接收到的其他节点发送的帧信息 FI 确定自身使用的时隙发生碰撞 时, 在已保存的数据包中确定设定的数据包;
所述第一节点在已保存的数据包中从所述设定的数据包开始, 按照发送剩余时间从小 到大的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包对应 的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙数 目时, 基于所述任意一个数据包的发送剩余时间申请新的时隙资源。
2、 如权利要求 1 所述的方法, 其特征在于, 所述第一节点根据所述新数据包对应的 发送时延维护该新数据包的发送剩余时间, 包括:
所述第一节点接收到所述新数据包后, 确定对应所述新数据包预设的发送时延; 所述第一节点根据所述发送时延设置与所述新数据包关联的用于维护发送剩余时间 的定时器, 其中, 所述发送剩余时间表征从当前时间开始到所述新数据包的发送时延对应 的最晚发送时间点之间的时长长度。
3、 如权利要求 1 所述的方法, 其特征在于, 所述第一节点根据接收到的其他节点发 送的桢信息 FI确定自身使用的时隙发生碰撞, 包括:
若所述第一节点根据接收到的其他节点发送的 FI确定自占时隙被其他节点占用或发 生碰撞, 则判定所述自占时隙发生了碰撞;
在新申请的时隙到达前,若所述第一节点根据接收到的其他节点发送的 FI确定所述新 申请的时隙被其他节点占用或发生碰撞, 则判定所述新申请的时隙发生了碰撞。
4、 如权利要求 1、 2或 3所述的方法, 其特征在于, 所述第一节点在已保存的数据包 中确定设定的数据包, 包括:
所述第一节点确定发送剩余时间最小的数据包为设定的数据包; 或者,
所述第一节点确定从发送剩余时间最小的数据包开始, 按照发送剩余时间递增顺序排 列的第 N + 1个数据包为设定的数据包, 其中, N为从当前时间开始到向后第一个发生碰 撞的时隙之间, 第一节点能够使用的时隙数目。
5、 如权利要求 4 所述的方法, 其特征在于, 所述第一节点基于所述任意一个数据包 的发送剩余时间申请新的时隙资源, 包括:
所述第一节点基于所述任意一个数据包的发送剩余时间确定申请区间, 该申请区间对
应的时长为从当前时隙开始到所述任意一个数据包的发送剩余时间结结束;
所述第一节点在所述申请区间内申请新的时隙资源。
6、 如权利要求 5 所述的方法, 其特征在于, 所述第一节点在所述申请区间内申请新 的时隙资源, 包括:
所述第一节点根据本地维护的时隙状态信息, 判断所述任意一个数据包对应的申请区 间内, ***是否存在空闲时隙;
若是, 则在所述空闲时隙内选择一个时隙作为新申请的时隙;
否则, 丢弃所述任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留所述任意一个数据包, 停止针对该任意一个数据包的时隙申请过程, 并继续针对 后续数据包进行时隙资源判定; 或者,
从已保存的数据包中选取一个发送剩余时间小于所述任意一个数据包且优先级低于 所述任意一个数据包的低优先级数据包 , 将选取的低优先级数据包从緩存中删除; 或者, 当对应所述任意一个数据包设定了时延裕量且该时延裕量不为 0时, 根据时延裕量指 示的时间长度更新所述任意一个数据包对应的发送剩余时间, 并在更新后的发送剩余时间 内选择空闲时隙作为新申请时隙, 其中, 若更新后的剩余时间内仍然没有空闲时隙, 则丢 弃所述任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留所述任意 一个数据包, 停止针对该任意一个数据包的时隙申请过程 , 并继续针对后续数据包进行时 隙资源判定; 或者从已保存的数据包中选取一个发送剩余时间小于所述任意一个数据包且 优先级低于所述任意一个数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删 除。
7、 一种时隙资源的碰撞处理装置, 其特征在于, 包括:
通信单元, 用于每接收到一个高层下发的新数据包, 将所述新数据包进行保存, 并根 据所述新数据包对应的发送时延维护该新数据包的发送剩余时间;
确定单元,用于才艮据接收到的其他节点发送的帧信息 FI确定自身使用的时隙发生碰撞 时, 在已保存的数据包中确定设定的数据包;
主控单元, 用于在已保存的数据包中从所述设定的数据包开始, 按照发送剩余时间从 小到大的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包对 应的发送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙 数目时, 基于所述任意一个数据包的发送剩余时间申请新的时隙资源。
8、 如权利要求 7所述的装置, 其特征在于, 所述通信单元具体用于:
接收到所述新数据包后, 确定对应所述新数据包预设的发送时延; 根据所述发送时延
设置与所述新数据包关联的用于维护发送剩余时间的定时器, 其中, 所述发送剩余时间表 征从当前时间开始到所述新数据包的发送时延对应的最晚发送时间点之间的时长长度。
9、 如权利要求 7所述的装置, 其特征在于, 所述主控单无具体用于:
若根据接收到的其他节点发送的 FI确定自占时隙被其他节点占用或发生碰撞,则判定 所述自占时隙发生了碰撞; 在新申请的时隙到达前, 若根据接收到的其他节点发送的 Π 确定所述新申请的时隙被其他节点占用或发生碰撞, 则判定所述新申请的时隙发生了碰 撞。
10、 如权利要求 7、 8或 9所述的装置, 其特征在于, 所述确定单元具体用于: 确定发送剩余时间最小的数据包为设定的数据包; 或者, 确定从发送剩余时间最小的 数据包开始, 按照发送剩余时间递增顺序排列的第 N + 1个数据包为设定的数据包, 其中, N为从当前时间开始到向后第一个发生碰撞的时隙之间, 第一节点能够使用的时隙数目。
11、 如权利要求 10所述的装置, 其特征在于, 所述主控单元具体用于:
基于所述任意一个数据包的发送剩余时间确定申请区间, 该申请区间对应的时长为从 当前时隙开始到所述任意一个数据包的发送剩余时间结结束; 在所述申请区间内申请新的 时隙资源。
12、 如权利要求 11所述的装置, 其特征在于, 所述主控单元具体用于:
根据本地维护的时隙状态信息, 判断所述任意一个数据包对应的申请区间内, ***是 否存在空闲时隙; 若是, 则在所述空闲时隙内选择一个时隙作为新申请的时隙; 否则, 丢 弃所述任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者,
保留所述任意一个数据包, 停止针对该任意一个数据包的时隙申请过程, 并继续针对 后续数据包进行时隙资源判定; 或者,
从已保存的数据包中选取一个发送剩余时间小于所述任意一个数据包且优先级低于 所述任意一个数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删除; 或者, 当对应所述任意一个数据包设定了时延裕量且该时延裕量不为 0时, 根据时延裕量指 示的时间长度更新所述任意一个数据包对应的发送剩余时间, 并在更新后的发送剩余时间 内选择空闲时隙作为新申请时隙, 其中, 若更新后的剩余时间内仍然没有空闲时隙, 则丢 弃所述任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留所述任意 一个数据包, 停止针对该任意一个数据包的时隙申请过程 , 并继续针对后续数据包进行时 隙资源判定; 或者从已保存的数据包中选取一个发送剩余时间小于所述任意一个数据包且 优先级低于所述任意一个数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删 除。
13、 一种时隙资源的碰撞处理装置, 其特征在于, 包括:
处理器, 用于通过收发机每接收到一个高层下发的新数据包, 将新数据包保存到存储 器, 并根据新数据包对应的发送时延维护该新数据包的发送剩余时间, 并根据通过收发机 接收到的其他节点发送的 FI确定自身使用的时隙发生碰撞时,在已保存的数据包中确定设 定的数据包, 在已保存的数据包中从上述设定的数据包开始, 按照发送剩余时间从小到大 的顺序, 依次对每一个数据包进行时隙资源判定, 其中, 在确定任意一个数据包对应的发 送剩余时间内, 需要发送的数据包数目大于第一节点当前使用的未发生碰撞的时隙数目 时, 基于上述任意一个数据包的发送剩余时间申请新的时隙资源;
收发机, 用于在处理器的控制下收发数据;
存储器, 用于存储数据。
14、 如权利要求 13所述的装置, 其特征在于, 所述处理器具体用于:
通过所述收发机接收到所述新数据包后, 确定对应所述新数据包预设的发送时延; 根 据所述发送时延设置与所述新数据包关联的用于维护发送剩余时间的定时器, 其中, 所述 发送剩余时间表征从当前时间开始到所述新数据包的发送时延对应的最晚发送时间点之 间的时长长度。
15、 如权利要求 13所述的装置, 其特征在于, 所述处理器具体用于:
若根据通过所述收发机接收到的其他节点发送的 FI确定自占时隙被其他节点占用或 发生碰撞, 则判定所述自占时隙发生了碰撞; 在新申请的时隙到达前, 若根据通过所述收 发机接收到的其他节点发送的 FI确定所述新申请的时隙被其他节点占用或发生碰撞,则判 定所述新申请的时隙发生了碰撞。
16、 如权利要求 13、 14或 15所述的装置, 其特征在于, 所述处理器具体用于: 确定发送剩余时间最小的数据包为设定的数据包; 或者, 确定从发送剩余时间最小的 数据包开始, 按照发送剩余时间递增顺序排列的第 N + 1个数据包为设定的数据包, 其中, N为从当前时间开始到向后第一个发生碰撞的时隙之间, 第一节点能够使用的时隙数 。
17、 如权利要求 16所述的装置, 其特征在于, 所述处理器具体用于:
基于所述任意一个数据包的发送剩余时间确定申请区间, 该申请区间对应的时长为从 当前时隙开始到所述任意一个数据包的发送剩余时间结结束; 在所述申请区间内申请新的 时隙资源。
18、 如权利要求 17所述的装置, 其特征在于, 所述处理器具体用于:
根据本地维护的时隙状态信息, 判断所述任意一个数据包对应的申请区间内, ***是 否存在空闲时隙; 若是, 则在所述空闲时隙内选择一个时隙作为新申请的时隙; 否则, 丢
弃所述任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者,
保留所述任意一个数据包, 停止针对该任意一个数据包的时隙申请过程, 并继续针对 后续数据包进行时隙资源判定; 或者,
从已保存的数据包中选取一个发送剩余时间小于所述任意一个数据包且优先级低于 所述任意一个数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删除; 或者, 当对应所述任意一个数据包设定了时延裕量且该时延裕量不为 0时, 根据时延裕量指 示的时间长度更新所述任意一个数据包对应的发送剩余时间, 并在更新后的发送剩余时间 内选择空闲时隙作为新申请时隙, 其中, 若更新后的剩余时间内仍然没有空闲时隙, 则丢 弃所述任意一个数据包, 并停止针对后续数据包进行时隙资源判定; 或者, 保留所述任意 一个数据包, 停止针对该任意一个数据包的时隙申请过程 , 并继续针对后续数据包进行时 隙资源判定; 或者从已保存的数据包中选取一个发送剩余时间小于所述任意一个数据包且 优先级低于所述任意一个数据包的低优先级数据包, 将选取的低优先级数据包从緩存中删 除。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210457375.1 | 2012-11-14 | ||
CN201210457375.1A CN103813469B (zh) | 2012-11-14 | 2012-11-14 | 一种时隙资源的碰撞处理方法及装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2014075556A1 true WO2014075556A1 (zh) | 2014-05-22 |
Family
ID=50709522
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2013/086272 WO2014075556A1 (zh) | 2012-11-14 | 2013-10-31 | 一种时隙资源的碰撞处理方法及装置 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN103813469B (zh) |
WO (1) | WO2014075556A1 (zh) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106302585A (zh) * | 2015-05-25 | 2017-01-04 | 电信科学技术研究院 | 一种资源碰撞的检测指示方法及装置 |
CN106686653A (zh) * | 2015-11-05 | 2017-05-17 | 电信科学技术研究院 | 车路协同通信***时频资源的空间复用方法、装置及节点 |
US20170141861A1 (en) * | 2014-07-31 | 2017-05-18 | Huawei Technologies Co., Ltd. | Apparatus and method for sending vehicle broadcast information |
Families Citing this family (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105450334B (zh) * | 2014-08-26 | 2018-08-07 | 大唐电信科技产业控股有限公司 | 一种车联网***中的数据发送方法和节点设备 |
US9894466B2 (en) | 2014-10-24 | 2018-02-13 | Mediatek Inc. | Method and apparatus for determining silence time |
US10390341B2 (en) * | 2014-10-31 | 2019-08-20 | Realtek Semiconductor Corp. | Wireless communication system and associated wireless communication method |
CN106454955B (zh) | 2015-08-12 | 2019-09-17 | 电信科学技术研究院 | 一种资源信息发送、广播方法及装置 |
CN106534233B (zh) * | 2015-09-09 | 2019-07-05 | 电信科学技术研究院 | 一种资源检测方法及装置 |
CN106559811B (zh) * | 2015-09-28 | 2019-11-22 | 展讯通信(上海)有限公司 | 蓝牙数据接收控制方法及装置 |
CN106936539B (zh) * | 2015-12-29 | 2019-07-26 | 北京大唐高鸿数据网络技术有限公司 | 车载自组织网中mac层实时获取信道状态的方法 |
CN107360204B (zh) * | 2016-05-10 | 2020-06-16 | 北京信威通信技术股份有限公司 | 一种车联网协作预警消息生成时间的预测方法及装置 |
CN110798860B (zh) * | 2018-08-01 | 2023-06-20 | 华为技术有限公司 | 数据处理方法、设备及*** |
CN111556465B (zh) * | 2020-04-30 | 2023-12-22 | 北京白龙马云行科技有限公司 | 一种基于tdma技术的分布式车联网mac层时隙接入方法及*** |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020114313A1 (en) * | 2000-07-26 | 2002-08-22 | William Walsh | Method and system for providing efficient data transmission based upon a contention protocol |
CN1918866A (zh) * | 2004-02-12 | 2007-02-21 | 皇家飞利浦电子股份有限公司 | 媒体访问控制的分布式分配方法 ,设备访问媒体顺序的重组方法 ,避免冲突的方法 ,在共享媒体和帧结构中同步装置的方法 |
CN101034932A (zh) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | 快速预约列发多址接入方法 |
CN101562903A (zh) * | 2005-10-19 | 2009-10-21 | 株式会社Ntt都科摩 | 接入混合网的方法和网关设备、无线终端以及通信*** |
US20120230370A1 (en) * | 2011-03-08 | 2012-09-13 | Cisco Technology Inc. | Efficient Transmission of Large Messages in Wireless Networks |
CN102695265A (zh) * | 2012-01-09 | 2012-09-26 | 河南科技大学 | 一种基于无线传感器网络的混合机制mac协议通信方法 |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101360339B (zh) * | 2008-09-28 | 2012-04-25 | 熊猫电子集团有限公司 | 融合时分同步码分多址蜂窝网与自组网的接入控制方法 |
-
2012
- 2012-11-14 CN CN201210457375.1A patent/CN103813469B/zh active Active
-
2013
- 2013-10-31 WO PCT/CN2013/086272 patent/WO2014075556A1/zh active Application Filing
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020114313A1 (en) * | 2000-07-26 | 2002-08-22 | William Walsh | Method and system for providing efficient data transmission based upon a contention protocol |
CN1918866A (zh) * | 2004-02-12 | 2007-02-21 | 皇家飞利浦电子股份有限公司 | 媒体访问控制的分布式分配方法 ,设备访问媒体顺序的重组方法 ,避免冲突的方法 ,在共享媒体和帧结构中同步装置的方法 |
CN101562903A (zh) * | 2005-10-19 | 2009-10-21 | 株式会社Ntt都科摩 | 接入混合网的方法和网关设备、无线终端以及通信*** |
CN101034932A (zh) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | 快速预约列发多址接入方法 |
US20120230370A1 (en) * | 2011-03-08 | 2012-09-13 | Cisco Technology Inc. | Efficient Transmission of Large Messages in Wireless Networks |
CN102695265A (zh) * | 2012-01-09 | 2012-09-26 | 河南科技大学 | 一种基于无线传感器网络的混合机制mac协议通信方法 |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20170141861A1 (en) * | 2014-07-31 | 2017-05-18 | Huawei Technologies Co., Ltd. | Apparatus and method for sending vehicle broadcast information |
US9755771B2 (en) * | 2014-07-31 | 2017-09-05 | Huawei Technologies Co., Ltd. | Apparatus and method for sending vehicle broadcast information |
CN106302585A (zh) * | 2015-05-25 | 2017-01-04 | 电信科学技术研究院 | 一种资源碰撞的检测指示方法及装置 |
TWI581654B (zh) * | 2015-05-25 | 2017-05-01 | 電信科學技術研究院 | A method and device for detecting a collision of resources |
CN106302585B (zh) * | 2015-05-25 | 2019-05-10 | 电信科学技术研究院 | 一种资源碰撞的检测指示方法及装置 |
CN106686653A (zh) * | 2015-11-05 | 2017-05-17 | 电信科学技术研究院 | 车路协同通信***时频资源的空间复用方法、装置及节点 |
Also Published As
Publication number | Publication date |
---|---|
CN103813469B (zh) | 2017-02-01 |
CN103813469A (zh) | 2014-05-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2014075556A1 (zh) | 一种时隙资源的碰撞处理方法及装置 | |
WO2014075555A1 (zh) | 一种时隙资源的调度方法及装置 | |
KR102038723B1 (ko) | 무선 네트워크에서 경쟁 기반 자원을 분할하는 방법 및 시스템 | |
CN103974440B (zh) | 一种车联网中时隙资源的处理方法及装置 | |
JP4904849B2 (ja) | 無線局及び通信方法 | |
CN103684645B (zh) | 一种时隙碰撞的处理方法及装置 | |
WO2013152649A1 (zh) | 一种资源碰撞的判定方法和装置 | |
CN104918281B (zh) | 一种数据发送的方法及装置 | |
WO2013163918A1 (zh) | 一种fi消息的传输方法及装置 | |
JP2007526682A (ja) | 媒体アクセス制御用の分散型割付けの方法、媒体へのデバイス・アクセス順序を再編成するための方法、衝突を回避するための方法、共用媒体においてデバイスを同期化する方法、およびフレーム構造体 | |
WO2017063122A1 (zh) | 用于传输消息的方法和用户设备 | |
JP2013131834A (ja) | 無線通信装置および無線通信方法 | |
WO2014079308A1 (zh) | 一种时隙资源占用处理方法及装置 | |
US8717991B2 (en) | Apparatus and method for operating multi-channel based on wireless access in vehicular environments | |
WO2014036964A1 (zh) | 一种多时隙或子帧资源的处理方法及装置 | |
CN103812791B (zh) | 一种数据包发送方法及装置 | |
CN106793114B (zh) | 动态时隙分配方法、所适用的媒介访问控制***及节点 | |
WO2015165355A1 (zh) | 一种时隙状态维护方法和装置 | |
KR101477281B1 (ko) | Wave 기반의 멀티 채널 운용 장치 및 방법 | |
CN110691349A (zh) | 车联网中面向安全应用的联合功率和竞争窗口的自适应控制算法 | |
CN103686741B (zh) | 一种时隙资源的撤销方法及装置 | |
KR101339604B1 (ko) | 다중 사용자 혼성 매체 접근 제어 기반의 무선 자원 관리 방법 | |
WO2009069047A1 (en) | Link-based transmission queue structure for wireless networks | |
WO2014114201A1 (zh) | 一种时隙状态的发送以及确定的方法、装置 | |
KR101982928B1 (ko) | 차량 환경용 무선 접속을 위한 차량 통신 방법 및 장치 |
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: 13855142 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: 13855142 Country of ref document: EP Kind code of ref document: A1 |