CN101102540A - Multi-address access method for supporting service quality - Google Patents

Multi-address access method for supporting service quality Download PDF

Info

Publication number
CN101102540A
CN101102540A CNA2007101185325A CN200710118532A CN101102540A CN 101102540 A CN101102540 A CN 101102540A CN A2007101185325 A CNA2007101185325 A CN A2007101185325A CN 200710118532 A CN200710118532 A CN 200710118532A CN 101102540 A CN101102540 A CN 101102540A
Authority
CN
China
Prior art keywords
node
send
slot
channel
burst group
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
Application number
CNA2007101185325A
Other languages
Chinese (zh)
Other versions
CN100505944C (en
Inventor
张军
刘凯
王大鹏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beihang University
Original Assignee
Beihang University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beihang University filed Critical Beihang University
Priority to CNB2007101185325A priority Critical patent/CN100505944C/en
Publication of CN101102540A publication Critical patent/CN101102540A/en
Application granted granted Critical
Publication of CN100505944C publication Critical patent/CN100505944C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)
  • Small-Scale Networks (AREA)

Abstract

The method comprises: according to the service packet to be transmitted, the node estimates the service type; if it is a real-time service, the node sends a predicted burst-out of declaring service type, and enters the next step; if it is a non real-time service, the node monitors a micro time slot in one predicted burst-out length; if not detecting a predicated burst-out of declaring the real-time service, then entering the next step; the node determines the beginning micro time slot of the predicted burst-out, and the numbers of the transmitted predicted burst-out packet, and decide if the monitor channel is at idle state before the beginning micro time slot; if yes, the node sends one or more predicted burst-out, and then decides if the channel is at idle state; if yes, the node accesses the channel and sends service packet.

Description

Support the multiple access method of service quality
Technical field
The present invention relates to a kind of multiple access method of supporting service quality, particularly a kind of multiple access method that relies on the support service quality of statement Differentiated Services type.
Background technology
Multiple access insert be solve a plurality of nodes or user how fast, efficient, fair, a kind of method of shared channel resources reliably.According to the mode of channel allocation, multiple access method can be divided into fixed allocation, the three kinds of modes that insert and distribute according to need at random usually.
The multiple access method of fixed allocation is generally given the long-time fixed allocation of channel resource some node or all nodes of shared channel.Owing to have a large amount of mobile nodes in the various mobile communications networks, and the business of each node is also many based on burst service, therefore the multiple access method of fixed allocation can cause the idle and waste of a large amount of channel resources, is not suitable for directly using in mobile communications network.
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.Though this method can overcome the wasting of resources problem in the fixed allocation access way, hour can obtain very little access delay in traffic carrying capacity, but when each node is shared wireless broadcast channel based on the mode of carrier sense in the multihop network structure, concealed terminal and exposed terminal problem can occur, make multiple access performance reduce greatly.Particularly when sending node number and network traffic increase, the probability of packet collisions and re-transmission can sharply strengthen, thereby increased average packet time delay and average packet loss ratio greatly, reduced channel throughput, also can occur the unjust equality problem of shared channel simultaneously.
In the demand assigned multiple access method, each node is according to service conditions request channel resource, re-uses channel resource after applying for successfully.Different according to application reservation and allocated channel mode, this method can be divided into based on competition at random with based on there not being two classes of conflict.Method based on competition at random mainly adopts various short control groupings to shake hands (as sending request/removing request, Request To Send/Clear To Send, hereinafter to be referred as RTS/CTS), periodic status information exchange distributed appointment mode, be suitable for sudden stronger, message transfer is than the business transmission of short type, distributed coordination function (DistributedCoordination Function as IEEE 802.11 agreements, be called for short DCF), two busy tone multiple access insert (Dual Busy Tone MultipleAccess, be called for short DBTMA) and distributed packet reservation multiple access access methods such as (Dynamic Packet ReservationMultiple Access are called for short DPRMA).Mainly utilize center control nodes to coordinate to realize distribution according to need based on conflict free method, be suitable for once inserting the type of service that needs the long period stable transfer after the foundation, good service quality (Quality of service can be provided, hereinafter to be referred as QoS) guarantee, its typical case's representative polling mechanisms that use more, point coordination function (PointCoordination Function as IEEE 802.11 agreements, be called for short PCF) and virtual base station methods such as (Virtual Base Station are called for short VBS).But, still there is packet collisions in the former in the application reservation section, and the influence of concealed terminal has just obtained weakening, and does not eliminate; The latter then can avoid the generation of packet collisions situation, and when not excessive many nodes did not send, this method can be wasted a large amount of poll control expenses.
Simultaneously, also there is other problem in the demand assigned multiple access method that prior art proposes, for example, when network traffic is low, compares with accidental access method, and there is the problem that control expense proportion is excessive, propagation delay time is bigger in allocation method based on demand; When network traffic is higher, to compare with the fixed allocation method, there are the problems such as fairness that the maximum channel throughput is not high enough, can not guarantee shared channel in allocation method based on demand.In addition, in the above-mentioned all kinds of multiple access methods, all have many multiple access methods need set up comparatively accurately and could realize under the Network Synchronization prerequisite, and in actual applications, the multi-hop distributed wireless networks all is difficult to realize the accurately synchronous of the whole network.
The multiple access access protocol has also been considered the support to multimedia service QoS at present, its implementation generally can be divided into two classes: one is based on the agreement of traffic differentiation, promptly carry out priority assignment and equity dispatching at different business, enhanced distributed coordination function (EnhancedDistributed Coordination Function as IEEE 802.11e agreement, be called for short EDCF), adopt frame period (the Inter Frame space that distinguishes at 4 kinds of access categories, be called for short IFS) and back off algorithm, 8 different service priority supported; The another kind of agreement that is based on resource reservation mainly is to provide QoS service by reservation and scheduling mechanism for real time business.Also having many research work is carrier sense multiple access/collision detection (Carrier Sense Multiple Access with CollisionDetection that the band conflict is avoided in IEEE 802.11 standards, hereinafter to be referred as CSMA/CA) on the basis according to the preferential thought of real time business, access mechanism is taked to divide service priority and used different methods of keeping out of the way strategy to improve, thereby realize that on existing network QoS supports.But, when being applied to multihop network based on the access mechanism of CSMA/CA, in the time delay that is difficult to guarantee all high-priority service all is limited to more among a small circle, because the low priority traffice that is just constantly hocketing in adjacent node transmission may hinder the startup of high-priority service, and the RTS/CTS that is not activated time restriction shakes hands and has also restricted the QoS performance of real time business in multihop network.
Summary of the invention
One aspect of the present invention provides a kind of multiple access method of supporting service quality, this method does not need center control nodes just can support QoS, two kinds professional earlier by statement differentiation type, again with short burst contention reservation channel and the mechanism of conflicting and solving, guarantee real time business grouping access channel fast to greatest extent, obtain the channel right to use, have precedence over general non-real-time service grouping and finish transmission.
One aspect of the present invention provides following technical scheme by some embodiment, and this technical scheme has specifically provided a kind of multiple access method of supporting service quality, comprising:
Step 1, node are judged type of service according to the traffic packets that will send, if real time business, described node then sends forecast burst (Forecast Burst is hereinafter to be referred as the FB) grouping of a statement type of service, execution in step 2; If non-real-time service, described node is then intercepted the mini-slot of a FB block length, if do not listen to the FB grouping of statement real time business type, then execution in step 2;
The quantity that step 2, described node are determined to send the beginning mini-slot of FB grouping and sent the FB grouping, described node is intercepted the mini-slot of channel before described beginning mini-slot and whether all is in idle condition, if then execution in step 3; Otherwise, then return step 1;
Step 3, described node send one or more FB grouping, judge whether channel is in idle condition, if then execution in step 4; Otherwise, then return step 1;
Step 4, described node access channel send traffic packets.
The multiple access method of the support service quality that the embodiment of the invention provides, node is by sending the technical scheme that the FB grouping is at war with and conflicts and solve in the competitive stage, guaranteed more preferably access channel of real time business grouping, and significantly reduced in the possible packet collisions of transmit stage.
In sum, the present invention supports the embodiment of the multiple access method of service quality to draw the thought of burst reservation and conflict solution, greatly reduce the concealed terminal influence in the transmitted in packets, flexibly simple forecast burst and conflict decomposition method can make can guarantee the no conflict transmission of real time business grouping by quicker, the access channel more effectively of node to greatest extent.The present invention supports the embodiment of the multiple access method of service quality to make advantages such as multi-hop wireless network has the channel throughput height, access delay is little, discarded ratio of packet is low, QoS is guaranteed, transceiver equipment requires simply, suitable multihop network structure, each nodes sharing channel justice, can be used as the method for a plurality of user's sharing wireless channel resources under the no center control nodes condition in all kinds of mobile radio communication networks such as mobile ad hoc network (or claiming movable self-organization packet radio Ad Hoc network), Radio Access Network.
Below by drawings and Examples, technical scheme of the present invention is described in further detail.
Description of drawings
Fig. 1 supports the flow chart of the multiple access method embodiment 1 of service quality for the present invention;
Fig. 2 supports the flow chart of the multiple access method embodiment 2 of service quality for the present invention;
Fig. 3 supports the flow chart of the multiple access method embodiment 3 of service quality for the present invention;
Fig. 4 supports the real time business node of the multiple access method embodiment 4 of service quality to insert sequential chart for the present invention;
Fig. 5 supports the non-real-time service node of the multiple access method embodiment 5 of service quality to insert sequential chart for the present invention.
Embodiment
Embodiment 1:
Fig. 1 as shown in Figure 1, specifically comprises the steps: for the flow chart that the present invention supports the multiple access method embodiment 1 of service quality
Step 1, node are judged type of service according to the traffic packets that will send, if real time business, then this node sends the FB grouping of a statement real time business type, this FB grouping carry the sign that can state type of service with and length be far smaller than traffic packets length, above-mentioned node enters the competitive stage, execution in step 2; If non-real-time service, then this node continues to intercept the mini-slot of a FB block length, if do not listen to the FB grouping of the statement real time business type of real time business node transmission, above-mentioned node then enters the competitive stage, execution in step 2;
Wherein, the above-mentioned competitive stage is that node obtains the channel access right stage before, and node sends one or more FB groupings in this stage, to obtain the channel access right.Node obtains to enter transmit stage after the channel access right, sends traffic packets.
Step 2, get permission to enter the node of competitive stage and determine to send the beginning mini-slot of FB grouping and the quantity of FB grouping; This node is intercepted the mini-slot of channel before fixed beginning mini-slot and whether all is in idle condition, if then execution in step 3; Otherwise, then return step 1;
Step 3, this node then send the FB grouping of one or more (quantifications), judge this moment, whether channel was in idle condition, if judge that according to intercepted result channel is in idle condition, illustrate that the node that does not send high priority traffic packets is more sending the FB grouping, then this node obtains channel access right, execution in step 4; If it is busy to judge that according to intercepted result channel is in, illustrate to send in addition more that the node of high priority traffic packets is sending longer FB grouping that then this node competition is failed and made a concession, and returns step 1;
The node of step 4, acquisition channel access right enters transmit stage and sends traffic packets.
Wherein, statement forecast in the step 1 (the FB grouping of statement real time business type) has guaranteed that real time business at first enters competitive stage and the preferential channel access right that obtains, non-real-time service is not only having the real time business transmission that participates in the competition, and promptly just can not enter the competitive stage under the situation of statement forecast.
Real time business and non-real-time service are earlier by statement differentiated service type in the present embodiment, again with short burst contention reservation channel and the mechanism of conflicting and solving, guaranteed real time business grouping access channel fast to greatest extent, obtain the channel right to use, have precedence over general non-real-time service grouping and finish the traffic packets transmission.
In the invention described above embodiment 1, be to utilize channel occupancy situation in the double bounce scope of sensitive carrier sense decision node, the collision that can avoid concealed terminal to cause like this.Particularly, in wireless network, the distance that receiver can listen to transmitter carrier is about 2 times that can correctly receive the grouping distance, just by intercept carrier signal strength in the channel in physical layer, node can be controlled (Media Access Control in media interviews, abbreviation MAC) sublayer judges whether channel is occupied in the double bounce scope, thereby avoids hidden terminal problem.
Embodiment 2:
As shown in Figure 2,, compare, before step 1, also comprise with a last embodiment for the present invention supports the flow chart of the multiple access method embodiment 2 of service quality:
Step 0, when node has the service needed access channel, this node is at first intercepted window time of channel, judges this moment, whether channel was in idle condition, if the window of intercepting in the time channel be in idle condition, then execution in step 1; If the window of intercepting in the time channel be in busy condition, this node repeated execution of steps 0 then.
Compare with a last embodiment, return step 1 in step 2 and the step 3, all replace with and return step 0; In step 3, judge by intercepting mini-slot of channel this moment, whether channel was in idle condition.In addition, compare, after step 4, also comprise the steps: with a last embodiment
Step 5, wait receive the message of feedback acknowledgment grouping, judge whether to receive feedback acknowledgment (acknowledgment is hereinafter to be referred as the ACK) blocking message after receiving node is correctly finished traffic packets, if correctly receive the message of ACK grouping, then execution in step 6; Otherwise, return step 0;
Step 6, finish the transmission of this traffic packets, the traffic packets that deletion is finished transmission and correctly received from the buffering formation.
What two embodiment of the multiple access method of the above-mentioned support service quality of the present invention proposed is a kind of multiple access method of supporting service quality by the statement type of service, node is by sending the technical scheme that forecast burst is at war with and conflicts and solve in the competitive stage, guaranteed more preferably access channel of real time business grouping, and significantly reduced in the possible packet collisions of transmit stage.
Embodiment 3:
Fig. 3 as shown in Figure 3, specifically comprises the steps: for the flow chart that the present invention supports the multiple access method embodiment 3 of service quality
Step 1, the node with real time business and non-real-time service are distinguished by statement respectively: intercept window time T of channel before the node access channel WinIf, should the time in channel idle, node is judged type of service according to the traffic packets that will send, and, node (real time business node) that real time business divides into groups to send is arranged then at T that is WinSend the FB grouping of a statement type of service after free time immediately, enter the competitive stage; Node (non-real-time service node) that non-real-time service grouping will send is arranged then at T WinContinue to intercept the mini-slot of a FB length after free time, if there is not the statement of real time business node, then the non-real-time service node enters the competitive stage; Otherwise then the non-real-time service node is kept out of the way;
Step 2, according to priority that will send traffic packets and time delay situation, the node that enters the competitive stage determines will to begin to send the beginning mini-slot of FB grouping, represents the sequence number of above-mentioned beginning mini-slot with I, I is a positive integer.Competitive stage can be divided into several mini-slot T Slot(T Slot＜T Win), T SlotSize be peak signal propagation delay, transmitting-receiving change-over time and receiver monitoring time sum; In order to obtain satisfied access efficiency, can adjust the size of real time business and non-real-time service competitive stage mini-slot number respectively according to loading condition; Judge whether channel all is in idle condition at beginning mini-slot (I mini-slot) burst mini-slot before, if I mini-slot burst time slot before is the free time, promptly the 1st is all idle to (I-1) individual mini-slot, illustrating does not have other neighbors to begin to send the FB grouping, this node sends the FB grouping since I mini-slot, and execution in step 3 is if listen to the FB grouping that the time slot before I the mini-slot has had node to send, then this node no longer adds competition, returns step 1;
Step 3, since I mini-slot, the node that send FB grouping begins to send predetermined number FB according to the priority of its traffic packets that will send and time delay situation and divides into groups, and represents above-mentioned predetermined number with K; After sending the individual FB grouping of K, this node is intercepted observation time T of channel Obs(T Obs=T Slot) to determine this moment, whether channel was in idle condition, if channel is in idle condition, then this node obtains to insert, determine to insert successfully, then execution in step 4, and is busy if channel is in, and illustrates that the node that sends high priority traffic packets is more in addition sending longer FB grouping, then this competition of this node is failed and is made a concession, and then returns step 1;
The node of step 4, transmission FB grouping is competed and is successfully obtained the channel access right, and sends traffic packets immediately, and the length of traffic packets should can have relative less expense by guarantee agreement like this much larger than the length of FB grouping; This node is waited for the ACK grouping feedback after the correct reception of receiving node, if correctly receive the ACK grouping, the traffic packets transmission success is described, then execution in step 5, otherwise, illustrating that traffic packets is not correctly received, this node is waited for and is entered the competitive stage of a new round, return step 1, insert and retransmit this grouping again;
Step 5, finish the transmission of this traffic packets, the grouping that deletion is finished transmission and correctly received from buffer queue, and, begin the competition and the process of transmitting of next grouping according to the node traffic load.。
Wherein, the selection that begins mini-slot (I mini-slot) in the step 3 is the probability distribution of parameter with determining to meet with packet-priority and time delay, and less than the competition slot sum of distributing to this kind business.Particularly, I obeys the brachymemma geometric probability distribution that parameter is q, and the size of q is relevant with the priority and the time delay of the traffic packets that will send.The number K that sends the FB grouping is that the length of FB grouping is to be determined by the priority and the time delay of the traffic packets that will send.Particularly, the FB number of packet that node sends since I mini-slot is K, and time span is KT FB(T FB=T Slot), the numerical value of K should be relevant with the priority and the time delay of the traffic packets that will send, and priority is high more, and K is just big more; Preferential according to losing efficacy the earliest (earliestdeadline first is called for short EDP) criterion, the size of K should be directly proportional with the time delay of real time business grouping, and the time delay of above-mentioned real time business grouping represents with D, i.e. K ∝ D/D Max, D wherein MaxMaximum allowable delay for the real time business grouping.Therefore, have higher priority and the node of the grouping of losing efficacy the earliest begins to send long FB grouping at time slot early, i.e. the long more node of FB grouping is enjoyed high more access right.When weighing the traffic packets load, can suitably increase competition slot so that obtain satisfied access efficiency.
When sending the FB grouping, predetermined channel is only when beginning all mini-slot before the mini-slot all are in idle condition, node could send the FB grouping, the competition node that is early start just is allowed to send the FB grouping, guaranteed that like this node that only begins to send at identical mini-slot has the right to enter the row that send candidate, and they are the highest nodes of service priority.
Support among the embodiment 3 of multiple access method of service quality the window time T of intercepting in the invention described above WinHaving determined does not have ongoing transmission and competition in the channel.Before entering the competitive stage, node relies on the FB of statement real time business type to divide into groups to distinguish the transmission priority of different business grouping, and the real time business node sends the FB grouping and preferentially enters the competitive stage; The non-real-time service node is intercepted the FB grouping of the statement real time business type that the real time business node sent, and can enter the competitive stage under the situation that does not have the real time business node to participate in the competition.
In addition, it is to separate that the present invention supports the competition access among the embodiment 3 of multiple access method of service quality to send with traffic packets, utilize the conflict settlement mechanism of forecast burst in the competitive stage, the real time business grouping is inserted by preferential acquisition of statement, and solved the collision problem of a plurality of service nodes.The collision of lacking FB in the transmit stage utilization has replaced the traffic packets transmit stage to grow the collision of traffic packets, and the minimizing of collision probability has improved network throughput, has also reduced the time delay of traffic packets, and network performance is greatly improved.
Embodiment 4:
Fig. 4 supports the real time business node of the multiple access method embodiment 4 of service quality to insert sequential chart for the present invention, now node (real time business node) A and the B access procedure of supporting to send among the multiple access method embodiment 4 of service quality the real time business grouping with the present invention is example, to the access and the process of transmitting of grouping are described in further details in real time among the present invention.As shown in Figure 4, specifically may further comprise the steps:
Step 1, real time business node A and real time business Node B are intercepted channel T WinAfter time, the acknowledgement channel state is idle, enters competitive stage T after sending the FB grouping of a statement real time business type respectively 1
The beginning mini-slot of step 2, the FB that utilizes the brachymemma geometric probability to distribute to determine real time business node A and real time business Node B according to the priority of traffic packets type and time delay situation, promptly determine the numerical value of I: identical if real time business node A and real time business Node B select to begin to send the beginning mini-slot of FB, be that I is identical, be 3 as I, and competitive stage T before this 1The the 1st to 2 mini-slot all do not have FB grouping to be sent out, illustrate that the traffic packets that present real time business node A and real time business Node B will send is the traffic packets with limit priority, therefore, real time business node A and real time business Node B all are allowed to send the FB grouping with competitive channel;
Step 3, the real time business node A and the real time business Node B that allow to send the FB grouping are at war with since the FB grouping that I mini-slot sends certain-length (predetermined number) separately respectively, the quantity K of FB grouping is by the priority and the decision of time delay situation of traffic packets, the preferential more transmission of the grouping that priority is high more, time delay is big more, the K of its place node is just big more; If real time business node A can send 4 FB groupings, and the traffic packets that the real time business Node B will send is merely able to send 2 FB groupings owing to time delay is less; Real time business node A and real time business Node B are intercepted channel T with after the FB grouping of predetermined number (it is 2 with the real time business Node B that real time business node A is 4) is sent completely separately ObsTime, the FB grouping number that the real time business Node B sends is less, early finishes transmission, at its T ObsThe interior real time business node A that can listen to can know promptly that still sending the FB grouping traffic packets that other node is arranged has higher access priority, and then the real time business Node B is kept out of the way and returned step 1 and insert again; And after real time business node A is sent completely, become the node that the longest FB grouping number is arranged in the node of current transmission FB grouping, thereby real time business node A is at T ObsListen to channel and be in idle condition, confirm thus to compete successfully, obtain to insert;
Step 4, the real time business node A that obtains to insert enter transmit stage T 2, send traffic packets (Packet is called for short PKT), and receive the ACK grouping, if receive the ACK of receiving node in the given time, this transmission success is described, execution in step 5; Otherwise, return step 1 and resend this grouping according to retransmission mechanism;
Step 5, according to the buffer queue situation, continue to insert and send or change idle condition over to.
Embodiment 5:
Fig. 5 supports the non-real-time service node of the multiple access method embodiment 5 of service quality to insert sequential chart for the present invention, now node (non-real-time service node) C and the D access procedure of supporting to send among the multiple access method embodiment 5 of service quality the non-real-time service grouping with the present invention is example, and the access and the process of transmitting of non real-time grouping among the present invention further described.Only there are difference in the competition process and the real time business of non real-time grouping in step 1, as shown in Figure 5, specifically comprise the steps:
Step 1, non-real-time service node C and non-real-time service node D intercept channel T WinAfter time, the acknowledgement channel state is idle, and continues to intercept the statement time slot, does not all receive the statement FB grouping that has the real-time packet service node to send in the neighbors, and this moment, non-real-time service node C and D entered competitive stage T 1
After this, non-real-time service node C and D access contention stage T 1With transmit stage T 2Step 2～5 similar with the corresponding steps of real time business node A shown in Figure 3 and B, do not repeat them here.
The invention described above supports the embodiment of the multiple access method of service quality to adopt the strategy of traffic packets prioritization, the real time business packet node determines at first to send will access channel the time statement forecast, therefore can preferentially begin to send the FB grouping and be at war with, thereby make the delay performance of real time business access maximum assurance.Especially when business load is big, guaranteed that preferentially the node of transmission real time business grouping can both obtain access channel quickly, and the node of transmission non-real-time service grouping can be done the transmission assurance of doing one's best by the mechanism that retransmits.
In addition, the present invention supports the embodiment of the multiple access method of service quality also to guarantee the fairness of node access channel.Node divides into groups to come the competitive channel access right by FB, and the length of FB grouping is by the priority and the time delay decision of traffic packets.The time delay that sends more its traffic packets of node of number of times should be less relatively, thereby it can not occupy the right to use of channel all the time; The node that the time delay situation is comparatively serious can obtain preferential the access under the same priority situation, guaranteed the fairness when node inserts.
The present invention supports each node among the embodiment of multiple access method of service quality that a semiduplex transceiver is only arranged, and equipment requirements is simple.In addition, the present invention supports the embodiment of the multiple access method of service quality all to be applicable to a plurality of multi-hop node access infrastructures that link to each other by the broadcast type medium, has wide range of applications.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be finished by the relevant hardware of program command, aforesaid program can be stored in the computer read/write memory medium, this program is carried out the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
It should be noted that at last: above embodiment only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.

Claims (10)

1, a kind of multiple access method of supporting service quality is characterized in that, comprising:
Step 1, node are judged type of service according to the traffic packets that will send, if real time business, described node then sends the forecast burst group of a statement type of service, execution in step 2; If non-real-time service, described node is then intercepted the mini-slot of a forecast burst group length, if do not listen to the forecast burst group of statement real time business type, then execution in step 2;
The quantity that step 2, described node are determined to send the beginning mini-slot of forecast burst group and sent forecast burst group, described node is intercepted the mini-slot of channel before described beginning mini-slot and whether all is in idle condition, if then execution in step 3; Otherwise, then return step 1;
Step 3, described node send one or more forecast burst group, judge whether channel is in idle condition, if then execution in step 4; Otherwise, then return step 1;
Step 4, described node access channel send traffic packets.
2, the multiple access method of support service quality according to claim 1, it is characterized in that the forecast burst group that node described in the described step 1 sends a statement type of service is specially: described node sends a forecast burst group of carrying the statement real time business type of real time business sign.
3, the multiple access method of support service quality according to claim 1, it is characterized in that the forecast burst group that node described in the described step 1 sends a statement type of service is specially: described node sends the forecast burst group of a length much smaller than the statement real time business type of traffic packets length.
4, the multiple access method of support service quality according to claim 1 is characterized in that, also comprises the steps: that node intercepts window time of channel before the described step 1, if channel idle, then execution in step 1.
5, the multiple access method of support service quality according to claim 1, it is characterized in that the quantity that node described in the described step 2 determine to send the beginning mini-slot of forecast burst group and sends forecast burst group is specially that " described node determines to send the beginning mini-slot of forecast burst group and the quantity of transmission forecast burst group according to priority that will send traffic packets and time delay.
6, the multiple access method of support service quality according to claim 1 is characterized in that, judges in the described step 3 whether channel is in idle condition and is specially: intercept mini-slot of channel, judge whether channel is in idle condition.
7, the multiple access method of support service quality according to claim 1 is characterized in that, also comprises after the described step 4:
Step 5, wait receive the message of feedback acknowledgment grouping, if correctly receive the message of feedback acknowledgment grouping, then execution in step 6; Otherwise, return step 1;
Step 6, the traffic packets that deletion is finished transmission and correctly received from the buffering formation.
8, the multiple access method of support service quality according to claim 5, it is characterized in that, described node determines that according to priority that will send traffic packets and time delay the beginning mini-slot that sends forecast burst group is specially: described node is the probability distribution of parameter according to the priority and the time delay that will send traffic packets with the node that enters the competitive stage, determines to send the beginning mini-slot of forecast burst group.
9, the multiple access method of support service quality according to claim 8, it is characterized in that, described node is the probability distribution of parameter according to the priority and the time delay that will send traffic packets with the node that enters the competitive stage, determine that the time slot that described node begins to send is specially: described node distributes according to will send the priority of traffic packets and brachymemma geometric probability that time delay is parameter with the node that enters the competitive stage, determines the beginning mini-slot of transmission forecast burst group.
10, the multiple access method of support service quality according to claim 5, it is characterized in that described node determines that according to priority that will send traffic packets and time delay the quantity that sends forecast burst group is specially: described node is the many more and definite quantity that sends forecast burst group of the preferential criterion that lost efficacy the earliest according to the high more quantity of priority.
CNB2007101185325A 2007-07-09 2007-07-09 Multi-address access method for supporting service quality Expired - Fee Related CN100505944C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2007101185325A CN100505944C (en) 2007-07-09 2007-07-09 Multi-address access method for supporting service quality

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2007101185325A CN100505944C (en) 2007-07-09 2007-07-09 Multi-address access method for supporting service quality

Publications (2)

Publication Number Publication Date
CN101102540A true CN101102540A (en) 2008-01-09
CN100505944C CN100505944C (en) 2009-06-24

Family

ID=39036584

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2007101185325A Expired - Fee Related CN100505944C (en) 2007-07-09 2007-07-09 Multi-address access method for supporting service quality

Country Status (1)

Country Link
CN (1) CN100505944C (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101841923A (en) * 2009-03-16 2010-09-22 宏达国际电子股份有限公司 Handle the method and the relevant apparatus thereof of RAP
CN102238753A (en) * 2011-02-24 2011-11-09 西北工业大学 Method for reliably transmitting real-time service in wireless ad hoc network based on cooperation reservation
CN103281750A (en) * 2013-05-31 2013-09-04 北京航空航天大学 Cooperation multiple access method and system for guaranteeing service quality and fairness
CN109587815A (en) * 2018-11-16 2019-04-05 国网江苏省电力有限公司盐城供电分公司 A kind of LPWAN radio multi-user access network structure and its control method
CN113812206A (en) * 2019-07-03 2021-12-17 索尼集团公司 Reserving future channel time on a wireless local area network

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101841923A (en) * 2009-03-16 2010-09-22 宏达国际电子股份有限公司 Handle the method and the relevant apparatus thereof of RAP
CN102238753A (en) * 2011-02-24 2011-11-09 西北工业大学 Method for reliably transmitting real-time service in wireless ad hoc network based on cooperation reservation
CN102238753B (en) * 2011-02-24 2014-07-16 西北工业大学 Method for reliably transmitting real-time service in wireless ad hoc network based on cooperation reservation
CN103281750A (en) * 2013-05-31 2013-09-04 北京航空航天大学 Cooperation multiple access method and system for guaranteeing service quality and fairness
CN103281750B (en) * 2013-05-31 2015-12-02 北京航空航天大学 Guarantee service quality and the collaboration multi-address access method of fairness and system
CN109587815A (en) * 2018-11-16 2019-04-05 国网江苏省电力有限公司盐城供电分公司 A kind of LPWAN radio multi-user access network structure and its control method
CN109587815B (en) * 2018-11-16 2023-03-28 国网江苏省电力有限公司盐城供电分公司 LPWAN wireless multi-user access network structure and control method thereof
CN113812206A (en) * 2019-07-03 2021-12-17 索尼集团公司 Reserving future channel time on a wireless local area network
CN113812206B (en) * 2019-07-03 2024-02-20 索尼集团公司 Reserving future channel time on wireless local area networks

Also Published As

Publication number Publication date
CN100505944C (en) 2009-06-24

Similar Documents

Publication Publication Date Title
US8477689B2 (en) System and methods for distributed medium access control and QOS scheduling in mobile ad-hoc networks
US7274676B2 (en) Burst-mode weighted sender scheduling for ad-hoc wireless medium access control protocols
TWI475836B (en) Method and device for controlling access to a wireless communication medium
KR101417937B1 (en) Wireless LAN system and Transmission method of data thereof
Alonso-Zarate et al. A near-optimum cross-layered distributed queuing protocol for wireless LAN
CN100505944C (en) Multi-address access method for supporting service quality
CN103281750B (en) Guarantee service quality and the collaboration multi-address access method of fairness and system
CN100521581C (en) Multi-address access method for service quality guarantee
CN101090524A (en) Adapter distribution multi-address access method
Lam et al. Polling-based protocols for packet voice transport over IEEE 802.11 wireless local area networks
CN100452745C (en) Multi-address access method with the confliction decomposition
CN100505584C (en) Fast precontract and line transmission multi-address access method
Nandiraju et al. Achieving fairness in wireless LANs by enhanced IEEE 802.11 DCF
Sangeetha et al. Service Differentiation in IEEE 802.11 ah WLAN under Restricted Access Window based MAC protocol
CN101141176B (en) Distributed acquisition multi-access method
Bi et al. Medium access control for QoS provisioning in vehicle-to-infrastructure communication networks
Kartsakli et al. Cross-layer enhancement for WLAN systems with heterogeneous traffic based on DQCA
Kartsakli et al. Cross-layer enhancement for wlan systems with heterogeneous traffic based on DQCA
KR102260298B1 (en) TCP-compatible optimal CSMA-based resource allocation in wireless network
Al-Karaki et al. EPCF: a lightweight multi-priority PCF for QoS support in IEEE 802.11 wireless LANs
Tian et al. Improving protocol capacity by scheduling random access on WLANs
Cheng et al. A scheduling-based medium access control protocol for supporting multi-class services in wireless networks
Nandiraju et al. Achieving fairness in wireless lans by enhanced 802.11 dcf
Pan et al. QoS-Aware Medium Access Control Protocols
CN100525254C (en) Multi-address access method according to requirement

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

Termination date: 20150709

EXPY Termination of patent right or utility model