CN106851727A - The method that MANET congestion control is realized based on multipath routing protocols - Google Patents
The method that MANET congestion control is realized based on multipath routing protocols Download PDFInfo
- Publication number
- CN106851727A CN106851727A CN201710049057.4A CN201710049057A CN106851727A CN 106851727 A CN106851727 A CN 106851727A CN 201710049057 A CN201710049057 A CN 201710049057A CN 106851727 A CN106851727 A CN 106851727A
- Authority
- CN
- China
- Prior art keywords
- node
- congested
- route
- congestion
- 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
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0284—Traffic management, e.g. flow control or congestion control detecting congestion or overload during communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of method for realizing MANET congestion control based on multipath routing protocols, mainly solve to cause network throughput drastically to decline the problem high with node packet loss after prior art lacks congestion control mechanism, and then generation congestion.Its implementation is：1. the periodic statistics of each node in network, and judge this node whether congestion；2. congested node analysis congestion cause is the use of low speed chain circuit or congested node total flow is excessive caused；3. for having used the congestion caused by low speed chain circuit, congested node to alleviate congestion by suppressing the means of low speed chain circuit；4. caused congestion excessive for congested node total flow, congested node alleviates congestion by the means of flow scheduling or random loss.The present invention compares traditional congestion control method, is taken with means are targetedly alleviated according to different congestion causes, further increases network throughput, can be used for Ad Hoc networks.
Description
Technical field
The invention belongs to wireless communication technology field, more particularly to a kind of method for realizing MANET congestion control can be used
In Ad Hoc networks.
Background technology
Ad Hoc networks be it is a kind of be made up of temporarily some radio data-transmission equipments, do not need fixed communication facility branch
The network without center held.Network node is both communication terminal, can be again other node for data forwarding as router.
In recent years, congestion control of the scholars in Ad Hoc networks has carried out positive research, it is proposed that some
The method of kind.Most common method is the jamming control method in Transmission Control Protocol, and its congestion control depends on congestion window
Cwd, the size of window value represents the byte number that can disposably send, it is clear that window is bigger, the speed of data is activation
It is faster, but it is also possible that so that there is congestion in network, so employed in TCP slow turn-on, Congestion Avoidance, acceleration successively decrease and
The technologies such as Fast retransmission carry out the size that dynamic adjusts congestion window.But performance of the Transmission Control Protocol in Ad Hoc networks can not show a candle to
Its performance in traditional cable network, this is mainly due to Ad Hoc networks and the property difference of cable network.For example,
In Ad Hoc networks, transmission medium is local shared.In addition, Transmission Control Protocol judges that the foundation of network congestion is message dropping, and
The miss-reason of message is not only network congestion in Ad Hoc networks, also the reason such as frequent change of link down, route.
Active queue management AQM is also a kind of common jamming control method, and it is a kind of queue management method of prediction formula, the method
State to network is evaluated, so as to the situation for predicting whether congestion occur.Will be gathered around when router is predicted
During plug, router queue also not full of when just according to certain regular packet discard and to transmitting terminal signal congestion feelings
Condition, to reduce the transmission rate of transmitting terminal.But, in order to simplify during design generally have ignored system in the current AQM mechanism
Delay link, postpone it is smaller in the case of, influence of the negligible delay to systematic function is smaller；But postponing than larger
In the case of, it is unstable that negligible delay frequently can lead to system.Show by a large amount of the simulation experiment results, several typical AQM
Algorithm has the following disadvantages in the case where delay is larger, is first queue oscillation on large scale, increased delay jitter end to end,
Next to that link utilization is low, network throughput is greatly reduced, and is finally that queue length can not restrain, and a large amount of packet losses occurs in node
Situation.
The content of the invention
It is an object of the invention to be directed to above-mentioned the deficiencies in the prior art, it is proposed that one kind is based on multipath routing protocols reality
The method of existing MANET congestion control, to improve network throughput, reduces node packet loss.
Realizing the technical scheme of the object of the invention is：It is former according to different congestions by the detection to node congestion situation
Because taking different alleviation means, its specific steps to include as follows：
(1) its neighbor node is designated as n by each node in networki, i=1,2,3 ... ..K, wherein K represent neighbours
The number of node, and a congestion cycle T is waited, count the cycle interior this node and be sent to each neighbor node niData point
Group numberWith this node from each neighbor node niThe number of data packets of reception
(2) each node in network judges whether congestion according to the length of this nodal cache queue, if so, by this section
Point is designated as " congested node ", performs step (4), otherwise, this node is designated as into " non-congested node ", performs step (3)；
(3) non-congested node closes buffer queue random loss mechanism, return to step (1)；
(4) congested node judges whether to have had been switched on buffer queue random loss mechanism, if so, then return to step (1),
Otherwise, step (5) is performed；
(5) congestion cause of congested node is analyzed：
(5a) makes initial parameter i=1；
(5b) judges congested node to its neighbor node niLink whether be a low speed chain circuit, if so, then performing
Step (5c), otherwise, performs step (5f)；
(5c) assumes that the data packet size in network is D bits, and each packet size is consistent, calculates congested node and arrives
Neighbor node niMean transit delayWith congested node to its other neighbor nodes njMean transit delay
WhereinIt is congested node to its neighbor node niThe transmission rate of this link, j is not equal to i,It is congestion
Neighbor node n of the node to itjThe transmission rate of this link,Its neighbor node n is sent to for congested nodejData
Packet count；
(5d) calculates the hypothesis queue length q of congested nodea：
qa=q-EN
Wherein q is the physical length of congested node current cache queue, and EN is that congested node additionally more within the cycle to be passed
Defeated number of data packets,Its neighbor node n is sent to for congested nodeiNumber of data packets,
N isWithThe ratio of the two mean transit delays,
(5e) assumes that congested node length of buffer queue is qa, whether congested node no longer congestion is judged, if so, then congestion
The reason for be the use of congested node to neighbor node niCaused by this low speed chain circuit, step (6) is performed, otherwise, perform step
(5f)；
(5f) judge initial parameter i whether more than neighbor node number K, if so, then congestion the reason for be due to congestion
Caused by the total flow of node is excessive, step (7) is performed, otherwise, make i=i+1, return to step (5b)；
(6) congested node is by the neighbor node n in step (5e)iLow speed node is designated as, by the hand for suppressing low speed chain circuit
Section alleviates the congestion caused by congested node to low speed node this link, return to step (1)；
(7) congested node is alleviated by the means of flow scheduling or random loss and is caused by congested node total flow is excessive
Congestion.
The present invention has the following advantages that compared with prior art：
1., compared to the active queue management AQM supported based on router, the present invention is by analyzing congestion the reason for occur,
Employ and suppress the means of low speed chain circuit and alleviate the congestion caused by congested node to low speed node this link, it is to avoid tradition
The blindness of Routing Protocol, improves the efficiency of Routing for On-Demand Protocol in MANET.
2. the reason for present invention occurs by analyzing congestion, the means for employing flow scheduling or random loss are alleviated by gathering around
The plug node total flow excessive congestion for causing, it is to avoid the simple packet loss and the disadvantage in the case of Time Delay of Systems is larger of AQM methods
End, makes the alleviation more specific aim and high efficiency of congestion.
Brief description of the drawings
Fig. 1 is of the invention to realize general flow chart；
Fig. 2 is the sub-process figure that congested node alleviates the congestion that link causes by suppressing low speed chain circuit in the present invention；
Fig. 3 is the son that congested node alleviates the excessive congestion for causing of flow by flow scheduling or random loss in the present invention
Flow chart；
Fig. 4 is the sub-process figure of forking node searching effectively replacement route in the present invention；
Fig. 5 is usage scenario schematic diagram of the invention；
Specific embodiment
Present invention is described in detail with reference to the accompanying drawings and examples, the present embodiment is with technical solution of the present invention
Under the premise of implemented, give detailed embodiment and operating process, but protection scope of the present invention is not limited to following reality
Apply example.
Reference picture 5, the network scenarios that the present invention is used is Ad Hoc self-organizing networks.The Internet of node uses multipath
Table- driven agreement, MAC layer uses TDMA agreements, and congested node is to be judged as congestion state according to this nodal cache queue length
Node, forking node is that congested node elects the node for carrying out flow scheduling, and access node is forking node main road by upper
3rd hop node, shunting race node is that master is routed across forking node to the node of this link of congested node.
It is of the invention to realize that step is as follows referring to the drawings 1：
The periodic statistics of each node in step 1, network.
Its neighbor node is designated as n by each node in networki, i=1,2,3 ... ..K, wherein K represent that neighbours save
The number of point, and a congestion cycle T is waited, count the cycle interior this node and be sent to each neighbor node niPacket
NumberWith this node from each neighbor node niThe number of data packets of reception.
Each node in step 2, network judges whether congestion according to the length of this nodal cache queue.
(2a) calculates the ratio of the number-of-packet q and cache size Q cached in buffer queue：It is big further according to r values
It is small, it is divided into following three kinds of situations and judges：
As r≤η1When, this node is normal, is judged to non-congested state, performs step 3；
Work as η1<r≤η2When, this node is it may happen that congestion is, it is necessary to determine whether, execution step (2b)；
Work as η2<During r, the packet of this nodal cache excessively, is judged to congestion state, performs step 4；
(2b) node calculates the input rate λ of the packet and output speed μ of packet：
WhereinIt is this node from each neighbor node niThe number of data packets of reception, K is this node neighbor node number,
T is congestion cycle, TsIt is the average service time of packet, the service time of packet refers to since packet is in buffer queue head
To the time that packet is sent as only；
(2c) calculates the ratio between input rate λ and the output speed μ of packet of packet：Further according to ρ value sizes, it is divided into
Following two situations judge：
When ρ≤1, this node is normal, is judged to non-congested state, performs step 3；
Work as ρ>When 1, the packet of this node can further increase, and be judged to congestion state, perform step 4.
Step 3, non-congested node close buffer queue random loss mechanism.
After buffer queue random loss mechanism is opened, the data point of input-buffer queue are just wanted with certain probability P random drop
Group, congestion notification is sent by abandoning packet to transmitting terminal, and the transmitting terminal reduction packet for receiving congestion notification is passed
Defeated speed, it is to avoid queue is fully loaded to overflow, and alleviates to congestion state, returns again to step 1.
Step 4, congested node judge whether to have had been switched on buffer queue random loss mechanism, if so, then return to step
1, otherwise, perform step 5；
The congestion cause of step 5, analysis congested node.
(5a) makes initial parameter i=1；
(5b) judges congested node to its neighbor node niLink whether be a low speed chain circuit, if so, then performing
Step (5c), otherwise, performs step (5f)；
(5c) assumes that the data packet size in network is D bits, and each packet size is consistent, calculates congested node and arrives
Neighbor node niMean transit delayWith congested node to its other neighbor nodes njMean transit delay
WhereinIt is congested node to its neighbor node niThe transmission rate of this link, j is not equal to i,It is congestion
Neighbor node n of the node to itjThe transmission rate of this link,Its neighbor node n is sent to for congested nodejData
Packet count；
(5d) calculates the hypothesis queue length q of congested nodea：
qa=q-EN
Wherein q is the physical length of congested node current cache queue, and EN is that congested node additionally more within the cycle to be passed
Defeated number of data packets,Its neighbor node n is sent to for congested nodeiNumber of data packets,
N isWithThe ratio of the two mean transit delays,
(5e) assumes that congested node length of buffer queue is qa, whether congested node no longer congestion is judged, if so, then congestion
The reason for be the use of congested node to neighbor node niCaused by this low speed chain circuit, step 6 is performed, otherwise, perform step
(5f)；
(5f) judge initial parameter i whether more than neighbor node number K, if so, then congestion the reason for be due to congestion
Caused by the total flow of node is excessive, step 7 is performed, otherwise, make i=i+1, return to step (5b)；
Step 6, congested node are by the neighbor node n in step (5e)iLow speed node is designated as, by suppressing low speed chain circuit
Means alleviate the congestion caused by congested node to low speed node this link.
Reference picture 2, this step is implemented as follows：
(6a) makes initial parameter i=1, M route project bar number in being equal to congested node routing table；
(6b) check congested node i-th route entry purpose main road by, judge the main road by next-hop node whether
It is low speed node, if so, then performing step (6c), otherwise, performs step (6i)；
(6c) records the low speed node in i-th route project；
(6d) judges that i-th route entry purpose time route whether there is, if so, then performing step (6e), otherwise, performs step
Suddenly (6h)；
(6e) judges in above-mentioned route whether the link of congested node to next-hop node is a low speed chain circuit, if
It is then to perform step (6f), otherwise, performs step (6g)；
Next-hop node in step (6e) is also denoted as low speed node by (6f), is recorded in i-th route project, is performed
Step (6h)；
(6g) is with i-th route entry purpose time route covering main road by performing step (6i)；
(6h) empties i-th route project, when having packet to check the route entry next time, directly abandons data point
Group, performs step (6i)；
Whether (6i) judges initial parameter i more than or equal to project bar number M is route in congested node routing table, if so, then holding
Row step (6j), otherwise, makes i=i+1, return to step (6b)；
(6j) congested node waits next congestion cycle T again, and counts this node and be sent to each neighbor node ni's
Number of data packetsWith this node from each neighbor node niThe number of data packets of receptionAnd in the congestion cycle T, do not make
The route messages sent with low speed node update the route project that low speed node is have recorded in this node route list；
(6k) judges whether congestion according to the length of congested node buffer queue, if so, step (6l) is then performed, otherwise,
Perform step (6m)；
(6l) congested node open queue random loss mechanism, performs step (6n)；
(6m) judges whether the link of congested node to low speed node is still a low speed chain circuit, if so, then return to step
(6j), otherwise, performs step (6n)；
The low speed node of (6n) congested node deletion record, and sent using low speed node in next congestion cycle T
Routing iinformation normally update the routing table of this node, return to step 1.
Step 7, congested node are drawn by the means alleviation of flow scheduling or random loss by congested node total flow is excessive
The congestion for rising.
Reference picture 3, this step is used but is not limited to flow scheduling means to being caused by congested node total flow is excessive
Congestion, is implemented as follows：
(7a) congested node calculates the input rate that should be unloaded：F=λ-μ, wherein λ are packet input rate, and μ is defeated for packet
Go out speed, further according to the size of f values, a point following two situations are processed：
When f≤0, the congestion situation of congested node can take a turn for the better, return to step 1；
Work as f>When 0, congested node should unload a part of flow, perform step (7b)；
(7b) congested node calculates its each neighbor node niPacket input rate：I=1,2,
3 ... ..K, K are the number of neighbor node,It is this node from each neighbor node niThe number of data packets of reception, T is congestion
Cycle；
(7c) congested node judges whether a packet input rate λ for neighbor nodeiMore than or equal to what should be unloaded
Input rate f, if so, then performing step (7e), otherwise, performs step (7d)；
(7d) congested node open queue random loss mechanism, return to step 1；
(7e) congested node is by all neighbor nodes by packet input rate λiArrange from small to large, be examined in all neighbours
Node is occupied, until finding a packet input rate λ for neighbor nodeiMore than or equal to the input rate f that should be unloaded, and by the neighbour
Occupy node and be designated as forking node；
(7f) congested node records forking node, and sends congestion information to forking node, and forking node receives congestion letter
After breath, search some available routes for bypassing congested node and replace the original route by congested node；
Reference picture 4, searches some available routes for bypassing congested node and replaces the original route by congested node, its tool
Body is realized as follows：
(7f1) makes initial parameter i=1, M route project bar number in being equal to forking node routing table；
(7f2) forking node checks i-th route entry purpose main road by whether the next-hop node for judging the route is to gather around
Plug node, and judge whether destination node is not the congested node, if both meeting, step (7f3) is performed, otherwise, hold
Row step (7f11)；
(7f3) forking node records congested node in i-th route project, and the route project is not used and contains congestion
The route of node is updated；
(7f4) judges that i-th route entry purpose time route whether there is, if so, then performing step (7f5), otherwise, performs
Step (7f6)；
(7f5) forking node i-th route entry purpose time route covering main road is by performing step (7f11)；
Main road is designated as access node by (7f6) forking node by the 3rd upper hop node；
(7f7) forking node judges whether the effective routing of access node, i.e., without the route of congested node,
If so, then performing step (7f8), otherwise, step (7f9) is performed；
Main road is spliced into new main road by (7f8) forking node by with the effective routing in step (7f8) or step (7f9)
By, and i-th route entry purpose main road is covered by performing step (7f11)；
(7f9) forking node judges whether that one to the effective of access node can be found by On-demand routing lookup method
Route, if so, then performing step (7f8), otherwise, performs step (7f10)；
The On-demand routing lookup method, implementation step is as follows：
The source nodes of § 1. broadcast a route requests packet RREQ, and content includes destination node, source node, middle node point range
Table and route requests packet ID number, and a route querying timer RT is initialized, perform step § 2；
The source nodes of § 2. judge whether to receive route replies packet RREP, if so, then found an effective routing, i.e.,
Intermediate node list, otherwise, performs step § 3；
After the source nodes of § 3. are waited one second, route querying timer RT numerical value is subtracted one, and judge route querying timer RT
Whether zero is less than, if so, cannot then find an effective routing, otherwise, return to step § 2；
The intermediate nodes of § 4. receive route requests packet RREQ, judge whether this node is received according to route requests packet ID number
Route requests packet RREQ was arrived, if so, then directly abandoning packet, otherwise, step § 5 was performed；
The intermediate nodes of § 5. judge whether the intermediate node table in route requests packet RREQ includes this node, if so, then straight
Discarding packet is connect, otherwise, step § 6 is performed；
The intermediate nodes of § 6. judge the destination node of route requests packet RREQ whether be this node or this node whether have to
The route of destination node, if so, then performing step § 8, otherwise, performs step § 7；
This node is inserted route requests and is grouped the intermediate node list of RREQ by the intermediate nodes of § 7., and forwards the route to ask
Seek packet RREQ；
The intermediate nodes of § 8. construction route replies packet RREP, and invert the middle node point range in route requests packet RREQ
Table returns to the path of source node as route replies packet RREP；
(7f10) forking node empties i-th route project, when having packet to check the route entry next time, directly loses
Abandon packet；
Whether (7f11) judges initial parameter i more than or equal to project bar number M is route in forking node routing table, if so, then
Step (7f12) is performed, otherwise, i=i+1 is made, and perform step (7f2)；
(7f12) forking node is to the route project in neighbor node forwarding step (7f8)；
(7g) congested node waits next congestion cycle T, and counts this node in the cycle and be sent to each neighbour section
Point niNumber of data packetsWith this node from each neighbor node niThe number of data packets of reception
(7h) judges whether congestion according to the length of congested node buffer queue, if so, step (7i) is then performed, otherwise,
Perform step (7j)；
(7i) congested node open queue random loss mechanism, performs step (7k)；
(7j) judges the packet input rate λ of the congested node and input rate λ of forking nodeiWhether sum is less than or equal to
The output speed μ of congested node, if so, then performing step (7k), otherwise, return to step (7g)；
The forking node of (7k) congested node deletion record, and send revocation congestion information, return to step 1 to it.
The above-mentioned steps that the present invention passes through, for destination node G, the packet of forking node D and shunting race node E is not
Again by congested node A, but by a new route for On-demand routing lookup method discovery, the new route is followed successively by shunting
Node D to node J to node K to node L to access node I to destination node G, i.e. D-J-K-L-I-G, so as to reach shunting
Effect.
Claims (6)
1. a kind of method that MANET congestion control is realized based on multipath routing protocols, including：
(1) its neighbor node is designated as n by each node in networki, i=1,2,3 ... ..K, wherein K represent neighbor node
Number, and wait a congestion cycle T, count this node in the cycle and be sent to each neighbor node niNumber of data packetsWith this node from each neighbor node niThe number of data packets of reception
(2) each node in network judges whether congestion according to the length of this nodal cache queue, if so, this node is remembered
It is " congested node " to perform step (4), otherwise, this node is designated as " non-congested node ", performs step (3)；
(3) non-congested node closes buffer queue random loss mechanism, return to step (1)；
(4) congested node judges whether to have had been switched on buffer queue random loss mechanism, if so, then return to step (1), no
Then, step (5) is performed；
(5) congestion cause of congested node is analyzed：
(5a) makes initial parameter i=1；
(5b) judges congested node to its neighbor node niLink whether be a low speed chain circuit, if so, then performing step
(5c), otherwise, performs step (5f)；
(5c) assumes that the data packet size in network is D bits, and each packet size is consistent, calculates congested node to neighbours
Node niMean transit delayWith congested node to its other neighbor nodes njMean transit delay
WhereinIt is congested node to its neighbor node niThe transmission rate of this link, j is not equal to i,It is congested node
To its neighbor node njThe transmission rate of this link,Its neighbor node n is sent to for congested nodejPacket
Number；
(5d) calculates the hypothesis queue length q of congested nodea：
qa=q-EN
Wherein q is the physical length of congested node current cache queue, and EN is congested node additionally many transmission within the cycle
Number of data packets, Its neighbor node n is sent to for congested nodeiNumber of data packets, N is
WithThe ratio of the two mean transit delays,
(5e) assumes that congested node length of buffer queue is qa, whether congested node no longer congestion is judged, if so, the then original of congestion
Because being the use of congested node to neighbor node niCaused by this low speed chain circuit, step (6) is performed, otherwise, perform step (5f)；
(5f) judge initial parameter i whether more than neighbor node number K, if so, then congestion the reason for be due to congested node
Total flow it is excessive caused by, perform step (7), otherwise, make i=i+1, return to step (5b)；
(6) congested node is by the neighbor node n in step (5e)iLow speed node is designated as, is alleviated by the means for suppressing low speed chain circuit
The congestion caused by congested node to low speed node this link, return to step (1)；
(7) congested node by the means of flow scheduling or random loss alleviate by congested node total flow it is excessive cause gather around
Plug.
2. the method according to claims 1, wherein step (2), step (5e), step (6k) and step (7h) interior joint
Congestion is judged whether according to length of buffer queue, is carried out as follows：
(2a) calculates the ratio of the number-of-packet q and cache size Q cached in buffer queue：Further according to r value sizes, point
For following three kinds of situations judge：
As r≤η1When, this node is normal, is judged to non-congested state；
Work as η1<r≤η2When, this node is it may happen that congestion is, it is necessary to determine whether, execution step (2b)；
Work as η2<During r, the packet of this nodal cache excessively, is judged to congestion state；
(2b) node calculates the input rate λ of the packet and output speed μ of packet：
WhereinIt is this node from each neighbor node niThe number of data packets of reception, K is this node neighbor node number, and T is to gather around
Plug cycle, TsBe the average service time of packet, service time of packet refer to since packet in the buffer queue head to point
Group is sent as the time only；
(2c) calculates the ratio between input rate λ and the output speed μ of packet of packet：Further according to ρ value sizes, it is divided into following
Two kinds of situations judge：
When ρ≤1, this node is normal, is judged to non-congested state；
Work as ρ>When 1, the packet of this node can further increase, and be judged to congestion state.
3. the method according to claims 1, congested node is delayed by suppressing the means of low speed chain circuit wherein in step (6)
The congestion that solution is caused by congested node to low speed node this link, is carried out as follows：
(6a) makes initial parameter i=1, M route project bar number in being equal to congested node routing table；
(6b) check congested node i-th route entry purpose main road by, judge the main road by next-hop node whether be low
Fast node, if so, then performing step (6c), otherwise, performs step (6i)；
(6c) records the low speed node in i-th route project；
(6d) judges that i-th route entry purpose time route whether there is, if so, then performing step (6e), otherwise, performs step
(6h)；
(6e) judges in above-mentioned route whether the link of congested node to next-hop node is a low speed chain circuit, if so, then
Step (6f) is performed, otherwise, step (6g) is performed；
Next-hop node in step (6e) is also denoted as low speed node by (6f), is recorded in i-th route project, performs step
(6h)；
(6g) is with i-th route entry purpose time route covering main road by performing step (6i)；
(6h) empties i-th route project, when having packet to check the route entry next time, directly abandons packet, holds
Row step (6i)；
Whether (6i) judges initial parameter i more than or equal to project bar number M is route in congested node routing table, if so, then performing step
Suddenly (6j), otherwise, i=i+1, return to step (6b) are made；
(6j) congested node waits next congestion cycle T again, and counts this node and be sent to each neighbor node niData point
Group numberWith this node from each neighbor node niThe number of data packets of receptionAnd in the congestion cycle T, do not use low speed
The route messages that node sends update the route project that low speed node is have recorded in this node route list；
(6k) judges whether congestion according to the length of congested node buffer queue, if so, then performing step (6l), otherwise, performs
Step (6m)；
(6l) congested node open queue random loss mechanism, performs step (6n)；
(6m) judges whether the link of congested node to low speed node is still a low speed chain circuit, if so, then return to step (6j),
Otherwise, step (6n) is performed；
The low speed node of (6n) congested node deletion record, and the road sent using low speed node in next congestion cycle T
The routing table of this node is normally updated by information.
4. the method according to claims 1, congested node is by flow scheduling or random loss wherein in step (7)
Means are alleviated by the excessive congestion for causing of congested node total flow, carry out as follows：
(7a) congested node calculates the input rate that should be unloaded：F=λ-μ, wherein λ are packet input rate, and μ is packet output speed
Rate, further according to the size of f values, a point following two situations are processed：
When f≤0, the congestion situation of congested node can take a turn for the better, return to step (1)；
Work as f>When 0, congested node should unload a part of flow, perform step (7b)；
(7b) congested node calculates its each neighbor node niPacket input rate：K is
The number of neighbor node,It is this node from each neighbor node niThe number of data packets of reception, T is the congestion cycle；
(7c) congested node judges whether a packet input rate λ for neighbor nodeiMore than or equal to the input speed that should be unloaded
Rate f, if so, then performing step (7e), otherwise, performs step (7d)；
(7d) congested node open queue random loss mechanism, return to step (1)；
(7e) congested node is by all neighbor nodes by packet input rate λiArrange from small to large, be examined in all neighbours' sections
Point, until finding a packet input rate λ for neighbor nodeiMore than or equal to the input rate f that should be unloaded, and the neighbours are saved
Point is designated as forking node；
(7f) congested node records forking node, and sends congestion information to forking node, after forking node receives congestion information,
Search some available routes for bypassing congested node and replace the original route by congested node；
(7g) congested node waits next congestion cycle T, and this node is sent to each neighbor node n in counting the cyclei's
Number of data packetsWith this node from each neighbor node niThe number of data packets of reception
(7h) judges whether congestion according to the length of congested node buffer queue, if so, then performing step (7i), otherwise, performs
Step (7j)；
(7i) congested node open queue random loss mechanism, performs step (7k)；
(7j) judges the packet input rate λ of the congested node and input rate λ of forking nodeiWhether sum is less than or equal to congestion
The output speed μ of node, if so, then performing step (7k), otherwise, return to step (7g)；
The forking node of (7k) congested node deletion record, and send revocation congestion information, return to step (1) to it.
5. the method according to claims 4, wherein forking node searches some and bypasses congested node in step (7f)
The original route by congested node can be replaced with route, carried out as follows：
(7f1) makes initial parameter i=1, M route project bar number in being equal to forking node routing table；
(7f2) forking node checks i-th route entry purpose main road by whether the next-hop node for judging the route is congestion section
Point, and judge whether destination node is not the congested node, if both meeting, step (7f3) is performed, otherwise, perform step
Suddenly (7f11)；
(7f3) forking node records congested node in i-th route project, and the route project is not used and contains congested node
Route be updated；
(7f4) judges that i-th route entry purpose time route whether there is, if so, then performing step (7f5), otherwise, performs step
(7f6)；
(7f5) forking node i-th route entry purpose time route covering main road is by performing step (7f11)；
Main road is designated as access node by (7f6) forking node by the 3rd upper hop node；
(7f7) forking node judges whether the effective routing of access node, i.e., without the route of congested node, if
It is then to perform step (7f8), otherwise, performs step (7f9)；
(7f8) forking node main road by with step (7f8) or step (7f9) in effective routing be spliced into new main road by,
And i-th route entry purpose main road is covered by performing step (7f11)；
(7f9) forking node judges whether that an effective road to access node can be found by On-demand routing lookup method
By if so, then performing step (7f8), otherwise, performing step (7f10)；
(7f10) forking node empties i-th route project, when having packet to check the route entry next time, directly abandons number
According to packet；
Whether (7f11) judges initial parameter i more than or equal to project bar number M is route in forking node routing table, if so, then performing
Step (7f12), otherwise, makes i=i+1, and perform step (7f2)；
(7f12) forking node is to the route project in neighbor node forwarding step (7f8).
6. the method according to claims 5, forking node passes through On-demand routing lookup method wherein in step (7f9)
An effective routing to access node is found, is carried out as follows：
(7f9a) forking node broadcasts a route requests packet RREQ, and content includes destination node, source node, middle node point range
Table and route requests packet ID number, wherein destination node are access node, and source node is forking node, and initialize a route
Timer RT is searched, step (7f9b) is performed；
(7f9b) source node judges whether to receive route replies packet RREP, if so, then found an effective routing, i.e., in
Segmentum intercalaris point list, otherwise, performs step (7f9c)；
After (7f9c) source node is waited one second, route querying timer RT numerical value is subtracted one, and judge route querying timer RT
Whether zero is less than, if so, an effective routing cannot be then found, otherwise, return to step (7f9b)；
(7f9d) intermediate node receives route requests packet RREQ, judges whether this node receives according to route requests packet ID number
Route requests packet RREQ is crossed, if so, then directly abandoning packet, otherwise, step (7f9e) is performed；
(7f9e) intermediate node judges whether the intermediate node table in route requests packet RREQ includes this node, if so, then straight
Discarding packet is connect, otherwise, step (7f9f) is performed；
(7f9f) intermediate node judge the destination node of route requests packet RREQ whether be this node or this node whether have to
The route of destination node, if so, then performing step (7f9h), otherwise, performs step (7f9g)；
This node is inserted route requests and is grouped the intermediate node list of RREQ by (7f9g) intermediate node, and forwards the route requests
Packet RREQ；
(7f9h) intermediate node construction route replies packet RREP, and invert the intermediate node list in route requests packet RREQ
The path of source node is returned to as route replies packet RREP.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710049057.4A CN106851727B (en) | 2017-01-23 | 2017-01-23 | Method for realizing self-organizing network congestion control based on multi-path routing protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710049057.4A CN106851727B (en) | 2017-01-23 | 2017-01-23 | Method for realizing self-organizing network congestion control based on multi-path routing protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106851727A true CN106851727A (en) | 2017-06-13 |
| CN106851727B CN106851727B (en) | 2020-01-31 |
Family
ID=59119729
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710049057.4A Active CN106851727B (en) | 2017-01-23 | 2017-01-23 | Method for realizing self-organizing network congestion control based on multi-path routing protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106851727B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019062589A1 (en) * | 2017-09-30 | 2019-04-04 | 华为技术有限公司 | Flow control method and apparatus |
| CN109962760A (en) * | 2019-04-09 | 2019-07-02 | 湖南智领通信科技有限公司 | A kind of business scheduling method suitable for wireless TDMA ad hoc network |
| CN109995658A (en) * | 2017-12-29 | 2019-07-09 | 华为技术有限公司 | The method and apparatus for sending, receiving and E-Packeting |
| CN110139319A (en) * | 2019-05-25 | 2019-08-16 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | High dynamic time-delay network propagation delay time minimizes method for routing |
| CN110996350A (en) * | 2019-12-18 | 2020-04-10 | 北京京能清洁能源电力股份有限公司北京分公司 | Ad hoc network routing method and device, and electronic equipment |
| CN111148154A (en) * | 2019-12-18 | 2020-05-12 | 江苏理工学院 | Recursive feedback type flow congestion suppression method facing routing equipment |
| WO2021139286A1 (en) * | 2020-01-07 | 2021-07-15 | 华为技术有限公司 | Load sharing method, device, and network system |
| WO2022174444A1 (en) * | 2021-02-22 | 2022-08-25 | 华为技术有限公司 | Data stream transmission method and apparatus, and network device |
| CN115002036A (en) * | 2022-05-26 | 2022-09-02 | 国网河北省电力有限公司电力科学研究院 | NDN network congestion control method, electronic device and storage medium |
| WO2023103847A1 (en) * | 2021-12-09 | 2023-06-15 | 华为技术有限公司 | Communication method, apparatus and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
| CN101459933A (en) * | 2009-01-04 | 2009-06-17 | 北京航空航天大学 | Congestion control method |
| CN101674630A (en) * | 2009-09-25 | 2010-03-17 | 南京邮电大学 | Implementation method of cross-layer routing capable of perceiving congestion |
| US20110211472A1 (en) * | 2007-08-30 | 2011-09-01 | Bae Systems Information And Electronic Systems Integration Inc. | Topology aware manet for mobile networks |
| EP2706781A1 (en) * | 2012-09-05 | 2014-03-12 | Thales | Transmission method in a multi-hop ad hoc IP network |
| CN106304184A (en) * | 2016-08-17 | 2017-01-04 | 上海交通大学 | The route discovery of many tolerance amount based on AODV and the method for foundation |
-
2017
- 2017-01-23 CN CN201710049057.4A patent/CN106851727B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110211472A1 (en) * | 2007-08-30 | 2011-09-01 | Bae Systems Information And Electronic Systems Integration Inc. | Topology aware manet for mobile networks |
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
| CN101459933A (en) * | 2009-01-04 | 2009-06-17 | 北京航空航天大学 | Congestion control method |
| CN101674630A (en) * | 2009-09-25 | 2010-03-17 | 南京邮电大学 | Implementation method of cross-layer routing capable of perceiving congestion |
| EP2706781A1 (en) * | 2012-09-05 | 2014-03-12 | Thales | Transmission method in a multi-hop ad hoc IP network |
| CN106304184A (en) * | 2016-08-17 | 2017-01-04 | 上海交通大学 | The route discovery of many tolerance amount based on AODV and the method for foundation |
Non-Patent Citations (2)
| Title |
|---|
| BANDANA BHATIA: "Performance Analysis of AODV Based Congestion Control Protocols in MANET", 《2015 INTERNATIONAL CONFERENCE ON FUTURISTIC TRENDS ON COMPUTATIONAL ANALYSIS AND KNOWLEDGE MANAGEMENT (ABLAZE)》 * |
| 李陶深等: "跨层负载感知的无线Mesh网络拥塞控制", 《北京邮电大学学报》 * |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019062589A1 (en) * | 2017-09-30 | 2019-04-04 | 华为技术有限公司 | Flow control method and apparatus |
| US11323916B2 (en) | 2017-09-30 | 2022-05-03 | Huawei Technologies Co., Ltd. | Flow control method and apparatus |
| CN109995658B (en) * | 2017-12-29 | 2021-07-20 | 华为技术有限公司 | Method and device for sending, receiving and forwarding message |
| CN109995658A (en) * | 2017-12-29 | 2019-07-09 | 华为技术有限公司 | The method and apparatus for sending, receiving and E-Packeting |
| CN109962760B (en) * | 2019-04-09 | 2022-08-30 | 湖南智领通信科技有限公司 | Service scheduling method suitable for wireless TDMA ad hoc network |
| CN109962760A (en) * | 2019-04-09 | 2019-07-02 | 湖南智领通信科技有限公司 | A kind of business scheduling method suitable for wireless TDMA ad hoc network |
| CN110139319B (en) * | 2019-05-25 | 2022-04-01 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Routing method for minimizing transmission delay of high dynamic delay network |
| CN110139319A (en) * | 2019-05-25 | 2019-08-16 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | High dynamic time-delay network propagation delay time minimizes method for routing |
| CN111148154B (en) * | 2019-12-18 | 2023-10-20 | 江苏理工学院 | Recursive feedback type flow congestion suppression method for routing equipment |
| CN110996350B (en) * | 2019-12-18 | 2020-12-11 | 北京京能清洁能源电力股份有限公司北京分公司 | Ad hoc network routing method and device, and electronic equipment |
| CN110996350A (en) * | 2019-12-18 | 2020-04-10 | 北京京能清洁能源电力股份有限公司北京分公司 | Ad hoc network routing method and device, and electronic equipment |
| CN111148154A (en) * | 2019-12-18 | 2020-05-12 | 江苏理工学院 | Recursive feedback type flow congestion suppression method facing routing equipment |
| WO2021139286A1 (en) * | 2020-01-07 | 2021-07-15 | 华为技术有限公司 | Load sharing method, device, and network system |
| US11824781B2 (en) | 2020-01-07 | 2023-11-21 | Huawei Technologies Co., Ltd. | Method, device, and network system for load balancing |
| WO2022174444A1 (en) * | 2021-02-22 | 2022-08-25 | 华为技术有限公司 | Data stream transmission method and apparatus, and network device |
| WO2023103847A1 (en) * | 2021-12-09 | 2023-06-15 | 华为技术有限公司 | Communication method, apparatus and system |
| CN115002036B (en) * | 2022-05-26 | 2023-07-25 | 国网河北省电力有限公司电力科学研究院 | NDN network congestion control method, electronic equipment and storage medium |
| CN115002036A (en) * | 2022-05-26 | 2022-09-02 | 国网河北省电力有限公司电力科学研究院 | NDN network congestion control method, electronic device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106851727B (en) | 2020-01-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106851727A (en) | The method that MANET congestion control is realized based on multipath routing protocols | |
| Raju et al. | A comparison of on-demand and table driven routing for ad-hoc wireless networks | |
| Chen et al. | Congestion-aware routing protocol for mobile ad hoc networks | |
| Rea et al. | Multi-metric routing decisions for ad hoc networks using fuzzy logic | |
| Chaba et al. | Simulation based performance analysis of on-demand routing protocols in MANETs | |
| Uddin et al. | Improving performance of mobile ad hoc networks using efficient tactical on demand distance vector (TAODV) routing algorithm | |
| CN110191053B (en) | Wireless ad hoc network multipath routing method based on cognitive learning | |
| Li et al. | New approach to multihop-cellular based multihop network | |
| Hassan et al. | Design of an energy‐efficient and reliable data delivery mechanism for mobile ad hoc networks: a cross‐layer approach | |
| Zhang et al. | Adapting zone routing protocol for heterogeneous scenarios in ad hoc networks | |
| Sheeja et al. | Cross layer based congestion control scheme for mobile ad hoc networks | |
| Li | Multipath routing and QoS provisioning in mobile ad hoc networks | |
| Chao et al. | Interference aware routing for mobile ad hoc networks based on node's sending and receiving capabilities | |
| Yawut et al. | Mobility versus density metric for OLSR enhancement | |
| Kalita et al. | Efficient Schemes for Improved Performance in 6TiSCH Networks | |
| Wang et al. | Label Routing Protocol: A New Cross‐Layer Protocol for Multi‐Hop Ad Hoc Wireless Networks | |
| Chen et al. | A load-based queue scheduling algorithm for MANET | |
| Kalakar et al. | Performance Analysis of Black Hole Attack in MANET using OPNET | |
| He et al. | Tcp performance with active dynamic source routing for ad hoc networks | |
| Golański et al. | RBCP-WSN: The Reliable Biderectional Control Protocol for Wireless Sensor Networks | |
| Wu et al. | A study of congestion-aware routing protocols for wireless ad hoc networks | |
| Frantti | Fuzzy packet size optimization for delay sensitive traffic in ad hoc networks | |
| Hemanth | A Joint Congestion Control Mechanism Through Dynamic Alternate Route Selection Algorithm in IoT Based Wireless Sensor Network | |
| Li et al. | Node-disjoint multipath routing and distributed cross-layer QoS guarantees in mobile ad hoc networks | |
| Khalaf et al. | New velocity aware probabilistic route discovery schemes for mobile ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |