CN108965128A - A kind of DODAG building optimization algorithm based on RPL agreement - Google Patents
A kind of DODAG building optimization algorithm based on RPL agreement Download PDFInfo
- Publication number
- CN108965128A CN108965128A CN201810758169.1A CN201810758169A CN108965128A CN 108965128 A CN108965128 A CN 108965128A CN 201810758169 A CN201810758169 A CN 201810758169A CN 108965128 A CN108965128 A CN 108965128A
- Authority
- CN
- China
- Prior art keywords
- node
- dodag
- message
- added
- direct connection
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims abstract description 26
- 230000008569 process Effects 0.000 claims abstract description 21
- 230000005540 biological transmission Effects 0.000 claims abstract description 20
- 230000007246 mechanism Effects 0.000 claims abstract description 18
- 238000012360 testing method Methods 0.000 claims abstract description 12
- 230000009471 action Effects 0.000 claims abstract description 11
- 230000004083 survival effect Effects 0.000 claims abstract description 6
- 230000008447 perception Effects 0.000 claims abstract description 5
- 238000001514 detection method Methods 0.000 claims description 18
- 230000006870 function Effects 0.000 claims description 13
- 238000005259 measurement Methods 0.000 claims 1
- 238000005265 energy consumption Methods 0.000 description 9
- 230000008439 repair process Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000012790 confirmation Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 238000012546 transfer Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000007613 environmental effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 230000008263 repair mechanism Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/16—Multipoint routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/26—Special purpose or proprietary protocols or architectures
Abstract
A kind of DODAG building optimization algorithm based on RPL agreement, specifically includes the following steps: the node in S1:DODAG system uses the unreachable testing mechanism of neighbours, whether perception can be connected to the Survival of arrival with the neighbor node of its direct connection to carry out the building of DODAG system；Node in S2:DODAG system is communicated by the neighbor node of direct connection therewith with other nodes in system, some node is if it find that its all path failure between neighbor node, then start node homing action；S3: after the completion of the homing action of node, restart to execute S1 to carry out DODAG system building process.The algorithm can be effectively reduced system power dissipation in DODAG system building process, and can enhance runnability of the DODAG in interference environment, can reduce retransmission rate of the data in transmission process.
Description
Technical field
The present invention relates to a kind of, and the DODAG based on RPL agreement constructs optimization algorithm.
Background technique
The root node of DODAG initiates the overall situation of a DODAG system by the way of incremental DODAG VersionNumer
Repair operation, each node in Ergodic Theory, to generate a completely new DODAG VersionNumer version.New
In DODAG system, the node not limited by legacy version Rank value can be in new DODAG system according to OF and Rank
Deng recalculating its position in DODAG system.This mode has rebuild DODAG.Since which employs the overall situations to repair
The mode operated again, so, the power consumption penalty caused by system is relatively large.
Summary of the invention
In view of the above existing problems in the prior art, the present invention provides a kind of, and the DODAG building optimization based on RPL agreement is calculated
Method, which can be effectively reduced system power dissipation in DODAG system building process, and can enhance DODAG in interference environment
Runnability, retransmission rate of the data in transmission process can be reduced.
To achieve the goals above, the present invention provides a kind of DODAG building optimization algorithm based on RPL agreement, specific to wrap
Include following steps:
S1: carrying out the building of DODAG system based on RPL agreement, and wherein the node in DODAG system uses neighbours not
Up to testing mechanism, whether perception can be connected to the Survival of arrival with the neighbor node of its direct connection to carry out DODAG system
Building；
Node in S2:DODAG system is communicated by the neighbor node of direct connection therewith with other nodes in system, certain
A node is if it find that its all path failure between neighbor node, then start node homing action；
S3: after the completion of the homing action of node, restart to execute S1 to carry out DODAG system building process.
The invention proposes improvement DODAG in interference environment to construct prioritization scheme, when DODAG system receives interference,
The node of DODAG uses unreachable detection (the Neighbor Unreachability Detection) mechanism of neighbours, makes node sense
Know the Survival with the neighbor node of its direct connection, and then can detecte out its all path between neighbor node and whether may be used
It reaches.Some node is if it find that its all path failure between neighbor node, then start node homing action.The reset of node
After the completion of movement, restart to carry out DODAG system building process.So as to avoid in interference environment, DODAG root is by passing
Increase DODAG VersionNumer, initiates global repairs and operate, avoid and regenerate a new DODAG version, together
When, also avoid power consumption penalty caused by this global reparation operation.In DODAG system, the energy of control message transmission generation
It is to constitute the important component of routing algorithm consumption that consumption and data information, which calculate the energy consumption generated, and data information transfer generates
Energy consumption the energy consumption generated is calculated considerably beyond data, thus can significantly reduce energy consumption.The algorithm enhances DODAG dry
The runnability in environment is disturbed, retransmission rate of the data in transmission process is reduced.
As a preference, the unreachable testing mechanism of neighbours in the step S1 is IPv6 testing mechanism.
Further, it is unreachable in some node neighbours to be carried out in order to reduce unnecessary network flow, in the step S1
While detection, node also is occupied to neck and sends data packet, during the confirmation of neighbor node accessibility, between node continues not
Disconnected sends packet information to the neighbor node of caching link layer address, if not having packet information to be sent to neighbours in system
Node, the unreachable detection of neighbours will not also be sent.
The building process for carrying out DODAG system in the S1 based on RPL agreement is as follows:
Step 1: carrying out the building of DODAG system since DODAG root node, and DODAG root node is sent using broadcast mode
The DIO message of DODAG information is carried to the nodes X of direct connection therewith, after nodes X receives DIO message, DODAG system is added, and
DODAG root node is passed to after having handled the DIO message received, then the DAO information with nodes X prefix information；
Meanwhile the nodes X forwards the DIO message received to its next stage node Y, this is added by calculating in node Y
DODAG system simultaneously replys DAO message and gives even higher level of node X, and nodes X becomes the father node of node Y；And so on, DIO message by
Step is diffused into other nodes of DODAG system；For receiving the node of DIO message, if any DODAG is not added in it, that
, the node will calculate its to issue DIO information node path cost, pass through objective function OF constraint condition and function
The set of utilization measure calculates optimal path jointly, calculates and then decides whether that this DODAG system is added；When the section
After DODAG system is added in point, it is directed toward the routing of DODAG root node by calculating, and the node for sending DIO message to the node turns
Become the father node of the DODAG system of the node；Next, node calculates it to DODAG according to objective function OF in DODAG
The Rank of root node, then to his father's node reverts back DAO；
Step 2: if any DODAG system is not added in node Z, being also not received by the node of any DIO message,
Timing cycle is sent into DIS message to the neighbor node Y of its direct connection, the carrying around request with its direct connection node Y
The DIO message of DODAG information, but before some DODAG system is not added in node Y, node Y will not reply any letter
Breath, after node Y is added to some DODAG system, node Y-direction node Z sends DIO message, invites node Z that DODAG is added
System, and so on, until some DODAG system is added in the node, the message is received with the node Z of node Y direct connection
Afterwards, by calculating, this DODAG system is added and replys DAO message, node Y, node Y is given to become the father node of node Z, node Y
After having received the message from node Z, the routing iinformation of its own is added and is fused among the information received, so
Afterwards, the preferred father node X with node Y direct connection is sent by this DAO message, and so on, DODAG root node is by receiving and counting
The DAO message that each node is sent in calculation system has gradually obtained the prefix information of each node in DODAG system, meanwhile,
On this basis, routing iinformation downward step by step is formd.
The present invention, which has studied the sensor network in interference environment based on RPL Routing Protocol, improves the skill of DODAG building
The unreachable inspection of neighbours can be used in the part control message partial loss of DODAG system in the technical solution of art scheme, proposition
Survey mechanism, the Survival of perception and the neighbor node of its direct connection continue to construct DODAG system, it is possible to reduce when data are transmitted
The intermediate node number that node is passed through avoids the mode of system overall situation reparation operation, reduces node energy when data transmission
Consumption.
Detailed description of the invention
Fig. 1 is that the schematic diagram of message transmitting procedure is controlled in DODAG system building process in normal condition；
Fig. 2 is the schematic diagram for the basic process that DODAG is constructed in noiseless environment；
Fig. 3 is the schematic diagram for the basic process that DODAG is constructed in having interference environment.
Specific embodiment
Below with reference to embodiment, the invention will be further described.
A kind of DODAG building optimization algorithm based on RPL agreement, specifically includes the following steps:
S1: carrying out the building of DODAG system based on RPL agreement, and wherein the node in DODAG system uses neighbours not
Up to testing mechanism, whether perception can be connected to the Survival of arrival with the neighbor node of its direct connection to carry out DODAG system
Building；
Node in S2:DODAG system is communicated by the neighbor node of direct connection therewith with other nodes in system, certain
A node is if it find that its all path failure between neighbor node, then start node homing action；
S3: after the completion of the homing action of node, restart to execute S1 to carry out DODAG system building process.
The unreachable testing mechanism of neighbours in the step S1 is IPv6 testing mechanism.
In the step S1 while some node progress neighbours unreachable detection, node also is occupied to neck and sends data
Packet, during the confirmation of neighbor node accessibility, node continues the continual neighbor node hair to caching link layer address
Packet information is sent, if not having packet information to be sent to neighbor node in system, the unreachable detection of neighbours will not also be sent.
The building process for carrying out DODAG system in the S1 based on RPL agreement is as follows:
Step 1: carrying out the building of DODAG system since DODAG root node, and DODAG root node is sent using broadcast mode
The DIO message of DODAG information is carried to the nodes X of direct connection therewith, after nodes X receives DIO message, DODAG system is added, and
DODAG root node is passed to after having handled the DIO message received, then the DAO information with nodes X prefix information；
Meanwhile the nodes X forwards the DIO message received to its next stage node Y, this is added by calculating in node Y
DODAG system simultaneously replys DAO message and gives even higher level of node X, and nodes X becomes the father node of node Y；And so on, DIO message by
Step is diffused into other nodes of DODAG system；For receiving the node of DIO message, if any DODAG is not added in it, that
, the node will calculate its to issue DIO information node path cost, pass through objective function OF constraint condition and function
The set of utilization measure calculates optimal path jointly, calculates and then decides whether that this DODAG system is added；When the section
After DODAG system is added in point, it is directed toward the routing of DODAG root node by calculating, and the node for sending DIO message to the node turns
Become the father node of the DODAG system of the node；Next, node calculates it to DODAG according to objective function OF in DODAG
The Rank of root node, then to his father's node reverts back DAO；
Step 2: if any DODAG system is not added in node Z, being also not received by the node of any DIO message,
Timing cycle is sent into DIS message to the neighbor node Y of its direct connection, the carrying around request with its direct connection node Y
The DIO message of DODAG information, but before some DODAG system is not added in node Y, node Y will not reply any letter
Breath, after node Y is added to some DODAG system, node Y-direction node Z sends DIO message, invites node Z that DODAG is added
System, and so on, until some DODAG system is added in the node, the message is received with the node Z of node Y direct connection
Afterwards, by calculating, this DODAG system is added and replys DAO message, node Y, node Y is given to become the father node of node Z, node Y
After having received the message from node Z, the routing iinformation of its own is added and is fused among the information received, so
Afterwards, the preferred father node X with node Y direct connection is sent by this DAO message, and so on, DODAG root node is by receiving and counting
The DAO message that each node is sent in calculation system has gradually obtained the prefix information of each node in DODAG system, meanwhile,
On this basis, routing iinformation downward step by step is formd.
It is as follows that DODAG building process is carried out based on RPL agreement:
RPL distance vector network routing protocol manages message for network-control in system using state modulator technology
Frequency and quantity are limited, and the network topology of DODAG structure is completed in building, and realizing reduces system power dissipation, reduce network operation
Cost.Each node in DODAG based on RPL agreement can execute DODAG discovery, building and maintenance.RPL network protocol
ICMP v6 control message can be managed with management information, mutual DODAG can be exchanged with each other between node and node
Information constructs new DODAG network topology on this basis.Node uses DIS (DODAG Information
Solicitation (DODAG information request)) detect neighbouring DODAG.DIO(DODAG Information Object
(DODAG information object)) the RPL example information that carries node, it obtains the configuration parameter of DODAG, selects DODAG system interior joint
Father node set, meanwhile, retain the information of its DODAG.DAO (DestinationAdvertisement Object (purpose
Notice object in ground)) reverse routing iinformation of DODAG system can be propagated.The Rank value of each node can illustrate the node
Other opposite nodal distance information.Rank value is strictly gradually incremented by along routed path far from root node direction.Rank value
Along routed path, strictly gradually reduced close to root node direction.
The building of DODAG system is carried out since DODAG root node, as shown in Figure 1.DODAG root node uses broadcast mode
DIO message is sent to the node of direct connection therewith, propagates DODAG information.After being received with the neighbor node of root node direct connection, processing
Then the DIO message received forwards DIO message to its next stage node.And so on, DIO message is gradually diffused into DODAG
Other nodes of system.For receiving the node of DIO message, if any DODAG is not added in it, which will count
It is calculated to the path cost for issuing DIO information node, passes through the collection of objective function OF constraint condition and function utilization measure
It amounts to optimal path is calculated, calculates and then decide whether that this DODAG system is added.When DODAG is added in the node
Afterwards, it will calculate the routing for being directed toward DODAG root node, and the node for sending DIO message to the node is changed into the node
The father node of DODAG system.Next, node calculates it to DODAG root node according to objective function OF in DODAG
Rank, then to his father's node reverts back DAO (DestinationAdvertisement Object).
If any DODAG system is not added in node, it is also not received by the node of any DIO message, will periodically be followed
The circumferential neighbours with its direct connection send DIS (DODAG Information Solicitation) message, around request with
The DODAG information of its direct connection node, is calculated, and so on, until some DODAG system is added in the node.
DODAG root node uses broadcast mode, sends DIO (the DODAG Information for carrying DODAG information
Object) message, nodes X receive the DIO message that root node broadcast is sent, and DODAG system is added, after processing, then with section
The DAO message of point X prefix information, passes to DODAG root node.Nodes X by the DIO message containing DODAG information be sent to
Direct connection node, after receiving the message with the node Y of nodes X direct connection, through calculating, this DODAG system is added and replys
DAO message becomes the father node of node Y to nodes X, nodes X.Node Y has received DODAG information request information from node Z
DIS, but before some DODAG system is not added in node Y, node Y will not reply any information.Node Y is added to certain
After a DODAG system, node Y-direction node Z sends DIO message, invites node Z that DODAG system is added.With node Y direct connection
After node Z receives the message, by calculating, this DODAG system is added and replys DAO message, node Y, node Y is given to become section
The father node of point Z.After node Y has received the message from node Z, the routing iinformation of its own is added and is fused to receipts
Among the information arrived, then, the preferred father node X with node Y direct connection is sent by this DAO message.And so on, DODAG root
Node has gradually obtained each node in DODAG system by the DAO message received and each node is sent in computing system
Prefix information, meanwhile, on this basis, form routing iinformation downward step by step.
In interference environment, the building innovatory algorithm process of DODAG system is as follows:
In interference environment, due to DIO information drop-out, the topological structure of network will be caused to change.In DODAG system
In the process of initialization, between the node using each direct connection of RPL distance vector network routing protocol, mutually transmission DIO,
The controls such as DIS, DAO management message construction DODAG system will cause in DODAG building process, portion under the influence of environmental disturbances
Sub-control tubulation manages information drop-out, at this moment, child node may due to not getting the DIO message of optimal preferred father node,
To cause its DODAG edge lengths additionally to increase, which uses the calculated Rank value of objective function OF, will also increase therewith
Greatly, the transmission performance of the data information of DODAG system will decline.For this reason, cause in data and control information transmission
Transmission range and transmission delay in the process increases, and the energy consumption of system increases therewith.
In the environment not interfered with, the process of DODAG system is constructed as shown in Fig. 2.Nodes X uses broadcast mode,
DIO message is sent to the neighbor node of surrounding and its direct connection, then, node Z and node Y successively receive direct connection node A sending
DIO message, nodes X will gradually become the preferential father node of node Z and node Y.Meanwhile node Z and node Y respectively as with section
The direct coupled child node of point X, successively joined DODAG system.In this way, completing building DODAG in glitch-free environment
System.
Fig. 3 illustrates in interference environment, network topology Producing reason and influence.In figure, X, Y, Z are direct each other
The neighbor node of connection.Wherein, nodes X is the node for having been added to certain DODAG system.When data are transmitted among the nodes, by
To interference, there is data-bag lost situations.
When starting to construct DODAG system, the node of DODAG system is not added, using broadcast mode, to direct connection therewith
Node sends DIS message, to detect the node of surrounding with its direct connection, if having been added in some DODAG.It has been added in
The node of some DODAG system, by the node of all direct connections therewith, is adopted after the DIS information request for receiving its sending
With broadcast mode, DIO message is sent, in the DIO message, with the DODAG system information where the node.All and this DIO
After the node of sender of the message's direct connection receives its DIO message, it is calculated to the path cost for issuing DIO information node, calculates it
Afterwards, in that case it can be decided that this DODAG system is added, can also determine to remain stationary.If having been added to the node of DODAG system,
Within a period of time, be not received by from the DIS of its direct connection node request, which has waited a period of time in delay
Afterwards, using broadcast mode, DIO message is sent.It, which is calculated, by Trickle algorithm postpones the waiting time.
When DODAG system encounters noise jamming, therefore part control management message will lose, as shown in Figure 3.It is saving
Point X uses broadcast mode, and when transmission DIO message gives the neighbor node of its direct connection, node Y has received the DIO of nodes X transmission
Message, due to the influence of noise of interference environment, node Z is not timely received the DIO message of nodes X transmission, and node Y is added
After DODAG system, since node Z does not receive the DIO information of nodes X, so DODAG system can not be added.Node Y
It is added after DODAG system, postpones the regular hour, using broadcast mode, send DIO to the neighbor node of surrounding and its direct connection
Message, around DODAG system is added in the node of direct connection to node Y notice therewith.In this case, node Z has received node Y
The DIO message issued using broadcast mode, after calculating, node Y becomes the preferential father node of node Z, and node Z is added
DODAG system.At this point, there is very large deviation in DODAG grid topology and the network topology of noiseless ambient conditions.This is
Since node Z receives interference, the DIO message of nodes X broadcast transmission is not received.In interference environment, nodes X and node Z it
Between, the neighborhood of direct connection is not set up, data can not be directly transmitted.Data communication between nodes X and node Z, Zhi Nengtu
Through node Y.At this point, the data transmission of DODAG system and path delay increase, network power consumption is consequently increased.
Lead to such case Producing reason, is because node Z can not timely receive nodes X using broadcaster
Formula, the DIO message sended over.To cause between nodes X and node Z, the neighborhood of direct connection can not set up,
Data communication between nodes X and node Z is needed by node Y.So the energy consumption and transmission delay of DODAG system occur as soon as
The case where increase.
In interference environment, the topological structure recovery scenario of two kinds of DODAG systems
In interference environment, due to DIO information drop-out, the topological structure of network will be caused to change.Based on RPL agreement
DODAG system can using two ways carry out topological structure reparation.
RPL network protocol also supports the local topology repair mechanism within DODAG version.Using DODAG root plan
It can be the necessary parameter of DIO message sets when slightly implementing system configuration and control.
At this point, proposing a kind of method of reparation network topology to solve this problem.RPL network protocol can be using one kind
Whether external mechanism is no longer reachable to detect neighbours.The target of this mechanism is to safeguard Routing Adjacency using minimal-overhead, is adopted
Example with similar mechanism includes Neighbor Unreachability Detection (the unreachable detection of neighbours in IPv6
[RFC4861]) mechanism.
The process that whether can be reached between nodal test and determination and neighbours is referred to as the unreachable detection of neighbours
(Neighbor Unreachability Detection).The unreachable testing mechanism of neighbours pass through between node and neighbours whether
The state of arrival can be connected to describe the accessibility for illustrating node Yu direct connection neighbours.
Node in DODAG system is communicated by the neighbor node of direct connection therewith with other nodes in system, in system
Under environmental disturbances, it can interrupt and fail because of the reasons such as loss of data, control information failure.If destination node fails,
Then can not resume data transmission, the communication failure with destination node；If data transfer path fails, restoring communication is that have can
Can.Therefore, node can state of reachability of the active tracing data packet when being communicated with neighbor node.
Neighbours' inaccessibility all paths of the detection between node and neighbor node there is, including node-to-node,
Node is to router and router to the communicating data information between node.In this way, neighbor node or neighbour are detected
Occupy failure existing for the forward path of node.
If the node in DODAG system is most recently received confirmation message, the IP layer of neighbours has received is sent to it recently
Data packet, then the neighbours are reachable.RPL is only used for the routing of DODAG system, and the unreachable detection of neighbours can be used two
Kind method is confirmed: one is the prompt come from upper-layer protocol, providing the confirmation of " connection is being handled "；Another kind is node
Unicast Neighbor Solicitation message is sent, the neighbor advertisement message of response is had received.In order to reduce unnecessary network flow, detection disappears
Breath is only sent to the neighbor node with its direct connection.
The unreachable detection (NUD) of neighbours and certain node are carried out in DODAG system simultaneously and sends data packet to neighbor node
The two tasks.When DODAG system receives interference, by using unreachable detection (the Neighbor Unreachability of neighbours
Whether Detection) mechanism makes node can detecte out its all path between neighbor node reachable.If some node
It was found that its all path failure between neighbor node, then start node homing action.After the completion of the homing action of node, again
Start to carry out DODAG system building process.At this point, avoiding DODAG root by being incremented by DODAG VersionNumer, one is initiated
A global repair operates, and avoids and regenerates a new DODAG version.Meanwhile it also avoiding this global repair and operating
Caused by power consumption penalty.Runnability of the DODAG in interference environment is enhanced, re-transmission of the data in transmission process is reduced
Rate.
In DODAG system, it is to constitute road that the energy consumption and data information that control message transmission generates, which calculate the energy consumption generated,
The important component consumed by algorithm.The energy consumption that data information transfer generates calculates the energy generated considerably beyond data
Consumption.
Claims (4)
1. a kind of DODAG based on RPL agreement constructs optimization algorithm, which is characterized in that specifically includes the following steps:
S1: the building of DODAG system is carried out based on RPL agreement；Wherein the node in DODAG system is unreachable using neighbours
Whether testing mechanism, perception can be connected to the Survival of arrival with the neighbor node of its direct connection to carry out the structure of DODAG system
It builds；
Node in S2:DODAG system is communicated by the neighbor node of direct connection therewith with other nodes in system, some section
Point is if it find that its all path failure between neighbor node, then start node homing action；
S3: after the completion of the homing action of node, restart to execute S1 to carry out DODAG system building process.
2. a kind of DODAG based on RPL agreement according to claim 1 constructs optimization algorithm, which is characterized in that the step
The unreachable testing mechanism of neighbours in rapid S1 is IPv6 testing mechanism.
3. a kind of DODAG based on RPL agreement according to claim 1 or 2 constructs optimization algorithm, which is characterized in that institute
It states in step S1 while some node carries out neighbours' unreachable detection, also occupies node to neck and send data packet, in neighbours
During node accessibility confirms, node continues the continual neighbor node transmission data packet letter to caching link layer address
Breath, if not having packet information to be sent to neighbor node in system, the unreachable detection of neighbours will not also be sent.
4. a kind of DODAG based on RPL agreement according to claim 3 constructs optimization algorithm, which is characterized in that the S1
In based on RPL agreement carry out DODAG system building process it is as follows:
Step 1: carrying out the building of DODAG system since DODAG root node, and DODAG root node is sent using broadcast mode and carried
To the nodes X of direct connection therewith after nodes X receives DIO message, DODAG system is added, and locating in the DIO message of DODAG information
After having managed the DIO message received, then the DAO information with nodes X prefix information passed to DODAG root node；
Meanwhile the nodes X forwards the DIO message received to its next stage node Y, this DODAG is added by calculating in node Y
System simultaneously replys DAO message and gives even higher level of node X, and nodes X becomes the father node of node Y；And so on, DIO message gradually expands
It is scattered to other nodes of DODAG system；For receiving the node of DIO message, if any DODAG is not added in it, should
Node will calculate it to the path cost for issuing DIO information node, be utilized by objective function OF constraint condition and function
The set of measurement calculates optimal path jointly, calculates and then decides whether that this DODAG system is added；When the node adds
After entering DODAG system, it is directed toward the routing of DODAG root node by calculating, and the node for sending DIO message to the node is changed into
The father node of the DODAG system of the node；Next, node calculates it to DODAG root section according to objective function OF in DODAG
The Rank of point, then to his father's node reverts back DAO；
Step 2: if any DODAG system is not added in node Z, it is also not received by the node of any DIO message, will be determined
Shi Xunhuan sends DIS message to the neighbor node Y of its direct connection, believes around request with the carrying DODAG of its direct connection node Y
The DIO message of breath, but before some DODAG system is not added in node Y, node Y will not reply any information, save
Point Y is added to after some DODAG system, and node Y-direction node Z sends DIO message, invites node Z that DODAG system is added, with
This analogizes, and until some DODAG system is added in the node, after receiving the message with the node Z of node Y direct connection, passes through
It calculates, this DODAG system is added and replys DAO message, node Y, node Y is given to become the father node of node Z, node Y has received
After message from node Z, the routing iinformation of its own is added and is fused among the information received, then, by this DAO
Message is sent to the preferred father node X with node Y direct connection, and so on, DODAG root node is each in simultaneously computing system by receiving
The DAO message that a node is sent gradually has obtained the prefix information of each node in DODAG system, meanwhile, as according to
According to foring routing iinformation downward step by step.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810758169.1A CN108965128B (en) | 2018-07-11 | 2018-07-11 | DODAG construction optimization algorithm based on RPL protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810758169.1A CN108965128B (en) | 2018-07-11 | 2018-07-11 | DODAG construction optimization algorithm based on RPL protocol |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108965128A true CN108965128A (en) | 2018-12-07 |
| CN108965128B CN108965128B (en) | 2020-03-27 |
Family
ID=64482905
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810758169.1A Active CN108965128B (en) | 2018-07-11 | 2018-07-11 | DODAG construction optimization algorithm based on RPL protocol |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108965128B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109617812A (en) * | 2019-01-29 | 2019-04-12 | 广州大学 | A kind of RPL method for routing, device and network topology based on greed insertion |
| CN110932969A (en) * | 2019-12-10 | 2020-03-27 | 南方电网科学研究院有限责任公司 | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid |
| CN111049642A (en) * | 2019-12-30 | 2020-04-21 | 深圳供电局有限公司 | Power RPL (resilient packet logging) protocol black hole attack defense method based on cuckoo filter |
| CN111083775A (en) * | 2019-11-06 | 2020-04-28 | 重庆邮电大学 | IPv6 wireless sensor network time synchronization method based on RPL routing protocol |
| CN111935001A (en) * | 2019-05-13 | 2020-11-13 | 华为技术有限公司 | Path switching method, node and system |
| CN112153670A (en) * | 2019-06-28 | 2020-12-29 | 北方工业大学 | Energy-saving data aggregation method for wireless sensor network |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103262481A (en) * | 2010-12-17 | 2013-08-21 | 思科技术公司 | Dynamic reroute scheduling in a directed acyclic graph (DAG) |
| CN103648143A (en) * | 2013-12-23 | 2014-03-19 | 工业和信息化部电子工业标准化研究院 | Method and device for prolonging life of IPv6 (internet protocol version 6) wireless sensor network |
| CN103889021A (en) * | 2012-12-20 | 2014-06-25 | 中国移动通信集团公司 | Low power and lossy network member updating method and DODAG root node |
| CN104219239A (en) * | 2014-08-29 | 2014-12-17 | 南京邮电大学 | LoWPAN (low-power wireless personal area network) node secure access control method based on neighbor discovery |
| CN105050171A (en) * | 2015-07-20 | 2015-11-11 | 常州大学 | Improved algorithm for reducing power consumption of wireless sensor network node of farmland soil moisture content monitoring system based on RPL |
| CN106686659A (en) * | 2017-02-14 | 2017-05-17 | 重庆邮电大学 | AOMDV-based energy aware node-disjoint multipath routing algorithm |
| CN107920368A (en) * | 2016-10-09 | 2018-04-17 | 郑州大学 | RPL routing optimization methods based on life cycle in a kind of wireless sense network |
-
2018
- 2018-07-11 CN CN201810758169.1A patent/CN108965128B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103262481A (en) * | 2010-12-17 | 2013-08-21 | 思科技术公司 | Dynamic reroute scheduling in a directed acyclic graph (DAG) |
| CN103889021A (en) * | 2012-12-20 | 2014-06-25 | 中国移动通信集团公司 | Low power and lossy network member updating method and DODAG root node |
| CN103648143A (en) * | 2013-12-23 | 2014-03-19 | 工业和信息化部电子工业标准化研究院 | Method and device for prolonging life of IPv6 (internet protocol version 6) wireless sensor network |
| CN104219239A (en) * | 2014-08-29 | 2014-12-17 | 南京邮电大学 | LoWPAN (low-power wireless personal area network) node secure access control method based on neighbor discovery |
| CN105050171A (en) * | 2015-07-20 | 2015-11-11 | 常州大学 | Improved algorithm for reducing power consumption of wireless sensor network node of farmland soil moisture content monitoring system based on RPL |
| CN107920368A (en) * | 2016-10-09 | 2018-04-17 | 郑州大学 | RPL routing optimization methods based on life cycle in a kind of wireless sense network |
| CN106686659A (en) * | 2017-02-14 | 2017-05-17 | 重庆邮电大学 | AOMDV-based energy aware node-disjoint multipath routing algorithm |
Non-Patent Citations (1)
| Title |
|---|
| 邱杰: "基于IPv6的无线传感网络研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109617812A (en) * | 2019-01-29 | 2019-04-12 | 广州大学 | A kind of RPL method for routing, device and network topology based on greed insertion |
| CN109617812B (en) * | 2019-01-29 | 2021-04-23 | 广州大学 | Greedy embedding-based RPL routing method and device and network topology |
| CN111935001A (en) * | 2019-05-13 | 2020-11-13 | 华为技术有限公司 | Path switching method, node and system |
| CN112153670A (en) * | 2019-06-28 | 2020-12-29 | 北方工业大学 | Energy-saving data aggregation method for wireless sensor network |
| CN112153670B (en) * | 2019-06-28 | 2023-05-05 | 北方工业大学 | Energy-saving data aggregation method for wireless sensor network |
| CN111083775A (en) * | 2019-11-06 | 2020-04-28 | 重庆邮电大学 | IPv6 wireless sensor network time synchronization method based on RPL routing protocol |
| CN111083775B (en) * | 2019-11-06 | 2021-12-17 | 重庆邮电大学 | IPv6 wireless sensor network time synchronization method based on RPL routing protocol |
| CN110932969A (en) * | 2019-12-10 | 2020-03-27 | 南方电网科学研究院有限责任公司 | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid |
| CN110932969B (en) * | 2019-12-10 | 2021-10-22 | 南方电网科学研究院有限责任公司 | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid |
| CN111049642A (en) * | 2019-12-30 | 2020-04-21 | 深圳供电局有限公司 | Power RPL (resilient packet logging) protocol black hole attack defense method based on cuckoo filter |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108965128B (en) | 2020-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108965128A (en) | A kind of DODAG building optimization algorithm based on RPL agreement | |
| Clausen et al. | A critical evaluation of the IPv6 routing protocol for low power and lossy networks (RPL) | |
| Gaddour et al. | Co-RPL: RPL routing for mobile low power wireless sensor networks using Corona mechanism | |
| US8059620B2 (en) | Initiation of routing convergence by a mobile router in a mobile ad hoc network in response to reaching a minimum interval of stable relative proximity between at least one neighbor | |
| Sumathi et al. | Energy optimization in manets using on-demand routing protocol | |
| CN101951655B (en) | Reactive routing protocol based on geographic information in wireless sensor network | |
| JP5440591B2 (en) | Field wireless system | |
| CN103796271B (en) | A kind of IPv6 router redundancy methods suitable for tree-shaped wireless sense network | |
| CN104348659A (en) | Fault detection method and node for multi-hop network | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| Jin et al. | Expected transmission energy route metric for wireless mesh senor networks | |
| CN101478489B (en) | Method and system for controlling default routing notification by IS-IS protocol | |
| Son et al. | Evaluation of full-mesh networks for smart home applications | |
| Fonseca et al. | Beacon vector routing: Scalable point-to-point in wireless sensornets | |
| Liu et al. | Advanced Fast Recovery OLSR Protocol for UAV Swarms in the Presence of Topological Change | |
| Setty et al. | Comparative study of energy aware QoS for proactive and reactive routing protocols for mobile ad-hoc networks | |
| Kadhim et al. | Improving IoT applications using a proposed routing protocol | |
| Che-Aron et al. | An enhancement of fault-tolerant routing protocol for wireless sensor network | |
| Zhang et al. | Search-based adaptive routing strategies for sensor networks | |
| Heurtefeux et al. | AreaCast: A cross-layer approach for a communication by area in Wireless Sensor Networks | |
| US9450835B2 (en) | Method for turning off routers in a communications network and router implementing this method | |
| JP5299143B2 (en) | Node, node control method, and program | |
| Shih et al. | Multiple protocol transport network gateway for IoT systems | |
| Wang et al. | Improvement and optimization of a mobile multi-agent AODV routing protocol | |
| Jacobsen et al. | IP connected low power wireless personal area networks in the future internet |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240130 Address after: 230000 B-2704, wo Yuan Garden, 81 Ganquan Road, Shushan District, Hefei, Anhui. Patentee after: HEFEI LONGZHI ELECTROMECHANICAL TECHNOLOGY Co.,Ltd. Country or region after: China Address before: 33 Gehu Middle Road, Wujin District, Changzhou City, Jiangsu Province 213100 Patentee before: CHANGZHOU VOCATIONAL INSTITUTE OF ENGINEERING Country or region before: China |