CN111093230A - IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN - Google Patents

IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN Download PDF

Info

Publication number
CN111093230A
CN111093230A CN202010063751.3A CN202010063751A CN111093230A CN 111093230 A CN111093230 A CN 111093230A CN 202010063751 A CN202010063751 A CN 202010063751A CN 111093230 A CN111093230 A CN 111093230A
Authority
CN
China
Prior art keywords
node
6lowpan
nodes
alternative
probability
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010063751.3A
Other languages
Chinese (zh)
Other versions
CN111093230B (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.)
Changshu Institute of Technology
CERNET Corp
Original Assignee
Changshu Institute of Technology
CERNET Corp
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 Changshu Institute of Technology, CERNET Corp filed Critical Changshu Institute of Technology
Priority to CN202010063751.3A priority Critical patent/CN111093230B/en
Publication of CN111093230A publication Critical patent/CN111093230A/en
Application granted granted Critical
Publication of CN111093230B publication Critical patent/CN111093230B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method for realizing load balancing of IPv6 wireless sensor nodes based on a 6 LoWPAN. Step 1, setting a 6LoWPAN sensing node; step 2, calculating the forwarding probability of the 6LoWPAN relay node; step 3, constructing a dynamic coverage tree; the invention provides a method for realizing load balance of 6LoWPAN wireless sensor nodes for maintaining maximum connection of an IPv6 network, which achieves maximum coverage and maintains the connectivity of each node and a base station under an IPv6 protocol by dynamically constructing a load balance routing coverage tree.

Description

IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN
Technical Field
The invention belongs to the field of load balancing of wireless sensor nodes, and particularly relates to a method for realizing load balancing of an IPv6 wireless sensor node based on a 6 LoWPAN.
Background
With the development of economy, networks are increasingly popularized, and the problems of network address resources and energy consumption are increasingly aggravated. In order to solve the problem of serious energy waste, the coverage tree algorithm for keeping the load balance of the maximum connection under the protocol of IPv6 is provided.
Since the biggest problem of the IPv4 is that network address resources are limited, the application and development of the internet are severely restricted. The use of the IPv6 not only solves the problem of the number of network address resources, but also solves the obstacle of connecting various access devices to the Internet. In combination with the above, the method for realizing load balancing of the wireless sensor nodes under the IPv6 can effectively reduce energy waste.
Disclosure of Invention
The invention provides a method for realizing load balancing of an IPv6 wireless sensor node based on a 6LoWPAN (Wireless Internet protocol network) in order to improve the utilization of network address resources and solve the problem of load imbalance.
The invention discloses a 6 LoWPAN-based IPv6 wireless sensor node load balancing implementation method, which specifically comprises the following steps:
step 1, setting 6LoWPAN sensing node
Step 1.1, the square of the ratio of the residual energy of the 6LoWPAN node to the forwarding distance is adopted to represent the weight of a forwarding path between an IPv6 parent node and a child node;
step 1.2 definition of SiAlternative IPv6 father node S when working with 6LoWPAN aware nodesrj∈Prt(Si) The forward forwarding probability of (c) is defined as:
Figure BDA0002375316840000021
wherein erj(τ') denotes the node S at time τrjThe residual energy of (d); e.g. of the typek(τ') denotes the node S divided at time τrjThe residual energy of the outer node, α is an index factor used to adjust the response strength of the energy/distance ratio curve, di,rjRepresents a node SrjThe forwarding distance of (a); di,kIndicating a node SrjThe forwarding distance of a certain external node;Prt(Si) A set of parent nodes representing v alternatives;
step 1.3 Using the definitions, S is obtainediForward probability when a 6LoWPAN sensing node works;
step 1.4 dynamically adjusting the forward forwarding probability according to the estimated load of the 6LoWPAN alternative parent node;
step 2, calculating the forwarding probability of the 6LoWPAN relay node
Step 2.1, the expected load is used for standardizing the residual energy of the IPv6 alternative parent node;
step 2.2 defines the relay node S at time τKTo other IPv6 alternative parents;
Srh∈Qrt(Sk) The weight of a jump input path of (2) is as follows:
Figure BDA0002375316840000022
step 2.3, each 6LoWPAN alternative father node S is calculated by using definitionrh∈Prt(Sk) Has a weight deviation of Dev (S)K,Srh,τ'))＝weight(SK,Srhτ') -weight where Dev (x) denotes the offset of x, weight denotes all IPv6 alternative parents SkThe average of the forwarding paths of (a);
step 2.4 define 6LoWPAN relay node SkForward to IPv6 alternative parent node Srh∈Prt(Sk) The probability of (c) is:
Figure BDA0002375316840000031
SKwhen the positive weight deviation tendency of (2) is large, the node S is moved to the 6LoWPAN alternative parent node SrhThe forward forwarding probability of forwarding data is large; conversely, when the negative weight deviation is large, SkInclined IPv6 alternative parent node SrhThe probability of forwarding data will be small;
step 2.5 apply weight bias when SkFrom 6LoWPAN alternative parent nodeWhen the point selects an optimal point to forward data, finding out the trend of load balance;
step 2.6, calculating forward forwarding probability of the 6LoWPAN sensing node or the 6LoWPAN relay node and the 6LoWPAN alternative father node;
step 3, constructing dynamic coverage tree
Step 3.1, determining the number of reachable layers (namely hop count) of unicast of each 6LoWPAN sensor node;
step 3.2 determining forward transmission probability
Figure BDA0002375316840000032
Srj∈Prt(Si)，Prt(Si) Representing a set of v candidate parent nodes;
step 3.3, updating the forward transmission probability of the 6LoWPAN sensing node; at the same time, calculating the expected load applied by these 6LoWPAN aware nodes to the 6LoWPAN alternative parent node;
step 3.46 the LoWPAN relay node is moved to the 6LoWPAN relay node positioned at the lower layer number according to the sequence from bottom to top; for 6LoWPAN relay nodes on the same layer, 6LoWPAN nodes with more alternative parent nodes will move first; the calculation loop is repeated until all the 6LoWPAN nodes are completely moved;
step 3.5, calculating the forwarding probability and the load expectation in a certain fixed time according to the sampling frequency of the given WSN;
step 3.6 after the end of each calculation phase, if an IPv6 node is to send the sensed data to the base station BS, a random number RND e (0,1) is randomly generated using roulette's selection to determine which 6LoWPAN candidate parent node is to be selected as the active node;
step 3.7 the sensed data is forwarded to the base station BS via the selected node.
Further, consider any node S in K layers, i.e., with a hop count of Ki(ii) a condition; assume that there are v alternative parent nodes, denoted Prt (S) by seti)＝{Sr1,Sr2,...,Srv}; at time τ' from SiThe forward (transmission) probability to the alternate parent node is expressed as:
Figure BDA0002375316840000041
wherein
Figure BDA0002375316840000042
And is
Figure BDA0002375316840000043
Sensing whether the node has a child node or not according to the structure of the dynamic overlay tree; the sensing nodes are only responsible for monitoring the task of sending the sensed data by the independent information sending points; therefore, the sensing node does not perform the relay task, so the energy consumption is very small; however, if only one sensing node covers the independent information sending point, the sensing node is also called a key node, the point is not covered by other nodes, and when the key node exhausts energy, the lost coverage area cannot be recovered; therefore, to maximize network lifetime, S is usediAlternative father node S when working with perception noderj∈Qrt(Si) The forward forwarding probability of (c) is defined as:
Figure BDA0002375316840000044
wherein erj(τ') denotes the node S at time τrjThe residual energy of (d); e.g. of the typek(τ') denotes the node S divided at time τrjThe residual energy of the outer node, α is an index factor used to adjust the response strength of the energy/distance ratio curve, di,rjRepresents a node SrjThe forwarding distance of (a); di,kIndicating a node SrjThe forwarding distance of a certain external node; prt (S)i) A set of parent nodes representing v alternatives;
further, the forward forwarding probability is dynamically adjusted according to the load estimated by the alternative parent node, the probability that the alternative parent node with a large load is expected to act as the relay forwarding data is reduced, and on the contrary, the probability that the alternative parent node with a small load is expected to act as the relay forwarding data is increased;
normalizing the remaining energy of the alternative parent node using the expected load before τ' of the forward forwarding probability involving the relay node; involving the expected load, from the relay node S at a timeKTo other alternative parent node Srh∈Prt(Sk) The weight of a jumped input path of (2) can be defined as follows:
Figure BDA0002375316840000051
wherein erh(τ') represents the candidate parent node S at time τrhβ denotes an exponential factor, Lexp (S)rhτ') denotes the candidate parent node S at time τrhWhere we make β equal to 4 according to practical experience of repeated experiments in order to improve the load balance of the alternative parent node, each alternative parent node S can be further calculated by equation (14)rh∈prt(Sk) Has a weight deviation of Dev (S)K,Srh,τ'))＝weight(SK,Srhτ') -weight where Dev (x) denotes the offset of x, weight denotes all candidate parent nodes SkThe average of the forwarding paths of (a); denoted herein as min Dev at Prt(Sk) The one with the smallest weight deviation in all the alternative father nodes; then, the relay node SkForward to alternative parent node Srh∈Prt(Sk) The probability of (d) can be defined as:
Figure BDA0002375316840000052
represented by the formula (15), SKWhen the positive weight deviation tendency of (2) is large, the node moves to the alternative parent node SrhThe forward forwarding probability of forwarding data is large; conversely, when the negative weight deviation is large, SkTrending alternative parent node SrhThe probability of forwarding data will be small; in addition, since a weight bias is applied, when S iskSlave deviceSelecting a best node from the father nodes to forward data, wherein the trend of load balance can be found out; the forward forwarding probability of the alternative parent node, either as a sensing node or as a relay node, may be in accordance with equation (13) or equation (15)
Calculating to obtain; this probabilistic allocation is suitable for wireless sensor networks WSN, since it can operate on each sensing node individually, without the need to operate on a central node or base station BS that requires powerful computing power and power.
Furthermore, when the dynamic coverage tree is constructed, each sensor node needs to know the number of layers which can be reached by unicast firstly; the node hop count near the base station BS is small; with the "hop count" information, the forward (transmission) probability and expected load will be updated as the number of hops decreases; considering that the forward transmission probability is equal to a given value, this value is related to the number of alternative parent nodes, i.e.
Figure BDA0002375316840000061
Figure BDA0002375316840000062
Srj∈Prt(Si)，Prt(Si) A set of parent nodes representing v alternatives; firstly, updating the forward transmission probability of the sensing node; at the same time, the expected load applied by these sensing nodes to the alternative parent node is also calculated; secondly, the relay nodes are moved to the relay nodes with lower layers from bottom to top; for relay nodes on the same layer, nodes with more alternative father nodes will move first; the calculation loop is repeated until all the nodes are completely moved; depending on the sampling frequency of a given WSN, the forwarding probability and load expectation may be calculated within a certain fixed time; after the end of each calculation phase, if a node is to send the sensed data to the base station BS, a random number RND e (0,1) is randomly generated using roulette's selection to determine which alternative parent node is to be selected as the active node; according to whichThe sensed data can be forwarded to the base station BS by the selected node.
The invention provides a method for realizing load balance of 6LoWPAN wireless sensor nodes for maintaining maximum connection of an IPv6 network, which achieves maximum coverage and maintains the connectivity of each node and a base station under an IPv6 protocol by dynamically constructing a load balance routing coverage tree.
Drawings
FIG. 1 is a flow chart of the present invention.
FIG. 2 is a flow chart for building a dynamic overlay tree.
Fig. 3 is a diagram of an IPv6 wireless sensor node deployment model.
Detailed Description
The technical solutions in the examples of the present invention are clearly and completely described below with reference to the drawings in the examples of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present invention without inventive step, are within the scope of the present invention.
The present invention will be described in further detail with reference to the accompanying drawings.
Example 1
The 6LoWPAN is a low-speed wireless personal area network standard based on IPv6, and the 6LoWPAN is referred to as a WPAN network having an IPv 6-based protocol.
As shown in fig. 1, the method for implementing load balancing of the 6LoWPAN wireless sensor node to achieve maximum coverage based on dynamically constructing a load balancing routing coverage tree:
step 1 sets 6LoWPAN aware nodes.
Step 1.1 represents the weight of a hop forwarding path between an IPv6 parent node and a child node using the square of the ratio of the 6LoWPAN node residual energy to the forwarding distance.
Step 1.2 definition of SiAlternative IPv6 father node S when working with 6LoWPAN aware nodesrj∈Qrt(Si) The forward forwarding probability of (c) is defined as:
Figure BDA0002375316840000071
wherein erj(τ') denotes the node S at time τrjThe residual energy of (d); e.g. of the typek(τ') denotes the node S divided at time τrjThe residual energy of the outer node, α is an index factor used to adjust the response strength of the energy/distance ratio curve, di,rjRepresents a node SrjThe forwarding distance of (a); di,kIndicating a node SrjThe forwarding distance of a certain external node; prt (S)i) A set of parent nodes representing v alternatives;
step 1.3 Using the definitions, S is obtainediForward probability while working with 6LoWPAN aware nodes.
Step 1.4 dynamically adjusts the forward forwarding probability according to the load estimated by the 6LoWPAN alternative parent node.
And 2, calculating the forwarding probability of the 6LoWPAN relay node.
Step 2.1 normalizes the remaining energy of the IPv6 alternative parent using the expected load.
Step 2.2 defines the relay node S at time τKAlternative parent node S to other IPv6rh∈Qrt(Sk) The weight of a jump input path of (2) is as follows:
Figure BDA0002375316840000081
wherein erh(τ') represents the candidate parent node S at time τrhβ denotes an exponential factor, Lexp (S)rhτ') denotes the candidate parent node S at time τrhLoad expectation of (2);
step 2.3, each 6LoWPAN alternative father node S is calculated by using definitionrh∈Qrt(Sk) Has a weight deviation of Dev (S)K,Srh,τ'))＝weight(SK,Srhτ') -weight where Dev (x) denotes the bias of x, weight denotes all IPv6 alternative parentsPoint SkIs received from the network.
Step 2.4 define 6LoWPAN relay node SkForward to IPv6 alternative parent node Srh∈Prt(Sk) The probability of (c) is:
Figure BDA0002375316840000082
SKwhen the positive weight deviation tendency of (2) is large, the node S is moved to the 6LoWPAN alternative parent node SrhThe forward forwarding probability of forwarding data may be large. Conversely, when the negative weight deviation is large, SkInclined IPv6 alternative parent node SrhThe probability of forwarding the data will be small.
Step 2.5 apply weight bias when SkWhen the best node is selected from the 6LoWPAN alternative parent nodes to forward data, the trend of load balancing is found.
And 2.6, calculating the forward forwarding probability of the 6LoWPAN sensing node or the 6LoWPAN relay node and the 6LoWPAN alternative parent node.
Step 3, constructing dynamic coverage tree
Step 3.1 determines the number of layers (i.e. hops) each 6LoWPAN sensor node unicast can reach.
Step 3.2 determining forward transmission probability
Figure BDA0002375316840000083
Srj∈Prt(Si)，Prt(Si) Is a collection of alternative parent nodes.
Step 3.3 updates the forward transmission probability of the 6LoWPAN aware node. At the same time, the expected load applied by these 6LoWPAN aware nodes to the 6LoWPAN alternative parent node is computed.
And 3.46 moving the LoWPAN relay node to the IPv6 relay node positioned at the lower layer number from bottom to top. For a 6LoWPAN relay node at the same tier, the 6LoWPAN nodes with more alternative parent nodes will move first. The calculation loop is repeated until all 6LoWPAN nodes are completely moved.
Step 3.5 calculates the forwarding probability and load expectation over a certain fixed time, depending on the sampling frequency of the given WSN.
Step 3.6 after the end of each calculation phase, if an IPv6 node is to send the sensed data to the base station, a random number RND e (0,1) is randomly generated using roulette's selection to determine which 6LoWPAN alternative parent node is to be selected as the active node.
Step 3.7 the sensed data is forwarded to the base station BS via the selected node.
Examples
1. Experimental systems and procedures
In the monitoring area range of a 100m x 100m wireless sensor network, 64 information points are randomly deployed, and 50-500 unequal numbers of sensor nodes are arranged. Each node has a sensing range of 17.675 m. All sensor nodes are randomly arranged. Each experimental condition was simulated 30 times. The coverage problem of the sensor nodes of the wireless sensor network is as follows: the node cost (the minimum number of activated nodes) of all the information points covered deployment is the lowest. If the coverage area has redundant sensor nodes, turning off the sensor nodes and enabling the sensor nodes to enter a dormant state; if an information point is not covered due to the energy exhaustion of a certain sensor node, some nodes in a dormant state can be awakened to cover the information point.
The purpose of the Probabilistic Load Balancing (PLB) scheme is to achieve load balancing by adjusting the forwarding probability. Consider an arbitrary node S in the K layer (i.e., hop count K)iThe situation is. Assume that there are v alternative parent nodes, denoted Prt (S) by seti)＝{Sr1,Sr2,...,Srv}. At time τ' from SiThe forward (transmission) probability to the alternate parent node is expressed as:
Figure BDA0002375316840000091
wherein
Figure BDA0002375316840000101
And is
Figure BDA0002375316840000102
According to the structure of the dynamic overlay tree, the sensing node is on each leaf, that is, the sensing node has no child node. These sensing nodes are only responsible for the task of monitoring the independent information emitting point (DPOI) sending the sensed data. Therefore, the sensing node does not perform the task of relaying, so the energy consumption is very small. However, if only one sensing node covers a separate information emitting point (DPOI) (this sensing node is also called a key node), this point is not covered by other nodes, and when this key node runs out of energy, it will not be able to recover the lost coverage area. Therefore, to maximize network lifetime, S is usediAlternative father node S when working with perception noderj∈Qrt(Si) The forward forwarding probability of (c) is defined as:
Figure BDA0002375316840000103
wherein erj(τ') denotes the node S at time τrjThe residual energy of (d); e.g. of the typek(τ') denotes the node S divided at time τrjThe residual energy of the outer node, α is an index factor used to adjust the response strength of the energy/distance ratio curve, di,rjRepresents a node SrjThe forwarding distance of (a); di,kIndicating a node SrjThe forwarding distance of a certain external node; prt (S)i) A set of parent nodes representing v alternatives;
according to the energy consumption model employed in this paper, the perceived nodes consume less energy when perceived to the environment, while most of the energy is consumed in forwarding data, hi particular, the energy consumed during forwarding is exponentially proportional to the Euclidean distance of the two nodes, that is, the forwarding distance is exponentially proportional to the forward forwarding probability since a shorter forwarding path is preferentially employed, therefore, we use the square of the ratio of the node residual energy to the forwarding distance to represent the weight of a hop forwarding path between a parent node and a child node, i.e., α ≦ 2. after normalizing the weights of the paths, the forward forwarding probability can be derived from the definition of equation (13), it can be known that the closer a node and its candidate parent node are located, the more energy remains in the candidate parent node, and the higher the forward probability will forward its data to its candidate parent node.
For relay nodes, they do not perform the sensing task, and they are responsible for forwarding the sensing data received from the child nodes. The focus here is on the load balancing problem of forwarding data to an alternative parent node. Thus, the forward forwarding probability may be dynamically adjusted according to the estimated load of the alternate parent node. The load expects that the probability of a large alternative parent node acting as a relay to forward data decreases, and conversely, the probability of a small alternative parent node acting as a relay to forward data increases.
We normalize the remaining energy of the alternative parent node using the expected load before τ' of the forward forwarding probability involving the relay node. Involving the expected load, from the relay node S at a timeKTo other alternative parent node Srh∈Qrt(Sk) The weight of a jumped input path of (2) can be defined as follows:
Figure BDA0002375316840000111
wherein erh(τ') represents the candidate parent node S at time τrhβ denotes an exponential factor, Lexp (S)rhτ') denotes the candidate parent node S at time τrhLoad expectation of (2);
here, to improve the load balance of the alternative parent node, we have β ═ 4 according to the practical experience of repeated experiments, and each alternative parent node S can be further calculated by equation (14)rh∈prt(Sk) Weight deviation ofIs Dev (S)K,Srh,τ'))＝weight(SK,Srhτ') -weight where Dev (x) denotes the offset of x, weight denotes all candidate parent nodes SkIs received from the network. Note that min Dev is used herein to denote Prt(Sk) The one with the smallest weight deviation among all the alternative parent nodes. Then, the relay node SkForward to alternative parent node Srh∈Qrt(Sk) The probability of (d) can be defined as:
Figure BDA0002375316840000112
represented by the formula (15), SKWhen the positive weight deviation tendency of (2) is large, the node moves to the alternative parent node SrhThe forward forwarding probability of forwarding data may be large. Conversely, when the negative weight deviation is large, SkTrending alternative parent node SrhThe probability of forwarding the data will be small. In addition, since a weight bias is applied, when S iskAnd selecting an optimal parent node from the alternative parent nodes to forward data, and finding out the trend of load balancing. The forward forwarding probability of the alternative parent node, either as a sensing node or as a relay node, may be in accordance with equation (13) or equation (15)
And (6) calculating. This probabilistic assignment is suitable for wireless sensor networks WSNs, since this scheme can operate on each sensing node individually, rather than on a central node or base station that requires significant computing power and power.
At the beginning of building the dynamic coverage tree, each sensor node first needs to know the number of layers (i.e., hops) that can be reached by unicast. The number of node hops in the vicinity of the base station BS is small. With the "hop count" information, the forward (transmission) probability and expected load will be updated as the number of hops decreases. Considering that the forward transmission probability is equal to a given value, this value is related to the number of alternative parent nodes, i.e.
Figure BDA0002375316840000121
Figure BDA0002375316840000122
Srj∈Prt(Si) Wherein Prt (S)i) Representing a set of parent nodes with v alternatives. First, the forward transmission probability of the sensing node is updated as in fig. 2. At the same time, the expected loads applied by these aware nodes to the alternate parent nodes are also computed. In the second step, the relay node moves to the relay node in the lower layer from bottom to top, as shown in fig. 2. For relay nodes at the same layer, nodes with more alternative parent nodes will move first. The computation loop is repeated until all nodes have been completely moved. Depending on the sampling frequency of a given WSN, the forwarding probability and load expectation may be calculated within some fixed time. In order to achieve a better monitoring effect, the monitoring method needs to be frequently updated when applied to safety monitoring. After the end of each calculation phase, if a node is to transmit the perceived data to the base station BS, a roulette selection is used to randomly generate a random number RND e (0,1) to determine which alternative parent node is to be selected as the active node. According to this procedure, the perceived data can be forwarded to the base station BS by the selected node.
As shown in fig. 3, ★ information node, ● 6LoWPAN wireless sensor node, ■ terminal sink node, ■ data transfer node,
Figure BDA0002375316840000123
a transmission path. Through calculation of the algorithm, around all information nodes, proper 6LoWPAN wireless sensor nodes are selected, then the most proper nodes are selected to serve as data transmission nodes, and sensed data are transmitted to the terminal nodes through the data transmission nodes through the optimal transmission paths obtained through calculation.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (7)

1. A method for realizing load balancing of IPv6 wireless sensor nodes based on 6LoWPAN is characterized in that:
step 1, setting 6LoWPAN sensing node
Definition when SiAlternative IPv6 father node S when working with 6LoWPAN aware nodesrj∈Prt(Si) The forward forwarding probability of (c) is defined as:
Figure FDA0002375316830000011
wherein erj(τ') denotes the node S at time τrjThe residual energy of (d); e.g. of the typek(τ') denotes the node S divided at time τrjThe residual energy of the outer node, α is an index factor used to adjust the response strength of the energy/distance ratio curve, di,rjRepresents a node SrjThe forwarding distance of (a); di,kIndicating a node SrjThe forwarding distance of a certain external node; prt (S)i) A set of parent nodes representing v alternatives; by definition, S is obtainediForward probability when a 6LoWPAN sensing node works;
step 2, calculating the forwarding probability of the 6LoWPAN relay node
Defining the time of day from the relay node SKAlternative parent node S to other IPv6rh；
Srh∈Qrt(SK) The weight of a jump input path of (2) is as follows:
Figure FDA0002375316830000012
wherein erh(τ') represents the candidate parent node S at time τrhβ denotes an exponential factor, Lexp (S)rhτ') denotes the candidate parent node S at time τrhLoad expectation of (2);
defining 6LoWPAN Relay node SkForward to IPv6 alternative parent node Srh∈Qrt(Sk) The probability of (c) is:
Figure FDA0002375316830000021
step 3, constructing dynamic coverage tree
Determining forward transmission probability
Figure FDA0002375316830000022
Srj∈Qrt(Si)；Prt(Si) Representing a set of parent nodes with v alternatives.
2. The method for implementing load balancing of IPv6 wireless sensor nodes based on 6LoWPAN according to claim 1, further comprising:
step 1, setting 6LoWPAN sensing node
Step 1.1, the square of the ratio of the residual energy of the 6LoWPAN node to the forwarding distance is adopted to represent the weight of a forwarding path between an IPv6 parent node and a child node;
step 1.2 definition of SiAlternative IPv6 father node S when working with 6LoWPAN aware nodesrj∈Prt(Si) Forward forwarding probability of;
step 1.3 Using the definitions, S is obtainediForward probability when a 6LoWPAN sensing node works;
step 1.4 dynamically adjusts the forward forwarding probability according to the load estimated by the 6LoWPAN alternative parent node.
3. The method for implementing load balancing of IPv6 wireless sensor nodes based on 6LoWPAN according to claim 1, further comprising:
step 2, calculating the forwarding probability of the 6LoWPAN relay node
Step 2.1, the expected load is used for standardizing the residual energy of the IPv6 alternative parent node;
step 2.2 define τ' as defining the slave relay node S at a timeKAlternative parent node S to other IPv6rh，Srh∈Qrt(SK) A weight of a jump input path;
step 2.3, each 6LoWPAN alternative father node S is calculated by using definitionrh∈Prt(SK) Has a weight deviation of Dev (S)k,Srh,τ'))＝weight(Sk,Srhτ') -weight where Dev (x) denotes the offset of x, weight denotes all IPv6 alternative parents SKThe average of the forwarding paths of (a);
step 2.4 define 6LoWPAN relay node SkForward to IPv6 alternative parent node Srh∈Qrt(Sk) The probability of (d);
Skwhen the positive weight deviation tendency of (2) is large, the node S is moved to the 6LoWPAN alternative parent node SrhThe forward forwarding probability of forwarding data is large; conversely, when the negative weight deviation is large, SkInclined IPv6 alternative parent node SrhThe probability of forwarding data will be small;
step 2.5 apply weight bias when SkWhen an optimal parent node of the 6LoWPAN alternative is selected to forward data, finding out the trend of load balance;
and 2.6, calculating the forward forwarding probability of the 6LoWPAN sensing node or the 6LoWPAN relay node and the 6LoWPAN alternative parent node.
4. The method for implementing load balancing of IPv6 wireless sensor nodes based on 6LoWPAN according to claim 1, further comprising:
step 3, constructing dynamic coverage tree
Step 3.1, determining the number of reachable layers (namely hop count) of unicast of each 6LoWPAN sensor node;
step 3.2 determining forward transmission probability
Figure FDA0002375316830000031
Srj∈Qrt(Si)；Prt(Si) A set of parent nodes representing v alternatives;
step 3.3, updating the forward transmission probability of the 6LoWPAN sensing node; at the same time, calculating the expected load applied by these 6LoWPAN aware nodes to the 6LoWPAN alternative parent node;
3.46 moving the LoWPAN relay node to an IPv6 relay node positioned at a lower layer number from bottom to top; for 6LoWPAN relay nodes on the same layer, 6LoWPAN nodes with more alternative parent nodes will move first; the calculation loop is repeated until all the 6LoWPAN nodes are completely moved;
step 3.5, calculating the forwarding probability and the load expectation in a certain fixed time according to the sampling frequency of the given WSN;
step 3.6 after the end of each calculation phase, if an IPv6 node is to send the sensed data to the base station BS, a random number RND e (0,1) is randomly generated using roulette's selection to determine which 6LoWPAN candidate parent node is to be selected as the active node;
step 3.7 the sensed data is forwarded to the base station BS via the selected node.
5. The method for implementing load balancing of IPv6 wireless sensor node based on 6LoWPAN according to claim 4, wherein: consider any node S in K layers, i.e. with a hop count of Ki(ii) a condition; assume that there are v alternative parent nodes, denoted Prt (S) by seti)＝{Sr1,Sr2,...,Srv}; at time τ' from SiThe forward (transmission) probability to the alternate parent node is expressed as:
Figure FDA0002375316830000041
Figure FDA0002375316830000042
wherein
Figure FDA0002375316830000043
And is
Figure FDA0002375316830000044
Figure FDA0002375316830000045
Sensing whether the node has a child node or not according to the structure of the dynamic overlay tree; the sensing nodes are only responsible for monitoring the task of sending the sensed data by the independent information sending points; therefore, the sensing node does not perform the relay task, so the energy consumption is very small; however, if only one sensing node covers the independent information sending point, the sensing node is also called a key node, the point is not covered by other nodes, and when the key node exhausts energy, the lost coverage area cannot be recovered; therefore, to maximize network lifetime, S is usediAlternative father node S when working with perception noderj∈Prt(Si) The forward forwarding probability of (c) is defined as:
Figure FDA0002375316830000046
wherein erj(τ') denotes the node S at time τrjThe residual energy of (d); e.g. of the typek(τ') denotes the node S divided at time τrjThe residual energy of the outer node, α is an index factor used to adjust the response strength of the energy/distance ratio curve, di,rjRepresents a node SrjThe forwarding distance of (a); di,kIndicating a node SrjThe forwarding distance of a certain external node; prt (S)i) Representing a set of parent nodes with v alternatives.
6. The method for implementing load balancing of IPv6 wireless sensor node based on 6LoWPAN according to claim 5, wherein: the forward forwarding probability is dynamically adjusted according to the load estimated by the alternative parent node, the probability that the alternative parent node with a large load is expected to serve as the relay for forwarding data is reduced, and on the contrary, the probability that the alternative parent node with a small load is expected to serve as the relay for forwarding data is increased;
normalizing the remaining energy of the alternative parent node using the expected load before τ' of the forward forwarding probability involving the relay node; involving the expected load, from the relay node S at a timeKTo other alternative parent node Srh∈Prt(Sk) The weight of a jumped input path of (2) can be defined as follows:
Figure FDA0002375316830000051
wherein erh(τ') represents the candidate parent node S at time τrhβ denotes an exponential factor, Lexp (S)rhτ') denotes the candidate parent node S at time τrhWhere we make β equal to 4 according to practical experience of repeated experiments in order to improve the load balance of the alternative parent node, each alternative parent node S can be further calculated by equation (14)rh∈prt(Sk) Has a weight deviation of Dev (S)K,Srh,τ'))＝weight(SK,Srhτ') -weight where Dev (x) denotes the offset of x, weight denotes all candidate parent nodes SkThe average of the forwarding paths of (a); denoted herein as min Dev at Prt(Sk) The one with the smallest weight deviation in all the alternative father nodes; then, the relay node SkForward to alternative parent node Srh∈Prt(Sk) The probability of (d) can be defined as:
Figure FDA0002375316830000052
minDev is denoted at Prt(Sk) The weight deviation of all 6LoWPAN alternative father nodes is the minimum;
represented by the formula (15), SKWhen the positive weight deviation tendency of (2) is large, the node moves to the alternative parent node SrhThe forward forwarding probability of forwarding data is large; conversely, when the negative weight deviation is large, SkTrending alternative parent node SrhThe probability of forwarding data will be small; this is achieved byIn addition, since the weight bias is applied, when S iskSelecting an optimal node from the alternative father nodes to forward data, wherein the trend of load balance can be found out; the forward forwarding probability of the alternative parent node, either as a sensing node or as a relay node, may be in accordance with equation (13) or equation (15)
Calculating to obtain; this probabilistic allocation is suitable for wireless sensor networks WSN, since it can operate on each sensing node individually, without the need to operate on a central node or base station BS that requires powerful computing power and power.
7. The method for implementing load balancing of IPv6 wireless sensor nodes based on 6LoWPAN according to claim 1, wherein: when a dynamic coverage tree is constructed, each sensor node firstly needs to know the number of layers which can be reached by unicast; the node hop count near the base station BS is small; with the "hop count" information, the forward (transmission) probability and expected load will be updated as the number of hops decreases; considering that the forward transmission probability is equal to a given value, this value is related to the number of alternative parent nodes, i.e.
Figure FDA0002375316830000061
Srj∈Prt(Si)，Prt(Si) Representing a set of all alternative parent nodes; firstly, updating the forward transmission probability of the sensing node; at the same time, the expected load applied by these sensing nodes to the alternative parent node is also calculated; secondly, the relay nodes are moved to the relay nodes with lower layers from bottom to top; for relay nodes on the same layer, nodes with more alternative father nodes will move first; the calculation loop is repeated until all the nodes are completely moved; depending on the sampling frequency of a given WSN, the forwarding probability and load expectation may be calculated within a certain fixed time; after the end of each calculation phase, if a node transmits the sensed data to the base station BS, the roulette selection is used to randomly selectGenerating a random number RND epsilon (0,1) to determine which alternative parent node is to be selected as the active node; according to this procedure, the perceived data can be forwarded to the base station BS by the selected node.
CN202010063751.3A 2020-01-20 2020-01-20 IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN Active CN111093230B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010063751.3A CN111093230B (en) 2020-01-20 2020-01-20 IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010063751.3A CN111093230B (en) 2020-01-20 2020-01-20 IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN

Publications (2)

Publication Number Publication Date
CN111093230A true CN111093230A (en) 2020-05-01
CN111093230B CN111093230B (en) 2023-08-11

Family

ID=70399482

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010063751.3A Active CN111093230B (en) 2020-01-20 2020-01-20 IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN

Country Status (1)

Country Link
CN (1) CN111093230B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114866544A (en) * 2022-04-02 2022-08-05 中国人民解放军国防科技大学 Containerized micro-service load balancing method for CPU heterogeneous cluster in cloud edge environment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107197480A (en) * 2017-05-11 2017-09-22 重庆邮电大学 A kind of tree-shaped method for routing of low-consumption wireless Personal Area Network network based on IPv6
CN107396204A (en) * 2017-06-12 2017-11-24 江苏大学 A kind of P2P video request program node selecting methods based on linear programming and intensified learning
CN110418377A (en) * 2019-07-31 2019-11-05 重庆远感科技有限公司 A kind of LoRa wireless sensor network data dynamic load leveling regulation method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107197480A (en) * 2017-05-11 2017-09-22 重庆邮电大学 A kind of tree-shaped method for routing of low-consumption wireless Personal Area Network network based on IPv6
CN107396204A (en) * 2017-06-12 2017-11-24 江苏大学 A kind of P2P video request program node selecting methods based on linear programming and intensified learning
CN110418377A (en) * 2019-07-31 2019-11-05 重庆远感科技有限公司 A kind of LoRa wireless sensor network data dynamic load leveling regulation method

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
孙佳美 等: "无线传感网中基于均方差赋权法的路由协议", 《无线传感网中基于均方差赋权法的路由协议》 *
孙佳美 等: "无线传感网中基于均方差赋权法的路由协议", 《无线传感网中基于均方差赋权法的路由协议》, 15 February 2019 (2019-02-15) *
胡婷婷 等: "IPv6无线传感网负载均衡路由协议研究", 《计算机技术与发展》 *
胡婷婷 等: "IPv6无线传感网负载均衡路由协议研究", 《计算机技术与发展》, 23 June 2015 (2015-06-23) *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114866544A (en) * 2022-04-02 2022-08-05 中国人民解放军国防科技大学 Containerized micro-service load balancing method for CPU heterogeneous cluster in cloud edge environment
CN114866544B (en) * 2022-04-02 2023-10-03 中国人民解放军国防科技大学 CPU heterogeneous cluster-oriented containerized micro-service load balancing method in cloud edge environment

Also Published As

Publication number Publication date
CN111093230B (en) 2023-08-11

Similar Documents

Publication Publication Date Title
Khan et al. Fuzzy-TOPSIS based cluster head selection in mobile wireless sensor networks
Mazumdar et al. Distributed fuzzy approach to unequal clustering and routing algorithm for wireless sensor networks
Ali et al. An on-demand power and load-aware multi-path node-disjoint source routing scheme implementation using NS-2 for mobile ad-hoc networks
JP2007506337A (en) Routing method and portable terminal for executing the method in a wireless communication system
Dhumane et al. Fractional gravitational Grey Wolf optimization to multi-path data transmission in IoT
Nazi et al. Efficient communications in wireless sensor networks based on biological robustness
Vijarania et al. WSN based efficient multi-metric routing for IoT networks
Tarique et al. Minimum energy hierarchical dynamic source routing for mobile ad hoc networks
Gui et al. Joint network lifetime and delay optimization for topology control in heterogeneous wireless multi-hop networks
Nonita et al. Intelligent water drops algorithm-based aggregation in heterogeneous wireless sensor network
Sengul et al. A survey of adaptive services to cope with dynamics in wireless self-organizing networks
CN111093230A (en) IPv6 wireless sensor node load balancing implementation method based on 6LoWPAN
Kim et al. An energy-aware multipath routing algorithm in wireless sensor networks
Chaudhari et al. Multilayered distributed routing for power efficient MANET performance
AU2018101627A4 (en) An apparatus and method based on trust index of wireless node for multiple / best route discovery in the wireless sensor network platform.
Kute et al. Survey on QoS for multi-path routing protocols in mobile ad-hoc networks
Ramakrishnan et al. Mathematical modeling of routing protocol selection for optimal performance of MANET
Boyd et al. A collaborative wireless sensor network routing scheme for reducing energy wastage
Gelenbe et al. A power-aware routing algorithm
Kumar et al. A novel energy efficient geocast routing algorithm for mobile ad hoc networks
Ren et al. Energy saving ad-hoc on-demand distance vector routing for mobile ad-hoc networks
Chikh et al. Combination of greedy and compass approaches for efficient multipath geographic routing in wireless multimedia sensor networks
Srimanchari A Trust and Optimal Energy Efficient Data Aggregation Scheme for Wireless Sensor Networks Using Qgaoa
Chenchen et al. A new EAAODV routing protocol based on mobile agent
Vetrivelan An Efficient LWSP Technique in WSN with Shortest Path Routing for Less Latency in Data Transmission

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant