CN103813469A - Method and device for collision treatment of time slot resources - Google Patents
Method and device for collision treatment of time slot resources Download PDFInfo
- Publication number
- CN103813469A CN103813469A CN201210457375.1A CN201210457375A CN103813469A CN 103813469 A CN103813469 A CN 103813469A CN 201210457375 A CN201210457375 A CN 201210457375A CN 103813469 A CN103813469 A CN 103813469A
- Authority
- CN
- China
- Prior art keywords
- packet
- time
- time slot
- node
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
Abstract
The invention relates to a network management technology, in particular to a method and device for collision treatment of time slot resources. The method comprises the steps of designing a mode of time slot collision treatment in the internet of vehicles again, when a node judges that collision occurs in the time slot resources (including self-occupied time slots and application time slots) used by the node, performing time slot resource judgment on every data packet in a sending cache according to the ascending order of sending remaining time from a set data packet; and when the fact that within the sending remaining time corresponding to the random data packet, the number of the data packets needing sending is larger than the number of time slots used by the first node currently and not undergoing collision is determined, applying for new time slot resources on the basis of the sending remaining time of the random data packet. In an internet of vehicles time division system, after collision of the time slot resources used by the node is determined, the new applied time slot resources can meet the time delay requirements of high level data packet sending, information is timely sent, and accordingly the performance of the internet of vehicles is effectively guaranteed.
Description
Technical field
The present invention relates to network management technology, particularly a kind of collision processing method of time interval resource and device.
Background technology
Along with the development of Vehicular communication system and the maturation gradually of mobile self-networking technology, in order to realize real-time, dynamic, the intelligent management to vehicle, develop specially in the world the DSRC(Dedicated Short Range Communications for car networking, Dedicated Short Range Communications) agreement.DSRC, by the transmitted in both directions of information, organically couples together the information collecting device of vehicle and vehicle, vehicle and trackside, supports point-to-point, point-to-multipoint delivery.
Mobile time-division slot ALOHA(Mobile Slotted Aloha, MS-ALOHA) mechanism is a kind of DSRC MAC(Medium Access Control based on time-sharing format; Media access control) layer access and resource allocation mechanism, resource is distributed based on frame structure take slot(time slot) be unit.Consult shown in Fig. 1, every N slot forms a frame (being designated as Frame), and the slot in each frame is numbered 0 ~ N-1, between frame, moves in circles.In each slot, only allowing a vehicle to send, is TDMA(Time Division Multiple Access between vehicle, time division multiplexing access) pattern.Vehicle is in the upper data that not only send application layer of shared time slot, but also need to send FI(Frame Information, frame information), the seizure condition that can indicate each slot in a frame in FI, for example, a kind of possible FI structure as shown in Figure 2).
The basic thought of MS-ALOHA mechanism is: any node (as, vehicle) while adding network, need by monitoring the time slot of free timeslot resource occupation in frame, if node is not initiatively abandoned this shared time interval resource, can use the slot transmission data that take, other nodes can not use this time slot in the meantime always.On the time slot taking, node need to periodically send FI, in FI, carry the situation that takies time slot with this node at a distance of other nodes within the scope of double bounce that node obtains, the occupancy information of each time slot that instructs node perceives (also claims time slot state information, gap information), each time slot is provided to this time slot: Time Slot Occupancy state information, take the STI(Source Temporary Identifier corresponding to node of time slot, temporary resource mark) or can be described as node identification, take the priority state (also can think to take priority state corresponding to data that time slot node sends at this time slot) of the node of time slot, wherein, Time Slot Occupancy state information can be expressed four kinds of seizure conditions of time slot: (00) represents that time slot is idle condition, (10) represent that time slot is taken (taking referred to as a hop node) or this node takies with this node at a distance of other nodes of jumping, (11) represent that time slot is taken (taking referred to as two hop nodes) with this node at a distance of other nodes of double bounce, (01) represent that time slot is taken by other plural nodes, be collision status, at the non-self time slot taking, the FI that each node sends by monitoring adjacent one node of jumping, can judge that each node within the scope of adjacent three jumpings takies the situation of time slot, in the time finding that the time interval resource that takies of this node bumps with the resource of other nodes use, again preengage new free timeslot.For convenience of subsequent descriptions, in the present invention, FI and the unification of internal information content thereof are adopted to following describing mode:
Node sends frame information (FI) and is called: FI message, and also can be referred to as FI;
The occupancy information corresponding to each time slot of indicating in FI is called: the gap information territory that in FI message, each time slot is corresponding;
Three category informations (that is: Time Slot Occupancy state, STI, precedence information) that provide in the occupancy information that in FI, each time slot is corresponding are called: the Time Slot Occupancy state subdomain, STI subdomain, the priority subdomain that in the gap information territory of each time slot, comprise;
It should be noted that, foregoing description mode just stipulates for subsequent descriptions is convenient, can certainly adopt other describing mode.
Under MS-ALOHA mechanism, in to the maintenance process that takies time slot, node needs to safeguard (N-1) * N time slot state cache table, is used for storing the gap information territory of the each time slot carrying in the FI message of the adjacent node transmission receiving on corresponding time slot.For example, consult shown in Fig. 3, the dimension of the time slot state cache table of showing in Fig. 3 is N*N dimension, because this FI message sending in shared time slot of node does not need storage, therefore the time slot state cache table of the actual maintenance of node is N-1 capable (supposing that each node only takies a time slot), and (N-1) * N time slot state cache table of describing in subsequent content of the present invention all refers to that not preserving node itself takies time slot and send the gap information of FI; Wherein, the detection territory that time slot is corresponding refers to and takies " the detection territory " that gap information territory corresponding to this time slot in the FI message that this time slot sends is called this time slot, and " non-detection territory " refers to that gap information territory corresponding to this time slot in the FI that this time slot of unoccupied sends is called non-" the detection territory " of this time slot.Wherein default value is default value.
When node receives FI message on a time slot, always cover the information content that in time slot state cache table, corresponding time slot is expert at (covering the content recording before the frame period) by the gap information content of carrying in the FI message newly receiving.Detailed process is as follows:
The time slot that node takies at self generates and sends FI message, need to fill in each field(territory according to certain rule), comprise Time Slot Occupancy state subdomain, STI subdomain and priority subdomain.After being sent, node can empty sent FI information.
Node is on the non-self time slot taking, need to receive the FI message that node sends around, and according to the FI information updating time slot state cache table receiving, before the time slot taking at arrival this node self, judge whether the time slot self taking is safeguarded successfully and the non-self seizure condition that takies the each time slot of time slot, wherein, when do not receive FI on the non-self time slot taking, node can be filled out default value by each territory of the row that in time slot state cache table, this time slot is corresponding.Before Default is worthwhile, process by idle condition (00), can certainly define other processing modes.
Under MS-ALOHA mechanism, any node judges the time interval resource following two kinds of situations that bumped:
1) time interval resource that node self takies bumps.
In (N-1) * N time slot state cache table, row (N-1 element) corresponding to time slot that node self takies are gone up in indicated gap information and are occurred following any one situation, think that the time slot that node self takies bumps:
In gap information corresponding to a, N-1 element, exist one or more these time slots of indication to be taken (corresponding Time Slot Occupancy state is designated as 10) by other nodes different from node STI, and the priority of node self is not the highest in all nodes of taking this time slot (comprising that indication and this node in the gap information that this node and N-1 element are corresponding take the every other node of identical time slot).
In gap information corresponding to b, N-1 element, exist one or more these time slots of indication to be taken (corresponding Time Slot Occupancy state is designated as 10) by other nodes different from node STI, and the priority of node is the limit priority in all nodes of taking this time slot (comprising that indication and this node in the gap information that this node and N-1 element are corresponding take the every other node of identical time slot) but is not unique highest priority node (owing to only having 4 priority levels, therefore may occur multiple nodes that priority level is identical).Node can be chosen in the upper transmission of self current time slot+N taking FI, after flow process in, if again there is this situation, node can Probability p sends at slot p+2*N again, thinks time interval resource collision occurs with probability (1-p).
2) time interval resource that non-node takies self bumps.
In N-1 element in time slot state cache table corresponding to the time slot that self takies for arbitrary non-node, occur that two and above gap information indicate this time slot to be taken (corresponding Time Slot Occupancy state is designated as 10) by two and above node (that is: STI difference), determined that this time interval resource bumps.
Under prior art, in the time that node judges the time slot generation resource collision self taking, will again initiate access procedure and regain time interval resource.In the time that node judges that the non-self time interval resource taking bumps, to in the FI sending at self, the time slot state information of the time slot that bumps be filled out as (01), corresponding STI fills in the highest STI corresponding to node of node medium priority bumping, and precedence information is filled in the priority of the node that priority is the highest; In the time that the node priority bumping is identical, select at random a STI to fill in, and precedence information is filled in the highest priority.
As mentioned above, in prior art, in the time that node judges that the time interval resource self taking bumps, to again initiate access procedure and regain time interval resource, monitor the free timeslot existing in frame and therefrom select at random a time slot as self new time slot of applying for, but this method does not but consider whether the time interval resource of new application can meet high level and will send the delay requirement of packet.
At present, it is to improve traffic safety by car car, bus or train route communication timely that car networking short-range communication is applied a subject matter that will solve, and the transmission delay of traffic safety class application message has strict transmission delay requirement conventionally, as 100ms.Therefore, current hit-treatment technology can not meet the requirement of practical application to packet transmission delay.
Summary of the invention
The embodiment of the present invention provides a kind of collision processing method and device of time interval resource, in order in car networking, in the time that time interval resource bumps, guarantees that the time interval resource of new application meets the transmission delay requirement of packet.
The concrete technical scheme that the embodiment of the present invention provides is as follows:
A collision processing method for time interval resource, comprising:
First node often receives the new data packets that a high level issues, and described new data packets is preserved, and safeguard according to transmission delay corresponding to described new data packets the transmission remaining time of this new data packets;
When the FI that first node sends according to other nodes that receive determines that the time slot self using bumps, in the packet of having preserved, determine the packet of setting;
First node in the packet of having preserved from the packet of described setting, according to sending the remaining time of order from small to large, successively each packet is carried out to time interval resource judgement, wherein, determining in transmission remaining time that any one packet is corresponding, need the number of data packets sending while being greater than the number of time slot not bumping of the current use of first node, new time interval resource is applied in the transmission based on described any one packet remaining time.
A hit-treatment device for time interval resource, comprising:
Communication unit, the new data packets issuing for often receiving a high level, preserves described new data packets, and safeguards according to transmission delay corresponding to described new data packets the transmission remaining time of this new data packets;
Determining unit while determining that the time slot self using bumps, is determined the packet of setting for the FI sending according to other nodes that receive in the packet of having preserved;
Main control unit, be used at the packet of having preserved from the packet of described setting, according to sending the remaining time of order from small to large, successively each packet is carried out to time interval resource judgement, wherein, determining in transmission remaining time that any one packet is corresponding, when the number of data packets that needs to send is greater than the number of time slot not bumping of the current use of first node, new time interval resource is applied in the transmission based on described any one packet remaining time.
In the embodiment of the present invention, redesign the time slot collision processing method in car networking, propose in the time that node judges that the time interval resource (comprising from accounting for time slot and application time slot) self using bumps, from the packet of setting, according to sending incremental order remaining time, each packet sending in buffer memory is carried out to time interval resource judgement, and determining in transmission remaining time that any one packet is corresponding, when the number of data packets that need to send is greater than the number of time slot not bumping of the current use of first node, new time interval resource is applied in transmission based on this any one packet remaining time.Like this, in car networking time-division system, determine that, after the time interval resource that node uses bumps, the time interval resource of new application can meet the delay requirement that high level data bag sends, and has guaranteed the timely transmission of message, thus the performance of the car of effective guarantee networking.
Accompanying drawing explanation
Fig. 1 is superframe structure schematic diagram under prior art;
Fig. 2 is that under prior art, a kind of FI structure is shown in schematic diagram;
Fig. 3 is time slot state cache table schematic diagram in prior art and the embodiment of the present invention;
Fig. 4 is time slot state vector (table) schematic diagram in the embodiment of the present invention;
Fig. 5 is time slot type schematic diagram in the embodiment of the present invention;
Fig. 6 is that in the embodiment of the present invention, first node carries out time interval resource hit-treatment flow chart;
Fig. 7 and Fig. 8 are two kinds of time interval resource scheduling example schematic in the embodiment of the present invention;
Fig. 9 is first node illustrative view of functional configuration in the embodiment of the present invention.
Embodiment
In the embodiment of the present invention, the maintenance mode of the FI of each node to each time slot in frame can be divided into following two classes:
The first maintenance mode is: adopt accumulation mode to preserve FI.Within a frame period, in the time slot that node takies at other nodes, receive the FI that other nodes send, by the FI preserving being analyzed to the time slot state information that obtains each time slot, specifically as shown in Figure 3.
The second maintenance mode is: adopt iterative manner to preserve FI.Be that node is only preserved a vector about the current seizure condition of each time slot, be called the follow-up time slot state vector (table) that is called of time slot state vector (also can be called time slot state table), a kind of possible time slot state vector (table) as shown in Figure 4, in the time that node receives the FI of other nodes transmissions, upgrade according to gap information unit corresponding to each time slot in the time slot state vector (table) that in new reception FI, preserve this locality in gap information territory corresponding to each time slot, by the mode of safeguarding time slot state vector (table), gap information is safeguarded.In the time that node need send the FI self judging, the FI that can will send according to the Information generation in the time slot state vector (table) of preserving.
It should be noted that, foregoing description mode just stipulates for subsequent descriptions is convenient, can certainly adopt other describing mode.
On the other hand, in the embodiment of the present invention, a node can take multiple time interval resources, and in the time that node takies multiple time interval resource, safeguard for multiple time interval resources that node is taken, the time slot relevant to node be divided into following a few class (specifically consulting shown in Fig. 5):
1, certainly account for time slot: in the embodiment of the present invention, defined node successfully takies and send the time slot of FI and/or packet that to be node account for time slot certainly, that is: only have and sent FI and/or packet at corresponding time slot when node, node is from taking this time slot transmission FI and/or packet so, till node discharges this time slot, think this time slot be self certainly account for time slot.
And concrete, certainly the accounting for time slot and can be further divided into again following two kinds of node:
From accounting for main time slot: node is from accounting for certain specific time slot in time slot.Each node can will account for certain time slot in time slot and be defined as the main time slot of self certainly.Node carries out time slot bookkeeping in the time of main time slot.
From accounting for from time slot: certainly account for time slot, other accounts for time slot certainly the node except main time slot.Node is only carrying out FI and/or data and is sending from accounting for from time slot, does not carry out the operations such as time slot management, time slot state vector (table) empty.
Certainly, node also can not done above-mentioned differentiation to certainly accounting for time slot.
2, application time slot: certainly the accounting for time slot or use the available transmission capacity of time slot (comprising application time slot) of the data volume of the high level data bag that needs in MAC layer comparison buffer queue send and node, if the data volume of packet is greater than the new time slot of applying in the time accounting for time slot or use the transmission capacity that time slot (comprising application time slot) can improve.Application time slot only just can be converted to from accounting for time slot after node determination uses this application time slot to send packet or using this application time slot to send packet;
Based on above-mentioned technology definition, the time interval resource that node takies can also be divided in the following ways:
1) node uses time slot: for convenience of subsequent descriptions, the time slot that the time slot that node is taken and node are being applied for is referred to as node and uses time slot.In some special scenes, node uses time slot also can only include the time slot that node takies.
2) non-node uses time slot: the every other time slot except node uses time slot in all time slots in frame.
Below in conjunction with accompanying drawing, the preferred embodiment of the present invention is elaborated.
In the embodiment of the present invention, high-rise in the time issuing packet to first node, can be for the associated corresponding transmission delay of each packet, different transmission delay corresponding to packet possibility, first node often receives a packet, all can one timer be set according to the delay requirement of this packet, in the time of timer expiry, be the moment that reaches maximum transmission delay, corresponding packet must send before this moment.Because the time is not stopping passing, the duration that the timer of each packet is safeguarded is also in continuous minimizing, in the present embodiment, for any one packet, the latest duration length transmitting time point corresponding to the transmission delay of packet will be started from current time, be called the transmission remaining time of this any one packet, obviously, packet in buffer memory is corresponding different transmission remaining time conventionally, and the timer that each packet is corresponding is used to indicate the transmission remaining time of corresponding data bag.The transmission if packet fails before corresponding timer expiry, abandons this packet.
Consult shown in Fig. 6, in the embodiment of the present invention, it is as follows that first node carries out the detailed process of time interval resource hit-treatment:
Step 600: first node often receives the new data packets that a high level issues, preserves described new data packets, and safeguards according to transmission delay corresponding to described new data packets the transmission remaining time of this new data packets.
In the embodiment of the present invention, first node receives according to setting order the packet that high level issues successively, new packet of every reception, first node all can be saved to this new data packets in local mac buffer memory, simultaneously, transmission delay setting with this new data packets associated timer corresponding according to this new data packets, what this timer was safeguarded is the transmission remaining time of new data packets.
Step 610: when the FI that first node sends according to other nodes that receive determines that the time slot self using bumps, determine the packet of setting in the packet of having preserved.
In the embodiment of the present invention, step 600 and step 610 are two separate operating process, and (step 600 triggers by receiving high level data bag to be subject to different Event triggered; Step 610 is triggered by the FI that receives other nodes transmissions), implementation does not have precedence relationship.
In the present embodiment, first node can adopt but be not limited to following mode to self use time slot carry out collision judgment:
From accounting for time slot collision judgment mode: if the FI that first node sends according to other nodes that receive determine from account for time slot taken by other nodes (as a hop node takies, two hop nodes take, three hop nodes take ...) or bump, judge describedly from accounting for time slot, collision to have occurred.
The time slot collision judgment mode of new application: before the time slot of new application arrives, if the FI that first node sends according to other nodes that receive determine the time slot of described new application taken by other nodes (as a hop node takies, two hop nodes take, three hop nodes take ...) or bump, judge that collision has occurred the time slot of described new application.
On the other hand, in the embodiment of the present invention, when first node is determined the particular location of packet of above-mentioned setting in already present packet, can adopt but be not limited to following two kinds of modes:
First kind of way is: first node is determined and in MAC buffer memory, sent the packet that the packet of minimum remaining time is above-mentioned setting.
The second way is: first node is determined in MAC buffer memory the packet from sending minimum remaining time, be the packet of setting according to sending N+1 the packet that remaining time, incremental order was arranged, wherein, N starts to backward first time slot bumping from current time, the number of time slot that first node can use.
Step 620: first node in the packet of having preserved from the packet of described setting, according to sending the remaining time of order from small to large, successively each packet is carried out to time interval resource judgement, wherein, determining in transmission remaining time that any one packet is corresponding, need the number of data packets sending while being greater than the number of time slot not bumping of the current use of first node, new time interval resource is applied in the transmission based on described any one packet remaining time.
In practical application, FI also can have other addresses, as SI(slot information, gap information)
In the embodiment of the present invention, first node adopts first kind of way to determine after the packet of setting, and first node is in MAC buffer memory, from sending the packet of minimum remaining time, according to sending the order increasing progressively remaining time, successively each packet is carried out to time interval resource judgement.
First node adopts the second way to determine that after the packet of setting, first node, in MAC buffer memory, is unwrapped the beginning from N+1 data, according to sending the order increasing progressively remaining time, successively each packet is carried out to time interval resource judgement.This be because, start to N packet from the packet of transmitting time minimum, this a part of packet can guarantee by starting from current time to the time slot bumping, the time slot that first node can use sends, therefore, in order to save amount of calculation, improve hit-treatment efficiency, first node can directly be unwrapped and begin to carry out time interval resource judgement from N+1 data.
The time interval resource mentioned in above-mentioned two kinds of modes is judged and is referred to: in transmission remaining time corresponding to decision data bag, need the number of data packets sending whether to be greater than the number of time slot not bumping of the current use of first node, if, new time interval resource is applied in the transmission based on packet remaining time, otherwise the next packet reading in MAC buffer memory is proceeded time interval resource judgement.
On the other hand, in the embodiment of the present invention, when remaining time is applied for new time interval resource in the transmission of first node based on any one packet (being designated hereinafter simply as packet X), can be first determine time interval resource application interval remaining time according to the transmission of packet X, the duration that this application interval comprises is to start to finish remaining time to the transmission of packet X from current time, then, first node is chosen suitable time slot as new application time slot in definite application interval
For example, in the embodiment of the present invention, first node is according to the time slot state information of local maintenance (being time slot state cache table or the time slot state vector of local maintenance), judges from current time starts to finish remaining time to transmission corresponding to packet X, whether has free timeslot in system, if so, in gap, select at random the time slot of a time slot as new application at one's leisure, the time slot of this new application is used for sending packet X, otherwise, can adopt three kinds of processing modes, one is that packet X is abandoned, one is packet X to be still placed in buffer memory and to stop this application time slot process (the application time slot process causing by packet X is carried out to time interval resource judgement) to continue next packet to carry out time interval resource judgement, last a kind of be packet from having preserved, choose one send remaining time lower than packet X and priority the lower-priority data bag lower than packet X, and the lower-priority data bag of choosing is deleted from buffer memory, more preferably, when existing multiple remaining times lower than packet X and priority during lower than the lower-priority data bag of packet X, the data packet discarding of minimum remaining time (or maximum) will be sent in packet minimum its medium priority.It should be noted that, in order to increase Packet Generation opportunity of success, first node may arrange time delay allowance for packet X.So-called time delay allowance refers to that first node is arranging according to the transmission delay of packet X while safeguarding the timer length that sends remaining time, be not to set and safeguard the timer length that sends remaining time in strict accordance with the length of transmission delay requirement, but reserve certain time delay allowance, for can not successfully send within transmission remaining time of packet X in initial setting up time, send again the timer length of remaining time according to the updating maintenance of time delay allowance, in its time delay claimed range, send opportunity of success thereby increase packet X.Especially, in the time that priority corresponding to different pieces of information bag is different, can guarantee the transmission success rate of different priority levels packet by differentiated time delay allowance is set.Use an example of time delay allowance to be: the transmission delay of establishing packet X is 100ms, require packet X to send in 100ms, be 20ms according to the time delay allowance of the priority level of packet X (or according to other rules) specified data bag X, the maintenance of now initial setting up sends the timer length of remaining time and equals transmission delay (100ms) and deduct time delay allowance (20ms) and it should be noted that for 80ms(, here arrange and safeguard that sending the timer length of remaining time has only considered time delay allowance, in real system, may also need to consider other allowances, as processing time allowance of hardware etc., now, safeguard in the timer length that sends remaining time and also need other allowance value also to remove, as also will considered the hardware handles argin of 5ms except the time delay allowance of 20ms, be just 75ms transmission remaining time now).Suppose in the time need to applying for new time interval resource within the transmission remaining time of packet X (80ms), discovery does not have free timeslot, and now the time delay allowance of packet X not for 0(is 20ms), first node according to time delay allowance value upgrade send remaining time be that 100ms(adds in remaining time by time delay allowance value, then time delay allowance value is set to 0), then within the scope of the transmission remaining time after renewal, apply for new time interval resource.The set-up mode of Packet Delay allowance, can adopt (being that time delay allowance value once releases) of one-level, also can adopt multistage (being that time delay allowance value discharges several times), because the set-up mode of time delay allowance does not belong to invention scope, not be described in detail here.
Based on above-mentioned analysis, when being provided with time delay allowance for packet X, and corresponding time delay allowance is not 0 o'clock, if need to apply for new time interval resource but there is no free timeslot within transmission remaining time of packet X, except above-mentioned three kinds of processing modes, first node can also adopt following processing mode: according to the time span transmission remaining time that more new data packets X is corresponding of time delay allowance indication, transmission remaining time after renewal selects free timeslot as new application time slot in definite application interval, if still there is no free timeslot in the transmission remaining time after renewal, packet discard X, and stop carrying out time interval resource judgement for follow-up data bag, or, retain packet X, stop the time slot application process for packet X, and continue to carry out time interval resource judgement for follow-up data bag, or, from the packet of having preserved, choosing one sends and is less than packet X and the priority lower-priority data bag lower than packet X remaining time, and the lower-priority data bag of choosing is deleted from buffer memory, more preferably, in the time existing multiple transmission to be less than packet X and priority lower than the lower-priority data bag of packet X remaining time, by in packet minimum its medium priority remaining time the shortest data packet discarding.
For any one packet of judging, all can adopt the new time interval resource of said method application, do not repeat them here.On the other hand, chosen at one's leisure after the time slot of new application in gap, first node need to add the time slot of newly application in the list of application time slot, and upgrades the time slot of this new application
Adopt several concrete application scenarioss to be further detailed above-described embodiment below.
The first application scenarios is: the FI judgement that node A sends according to other nodes that receive bumps from accounting for time slot, and the packet that sends minimum remaining time from MAC buffer memory starts, according to sending incremental order remaining time, start to carry out time interval resource for each packet respectively and judge.
Consult shown in Fig. 7, in the embodiment of the present invention, suppose that current point in time is to comprise 8 time slots in 0, one Frame of time slot of Frame 2, node A has taken three time slots in a frame period: time slot 2, time slot 5 and time slot 7.In current transmission buffer memory, there are 3 packets to be sent, be packet a, packet b and packet c, each packet is kept at and sends (not being now the transmission remaining time sequence corresponding by packet) buffer memory according to the precedence that arrives MAC layer from high level, and three packets are specifically as shown in table 1 with the corresponding relation that sends remaining time.
The time slot state vector (table) of the current maintenance of node A is specifically as shown in table 2, and in time slot state vector (table), the seizure condition of each time slot is defined as: 10 represent to be taken by 1 hop node; 11 represent to be taken by two hop nodes; 01 represents collision time slot; 00 represents free timeslot or is taken time slot by three hop nodes:
Table 1
| Package identification | a | b | c |
| The remaining time that packet is corresponding | 6 | 3 | 8 |
Table 2
| |
|
|
|
|
|
|
|
| 00 | b:10 | a:10 | 00 | 00 | a：10 | 00 | a：10 |
So, to carry out the detailed process of time interval resource hit-treatment as follows for node A:
1): the FI that node A receives Node B transmission at the time slot 1 of Frame 2 is as follows:
Table 3
| |
|
|
|
|
|
|
|
| 00 | b:10 | a:10 | 00 | 00 | 01 | 00 | a：10 |
2): node A upgrades the time slot state vector (table) of self maintained according to the FI that receives other nodes transmissions, specifically as shown in table 4:
Table 4
| |
|
|
|
|
|
|
|
| 00 | b:10 | a:10 | 00 | 00 | 01 | 00 | a：10 |
3): node A bumps from accounting for time slot time slot 5 according to time slot state vector (table) judgement after upgrading, and will certainly account for time slot time slot 5 and delete from certainly account for time slot list.Meanwhile, node A is sending in buffer memory from sending the packet of minimum remaining time, and the order increasing progressively remaining time by transmission corresponding to packet is carried out time interval resource to each packet successively and judged, specific as follows:
Judge in transmission remaining time of timer corresponding to current packet indication, need the number of data packets sending whether to be less than or equal to the time interval resource number (comprising from accounting for time slot and application time slot) that node A uses
If so, process sending next packet in buffer memory;
Otherwise, starting the flow process of the new time interval resource of application, the application of new time interval resource is interval to be finished for the transmission that starts from current time to safeguard to timer corresponding to current data packet remaining time.
In the present embodiment, above-mentioned time interval resource judgement is specially:
Node A first checks the packet b that sends minimum remaining time, judge that the number of data packets that will send is that 1(only exists a packet b) in it sends remaining time (i.e. 2 time slots), be less than or equal to the i.e. time slot 2 of the current use number of time slot 1(of node A), therefore, node A (is that packet a) carries out time interval resource judgement to sending the next packet that sends minimum remaining time in buffer memory;
Node A checks packet a, judge the number of data packets that will send in it sends remaining time (i.e. 5 time slots) be 2(be packet a and packet b), be greater than the i.e. time slot 2 of the current use number of time slot 1(of node A), therefore, node A need to apply for new time interval resource within transmission remaining time of packet a.
Now, node A according to the time slot state vector (table) of the current maintenance in this locality (as, table 4) known, the current free timeslot existing within transmission remaining time of packet a has: time slot 3, time slot 4 and time slot 6, node A selects time slot 3 as new application time slot at random, will application time slot time slot 3 adding the application time slot list of ingress A, (is then that packet c) carries out time interval resource judgement to sending the next packet that sends minimum remaining time in buffer memory;
Node A checks packet c, judge its send remaining time (i.e. 7 time slots) the interior number of data packets that will send be 3(be packet a, packet b and packet c), being less than or equal to the current use number of time slot 3(of node A is time slot 2, time slot 5 and time slot 7), other packets are there are not owing to sending in buffer memory, therefore, this time hit-treatment process finishes, follow-up will be by the processing of normal data transmit-receive process.
It should be noted that, the time slot state vector (table) that the node A mentioning in the embodiment of the present invention safeguards, it can be the time slot state vector (table) that node A uses in normal renewal process, also can be the time slot state vector (table) of selecting for time interval resource (as " interim time slot state vector (table) " or " historical time slot state vector (table) ") that node A safeguards, the time slot state vector (table) of selecting for time interval resource can obtain by variety of way, the present invention does not limit, as generated or by the historical time slot state Information generation of nodes records by time slot state cache table.Why may select to apply for time slot by the interim time slot state vector (table) of preserving, due in some time slot state vector (table) maintenance mode, the time slot state vector (table) that node A safeguards can empty in the cycle, when adopting while safeguarding in this way time slot state vector (table), if after time slot state vector (table) has just emptied, node A finds that the time interval resource self using bumps, now because node A can not obtain Time Slot Occupancy situation information accurately, still can apply for Slot selection according to the free timeslot of current perception, thereby may choose the time slot that other nodes have taken, and then the Packet Generation of self and other nodes is impacted.
In this case, node may be reset time slot state vector (table) before at node at every turn, the time slot state information of record in time slot state vector (table) is shifted or partly transferred in interim time slot state vector (table), the time slot state indication information (maybe can be used for determining other information of time slot state) that the FI that time slot state information in interim time slot state vector (table) can send according to other nodes that receive in new reset cycle or node A low layer are submitted upgrades, current, also can not upgrade interim time slot state vector (table) by these information, but make in interim time slot state (vector) table content only in the time of each time slot state vector (table) replacement, upgrade according to the content in time slot state vector (table).
Shorter when the update cycle of time slot state vector (table), as 100ms, and when the periodicity change in topology of node is not very large, in interim time slot state vector (table), in the time slot state of reflection and time slot state vector (table), the time slot state difference of real-time update can be very not large, now, adopt interim time slot state table to carry out time interval resource application and can meet application demand.
The second application scenarios is: the FI judgement that node A sends according to other nodes that receive bumps from accounting for time slot, and the packet of the N+1 setting from MAC buffer memory starts, according to sending incremental order remaining time, start to carry out time interval resource for each packet respectively and judge.
Consult shown in Fig. 8, in the embodiment of the present invention, suppose that current point in time is to comprise 8 time slots in 0, one Frame of time slot of Frame 2, node A has three to use time slots in a frame period, and wherein time slot 2 and time slot 7 are from accounting for time slot, and time slot 5 is application time slot.In current transmission buffer memory, there are 3 packets to be sent, be packet a, packet b and packet c, each packet sorts from small to large by sending after entering and sending buffer memory remaining time, and three packets are specifically as shown in table 5 with the corresponding relation that sends remaining time.
The time slot state vector (table) of the current maintenance of node A is specifically as shown in table 6, and in time slot state vector (table), the seizure condition of each time slot is defined as: 10 represent to be taken by 1 hop node; 11 represent to be taken by two hop nodes; 01 represents collision time slot; 00 represents free timeslot or is taken time slot by three hop nodes:
Table 5
| Package identification | b | a | c |
| The remaining time that packet is corresponding | 3 | 6 | 8 |
Table 6
| |
|
|
|
|
|
|
|
| 00 | b:10 | a:10 | 00 | 00 | 00 | 00 | a：10 |
So, to carry out the detailed process of time interval resource hit-treatment as follows for node A:
1): the FI that node A receives Node B transmission at the time slot 1 of Frame 2 is specifically as shown in table 7:
Table 7
| |
|
|
|
|
|
|
|
| 00 | b:10 | a:10 | 00 | 00 | c：10 | 00 | a：10 |
2): node A upgrades the time slot state vector (table) of self maintained according to the FI receiving, specifically as shown in table 8:
Table 8
| |
|
|
|
|
|
|
|
| 00 | b:10 | a:10 | 00 | 00 | c：10 | 00 | a：10 |
3): node A is taken by node c according to time slot state vector (table) the judgement application time slot time slot 5 after upgrading, and bumps, and when node A will apply for, time slot gap 5 is deleted from the list of application time slot.Then determine from current time and start now only have one to use time slot to the spendable timeslot number N(of node A the time slot bumping, from accounting for time slot time slot 2, N=1), it is 2 that node A reads according to the N+1(N+1 value that sends sequence remaining time rear (increasing progressively) from send buffer memory) individual packet, be packet a, then, from packet a, by transmission incremental order remaining time corresponding to each packet, successively to packet a(comprise packet a) each packet afterwards carry out time interval resource judgement, specific as follows:
Judge in transmission remaining time of timer corresponding to current packet indication, need the number of data packets sending whether to be less than or equal to the time interval resource number (comprising from accounting for time slot and application time slot) that node A uses
If so, process sending next packet in buffer memory;
Otherwise, starting the flow process of the new time interval resource of application, the application of new time interval resource is interval to be finished for the transmission that starts from current time to safeguard to timer corresponding to current data packet remaining time.
In the present embodiment, above-mentioned time interval resource judgement is specially:
Node A checks packet a, judge the number of data packets that will send in it sends remaining time (i.e. 5 time slots) be 2(be packet a and packet b), be greater than the current only time slot 2 of use number of time slot 1(of node A), therefore, node A need to apply for new time interval resource within transmission remaining time of packet a.
Now, node A according to the time slot state vector (table) of the current maintenance in this locality (as, table 8) known, the current free timeslot existing within transmission remaining time of packet a has: time slot 3, time slot 4 and time slot 6, node A selects time slot 3 as new application time slot at random, will application time slot time slot 3 adding the application time slot list of ingress A, (is then that packet c) carries out time interval resource judgement to sending the next packet that sends minimum remaining time in buffer memory.
Node A checks packet c, judge its send remaining time (i.e. 7 time slots) the interior number of data packets that will send be 3(be packet a, packet b and packet c), being less than or equal to the current use number of time slot 3(of node A is time slot 2, time slot 5 and time slot 7), other packets are there are not owing to sending in buffer memory, therefore, this time hit-treatment process finishes, follow-up will be by the processing of normal data transmit-receive process.
Based on above-described embodiment, to consult shown in Fig. 9, in the embodiment of the present invention, first node comprises communication unit 90, determining unit 91 and main control unit 92, wherein,
Determining unit 91 while determining that the time slot self using bumps, is determined the packet of setting for the FI sending according to other nodes that receive in the packet of having preserved;
In sum, in the embodiment of the present invention, redesign the time slot collision processing method in car networking, propose in the time that node judges that the time interval resource (comprising from accounting for time slot and application time slot) self using bumps, from the packet of setting, according to sending incremental order remaining time, each packet sending in buffer memory is carried out to time interval resource judgement, and determining in transmission remaining time that any one packet is corresponding, when the number of data packets that need to send is greater than the number of time slot not bumping of the current use of first node, new time interval resource is applied in transmission based on this any one packet remaining time.Like this, in car networking time-division system, determine that, after the time interval resource that node uses bumps, the time interval resource of new application can meet the delay requirement that high level data bag sends, and has guaranteed the timely transmission of message, thus the performance of the car of effective guarantee networking.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt complete hardware implementation example, completely implement software example or the form in conjunction with the embodiment of software and hardware aspect.And the present invention can adopt the form at one or more upper computer programs of implementing of computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) that wherein include computer usable program code.
The present invention is with reference to describing according to flow chart and/or the block diagram of the method for the embodiment of the present invention, equipment (system) and computer program.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, the instruction that makes to carry out by the processor of computer or other programmable data processing device produces the device for realizing the function of specifying at flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, the instruction that makes to be stored in this computer-readable memory produces the manufacture that comprises command device, and this command device is realized the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make to carry out sequence of operations step to produce computer implemented processing on computer or other programmable devices, thereby the instruction of carrying out is provided for realizing the step of the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame on computer or other programmable devices.
Although described the preferred embodiments of the present invention, once those skilled in the art obtain the basic creative concept of cicada, can make other change and modification to these embodiment.So claims are intended to be interpreted as comprising preferred embodiment and fall into all changes and the modification of the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification and not depart from the spirit and scope of the embodiment of the present invention the embodiment of the present invention.Like this, if within these of the embodiment of the present invention are revised and modification belongs to the scope of the claims in the present invention and equivalent technologies thereof, the present invention is also intended to comprise these changes and modification interior.
Claims (12)
1. a collision processing method for time interval resource, is characterized in that, comprising:
First node often receives the new data packets that a high level issues, and described new data packets is preserved, and safeguard according to transmission delay corresponding to described new data packets the transmission remaining time of this new data packets;
When the frame information FI that first node sends according to other nodes that receive determines that the time slot self using bumps, in the packet of having preserved, determine the packet of setting;
First node in the packet of having preserved from the packet of described setting, according to sending the remaining time of order from small to large, successively each packet is carried out to time interval resource judgement, wherein, determining in transmission remaining time that any one packet is corresponding, need the number of data packets sending while being greater than the number of time slot not bumping of the current use of first node, new time interval resource is applied in the transmission based on described any one packet remaining time.
2. the method for claim 1, is characterized in that, first node is safeguarded the transmission remaining time of this new data packets according to transmission delay corresponding to described new data packets, comprising:
First node receives after described new data packets, determines the default transmission delay of corresponding described new data packets;
First node according to described transmission delay setting associated with described new data packets send the timer of remaining time for safeguarding, wherein, described transmission sign remaining time starts the latest duration length transmitting time point corresponding to the transmission delay of described new data packets from current time.
3. the method for claim 1, is characterized in that, the frame information FI that first node sends according to other nodes that receive determines that the time slot self using bumps, and comprising:
If the FI that first node sends according to other nodes that receive determines from accounting for time slot taken or bump by other nodes, judgement is described there is collision from accounting for time slot;
Before the time slot of new application arrives, if the FI that first node sends according to other nodes that receive determines that the time slot of described new application is taken or bumps by other nodes, judges that collision has occurred the time slot of described new application.
4. the method as described in claim 1,2 or 3, is characterized in that, first node is determined the packet of setting in the packet of having preserved, and comprising:
First node determines that the packet of transmission minimum remaining time is the packet of setting; Or,
First node is determined the packet from sending minimum remaining time, be the packet of setting according to sending N+1 the packet that remaining time, incremental order was arranged, wherein, N starts to backward first time slot bumping from current time, the number of time slot that first node can use.
5. method as claimed in claim 4, is characterized in that, remaining time is applied for new time interval resource in the transmission of first node based on described any one packet, comprising:
Remaining time is determined that application is interval in the transmission of first node based on described any one packet, and the interval corresponding duration of this application is to start to finish to transmission knot remaining time of described any one packet from current time slots;
First node is the new time interval resource of application in described application is interval.
6. method as claimed in claim 5, is characterized in that, first node is the new time interval resource of application in described application is interval, comprising:
First node, according to the time slot state information of local maintenance, judges in the application interval that described any one packet is corresponding, whether system exists free timeslot;
If so, in described free timeslot, select the time slot of a time slot as new application;
Otherwise, abandon described any one packet, and stop carrying out time interval resource judgement for follow-up data bag; Or,
Retain described any one packet, stop the time slot application process for this any one packet, and continue to carry out time interval resource judgement for follow-up data bag; Or,
From the packet of having preserved, choose one and send and be less than described any one packet and priority remaining time lower than the lower-priority data bag of described any one packet, the lower-priority data bag of choosing is deleted from buffer memory; Or,
In the time that corresponding described any one packet has been set time delay allowance and this time delay allowance and has been not 0, according to the transmission remaining time corresponding to described any one packet of time span renewal of time delay allowance indication, and select free timeslot as new application time slot in transmission remaining time after renewal, wherein, if still there is no free timeslot in the remaining time after upgrading, abandon described any one packet, and stop carrying out time interval resource judgement for follow-up data bag; Or, retain described any one packet, stop the time slot application process for this any one packet, and continue to carry out time interval resource judgement for follow-up data bag; Or from the packet of having preserved, choose one and send and be less than described any one packet and priority remaining time lower than the lower-priority data bag of described any one packet, the lower-priority data bag of choosing is deleted from buffer memory.
7. a hit-treatment device for time interval resource, is characterized in that, comprising:
Communication unit, the new data packets issuing for often receiving a high level, preserves described new data packets, and safeguards according to transmission delay corresponding to described new data packets the transmission remaining time of this new data packets;
Determining unit while determining that the time slot self using bumps, is determined the packet of setting for the frame information FI sending according to other nodes that receive in the packet of having preserved;
Main control unit, be used at the packet of having preserved from the packet of described setting, according to sending the remaining time of order from small to large, successively each packet is carried out to time interval resource judgement, wherein, determining in transmission remaining time that any one packet is corresponding, when the number of data packets that needs to send is greater than the number of time slot not bumping of the current use of first node, new time interval resource is applied in the transmission based on described any one packet remaining time.
8. device as claimed in claim 7, is characterized in that, described communication unit specifically for:
Receive after described new data packets, determine the default transmission delay of corresponding described new data packets;
According to described transmission delay setting associated with described new data packets send the timer of remaining time for safeguarding, wherein, described transmission sign remaining time starts the latest duration length transmitting time point corresponding to the transmission delay of described new data packets from current time.
9. device as claimed in claim 7, is characterized in that, described main control unit specifically for:
If the FI sending according to other nodes that receive determines from accounting for time slot taken or bump by other nodes, described in judging, from accounting for time slot, collision having occurred;
Before the time slot of new application arrives, if the FI sending according to other nodes that receive determines that the time slot of described new application is taken or bumps by other nodes, judges that collision has occurred the time slot of described new application.
10. the device as described in claim 7,8 or 9, is characterized in that, described determining unit specifically for:
The packet of determining transmission minimum remaining time is the packet of setting; Or,
Determine the packet from sending minimum remaining time, be the packet of setting according to sending N+1 the packet that remaining time, incremental order was arranged, wherein, N starts to backward first time slot bumping from current time, the number of time slot that first node can use.
11. devices as claimed in claim 10, is characterized in that, remaining time is applied for new time interval resource in the transmission of described main control unit based on described any one packet, comprising:
Remaining time is determined that application is interval in transmission based on described any one packet, and the interval corresponding duration of this application is to start to finish to transmission knot remaining time of described any one packet from current time slots;
The new time interval resource of application in described application is interval.
12. devices as claimed in claim 11, is characterized in that, described main control unit is the new time interval resource of application in described application is interval, comprising:
According to the time slot state information of local maintenance, judge in the application interval that described any one packet is corresponding, whether system exists free timeslot;
If so, in described free timeslot, select the time slot of a time slot as new application;
Otherwise, abandon described any one packet, and stop carrying out time interval resource judgement for follow-up data bag; Or,
Retain described any one packet, stop the time slot application process for this any one packet, and continue to carry out time interval resource judgement for follow-up data bag; Or,
From the packet of having preserved, choose one and send and be less than described any one packet and priority remaining time lower than the lower-priority data bag of described any one packet, the lower-priority data bag of choosing is deleted from buffer memory; Or,
In the time that corresponding described any one packet has been set time delay allowance and this time delay allowance and has been not 0, according to the transmission remaining time corresponding to described any one packet of time span renewal of time delay allowance indication, and select free timeslot as new application time slot in transmission remaining time after renewal, wherein, if still there is no free timeslot in the remaining time after upgrading, abandon described any one packet, and stop carrying out time interval resource judgement for follow-up data bag; Or, retain described any one packet, stop the time slot application process for this any one packet, and continue to carry out time interval resource judgement for follow-up data bag; Or from the packet of having preserved, choose one and send and be less than described any one packet and priority remaining time lower than the lower-priority data bag of described any one packet, the lower-priority data bag of choosing is deleted from buffer memory.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210457375.1A CN103813469B (en) | 2012-11-14 | 2012-11-14 | Method and device for collision treatment of time slot resources |
| PCT/CN2013/086272 WO2014075556A1 (en) | 2012-11-14 | 2013-10-31 | Slot resource collision processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210457375.1A CN103813469B (en) | 2012-11-14 | 2012-11-14 | Method and device for collision treatment of time slot resources |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103813469A true CN103813469A (en) | 2014-05-21 |
| CN103813469B CN103813469B (en) | 2017-02-01 |
Family
ID=50709522
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210457375.1A Active CN103813469B (en) | 2012-11-14 | 2012-11-14 | Method and device for collision treatment of time slot resources |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN103813469B (en) |
| WO (1) | WO2014075556A1 (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105450334A (en) * | 2014-08-26 | 2016-03-30 | 电信科学技术研究院 | Data sending method in Internet-of-vehicles system and node device |
| WO2017024944A1 (en) * | 2015-08-12 | 2017-02-16 | 电信科学技术研究院 | Method and apparatus for sending and broadcasting resource information |
| TWI575999B (en) * | 2014-10-31 | 2017-03-21 | 瑞昱半導體股份有限公司 | Wireless communication system, method and device under contention-based protocol |
| CN106534233A (en) * | 2015-09-09 | 2017-03-22 | 电信科学技术研究院 | Resource detection method and device |
| CN106559811A (en) * | 2015-09-28 | 2017-04-05 | 展讯通信（上海）有限公司 | Bluetooth data reception control method and device |
| CN106936539A (en) * | 2015-12-29 | 2017-07-07 | 北京大唐高鸿数据网络技术有限公司 | The method that MAC layer obtains channel status in real time in vehicular ad hoc net |
| CN107360204A (en) * | 2016-05-10 | 2017-11-17 | 北京信威通信技术股份有限公司 | A kind of Forecasting Methodology and device of car networking Cooperation presentiment message generation time |
| US9894466B2 (en) | 2014-10-24 | 2018-02-13 | Mediatek Inc. | Method and apparatus for determining silence time |
| WO2020024961A1 (en) * | 2018-08-01 | 2020-02-06 | 华为技术有限公司 | Data processing method, device, and system |
| CN111556465A (en) * | 2020-04-30 | 2020-08-18 | 济南大学 | Distributed car networking MAC (media Access control) layer time slot access method and system based on TDMA (time division multiple Access) technology |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3163916B1 (en) * | 2014-07-31 | 2019-06-19 | Huawei Technologies Co., Ltd. | Device and method for sending vehicle broadcast information |
| CN106302585B (en) * | 2015-05-25 | 2019-05-10 | 电信科学技术研究院 | A kind of the detection indicating means and device of resource collision |
| CN106686653B (en) * | 2015-11-05 | 2019-08-30 | 电信科学技术研究院 | Method for spacial multiplex, device and the node of bus or train route Turbo Detection for Cooperative Communication running time-frequency resource |
Citations (7)
| 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 (en) * | 2004-02-12 | 2007-02-21 | 皇家飞利浦电子股份有限公司 | A method of distributed allocation for a medium access control, a method for re-organizing the sequence devices access a medium, a method for avoiding collision, a method of synchronizing devices in a |
| CN101034932A (en) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | Fast precontract and line transmission multi-address access method |
| CN101360339A (en) * | 2008-09-28 | 2009-02-04 | 熊猫电子集团有限公司 | Access control method fusing TD-SCDMA cell phone network and self-organizing network |
| CN101562903A (en) * | 2005-10-19 | 2009-10-21 | 株式会社Ntt都科摩 | Method for accessing hybrid network and gateway equipment, wireless terminal and communication system thereof |
| US20120230370A1 (en) * | 2011-03-08 | 2012-09-13 | Cisco Technology Inc. | Efficient Transmission of Large Messages in Wireless Networks |
| CN102695265A (en) * | 2012-01-09 | 2012-09-26 | 河南科技大学 | Hybrid mechanism media access control (MAC) protocol communication method based on wireless sensor network |
-
2012
- 2012-11-14 CN CN201210457375.1A patent/CN103813469B/en active Active
-
2013
- 2013-10-31 WO PCT/CN2013/086272 patent/WO2014075556A1/en active Application Filing
Patent Citations (7)
| 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 (en) * | 2004-02-12 | 2007-02-21 | 皇家飞利浦电子股份有限公司 | A method of distributed allocation for a medium access control, a method for re-organizing the sequence devices access a medium, a method for avoiding collision, a method of synchronizing devices in a |
| CN101562903A (en) * | 2005-10-19 | 2009-10-21 | 株式会社Ntt都科摩 | Method for accessing hybrid network and gateway equipment, wireless terminal and communication system thereof |
| CN101034932A (en) * | 2007-02-08 | 2007-09-12 | 北京航空航天大学 | Fast precontract and line transmission multi-address access method |
| CN101360339A (en) * | 2008-09-28 | 2009-02-04 | 熊猫电子集团有限公司 | Access control method fusing TD-SCDMA cell phone network and self-organizing network |
| US20120230370A1 (en) * | 2011-03-08 | 2012-09-13 | Cisco Technology Inc. | Efficient Transmission of Large Messages in Wireless Networks |
| CN102695265A (en) * | 2012-01-09 | 2012-09-26 | 河南科技大学 | Hybrid mechanism media access control (MAC) protocol communication method based on wireless sensor network |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105450334B (en) * | 2014-08-26 | 2018-08-07 | 大唐电信科技产业控股有限公司 | Data transmission method for uplink and node device in a kind of car networking system |
| CN105450334A (en) * | 2014-08-26 | 2016-03-30 | 电信科学技术研究院 | Data sending method in Internet-of-vehicles system and node device |
| US9894466B2 (en) | 2014-10-24 | 2018-02-13 | Mediatek Inc. | Method and apparatus for determining silence time |
| TWI575999B (en) * | 2014-10-31 | 2017-03-21 | 瑞昱半導體股份有限公司 | Wireless communication system, method and device under contention-based protocol |
| WO2017024944A1 (en) * | 2015-08-12 | 2017-02-16 | 电信科学技术研究院 | Method and apparatus for sending and broadcasting resource information |
| US10645634B2 (en) | 2015-08-12 | 2020-05-05 | China Academy Of Telecommunications Technology | Method and apparatus for sending and broadcasting resource information |
| CN106534233A (en) * | 2015-09-09 | 2017-03-22 | 电信科学技术研究院 | Resource detection method and device |
| CN106534233B (en) * | 2015-09-09 | 2019-07-05 | 电信科学技术研究院 | A kind of resource detection method and device |
| CN106559811A (en) * | 2015-09-28 | 2017-04-05 | 展讯通信（上海）有限公司 | Bluetooth data reception control method and device |
| CN106559811B (en) * | 2015-09-28 | 2019-11-22 | 展讯通信（上海）有限公司 | Bluetooth data reception control method and device |
| CN106936539B (en) * | 2015-12-29 | 2019-07-26 | 北京大唐高鸿数据网络技术有限公司 | The method that MAC layer obtains channel status in real time in vehicular ad hoc net |
| CN106936539A (en) * | 2015-12-29 | 2017-07-07 | 北京大唐高鸿数据网络技术有限公司 | The method that MAC layer obtains channel status in real time in vehicular ad hoc net |
| CN107360204A (en) * | 2016-05-10 | 2017-11-17 | 北京信威通信技术股份有限公司 | A kind of Forecasting Methodology and device of car networking Cooperation presentiment message generation time |
| CN107360204B (en) * | 2016-05-10 | 2020-06-16 | 北京信威通信技术股份有限公司 | Method and device for predicting generation time of Internet of vehicles cooperative early warning message |
| WO2020024961A1 (en) * | 2018-08-01 | 2020-02-06 | 华为技术有限公司 | Data processing method, device, and system |
| US11463346B2 (en) | 2018-08-01 | 2022-10-04 | Huawei Technologies Co., Ltd. | Data processing method, device, and system |
| CN111556465A (en) * | 2020-04-30 | 2020-08-18 | 济南大学 | Distributed car networking MAC (media Access control) layer time slot access method and system based on TDMA (time division multiple Access) technology |
| CN111556465B (en) * | 2020-04-30 | 2023-12-22 | 北京白龙马云行科技有限公司 | Distributed Internet of vehicles MAC layer time slot access method and system based on TDMA technology |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2014075556A1 (en) | 2014-05-22 |
| CN103813469B (en) | 2017-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103813469A (en) | Method and device for collision treatment of time slot resources | |
| EP2922339B1 (en) | Method and device for scheduling slot resources | |
| CN104469855B (en) | A kind of system of selection of time interval resource and device | |
| JP5003467B2 (en) | Radio resource allocation limiting system, roadside device, radio resource allocation limiting method, and radio resource allocation limiting program | |
| KR102197461B1 (en) | Method and apparatus for determining resource occupancy status | |
| CN103973387A (en) | Method and device for maintaining time slot state information | |
| CN103379650B (en) | A kind of decision method of resource collision and device | |
| CN105516214A (en) | Information reporting method, resource allocating method, information reporting device and resource allocating device in Internet-of-vehicles system | |
| CN103687045A (en) | Method and device for service sending | |
| CN103684645A (en) | Time slot collision processing method and device | |
| CN103813458B (en) | Time slot distribution method and device | |
| KR102027047B1 (en) | Preemptive resource allocation within the wireless network for event-triggered transmission | |
| KR20180061302A (en) | Message delivery method and user equipment | |
| JP2009522841A (en) | System and method for controlling congestion in a dedicated narrow area communication system | |
| CN103974440A (en) | Processing method and device for time slot resources in Internet of vehicles | |
| CN104918281A (en) | Data transmission method and device | |
| CN103841562A (en) | Time slot resource occupation processing method and time slot resource occupation processing device | |
| CN103812791A (en) | Data packet transmitting method and device | |
| CN109714824B (en) | Semi-persistent scheduling resource allocation method and base station | |
| US20120099541A1 (en) | Apparatus and method for operating multi-channel based on wireless access in vehicular environments | |
| Yang et al. | Priority-based hybrid MAC protocol for VANET with UAV-enabled roadside units | |
| CN104581819A (en) | Slot resource collision determination method and device | |
| CN105025513A (en) | Slot state maintenance method and apparatus | |
| JP2009130751A (en) | Resource reservation apparatus, system, and method | |
| CN103686741A (en) | Cancellation method and device of slot resources |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211224 Address after: 400040 No. 35, Jinghe Road, Huxi street, high tech Zone, Shapingba District, Chongqing Patentee after: Datang Gaohong Zhilian Technology (Chongqing) Co.,Ltd. Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY |
|
| TR01 | Transfer of patent right |