CN102548017A - Efficient coordination reserve method with controllable overhead in wireless self-organizing network - Google Patents
Efficient coordination reserve method with controllable overhead in wireless self-organizing network Download PDFInfo
- Publication number
- CN102548017A CN102548017A CN2012100515761A CN201210051576A CN102548017A CN 102548017 A CN102548017 A CN 102548017A CN 2012100515761 A CN2012100515761 A CN 2012100515761A CN 201210051576 A CN201210051576 A CN 201210051576A CN 102548017 A CN102548017 A CN 102548017A
- Authority
- CN
- China
- Prior art keywords
- ccri
- reservation
- cri
- pkt
- time
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an efficient coordination reserve method with a controllable overhead in a wireless self-organizing network. The method comprises the following steps of: before protocol running, calculating a maximum value of the amount of CCRI (Controllable Coordination Reserve Information) which can be carried in single coordination according to a coordination overhead limit specified by a user, selecting CRI from a reserve table by using a node before transmitting a data packet, constructing a pieces of CCRI for placing into a packet to be transmitted, and transmitting along with the packet; once certain CRI is selected, considering that the coordination forwarding time of the CRI is added with 1; and if CCRI is carried when the data packet is detected, resolving every CCRI, converting CCRI in which a preserve initiator and the CCRI is smaller than a coordination distance threshold into CRI, and storing into the reserve table. According to the method, the coordination forwarding time of the CRI under a limited coordination possibility is increased, and the overhead caused by forwarding of CRI is controlled in a range given by the user.
Description
Technical field
The present invention relates to wireless communication technology field, especially the real-time service transmission method.
Background technology
Wireless self-organization network (Ad hoc network) is the wireless multi-hop network that is made up of a group ad eundem node; Each node possesses the wireless transmitter of oneself; Each node relies on to be coordinated to carry out the access of channel and the transmission of packet each other, does not comprise any center control nodes and infrastructure in the network.The organizing cost of this network is low, and survivability is strong, and networking speed is fast, and application is extensive.
Continuous development along with radio network technique; Some business transmission in Ad hoc network with special service quality requirement become the focus that people study gradually; Professional like multimedia Real-Time, the generation of its packet has periodically, to having relatively high expectations of transmission delay.Yet in the ordinary course of things, the node in the Ad hoc network is taked the mode access channel of random compete, and packet collisions increases with the increase of offered load, and the performance of real time business can not get guaranteeing.
Reasonably the MAC agreement can effectively reduce delay and the packet loss problem that repeatedly re-transmission brings, and improves the success rate of multimedia service visit.The MAC agreement of the current Ad of being widely used in Hoc network is the IEEE802.11a DCF that 802.11 working groups formulate, and adopts the carrier sense conflict to avoid (CSMA/CA) mechanism, and node is with the mode fair competition channel of random back.Yet because all professional priority are identical, when traffic carrying capacity is bigger, conflict when serious, the FER and the transmission delay of real time business are bigger.To this problem, 802.11 working groups have proposed IEEE 802.11e standard, and four types data are divided into eight priority according to the priority difference of channel competition, and the priority of real time business is higher, and the priority of general service is lower.This method has followed basic avoidance mechanism and competitive way, is difficult to from overcoming the packet collisions problem of offered load when big in essence.
Based on the improvement to the channel access module, C.R.Lin and M.Gerla have proposed channel booking thought (MACA/PR).In this thought; Real time business is when sending current real-time grouping, and the channel that next cycle data transmitted in packets is required uses the period and (is subscription information, CRI) broadcasts away in the lump with dividing into groups; Neighbors is through the parsing to CRI; The channel that obtains real time business uses the period, and when oneself had business, the time of selecting beyond this period was carried out the random compete access.The performance bottleneck of basic booking-mechanism (MACA/PR) is whether subscription information can be obtained by the neighbors that institute in its carrier sense scope might clash with it (owing to conflicting or reason such as channel fading; In case these neighborss can't obtain subscription information; Then in the reservation period of real time business, carry out own transmission packets probably; Thereby clash with real-time grouping, cause the mistake frame that divides into groups in real time, reservation is failure therefore).
Based on above consideration, patent of invention " ZL200810017368.3 " has proposed the notion of multistep reservation, through the inferior broadcasting of m (m >=1) to wall scroll CRI, improves the reservation reliability under the collision scenario.Yet in the physical channel, the spread scope of signal is divided into two kinds of transmission range and carrier sense scopes, transmission range be positioned at the carrier sense scope with and less than the carrier sense scope, beyond the transmission range, the carrier sense scope is called interference region with interior zone.The neighbors that is positioned at the sending node transmission range can correctly receive the grouping of its transmission with certain probability, and the multistep reservation has improved the reservation reliability of real time business in this zone to a certain extent; And the neighbors that is positioned at the sending node interference region can't correctly receive the grouping of its transmission; When this is grouped into real-time grouping; Neighbors then can't obtain CRI wherein, thereby possibly cause interference to real-time sending node, and this is basic reservation and all insurmountable problem of multistep reservation.
To above problem, patent application " 201110045090.2 " has proposed the thought of cooperation reservation, promptly through neighbors the cooperation of CRI is transmitted, and increases the coverage rate of CRI in reservation node carrier sense scope.This method has not only improved the reservation reliability in the transmission range, and more having solved the middle CRI of patent " ZL200810017368.3 " can't be by the problem of neighbors acquisition in the interference region.On this basis, patent application " 201110257464.7 " (hereinafter to be referred as basic cooperation reservation) has provided to the The optimization method of being transmitted CRI by cooperation, has promoted cooperation efficiency to a certain extent.Yet because CCRI (cooperation subscription information; After CRI is converted into CCRI; Can be transmitted by cooperation) need be carried in the grouping of node self and send; Limited packet traffic has determined that the cooperation chance also is limited, and in the case, basic cooperation reservation also is limited to the improvement amplitude of cooperation efficiency.
Summary of the invention
In order to overcome the deficiency of prior art; The present invention provides a kind of efficient collaboration, both reserving method; In control cooperation expense, promote cooperation efficiency through increasing CCRI amount of information two approach of CCRI number that cooperation is transmitted with the raising single, and then strengthen the reliability and stability of channel booking.
The present invention is the basis with primary channel reservation and basic cooperation reservation.Be the convenient content of describing this patent, below earlier the primary channel reservation relevant with the present invention and the principle of basic cooperation reservation are summarized, provide the know-why of this patent summary of the invention subsequently:
It (is competitive mode that the IEEE802.11DCF mode is all adopted in the real time data grouping (R-PKT) of all non-real-time datas groupings (D-PKT) and not reservation; Adopt RTS/CTS/D-PKT/D-ACK or RTS/CTS/R-PKT/R-ACK to shake hands, D-ACK and R-ACK are respectively the affirmation of non real-time and real time business and divide into groups) access channel.In case R-PKT sends successfully under competitive mode, the R-PKT of subsequent cycle transfers reservation pattern (adopting R-PKT/RACK to shake hands) access channel to.If under the reservation pattern, send failure, then go back to competitive mode and retransmit, after the success to be sent, the R-PKT of subsequent cycle transfers reservation pattern access channel to.
Channel booking is initiated by the sender of R-PKT and R-ACK, carries grouping sender's CRI among R-PKT and the R-ACK.Through to the intercepting of R-PKT, neighbors is recorded in CRI in the own corresponding reservation table.Respectively preengaging in the period in reservation table, node will avoid the use of channel.
The cooperation reservation is initiated by the sender of D-PKT and R-PKT.Before sending this type grouping, the sender selects CRI from reservation table, puts into grouping to be sent behind the formation CCRI and sends (then directly sending this grouping if reservation table is a sky) in the lump.Any neighbors that listens to this type of grouping is resolved CCRI wherein; When the distance of finding own and reservation promoter during, just CCRI is converted into CRI and deposits own corresponding reservation table (if existed in the reservation table CRI that CCRI is corresponding therewith then what is not done) in less than the cooperation thresholding.
Reservation table is divided into the transmission reservation table and receives two kinds of reservation tables.The R-PKT sender will be in the information of certain section time use channel around sending the reservation table record; The R-ACK sender will be in the information of certain section time use channel around receiving the reservation table record.Can comprise a plurality of CRI that arrange in chronological order in every reservation table, the reservation time started CRI nearest apart from current time is article one CRI of reservation table, by that analogy.Whether every CRI is made up of 5 elements: " reservation time started ", " reservation concluding time ", " reservation promoter position ", " number of times of being cooperated " and " selecting ".The initial sum termination time that busy channel is this time preengage in " reservation time started " and " reservation concluding time " representative, " reservation time started " and " the reservation concluding time " of every CRI constitute a reservation period.After node is accomplished and kept out of the way, need the query-reservation table under competitive mode, preengage period with each and do not overlap if oneself this time transmit the required time, access channel then, otherwise keep out of the way again." reservation promoter position " is used for supplying node to calculate distance own and this reservation promoter, thereby whether the signal of judging oneself can cause interference to this transmitted in packets of preengaging the promoter.The number of times that " by cooperating number of times " representative oneself selects this CRI to cooperate and transmit.Whether when " selecting " representation node to select a plurality of CRI to cooperate, whether this CRI is selected.The reference factor that whether " reservation time started ", " by cooperate number of times " and " selecting " become node selection CRI jointly when cooperating forwarding.
Know-why of the present invention is described below:
Before the agreement operation, calculate the cooperate maximum n of portable CCRI bar number of single according to the cooperation expense thresholding of user's appointment (i.e. the maximum of the ratio of consuming time and transmitting-receiving node single communication time is transmitted in cooperation)
MAX
Before sending packet, node is chosen the CRI in the reservation table, constructs a bar CCRI and puts into grouping to be sent (0≤a≤n
MAX), send in the lump with dividing into groups.Whenever choose certain CRI once, think that the number of times that this CRI is cooperated to be transmitted adds 1.When listening to packet,, then per 1 CCRI is resolved if it carries CCRI, will preengage the promoter with own between apart from less than the distance threshold d that cooperates
CoCCRI be converted into CRI, deposit reservation table in.
Node is followed three criterions to choosing of CRI: the minimum CRI of hop count that, cooperated has the priority that is selected; Two, in a plurality of CRIs simultaneously minimum by the cooperation hop count, the reservation time started CRI nearest apart from current time has the priority that is selected; Three, the CRI that is selected must not be identical.
The technical solution adopted for the present invention to solve the technical problems may further comprise the steps:
● situation 1: during protocol initializing, calculate the maximum n of portable CCRI bar number in the single cooperation
MAX
Step 1: under the situation of not carrying CCRI, calculate competitive mode respectively and (adopt the handshake method of IEEE 802.11 DCF: RTS/CTS/PKT/ACK) with reservation pattern (the reservation period handshake method of employing MACA/PR: the duration T that shakes hands PKT/ACK)
Handshake_cAnd T
Handshake_r, see formula (1)-(2).Change step 2 over to.
T
handshake_c＝T
RTS+T
CTS+T
PKT+T
ACK+DIFS+3×SIFS (1)
T
handshake_r＝T
PKT+T
ACK+SIFS (2)
Wherein, T
RTS, T
CTSAnd T
ACKBe respectively the transmission duration of RTS, CTS and ACK, T
PKTBe the transmission duration (not carrying under the situation of CCRI) of packet, DIFS and SIFS are the interFrameGap in the IEEE 802.11 DCF standards.
Step 2: read cooperation expense thresholding r.Formula (3), wherein T are seen in the definition of r
CoFor because of carrying the maximum of the transmitted in packets duration that CCRI increases.Obtain the T under the different access modules by formula (3) derivation
Co, i.e. T
Co_c(competitive mode) and T
Co_r(reservation pattern) seen formula (4)-(5).Change step 3 over to.
r＝T
co/(T
handshake+T
co) (3)
T
co_c＝(r×T
handshake_c)/(1-r) (4)
T
co_r＝(r×T
handshake_r)/(1-r) (5)
Step 3: obtain transmitting the required duration T of wall scroll CCRI by formula (6)
CCRI, Length wherein
CCRIBe the length of wall scroll CCRI, Rate
PKTTransmission rate for the packet of carrying CCRI.Change step 4 over to.
T
CCRI＝Length
CCRI/Rate
PKT (6)
Step 4: obtain under the different access modules maximum n of the portable CCRI bar of single number by formula (7)-(8)
MAX_c(competitive mode) and n
MAX_r(reservation pattern), wherein [X] expression is not more than the maximum integer of X.
n
MAX_c＝[T
co_c/T
CCRI] (7)
n
MAX_r＝[T
co_r/T
CCRI] (8)
The processing of this situation finishes.
● situation 2: the packet (hereinafter to be referred as D-PKT) that the packet (hereinafter to be referred as R-PKT) of real time node transmission real time business or non real-time node send non-real-time service is preceding, to the selection of CRI and the structure of CCRI.
Step 1:S (S representes the real-time or non real-time node in this situation) upgrades own transmission reservation table and receives reservation table (i.e. deletion is sent reservation table and received the CRI of all reservation time starteds before the current time in the reservation table), and all CRI are not labeled as select.Change step 2 over to;
Step 2:S checks two reservation tables, if all unmarked in these two reservation tables be the CRI of choosing not, then directly sending should grouping, the processing end of this situation; Otherwise be labeled as not among the CRI of choosing at all, select the object of a minimum CRI of " by cooperate number of times " (be S once cooperated transmit the number of times of this CRI) as extraction CCRI.If there are many CRI that are labeled as not choosing " number of times of cooperate " minimum simultaneously, then select " reservation time started " therein from the object of the nearest CRI of current time as extraction CCRI.Respectively have " number of times of cooperate " that is labeled as the CRI of not choosing to be all minimum in the reservation table if send and receive, and their reservation time started is the same, then selects to send CRI in the reservation table as the object of extraction CCRI.Change step 3 over to;
Step 3:S adds 1 to selected CRI " number of times of being cooperated ", and this CRI of mark is for select.Then it " is preengage time started " and time difference of current time (the reservation time difference), and " reservation promoter position " (i.e. the reservation promoter's of this CRI geographical location information) (abbreviates CCRI as as a main CCRI
A).Then, whether another reservation table of S inspection (promptly removing another reservation table of selected CRI place reservation table) is empty, if then do not change step 4 over to for sky, otherwise changes step 5 over to;
Step 4:S travels through another reservation table; Be labeled as searching, " reservation promoter position " different CRI identical among the CRI that does not select at all with that CRI that selected just now " reservation time started "; Do not select, then change step 5 over to if do not exist such CRI or all CRI to be; Otherwise S give this CRI's " number of times of cooperate " add 1, and this CRI of mark is for select, again it " preengage promoter position " and (abbreviates CCRI as as the auxilliary CCRI of CCRI in the step 3
B).Change step 5 over to;
Step 5:S is with the CCRI of correspondence
AWith CCRI
BBe combined as a CCRI and (do not change CCRI
AWith CCRI
BContent) (if there is not corresponding CCRI
B, CCRI then
AConstitute a CCRI separately), CCRI is put into R-PKT to be sent to S or D-PKT divides into groups; Then, S judges that whether the CCRI bar number that has generated is less than n
MAX, if less than then changing step 2 over to; Divide into groups otherwise send this, the processing of this situation finishes.
● situation 3: when node is received R-PKT or D-PKT, to the processing of its CCRI that carries.
Step 1:R (representing the node in this situation with R here) upgrades the transmission reservation table and reception reservation table of oneself, changes step 2 over to;
Step 2:R judges whether this R-PKT or D-PKT exist untreated CCRI in dividing into groups, and then change step 3 over to if exist, otherwise press this grouping of disposal methods of IEEE802.11DCF, and the processing of this situation finishes;
Step 3:R handles the 1st CCRI among the CCRI that is untreated
A: by CCRI
AReservation promoter position calculation draw distance own and the reservation promoter.If distance is greater than cooperation distance threshold d
Co(d in this patent
CoEqual carrier sense scope radius d
c) then ignore this CCRI
A, otherwise further calculate this CCRI
AReservation time started t
Rsv_startWith reservation concluding time t
Rsv_endt
Rsv_startAnd t
Rsv_endComputational methods see formula (9)-(10), wherein T
R-PKTAnd T
R-ACKBe the transmission duration of R-PKT and R-ACK, T
PKT_sendBe the transmitting time (from this grouping MAC head, obtaining) of the grouping of carrying this CCRI, T
Rsv_periodBe CCRI
AThe reservation time difference.
T
rsv_start＝T
PKT_send+T
rsv_period (9)
T
rsv_end＝T
rsv_start+T
R-PKT+SIFS+T
R-ACK (10)
Then, R is with t
Rsv_start, t
Rsv_endAnd CCRI
AReservation promoter position deposit corresponding reservation table in as a CRI, if reservation table in existed identical CRI then to do nothing.Change step 4 over to;
Step 4:R judges whether CCRI is arranged among this CCRI
B, have then to change step 5 over to, otherwise change step 2 over to;
Step 5:R handles the CCRI among this CCRI
B: by CCRI
BReservation promoter position calculation draw distance own and the reservation promoter.If distance is then ignored this CCRI greater than the cooperation thresholding
B, otherwise with this CCRI
BReservation promoter position and t
Rsv_startAnd t
Rsv_endDeposit corresponding reservation table in as a CRI, if existed identical CRI then to do nothing in the reservation table.Change step 2 over to.
The invention has the beneficial effects as follows: the present invention has increased the number of times that CRI is cooperated and transmits under the limited cooperation chance, and the expense that cooperation forwarding CRI is brought is controlled in the given scope of user.
Below in conjunction with accompanying drawing and embodiment the present invention is further specified.
Description of drawings
Fig. 1 is the beneficial effect that the present invention produces the appointment business performance;
Fig. 2 is that the present invention is to non-appointment business Effect on Performance;
Fig. 3 is the frame format of R-PKT and D-PKT;
Fig. 4 is the frame format of CCRI;
Fig. 5 is and the corresponding network topology of idiographic flow explanation.
Embodiment
The present invention proposes the controlled efficient collaboration, both reserving method of a kind of expense, and when further promoting cooperation efficiency, the expense of will cooperating is controlled in user's given range.
Compatible IEEE 802.11 standards of this method are operated under the asynchronous multi-hop wireless communication network, support the distributed work mode, need not the intervention of master controller, can be used as the part of wireless network card firmware or realize as the part of NIC driver.
Below in conjunction with instance, in Ad Hoc network, it is elaborated based on IEEE 802.11a agreement.
One, frame format
The concrete frame format of D-PKT and R-PKT is seen Fig. 3: wherein, whether " cooperating " represents this CCRI that divides into groups whether to carry, and " 0 " representative is not carried, and " 1 " representative is carried; " self-position " represented this grouping sender's position (having only R-PKT to have this territory); The CCRI number (have only when " whether cooperating " and have this territory when being " 1 ") that on behalf of this grouping, " CCRI bar number " carry; " CCRI " is used for depositing CCRI (have only when " whether cooperating " and have this territory when being " 1 ").If " CCRI " territory comprises a bar CCRI (0≤a≤n
MAX), and have the b bar to comprise CCRI among this a bar CCRI
B(0≤b≤a), then the length L ength in this territory
CoFormula (11) is seen in calculating.
Length
co＝a×(1+1+14+16)+b×16 (11)
The frame format of every CCRI is seen Fig. 4.Wherein " cooperation type " representes whether carry CCRI among this CCRI
B, " 0 " representative is not carried, and " 1 " representative is carried; " reservation type " represented CCRI among this CCRI
AReservation type, " 0 " representative is from sending reservation table, " 1 " representative is from receiving reservation table; " the reservation time difference " is CCRI
AReservation time started and the time difference of current time, unit is 10 μ s; " reservation position
A" be CCRI
AReservation promoter position, unit is 10m; " reservation position
B" be CCRI
BReservation promoter position (only just exist when being " 1 " when " cooperation type " " and the reservation position
B"), unit is 10m.
This patent uses the 1st bit conduct " whether cooperating " territory of " agreement " subdomain (2 bit) in " frame control " territory in IEEE802.11MAC the frame format; Preceding 16 bits in " address 4 " territory are as " self-position " territory in the requisition packet frame format; The 17th～24 bit in " address 4 " territory is as " CCRI bar number " territory in the requisition packet frame format.
The packet type of these four kinds of groupings of D-PKT, R-PKT, D-ACK and R-ACK is identified by following method: the frame format that adopts IEEE 802.11 MAC heads; When the value of the Type field is that " 10 " are when (representing that promptly this is grouped into packet); The value " 0000 " in " subtype " territory representes that this is grouped into D-PKT, and the value " 1000 " in " subtype " territory representes that this is grouped into R-PKT; When the value of the Type field was " 01 " (being that this is grouped into the control grouping), the value " 1101 " in " subtype " territory showed that this is grouped into D-ACK, and the value " 0000 " in " subtype " territory shows that this is grouped into R-ACK.
Two, concrete operations flow process
1. network topology setting
Consider network topology as shown in Figure 5, wherein d
tRepresent the transmission range radius, d
cRepresent carrier sense scope radius, get cooperation thresholding d
CoEqual d
cEstablish d in this instance
tBe 100 meters, d
cBe 400 meters, the distance threshold of then cooperating d
Co=400m.Node in the sending node transmission range is correctly received the grouping (supposing p=1 in this example) that transmitting terminal sends with certain Probability p.The black round dot is represented the node in the network, the sending direction that internodal arrow representative data divides into groups.A (100,50) and B (200,50) represent non real-time sending node and non real-time receiving node, R
1(100,0), R
2(0,100) and R
3Real-time sending node, R are represented in (50,50)
1' (50,0), R
2' (50,100) and R
3' (0,50) represent real-time receiving node (value in the bracket is represented the coordinate of this node in network, unit be rice).
As can beappreciated from fig. 5, A, R
1, R
2, R
3, R
1', R
2' and R
3' all be positioned in the cooperation distance threshold scope (being the carrier sense scope) of B B, R
1, R
1', R
2' and R
3Be positioned in the transmission range of A A and R
1Be positioned in the transmission range of B.
2. operating process
If the length of D-PKT and R-PKT is 1024 bytes.Adopting IEEE 802.11a is standard, and the modulation system that makes packet is 64-QAM, and code rate is 2/3, and transmission rate is that 48Mbps (is Rate
PKT=48Mbps), the modulation system that control is divided into groups is 16-QAM, and code rate is 1/2, and transmission rate is 24Mbps.Then can obtain T
RTS=28 μ s, T
CTS=28 μ s, T
PKT=200 μ s, T
ACK=28 μ s, SIFS=16 μ s, DIFS=34 μ s.
If real time business cycle T=30ms, the cooperation expense thresholding r=0.01 that the user is given.
Frame format by CCRI can obtain Length
CCRI=48bit (establishes and comprises CCRI among the CCRI
B).
Be located at t constantly
0In the transmission reservation table of=0.02s:A R is arranged
1And R
3CRI, see table 1; In the reception reservation table of A R is arranged
1' and R
2' subscription information, see table 2; In the transmission reservation table of B R is arranged
1Subscription information, see table 3.
If non real-time sending node A is at t
1=0.021s sends D-PKT constantly, and non real-time receiving node B is at t
2=0.0212s receives the D-PKT of A constantly.Divide t below
Initialization(initialization time of agreement), t
1And t
23 the different constantly situation in the specific operation process 1, situation 2 and situation 3 being described:
● situation 1: when protocol initializing, calculate the maximum n of portability CCRI bar number in the single cooperation
MAX(this situation is to all nodes in the network).
Step 1: at moment t
Initialization, by formula (1)-(2) obtain respectively competitive mode with the reservation pattern the duration T that shakes hands
Handshake_cAnd T
Handshake_rChange step 2 over to.
T
handshake_c＝T
RTS+T
CTS+T
PKT+T
ACK+DIFS+3×SIFS＝366μs
T
handshake_r＝T
PKT+T
ACK+SIFS＝244μs
Step 2: read cooperation expense thresholding r=0.01.Obtain T by formula (4)-(5)
Co_c(competitive mode) and T
Co_r(reservation pattern).Change step 3 over to.
T
co_c＝(r×T
handshake_c)/(1-r)＝3.6970μs
T
co_r＝(r×T
handshake_r)/(1-r)＝2.4646μs
Step 3: obtain transmitting the required duration T of wall scroll CCRI by formula (6)
CCRI, Length wherein
CCRIBe the length of wall scroll CCRI, Rate
PKTTransmission rate for the packet of carrying CCRI.Change step 4 over to.
T
CCRI＝Length
CCRI/Rate
PKT＝1μs
Step 4: obtain under the different access modules maximum n of the portable CCRI bar of single number by formula (7)-(8)
MAX_c(competitive mode) and n
MAX_r(reservation pattern).
n
MAX_c＝[T
co_c/T
CCRI]＝3
n
MAX_r＝[T
co_r/T
CCRI]＝2
● situation 2: before non real-time node A sends D-PKT; To the selection of CRI and the structure of CCRI (the step basically identical when real time node sends before the R-PKT the structure of the selection of CRI and CCRI and non real-time node transmission D-PKT, difference has explanation in the present embodiment).
Step 1: at moment t
1=0.021s, A upgrade the transmission reservation table and reception reservation table of oneself, and all CRI are not labeled as choosing.Change step 2 over to;
Step 2:A checks two reservation tables, and send reservation table and see Table 1 this moment, receives reservation table and sees Table 2.Find that all CRI in two reservation tables all are labeled as not choosing, and all CRI " number of times of being cooperated " is 0.Then further at the object of " reservation time started " the 1st CRI in selection transmission reservation table among two nearest CRI of current time 0.021s as extraction CCRI.Change step 3 over to;
Step 3:A give selected CRI's " number of times of cooperate " add 1, and this CRI of mark is for select, the transmission reservation table content of A is seen table 4 at this moment.A " preengages time started " (0.031s) and the time difference (0.01s) of current time (0.021s) with it then, and " reservation promoter position " (100,0) are as 1 main CCRI (CCRI
A).Then, the A inspection receives reservation table, finds that it not for empty, then changes step 4 over to;
Step 4:A traversal receives reservation table (table 2); Find to exist with step 3 in " reservation time started " identical, " preengaging the promoter position " different CRI of that CRI of selecting; Then A adds 1 for this CRI " number of times of being cooperated "; And this CRI of mark is for selecting, and this moment, the reception reservation table content of A was seen table 5.Then A with " reservation promoter position " (50,0) of this CRI as auxilliary CCRI (CCRI as CCRI in the step 3
B).Change step 5 over to;
Step 5:A is with the CCRI of correspondence
AWith CCRI
BSynthesize 1 CCRI, put into grouping.Be provided with the 1st CCRI in " CCRI " territory in the D-PKT frame format this moment: " cooperation type " is " 1 "; " reservation type " is " 0 "; Because the reservation time difference is 0.01s, then " the reservation time difference " is " 00 0,011 1,110 1000 "; Because CCRI
AReservation promoter coordinate be (100,0), then " reservation position
A" be " 0,000 1,010 0,000 0000 "; Because CCRI
BReservation promoter coordinate be (50,0), then " reservation position
B" be " 0,000 0,101 0,000 0000 ".Because the CCRI bar number that has generated is 1, less than n
MAX_c(n
MAX_c=3), then change step 2 (for avoiding repetition, the step 2 of this moment is called step 2_2) over to.
Step 2_2:A checks two reservation tables, and send reservation table and see Table 4 this moment, receives reservation table and sees Table 5.Find to have in two reservation tables two CRI and be labeled as not choosing; And these two CRI " number of times of being cooperated " is 0; Then further select " reservation time started " from the nearest CRI of current time 0.021s, the 2nd CRI that promptly receives reservation table is as the object that extracts CCRI.Change step 3 (for avoiding repetition, the step 3 of this moment is called step 3_2) over to;
Step 3_2:A give selected CRI's " number of times of cooperate " add 1, and this CRI of mark is for select, the reception reservation table content of A is seen table 6 at this moment.A " preengages time started " (0.032s) and the time difference (0.011s) of current time (0.021s) with it then, and " reservation promoter position " (50,100) are as 1 main CCRI (CCRI
A).Then, reservation table is sent in the A inspection, finds it not for empty, then changes step 4 (for avoiding repetition, the step 4 of this moment is called step 4_2) over to;
Step 4_2:A traversal is sent reservation table (table 4); There is not identical, " reservation promoter position " different CRI of " the reservation time started " of that CRI that selects with step 3_2 in discovery; Then change step 5 (for avoiding repetition, the step 4 of this moment is called step 5_2) over to;
Step 5_2: owing to there is not corresponding CCRI
B, CCRI
AConstitute 1 CCRI separately, be placed in the grouping.Be provided with the 2nd CCRI in " CCRI " territory in the D-PKT frame format this moment: " cooperation type " is " 0 "; " reservation type " is " 1 "; Because the reservation time difference is 0.011s, then " the reservation time difference " is " 00 0,100 0,100 1100 "; Because CCRI
AReservation promoter coordinate be (50,100), then " reservation position
A" be " 0,000 0,101 0,000 1010 "; There is not " reservation position
B" territory.Because the CCRI bar number that has generated is 2, less than n
MAX_c(n
MAX_c=3), then change step 2 (for avoiding repetition, the step 2 of this moment is called step 2_3) over to.
Step 2_3:A checks two reservation tables, and send reservation table and see Table 4 this moment, receives reservation table and sees Table 6.Discovery has only 1 CRI to be labeled as not choosing, and the 2nd CRI that then selects to send reservation table is as the object that extracts CCRI.Change step 3 (for avoiding repetition, the step 3 of this moment is called step 3_3) over to;
Step 3_3:A give selected CRI's " number of times of cooperate " add 1, and this CRI of mark is for select, the transmission reservation table content of A is seen table 7 at this moment.A " preengages time started " (0.033s) and the time difference (0.012s) of current time (0.021s) with it then, and " reservation promoter position " (50,50) are as 1 main CCRI (CCRI
A).Then, the A inspection receives reservation table, finds it not for empty, then changes step 4 (for avoiding repetition, the step 4 of this moment is called step 4_3) over to;
Step 4_3:A traversal receives reservation table (table 6), finds that all CRI have been labeled as to select, and then changes step 5 (for avoiding repetition, step 5 at this moment is called step 5_3) over to;
Step 5_3: owing to there is not corresponding CCRI
B, CCRI
AConstitute 1 CCRI separately, be placed in the grouping.Be provided with the 3rd CCRI in " CCRI " territory in the D-PKT frame format this moment: " cooperation type " is " 0 "; " reservation type " is " 0 "; Because the reservation time difference is 0.012s, then " the reservation time difference " is " 00 0,100 1,011 0000 "; Because CCRI
AReservation promoter coordinate be (50,50), then " reservation position
A" be " 0,000 0,101 0,000 0101 "; There is not " reservation position
B" territory.Because the CCRI bar number that has generated is 3, equals n
MAX_c, the domain of dependence in the D-PKT frame format then further is set: whether " cooperating " is " 1 "; Because A is the non real-time node, then there is not " self-position " territory (if A is a real time node, then according to its coordinate (100,50), " self-position " should be set is " 0,000,101 0,000 0101 "); Owing to co-exist in 3 CCRI, then " CCRI bar number " is " 0,000 0011 ".Send this D-PKT.
● situation 3: when Node B is received D-PKT, to the processing of its CCRI that carries (when node is received R-PKT, identical, no longer illustrate here) to the processing of its CCRI that the carries processing when receiving D-PKT.
Step 1: at moment t
2=0.0212s, B upgrade the transmission reservation table and reception reservation table of oneself, and this moment, the transmission reservation table of B was seen table 3, and it is empty receiving reservation table.Change step 2 over to;
Step 2:B finds that " the whether cooperating " territory among this D-PKT is " 1 ", promptly has CCRI.Further, B finds that the value in " CCRI bar number " territory is 3, and these 3 CCRI all are not processed, and then changes step 3 over to;
Step 3:B handles the 1st CCRI among the CCRI that is untreated
A: B reads " reservation position
A" content, obtain this CCRI
AReservation promoter's position coordinates is (100,0), and known oneself the position coordinates of B is (200,50), then B and this CCRI
ADistance between the reservation promoter is 112m.Because this distance is less than d
Co(400m), B further calculates this CCRI
AThe reservation time started with the reservation concluding time: the transmitting time T that reads D-PKT
PKT_send(0.021s) with " reservation the time difference " (0.01s), according to formula (9)-(10), the reservation time started t of this CCRI then
Rsv_startBe 0.031s, reservation concluding time t
Rsv_endBe 0.031244s.t
Rsv_start, t
Rsv_end(100,0) constitute a CRI.Then, B reads " reservation type " among the CCRI, learns that this CRI is from sending reservation table.Had the identical CRI of CRI therewith owing to send in the reservation table, seen Table 3, then B does nothing.Change step 4 over to;
Step 4:B reads the content of " cooperation type " among this CCRI, and learning among this CCRI has CCRI
B, then change step 5 over to;
Step 5:B handles the CCRI among this CCRI
B: B reads " reservation position
B" content, obtain this CCRI
BReservation promoter's position coordinates is (50,0), and known oneself the position coordinates of B is (200,50), then B and this CCRI
ADistance between the reservation promoter is 158m, and this distance is less than d
Co(400m).t
Rsv_start, t
Rsv_end(50,0) constitute a CRI.Then, because the reception reservation table of B is empty, then B directly deposits this CRI in the reception reservation table, and this moment, the reception reservation table content of B was seen table 8.Change step 2 (for avoiding repetition, the step 2 of this moment is called step 2_2) over to.
Step 2_2:B finds to also have 2 CCRI to be untreated, and then changes step 3 (for avoiding repetition, the step 3 of this moment is called step 3_2) over to;
Step 3_2:B handles the 1st CCRI among the CCRI that is untreated
A: B reads " reservation position
A" content, obtain this CCRI
AReservation promoter's position coordinates is (50,100), and known oneself the position coordinates of B is (200,50), then B and this CCRI
ADistance between the reservation promoter is 158m.Because this distance is less than d
Co(400m), B further calculates this CCRI
AThe reservation time started with the reservation concluding time: the transmitting time T that reads D-PKT
PKT_send(0.021s) with " reservation the time difference " (0.011s), according to formula (9)-(10), the reservation time started t of this CCRI then
Rsv_startBe 0.032s, reservation concluding time t
Rsv_endBe 0.032244s.t
Rsv_start, t
Rsv_endAnd CCRI
AReservation promoter (50,100) constitutes a CRI.Then, B reads " reservation type " among the CCRI, learns that this CRI is from receiving reservation table.The reception reservation table of B inspection oneself is found wherein not have the identical CRI of CRI therewith, sees table 8, and then B deposits this CRI in the reception reservation table, and this moment, the reception reservation table content of B was seen table 2.Change step 4 (for avoiding repetition, the step 4 of this moment is called step 4_2) over to;
Step 4_2:B reads the content of " cooperation type " among this CCRI, and learning among this CCRI does not have CCRI
B, then change step 2 (for avoiding repetition, the step 2 of this moment is called step 2_3) over to;
Step 2_3:B finds to also have 1 CCRI to be untreated,, then change step 3 (for avoiding repetition, the step 3 of this moment is called step 3_3) over to;
Step 3_3:B handles the 1st CCRI among the CCRI that is untreated
A: B reads " reservation position
A" content, obtain this CCRI
AReservation promoter's position coordinates is (50,50), and known oneself the position coordinates of B is (200,50), then B and this CCRI
ADistance between the reservation promoter is 150m.Because this distance is less than d
Co(400m), B further calculates this CCRI
AThe reservation time started with the reservation concluding time: the transmitting time T that reads D-PKT
PKT_send(0.021s) with " reservation the time difference " (0.012s), according to formula (9)-(10), the reservation time started t of this CCRI then
Rsv_startBe 0.033s, reservation concluding time t
Rsv_endBe 0.033244s.t
Rsv_start, t
Rsv_endAnd CCRI
AReservation promoter (50,50) constitutes a CRI.Then, B reads " reservation type " among the CCRI, learns that this CRI is from sending reservation table.The transmission reservation table of B inspection oneself is found wherein not have the identical CRI of CRI therewith, sees table 3, and then B deposits this CRI in the transmission reservation table, and this moment, the transmission reservation table content of B was seen table 1.Change step 4 (for avoiding repetition, the step 4 of this moment is called step 4_3) over to;
Step 4_3:B reads the content of " cooperation type " among this CCRI, and learning among this CCRI does not have CCRI
B, then change step 2 (for avoiding repetition, the step 2 of this moment is called step 2_4) over to;
Step 2_4:B finds to also have 0 CCRI to be untreated, and then presses this grouping of IEEE802.11DCF standard treated: because the destination address of this D-PKT then mails to the upper strata with this D-PKT for oneself.
In the emulation experiment of the present invention, all sending nodes all only carry a kind of Business Stream (real time business or non-real-time service), and the generation cycle of R-PKT is T, and the generation time of D-PKT is followed exponential distribution at interval.Physical layer adopts two footpath models, and the carrier sense thresholding is d
c=398m, cooperation thresholding d
Co=400m, the shadow fading factor gets 4.0, and modulation system is 64QAM, and code rate is 2/3, and other major parameter provides according to the IEEE802.11a standard.Experimental Network is wireless self-organization network (700m * 700m); (totally 50 of all sending nodes; Comprise real-time sending node and non real-time sending node) be randomly dispersed in the whole network, all receiving nodes are randomly dispersed in the scope apart from its corresponding sending node 50m.Be 1: 9 in real time in the scene with the number ratio of non real-time node, the D-PKT number that the average per second of non real-time sending node arrives change from small to big (being that the non-real-time service amount is changed from small to big).
This emulation has been compared in basic reservation, multistep reservation (thought of multistep reservation is applied to basic reservation), basic cooperation reservation and cooperation reservation (simulation result that has compared different r values) these the four kinds of mechanism that adopt this patent method, and the real time business of whole network on average sends probability of failure P
TFRWith non-real-time service mean packet delay T
DELAY, P
TFRDefinition see formula (12)-(14).
P
TFR＝(N
f/N
t)×100％ (12)
N
t＝N
RTS+N
R-PKT_rsv_s+N
R-PKT_rsv_f (13)
N
f＝N
t-N
R-PKT (14)
N wherein
fAnd N
tBe failed transmission number of times and trial the number of transmissions, N
RTSFor RTS sends number of times, N
R-PKT_rsv_sAnd N
R-PKT_rsv_fBe successful the number of transmissions and the failed transmission number of times of R-PKT under the reservation pattern, N
R-PKTThe R-PKT number of receiving for receiving node.More than all parameters be in certain simulation time the relevant parameter sum of each node in the network.Can find out P
TFRMore little, the success rate of real time business access channel is high more, preengages stable more.
Fig. 1 has provided real time business P
TFRSimulation result, wherein abscissa is represented the average traffic of non real-time sending node, ordinate is represented the P of real time business
TFRGenerally speaking,, cause the probability of CRI in the neighbors acquisition reservation promoter grouping more and more littler owing to the increase of packet collisions with background traffic increases the weight of, so P
TFRIn rising trend.Can find out that compare basic reservation, multistep reservation and basic cooperation reservation, this patent can provide better reservation access performance for real time business all the time.Compare basic cooperation reservation and the cooperation chance that adopts the cooperation reservation of this patent method to utilize background service to bring, its P with the reservation of basic reservation and multistep
TFRReduce greatly.Compare with basic cooperation reservation, the CRI that this patent has increased under the single cooperation chance transmits number, and cooperation efficiency is higher, especially when r=0.02, and its P
TFRWhen background service is heavier, has only 50% of basic cooperation reservation.In this patent, the number of times that every CRI is forwarded increases with the increase of r value, for the performance boost that real time business brings also obvious further thereupon.
Fig. 2 has provided non-real-time service T
DELAYSimulation result, wherein abscissa is represented the average traffic of non real-time sending node, ordinate is represented the T of non-real-time service
DELAYCan find out, in this patent, increase the transmission packets duration, owing to taked expense control strategy, T though carry many CCRI
DELAYInfluencedly hardly (because each curve is comparatively approaching,, only provided the cooperation expense here, i.e. T during r=0.02 than maximum for the cooperation reservation of adopting this patent method
DELAYPerformance).In addition, the packet overhead of the said method introducing of this patent accounts for the ratio original just very little (about 1%) of network total traffic.
Table 1
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 100，0 | 0 | Not choosing |
| 0.033 | 0.033244 | 50，50 | 0 | Not choosing |
Table 2
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 50，0 | 0 | Not choosing |
| 0.032 | 0.032244 | 50，100 | 0 | Not choosing |
Table 3
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 100，0 | 0 | Not choosing |
Table 4
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 100，0 | 1 | Select |
| 0.033 | 0.033244 | 50，50 | 0 | Not choosing |
Table 5
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 50，0 | 1 | Select |
| 0.032 | 0.032244 | 50，100 | 0 | Not choosing |
Table 6
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 50，0 | 1 | Select |
| 0.032 | 0.032244 | 50，100 | 1 | Select |
Table 7
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 100，0 | 1 | Select |
| 0.033 | 0.033244 | 50，50 | 1 | Select |
Table 8
| The reservation time started | The reservation concluding time | Reservation promoter position | By the cooperation number of times | Whether select |
| 0.031 | 0.031244 | 50，0 | 0 | Not choosing |
Claims (1)
1. the controlled efficient collaboration, both reserving method of expense in the mobile Ad hoc network is characterized in that comprising the steps:
When situation 1, protocol initializing, calculate the maximum n of portable CCRI bar number in the single cooperation
MAX:
Step 1: under the situation of not carrying CCRI, calculate the duration T that shakes hands of competitive mode
Handshake_cThe duration T that shakes hands with the reservation pattern
Handshake_r, T
Handshake_c=T
RTS+ T
CTS+ T
PKT+ T
ACK+ DIFS+3 * SIFS, T
Handshake_r=T
PKT+ T
ACK+ SIFS, wherein, T
RTS, T
CTSAnd T
ACKBe respectively the transmission duration of RTS, CTS and ACK, T
PKTFor not carrying the transmission duration of packet under the CCRI situation, DIFS and SIFS are the interFrameGap in the IEEE 802.11 DCF standards;
Step 2: read cooperation expense thresholding r, r=T is arranged
Co/ (T
Handshake+ T
Co), T wherein
CoFor because of carrying the maximum of the transmitted in packets duration that CCRI increases, further calculate the T under the competitive mode
CoBe T
Co_c=(r * T
Handshake_c)/(1-r), the T under the reservation pattern
CoBe T
Co_r=(r * T
Handshake_r)/(1-r);
Step 3: calculate the required duration T of transmission wall scroll CCRI
CCRI=Length
CCRI/ Rate
PKT, Length wherein
CCRIBe the length of wall scroll CCRI, Rate
PKTTransmission rate for the packet of carrying CCRI;
Step 4: obtain under the competitive mode single cooperation portability CCRI bar and count maximum n
MAX_c=[T
Co_c/ T
CCRI] and the reservation pattern under single cooperation portability CCRI bar count maximum n
MAX_r=[T
Co_r/ T
CCRI];
Before packet R-PKT or the non real-time node that situation 2, real time node are sent real time business sends the packet D-PKT of non-real-time service, to the selection of CRI and the structure of CCRI:
Step 1: real-time or non real-time node S deletion is sent reservation table and is received the CRI of all reservation time starteds before the current time in the reservation table, and all CRI are labeled as not choosing;
Step 2:S inspection is sent reservation table and is received reservation table, if all unmarked be the CRI of choosing not, then directly send this grouping, the processing end of this situation; Otherwise be labeled as among the CRI of not choosing at all, select by a CRI of cooperation number of times minimum as the object that extracts CCRI; If there are many CRI that are labeled as not choosing " number of times of cooperate " minimum simultaneously, then select the reservation time started therein from the object of the nearest CRI of current time as extraction CCRI; Respectively have " number of times of cooperate " that is labeled as the CRI of not choosing to be all minimum in the reservation table if send and receive, and their reservation time started is the same, then selects to send CRI in the reservation table as the object of extraction CCRI; Described is that S once cooperated and transmits the number of times of this CRI by the cooperation number of times;
Step 3:S adds 1 to selected CRI " number of times of being cooperated ", and this CRI of mark is for select; Then it is preengage the time difference of time started and current time, and reservation promoter position is called CCRI as a main CCRI
AThen, whether another reservation table of S inspection is empty, if then do not change step 4 over to for sky, otherwise changes step 5 over to; Described reservation promoter position i.e. the reservation promoter's of this CRI geographical location information;
Step 4:S travels through another reservation table; Be labeled as identical, " reservation promoter position " different CRI of the reservation time started of seeking the CRI that selects with step 2 among the CRI that does not select at all; Do not select, then change step 5 over to if do not exist such CRI or all CRI to be; Otherwise S adds 1 for this CRI that meets above-mentioned condition " number of times of being cooperated ", and this CRI of mark as the auxilliary CCRI of CCRI in the step 3, is called CCRI with its " reservation promoter position " again for selecting
B
Step 5:S is with CCRI
AWith CCRI
BDo not change the CCRI that is combined into of content, if there is not corresponding CCRI
B, CCRI then
AConstitute a CCRI separately; Then, S puts into R-PKT to be sent or D-PKT grouping with CCRI; Then, S judges that whether the CCRI bar number that has generated is less than n
MAX, if less than then changing step 2 over to; Otherwise send this grouping;
When situation 3, node are received R-PKT or D-PKT, to the processing of its CCRI that carries:
Step 1: node R is upgraded the transmission reservation table and reception reservation table of oneself;
Step 2:R judges that whether this R-PKT or D-PKT exist untreated CCRI in dividing into groups, and then change step 3 over to if exist, otherwise press this grouping of disposal methods of IEEE802.11DCF;
Step 3: by the CCRI among the 1st CCRI that is untreated
AReservation promoter position calculation obtain R and reservation promoter's distance, if distance is greater than cooperation distance threshold d
CoThen ignore this CCRI
A(d
CoEqual carrier sense scope radius d
c), otherwise further calculate this CCRI
AReservation time started t
Rsv_startWith reservation concluding time t
Rsv_end, T
Rsv_start=T
PKT_send+ T
Rsv_period, T
Rsv_end=T
Rsv_start+ T
R-PKT+ SIFS+T
R-ACK, T wherein
R-PkTAnd T
R-ACKBe the transmission duration of R-PKT and R-ACK, T
PKT_sendBe the transmitting time of the grouping of carrying this CCRI, T
Rsv_periodBe CCRI
AThe reservation time difference;
Then, R is with t
Rsv_start, t
Rsv_endAnd CCRI
AReservation promoter position deposit corresponding reservation table in as a CRI, if reservation table in existed identical CRI then to do nothing, change step 4 over to;
Step 4:R judges whether CCRI is arranged among this CCRI
B, have then to change step 5 over to, otherwise change step 2 over to;
Step 5: by CCRI
BReservation promoter position calculation obtain R with the reservation promoter distance, if the distance greater than the cooperation thresholding then ignore this CCRI
B, otherwise with this CCRI
BReservation promoter position and t
Rsv_startAnd t
Rsv_endDeposit corresponding reservation table in as a CRI,, change step 2 over to if existed identical CRI then to do nothing in the reservation table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210051576.1A CN102548017B (en) | 2012-03-01 | 2012-03-01 | Efficient coordination reserve method with controllable overhead in wireless self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210051576.1A CN102548017B (en) | 2012-03-01 | 2012-03-01 | Efficient coordination reserve method with controllable overhead in wireless self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102548017A true CN102548017A (en) | 2012-07-04 |
| CN102548017B CN102548017B (en) | 2014-06-11 |
Family
ID=46353681
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210051576.1A Expired - Fee Related CN102548017B (en) | 2012-03-01 | 2012-03-01 | Efficient coordination reserve method with controllable overhead in wireless self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102548017B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102238753A (en) * | 2011-02-24 | 2011-11-09 | 西北工业大学 | Method for reliably transmitting real-time service in wireless ad hoc network based on cooperation reservation |
| CN102281652A (en) * | 2011-09-01 | 2011-12-14 | 西北工业大学 | Coordination-reservation-based method for selecting reservation information in wireless Ad Hoc network |
-
2012
- 2012-03-01 CN CN201210051576.1A patent/CN102548017B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102238753A (en) * | 2011-02-24 | 2011-11-09 | 西北工业大学 | Method for reliably transmitting real-time service in wireless ad hoc network based on cooperation reservation |
| CN102281652A (en) * | 2011-09-01 | 2011-12-14 | 西北工业大学 | Coordination-reservation-based method for selecting reservation information in wireless Ad Hoc network |
Non-Patent Citations (2)
| Title |
|---|
| YUAN YUNJIE等: "CCRM: A MAC Protocol with Cooperative Channel Reservation for Wireless Ad Hoc Networks", 《WICOM 2011》, 25 September 2011 (2011-09-25) * |
| YUAN YUNJIE等: "Performance evaluation of an efficient cooperative channel reservation MAC protocol in wireless ad hoc networks", 《ICSPCC 2011》, 16 September 2011 (2011-09-16) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102548017B (en) | 2014-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Afaqui et al. | IEEE 802.11 ax: Challenges and requirements for future high efficiency WiFi | |
| CN105722231B (en) | A kind of design method for the vehicle-mounted net MAC protocol of multichannel continuously coordinated | |
| CN1791051A (en) | Method of implementing scatternet in wireless personal area network | |
| CN103118414B (en) | Wireless access control and timeslot allocation method applicable to ultra-wideband | |
| CN102104875B (en) | A kind of Novel cognitive radio multi-channel MAC protocol method | |
| CN106559900B (en) | A kind of multi-channel multi-address access method based on asymmetric bandwidth | |
| CN103326844B (en) | Based on 802.11 agreement resource allocation methods in composite mode | |
| CN103763076B (en) | Cooperative MAC protocol implementation method on basis of multiple asynchronous channels in vehicular vdhoc networks | |
| Kim et al. | Two-step multipolling MAC protocol for wireless LANs | |
| CN104853385A (en) | Dynamic mechanism for efficient information transmission in WIFI system based on OFDMA technology | |
| CN111836399B (en) | Channel access protocol design method and time slot allocation method for broadband carrier communication network | |
| CN104158645A (en) | Media access control method based on full-duplex access point in wireless local area network | |
| CN102170665B (en) | Cooperative channel access method and cooperative communication system capable of guaranteeing quality of service | |
| CN102238753B (en) | Method for reliably transmitting real-time service in wireless ad hoc network based on cooperation reservation | |
| Adachi et al. | Packet-level index modulation for LoRaWAN | |
| CN102869081B (en) | Channel reservation based power control method in distributed wireless networks | |
| CN104837211B (en) | A kind of multi-channel multi-address access method based on MIMO transmission mechanism | |
| CN103501531A (en) | Power control-based Ad Hoc network MAC (Media Access Control) layer channel allocation method | |
| CN105578523B (en) | The 802.11 self-organizing network energy efficiency priority methods based on cooperative MAC protocol | |
| CN102548017B (en) | Efficient coordination reserve method with controllable overhead in wireless self-organizing network | |
| CN102123448B (en) | Channel reservation method based on double busy tone mechanism in wireless self-organizing network | |
| CN101883439A (en) | Method for reliably transmitting real-time service in wireless Ad Hoc network | |
| CN107426822A (en) | Exempt from the resource reallocation of expense in a kind of wireless network | |
| Xuelin et al. | TR-MAC: A multi-step slot reservation-based hybrid MAC protocol for ad hoc networks | |
| CN102281652B (en) | Coordination-reservation-based method for selecting reservation information in wireless Ad Hoc network |
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 |
Granted publication date: 20140611 Termination date: 20150301 |
|
| EXPY | Termination of patent right or utility model |