CN116112974A - RPL route load balancing method based on route entry number - Google Patents

RPL route load balancing method based on route entry number Download PDF

Info

Publication number
CN116112974A
CN116112974A CN202310087697.XA CN202310087697A CN116112974A CN 116112974 A CN116112974 A CN 116112974A CN 202310087697 A CN202310087697 A CN 202310087697A CN 116112974 A CN116112974 A CN 116112974A
Authority
CN
China
Prior art keywords
node
alpha
neighbor node
neighbor
objective function
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.)
Pending
Application number
CN202310087697.XA
Other languages
Chinese (zh)
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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN202310087697.XA priority Critical patent/CN116112974A/en
Publication of CN116112974A publication Critical patent/CN116112974A/en
Pending legal-status Critical Current

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/0289—Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/0883—Load balancing or load distribution between entities in ad-hoc networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • 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)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention belongs to the technical field of IPv6 wireless sensor networks, and particularly relates to an RPL route load balancing method based on route entry numbers; the node which has added DODAG broadcasts DIO control message to all the neighbor nodes; the neighbor node updates the Rank value according to the received DIO control message, then adopts an objective function to determine an optimal father node and a suboptimal father node, and then adopts a load balancing method to enable the neighbor node to establish connection with the optimal father node or the suboptimal father node to be added into DODAG so as to realize load balancing among the routing nodes; the invention can slow down the advanced exhaustion of the node route resource to a certain extent, avoid the failure of establishing the downlink route caused by the advanced exhaustion of the route resource, avoid the network congestion caused by the simultaneous selection of the nodes as the optimal father node, and simultaneously establish a wireless sensor network with relatively balanced load so as to prolong the average service life of the whole network.

Description

RPL route load balancing method based on route entry number
Technical Field
The invention belongs to the technical field of IPv6 wireless sensor networks, and particularly relates to an RPL route load balancing method based on route entry numbers.
Background
Modern protocols of wireless sensor networks effectively support multi-hop upstream traffic from multiple sensors to acquisition points, which is a key function to implementing monitoring applications. However, scenarios involving low power wireless devices increasingly require support for downstream traffic, e.g., enabling a controller to issue braking commands based on monitored data. IETF Routing Protocols (RPL) for low power and lossy networks are one of the few protocols that address both traffic modes. Compared with the uplink flow, the support of the downlink flow is very unreliable and the efficiency is low.
For downstream traffic, RPL determines two distinct modes of operation: storage and non-storage. In the non-storage mode, the root is the only node in the network that has a routing table that maintains a global view on the network, learned from DAO packets that contain the DAO parent of each node. When sending a data packet, adopting a source route; the root calculates the end-to-end routing path and appends it to the packet as a complete list of transponders. In contrast, in storage mode, the routing states are distributed throughout the network; each node maintains a routing table listing the next hop forwarders of all descendants (nodes in the child DODAG) learned from the received DAO.
However, both modes have certain limitations, the storage mode allows for selection of more reliable routing paths, but can be impacted in large networks of resource constrained devices. The non-storage mode ameliorates this problem but causes overhead and unreliability due to the large number of headers associated with the source route. Therefore, the invention improves based on the RPL storage mode, designs a corresponding DODAG construction scheme, and expects to balance the resource consumption of nodes by constructing a network with relatively balanced load so as to construct a more reliable downlink routing path.
Disclosure of Invention
The invention provides an RPL route load balancing method based on route entry number, which can better support downlink flow, ensure the reliability and efficiency of the downlink flow, and relieve the problem of route resource early exhaustion caused by load unbalance in a storage mode, and specifically comprises the following steps:
s1, node x added with DODAG i Broadcasting DIO control message X to all its neighbor nodes i I=1, 2,..n, N represents the total number of nodes in the DODAG, node x i The broadcast DIO control message carries the own objective function, the number of routing entries, the path measurement information and the Rank value;
s2, receiving DIO control message X by neighbor node alpha i And judging whether DODAG is added or not; if not, executing the step S3, and if yes, executing the step S6;
s3, node x i As father set member of neighbor node alpha, and add node x in neighbor table of neighbor node alpha i Then step S4 is performed;
s4, combining DIO control message X i Updating the Rank value of the neighbor node alpha by the carried path measurement information, updating the route entry number of the neighbor node alpha, and executing step S5;
s5, determining an optimal father node and a suboptimal father node of the neighbor node alpha by adopting an objective function, and establishing connection between the neighbor node alpha and the optimal father node or the suboptimal father node by adopting a load balancing method to add DODAG, so that load balancing among routing nodes is realized;
s6, if the objective function of the neighbor node alpha and the DIO control message X i The objective function in the control message is consistent, and the DIO control message X is combined i Updating the Rank value of the neighbor node alpha by the carried path measurement information;
s7, if the updated Rank value of the neighbor node alpha is smaller than the Rank value before updating, a father node switching method is adopted to further optimize load balance among the routing nodes.
Further, the process of determining the optimal parent node and the suboptimal parent node of the neighbor node alpha by adopting the objective function comprises the following steps:
s11, the neighbor node alpha calculates objective function values of the neighbor node and each father set member according to the objective function;
s12, arranging all objective function values in an ascending order, selecting a parent integrator corresponding to the minimum objective function value as an optimal parent node of the neighbor node alpha, and selecting a parent integrator corresponding to the next-smallest objective function value as a suboptimal parent node of the neighbor node alpha;
s13, adding the IP addresses of the optimal parent node and the suboptimal parent node into the routing table of the neighbor node alpha.
Further, the neighbor node alpha adopts an objective function LBOF designed based on the number of route entries RE (PN α ) It is expressed as:
Figure BDA0004069313110000036
wherein P is m (PN α ) Path metric information representing the distance between a neighbor node alpha and its members of a parent set,
Figure BDA0004069313110000031
the number of routing entries stored by ancestor nodes representing a certain parent set member of neighbor node a,/>
Figure BDA0004069313110000032
Representing the number of route entries stored by the ancestor node of the neighbor node α; r represents the Rank value of the neighbor node α.
Further, a load balancing method is adopted to enable the neighbor node alpha to be connected with the optimal father node or the suboptimal father node to join in the DODAG process:
s21, obtaining the number of route entries stored by an ancestor node of the neighbor node alpha;
s22, obtaining the number of route entries stored in an ancestor node of an optimal parent node of the neighbor node alpha;
s23, obtaining the number of route entries stored in an ancestor node of the alpha suboptimal parent node of the neighbor node;
s24, calculating the probability that the optimal father node and the suboptimal father node of the neighbor node alpha are respectively selected as father nodes by adopting a father node probability formula based on the results obtained in the steps S21-S23; the neighbor node alpha combines the probability to select the optimal father node or the suboptimal father node to establish connection and add DODAG.
Further, the parent node probability formula is expressed as:
Figure BDA0004069313110000033
wherein P (LBOF) RE (PN α ) A) represents a probability that a parent node of the neighbor node alpha is selected as the parent node,
Figure BDA0004069313110000034
the number of route entries stored by ancestor nodes representing parent nodes of neighbor node α, +.>
Figure BDA0004069313110000035
Representing the number of route entries stored by the ancestor node of the neighbor node α.
Further, assuming that the neighbor node α has joined the DODAG, and receives DIO control messages sent by two or more nodes joined the DODAG, the parent node connected to the neighbor node α is referred to as a first parent node, the parent node not connected to the neighbor node α is referred to as a second parent node, and the process of optimizing load balancing between the routing nodes by adopting the parent node switching method in step S7 includes:
s31, calculating an objective function value between a neighbor node alpha and a sending node of a DIO control message received by the neighbor node alpha to obtain a first numerical value set;
s32, acquiring an objective function value Y1 between the neighbor node alpha and the current first father node, judging whether the objective function value smaller than the objective function value Y1 exists in the first numerical value set, if so, executing the step S33, and if not, executing the step S34;
s33, removing the information of the current first father node and the connected child nodes thereof from the routing table by the neighbor node alpha, adopting a transmitting node corresponding to the minimum objective function value in the first numerical value set as the first father node of the neighbor node alpha, and establishing a connection relation; deleting the minimum objective function value from the first value set to obtain a second value set, and then executing step S35;
s34, acquiring an objective function value Y2 between the neighbor node alpha and the current second father node; if the objective function value smaller than the objective function value Y2 exists in the second numerical value set, a sending node corresponding to the minimum objective function value in the second numerical value set is adopted as a second father node of the neighbor node alpha, and the neighbor node alpha updates the IP address of the second father node in the routing table;
s35, acquiring an objective function value Y2 between the neighbor node alpha and a current second father node; if the objective function value smaller than the objective function value Y2 exists in the first value set, a sending node corresponding to the minimum objective function value in the first value set is adopted as a second father node of the neighbor node alpha, and the neighbor node alpha updates the IP address of the second father node in the routing table.
Further, the calculation formula of the Rank value is:
Figure BDA0004069313110000041
Rank(α)＝Rank BASE (α)+Rank INC (α)
wherein C represents a fixed constant set by human, p=null represents that the neighbor node α has no parent node, P nbr =null indicates that the parent node of the neighbor node α has no neighbor node, LM indicates path metric information between the neighbor node α and its parent node, rank INC (alpha) represents the Rank increment value of the neighbor node alpha relative to its parent node, rank BASE (α) represents a Rank value of a parent node of the neighbor node α, and Rank (α) represents a Rank value of the neighbor node α after updating.
The invention has the beneficial effects that:
the invention improves based on the RPL storage mode, designs a corresponding DODAG construction scheme, and balances the resource consumption of nodes by constructing a network with relatively balanced load so as to construct a more reliable downlink routing path.
The invention can slow down the advanced exhaustion of the node route resource to a certain extent, avoid the failure of establishing the downlink route caused by the advanced exhaustion of the route resource, avoid the network congestion caused by the simultaneous selection of the nodes as the optimal father node, and simultaneously establish a wireless sensor network with relatively balanced load so as to prolong the average service life of the whole network.
Drawings
FIG. 1 is a general flow chart of an RPL route load balancing method based on the number of route entries;
FIG. 2 is a DIO control message format diagram of an RPL route load balancing method based on the number of route entries according to the present invention;
FIG. 3 is a diagram of a DAO control message format of an RPL route load balancing method based on the number of route entries according to the present invention;
fig. 4 is a diagram of a parent node selection example of an RPL routing load balancing method based on the number of routing entries according to the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In this embodiment, an RPL route load balancing method based on the number of route entries, a specific workflow is shown in fig. 1, and includes the following steps:
s1, node x added with DODAG i Broadcasting DIO control message X to all its neighbor nodes i I=1, 2,..n, N represents the total number of nodes in the DODAG, node x i The broadcast DIO control message carries the own objective function, the number of routing entries, the path measurement information and the Rank value;
specifically, as shown in fig. 2, the structure of the DIO control message includes an option type, an option length and a routing entry number in an option field of the DIO control message, and also includes Rank information, an objective function, path metric information, path weight information and the like.
S2, receiving DIO control message X by neighbor node alpha i And judging whether DODAG is added or not; if not, step S3 is executed, if yes,step S6 is performed;
specifically, the neighboring node α may receive DIO control messages sent by one or more nodes that have joined the DODAG.
Meanwhile, if the neighbor node alpha is added with DODAG, the Rank value of the neighbor node alpha is a positive integer, the specific value range is [1, n ], and the routing table contains father node information; if the neighbor node alpha is not added with DODAG, the Rank value is infinite, and the routing table does not contain father node information.
S3, node x i As father set member of neighbor node alpha, and add node x in neighbor table of neighbor node alpha i Then step S4 is performed;
s4, combining DIO control message X i Updating the Rank value of the neighbor node alpha by the carried path metric information, updating the route entry number and the path metric information of the neighbor node alpha, and executing step S5;
specifically, the Rank value of the neighbor node α is first updated using the following formula:
Figure BDA0004069313110000061
Rank(α)＝Rank BASE (α)+Rank INC (α)
wherein C represents an artificially set fixed constant, p=null represents that the neighbor node α has no parent node (the optimal parent node and the suboptimal parent node are collectively called parent nodes), and P nbr =null indicates that the parent node of the neighbor node α has no neighbor node, LM indicates path metric information between the neighbor node α and its parent node, rank INC (alpha) represents the Rank increment value of the neighbor node alpha relative to its parent node, rank BASE (α) represents a sum of Rank values of parent nodes of the neighbor node α, and Rank (α) represents a Rank value of the neighbor node α after updating.
S5, determining an optimal father node and a suboptimal father node of the neighbor node alpha by adopting an objective function, establishing connection between the neighbor node alpha and the optimal father node or the suboptimal father node by adopting a load balancing method, adding DODAG, and updating a Rank value of the neighbor node alpha by the neighbor node alpha to realize load balancing among the routing nodes;
specifically, the process of determining the optimal parent node and the suboptimal parent node of the neighbor node alpha by adopting the objective function comprises the following steps:
s11, the neighbor node alpha calculates objective function values of the neighbor node and each father set member according to the objective function;
s12, arranging all objective function values in an ascending order, selecting a parent integrator corresponding to the minimum objective function value as an optimal parent node of the neighbor node alpha, and selecting a parent integrator corresponding to the next-smallest objective function value as a suboptimal parent node of the neighbor node alpha;
s13, adding the IP addresses of the optimal parent node and the suboptimal parent node into the routing table of the neighbor node alpha.
Specifically, for the neighbor node α not added with the DODAG, since the DIO control message received by the neighbor node α contains the kind of the objective function used by the DIO control message, the neighbor node α not added with the DODAG can call the objective function used by the DIO control message to calculate, and in the present invention, the DIO control message adopts the objective function LBOF designed based on the number of routing entries RE (PN α ) It is expressed as:
Figure BDA0004069313110000071
wherein PN (Positive and negative) α A certain parent set member, P, representing a neighbor node alpha m (PN α ) Path metric information representing the path between the neighbor node alpha and the certain parent integrator,
Figure BDA0004069313110000072
the number of route entries stored by the upstream node or ancestor node of the parent set member representing neighbor node α,/>
Figure BDA0004069313110000073
Representing the number of route entries stored by the ancestor node of the neighbor node α; r represents the Rank value of the neighbor node α. LBOF RE (PN α ) The smaller the value, the parent set member PN of the neighbor node alpha α The better the link quality and the more adequate the routing table is.
The calculation expression of the path metric information is:
P m (PN α )＝Rank(PN α )+LM(PN α )
wherein Rank (PN) α ) Rank value, LM (PN), representing a member of a certain parent set of neighbor nodes α α ) A link metric representing the parent set member of neighbor node α.
Specifically, a load balancing method is adopted to enable the neighbor node alpha to be connected with the optimal parent node or the suboptimal parent node to join in the DODAG process:
s21, obtaining the number of route entries stored by an ancestor node of the neighbor node alpha;
s22, obtaining the number of route entries stored in an ancestor node of an optimal parent node of the neighbor node alpha;
s23, obtaining the number of route entries stored in an ancestor node of the alpha suboptimal parent node of the neighbor node;
s24, calculating the probability that the optimal father node and the suboptimal father node of the neighbor node alpha are respectively selected as father nodes by adopting a father node probability formula based on the results obtained in the steps S21-S23; the neighbor node alpha combines the probability to select the optimal father node or the suboptimal father node to establish connection and add DODAG.
The probability that the optimal parent node is selected as the parent node refers to the probability that the optimal parent node is selected as the parent node by the rest nodes in the DODAG and the nodes which are not added in the DODAG, namely, the probability that the optimal parent node is possibly connected with a plurality of child nodes is larger, which means that the more nodes with the optimal parent node as the parent node are selected, the more the optimal parent node is selected to be connected. The suboptimal parent node is the same.
The load balancing method avoids load unbalance caused by the fact that a certain node is simultaneously connected by a plurality of nodes serving as father nodes, when the neighbor node alpha selects the father node to connect and join the DODAG, the probability of the optimal father node and the suboptimal father node to be selected as the father node needs to be considered, corresponding weights are distributed according to the probability values of the optimal father node and the suboptimal father node, and the neighbor node alpha selects the optimal father node or the suboptimal father node to establish connection and join the DODAG according to a final result.
The probability of a node being selected as a parent node is related to its own number of routing entries, which reflect the load level. When a node receives a DAO message sent by a child node of the node, and adds related routing entries in a routing table of the node, the node can update the number of the routing entries in time; adding successfully in the routing table, adding one to the number of the routing entries, and adding failure, wherein the number of the routing entries is kept unchanged, and correspondingly, when the routing entries are removed in the routing table, the number of the routing entries is reduced; the higher the number of routing entries, the higher its load level.
Specifically, the parent node probability formula is expressed as:
Figure BDA0004069313110000081
wherein P (LBOF) RE (PN α ) A) represents a probability that a parent node of the neighbor node alpha is selected as the parent node,
Figure BDA0004069313110000091
the number of route entries stored by the ancestor node that represents the parent node of the neighbor node alpha,
Figure BDA0004069313110000092
representing the number of route entries stored by the ancestor node representing the neighbor node α.
S6, judging an objective function of the neighbor node alpha and a DIO control message X i If the objective functions in the two are consistent, combining with a DIO control message X i Updating the Rank value of the neighbor node alpha by the carried path measurement information, and entering S7; if not, the neighbor node alpha ignores the DIO control message X i 。
S7, judging whether the updated Rank value of the neighbor node alpha is smaller than the Rank value before updating, if yes, adopting a father node switching method to further optimize load balance among the routing nodes, and if not, ignoring the neighbor node alphaDIO control message X i 。
Specifically, it is assumed that a neighbor node α that has joined the DODAG receives DIO control messages sent by two or more nodes that have joined the DODAG, and a parent node to which the neighbor node α that has joined the DODAG is connected is referred to as a first parent node, and a parent node that is not connected is referred to as a second parent node; the process of optimizing load balancing among the routing nodes by adopting the parent node switching method in the step S7 comprises the following steps:
s31, calculating an objective function value between a neighbor node alpha and a sending node of a DIO control message received by the neighbor node alpha to obtain a first numerical value set;
s32, acquiring an objective function value Y1 between the neighbor node alpha and the current first father node, judging whether the objective function value smaller than the objective function value Y1 exists in the first numerical value set, if so, executing the step S33, and if not, executing the step S34;
s33, removing the information of the current first father node and the connected child nodes thereof from the routing table by the neighbor node alpha, adopting a transmitting node corresponding to the minimum objective function value in the first numerical value set as the first father node of the neighbor node alpha, and establishing a connection relation; deleting the minimum objective function value from the first value set to obtain a second value set, and then executing step S35;
s34, acquiring an objective function value Y2 between the neighbor node alpha and the current second father node; if the objective function value smaller than the objective function value Y2 exists in the second numerical value set, a sending node corresponding to the minimum objective function value in the second numerical value set is adopted as a second father node of the neighbor node alpha, and the neighbor node alpha updates the IP address of the second father node in the routing table;
s35, acquiring an objective function value Y2 between the neighbor node alpha and a current second father node; if the objective function value smaller than the objective function value Y2 exists in the first value set, a sending node corresponding to the minimum objective function value in the first value set is adopted as a second father node of the neighbor node alpha, and the neighbor node alpha updates the IP address of the second father node in the routing table.
Specifically, after the neighbor node alpha selects the optimal father node and the suboptimal father node (or after the neighbor node alpha added with DODAG selects the first father node and the second father node), the neighbor node alpha calculates path weight information through self remaining energy information and path measurement information, encapsulates the path weight information into a DAO control message, and respectively sends the DAO control message to the optimal father node and the suboptimal father node; after the optimal father node and the suboptimal father node of the neighbor node alpha receive the DAO control message, adding downlink route items from the optimal father node and the suboptimal father node to the neighbor node alpha in a route table of the optimal father node and the suboptimal father node, updating the number of the route items of the optimal father node and the suboptimal father node, storing path weight information carried by the DAO control message, and respectively generating DAO-ACK messages and returning the DAO-ACK messages to the neighbor node alpha.
The path weight information is used for selection of a downlink routing path, and the expression of the path weight information W (α) is as follows.
Figure BDA0004069313110000101
Figure BDA0004069313110000102
Wherein RER (alpha) is the residual energy of the neighbor node alpha, C E For the current energy of neighbor node alpha, INI E For the initial energy of the neighbor node alpha, W (alpha) is path weight information of the neighbor node alpha, LQI (alpha) is link quality between the neighbor node alpha and the father node, and lambda and gamma are variable constants.
Specifically, as shown in fig. 3, the structure of the DAO control packet includes an option type, an option length, a number of routing entries, rank information, and the like.
In one embodiment, the process of selecting the optimal parent node and the suboptimal parent node using the method of the present invention is described in detail based on FIG. 4. Assuming that node 11 and node 12 are not added with DODAG, after node 11 receives DIO control messages of node 5 and node 6 which are added with DODAG, node 11 selects an optimal father node and a suboptimal father node between node 5 and node 6, and node 5 and node 6 have no child node, so that the number of route entries (the number of route entries) of both nodes is 0; the father node connected with the node 5 is provided with the node 2 and the node 3, the father node connected with the node 6 is provided with the node 3, the node 3 only stores the route information of the node 5 and the node 6, but the node 2 needs to store the route information of the nodes 4, 5, 7, 8, 9 and 10, in order to balance the load, the node 11 selects the node 6 as the optimal father node, the node 5 as the suboptimal father node, and then the optimal father node or the suboptimal father node is selected through a father node probability formula and the like to establish connection to join DODAG.
After node 12 receives DIO control messages of node 7, node 8 and node 10 which have been added with DODAG, node 11 selects optimal father nodes and suboptimal father nodes among node 7, node 8 and node 10, and node 10 is not selected because the Rank value of node 10 is larger than the Rank values of node 7 and node 8; then node 7 has no child nodes, so the number of routing entries is 0; the node 8 needs to store the routing entries of the nodes 9 and 10, so the node 12 selects the node 7 as the optimal parent node, the node 8 as the suboptimal parent node, and then the optimal parent node or the suboptimal parent node is selected through a parent node probability formula and the like to establish connection to join the DODAG.
In the present invention, unless explicitly specified and limited otherwise, the terms "mounted," "configured," "connected," "secured," "rotated," and the like are to be construed broadly, and may be, for example, fixedly connected, detachably connected, or integrally formed; can be mechanically or electrically connected; either directly or indirectly through intermediaries, or in communication with each other or in interaction with each other, unless explicitly defined otherwise, the meaning of the terms described above in this application will be understood by those of ordinary skill in the art in view of the specific circumstances.
Although embodiments of the present invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made therein without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (7)

1. The RPL route load balancing method based on the route entry number is characterized by comprising the following steps:
s1, node x added with DODAG i Broadcasting DIO control message X to all its neighbor nodes i I=1, 2,..n, N represents the total number of nodes in the DODAG, node x i The broadcast DIO control message carries the own objective function, the number of routing entries, the path measurement information and the Rank value;
s2, receiving DIO control message X by neighbor node alpha i And judging whether DODAG is added or not; if not, executing the step S3, and if yes, executing the step S6;
s3, node x i As father set member of neighbor node alpha, and add node x in neighbor table of neighbor node alpha i Then step S4 is performed;
s4, combining DIO control message X i Updating the Rank value of the neighbor node alpha by the carried path measurement information, updating the route entry number of the neighbor node alpha, and executing step S5;
s5, determining an optimal father node and a suboptimal father node of the neighbor node alpha by adopting an objective function, and establishing connection between the neighbor node alpha and the optimal father node or the suboptimal father node by adopting a load balancing method to add DODAG, so that load balancing among routing nodes is realized;
s6, if the objective function of the neighbor node alpha and the DIO control message X i The objective function in the control message is consistent, and the DIO control message X is combined i Updating the Rank value of the neighbor node alpha by the carried path measurement information;
s7, if the updated Rank value of the neighbor node alpha is smaller than the Rank value before updating, a father node switching method is adopted to further optimize load balance among the routing nodes.
2. The RPL routing load balancing method based on the number of routing entries according to claim 1, wherein the process of determining the optimal parent node and the suboptimal parent node of the neighbor node α using the objective function comprises:
s11, the neighbor node alpha calculates objective function values of the neighbor node and each father set member according to the objective function;
s12, arranging all objective function values in an ascending order, selecting a parent integrator corresponding to the minimum objective function value as an optimal parent node of the neighbor node alpha, and selecting a parent integrator corresponding to the next-smallest objective function value as a suboptimal parent node of the neighbor node alpha;
s13, adding the IP addresses of the optimal parent node and the suboptimal parent node into the routing table of the neighbor node alpha.
3. The RPL route load balancing method based on the number of route entries according to claim 1 or 2, wherein the neighbor node α adopts an objective function LBOF designed based on the number of route entries RE (PN α ) It is expressed as:
Figure FDA0004069313090000021
wherein P is m (PN α ) Path metric information representing the distance between a neighbor node alpha and its members of a parent set,
Figure FDA0004069313090000022
the number of routing entries stored by ancestor nodes representing a certain parent set member of neighbor node a,/>
Figure FDA0004069313090000023
Representing the number of route entries stored by the ancestor node of the neighbor node α; r represents the Rank value of the neighbor node α.
4. The RPL route load balancing method based on the number of route entries according to claim 1, wherein the process of establishing connection between the neighbor node α and the optimal parent node or the suboptimal parent node to join in DODAG is performed by adopting a load balancing method:
s21, obtaining the number of route entries stored by an ancestor node of the neighbor node alpha;
s22, obtaining the number of route entries stored in an ancestor node of an optimal parent node of the neighbor node alpha;
s23, obtaining the number of route entries stored in an ancestor node of the alpha suboptimal parent node of the neighbor node;
s24, calculating the probability that the optimal father node and the suboptimal father node of the neighbor node alpha are respectively selected as father nodes by adopting a father node probability formula based on the results obtained in the steps S21-S23; the neighbor node alpha combines the probability to select the optimal father node or the suboptimal father node to establish connection and add DODAG.
5. The RPL routing load balancing method based on the number of routing entries of claim 4, wherein the parent node probability formula is expressed as:
Figure FDA0004069313090000024
wherein P (LBOF) RE (PN α ) A) represents a probability that a parent node of the neighbor node alpha is selected as the parent node,
Figure FDA0004069313090000025
the number of route entries stored by ancestor nodes representing parent nodes of neighbor node α, +.>
Figure FDA0004069313090000031
Representing the number of route entries stored by the ancestor node of the neighbor node α.
6. The RPL route load balancing method based on the number of route entries according to claim 1, wherein assuming that a neighbor node α has joined a DODAG and has received DIO control messages sent by two or more nodes joining the DODAG, a parent node to which the neighbor node α is connected is referred to as a first parent node, an unconnected parent node is referred to as a second parent node, and the process of optimizing load balancing between the route nodes by adopting the parent node switching method in step S7 includes:
s31, calculating an objective function value between a neighbor node alpha and a sending node of a DIO control message received by the neighbor node alpha to obtain a first numerical value set;
s32, acquiring an objective function value Y1 between the neighbor node alpha and the current first father node, judging whether the objective function value smaller than the objective function value Y1 exists in the first numerical value set, if so, executing the step S33, and if not, executing the step S34;
s33, removing the information of the current first father node and the connected child nodes thereof from the routing table by the neighbor node alpha, adopting a transmitting node corresponding to the minimum objective function value in the first numerical value set as the first father node of the neighbor node alpha, and establishing a connection relation; deleting the minimum objective function value from the first value set to obtain a second value set, and then executing step S35;
s34, acquiring an objective function value Y2 between the neighbor node alpha and the current second father node; if the objective function value smaller than the objective function value Y2 exists in the second numerical value set, a sending node corresponding to the minimum objective function value in the second numerical value set is adopted as a second father node of the neighbor node alpha, and the neighbor node alpha updates the IP address of the second father node in the routing table;
s35, acquiring an objective function value Y2 between the neighbor node alpha and a current second father node; if the objective function value smaller than the objective function value Y2 exists in the first value set, a sending node corresponding to the minimum objective function value in the first value set is adopted as a second father node of the neighbor node alpha, and the neighbor node alpha updates the IP address of the second father node in the routing table.
7. The RPL route load balancing method based on the number of route entries according to claim 1, wherein a calculation formula of a Rank value is:
Figure FDA0004069313090000041
Rank(α)＝Rank BASE (α)+Rank INC (α)
wherein C represents a fixed constant set by man, and p=null represents a neighboring nodeAlpha has no parent node, P nbr =null indicates that the parent node of the neighbor node α has no neighbor node, LM indicates path metric information between the neighbor node α and its parent node, rank INC (alpha) represents the Rank increment value of the neighbor node alpha relative to its parent node, rank BASE (α) represents a Rank value of a parent node of the neighbor node α, and Rank (α) represents a Rank value of the neighbor node α after updating.
CN202310087697.XA 2023-02-08 2023-02-08 RPL route load balancing method based on route entry number Pending CN116112974A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310087697.XA CN116112974A (en) 2023-02-08 2023-02-08 RPL route load balancing method based on route entry number

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310087697.XA CN116112974A (en) 2023-02-08 2023-02-08 RPL route load balancing method based on route entry number

