CN105163393A - Wireless link resource management method for use in intelligent traffic - Google Patents
Wireless link resource management method for use in intelligent traffic Download PDFInfo
- Publication number
- CN105163393A CN105163393A CN201510626314.7A CN201510626314A CN105163393A CN 105163393 A CN105163393 A CN 105163393A CN 201510626314 A CN201510626314 A CN 201510626314A CN 105163393 A CN105163393 A CN 105163393A
- Authority
- CN
- China
- Prior art keywords
- value
- queue
- website
- competition
- packet
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/52—Allocation or scheduling criteria for wireless resources based on load
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a wireless link resource management method for use in intelligent traffic. A working mechanism of an intelligent road is innovated from two aspects. On one aspect, direct fairness of wireless nodes is realized through a bandwidth estimation algorithm, and innovation is performed from a fairness problem between nodes, so that the situation that certain nodes acquire a large quantity of bandwidths while certain nodes cannot obtain any bandwidth and are always in a starvation state is avoided. On the other aspect, service differentiation of data of different priorities is realized through a resource reservation model, and innovation is performed from differentiated services of the data of different priorities, so that data streams with higher priorities can be transmitted outwards at a higher speed. Through adoption of the method, the overall throughput can be increased on the premise of ensuring fairness.
Description
Technical field
The present invention relates to a kind of computer networking technology, particularly air-link resources management method in a kind of wisdom traffic.
Background technology
Traffic in recent years congestion problems more and more obtains global extensive concern, and for this reason, the construction theory of wisdom road (IntelligentRoad is called for short iRoad) is arisen at the historic moment, and provides a direction and means of dealing with problems for improving traffic.Such as the real time video signals of traffic intersection and traffic data can be transferred to master control room by supervisory control system is a good control device, if but this measure is applied to each traffic intersection, expense is huge undoubtedly, because need excavated pavement, and cable laying etc.So the wireless solution of low cost is more tempting.Existing wireless technology customization wireless device (be called wisdom node, also claim iNode) can be utilized to be installed on the signal lamp place (being easy to access power supply) of each traffic intersection, to complete communication by wireless link each other.
IRoad system can carry various application, and the video monitoring such as, mentioned before, can send to control room by the forwarding of some nodes by vision signal; Each iNode can also pass through sensor collection street traffic information, and is aggregated into central server, forms a real-time communication chart; INode can also improve the work of traffic lights, and namely each node collects the traffic conditions at respective crossing and exchange message each other, improves the operating state of traffic lights.IRoad itself is also the wireless network of a universality, can be applied to commerce services platform.Driver is served near can being inquired about by nearest iNode along the street, such as, has which hotel near, bar, restaurant etc., even can check that client marks, the concrete style of cooking etc.In order to above application can be supported, need to carry out integrated management to wireless bandwidth resource.Because wireless bandwidth is subject to the restriction of physical condition, so how rationally to utilize limited bandwidth resources to be difficult problems that wisdom road construction faces efficiently.How one of them emphasis is the data flow that various application produces if being exactly sets different priority.Communication such as between contiguous traffic lights has the highest priority, because its misoperation can cause life-threatening consequence.To the monitor video signal of the scene of the accident, also there is higher priority, and some real-time traffics figure signal, service signal etc. can distribute to lower priority nearby.The data flow of different priorities competes identical bandwidth, and carrying out Differentiated Services to them just becomes inevitable.
Summary of the invention
The present invention be directed to and how rationally to utilize limited bandwidth resources to carry out the problem of wisdom road management efficiently, propose air-link resources management method in a kind of wisdom traffic, innovate from two working mechanisms of aspect to wisdom road.One is innovate from the fairness problem between node and node, avoid some node to obtain more bandwidth, and some node can not get bandwidth, is in hungry state always; Another is innovated from the Differentiated Services of different priorities data, and the data flow making priority higher can send at faster speed.Ensureing the raising that can realize again entire throughput under fair prerequisite.
Technical scheme of the present invention is: air-link resources management method in a kind of wisdom traffic, comprise two parts, Part I realizes the direct fairness of radio node by bandwidth estimation algorithm, and Part II is the service differentiation being realized different priorities data by resource reservation model
The bandwidth estimation algorithm of Part I is specially: definition Wi represents the goodput of website i, and Li represents the load of website i, and φ i represents the weight allocation coefficient that website i allocates in advance, for meeting a fair Mac layer protocol,
When the load sum of all websites is starkly lower than channel capacity, the transmission requirement of each website should be met, and namely has Wi=Li for each website;
When the load sum of website exceedes channel capacity, each website first, weight allocation coefficient according to website is prorated to bandwidth, then, website calculates the transmission time by the packet kind received thus estimates the throughput of this website and the throughput of other competition websites, then Competition adjustment window;
In Part II, the realization of resource reservation mechanism in two steps, and first step link layer model is different pieces of information flow assignment priority size P
i, utilize dispatching algorithm to the queue Q of each priority
itake out corresponding packet and put into transmit queue; Second step is then the packet sending corresponding number after node competes channel according to priority size, safeguard that a counter is used for recording the current number Ci needing certain the priority data bag sent, and according to the priority of first packet to be sent, initialization is carried out to counter, then estimate the time T sending Ci packets need
dd, and assignment is to Duration field, other websites set the value of NAV according to Duration field, to ensure that website A sends the interference that can not be subject to other websites in the process of packet continuously.
The described weight allocation coefficient according to website is prorated to bandwidth: be its coefficient that assigns weight according to the significance level of website, the principle that weight allocation coefficient distributes is distributed according to the importance in its geographical position in the scope of the radio channel resource that contends with one other residing for website, coefficient for the distribution of location, transport hub in geographical position is higher, and coefficient magnitude is revised according to statistics; According to fair principle, it is equal that the bandwidth that each website obtains removes the value after the weight coefficient assigned by it.
The adjustment of described competition window:
The fair index of estimation is FIe=Ei/Eo, wherein Ei represents the estimation to self occupied bandwidth of website i, Eo represents the estimation to other website occupied bandwidths, setting constant C=1.01, when the value of FIe is greater than the value of C, illustrate that the band taken of this node is wider than other nodes, the value of Competition adjustment window is original twice, reduces the channel competition ability of node; When the value of FIe is between 1/Nv and C, then the size maintaining competition window is constant, and Parameter N v represents current competition nodes; When the value of FIe is less than 1/Nv, then illustrate that the throughput of this node is starkly lower than other nodes, the competition window of this node is reduced by half, to strengthen the competitiveness to channel.
If it is the value that the fair index of 1.01. is greater than C that C value counts optimal value by great many of experiments, illustrate that the band taken of this node is wider than other nodes, the value of Competition adjustment window is original twice, reduces the channel competition ability of node.If the value of FIe is between 1/Nv and C, then the size maintaining competition window is constant.When the value of FIe is less than 1/Nv, then illustrate that the throughput of this node is starkly lower than other nodes, the competition window of this node is reduced by half, to strengthen the competitiveness to channel.Parameter N v represents current competition nodes, and interval value (1/Nv, C) also can change according to competition nodes dynamically, and the accuracy of algorithm have also been obtained effective raising.So choosing of C value is very important, choosing little, the regulating frequency of competition window can become very large, causes algorithm work very unstable, if the value choosing of C is large, competition window is tending towards again constant.Algorithm according to competition nodes Competition adjustment window timely, more reasonably can distribute bandwidth, ensure that fairness.
The described dispatching algorithm that utilizes puts into transmit queue, concrete steps to the packet that correspondence is taken out in the queue of each priority:
First from the queue Q that priority is the highest
mstart traversal, namely with queue Q
mfor first current transmit queue, to current transmit queue Q
i, define the number that a variable Ci represents the packet that will take out from this queue, the initial value size of Ci is queue Q
icorresponding priority size P
i, get a packet from queue, Ci just subtracts 1 at every turn, until when the value of Ci is 0, then state scalar Si being become 0, Si initial value is 1, the packet that expression epicycle dispatches this queue sends end, continues to select next queue Q
i-1as current queue, often choose a packet, just by C
i-1value subtract 1, until C
i-1value be 0, then continue to select next priority query, until queue Q
1c
1=0, i.e. the state scalar Si=0 of all queues, represent that this is taken turns traversal and terminates; Finally the state scalar Si of all queues is recovered initial value, start the traversal of a new round;
If certain queue just without packet, was then first skipped this queue, is continued the queue Q of the next low priority of transmission before the value of Ci becomes 0
i-1;
As queue Q
i-1grouping all send and terminate after, the lower Q of detecting
iwhether there is grouping to arrive, if had, carry out Q
isend, if still do not divide into groups to arrive, then think at short notice, this queue does not have new grouping and arrives, and in order to ensure that the grouping of other queues can send in time, first this queue being labeled as and being sent, be i.e. S
i=0 transmission thereupon continuing next queue.
Beneficial effect of the present invention is: air-link resources management method in wisdom traffic of the present invention, and reasonable distribution node gained bandwidth, carries out the Differentiated Services of priority data on this basis, is ensureing the raising that can realize again entire throughput under fair prerequisite.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of resource reservation of the present invention;
Fig. 2 is road of the present invention layer model schematic diagram;
Fig. 3 is that mac frame of the present invention illustrates schematic diagram;
Fig. 4 is the example schematic of resource reservation of the present invention.
Embodiment
Air-link resources management method in the wisdom traffic that the present invention proposes, be applicable to wisdom road radio node between communication.Focus on the service differentiation realizing different significance level data under how solution ensures the prerequisite of fairness between node in limited air-link resources.
The present invention is mainly divided into two parts, and a part realizes the direct fairness of radio node by bandwidth estimation algorithm, and Part II is the service differentiation being realized different priorities data by resource reservation model.
In bandwidth estimation algorithm, certain node A safeguards Two Variables W
eoand W
ei, represent the estimation of estimation to other node occupied bandwidths and this node occupied bandwidth respectively.When node A receives RTS frame, judge whether to issue oneself according to the destination node information in frame, if not issuing oneself, then direct by variable W
eovalue adds the throughput estimated value of the size of RTS frame as other websites; If issue this node, then return a CTS frame, and by variable W
eovalue is updated to the size sum that original value adds RTS frame and CTS frame.What receive as node A is CTS frame, if not issuing oneself, then by variable W
eovalue is updated to the duration sum that original value adds CTS frame; If send to this node, then return a data frame, and upgrade W
eivalue be the size summation that original value adds CTS and DATA frame, the estimated value that the throughput as this node is new.
If what receive is that the mode of DATA frame and the process of ACK frame is the same.If this node first time sends RTS frame, then by W
eivalue add the size of RTS frame.The W of final acquisition
eivalue estimate as the throughput of this node, W
eovalue estimate as the throughput of other nodes.Suppose that the weight that each node is given is the same.Then fair coefficient FI is then defined as W
eiwith W
eoratio.Node A carrys out dynamic Competition adjustment window according to the value of FI.And choose C carrys out adjustment algorithm performance as a constant.If fair index is greater than the value of C, illustrate that the band taken of this node is wider than other nodes, the value of Competition adjustment window is original twice, reduces the channel competition ability of node.Parameter N v represents current competition nodes, and interval value (1/Nv, C) can change dynamically according to competition nodes.If the value of fair coefficient FI is between 1/Nv and C, then the size maintaining competition window is constant.When FI value <1/Nv then, illustrate that the throughput of this node is starkly lower than other nodes, the competition window of this node reduced by half, to strengthen the competitiveness to channel.
At intra-node, put into different priority queries after the data received are classified, then from the queue that priority is the highest, choose packet according to dispatching algorithm, finally generate orderly transmit queue.Detailed process is as follows: first from the queue Q that priority is the highest
mstart traversal, namely with queue Q
mfor first transmit queue.To current transmit queue Q
i, define the number that a variable Ci represents the packet that will take out from this queue, the initial value size of Ci is queue Q
icorresponding priority size P
i, get a packet from queue, Ci just subtracts 1 at every turn, until when the value of Ci is 0, then state scalar Si (initial value is 1) is become 0, the packet that expression epicycle dispatches this queue sends end, continues to select next queue Q
i-1as current queue, often choose a packet, just by C
i-1value subtract 1, until C
i-1value be 0, then continue to select next priority query, until queue Q
1c
1=0, i.e. the state scalar Si=0 of all queues, represent that this is taken turns traversal and terminates.Finally the state scalar Si of all queues is recovered initial value, start the traversal of a new round.If certain queue just without packet, was then first skipped this queue, is continued the queue Q of the next low priority of transmission before the value of Ci becomes 0
i-1.Consider that high-priority data queue likely just has new grouping to arrive, so work as Q in next second
i-1after the grouping of queue all sends and terminates, the lower Q of detecting
iwhether there is grouping to arrive, if had, carry out Q
isend, if still do not divide into groups to arrive, then think at short notice, this queue does not have new grouping and arrives, and in order to ensure that the grouping of other queues can send in time, first this queue being labeled as and being sent, be i.e. S
i=0.Continue the transmission of next queue thereupon.
After transmitting station A successful contention to channel, it needs maintenance counter to be used for recording the number of certain priority data bag that current needs send, and according to the priority of first packet to be sent, initialization is carried out to counter, then estimate the time T sending Ci packets need
dd, and assignment is to Duration field, T
ddcomputing formula be:
T
dd＝(C
i-1)×T
date+C
i×(2×SIFS+ACK)
T
daterepresent the time sending packet and take, SIFS represents the time sending SIFS frame and take, and ACK represents the time sending ACK frame and take.
Other websites set the value of NAV according to this Duration field, to ensure that website A sends the interference that can not be subject to other websites in the process of packet continuously.Before decreasing each transmission packet, the wasting of resources that competitive channel conflict produces, improves the utilance of link circuit resource.After node A sends a packet, counter just subtracts 1, be kept to before 0 at counter, A does not need again to carry out channel competition, after often sending a packet, as long as just can continue to send next packet through the time of SIFS, whole process of transmitting can be considered as the larger packet of transmission one.When counter is kept to after 0, if also have Packet Generation, then by the priority assignment of next packet to counter, start the transmission of a new round.After object website B receives the Frame of A, need in the value of replying the Duration field in ACK frame the time deducting an a SIFS and ACK frame.Namely
T
dack=T
dd-SIFS-ACK, T
dackrepresent that website B tells other nodes in his range of transmission, ensuing transmission needs the time taken.
After other websites listen to ACK frame, again upgrade the value of NAV.If now there is concealed nodes C to exist, when it receives the signal of Node B, then can enters holddown, avoid the conflict that concealed nodes causes.After website A receives ACK frame, continue to send next Frame after a SIFS time, and the value setting Duration is T
dd, computing formula is as follows:
T
dd＝T
dack-T
date-SIFS
Website B receive the second number according to this after in the same way calculate set aside some time.Until node A is complete for some Packet Generations of limit priority in queue, idiographic flow as shown in Figure 1.
For first fairness problem, propose bandwidth estimation algorithm.Here define the goodput that Wi represents website i, Li represents the load of website i, and φ i represents the weight allocation coefficient that website i allocates in advance.A fair Mac layer protocol should have following two character, and when the load sum of all websites is starkly lower than channel capacity, the transmission requirement of each website should be met, and namely has Wi=Li for each website.When the load sum of website exceedes channel capacity, each website should be assigned to bandwidth according to its weight allocation coefficient is pro rata, namely
represent that the value that the bandwidth that website i should distribute is removed in the weight of its correspondence except the bandwidth should distributed in weight and the website j of its correspondence is identical.But this is a kind of ideal situation, in fact only may make
value reach minimum.For the ease of calculating, define fair index FI, ideally, the bandwidth that each website distributes should be equal except the weighted value in it, when there is inequitable phenomenon, must have
the not identical situation of value, be divided by the ratio of any two nodes, selecting larger value except the result in less value is as the reference of fair index, when result is 1, is obviously the most fair.And majority of case result all can be greater than 1, so when considering the poorest, select maximum as the reference value of fair index in all results, in order to reach fair, the result of ratio is the smaller the better.Concrete formula is as follows:
The value of fair index FI is less, and the allocated bandwidth between website is more fair.In the algorithm, website calculates the transmission time by the packet kind received thus estimates the throughput of this website and the throughput of other competition websites, more corresponding Competition adjustment window.Wherein Ei represents the estimation to self occupied bandwidth of website i, Eo represents the estimation to other website occupied bandwidths, Ttype represents the time sending type type data packets, Tedate represents the evaluation time to the packet that other websites send, estimate that next other websites send the time of packet by the NAV vector value in RTS and CTS frame, vi=hash (IDs)+hash (IDd) expression extracts source address and destination address to the packet received, carry out the value after Hash summation respectively, V represents a set of depositing vi value.For convenience of explanation, simplified structure, this algorithm only considered the situation using RTS/CTS mechanism.For basic data transmission mechanism, only need by judging whether the size of packet selects whether to add the size of RTS frame and the size of CTS frame more than the threshold value of RTS/CTS mechanism.Algorithm is divided into two parts, and the bandwidth of the bandwidth that Part I mainly takies this node and other nodes is estimated, specific as follows:
Algorithm 1 is to the estimation distributing bandwidth
Here suppose that the weight allocation coefficient distributed each website is 0.5, then the fair index estimated is FIe=Ei/Eo.By v value, this algorithm judges whether the packet received is from website before, if so, website before does not then need to add the size of RTS frame and the sizes values of CTS frame.If not, then illustrate that this packet is from other competition websites.Then again to add the value of RTS frame and CTS frame.Doing so avoids double counting, improve the accuracy of algorithm.Algorithm 2 is the sizes carrying out dynamic Competition adjustment window according to the bandwidth ratio calculated.
The adjustment of algorithm 2 competition window
In algorithm 2, C carrys out the performance of adjustment algorithm as a constant.If it is the value that the fair index of 1.01. is greater than C that C value counts optimal value by great many of experiments, illustrate that the band taken of this node is wider than other nodes, the value of Competition adjustment window is original twice, reduces the channel competition ability of node.If the value of FIe is between 1/Nv and C, then the size maintaining competition window is constant.When the value of FIe is less than 1/Nv, then illustrate that the throughput of this node is starkly lower than other nodes, the competition window of this node is reduced by half, to strengthen the competitiveness to channel.Parameter N v represents current competition nodes, and interval value (1/Nv, C) also can change according to competition nodes dynamically, and the accuracy of algorithm have also been obtained effective raising.So choosing of C value is very important, choosing little, the regulating frequency of competition window can become very large, causes algorithm work very unstable, if the value choosing of C is large, competition window is tending towards again constant.Algorithm according to competition nodes Competition adjustment window timely, more reasonably can distribute bandwidth, ensure that fairness.
The service differentiation of data devises resource reservation model, and the realization of this resource reservation mechanism is divided into two parts, and Part I link layer model is different pieces of information flow assignment priority query Q
i, utilize dispatching algorithm to take out corresponding packet to the queue of each priority and put into transmit queue.Part II is then the packet sending corresponding number after node competes channel according to priority size.By Duration field, first packet sent tells that other competition node epicycles send the time needing to take, thus suppress the transmission of other nodes, reaches the object of resource reservation.Grader is introduced respectively, priority query and packet scheduling algorithm, as shown in Figure 2 in the link layer of this model.The function of grader is that the standard of classification can be time delay, also can be speed etc. according to the different QoS requirements in packet for they distribute priority.Specifically depending on actual requirement.Priority sequence is P
1<P
2<P
3< ... <P
m.P
ivalue larger, illustrate that the priority weighting of this data flow is higher, they are put into corresponding queue by then different according to packet P values.In order to realize the service differentiation of different priorities packet, devise new dispatching algorithm, at newly-increased state variable Si and the count window Ci of each priority query.Count window Ci is used for limit priority queue Q
ithe Packet Generation amount in traversal is taken turns, Ci=P one
i.The packet of the low priority that may cause to prevent absolute priority queuing policy does not have send opportunity or only has little bandwidth, distinguishes in the traversal of taking turns, queue Q by a state scalar Si
iwhether send the packet number of oneself.Packet scheduling algorithm both ensure that the packet of high priority can multiplely send, and can realize again certain fairness of Weight.Just introduce the operation principle of dispatching algorithm below in detail.
Algorithm false code is as follows:
Suppose that node is under unsaturated state
The detailed process analysis of algorithm: it be exactly the value of the mark scalar Si of each queue is 0 that algorithm starts a new criterion of taking turns traversal at every turn.Then initialization is carried out to all variablees.The Si value of each queue is 1, and the initial value of counter Ci is consistent with the priority value of corresponding queue.Then from the queue Q that priority is the highest
mstart traversal, whether first judgement symbol position is 1, if it is represent that this queue epicycle does not send, then judge in queue, whether there is grouping etc. to be sent, have, from queue, take out Ci grouping, put into transmit queue, if not grouping, what does not do, and skips this queue, enters next queue, same judges whether to meet the condition choosing grouping, then takes out the grouping of corresponding priority number.Before the next queue of selection, under first judging, whether the flag bit of previous queue is 1, if words say that the packet of a bright upper high-priority queue does not send, reselect this queue, if have wait for grouping; take out remaining grouping, if do not had, illustrate in this queue short time do not have be grouped into come, by the mark position 0 of this queue, then enter next queue circulation.After the queue of each successfully traversal, as long as the counter of this queue is 0, then flag bit is also set to 0.Special circumstances, when being recycled to last queue, do not have the grouping waited for, then mark position 0 starts the queue traversal of a new round.
In order to realize the resource reservation of the packet to different priorities, need the priority knowing packet, the value of the priority that the grader in the value of this priority and link model distributes is consistent.In order to keep compatible, between the Framcontrol field and Duration/ID field of 802.11mac frame, inserting a byte PT (prioritytag), being used for the priority of unlabeled data bag, as shown in Figure 3.Duration field is then used for telling that the ensuing transmission of other nodes needs the time of busy channel.After sending node is robbed and accounted for channel, the value according to this priority carrys out bandwidth reserved, and the size of priority represents the number of the packet that will send.
As shown in Figure 4, after certain node competes channel, it will calculate time shared by some packets of ensuing transmission equal priority according to the priority of first packet to be sent in transmit queue and this value assignment to the Duration field of packet, when other nodes receive this packet, if receiving node is not destination node, how long will continue calculating this node ensuing suppression time according to the Duration field of packet.And destination node is after receiving packet, can return an ACK frame, this ACK frame equally also can calculate the value of Duration, and account form is deduct the size of ACK frame itself and the size of channel transmission time.Node now within receiving node range of transmission outside sending node scope will receive this ACK frame, thus enters holddown, the interference which can effectively avoid concealed nodes to bring.And sending node recalculate after receiving this ACK frame send the remaining time required for Frame and again assignment to Duration field.Until the Packet Generation of all identical high priorities is complete in this sending node queue.Now this node will re-start the channel competition of a new round.
Claims (4)
1. air-link resources management method in a wisdom traffic, it is characterized in that, comprise two parts, Part I realizes the direct fairness of radio node by bandwidth estimation algorithm, Part II is the service differentiation being realized different priorities data by resource reservation model
The bandwidth estimation algorithm of Part I is specially: definition Wi represents the goodput of website i, and Li represents the load of website i,
φ irepresent the weight allocation coefficient that website i allocates in advance, for meeting a fair Mac layer protocol,
When the load sum of all websites is starkly lower than channel capacity, the transmission requirement of each website should be met, and namely has Wi=Li for each website;
When the load sum of website exceedes channel capacity, each website first, weight allocation coefficient according to website is prorated to bandwidth, then, website calculates the transmission time by the packet kind received thus estimates the throughput of this website and the throughput of other competition websites, then Competition adjustment window;
In Part II, the realization of resource reservation mechanism in two steps, and first step link layer model is different pieces of information flow assignment priority size
p i , utilize dispatching algorithm to the queue of each priority
q i take out corresponding packet and put into transmit queue; Second step is then the packet sending corresponding number after node competes channel according to priority size, safeguard that a counter is used for recording the current number Ci needing certain the priority data bag sent, and according to the priority of first packet to be sent, initialization is carried out to counter, then estimate the time T sending Ci packets need
dd, and assignment is to Duration field, other websites set the value of NAV according to Duration field, to ensure that website A sends the interference that can not be subject to other websites in the process of packet continuously.
2. air-link resources management method in wisdom traffic according to claim 1, it is characterized in that, the described weight allocation coefficient according to website is prorated to bandwidth: be its coefficient that assigns weight according to the significance level of website, the principle that weight allocation coefficient distributes is distributed according to the importance in its geographical position in the scope of the radio channel resource that contends with one other residing for website, coefficient for the distribution of location, transport hub in geographical position is higher, and coefficient magnitude is revised according to statistics; According to fair principle, it is equal that the bandwidth that each website obtains removes the value after the weight coefficient assigned by it.
3. air-link resources management method in wisdom traffic according to claim 1 or 2, is characterized in that, the adjustment of described competition window:
The fair index of estimation is FIe=Ei/Eo, wherein Ei represents the estimation to self occupied bandwidth of website i, Eo represents the estimation to other website occupied bandwidths, setting constant C=1.01, when the value of FIe is greater than the value of C, illustrate that the band taken of this node is wider than other nodes, the value of Competition adjustment window is original twice, reduces the channel competition ability of node; When the value of FIe is between 1/Nv and C, then the size maintaining competition window is constant, and Parameter N v represents current competition nodes; When the value of FIe is less than 1/Nv, then illustrate that the throughput of this node is starkly lower than other nodes, the competition window of this node is reduced by half, to strengthen the competitiveness to channel;
If it is the value that the fair index of 1.01. is greater than C that C value counts optimal value by great many of experiments, illustrate that the band taken of this node is wider than other nodes, the value of Competition adjustment window is original twice, reduces the channel competition ability of node; If the value of FIe is between 1/Nv and C, then the size maintaining competition window is constant; When the value of FIe is less than 1/Nv, then illustrate that the throughput of this node is starkly lower than other nodes, the competition window of this node is reduced by half, to strengthen the competitiveness to channel; Parameter N v represents current competition nodes, and interval value (1/Nv, C) also can change according to competition nodes dynamically, and the accuracy of algorithm have also been obtained effective raising; So choosing of C value is very important, choosing little, the regulating frequency of competition window can become very large, causes algorithm work very unstable, if the value choosing of C is large, competition window is tending towards again constant; Algorithm according to competition nodes Competition adjustment window timely, more reasonably can distribute bandwidth, ensure that fairness.
4. air-link resources management method in described wisdom traffic according to claim 1, is characterized in that, describedly utilizes dispatching algorithm to take out corresponding packet to the queue of each priority to put into transmit queue, concrete steps:
First from the queue that priority is the highest
q m start traversal, namely with queue
q m for first current transmit queue, to current transmit queue
q i , define the number that a variable Ci represents the packet that will take out from this queue, the initial value size of Ci is queue
q i corresponding priority size
p i , get a packet from queue, Ci just subtracts 1 at every turn, until when the value of Ci is 0, then state scalar Si being become 0, Si initial value is 1, the packet that expression epicycle dispatches this queue sends end, continues to select next queue
q i-1
as current queue, often choose a packet, just by C
i-1value subtract 1, until C
i-1value be 0, then continue to select next priority query, until queue
q 1c
1=0, i.e. the state scalar Si=0 of all queues, represent that this is taken turns traversal and terminates; Finally the state scalar Si of all queues is recovered initial value, start the traversal of a new round;
If certain queue just without packet, was then first skipped this queue, is continued the queue of the next low priority of transmission before the value of Ci becomes 0
q i-1
;
Work as queue
q i-1
grouping all send and terminate after, under detecting
q i whether there is grouping to arrive, if had, carry out
q i send, if still do not divide into groups to arrive, then think at short notice, this queue does not have new grouping and arrives, and in order to ensure that the grouping of other queues can send in time, first this queue being labeled as and being sent, be i.e. S
i=0 transmission thereupon continuing next queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510626314.7A CN105163393B (en) | 2015-09-28 | 2015-09-28 | Air-link resources management method in a kind of wisdom traffic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510626314.7A CN105163393B (en) | 2015-09-28 | 2015-09-28 | Air-link resources management method in a kind of wisdom traffic |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105163393A true CN105163393A (en) | 2015-12-16 |
| CN105163393B CN105163393B (en) | 2019-03-19 |
Family
ID=54804120
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510626314.7A Expired - Fee Related CN105163393B (en) | 2015-09-28 | 2015-09-28 | Air-link resources management method in a kind of wisdom traffic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105163393B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107896200A (en) * | 2017-11-08 | 2018-04-10 | 中国人民解放军国防科技大学 | Message scheduling method compatible with virtual link and packet switching mechanism |
| CN109472732A (en) * | 2018-10-22 | 2019-03-15 | 河南东方世纪交通科技股份有限公司 | A kind of high-speed integrated management-control method of wisdom and control platform |
| CN110399993A (en) * | 2018-04-25 | 2019-11-01 | 蔚来汽车有限公司 | For distributing the method, apparatus and computer storage medium of Service Source |
| CN112491748A (en) * | 2020-11-20 | 2021-03-12 | 中国电子科技集团公司第五十四研究所 | Credit-based proportional fair scheduling method supporting data packet exchange |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1529471A (en) * | 2003-10-17 | 2004-09-15 | 北京邮电大学 | Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN |
| CN101651963A (en) * | 2009-07-09 | 2010-02-17 | 南京工业大学 | Transmission control method based on differentiated service in IEEE 802.11 WLAN |
| US20100165920A1 (en) * | 2008-12-31 | 2010-07-01 | Mediatek Inc. | Method for boosting downlink transmission to mobile station and system utilizing the same |
| CN101795498A (en) * | 2010-01-15 | 2010-08-04 | 东南大学 | Data priority-based channel contention access method for wireless sensor network |
| CN104936303A (en) * | 2015-06-17 | 2015-09-23 | 西安电子科技大学 | Carrier sensing threshold and competition window combined control method |
-
2015
- 2015-09-28 CN CN201510626314.7A patent/CN105163393B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1529471A (en) * | 2003-10-17 | 2004-09-15 | 北京邮电大学 | Method for realizing bandwidth ensurement to high-priority-level user in wireless LAN |
| US20100165920A1 (en) * | 2008-12-31 | 2010-07-01 | Mediatek Inc. | Method for boosting downlink transmission to mobile station and system utilizing the same |
| CN101651963A (en) * | 2009-07-09 | 2010-02-17 | 南京工业大学 | Transmission control method based on differentiated service in IEEE 802.11 WLAN |
| CN101795498A (en) * | 2010-01-15 | 2010-08-04 | 东南大学 | Data priority-based channel contention access method for wireless sensor network |
| CN104936303A (en) * | 2015-06-17 | 2015-09-23 | 西安电子科技大学 | Carrier sensing threshold and competition window combined control method |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107896200A (en) * | 2017-11-08 | 2018-04-10 | 中国人民解放军国防科技大学 | Message scheduling method compatible with virtual link and packet switching mechanism |
| CN110399993A (en) * | 2018-04-25 | 2019-11-01 | 蔚来汽车有限公司 | For distributing the method, apparatus and computer storage medium of Service Source |
| CN109472732A (en) * | 2018-10-22 | 2019-03-15 | 河南东方世纪交通科技股份有限公司 | A kind of high-speed integrated management-control method of wisdom and control platform |
| CN109472732B (en) * | 2018-10-22 | 2021-05-25 | 河南东方世纪交通科技股份有限公司 | Intelligent high-speed comprehensive management and control method and management and control platform |
| CN112491748A (en) * | 2020-11-20 | 2021-03-12 | 中国电子科技集团公司第五十四研究所 | Credit-based proportional fair scheduling method supporting data packet exchange |
| CN112491748B (en) * | 2020-11-20 | 2022-05-27 | 中国电子科技集团公司第五十四研究所 | Credit-based proportional fair scheduling method supporting data packet exchange |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105163393B (en) | 2019-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Maheshwari et al. | Scalability and performance evaluation of edge cloud systems for latency constrained applications | |
| US11316795B2 (en) | Network flow control method and network device | |
| CN107733689A (en) | Dynamic weighting polling dispatching strategy process based on priority | |
| CN103596224B (en) | Resource regulating method based on multistage-mapping under a kind of high-speed mobile environment | |
| JP2003209887A (en) | Packet scheduling method in wireless base station, packet transmission apparatus, and packet scheduling program | |
| CN101436987A (en) | Method and apparatus for scheduling and configuring QoS service | |
| CN101828361A (en) | Be used for method and apparatus in the communications network system schedule data packets | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| RU2012155863A (en) | METHOD AND MANAGEMENT SYSTEM OF THE BANDBAND | |
| GB2574247A (en) | Communication system | |
| CN101286949A (en) | Wireless Mesh network MAC layer resource scheduling policy based on IEEE802.16d standard | |
| CN105163393A (en) | Wireless link resource management method for use in intelligent traffic | |
| CN104301933A (en) | Method for calculating bandwidth and distributing bandwidth in wireless ad hoc network | |
| US20200396152A1 (en) | Shaping outgoing traffic of network packets in a network management system | |
| CN112600684A (en) | Bandwidth management and configuration method of cloud service and related device | |
| CN103327542A (en) | QoS guarantee method and device applied to MSNET network | |
| Zhao et al. | Opportunistic routing for bandwidth-sensitive traffic in wireless networks with lossy links | |
| CN107332785A (en) | A kind of effective discharge control method based on dynamic duty threshold value | |
| Ito et al. | A bandwidth allocation scheme to meet flow requirements in mobile edge computing | |
| CN107659940B (en) | Multi-priority multi-channel media access control method based on channel perception | |
| CN113840330A (en) | Method for establishing connection, gateway equipment, network system and scheduling center | |
| WO2022027331A1 (en) | Bandwidth management method and apparatus, computer storage medium, and chip | |
| Kwon | Improving multi-channel wave-based V2X communication to support advanced driver assistance system (ADAS) | |
| Guan et al. | Virtual network embedding supporting user mobility in 5G metro/access networks | |
| Libório et al. | Network Slicing in IEEE 802.11 ah |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190319 Termination date: 20210928 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |