CN102378265B - Control method for alleviating congestion of wireless sensor network (WSN) - Google Patents

Control method for alleviating congestion of wireless sensor network (WSN) Download PDF

Info

Publication number
CN102378265B
CN102378265B CN 201110303771 CN201110303771A CN102378265B CN 102378265 B CN102378265 B CN 102378265B CN 201110303771 CN201110303771 CN 201110303771 CN 201110303771 A CN201110303771 A CN 201110303771A CN 102378265 B CN102378265 B CN 102378265B
Authority
CN
China
Prior art keywords
node
network
congestion
congestion tendency
tendency
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.)
Expired - Fee Related
Application number
CN 201110303771
Other languages
Chinese (zh)
Other versions
CN102378265A (en
Inventor
陈长英
郭强
付勇
刘瑞霞
吕家亮
孔祥龙
杨子江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
INFORMATION RESEARCH INSTITUTE OF SHANDONG ACADEMY OF SCIENCES
Original Assignee
INFORMATION RESEARCH INSTITUTE OF SHANDONG ACADEMY OF SCIENCES
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by INFORMATION RESEARCH INSTITUTE OF SHANDONG ACADEMY OF SCIENCES filed Critical INFORMATION RESEARCH INSTITUTE OF SHANDONG ACADEMY OF SCIENCES
Priority to CN 201110303771 priority Critical patent/CN102378265B/en
Publication of CN102378265A publication Critical patent/CN102378265A/en
Application granted granted Critical
Publication of CN102378265B publication Critical patent/CN102378265B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

Wireless sense network of the invention alleviates the control method that network congestion occurs characterized by comprising a. disposes and establish multilayer wireless sensor network; B. node judges whether there is congestion tendency, if any then broadcasting congestion tendency information; C. whether congestion tendency node is judged on the next-hop path that data flow will flow through; D. selection is transmitted without the next-hop path with congestion tendency node. Not available situation is shunted to interlayer, the scheme of reduction of speed in consolidated network coating can be used, message transmission rate is carried out etc. to divide reduction of speed. The present invention effectively alleviates the generation of congestion phenomenon, reduces the probability of data congestion and loss. Also disclose by establish a jump network neighbor list, establish have far and near mark multiple network neighbor lists come the method for establishing multitiered network covering; Introduce buffering queue duty ratio
Figure DEST_PATH_IMAGE002
Concept and calculation formula have the characteristics that judge in advance, adjusting in advance so that the judgement of congestion tendency is more easier and accurately.

Description

The control method that a kind of wireless sense network alleviating network congestion occurs
Technical field
The present invention relates to the control method that a kind of wireless sense network alleviating network congestion occurs, more particularly, relate in particular to a kind of the employing and lay tree topology wireless sensor network that multilayer covers and the trend by the congested generation of Sampling network in conjunction with adopting in advance interlayer shunting and adjusting the control method that the wireless sense network alleviating network congestion of network traffic data occurs.
Background technology
Wireless sensor network is by adopting the node with perception distributed way to be deployed in the place that need to carry out perception and monitoring, the physical quantity that is collected by transducer is pooled to Centroid by the wireless self-organization network employing is wireless with mode multi-hop, thereby realizes the short-distance wireless communication technology to environment wireless aware and wireless monitor purpose.
Wireless sensor network is to transmit data in passive mode, be that network node is in resting state at ordinary times, only just send data request command to sensing node when Centroid needs data, scattered, the short and small packet of the data that perceives or monitor sends it back the data that collect to Centroid.So congestion phenomenon generally not too easily occurs in wireless sensor network, but this phenomenon will be easy to occur when the number of nodes that adds network in certain subrange is a lot.
At wireless sensor network relevant therewith achievement in research report is also seldom arranged at present, and in the network of other kinds, generally be to adopt mode afterwards to carry out the adjusting of flow, namely after having network congestion to occur, regulate again the network traffics by upstream node, it is longer that the shortcoming of the method maximum of this solution network congestion is exactly the adjusting time that needs, to very difficult employing of application scenarios of the low network delay of needs; In the network of other types, adopt in addition the report of the method solution network congestion problem of data distribution, the applicable precondition of this method is to have other idle route to utilize in the network, but to energy-sensitive, wireless sensor network is not good selection cheaply, because this shunting is to carry out in the consolidated network cover layer of mesh network topology structure, and there are many routes to intersect, solve very difficult, also be very complicated even work out solution, be difficult in wireless sense network, use.
Summary of the invention
The present invention is in order to overcome the shortcoming of above-mentioned technical problem, provides a kind of the employing to lay tree topology wireless sensor network that multilayer covers and the trend by the congested generation of Sampling network in conjunction with the control method that adopts the wireless sense network alleviating network congestion of adjusting network traffic data in advance interlayer shunting and the layer to occur.
The present invention has defined the congestion phenomenon that occurs in the wireless sensor network that we study here, here the network congestion of studying refers to that the buffer queue of one or more network nodes of comprising in certain subrange in the network is full, transmit data if continue like this by this or these node, the danger of data-bag lost occurs possibly, also can cause the decline of the normal data transfer speed that causes owing to the dredging network congestion simultaneously.
The control method that wireless sense network alleviating network congestion of the present invention occurs, its special feature is, may further comprise the steps: a. network design and foundation, lay and set up the wireless sensor network of two-layer or two-layer above tree topology structure; B. the judgement of congestion tendency, the node in the network judge whether himself has the trend of congested generation, if congested occurrence tendency is arranged, then broadcast congestion tendency information in network; C. the judgement of whether processing, whether the node that the activation route comprises is that the next-hop node that data flow will be flowed through is judged to the node with congestion tendency after receiving congestion tendency information, if not, need not to process; If so, execution in step d then; D. interlayer shunting according to the residing network coverage layer in the upper hop path of the node with congestion tendency, is selected not comprise this path with other network coverage layers of congestion tendency node data is transmitted, with the purpose that realizes that alleviating network congestion occurs.The control method that alleviating network congestion among the present invention occurs is take the wireless sensor network of two-layer or the two-layer above network coverage as the basis, realizes that the purpose of network hierarchy covering is so that the network data split ratio is easier to accomplished; Each node in the network is all judged oneself carrying out congestion tendency in real time, after node broadcasts with congestion tendency goes out congestion tendency information, the node that only is in state of activation just can receive, and the position at node place with congestion tendency is judged.If have the node of congestion tendency on the down hop path that data flow will be flowed through, then preferentially adopt the method for interlayer shunting to carry out the adjusting of Data flow direction.
The control method that wireless sense network alleviating network congestion of the present invention occurs, wireless sensor network disposition and the foundation of the described two-layer or two-layer above tree topology structure of step a may further comprise the steps: a-1. disposes the ground floor network, by laying sensor node, routing node and Centroid, set up the ground floor network coverage of tree topology structure; A-2. dispose the n layer network, the number of plies n that disposes as required by insert n-1 node between the adjacent node of ground floor, sets up the wireless sensor network that the n layer network covers; N 〉=2 wherein; A-3. set up the tabulation of network one hop neighbor, each node in the network is set up hop neighbor tabulation separately by broadcasting HELLO information; A-4. revise current neighbor list and create new neighbor list, each node in the network again in conjunction with the neighbor list information of self, is set up a plurality of People Near Me tabulations with far and near sign according to the neighbor list information of the neighbor node that receives; Corresponding with the n layer overlay network of disposing to realize.Step a-1 is for laying the ground floor network coverage, and step a-2 sets up the node that the n layer network covers to be needed for laying as required; Step a-3 is that the node in the network is set up a hop neighbor list information, and step a-4 is that node passes through modification and the foundation to neighbor list, and according to on-premise network number of plies n, forms a plurality of People Near Mes tabulations with far and near sign.
The control method that wireless sense network alleviating network congestion of the present invention occurs, whether buffer queue will be full of and be foundation in the judgement employing node of the congestion tendency of nodes described in the step b, and its judgement is as follows:
If
Figure 580412DEST_PATH_IMAGE001
Duty ratio for the buffer queue of node when the moment t is defined as it:
Figure 822038DEST_PATH_IMAGE002
Wherein, Total figure place for the node buffer queue comprises is constant;
Figure 176850DEST_PATH_IMAGE004
For node in moment t shared figure place of the actual queueing message that holds in buffer queue, be variable; And introduce a congestion prediction factor lambda, its span is (0<λ<1) between 0 and 1; The buffer queue duty ratio that detects when network node is actual Reach or when surpassing predefined congestion prediction factor lambda, judge that namely this node has the trend of congested generation, begin to Web broadcast congestion tendency information from this node, this information sends with the form of broadcast frame, and this frame comprises the network address of this node and the flag information that has congestion tendency to occur.Each node in the network is provided with the buffer queue zone for data receiver and processing, to realize treating the storage of deal with data, by detecting this zone whether the trend that is full of is arranged, and can reflect this node and whether have congested occurrence tendency.Congestion prediction factor lambda wherein can be chosen according to the network practical operation situation, for example carries out value between 0.8~0.9.
The control method that wireless sense network alleviating network congestion of the present invention occurs, further comprising the steps of: five equilibrium reduction of speed in the e. layer, in the situation that adopt the shunting of steps d interlayer can't alleviating network congestion trend, adopt the scheme of five equilibrium reduction of speed in the layer, the path that namely keeps current is constant, reduces the transmission rate of data flow in current path, and establishing the front message transmission rate of reduction of speed is R, be divided into the M five equilibrium, the each adjusting all reduced , namely transmission rate is reduced to behind the reduction of speed first time
Figure 257436DEST_PATH_IMAGE006
, transmission rate is reduced to behind the reduction of speed for the second time
Figure 693097DEST_PATH_IMAGE007
, by that analogy; Whether all monitor behind the each reduction of speed of reduction of speed node and also have from the congestion tendency information broadcasting with congestion tendency node, if do not have, then reduction of speed is regulated and is finished; If can also continue to receive the congestion tendency broadcast message from this node, then proceed reduction of speed, until monitor less than till the congestion tendency broadcast message; Wherein, the unit of message transmission rate R is bit/s, and M is the positive integer more than or equal to 1.Above-mentioned steps d is the shunting of employing interlayer, if but adopt the path of interlayer shunting unavailable, just can't realize that " walking around " has the purpose that the congestion tendency node transmits; And the interior five equilibrium reduction of speed scheme of disclosed layer can address this problem preferably among the step e.
The control method that wireless sense network alleviating network congestion of the present invention occurs, in the judgement whether described step c processes, whether be that the determination methods of the next-hop node that will flow through of data flow is to node with congestion tendency: carry out the node judged according to the congestion tendency information of receiving, whether the next-hop network address of node of judging current route is identical with the network address with congestion tendency node, if not identical, then has the node of congestion tendency not on the next-hop node that data flow will be flowed through; If identical, then show the node with congestion tendency on the next-hop node that data flow will be flowed through, need the corresponding interlayer shunting of execution or the interior five equilibrium reduction of speed of layer to process.Whether the node of carry out judging is by being that realize same address to the congestion tendency node address that comprises in the congestion tendency information that receives and the next-hop network address of node of current route in the process of judging.
The control method that wireless sense network alleviating network congestion of the present invention occurs, in the interlayer shunting of described steps d, the method of selecting not comprise this path with congestion tendency node is: carry out the node of judging and exist by judging other next-hop network node addresss that whether have in its routing table except the node with congestion tendency, if have, select a minute flow transmission; If no, then think the trend that to come alleviate congestion to occur by the interlayer shunt method.
The invention has the beneficial effects as follows: the control method that wireless sense network alleviating network congestion of the present invention occurs, wireless sensor network by setting up the tree topology structure that multilayer covers and the trend by the congested generation of Sampling network, and the method for shunting and the interior reduction of speed of identical network cover layer is regulated the flow direction and the flow velocity of transfer of data between the Adoption Network different coverings, has effectively alleviated the generation of certain node in the network or certain area jamming phenomenon.The invention also discloses a kind ofly by having set up hop neighbor tabulation, the neighbor list since setting up being made amendment and set up the method for new People Near Me tabulation, realized having the foundation of the tree topology wireless sensor network of n layer network structure; When node judges whether to have congestion tendency, introduced the duty ratio of buffer queue
Figure 464743DEST_PATH_IMAGE001
Concept and computing formula so that the judgement of congestion tendency is more prone to and accurately.Control method of the present invention, the characteristics of have prior judgement, regulating have in advance realized just carrying out congestion prevention and have regulated, thereby alleviated preferably the real generation of congestion phenomenon in the transfer of data before congested real generation.
Description of drawings
Fig. 1 is the network topology structure schematic diagram of embodiment among the present invention;
Fig. 2 is the method flow diagram in the embodiment of the invention.
Embodiment
The invention will be further described below in conjunction with accompanying drawing and embodiment.
Wherein, Fig. 1 and Fig. 2 have provided respectively network topology structure schematic diagram and the method flow diagram of embodiment among the present invention.The node of solid black represents the Centroid of whole wireless sensor network among Fig. 1, other node is routing node and sensor terminal node, the node that wherein dots is the node that is in resting state, the node that represents with solid line is to activate node, and the node that represents with chain-dotted line is the node with congestion tendency that detects.
The embodiment of the invention provides a kind of tree topology network that covers by laying and set up multilayer in wireless sensor network, then utilize and regulate the control method that flow velocity that data flow reduces data flow combines the generation of alleviating network congestion phenomenon in the data flow shunting and layer between the heterogeneous networks cover layer.By node that congested occurrence tendency is arranged or local node cluster are predicted in advance, congestion information broadcasts in advance, the flow velocity of regulating the flow direction of data flow between binder course in data flow shunting or the layer again and reducing data flow can be alleviated the generation of wireless sensor network local data stream congestion phenomenon preferably.
Describe implementation process of the present invention in detail below in conjunction with accompanying drawing 1.
Here be covered as example with double layer network, in the network design stage, dispose first node g(Centroid), node a, c, e and node i, k, m, these nodes form ground floor network coverages; Then, between the adjacent node of ground floor network, insert again respectively a node deployment, like this node a, b ..., l and m form second layer overlay network, if dispose n layer overlay network, n-1 node of insertion between the adjacent node of ground floor just.
At the network establishment stage, node f and h broadcast HELLO information towards periphery, after Centroid g receives the HELLO information of these two nodes transmissions, give these two node distribution network addresses, also the network address of these two nodes is write its People Near Me tabulation, Centroid g also broadcasts HELLO information towards periphery, and after node f and h received this information, also the network address with Centroid g was written in their People Near Me tabulations separately; Node e and i also broadcast HELLO information towards periphery, after center node g receives these information, also give node e and i distribution network address, and the network address of these two nodes joined oneself People Near Me tabulation, after these two nodes received the HELLO broadcast message of Centroid g, also the network address with Centroid g was written to their People Near Me tabulations separately; Other nodes d in the network, j, k, c, b, l, m, a also adopt identical method to set up their network one hop neighbor tabulations separately.
Next, network node enters neighbor list modification stage and new neighbor list establishment stage, the People Near Me list information of the broadcasting oneself in the network of each node in the network, receive the People Near Me list information of node f and h transmission as center node g after, know that node i is the People Near Me of node h, node e is the People Near Me of node f, the People Near Me list information of recombination center node g self, Centroid g just knows that the neighbor node i of oneself should be positioned at different network coverage layers with e and h with f, Centroid g just sets up a People Near Me tabulation more like this, the network address of node i and e or node h and f is write into, then meshed network address deletion from original People Near Me tabulation of writing in the new People Near Me tabulation;
After node h and f receive the People Near Me list information of Centroid g, in conjunction with the People Near Me tabulation of oneself, keep Centroid g constant in their People Near Me tabulations separately, receive the People Near Me list information of node i broadcasting as node h after, again in conjunction with the People Near Me tabulation that is stored in node h, node h just knows that node i and j should be in different network coverage layers, the People Near Me tabulation of recombination center node g broadcasting, node h knows that node i is the hop neighbor of Centroid g, and node j is not, node h decision node i should be apart from oneself nearer jumping People Near Me like this, and node j is apart from oneself jumping People Near Me far away, in node h, set up again like this a far-end network neighbor list, the network address of node j is write into, and with node j deletion from the original People Near Me tabulation of node h, simultaneously original neighbor list is labeled as the tabulation of near-end People Near Me, node f also adopts and uses the same method and step joins the network address of node d oneself far-end network neighbor list, simultaneously with node d deletion from original People Near Me tabulation, original neighbor list is labeled as the tabulation of near-end People Near Me, after node h and f again will separately near-end neighbor lists and the broadcasting of far-end neighbor list information, Centroid g will have the neighbor list of node h and the f network address to be labeled as the tabulation of near-end People Near Me in conjunction with the People Near Me list information of oneself more originally, and the neighbor list that the network address that node e and i will be arranged originally exists is labeled as far-end neighbor tabulation, other nodes a in the network, b, c, d, e and node i, j, k, l, m also adopts same process and method to set up a near-end People Near Me tabulation and a far-end network neighbor list in node separately;
Suppose that current many transmission routes that are positioned at different network coverage layers from node a to Centroid g set up, wherein one is the best route of current selection, other each bar routes are alternate routing, these routing iinformations all have been stored in the routing table of each routing node from node a to Centroid g, wherein Centroid g storage is the network address of all nodes of comprising of each bar route of choosing, and what store in the routing table of other nodes is the network address of the next-hop node in each bar route of choosing;
For the detection that has or not congestion tendency in the network, should adopt in the decision node buffer queue whether will be full of according to the front to the definition of network congestion and be foundation, here need to introduce a congestion prediction factor lambda, its span is (0<λ<1) between 0 and 1, during actual the use this predictive factor is pre-stored in each network node, the user can regulate this predictive factor according to the practical operation situation of network, when decision node has or not congestion tendency, the duty ratio of dynamic calculation buffer queue in node is defined as it:
Figure 353065DEST_PATH_IMAGE008
Denominator N is illustrated in total figure place (constant) that the buffer queue of actual design comprises in the node, minute subrepresentation network implementation border in service in the buffer queue of t at node sometime the shared figure place (variable) of the actual queueing message that holds, the buffer queue duty ratio that detects when network node is actual
Figure 235570DEST_PATH_IMAGE001
Reach or when surpassing predefined congestion prediction factor lambda, judge that namely this node has the trend of congested generation, begin to Web broadcast congestion tendency information from this node, this information sends with the form of broadcast frame, and this frame comprises the network address of this node and the flag information that has congestion tendency to occur;
Suppose the duty ratio that in the tree topology sensor network of setting up, detects buffer queue at moment t at node d
Figure 24273DEST_PATH_IMAGE009
Reached predefined congestion prediction factor lambda, then broadcast congested frame from node d to the whole network, suppose that current route from node a to Centroid g is to activate route, and the route from node m to Centroid g is in resting state, therefore this broadcast frame can only be along current activation route propagation from node a to Centroid g, through forwarded hop-by-hop, all nodes that comprise the route from node a to Centroid g have all been known and currently will have been occured congested at node d;
Next, all nodes (except the Centroid g) that comprise the activation route from node a to Centroid g check all whether node d is positioned on the path that own down hop data flow will flow through, this process activates whether realize identical with the network address of node d of next-hop network address of node that node checks respectively current route corresponding in separately the routing table by each, if the desired data of Centroid g have been transferred to node a, node e or f, then the network address of the next-hop node of their current routes is not identical with the network address of node d, at this moment node a, e or f shunt or reduction of speed current data flow with regard to not needing.If but the desired data of Centroid g only have been transferred to node b, if the data of node b are when transmitting by path 8, it is identical with node address in the congestion tendency information that node b just judges the next-hop network address of node of current route, just according to the network coverage layer at 8 places, path, choose and be in the tectal path 2 of heterogeneous networks and carry out transfer of data; If present node b carries out the transmission of data by path 2, the node address of then judging in the congestion tendency information is different from the next-hop network address of node of current route, just need not to carry out reduction of speed processing in interlayer shunting and the layer.Similarly, if the desired transfer of data of Centroid has arrived node c, when node c carries out the transmission of data by path 9, need not to shunt with reduction of speed and process; When node c carries out the transmission of data by path 3, then choose and be positioned at the tectal path 9 of heterogeneous networks with path 3 and carry out the transmission of data, in the 9 disabled situations of path, adopt again in the layer five equilibrium reduction of speed to process.
We compose respectively with different response priority two kinds of methods of the intratectal reduction of speed of the shunting between the heterogeneous networks cover layer and consolidated network, at first check many of down hops that current data stream will be flowed through to be arranged in the path of different network coverage layers whether available free activated path can be crossed congested node d will occur, this process realizes by the next-hop network address of node that the inspection current data flows many routes of storing in the routing table of residing node, exist if be checked through the next-hop network node address that does not comprise network node d, just divide the data flow of flow transmission from such path; If do not have, take again the method for reduction of speed in the consolidated network cover layer, the consolidated network cover layer here refers to keep the network coverage layer at place, down hop path constant, the down hop transmission path need not be switched to other network coverage layer, suppose that current data flow is positioned at node b, the next-hop network address of node of current route is d, be that the down hop path that current route comprises is the path 8 shown in Fig. 1, after node b receives congested broadcast frame from node d, the network address in the down hop path by the current route in the routing table that checks oneself, know that the node d with congestion tendency is positioned on the path 8 that down hop will pass through, then check whether the next-hop network address that other routes comprise has the network address that does not comprise node d to exist, because the network node address of down hop path 2 correspondences is c rather than d, so 2 pairs of current data flow of selecting paths are shunted.If current data flow is positioned at node c, then adopt identical method to shunt with the 9 pairs of current data flow in path; If lost efficacy for a certain reason and can't be utilized in the path 9 of process node c, at this moment can only continue to utilize original path 3 to come the transmission of data, will consider like this to adopt path in original network coverage layer to reduce the method for the flow velocity of the data flow that will transmit, if the message transmission rate before the reduction of speed is R bit/s, with [0, R] this speed interval on average is divided into the M five equilibrium, regulates all with rate reduction at every turn
Figure 966821DEST_PATH_IMAGE005
Individual bit/s, namely transmission rate is reduced to behind the reduction of speed first time Individual bit/s, transmission rate is reduced to behind the reduction of speed for the second time
Figure 763056DEST_PATH_IMAGE011
Individual bit/s, by that analogy, after node c is with the original data stream reduction of speed first time, data flow 3 transmits to node d along the path, node c continues to monitor the congested frame that whether also has from node d and continues broadcasting simultaneously, if do not had, reduction of speed is just regulated and is finished, if can also continue to receive the congested broadcast frame from node d, then data flow is done for the second time reduction of speed, and then whether monitoring also has the congested broadcast frame from node d,, so repeatedly, until monitor less than the congested broadcast frame from node d.
As shown in Figure 2, provided the program flow diagram of the embodiment of the invention, it step that comprises is as follows:
(1) at first carries out laying and the foundation of the tree topology structured radio sensor network that multilayer covers, lay the foundation for implementing alleviating network congestion generation control method;
(2) then, the judgement whether each node in the network all has congestion tendency to occur if do not have, just finishes the judgement of congestion tendency; If judge the trend of congested generation, then this node with congestion tendency is broadcasted congestion tendency information towards periphery;
(3) after the node that is in state of activation in the network receives congestion tendency information, at first whether the node with congestion tendency is on the down hop path that data flow will flow through and judges, if do not exist, then need not to process; If on the down hop path that data will be flowed through, execution in step (4) then;
(4) whether available free alternative path can be used to judge that can walk around the node with congestion tendency by the method for interlayer shunting carries out transfer of data according to the network coverage layer at other; If can carry out the interlayer shunting, just the preferential method of interlayer shunting that adopts is avoided congestion tendency node, termination routine; If can not carry out the interlayer shunting, transfer execution in step (5) to;
(5) present message transmission rate is carried out the equivalent reduction of speed, all monitor whether also have congestion tendency information continuation broadcasting behind each reduction of speed, if having, continue the equivalent reduction of speed, until monitor less than till the congestion tendency broadcast message.

Claims (6)

1. the control method that the wireless sense network alleviating network congestion occurs is characterized in that, may further comprise the steps:
A. the wireless sensor network of two-layer or two-layer above tree topology structure is laid and is set up in network design and foundation;
B. the judgement of congestion tendency, the node in the network or node cluster judge whether himself has congestion tendency, if congestion tendency is arranged, then broadcast congestion tendency information in network; The flag information that in broadcasting congestion tendency information, comprises the network address of this node and have congestion tendency to occur;
C. the judgement of whether processing, whether the node that the activation route comprises is that the next-hop node that data flow will be flowed through is judged to the node with congestion tendency after receiving congestion tendency information, if not, need not to process; If so, execution in step d then;
D. interlayer shunting according to the residing network coverage layer in the upper hop path of the node with congestion tendency, is selected not comprise this path with other network coverage layers of congestion tendency node data is transmitted, with the purpose that realizes that alleviate congestion occurs.
2. the control method of wireless sense network alleviating network congestion generation according to claim 1 is characterized in that, wireless sensor network disposition and the foundation of the two-layer or two-layer above tree topology structure described in the step a may further comprise the steps:
A-1. dispose the ground floor network, by laying sensor node, routing node and Centroid, set up the ground floor network coverage of tree topology structure;
A-2. dispose the n layer network, the number of plies n that disposes as required by insert n-1 node between the adjacent node of ground floor, sets up the wireless sensor network that the n layer network covers; N 〉=2 wherein;
A-3. set up the tabulation of network one hop neighbor, each node in the network is set up hop neighbor tabulation separately by broadcasting HELLO information;
A-4. revise current neighbor list and create new neighbor list, each node in the network again in conjunction with the neighbor list information of self, is set up a plurality of People Near Me tabulations with far and near sign according to the neighbor list information of the neighbor node that receives; To realize covering corresponding with the n layer network of disposing.
3. the control method of wireless sense network alleviating network congestion generation according to claim 1 and 2 is characterized in that, whether buffer queue will be full of and be foundation in the judgement employing node of the congestion tendency of nodes described in the step b, and its judgement is as follows:
If
Figure DEST_PATH_IMAGE002
Duty ratio for the buffer queue of node when the moment t is defined as it:
Figure DEST_PATH_IMAGE004
Wherein,
Figure DEST_PATH_IMAGE006
Total figure place for the node buffer queue comprises is constant;
Figure DEST_PATH_IMAGE008
For node in moment t shared figure place of the actual queueing message that holds in buffer queue, be variable; And introduce a congestion prediction factor lambda, its span is (0<λ<1) between 0 and 1; The buffer queue duty ratio that detects when network node is actual
Figure 458935DEST_PATH_IMAGE002
Reach or when surpassing predefined congestion prediction factor lambda, judge that namely this node has the trend of congested generation, begin to Web broadcast congestion tendency information from this node, this information sends with the form of broadcast frame, and this frame comprises the network address of this node and the flag information that has congestion tendency to occur.
4. the control method of wireless sense network alleviating network congestion generation according to claim 1 and 2 is characterized in that, and is further comprising the steps of:
E. the layer in the five equilibrium reduction of speed, in the situation that adopt the shunting of steps d interlayer can't alleviating network congestion trend, adopt the scheme of five equilibrium reduction of speed in the layer, the path that namely keeps current is constant, reduce the transmission rate of data flow in current path, if the message transmission rate before the reduction of speed is R, be divided into the M five equilibrium, the each adjusting all reduced
Figure DEST_PATH_IMAGE010
, namely transmission rate is reduced to behind the reduction of speed first time
Figure DEST_PATH_IMAGE012
, transmission rate is reduced to behind the reduction of speed for the second time
Figure DEST_PATH_IMAGE014
, by that analogy; Whether all monitor behind the each reduction of speed of reduction of speed node and also have from the congestion tendency information broadcasting with congestion tendency node, if do not have, then reduction of speed is regulated and is finished; If can also continue to receive the congestion tendency broadcast message from this node, then proceed reduction of speed, until monitor less than till the congestion tendency broadcast message; Wherein, the unit of message transmission rate R is bit/s, and M is the positive integer more than or equal to 1.
5. the control method that occurs of wireless sense network alleviating network congestion according to claim 1 and 2, it is characterized in that, in the judgement whether described step c processes, whether be that the determination methods of the next-hop node that will flow through of data flow is to node with congestion tendency: carry out the node judged according to the congestion tendency information of receiving, whether the next-hop network address of node of judging current route is identical with the network address with congestion tendency node, if not identical, then has the node of congestion tendency not on the next-hop node that data flow will be flowed through; If identical, then show the node with congestion tendency on the next-hop node that data flow will be flowed through, need the corresponding interlayer shunting of execution or the interior five equilibrium reduction of speed of layer to process.
6. the control method that occurs of wireless sense network alleviating network congestion according to claim 1 and 2, it is characterized in that, in the interlayer shunting of described steps d, the method of selecting not comprise this path with congestion tendency node is: carry out the node of judging and exist by judging other next-hop network node addresss that whether have in its routing table except the node with congestion tendency, if have, select a minute flow transmission; If no, then think the generation that can not come by the interlayer shunt method alleviating network congestion trend.
CN 201110303771 2011-10-10 2011-10-10 Control method for alleviating congestion of wireless sensor network (WSN) Expired - Fee Related CN102378265B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110303771 CN102378265B (en) 2011-10-10 2011-10-10 Control method for alleviating congestion of wireless sensor network (WSN)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110303771 CN102378265B (en) 2011-10-10 2011-10-10 Control method for alleviating congestion of wireless sensor network (WSN)

Publications (2)

Publication Number Publication Date
CN102378265A CN102378265A (en) 2012-03-14
CN102378265B true CN102378265B (en) 2013-01-23

Family

ID=45796057

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110303771 Expired - Fee Related CN102378265B (en) 2011-10-10 2011-10-10 Control method for alleviating congestion of wireless sensor network (WSN)

Country Status (1)

Country Link
CN (1) CN102378265B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104135733B (en) * 2014-08-05 2017-04-26 威胜电气有限公司 Self-networking method and networking system based on micro-power wireless device of power distribution network
CN105553862B (en) * 2015-12-31 2018-08-31 上海理工大学 Routing device and communication means
CN110138672A (en) * 2019-05-17 2019-08-16 重庆物奇科技有限公司 A kind of internet of things data transmission method and system
CN112351468B (en) * 2020-11-05 2022-08-09 东方红卫星移动通信有限公司 Routing control method, node and system based on residual energy perception
CN114422444B (en) * 2022-01-26 2023-12-19 华北电力大学 Network congestion control method and system for power transmission line unmanned aerial vehicle inspection

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101098301A (en) * 2006-06-27 2008-01-02 华为技术有限公司 Two-layer congestion control method of wireless network
CN102065480A (en) * 2010-11-22 2011-05-18 北京邮电大学 Path priority-based wireless sensor network congestion avoidance and control method
CN102196502A (en) * 2011-04-06 2011-09-21 东南大学 Congestion control method for wireless sensor network

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101098301A (en) * 2006-06-27 2008-01-02 华为技术有限公司 Two-layer congestion control method of wireless network
CN102065480A (en) * 2010-11-22 2011-05-18 北京邮电大学 Path priority-based wireless sensor network congestion avoidance and control method
CN102196502A (en) * 2011-04-06 2011-09-21 东南大学 Congestion control method for wireless sensor network

Also Published As

Publication number Publication date
CN102378265A (en) 2012-03-14

Similar Documents

Publication Publication Date Title
Gholipour et al. Hop-by-hop traffic-aware routing to congestion control in wireless sensor networks
Banimelhem et al. GMCAR: Grid-based multipath with congestion avoidance routing protocol in wireless sensor networks
CN105959232B (en) A kind of satellite network method for routing based on software defined network control points optimization
Senthilkumaran et al. Dynamic congestion detection and control routing in ad hoc networks
US8693345B2 (en) Dynamic management of wireless network topology with diverse traffic flows
CN102378265B (en) Control method for alleviating congestion of wireless sensor network (WSN)
Wang et al. LIAITHON: A location-aware multipath video streaming scheme for urban vehicular networks
CN110708736B (en) Dynamic routing method and system based on energy efficiency relay selection
CN104080112B (en) A kind of method for improving wireless self-organization network service reliability
Tan et al. Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks
US8559293B2 (en) Wireless communication apparatus, wireless communication network and method of controlling routing selection
WO2004004219A2 (en) Integrated wireless distribution and mesh backhaul networks
CN103929782B (en) A kind of resources balance multi-path route method suitable for industrial wireless sensor network
CN1996933A (en) Method for congestion control in the real time multicast service
CN102802230A (en) Energy-efficient wireless sensor network routing algorithm
CN105978811B (en) A kind of route selecting method and device based on business transmission
Korkmaz et al. Characterizing link and path reliability in large-scale wireless sensor networks
CN101867920B (en) Grading type wireless sensor networking method
CN102083164A (en) Method for opportunistic routing of wireless sensor network (WSN) based on energy perception
CN103945413B (en) Multi-hop data transmission method that cavity is avoided, apparatus and system
Batra et al. An optimized energy efficient routing algorithm for wireless sensor network
Rajesh et al. Hop-by-hop channel-alert routing to congestion control in wireless sensor networks
Usha et al. A robust architecture of the OLSR protocol for channel utilization and optimized transmission using minimal multi point relay selection in VANET
CN109803342A (en) A kind of unmanned plane method for self-organizing network routing towards balancing energy highly-reliable transmission
CN107222901B (en) Method for realizing cognitive radio network routing protocol based on channel allocation

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130123

Termination date: 20171010

CF01 Termination of patent right due to non-payment of annual fee