CN100452745C - Multi-address access method with the confliction decomposition - Google Patents
Multi-address access method with the confliction decomposition Download PDFInfo
- Publication number
- CN100452745C CN100452745C CNB2007100640224A CN200710064022A CN100452745C CN 100452745 C CN100452745 C CN 100452745C CN B2007100640224 A CNB2007100640224 A CN B2007100640224A CN 200710064022 A CN200710064022 A CN 200710064022A CN 100452745 C CN100452745 C CN 100452745C
- Authority
- CN
- China
- Prior art keywords
- node
- reservation
- conflict
- inserts
- centroid
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The related multiple access method with conflict decomposition comprises: setting order-access and conflict decomposition period and required transmission period; in the set period, prompting at every node to select corresponding order-access time slot for order application; according to conflict clew from central node, at the conflict node, transmitting forecast burst group to decompose the order application conflict; using the central node to allocate channel resource for successful node and alternative transmit business group at required transmission period together. This invention fast solves access conflict, and improves channel throughout.
Description
Technical field
The present invention relates to a kind of multiple access method, relate in particular to a kind of multiple access method with the conflict decomposition.
Background technology
Multiple access method is used for a plurality of nodes or the user realizes fast, efficient, fair, shared channel resources reliably, according to the mode of channel allocation, is divided into fixed allocation, the three kinds of multiple access methods that insert and distribute according to need at random.
Wherein, the multiple access method of fixed allocation is general long-time with channel resource some node or all nodes of assigned for shared channel regularly.The problem that this method exists is, owing to have a large amount of mobile nodes in each mobile radio communication network, and the business of each node is also many based on burst service, therefore adopt the cut-in method of fixed allocation can cause the idle and waste of a large amount of channel resources, be not suitable in mobile radio communication network, directly using.
In the multiple access method of Jie Ruing, each node uses channel according to the situation of carrier sense through competition behind the random delay usually at random.It can solve the channel resource waste problem in the fixed allocation multiple access method, and in traffic carrying capacity hour, access delay is very little.The problem that this method exists is, when each node is shared wireless broadcast channel in the multihop network structure, owing to use channel in mode based on carrier sense, concealed terminal and exposed terminal problem have appearred, make multiple access performance reduce greatly, particularly when sending node number and network traffic increase, the probability of packet collisions and re-transmission sharply strengthens, thereby increased average packet time delay and average packet loss ratio greatly, reduced channel throughput, also occurred the inequitable problem of shared channel simultaneously
In the demand assigned multiple access method, each node re-uses channel resource according to service conditions request channel resource after the success, when having solved the increase of sending node number and network traffic, and the problem that the probability of packet collisions and re-transmission can sharply strengthen.The demand assigned multiple access method is different according to application reservation and allocated channel mode, can be divided into again based on competition at random with based on there not being conflict two classes, method based on competition at random mainly adopts various short control groupings to shake hands (as sending request/removing request, RTS/CTS), periodic status information exchange distributed appointment mode, be suitable for of the business transmission of sudden strong, message transfer than short type, as IEEE 802.11 distributed coordination function (DCF), two busy tone multiple access (DBTMA) and distributed packet reservation multiple access methods such as (DPRMA); Mainly utilize center control nodes to coordinate to realize distribution according to need based on conflict free method, be applicable to the type of service that needs the long period stable transfer after once access is set up, and can provide good service quality (QoS) to guarantee, its typical case's representative polling mechanisms that use as IEEE 802.11 point coordination function (PCF) and virtual base station methods such as (VBS) more.The problem that the demand assigned multiple access method exists is, refers to an access method based on the distribution according to need of competition at random more and still has packet collisions in the application reservation section, and the influence of concealed terminal has just obtained weakening, do not eliminated; Though refer to an access the generation that method can be avoided the packet collisions situation based on conflict free distribution according to need, when many nodes did not send, this method can be wasted a large amount of poll control expenses more.At present, the demand assigned multiple access method when network traffic is low, compare with the multiple access method that inserts at random have that control expense proportion is excessive, access and the bigger problem of propagation delay time; When network traffic is higher, compare the problem that exists the maximum channel throughput not high enough with the multiple access method of fixed allocation, can not guarantee the fairness problem of shared channel simultaneously.
At last, in actual applications, the multi-hop distributed wireless networks all is difficult to realize the accurately synchronous of the whole network, and above-mentioned having now in all kinds of multiple access methods, great majority need could realize that all therefore above-mentioned existing multiple access method is difficult to realize comparatively accurately in foundation under the Network Synchronization prerequisite.
Summary of the invention
The objective of the invention is to problem, propose a kind of multiple access method, both can improve the throughput of channel resource, can solve the access interference problem fast again, realize that channel is used in nothing conflict access fast with the conflict decomposition at the prior art existence.
For achieving the above object, the invention provides a kind of multiple access method, may further comprise the steps with the conflict decomposition:
Be provided with that reservation inserts and conflict decomposition phase and transmission period as required;
The reservation application conflict prompting of described Centroid is specially: the result that described Centroid sends announces grouping, and this result announces that comprising a plurality of nodes in the grouping sends the information of access reservation grouping and certain node sends access reservation grouping on the reservation time slot information on same described access reservation time slot; This result is provided with the forecast burst mini-slot after announcing grouping;
Insert and the conflict decomposition phase in described reservation, each node inserts according to the reservation of Centroid and begins prompting, selects the corresponding reservation time slot that inserts to preengage application; The node that reservation application conflict takes place is preengage application conflict prompting according to described Centroid, preengages the conflict decomposition of application by sending forecast burst group; Described Centroid is the node allocation of channel resources may that successfully inserts;
At described transmission period as required, described Centroid alternately sends traffic packets with the node that success inserts.
Be set to that reservation inserts period and conflict decomposition phase and transmission period as required by Channel Transmission, make packet collisions exist only in reservation access and conflict decomposition phase, solved the access interference problem in reservation access and conflict decomposition phase, greatly reduce the adverse effect that concealed terminal in the higher time reservation of traffic carrying capacity and exposed terminal bring to Channel Transmission, eliminated the possibility that clashes in the traffic packets process of transmitting.And, the reservation of Centroid inserts and begins prompting, reservation application conflict prompting and traffic packets and be sent as each node and send all kinds of groupings synchronous base is provided, thereby realized exactly that simply the channel resource under the asynchronous condition is shared, eliminated multiple access and inserted the accurately synchronous requirement of multi-hop wireless network the whole network; Simultaneously, after sending all traffic packets of this meeting, discharge shared channel resource immediately, insert in order to other nodes and use, improved the throughput of channel greatly.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Description of drawings
Fig. 1 is channel transmission timing schematic diagram in the multiple access method of band conflict decomposition of the present invention;
Fig. 2 is the flow chart of the multiple access method preferred embodiment of band conflict decomposition of the present invention;
Fig. 3 realizes the schematic diagram that conflict is decomposed for utilizing the FB mini-slot among Fig. 2 embodiment;
Fig. 4 is the flow chart that reservation inserts and the decomposition phase of conflicting is inserted and conflicts and decompose among Fig. 2 embodiment;
Fig. 5 is the particular flow sheet of conflict decomposable process among Fig. 2 embodiment.
Embodiment
Each Centroid and each node portion have only a semiduplex radio receiving-transmitting unit.All kinds of groupings of each node send and can be received by neighbors and Centroid, if the traffic packets of each node (Packet is hereinafter to be referred as PKT) mails to neighbors, carry out transfer with regard to the Centroid under needing so.Belonging between each node of same Centroid can (promptly can direct communication at a distance of one jumping, the all each other neighborss of both sides), also can be at a distance of double bounce (promptly needing intermediate node transfer both sides' grouping), like this, the possibility that the not predetermined in advance broadcast transmission of node has just caused concealed terminal and exposed terminal problem to occur under the Centroid.The multiple access method that band conflict of the present invention is decomposed has been eliminated the adverse effect that concealed terminal and exposed terminal cause the traffic packets process by before sending traffic packets the access interference that takes place being decomposed.Concrete principle is: Channel Transmission is divided into two periods or two stages: each inserts the usufructuary reservation of node acquisition channel of using channel and inserts and the conflict catabolic phase, and the nothing of the successful access node conflict traffic packets transmission stage, be thereafter the duplication stages of going round and beginning again.
Insert and the conflict decomposition phase in reservation, after Centroid is determined the reservation access number, send reservation beginning (Start of Reservation, hereinafter to be referred as SR) divide into groups to point out each node to insert, each node selects different thereafter access reservation (AccessReservation is hereinafter to be referred as AR) time slots to preengage application according to a certain probability distribution rule; As if application conflict (promptly work as two or more access nodes and send access reservation grouping on the crack at this moment) takes place to preengage.Centroid sends the result and announces (Result Broadcasting is hereinafter to be referred as RB) grouping, informs this situation of each node; Each access interference node is preengage the conflict decomposable process subsequently, rely on each node forecast burst (Forcast Burst, hereinafter to be referred as FB) grouping initial transmitting time, last the FB busy tone of length difference and Centroid, the transmission situation that FB successfully divides into groups, Centroid can be distinguished the access situation of each node, judge which node can successfully obtain to insert, and announce the conflict decomposition result based on this; If success (promptly having only an access node to send on the crack at this moment).Centroid sends the RB grouping and point out that in the RB grouping the successful node of which access sends, and distributes corresponding channel resources promptly for successful access node on which traffic packets sending time slots; After this, enter conflict free traffic packets and send the stage, Centroid and each insert successful node and alternately send the traffic packets Centroid and can utilize subsidiary poll token or poll control grouping (when not having traffic packets to send) in institute's sending service grouping, point out certain node to send traffic packets after this grouping; After all nodes that successfully insert distribute traffic packets, just enter the next round reservation and insert and the transmission stage, repeat said process.
For the node that sent traffic packets, continue to continue to use last sending time slots and send, all traffic packets transmissions of meeting until this communication finish.If node is last traffic packets that sends in this meeting, the subsidiary channel resource sign that discharges in traffic packets can arrange other nodes send traffic packets at this channel resource from next frame after Centroid is received so.When there not being channel resource can divide timing, Centroid is closed the reservation access phase, directly enters traffic packets and sends the stage, just recovers the reservation access phase after having successfully access node to discharge channel resource once more.
And; Centroid utilizes the SR grouping; the RB grouping; sending to each node of traffic packets and poll groupings provides the synchronous base that sends all kinds of groupings; promptly divide into groups with SR; the RB grouping; time reference (or benchmark constantly) when compete access or send traffic packets as all nodes the finish time that traffic packets and poll groupings send; here each time slot has comprised the transmitting time of all kinds of groupings and has overcome signal transmission delay; transceiver change-over time etc. necessary guard time at interval; thereby it is simple; realized that exactly the channel resource under the asynchronous condition is shared, eliminated multi-hop wireless network is realized accurately synchronous requirement of the whole network.
Fig. 1 is channel transmission timing schematic diagram in the multiple access method of band conflict decomposition of the present invention.Wherein, J1 is that reservation last time inserts and the conflict decomposition phase reaches transmission period as required, and J2 inserts and the conflict decomposition phase for this reservation, and J21 is the reservation application stage among the J2, and wherein, the AR time slot has N
ARIndividual, N
ARDefinite method can be specially: if there is not available channel resource, then the quantity of AR time slot becomes 0, treats to become non-0 behind the available channel resource; If access interference is many, increase the quantity of AR time slot: if access interference is few, reduce the quantity of AR time slot, until being 1.Like this, can under the prerequisite that does not influence the reservation access, increase time, raising channel throughput that traffic packets sends as much as possible.If no idle channel resources, cancellation access phase, node to be had use and allow access again after channel discharges channel resource, can avoid meaningless access, improve channel throughput.J22 is the reservation conflict catabolic phase among the J2, and J221 is a preceding m FB mini-slot among the J22, and J222 is a back n FB mini-slot among the J22; J3 is this transmission period as required, and J31 represents that PKT is that Centroid sends, and J32 represents that PKT is that each node sends, and Centroid and each successful access node alternately send PKT, and to the last a successful access node sends PKT.
Be example with node A, B, C, D and E now, and after the hypothesis SR grouping 4 AR time slots, m=5, n=4 arranged, the multiple access method that band conflict of the present invention is decomposed further describes.Referring to Fig. 2.
Specifically may further comprise the steps:
Step 11, each node reservation of Centroid broadcasting SR grouping prompting insert beginning, and 4 AR time slots are arranged thereafter;
In the SR grouping, can specify the priority that will send PKT, adopt the mode of priority restriction, indicating the traffic packets that only is higher than this priority could send, like this, have the node of this type of priority service grouping could preengage access, thereby the traffic packets that has guaranteed high priority is preferentially sent
Step 12, node A, B, C, D and E select the 1st, 1,2,3,3 time slot in 4 AR time slots to insert respectively, promptly send the AR grouping on corresponding selected AR time slot; At this moment, because A and B, D and E send the AR grouping at same AR time slot 1,3 respectively, A and B produce reservation application conflict, and D and E produce reservation application conflict.Wherein, each node can select in 4 AR time slots s AR time slot to preengage access at random, also can select the AR time slot at random equiprobably, perhaps obeys certain probability distribution and selects the AR time slot.
Whether step 13, Centroid judge whether to exist the reservation access interference, promptly exist two or more nodes to send the AR grouping on an AR time slot, if then execution in step 14, otherwise, execution in step 16:
After step 14,4 AR time slots finished, Centroid sent the RB grouping, and announce and insert the result: node C preengages successfully, and the 1st and the 3rd AR time slot clash (or AR packet collisions).Thereby node A, B, D and E learn oneself reservation access failure, and node C learns and oneself inserts successfully:
Step 15, owing to there is the reservation access interference.Therefore, enter reservation conflict decomposable process,, specifically may further comprise the steps referring to Fig. 5:
Step 21, maximum 9 (m=5 are arranged behind the RB time slot, n=4) individual FB mini-slot, access interference node A, B, D, E are chosen in according to certain probability distribution in advance and are ready for sending j (1≤j≤n) individual FB grouping on i the FB mini-slot, select FB mini-slot separately, the FB grouping number that equiprobability is selected transmission such as equiprobability, in the present embodiment, access interference node A, B, D and E estimate to select respectively i=2, (1≤i≤m) preparing respectively, running fire j=4,3,4,2 FB's 5,3,2 FB mini-slot divide into groups
Node A, E do not listen to FB grouping, FB busy tone or RB grouping at the 1st FB mini-slot in step 23, the present embodiment, learn the FB mini-slot free time, do not have transmission, just send their FB grouping according to schedule from the 2nd FB mini-slot.
Step 24, on the 2nd, 3 FB mini-slot, the FB grouping that node A and E send is sent in the Centroid place and bumps, and sends the FB busy tone at the 2nd, 3 this FB mini-slot at once after Centroid is received, lasts this two FB mini-slot.Other access nodes (as the Node B and the D of this example) are received the FB grouping that node A, E send, and perhaps behind the FB busy tone that Centroid sends, cancel original FB grouping at once and send.As long as the FB mini-slot clashes, Centroid portion sends the FB busy tone at once, after Centroid sends the FB busy tone of two FB mini-slot, owing to have only access node A to send the FB grouping, therefore Centroid can correctly be received this FB grouping, this moment, Centroid judged that by two kinds of methods access node A wins: the one, if contain the ID of sending node in the FB grouping, Centroid just can send FB and successfully divide into groups on next FB time slot, tell other node access nodes A success, and after the FB of access node A grouping sends end, send the RB grouping; The 2nd, if do not contain the ID of node in the FB grouping, Centroid is after all FB groupings send by the time so, and transmission RB grouping is published in the node that sends 4 FB groupings on the 2nd the FB time slot and inserts successfully, and distributes to corresponding resource; Mean that promptly node A inserts successfully, execution in step 16
Step 25, node listen to that FB busy tone, FB that FB grouping or Centroid send successfully divide into groups or the RB grouping after, cancel original FB grouping transmission plan at once.For this Node B, D, the E of reservation access failure, need to wait for that reservation next time inserts and the conflict decomposition phase, perhaps under sending the prompting of RB grouping, Centroid enters next conflict decomposable process, reattempt access.
When at AR time slot generation access interference, Centroid transmission RB grouping declaration enters the conflict catabolic phase, and all do not insert successful node and all will insert according to the conflict decomposition of conflict decomposition method participation FB mini-slot.In order to guarantee that more node inserts, Centroid inserts and conflict decomposition phase setting N in the reservation of a frame
CRIndividual conflict decomposable process.Promptly, Centroid is after the RB grouping of announcing the conflict decomposition result for the first time, continue to be provided with the FB mini-slot, the quantity of FB mini-slot is not more than Centroid sends the FB mini-slot of RB grouping back setting for the first time at this frame quantity, carry out the conflict second time of this frame and decompose, finish the N of setting until the centromere node
CRIndividual reservation conflict decomposable process.If conflict all can not be decomposed fully and also had idle channel resources, Centroid to continue to keep or increase the number of reservation conflict decomposable process in the continuous multiple frames after doing like this.Do not have node to insert in certain the reservation conflict decomposable process in the frame, Centroid just knows that the conflict decomposition finishes, and will cancel back reservation conflict decomposable process and directly enter traffic packets sending the stage.In addition, N
CRAlso can be according to what and adaptive change of idle channel resources, promptly at (whether sign is at the decomposable process of continuation conflict thereafter in promptly dividing into groups by the RB in broadcast transmission) repeated collisions decomposable process under the Centroid control, till no longer including the conflict generation or not having idle channel resources.
If reservation inserts and the conflict decomposition phase does not finish, then continue under the prompting of Centroid, to preengage application, i.e. reservation inserts and the decomposition that conflicts is interim can carry out the many wheel reservation accesses and the decomposable process that conflicts, and its number is relevant with the access interference number with the residue idle channel resources; At this moment, when the number of successful access node in this Channel Transmission reached maximum the permission, Centroid also can finish reservation inserts and the conflict decomposition phase directly enters transmission period as required; If reservation inserts and the conflict decomposition phase finishes, this Channel Transmission enters transmission period as required.
Step 16, Centroid send the RB grouping, announce that reservation inserts the result, and when the reservation access interference not occurring, then the result of Gong Buing is: node A, B, C, D, E insert successfully; Under the situation that the reservation access interference occurs, decompose through conflict, the result of announcement is: node A, C insert successfully.
When a certain node wherein send be last PKT during this is met the time, be provided with the sign that discharges channel resource among this PKT, after Centroid receives this sign, just this node is shared channel is distributed to other nodes at next frame according to the result that reservation inserts, thereby has improved the throughput of channel resource.
Among the present invention, conflict is decomposed can be so that each access interference node successfully inserts with very big probability, and this can make the very fast access of access node use channel, reduce access delay.And when a frame did not need to carry out the access interference decomposition, theoretical throughput was S=2N
PKTt
PKT/ [t
SR+ N
ARt
AR+ t
RB+ 2N
PKTt
PKT]; When every frame has only the theoretical minimum throughout of an access interference decomposable process is S=2N
PKTt
PKT/ [t
SR+ N
ARt
AR+ 2t
RB+ (m+n) t
FB+ 2N
PKTt
PKT]; When every frame has a plurality of (as N
CRIndividual) the theoretical minimum throughout of access interference decomposable process is S=2N
PKTt
PKT/ [t
SR+ N
ARt
AR+ (N
CR+ 1) t
RB+ N
CR(m+n) t
FB+ 2N
PKT-t
PKT].Wherein, S is the throughput on the channel, t
PKT, t
SR, t
AR, t
RBAnd t
FBBe respectively the transmitting time of PKT, SR grouping, AR grouping, RB grouping and FB grouping, N
PKTBe every number of taking turns each successful access node in the alternately traffic packets transmission on the channel.N
ARBe the number of AR time slot in each reservation access phase, N
CREach takes turns under the frame length fixation case N for the number of access interference decomposable process in each reservation access phase
PKTWith N
ARAnd t
ARRelevant, each frame length of taking turns also can insert situation with node to be changed flexibly
Reservation under above various situations inserts and the conflict decomposition phase, N
PKTCan be 1, mean that all want access node all to send the AR grouping on unique AR time slot,, just enter the conflict decomposable process if clash.
Centroid determines to insert the number N of reservation time slot according to the situation of current idle channel resources and access interference
ARNumber N with the conflict decomposable process
CRParticipate in the competition as multiple access node more and to insert and when idle channel resources is arranged, just increase N
ARAnd N
CR, so that allow more nodes successfully insert; When the node number that inserts when participating in the competition reduces, just reduce N
ARAnd N
CR, so that guaranteeing that node improves channel throughput under having than the prerequisite of ten-strike access probability as much as possible.
And, reservation inserts and traffic packets sends separately, only preengage access phase conflict is arranged, in the traffic packets transmission, eliminated and collided possible advantage, reservation flexibly insert and method of adjustment can so that node more quickly and efficiently access channel, finished the no conflict transmission of traffic packets to greatest extent, thereby improved channel throughput, reduced access delay, avoided inserting the grouping that is caused and abandon by multiple access.Mode in that the reservation access phase adopts priority to limit has guaranteed that the traffic packets of high priority is preferentially sent.Since can allow the node of certain priority service preferentially to preengage to insert and each successful access node can be periodically, ensuring escapement from confliction sends traffic packets, node can also obtain having in each frame the chance of more business grouping transmission from the Centroid application, therefore, the present invention is particularly suitable for the transmission of real time business, has satisfied service quality (QoS) requirements such as time delay and required transmission rate simultaneously.The shared channel fairness problem that is occurred when traffic carrying capacity increases can utilize Centroid adjustment, the too much successful access in reservation inserts of restriction individual nodes to solve, such as, after node successfully insert to use channel 2 times continuously, Centroid is according to inserting at present collision situation when serious (if), regulation is also announced in this node certain hour and can not be inserted, and this node is being attempted inserting through beginning after this time again.
Among the present invention, Centroid and each node only have a semiduplex transceiver, and equipment requirements is simple.In addition, the present invention be applicable to any a plurality of node can with Centroid by the broadcast type medium be connected communication a plurality of node access infrastructures, the scope of application is extensive.
In sum, but the present invention has the channel throughput height, access delay is little, discarded ratio of packet is low, QoS is guaranteed, the transceiver equipment requirement is simple, the advantage of extensively asynchronous system work of the scope of application, each nodes sharing channel justice.
It should be noted last that, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, although the present invention is had been described in detail with reference to preferred embodiment, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not break away from the spirit and scope of technical solution of the present invention.
Claims (11)
1, a kind of multiple access method with the conflict decomposition is characterized in that, may further comprise the steps:
Be provided with that reservation inserts and conflict decomposition phase and transmission period as required;
Insert and the conflict decomposition phase in described reservation, each node inserts according to the reservation of Centroid and begins prompting, selects the corresponding reservation time slot that inserts to preengage application; The reservation application conflict prompting of the node of application conflict according to described Centroid takes place to preengage, and preengages the conflict decomposition of application by sending forecast burst group; Described Centroid is the node allocation of channel resources may that successfully inserts;
The reservation application conflict prompting of described Centroid is specially: the result that described Centroid sends announces grouping, and this result announces that comprising a plurality of nodes in the grouping sends the information of access reservation grouping and certain node sends access reservation grouping on the reservation time slot information on same described access reservation time slot; This result is provided with the forecast burst mini-slot after announcing grouping;
At described transmission period as required, described Centroid alternately sends traffic packets with the node that success inserts.
2, method according to claim 1 is characterized in that, the reservation of described Centroid inserts and begins further to comprise priority parameters in the prompting.
3, method according to claim 1 and 2, it is characterized in that, described selection inserts the reservation time slot accordingly and preengages application and be specially: described each node is selected a described access reservation time slot according to a certain probability distribution separately, sends and inserts the reservation grouping.
4, method according to claim 1 and 2, it is characterized in that, described decomposition reservation applies for that conflict is specially: whether the forecast burst mini-slot that the node of each described generation reservation application conflict is intercepted before the predetermined forecast burst group transmission is idle, if not, then the forecast burst group of cancellation sends, this preengages access failure, waits for and inserts chance next time; If, on predetermined forecast burst mini-slot, send forecast burst group and last predetermined length, if last finishes the transmission of forecast burst group a certain node, then it successfully inserts, and Centroid sends the result and announces that grouping informs this situation to each node.
5, method according to claim 4, it is characterized in that, in the described decomposition reservation application conflict process, be provided with the forecast burst mini-slot after the result that described Centroid sends announces grouping, the quantity of this forecast burst mini-slot is not more than the quantity of the forecast burst mini-slot that is provided with in the described reservation application conflict prompting.
6, method according to claim 1 and 2 is characterized in that, the quantity of described access reservation time slot is carried out corresponding setting by described Centroid according to number of nodes and idle channel resources that success inserts.
7, method according to claim 1 and 2, it is characterized in that, after described Centroid is the node allocation of channel resources may that successfully inserts, further comprised before described transmission traffic packets: described Centroid judges that described reservation inserts and whether the conflict decomposition phase finishes, if then enter described transmission period as required; If not, then the node of success access is not proceeded described reservation application, inserts and the end of conflict decomposition phase until described reservation.
8, method according to claim 7, it is characterized in that, described Centroid judges that described reservation inserts and after the conflict decomposition phase do not finish, further comprise: described Centroid judges whether the number of nodes that described success inserts reaches predefined maximum, if enter described transmission period as required.
9, method according to claim 1 and 2 is characterized in that, the described traffic packets that alternately sends is specially: described Centroid sends traffic packets, and the node of pointing out a described success to insert sends traffic packets; The channel resource that the node utilization that described success inserts distributes sends traffic packets; Described Centroid sends traffic packets again, and the node that the next described success of prompting inserts sends traffic packets; Under all described successful access node promptings, all distribute traffic packets one time at described Centroid.
10, method according to claim 9, it is characterized in that, the node that the described success of described Centroid prompting inserts sends traffic packets and is specially: described Centroid carries the traffic packets of poll token by transmission or only sends poll control grouping, and the node of pointing out a certain described success to insert sends traffic packets thereafter.
11, method according to claim 1 and 2 is characterized in that, described alternately the transmission in the traffic packets process further comprises: the node that described success inserts is provided with the mark that discharges channel resource in last traffic packets that sends this meeting.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100640224A CN100452745C (en) | 2007-02-16 | 2007-02-16 | Multi-address access method with the confliction decomposition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100640224A CN100452745C (en) | 2007-02-16 | 2007-02-16 | Multi-address access method with the confliction decomposition |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101018173A CN101018173A (en) | 2007-08-15 |
| CN100452745C true CN100452745C (en) | 2009-01-14 |
Family
ID=38726938
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007100640224A Expired - Fee Related CN100452745C (en) | 2007-02-16 | 2007-02-16 | Multi-address access method with the confliction decomposition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100452745C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101179492B (en) * | 2007-11-14 | 2010-07-28 | 中国人民解放军理工大学 | Energy-saving packet collision analyzing method for random access time slot self-organizing network |
| CN102413581B (en) * | 2011-12-02 | 2014-08-06 | 电信科学技术研究院 | Method and system for reserving channel time slot by using initial access node |
| CN103237323B (en) * | 2013-05-07 | 2016-03-02 | 西安电子科技大学 | Based on multichannel parallel node acceptance method |
| US10433180B2 (en) * | 2016-12-22 | 2019-10-01 | Qualcomm Incorporated | Dynamic medium sharing |
| CN107820219A (en) * | 2017-09-04 | 2018-03-20 | 南京理工大学 | It is determined that the method that wireless network retransmits broadcast mechanism delay performance under the transmission time limit |
| CN112230232A (en) * | 2020-08-11 | 2021-01-15 | 北京凡星位航科技有限公司 | Many-to-many two-way ranging method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1186581A (en) * | 1995-06-14 | 1998-07-01 | 国际商业机器公司 | Packet data transmission in code-division multipel access communication systems |
| CN1294470A (en) * | 1999-10-22 | 2001-05-09 | 阿尔卡塔尔公司 | Method for multiple access communication |
| CN1451251A (en) * | 2000-03-23 | 2003-10-22 | 西门子移动通讯公司 | Access channel scheduling in a radio communication system |
| US20060153149A1 (en) * | 2003-02-26 | 2006-07-13 | Shintaro Uno | Method and system for handoff to a destination base station by measuring signal strength of carrier signals during at least one csma-backoff time |
-
2007
- 2007-02-16 CN CNB2007100640224A patent/CN100452745C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1186581A (en) * | 1995-06-14 | 1998-07-01 | 国际商业机器公司 | Packet data transmission in code-division multipel access communication systems |
| CN1294470A (en) * | 1999-10-22 | 2001-05-09 | 阿尔卡塔尔公司 | Method for multiple access communication |
| CN1451251A (en) * | 2000-03-23 | 2003-10-22 | 西门子移动通讯公司 | Access channel scheduling in a radio communication system |
| US20060153149A1 (en) * | 2003-02-26 | 2006-07-13 | Shintaro Uno | Method and system for handoff to a destination base station by measuring signal strength of carrier signals during at least one csma-backoff time |
Non-Patent Citations (2)
| Title |
|---|
| 自组织网络中UPMA协议的群间仿真. 丁立军，刘凯，李汉涛，张军.北京航空航天大学学报，第32卷第3期. 2006 |
| 自组织网络中UPMA协议的群间仿真. 丁立军，刘凯，李汉涛，张军.北京航空航天大学学报，第32卷第3期. 2006 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101018173A (en) | 2007-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100534068C (en) | Non-confliction on-demand multi-address access method | |
| CN106658735B (en) | Long propagation time delay wireless link time slot allocation method based on TDMA | |
| CN108235437B (en) | Wireless mobile self-organizing network channel time slot scheduling and distributing method | |
| CN101977385B (en) | DSAM (Dynamic Slot-time Allocation Method) of scale-extensible single-jump ad hoc network supporting QoS (Quality of Service) | |
| KR100564761B1 (en) | The hybrid inter token Carrier Sensing Multiple Access/Collision Avoidance protocol | |
| CN108430111B (en) | Mixed type time slot reservation method in distributed TDMA protocol | |
| US7046639B2 (en) | System and method for ad hoc network access employing the distributed election of a shared transmission schedule | |
| US8644213B2 (en) | Mobile data communication method and system using improved medium access control protocol | |
| CN108093469B (en) | Distributed access method of wireless transmission system based on TDMA | |
| CN110809324B (en) | MAC transmission method based on distributed TDMA and wireless self-organizing network system | |
| CN109640393B (en) | Competitive time division multiple access method for data and voice simultaneous transmission of wireless ad hoc network | |
| CN100452745C (en) | Multi-address access method with the confliction decomposition | |
| CN105119632B (en) | The communication means suitable for wireless mobile self-organizing network based on multiple frequency-hopping pattern | |
| CN104244257B (en) | Adaptive reservation and dynamic time slot allocating method and device | |
| CN110225593B (en) | Random number idle time slot competition method in distributed TDMA protocol | |
| JP2000253017A (en) | Radio packet control station | |
| CN100559738C (en) | The multi-address access method according to requirement that the band conflict is decomposed | |
| CN100559903C (en) | Adapter distribution multi-address access method | |
| CN100466492C (en) | Self-adaptive multi-address access method and central control node | |
| CN100505584C (en) | Fast precontract and line transmission multi-address access method | |
| CN101064640B (en) | Method, system and node for transmitting data in distributed non-collaboration grid network | |
| CN104735159A (en) | Vehicle-mounted network access method based on self-adaptive time slot allocation | |
| CN100521581C (en) | Multi-address access method for service quality guarantee | |
| CN101111073A (en) | Access method for long propagation delay wireless signal channel | |
| CN100512505C (en) | Asynchronous interactive multi-address access method |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090114 Termination date: 20160216 |