Publications (1)

Publication Number Publication Date
CN116112974A true CN116112974A (en) 2023-05-12

Family

ID=86259454

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310087697.XA Pending CN116112974A (en) 2023-02-08 2023-02-08 RPL route load balancing method based on route entry number

Country Status (1)

Country Link
CN (1) CN116112974A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117097665A (en) * 2023-10-18 2023-11-21 杭州联芯通半导体有限公司 Father node selection method and device, electronic equipment and storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117097665A (en) * 2023-10-18 2023-11-21 杭州联芯通半导体有限公司 Father node selection method and device, electronic equipment and storage medium
CN117097665B (en) * 2023-10-18 2024-01-19 杭州联芯通半导体有限公司 Father node selection method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
CN109673035B (en) Route establishing and maintaining method suitable for wireless self-organizing network
Coutinho et al. EnOR: Energy balancing routing protocol for underwater sensor networks
US7551562B2 (en) Determining bidirectional path quality within a wireless mesh network
Elrahim et al. An energy aware WSN geographic routing protocol
US7369512B1 (en) Systems and methods for efficient packet distribution in an ad hoc network
US20060171344A1 (en) Wireless routing implementation
JP2006526937A (en) Optimal routing in ad hoc wireless communication networks
JP2007515906A (en) Cost determination in multi-hop networks
CN102984781B (en) Neighbor node judgment method for wireless ad hoc network route
KR20050043246A (en) Wireless communication system capable of optimized routing and a measuring method of network magnitude
CN108093457B (en) Route searching method and system for wireless ad hoc network
US20070053299A1 (en) Wireless communication terminal and QoS information collection method
CN116112974A (en) RPL route load balancing method based on route entry number
CN110831006B (en) Ad hoc network system and data transmission method thereof
JP2007135136A (en) Radio device and radio network system with radio device
CN106685819B (en) A kind of AOMDV agreement power-economizing method divided based on node energy
Bocchino et al. SPEED routing protocol in 6LoWPAN networks
Elappila et al. Dynamic survivable path routing for fast changing IoT network topologies
Tan et al. A distributed and dynamic data gathering protocol for sensor networks
Che-Aron et al. The enhanced fault-tolerant AODV routing protocol for wireless sensor network
Dong et al. A beacon-less geographic multipath routing protocol for ad hoc networks
Rahman et al. 4-N intelligent MANET routing algorithm
Xu et al. Finding the fastest path in wireless networks
CN108307411B (en) Mobile self-organizing network self-adaptive gateway selection method based on biological elicitation
Bhaskar et al. Performance analysis of efficient routing protocols to improve quality of service in wireless sensor networks

Legal Events

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