CN102006225B - Network congestion processing method and device - Google Patents
Network congestion processing method and device Download PDFInfo
- Publication number
- CN102006225B CN102006225B CN2010105522584A CN201010552258A CN102006225B CN 102006225 B CN102006225 B CN 102006225B CN 2010105522584 A CN2010105522584 A CN 2010105522584A CN 201010552258 A CN201010552258 A CN 201010552258A CN 102006225 B CN102006225 B CN 102006225B
- Authority
- CN
- China
- Prior art keywords
- routing node
- congestion state
- congested
- node
- data flow
- 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.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a network congestion processing method and a network congestion processing device, and relates to the technical field of communication. The network congestion processing method and the network congestion processing device can process the congestion due to limited throughput capacity of a downstream routing node and overlarge traffic of data transmitted by an upstream routing node. The network congestion processing method comprises the following steps of: judging the congestion state of a routing node which sends a congestion state command; when the routing node is in the congestion state, issuing a help information command in a broadcast mode, acquiring a target routing node from a reply routing node and establishing an auxiliary link with the target routing node; and forwarding data stream to the auxiliary link.
Description
Technical field
The present invention relates to communication technical field, relate in particular to network congestion processing method and device.
Background technology
Wireless sensor network (Wireless Sensor Network, WSN) combine sensor technology, embedded computing technique, distributed information processing and wireless communication technology, compare with the conventional information network technology, have the monitoring accuracy height, robustness is good, the overlay area is large and the advantage such as intelligent, has been widely used in a plurality of fields.
Because wireless sensor network has extensive intensive deployment, many-one communication mode, poor, the network topology structure dynamic change of radio link quality, reach accident and easily cause the characteristics such as bursts of traffic, so part or the congested situation of Zone Full appear in wireless sensor network easily.Congested meeting causes the increase of communication delay and losing of data, even cause Sink (converging) node not receive any information, and then affect QoS (the Quality of Service of wireless sensor network, service quality) performance and life cycle, so congestion control has become the key technology of wireless sensor network QoS security mechanism.
In the prior art, by CODA (Congestion Detection and Avoidance in Sensor Networks, congestion detection and avoiding method), the perhaps problem of the solution network congestion of ARC (Adaptive Resource Control, adaptive resource controlling mechanism).
Congestion detection, open loop hop-by-hop back-pressure and closed loop multi-source that the technical scheme of CODA algorithm combines based on channel sample are regulated three kinds of mechanism, are applicable to data source to the congestion control of Sink node transmission.The transducer routing node is sample channel when the buffer area non-NULL, detects the congested backpressure messages of just broadcasting, and backpressure messages is propagated along the direction of leading to data source.The routing node that receives backpressure messages according to local congestion strategy such as grouping abandon, AIMD (Additive Increase Multiplicative Decrease, increase with formula, long-pending formula reduces) etc., suppress its transmission rate or abandon grouping, and determine whether to continue upstream routing node propagation based on the local network situation.If can't solving for a long time, network congestion then enters closed-loop adjustment mechanism to reduce the packet rates of data source.
Although the CODA algorithm has solved the network congestion problem to a certain extent, but in some application scenarios, in the alert detecting work such as major event, reliability and required precision to transmitted data on network are higher, do not allow data reduction of speed or packet loss in transmission course, so the method is inapplicable.
The technical scheme of ARC algorithm, after certain routing node detected congested generation in the network, the 1st the non-congested routing node in areas of congestion downstream started new route and oppositely sets up process.It chooses the few neighbours' routing node of original route jumping figure as the down hop routing node of new route, and follow-up routing node also can be adopted and determine in the same way its down hop.Like this, adopt the mode of depth-first search finally to form new route, this path can certain upstream routing node and original route outside areas of congestion be converged.After this data flow will be transmitted at new route along the rightabout of setting up process, thereby get around areas of congestion.Behind the relieve congestion, initiate routing node and send close message along new route, make data flow according to original optimal path transmission.
Adopt the technical scheme of ARC algorithm, will safeguard a neighbor information table in order to set up each routing node of backup path.After data source was built up to the path of Sink node, each routing node on the path will send the notice message that comprises this path ID, and with the information in the real-time update neighbor information table, its storage and communication overhead are large, and start-up time is long.During the transmission of data, this algorithm is just distributed to each paths fifty-fifty with data flow, and minute stream mechanism that adopts is too simple.The most key: if congested be because the downstream routing node causes that the method is invalid.Be that the method can only solve congested that the upstream causes.
Summary of the invention
Embodiments of the invention provide a kind of network congestion processing method and device, can either alleviate congested that the downstream routing node causes, also can alleviate excessive cause congested of data traffic of upstream routing node transmission.
For achieving the above object, embodiments of the invention adopt following technical scheme:
A kind of network congestion processing method comprises:
The congestion state order that the reception congestion routing node sends parses the congestion state type identifier from described congestion state order;
Judge that described congestion state type identifier represents congestion state and still represents the relieve congestion state;
When described congestion state type identifier represents congestion state, with the form issue help information order of broadcasting;
The response message that the routing node of help information order is replied is received in reception, obtains the target routing node from the routing node of replying response message;
Set up secondary link with described target routing node;
At least part of forwarding data flow that will send to congested routing node is to secondary link.
A kind of network congestion processing unit comprises:
Resolution unit is used for the congestion state order that the reception congestion routing node sends, and parses the congestion state type identifier from described congestion state order;
Judging unit is used for judging that described congestion state type identifier represents congestion state and still represents the relieve congestion state;
Release unit is used for when described congestion state type identifier represents congestion state, with the form issue help information order of broadcasting;
Acquiring unit for the response message that the routing node of receiving the help information order is replied, obtains the target routing node from the routing node of replying response message;
Link unit is used for setting up secondary link with the target routing node that obtains;
The first retransmission unit, at least part of forwarding data flow that is used for sending to congested routing node is to secondary link.
Because network congestion processing method and the device of the embodiment of the invention, to set up auxiliary the connection in the upstream that congested routing node occurs, walk around congested routing node occurs, therefore, can either alleviate by the downstream routing node cause congested, also can alleviate because excessive cause congested of data traffic of upstream routing node transmission.
Description of drawings
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention, the accompanying drawing of required use was done to introduce simply during the below will describe embodiment, apparently, accompanying drawing in the following describes only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the flow chart of a kind of network congestion processing method in the embodiment of the invention;
Fig. 2 is the flow chart of another kind of network congestion processing method in the embodiment of the invention;
Fig. 3 is the schematic diagram that routing node sends the congestion state command frame in the embodiment of the invention;
Fig. 4 is the schematic diagram of routing node issue help information order in the embodiment of the invention;
Fig. 5 receives in the embodiment of the invention that the routing node of help information command frame is to the flow chart of the corresponding routing node answer response message that sends the help information command frame;
Fig. 6 is the routing node of transmission help information command frame in the embodiment of the invention obtains the target routing node from the routing node of replying response message flow chart;
Fig. 7 is that the routing node of seeking help in the embodiment of the invention will be transmitted to one by one to the data flow that congested routing node sends the flow chart of secondary link;
Fig. 8 is that the routing node of seeking help in the embodiment of the invention will be transmitted to the flow chart of having removed congested routing node one by one to the data flow that secondary link sends;
Fig. 9 is the structure chart of a kind of network congestion processing unit in the embodiment of the invention;
Figure 10 is the structure chart of another kind of network congestion processing unit in the embodiment of the invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
The embodiment of the invention provides a kind of network congestion processing method, as shown in Figure 1, comprising:
101, seek help routing node after receiving the congestion state order, from the congestion state order, parse the congestion state type identifier.The congestion state type identifier is used for identifying the congestion situation of routing node, and is concrete, comprises that routing node is in congestion state and routing node is removed two kinds of situations of congestion state.
102, the routing node of seeking help judges that described congestion state type identifier represents congestion state and still represents the relieve congestion state.When described congestion state type identifier represents congestion state, execution in step 103.When described congestion state type identifier represents the relieve congestion state, execution in step 107.
103, the form issue help information order of routing node with broadcasting of seeking help.
Certain routing node in network occurs when congested, congested routing node then occurs and can send the congestion state command frame to the routing node of seeking help of its all upper hops, send the congestion state command frame such as the mode of congested routing node with multicast occurring, inform its congestion situation of routing node of the upper hop of all these routing nodes, the routing node of receiving the congestion state command frame just can be learnt the congestion situation of the routing node that this generation is congested, start congested treatment mechanism, and issue the help information order with the form of broadcasting to the routing node around it.
104, seek help routing node after receiving response message, select and obtain the target routing node the routing node from replying replying of response message.
Around the routing node of seeking help, receive the routing node of help information order, can reply response message to the routing node that sends the help information order, can reply response message to the routing node that sends the help information order in the mode of clean culture such as the routing node of receiving the help information order.The target routing node is selected and obtained to the routing node that sends the help information order as required from the routing node of replying response message.
105, seek help routing node and described target routing node set up secondary link.
The routing node that is positioned at the upstream that congested routing node occurs can be set up secondary link with the target routing node.Secondary link is used for a minute flow direction data flow that congested routing node sends occurs.
106, seek help forwarding data flow that routing node will send to congested routing node to secondary link.
After the routing node that is positioned at the upstream that congested routing node occurs and target routing node are set up secondary link, be positioned at the routing node of the upstream that congested routing node occurs will be originally to the forwarding data flow that congested routing node transmission occurs to target routing node corresponding to secondary link.
107, seek help forwarding data flow that routing node will send to secondary link to corresponding congested routing node.
The network congestion processing method that present embodiment provides, certain routing node in network occurs when congested, the routing node that receives the congestion state order can send the help information order to other routing node, and obtains the target routing node from the routing node of replying response message.The routing node that receives the congestion state order can be set up secondary link with the target routing node that gets access to, and will be originally to forwarding data flow that congested routing node sends occuring to secondary link, data flow is got around occur congested routing node, congested secondary link does not occur pass through from newly-established.
Because the network congestion processing method of present embodiment, to set up auxiliary the connection in the upstream that congested routing node occurs, walk around congested routing node occurs, therefore, can either solve by limited cause congested of downstream routing node handling capacity, also can solve because excessive cause congested of data traffic of upstream routing node transmission.Characteristics below in conjunction with a kind of WSN network are carried out brief description to the effect of present embodiment, because there is large quantity sensor in the WSN network, the routing node of each transducer can forwarding data, be with the difference of cellular communication, may there be a lot of upstream nodes to its forwarding data in the routing node of WSN, thereby so that current routing node exists congested possibility appears, and the downstream node of present node may be more congested, if adopt existing congestion processing method, be that each node is from self beginning to solve congestion problems, owing to exist other node to send to downstream node, can only limited alleviation downstream node congested.If each transducer routing node is congested rear from self beginning to process congestion problems at downstream node, can more effective alleviate congestion problem.Particularly, node has the ability of the congestion state order of transmission, can be with node around the congestion notification after appearance is congested, and particularly notice is sending the upstream node of data to congested node, so that begin to process from upstream node, better solve congestion problems from the source.And the form that upstream node can be broadcasted is issued the help information order, so that a lot of peripheral transducers all can be received message, and join and solve congestion problems, thereby asking for help in the scope widely, be conducive to solution of problem, consider that WSN is larger in some scene lower sensor density, occur congested may be larger, adopt in the case method shown in the present embodiment can reach very good effect to alleviate congestion.
The embodiment of the invention provides another kind of network congestion processing method, as shown in Figure 1, comprising:
201, after the congested routing node of generation sends the congestion state order, the routing node reception congestion status command of seeking help.
Certain routing node in network occurs when congested, congested routing node then occurs and can send the congestion state command frame to the routing node of its all upper hops, send the congestion state command frame such as the mode of congested routing node with multicast occurring, inform its congestion situation of routing node of the upper hop of all these routing nodes.
As shown in Figure 3, when the A routing node among the figure when congested routing node occurring, then the A routing node just sends the congestion state order in the mode of multicast, informs the B routing node of its upstream and the congestion situation of C routing node A routing node.
202, seek help routing node after receiving the congestion state order, from the congestion state order, parse the congestion state type identifier.The congestion state type identifier is used for identifying the congestion situation of routing node, and is concrete, comprises that routing node is in congestion state and routing node is removed two kinds of situations of congestion state.
203, the routing node of seeking help judges that described congestion state type identifier represents congestion state and still represents the relieve congestion state.When described congestion state type identifier represents congestion state, execution in step 204.When described congestion state type identifier represents the relieve congestion state, execution in step 2011.
204 after receiving the congestion state order, receives the routing node of congestion state order, and the routing node of namely seeking help is with the form issue help information order of broadcasting.
After receiving the congestion state order, the routing node of receiving the congestion state command frame just can be learnt the congestion situation of the routing node that this generation is congested, so start congested treatment mechanism, and can issue the help information order to the routing node around it with the form of broadcasting.
As shown in Figure 4, when the A routing node among the figure is when congested routing node occurring, this moment, B routing node and C routing node received that the congested processing that the A routing node sends starts life, and then B routing node and C routing node are just with the routing node issue help information order around the peripherad D routing node of form of broadcasting, E routing node, F routing node, G routing node, H routing node, I routing node, the J routing node etc.
205, after the routing node of receiving the help information order is replied response message, send the routing node of help information order, the routing node of namely seeking help receives this response message.
Receive the routing node of help information command frame, can reply response message to the corresponding routing node that sends the help information command frame, can reply response message to the corresponding routing node that sends the help information command frame in the mode of clean culture such as the routing node of receiving the help information command frame.
The corresponding routing node that sends the help information command frame receives this response message.
As an embodiment of the present embodiment, receive in this step that the routing node of help information command frame is replied response message to the corresponding routing node that sends the help information command frame, as shown in Figure 5, can comprise following steps:
Judge whether himself is less than or equal to the corresponding minimum hop count of routing node to aggregation node of seeking help to the minimum hop count of aggregation node 501. receive the routing node of help information order.Aggregation node is the destination node of receive data.
When the routing node of receiving the help information order self to the minimum hop count of aggregation node is less than or equal to the corresponding routing node of seeking help to the minimum hop count of aggregation node, execution in step 502, otherwise flow process finishes.
This step is only selected self to be less than or equal to the corresponding routing node of seeking help to the routing node of the minimum hop count of aggregation node to the minimum hop count of aggregation node, makes the target routing node that gets access to set up a secondary link with the routing node that sends the help information command frame.
502. it is congested to receive that the routing node of help information order judges whether himself occurs.
Judge when the routing node of receiving the help information order execution in step 503 when congested does not occur himself, otherwise flow process finishes.
Ignored in this step and self congested routing node has occured, selected that congested routing node does not occur and set up secondary link, guaranteed that the performance of secondary link is better.
503, the routing node of receiving the help information order is replied response message to the corresponding routing node that sends the help information command frame.Comprise this node in the response message to the information such as jumping figure, residual energy value and queue length value of Sink node.
In this step, send the routing node of help information command frame when setting up secondary link, the each side factor of neighbours' routing node comprises the factors such as congestion condition, the jumping figure apart from convergent point, queue length and dump energy around having taken into full account.Can get access to the more excellent routing node that meets application demand by the fitness that calculates each routing node.
Selected split point self and down hop routing node are without congested and do not set up secondary path, and be nearer apart from Sink, and cushion space is large, and dump energy is many, and the secondary path performance that makes up thus is better, and robustness is higher.
206, after receiving response message, the routing node of seeking help obtains the target routing node from the routing node of replying response message.
Be positioned at the routing node of the upstream that congested routing node occurs, namely send the routing node of help information command frame, from the routing node of replying response message, obtain the target routing node.
As an embodiment of the present embodiment, can comprise the routing node that sends described response message in the response message to the jumping figure value information of aggregation node, with dump energy value information, the queue length value information of the routing node that sends described response message, the routing node that sends the help information command frame in this step obtains the target routing node and can comprise step from the routing node of replying response message:
601, send the routing node of help information command frame, the routing node of namely seeking help obtains the routing node of jumping figure value minimum from the routing node of replying response message.
602, the routing node of seeking help judges that whether the quantity of routing node of jumping figure value minimum is greater than 1.When the quantity of the routing node of jumping figure value minimum greater than 1 the time, execution in step 603.Otherwise, when the quantity of the routing node of jumping figure value minimum is not more than 1, execution in step 604.
603, the routing node that sends the help information command frame obtains the highest routing node of fitness from the routing node of jumping figure value minimum, as the target routing node.Be specifically as follows:
According to formula
Calculate the fitness of the routing node of jumping figure value minimum, wherein, α
1, α
2∈ [0,1], fitness represent the fitness of the routing node of jumping figure value minimum, E
rBe the residual energy value of the routing node of jumping figure value minimum, L
qBe the queue length value of the routing node of jumping figure value minimum, α
1, α
2Be default weight coefficient.Calculate by above-mentioned fitness, be conducive to finally choose suitable shunting node as the target routing node.
The fitness of the routing node of all jumping figure value minimums is compared, from the routing node of jumping figure value minimum, obtain the highest routing node of fitness, as the target routing node.
604, with the routing node of jumping figure value minimum as the target routing node in the step 207.Execution in step 207.
In this step, the corresponding routing node that sends the help information command frame is issued the help information order with the form of broadcasting again, do not meet the routing node of replying condition in the step 203 before, can reply response message to the routing node that sends the help information command frame.Such as, for because energy shortage, and not after the help information command frame issue first time, reply the routing node of response message to the routing node of issue help information command frame, after the help information command frame issue second time, can reply response message to the routing node of issue help information command frame.
207, after getting access to the target routing node, send the corresponding routing node of help information command frame, the routing node of namely seeking help is set up secondary link with described target routing node.
The routing node and the target routing node that are positioned at the upstream that congested routing node occurs are set up secondary link.Secondary link is used for a minute flow direction data flow that congested routing node sends occurs.
In this step, the target routing node that gets access to can be one, also can be more than two or two.
Wherein, the corresponding routing node and the target routing node that send the help information command frame are set up secondary link, can be following three kinds of modes:
1. corresponding routing node and a target routing node of sending the help information command frame are set up secondary link.
2. corresponding routing node and two target routing nodes of sending the help information command frame are set up secondary link.
3. corresponding routing node and three above target routing nodes of sending the help information command frame are set up secondary link.But set up the few saving resource of secondary link, setting up that secondary link is many can faster alleviate congestion, and how to accept or reject is a comprehensive process of weighing, and can freely be determined according to demand when manufacturing a product by those skilled in the art.
208, seek help forwarding data flow that routing node will send to congested routing node to secondary link.
After the routing node that is positioned at the upstream that congested routing node occurs and target routing node are set up secondary link, be positioned at the routing node of the upstream that congested routing node occurs, namely send the routing node of help information command frame, with originally to forwarding data flow that congested routing node sends occuring to target routing node corresponding to secondary link.
As a kind of execution mode of this step, send the routing node of help information command frame, will originally can comprise following dual mode to the forwarding data flow that congested routing node transmission occurs to target routing node corresponding to secondary link:
1. send the routing node of help information command frame, with disposable target routing node corresponding to secondary link that be transmitted to of data flow that originally sends to the congested routing node of generation.
2. send the routing node of help information command frame, will originally be transmitted to gradually in batches target routing node corresponding to secondary link to the data flow that congested routing node transmission occurs.
As an embodiment of the present embodiment, as shown in Figure 7, send the routing node of help information command frame, specifically can may further comprise the steps originally being transmitted to gradually in batches target routing node corresponding to secondary link to the data flow that congested routing node transmission occurs:
701, the congestion state order that routing node waits for that the reception congestion routing node sends of seeking help.
702, the routing node of seeking help will send to secondary link according to preset ratio 1-m to the data flow that congested routing node sends.The m value greater than 0 less than 1.Suppose m=1/2 herein, the data that can be with the ratio in the data of congested routing node of originally being sent to m=1/2 send to secondary link, that is: the routing node of seeking help is every through shunting once to the data that congested node sends, and the data that congested node receives all can be reduced to half before this shunting.。
703, the routing node of seeking help judges whether to receive the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time;
When the routing node that sends the help information command frame, when the routing node of namely seeking help is not received the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time, execution in step 704.
When the routing node of seeking help is received the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time, execution in step 209, the forwarding data flow that the routing node of seeking help will send to secondary link is to congested routing node.
704, the seek help ratio of the data flow that routing node will send to secondary link is updated to 1-m
N+1, the data flow that the routing node of seeking help will send to congested routing node is according to preset ratio 1-m
N+1Send to secondary link.Wherein, n is the number of times that the forwarding ratio of the data flow that will send to secondary link is upgraded.And execution in step 703.For example, when m is 1/2, then seek help routing node to the every process shunting of the data of congested node transmission once, the data that congested node receives all can double, this secondary link data that gradually reduce increase the possibility that the method that is sent to congested routing node data has effectively been alleviated " secondary is congested ".
In this step, routing node is not disposable all data flow all to be transferred to secondary path, but the mode streamed data by shifting gradually, realized more steadily, increased data flow to split point more quickly, this can effectively be avoided split point factor data amount excessive and congested situation occurs to a certain extent.
209, seek help forwarding data flow that routing node will send to secondary link to congested routing node.
After receiving the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state, because congestion condition is removed, the congested routing node of former generation is transmitting data flow normally, so, send the routing node of help information command frame, the forwarding data flow that will send to secondary link is to congested routing node, and the data before namely recovering transmit.
Send the routing node of help information command frame, will can comprise following dual mode to congested routing node to the forwarding data flow that secondary link sends:
1. send the routing node of help information command frame, the data flow that will send to secondary link is once capable to be transmitted to congested routing node.
2. send the routing node of help information command frame, the data flow that will send to secondary link in batches be transmitted to gradually congested routing node.
As an embodiment of the present embodiment, as shown in Figure 8, send the routing node of help information command frame, the data flow that will send to secondary link in batches be transmitted to gradually congested routing node, can may further comprise the steps:
801, seek help data flow that routing node will send to secondary link according to preset ratio m
N+1Send to congested routing node.
802, the routing node of seeking help judges whether the data flow that sends to secondary link is zero.
When the data flow that sends to secondary link is non-vanishing, execution in step 803.
When the data flow that sends to secondary link was zero, flow process finished.
803, the seek help ratio of the data flow that routing node will send to congested routing node is updated to m
N+1-y, wherein, y is the number of times that the ratio of the data flow that will send to congested routing node is upgraded.And execution in step 802.
Behind relieve congestion, the mode streamed data of the flow of secondary path by shifting gradually, the flow process that at every turn is transferred back to congested routing node all can increase, and can prevent congested routing node owing to recovering to cause too soon the situation of " secondary is congested ".The acute variation that this mechanism has avoided offered load to distribute can reduce the congested number of times of routing node.This moment, every transfer was shunted once, and the data volume of transmitting on the secondary path all can be reduced to half before shunting, until secondary path is not used further to shunt.
The network congestion processing method that present embodiment provides, certain routing node in network occurs when congested, the routing node that receives the congestion state order can send the help information order to other routing node, and obtains the target routing node from the routing node of replying response message.The routing node that receives the congestion state order can be set up secondary link with the target routing node that gets access to, and will be originally to forwarding data flow that congested routing node sends occuring to secondary link, transferring data stream, data flow is got around occur congested routing node, congested secondary link does not occur pass through from newly-established.
Because the network congestion processing method of present embodiment, to set up auxiliary the connection in the upstream that congested routing node occurs, walk around congested routing node occurs, therefore, can either solve by limited cause congested of downstream routing node handling capacity, also can solve because excessive cause congested of data traffic of upstream routing node transmission.Adopt this scheme, can in the WSN network, play preferably shunting effect, this is because WSN network sensor density may be larger, each node exists data to send, if this moment disposable minute all data of flow forwarding, may not necessarily reach ideal effect, also may cause target routing node congested for shunting.Because whole WSN network is mesh network, coordinate to each other various information and can waste resource, particularly WSN is often very responsive to node power consumption, often be disseminated at random natural environment such as the large quantity sensor for detection of environment, can't in time charge, if for the congestion problems that solves a node causes the congested of other node, the congestion problems of may repeatedly resolving through consultation between the different nodes in the network may expend a large amount of electric energy.And the Sink node might receive the data that great deal of nodes is transmitted in the WSN network, so bear forwarding from more upstream nodes the closer to the routing node of Sink node, also just may be busier, that is to say may be more outstanding the closer to the congestion problems of the routing node of Sink node, when a lot of nodes all need to have data to transmit in the certain limit, if also be inappropriate with the task sharing of transmitting to some or a plurality of nodes just.And the described shunting pass-through mode that upgrades in proportion of employing present embodiment, can after once transmitting, judge whether in Preset Time, whether to accept according to the actual requirements the congested report of trip node feedback, if congested still existence, can continue to increase the data that are forwarded to secondary link, so that the data volume of this congested node with last time congested node the ratio of data volume be m, for example when m is 1/2, be equivalent to whenever once congested by the downstream node report, then the data that send to downstream node of present node can reduce half, continue like this to reduce one by one data retransmission according to the congestion state order in batches and can alleviate secondary link place node and unnecessarily bear too much data and occur congested.The method of present embodiment well adapts to the WSN applied environment, for on a large scale, for the large density, low-power consumption sensor network, transfer of data between can fine coordination great deal of nodes, also progressively coordinate to share transfer of data by continuous interactive information between a plurality of nodes, can save the resource that comprises the node electric energy simultaneously in alleviate congestion.Certainly, for for other network like the WSN network class, the solution of present embodiment is still applicable, and present embodiment is not done restriction to this.
Corresponding with embodiment of the method, the embodiment of the invention provides a kind of network congestion processing unit, can be used for carrying out said method, as shown in Figure 9, comprising: resolution unit 91, judging unit 92, release unit 93, acquiring unit 94, link unit 95, the first retransmission unit 96.
Wherein, after receiving the congestion state order, resolution unit 91 parses the congestion state type identifier from described congestion state order; Judging unit 92 judges that described congestion state type identifier represents congestion state and still represents the relieve congestion state.
When described congestion state type identifier represented congestion state, release unit 93 was with the form issue help information order of broadcasting.After receiving response message, acquiring unit 94 obtains the target routing node from the routing node of replying response message; Link unit 95 is set up secondary link with the target routing node that obtains; The forwarding data flow that the first retransmission unit 96 will send to congested routing node is to secondary link.
The network congestion processing unit that present embodiment provides, certain routing node in network occurs when congested, release unit can send the help information order to other routing node, and the first acquiring unit obtains the target routing node from the routing node of replying response message.The routing node that receives the congestion state order is set up secondary link by link unit and the target routing node that gets access to, the first retransmission unit will be originally to forwarding data flow that congested routing node sends occuring to secondary link, transferring data stream, data flow is got around occur congested routing node, congested secondary link does not occur pass through from newly-established.
Because the network congestion processing unit of present embodiment, to set up auxiliary the connection in the upstream that congested routing node occurs, walk around congested routing node occurs, therefore, can either solve by limited cause congested of downstream routing node handling capacity, also can solve because excessive cause congested of data traffic of upstream routing node transmission.
The embodiment of the invention provides for another network congestion processing unit shown in Figure 10, comprising: resolution unit 101, judging unit 102, release unit 103, acquiring unit 104, link unit 105, the first retransmission unit 106, the second retransmission unit 107.
Wherein, the first retransmission unit 106 comprises: the first sending module 1061, the first judge module 1062, the first update module 1063.
The second retransmission unit 109 comprises: the second sending module 1091, the second judge module 1092, the second update module 1093.
Acquiring unit 104 comprises: acquisition module 1041, designated module 1042.
Designated module 1042 comprises: judge submodule 10421, obtain submodule 10422, specify submodule 10423.
At first, the congestion state order that resolution unit 101 reception congestion routing nodes send, and after receiving the congestion state order, from described congestion state order, parse the congestion state type identifier; Judging unit 102 judges that described congestion state type identifier represents congestion state and still represents the relieve congestion state.
When described congestion state type identifier represented congestion state, release unit 103 was with the form issue help information order of broadcasting.
Certain routing node in network occurs when congested, congested routing node then occurs and can send the congestion state command frame to the routing node of its all upper hops, send congestion state command frame in the mode of multicast to the routing node of its all upper hops such as congested routing node occurring, inform its congestion situation of routing node of the upper hop of all these routing nodes.
As shown in Figure 3, when the A routing node among the figure is when congested routing node occurring, then the A routing node just sends the congestion state order to a B routing node of jumping and the C routing node mode with multicast that is located thereon, and informs the congestion situation of B routing node and C routing node A routing node.
After receiving the congestion state order, the routing node of receiving the congestion state command frame just can be learnt the congestion situation of the routing node that this generation is congested, so start congested treatment mechanism, and can issue the help information order to the routing node around it with the form of broadcasting.
As shown in Figure 4, when the A routing node among the figure is when congested routing node occurring, this moment, B routing node and C routing node received that the congested processing that the A routing node sends starts life, and then B routing node and C routing node are just with the routing node issue help information order around the peripherad D routing node of form of broadcasting, E routing node, F routing node, G routing node, H routing node, I routing node, the J routing node etc.
Receive the routing node of help information command frame, can reply response message to the corresponding routing node that sends the help information command frame, can reply response message to the corresponding routing node that sends the help information command frame in the mode of clean culture such as the routing node of receiving the help information command frame.
As an embodiment of the present embodiment, receive that the routing node of help information command frame is replied response message to the corresponding routing node that sends the help information command frame, can be following mode:
The routing node of receiving the help information order judges whether himself is less than or equal to the corresponding minimum hop count of routing node to aggregation node of seeking help to the minimum hop count of aggregation node.
This step is only selected self to be less than or equal to the corresponding routing node of seeking help to the routing node of the minimum hop count of aggregation node to the minimum hop count of aggregation node, makes the target routing node that gets access to set up a secondary link with the routing node that sends the help information command frame.
When the routing node of receiving the help information order self to the minimum hop count of aggregation node was less than or equal to the corresponding routing node of seeking help to the minimum hop count of aggregation node, it is congested that the routing node of receiving the help information order judges whether himself occurs.
When the routing node of receiving the help information order self to the minimum hop count of aggregation node is less than or equal to the corresponding minimum hop count of routing node to aggregation node of seeking help, and do not occur when congested, reply response message to the corresponding routing node that sends the help information command frame.
Ignored in the present embodiment and self sent congested routing node, selected not send congested routing node and set up secondary link, guaranteed that the performance of secondary link is better.
In this step, send the routing node of help information command frame when setting up secondary link, the each side factor of neighbours' routing node around having taken into full account comprises congestion condition, apart from the factors such as jumping figure of convergent point.
Selected split point self and down hop routing node are without congested and do not set up secondary path, and be nearer apart from the Sink node, and cushion space is large, and dump energy is many, and the secondary path performance that makes up thus is better, and robustness is higher.
When receiving described response message, acquiring unit 104 is received the response message that the routing node of help information order is replied, and obtains the target routing node from the routing node of replying response message.Be specifically as follows: acquisition module 1041 is according to the jumping figure value information, obtains the routing node of jumping figure value minimum from the routing node of replying response message, designated module 1042 with the routing node of jumping figure value minimum as destination node.Concrete, judge that submodule 10421 judges that whether the quantity of routing node of jumping figure value minimum is greater than 1; When the quantity of the routing node of jumping figure value minimum greater than 1 the time, obtain submodule 10422 and from the routing node of jumping figure value minimum, obtain the highest routing node of fitness, specify submodule 10423 routing node that fitness is the highest as the target routing node.
Obtain submodule 10422 and obtain the highest routing node of fitness from the routing node of jumping figure value minimum, as the target routing node, concrete can comprise: according to formula
The fitness of the routing node of the jumping figure value minimum that calculating gets access to, wherein, α
1, α
2∈ [0,1], fitness represents the fitness of routing node, E
rBe the residual energy value of routing node, L
qBe the queue length value of routing node, α
1, α
2Be default weight coefficient.
Obtain submodule 10422 in from the routing node of jumping figure value minimum, obtaining the highest routing node of fitness, as the target routing node.
Can get access to the more excellent routing node that meets application demand by the fitness that calculates each routing node.
The target routing node that gets access to can be one, also can be more than two or two.
Wherein, link unit 105 is set up secondary link with the target routing node, can be following three kinds of modes:
1. link unit 105 and a target routing node are set up secondary link.
2. link unit 105 and two target routing nodes are set up secondary link.
3. link unit 105 and three above target routing nodes are set up secondary link.
The first retransmission unit 106 will be specially to secondary link to the forwarding data flow that congested routing node sends: the first sending module 1061 will send to secondary link according to preset ratio 1-m to the data flow that congested routing node sends; The first judge module 1062 judges whether receive the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time; The first update module 1063 is not when receiving the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time, the ratio of the data flow that will send to congested routing node is updated to 1-m
N+1, wherein, n is the number of times that the ratio of the described data flow that will send to secondary link is upgraded.
As an embodiment of the present embodiment, the first retransmission unit 108 will can comprise following dual mode to the forwarding data flow that congested routing node transmission occurs to target routing node corresponding to secondary link originally:
1. the first retransmission unit 106 will be originally to disposable target routing node corresponding to secondary link that be transmitted to of data flow that congested routing node transmission occurs.
2. the first retransmission unit 106 will be transmitted to target routing node corresponding to secondary link to the data flow that congested routing node transmission occurs originally in batches gradually.In the present embodiment, routing node is not disposable all data flow all to be transferred to secondary path, but the mode streamed data by shifting gradually, realized more steadily, increased data flow to split point more quickly, this can effectively be avoided split point factor data amount excessive and congested situation occurs to a certain extent.
Judging unit 102 judges that described another congestion state type identifier represents congestion state and still represents the relieve congestion state.
After receiving the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state, at least part of forwarding data flow that the second retransmission unit 107 will send to secondary link is to congested routing node.Be specifically as follows: the second sending module 1071 is used for proportionally m of the data flow that will send to secondary link
N+1Send to congested routing node; The second judge module 1072 judges whether the data flow that sends to secondary link is zero; The second update module 1073 is used for when the data flow that sends to secondary link is non-vanishing, and the ratio of data flow from secondary link to congested routing node that will transmit from is updated to m
N+1-y, wherein, y is the number of times that the ratio of the described data flow of transmitting from secondary link to congested routing node is upgraded.
Behind relieve congestion, the mode streamed data of the flow of secondary path by shifting gradually steadily reduces, and can prevent congested routing node owing to recovering to cause too soon the situation of " secondary is congested ".The acute variation that this mechanism has avoided offered load to distribute can reduce the congested number of times of routing node.
The network congestion processing unit that present embodiment provides, certain routing node in network occurs when congested, the routing node that receives the congestion state order can send the help information order to other routing node, and obtains the target routing node from the routing node of replying response message.The routing node that receives the congestion state order can be set up secondary link with the target routing node that gets access to, and will be originally to forwarding data flow that congested routing node sends occuring to secondary link, transferring data stream, data flow is got around occur congested routing node, congested secondary link does not occur pass through from newly-established.
Because the network congestion processing unit of present embodiment, to set up auxiliary the connection in the upstream that congested routing node occurs, walk around congested routing node occurs, therefore, can either solve by limited cause congested of downstream routing node handling capacity, also can solve because excessive cause congested of data traffic of upstream routing node transmission.
Present embodiment also provides a kind of cordless communication network, and this network comprises a plurality of nodes, wherein, and when the congestion state order that first node can send appears when congested in first node;
The Section Point of first node upstream can parse the congestion state type identifier from described congestion state order, judge that described congestion state type identifier represents congestion state and still represents the relieve congestion state, when described congestion state type identifier represents congestion state, with the form issue help information order of broadcasting;
The 3rd node is recoverable response message after the help information order is received in reception;
Then Section Point can obtain the target routing node from a plurality of the 3rd nodes of replying, and sets up secondary link with described target routing node, and at least part of forwarding data flow that will send to congested routing node is to secondary link.Realize and referring to the before description of method or device, not do herein and to give unnecessary details for the concrete function of each node.
Through the above description of the embodiments, the those skilled in the art can be well understood to the present invention and can realize by the mode that software adds essential common hardware, can certainly pass through hardware, but the former is better execution mode in a lot of situation.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product is stored in the storage medium that can read, floppy disk such as computer, hard disk or CD etc., comprise some instructions with so that computer equipment (can be personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
The above; be the specific embodiment of the present invention only, but protection scope of the present invention is not limited to this, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, all should be encompassed within protection scope of the present invention.
Claims (12)
1. a network congestion processing method is characterized in that, comprising:
The congestion state order that the reception congestion routing node sends parses the congestion state type identifier from described congestion state order;
Judge that described congestion state type identifier represents congestion state and still represents the relieve congestion state;
When described congestion state type identifier represents congestion state, with the form issue help information order of broadcasting;
The response message that the routing node of help information order is replied is received in reception, obtains the target routing node from the routing node of replying response message;
Set up secondary link with described target routing node;
At least part of forwarding data flow that will send to congested routing node is to secondary link;
Described will comprising to secondary link at least part of forwarding data flow that congested routing node sends:
To send to secondary link according to preset ratio 1-m to the data flow that congested routing node sends;
Whether judgement receives the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time;
When not receiving the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time, the ratio of the data flow that will send to secondary link is updated to 1-m
N+1, wherein, n is the number of times that the ratio of the described data flow that will send to secondary link is upgraded, m is preset ratio.
2. network congestion processing method according to claim 1 is characterized in that, comprises the minimum hop count of routing node to aggregation node of seeking help in the described help information order;
The routing node of described answer response message to the minimum hop count of aggregation node is less than or equal to the described minimum hop count of routing node to aggregation node of seeking help, and the routing node of described answer response message does not occur congested, and described aggregation node is the routing node of the data of the described congested routing node transmission of reception.
3. network congestion processing method according to claim 2 is characterized in that, also comprises:
Receive another congestion state order that described congested routing node sends, from described another congestion state order, parse another congestion state type identifier;
Judge that described another congestion state type identifier represents congestion state and still represents the relieve congestion state;
When described another congestion state type identifier represented the relieve congestion state, at least part of forwarding data flow that will send to secondary link was to congested routing node.
4. network congestion processing method according to claim 3 is characterized in that, described will comprising to congested routing node at least part of forwarding data flow that secondary link sends:
The data flow that will send to secondary link is m proportionally
N+1Send to congested routing node;
Whether judgement is zero to the data flow that secondary link sends;
When the data flow that sends to secondary link was non-vanishing, the ratio of the data flow that will send to congested routing node was updated to m
N+1-y, wherein, y is the number of times that the ratio of the described data flow that will send to congested routing node is upgraded, m is preset ratio.
5. according to claim 1 to 4 each described network congestion processing methods, it is characterized in that, comprise the routing node of described answer response message in the described response message to the jumping figure value information of aggregation node, describedly from the routing node of replying response message, obtain the target routing node and comprise:
According to described jumping figure value information, from the routing node of replying response message, obtain the routing node of jumping figure value minimum;
With the routing node of described jumping figure value minimum as the target routing node.
6. network congestion processing method according to claim 5 is characterized in that, described routing node with described jumping figure value minimum comprises as the target routing node:
Judge that whether the quantity of routing node of described jumping figure value minimum is greater than 1;
When the quantity of the routing node of described jumping figure value minimum greater than 1 the time, from the routing node of described jumping figure value minimum, obtain the highest routing node of fitness;
The routing node that described fitness is the highest is as the target routing node.
7. network congestion processing method according to claim 6 is characterized in that, comprises dump energy value information and the queue length value information of the routing node of described answer response message in the described response message, and described fitness is found the solution based on following mode:
8. a network congestion processing unit is characterized in that, comprising:
Resolution unit is used for the congestion state order that the reception congestion routing node sends, and parses the congestion state type identifier from described congestion state order;
Judging unit is used for judging that described congestion state type identifier represents congestion state and still represents the relieve congestion state;
Release unit is used for when described congestion state type identifier represents congestion state, with the form issue help information order of broadcasting;
Acquiring unit for the response message that the routing node of receiving the help information order is replied, obtains the target routing node from the routing node of replying response message;
Link unit is used for setting up secondary link with the target routing node that obtains;
The first retransmission unit, at least part of forwarding data flow that is used for sending to congested routing node is to secondary link;
Described the first retransmission unit comprises:
The first sending module is used for and will sends to secondary link according to preset ratio 1-m to the data flow that congested routing node sends;
The first judge module is used for judging whether receive the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time;
The first update module is used for when not receiving the congestion state order that comprises the congestion state type identifier that represents the relieve congestion state in Preset Time, and the ratio of the data flow that will send to secondary link is updated to 1-m
N+1, wherein, n is the number of times that the ratio of the described data flow that will send to secondary link is upgraded, m is preset ratio.
9. network congestion processing unit according to claim 8 is characterized in that,
Described resolution unit also is used for receiving another congestion state order that described congested routing node sends, and parses another congestion state type identifier from described another congestion state order;
Described judging unit also is used for judging that described another congestion state type identifier represents congestion state and still represents the relieve congestion state;
Described network congestion processing unit also comprises: the second retransmission unit, be used for when described another congestion state type identifier represents the relieve congestion state, and at least part of forwarding data flow that will send to secondary link is to congested routing node.
10. network congestion processing unit according to claim 9 is characterized in that, described the second retransmission unit comprises:
The second sending module, the data flow that is used for sending to secondary link is according to preset ratio m
N+1Send to congested routing node;
The second judge module is used for judging whether the data flow that sends to secondary link is zero;
The second update module is used for when the data flow that sends to secondary link is non-vanishing, will be updated to m to the ratio of the data flow of congested routing node transmission
N+1-y, wherein, y is the number of times that the ratio of the described data flow that will send to congested routing node is upgraded, m is preset ratio.
11. to 10 each described network congestion processing unit, it is characterized in that described acquiring unit comprises according to claim 8:
Acquisition module is used for according to the jumping figure value information, obtains the routing node of jumping figure value minimum from the routing node of replying response message;
Designated module is used for routing node with described jumping figure value minimum as the target routing node.
12. network congestion processing unit according to claim 11 is characterized in that, described designated module comprises:
Judge submodule, be used for judging that whether the quantity of routing node of described jumping figure value minimum is greater than 1;
Obtain submodule, be used for when the quantity of the routing node of described jumping figure value minimum greater than 1 the time, from the routing node of described jumping figure value minimum, obtain the highest routing node of fitness, described fitness is found the solution based on following mode:
Specify submodule, be used for the routing node that described fitness is the highest as the target routing node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105522584A CN102006225B (en) | 2010-11-19 | 2010-11-19 | Network congestion processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105522584A CN102006225B (en) | 2010-11-19 | 2010-11-19 | Network congestion processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102006225A CN102006225A (en) | 2011-04-06 |
| CN102006225B true CN102006225B (en) | 2013-04-24 |
Family
ID=43813311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105522584A Active CN102006225B (en) | 2010-11-19 | 2010-11-19 | Network congestion processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102006225B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102595487B (en) * | 2012-03-22 | 2015-07-15 | 重庆邮电大学 | Device and method used for controlling sensor network gateway congestion and based on multiple communication modules |
| CN103945482A (en) * | 2013-06-14 | 2014-07-23 | 北京信息科技大学 | Energy optimization routing algorithm in consideration of energy balance |
| CN103312620A (en) * | 2013-06-26 | 2013-09-18 | 华为技术有限公司 | Method and device for processing network congestion |
| CN103825840B (en) * | 2014-03-03 | 2017-01-11 | 北京邮电大学 | Traffic scheduling method and traffic scheduling equipment |
| CN108965121B (en) * | 2017-05-19 | 2021-06-01 | 华为技术有限公司 | Method, host and switch for transmitting data |
| CN109688059B (en) * | 2017-10-19 | 2022-02-01 | 深圳市中兴微电子技术有限公司 | Congestion management method and device for switching network and computer storage medium |
| CN108848534B (en) * | 2018-06-26 | 2021-07-16 | 重庆邮电大学 | Routing method for adaptively reducing node load in mobile ad hoc network |
| CN117395198B (en) * | 2023-12-11 | 2024-02-20 | 国网浙江省电力有限公司 | Congestion alarm method and system for power communication network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155125A (en) * | 2006-09-28 | 2008-04-02 | 联想(北京)有限公司 | Method for processing congestion |
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7023843B2 (en) * | 2002-06-26 | 2006-04-04 | Nokia Corporation | Programmable scheduling for IP routers |
-
2010
- 2010-11-19 CN CN2010105522584A patent/CN102006225B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155125A (en) * | 2006-09-28 | 2008-04-02 | 联想(北京)有限公司 | Method for processing congestion |
| CN101286930A (en) * | 2008-05-30 | 2008-10-15 | 华南理工大学 | Self-adapting routing method for congestion of multi-hop wireless self-organizing network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102006225A (en) | 2011-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102006225B (en) | Network congestion processing method and device | |
| Ghaffari | Congestion control mechanisms in wireless sensor networks: A survey | |
| Senthilkumaran et al. | Dynamic congestion detection and control routing in ad hoc networks | |
| CN101286930B (en) | Self-adapting routing method for congestion of multi-hop wireless self-organizing network | |
| Kumaran et al. | Early congestion detection and adaptive routing in MANET | |
| Brahma et al. | Traffic management in wireless sensor networks: Decoupling congestion control and fairness | |
| CN102438290B (en) | Wireless network routing method based on directive antenna | |
| Yunus et al. | Proposed transport protocol for reliable data transfer in wireless sensor network (WSN) | |
| Cakici et al. | A novel cross-layer routing protocol for increasing packet transfer reliability in mobile sensor networks | |
| Hsu et al. | Bandwidth routing in multi-hop packet radio environment | |
| Shrivastava et al. | A survey on congestion adaptive routing protocols for mobile ad-hoc networks | |
| Venkatasubramanian et al. | QoS Provisioning in MANET Using Fuzzy-Based Multifactor Multipath Routing Metric | |
| GB2411549A (en) | Route discovery with quality of service check in ad hoc network | |
| Wannawilai et al. | AOMDV with sufficient bandwidth aware | |
| CN110831006A (en) | Ad hoc network system and data transmission method thereof | |
| Lott et al. | Stochastic routing in ad hoc wireless networks | |
| Murshedi et al. | On-demand multipath routing protocols for mobile ad-hoc networks: a comparative survey | |
| Mamoun | A new reliable routing algorithm for MANET | |
| Liu et al. | A biologically inspired congestion control routing algorithm for MANETs | |
| CN102497325A (en) | DTN routing method based on reliable information distribution | |
| Hatamian et al. | Priority-based congestion control mechanism for wireless sensor networks using fuzzy logic | |
| Sumathi et al. | A survey on congestion control in wireless sensor networks | |
| HOC | Fuzzy logic technique for gossip based reliable broadcasting in mobile ad hoc networks | |
| Tang et al. | Congestion control based on geographic routing algorithm for wireless sensor networks | |
| Pant et al. | Traffic and resource based methods for congestion control in wireless sensor networks: A comparative analysis |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |