CN104869604B - The number of plies type method for routing foundation of wireless sensor network based on RPL - Google Patents
The number of plies type method for routing foundation of wireless sensor network based on RPL Download PDFInfo
- Publication number
- CN104869604B CN104869604B CN201510313121.6A CN201510313121A CN104869604B CN 104869604 B CN104869604 B CN 104869604B CN 201510313121 A CN201510313121 A CN 201510313121A CN 104869604 B CN104869604 B CN 104869604B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster head
- plies
- cluster
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- 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/246—Connectivity information discovery
-
- 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
Abstract
An embodiment of the present invention provides a kind of number of plies type method for routing foundation of wireless sensor network based on RPL.This method includes：From the wireless sense network built according to RPL Routing Protocols, node is layered according to Rank value, chooses a certain number of cluster heads according to ad hoc rules in each layer；Cluster head to surrounding broadcast takes up the post of information after taking up the post of, other nodes decide whether that cluster is added；Node enters is added father node list after cluster by cluster head, and as suboptimum father node, thus whole network networking is completed.In data routing section, the heat transfer agent that itself is acquired is sent to cluster head by node, and the processing such as data fusion are completed by cluster head；Node receives the optimal father node that the data packet without fusion treatment is then sent directly to script, avoids secondary fusion.Each node can keep two father nodes, two routings, while fusion separately being transmitted with the data not merged, enhance network robustness, balance network load extends network lifecycle.
Description
Technical field
The present invention relates to wireless sensor network technology field more particularly to a kind of wireless sensor networks based on RPL
Number of plies type method for routing foundation.
Background technology
Wireless sensor network is to pass through radio communication by being deployed in a large amount of microsensor node in monitoring region
The self-organizing network system of the multi-hop formed, the purpose is to collaboratively perceive, acquire and handle in network's coverage area
The information of monitored target such as epidemic disaster information, and transmits these information to observer.These sensor nodes are low in energy consumption,
Transmission rate is low, processing capacity is low, energy reserve is low, and carries out data transmission by multi-hop.
It, often can not direct communication between node due to limited ability in wireless sensor network, it usually needs by
Source data is driven to destination node by intermediate node in a manner of multihop routing.This low-power consumption for wireless sense network damages
Network characteristic, IETF ROLL working groups have studied and defined RPL (Routing Protocol for Low-Power and
Lossy Networks, low-power consumption lossy networks Routing Protocol).RPL is a distance vector routing protocol, and node passes through interaction
Information forms directed acyclic graph, and then builds network topology.
In order to expand network size, aggregation node often chooses the high-performance node different from common sensing node, although
The network topology that RPL agreements generate can preferably ensure the stability of network, but since topology is tree topology, work as node
Intensive, when larger, topological depth can be relatively deep.And in network topology the relatively close aggregation node in position sensor node
The heat transfer agent around itself should be acquired, undertakes the task for the data packet that forwarding lower layer uploads again, therefore is easier too early
Exhaust energy.Once the sensor node on upper layer fails, whole network will will produce larger concussion.
Invention content
The embodiment provides a kind of number of plies type method for routing foundation of wireless sensor network based on RPL,
To improve the efficiency of the wireless sensor network based on RPL.
To achieve the goals above, this invention takes following technical solutions.
A kind of number of plies type method for routing foundation of the wireless sensor network based on RPL, including：
After the completion of wireless sensor network initializes, each node in the wireless sensor network broadcasts cluster outward
First challenge message carries the Rank value of the number of plies and node where node in the cluster head challenge message；
According to the cluster head challenge message that each node in each layer of the wireless sensor network receives, using pre-
Fixed cluster head competition mechanism determines the cluster head node in each layer；
Same layer includes each node rendezvous including cluster head node in same cluster, and node sends out the information itself acquired
Cluster head node in cluster where giving node, the information that the cluster head node acquires each node in cluster where itself carry out
After use processing, it is sent to the father node of the cluster head node.
Preferably, described after the completion of wireless sensor network initializes, each of described wireless sensor network
Node broadcasts cluster head challenge message outward, and the Rank value of the number of plies and node where node, packet are carried in the cluster head challenge message
It includes：
After the completion of wireless sensor network initializes, the node in the wireless sensor network is according to the Rank of itself
Value calculates the number of plies where itself, and judges whether the number of plies is more than 2, and the Rank value is according to node in the wireless sensor network
The relative position that root node is arrived in topology, is determined by residue energy of node and desired number of retransmissions；
When the number of plies is more than or equal to 2, then the node broadcasts cluster head challenge message outward, is taken in the cluster head challenge message
Rank value with the number of plies and node where node.
Preferably, the cluster head that each node in each layer according to the wireless sensor network receives is competing
Message is striven, the cluster head node in each layer is determined according to scheduled cluster head competition mechanism, including：
After node receives the cluster head challenge message from other nodes, the node starts timer, extracts the cluster head
The number of plies in challenge message and Rank value information, judge the number of plies in the cluster head challenge message whether with the number of plies where oneself
It is identical, if differing, ignore；If identical, Rank value and node that the node will carry in the cluster head challenge message
The Rank value of itself is compared；
When the Rank value carried in the cluster head challenge message is bigger than the Rank value of node itself, then the node continues
The cluster head challenge message that other nodes to be received are sent, when the Rank value carried in the cluster head challenge message is than node itself
Rank value is small or equal, then the node exits cluster head node competition, no longer receives the cluster head competition that other nodes are sent and disappears
Breath；
After the timing length of the timer, the Rank that is carried in the cluster head challenge message that the node receives
The Rank value being worth all than node itself is big, then the cluster head node of layer where the node becomes it.
Preferably, the same layer includes each node rendezvous including cluster head node in same cluster, including：
After the cluster head node of layer where the node becomes it, cluster head is broadcasted outward and takes up the post of message, which takes up the post of message
The middle number of plies and source address for carrying cluster head node；
Other nodes receive after the cluster head takes up the post of message, when the cluster head take up the post of the number of plies carried in message with it is other
The number of plies of node is identical, and the cluster head is with taking up the post of the source of the optimal father node of the source address and other nodes carried in message
Location is inconsistent, and the cluster where the cluster head node is added in other nodes not yet, then other nodes are to cluster head
Node transmits into cluster solicited message, and the number of plies and source address of other nodes are carried in the request into clusters information；
After the cluster head node receives the request into clusters information, when the layer for judging to carry in the request into clusters information
Number is in same layer with the cluster head node, and the source address carried in the request into clusters information is optimal with the cluster head node
The source address of father node is inconsistent, then is sent to other nodes and agree to that other nodes enter replying message for cluster；
After other nodes receive replying message from the cluster head node, then oneself state information is updated, by institute
It states cluster head node and father node list is added, as suboptimum father node.
Preferably, the method further includes：
After the completion of the number of plies type Route establishment in the wireless sensor network, node receives the number of lower level node upload
According to rear, the data whether fused mistake is judged, if fused mistake, sends said data to the optimal of the node
Father node；If the data, without fusion treatment, the suboptimum father node for sending said data to the node is merged
Processing.
Preferably, the method further includes：
When the father node of the cluster head node changes, the cluster head node broadcasts cluster head node resignation and disappears outward
It ceases, the number of plies and source address of the cluster head node is carried in the cluster head node resignation message；
After receiving the cluster head node resignation message with other nodes of cluster with the cluster head node, the cluster head is checked
The number of plies carried in node resignation message is identical with the number of plies where own node, is carried in the cluster head node resignation message
Source address is identical with the source address of the suboptimum father node of own node, then by the cluster head node from the routing iinformation of oneself node
In delete；
Each node in cluster where the cluster head node, which reopens, finds cluster head competition process, the cluster head node
The cluster head competition of next round is not participated in.
The embodiment of the present invention passes through based on RPL's it can be seen from the technical solution that embodiments of the invention described above provide
Hierarchical is route, and by being layered to network, selects cluster head node in each layer, using the directed acyclic graph characteristic of RPL,
It is possible to prevente effectively from loop.Meanwhile the data after fusion separately being transmitted with non-fused data, balanced node energy consumption, average net
Network flow load makes the robustness of whole network enhance, and extends network lifecycle.
The additional aspect of the present invention and advantage will be set forth in part in the description, these will become from the following description
Obviously, or practice through the invention is recognized.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Attached drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this
For the those of ordinary skill of field, without having to pay creative labor, other are can also be obtained according to these attached drawings
Attached drawing.
Fig. 1 is the signal of number of plies type route network topology in a kind of wireless sensor network provided in an embodiment of the present invention
Figure；
Fig. 2 is a kind of number of plies type Route establishment flow chart provided in an embodiment of the present invention；
Fig. 3 is that a kind of cluster head provided in an embodiment of the present invention finds flow chart.
Specific implementation mode
Embodiments of the present invention are described below in detail, the example of the embodiment is shown in the accompanying drawings, wherein from beginning
Same or similar element or element with the same or similar functions are indicated to same or similar label eventually.Below by ginseng
The embodiment for examining attached drawing description is exemplary, and is only used for explaining the present invention, and is not construed as limiting the claims.
Those skilled in the art of the present technique are appreciated that unless expressly stated, singulative " one " used herein, " one
It is a ", " described " and "the" may also comprise plural form.It is to be further understood that is used in the specification of the present invention arranges
It refers to there are the feature, integer, step, operation, element and/or component, but it is not excluded that presence or addition to take leave " comprising "
Other one or more features, integer, step, operation, element, component and/or their group.It should be understood that when we claim member
Part is " connected " or when " coupled " to another element, it can be directly connected or coupled to other elements, or there may also be
Intermediary element.In addition, " connection " used herein or " coupling " may include being wirelessly connected or coupling.Wording used herein
"and/or" includes any cell of one or more associated list items and all combines.
Those skilled in the art of the present technique are appreciated that unless otherwise defined, all terms used herein (including technology art
Language and scientific terminology) there is meaning identical with the general understanding of the those of ordinary skill in fields of the present invention.Should also
Understand, those terms such as defined in the general dictionary, which should be understood that, to be had and the meaning in the context of the prior art
The consistent meaning of justice, and unless defined as here, will not be with idealizing or the meaning of too formal be explained.
For ease of the understanding to the embodiment of the present invention, done further by taking several specific embodiments as an example below in conjunction with attached drawing
Explanation, and each embodiment does not constitute the restriction to the embodiment of the present invention.
Embodiment one
Combination RPL Routing Protocols of the embodiment of the present invention by build directed acyclic graph to establish the feature of stable topology,
Propose a kind of number of plies type routing mechanism based on RPL.
In wireless sensor network, each wireless sensor is as a node, the topology knot of wireless sensor network
Structure includes multilayer, and every layer includes multiple nodes.Number of plies type road in a kind of wireless sensor network provided in an embodiment of the present invention
By the schematic diagram of network topology as shown in Figure 1, being based on network topology shown in FIG. 1, one kind provided in an embodiment of the present invention is based on
The process flow of the number of plies type method for routing foundation of the wireless sensor network of RPL including following processing as shown in Fig. 2, walk
Suddenly：
Step 21：After the completion of netinit, the number of plies where node calculates itself according to the Rank value of itself, and judge layer
Whether number is more than 2.The number of plies is indicated with n：1<Rank/(256*n)<2
Rank value is the relative position that node arrives root node in network topology, and is followed strictly along downward path increasing
Greatly, otherwise the principle of reduction, Rank value arrive the dump energy of root node and desired number of retransmissions according to node in network topology
It determines.
Rank (N)=Rank (P)+RankIncrease
RankIncrease=α * RankIncreaseETX+β*RankIncreaseRE
RankIncreaseRE=step+MinHopInc
Step=MAXenergy-Nodeenergy
Wherein Rank (N) is the Rank value of present node, and Rank (P) is the Rank value of its father node, RankIncrease
For the increment of Rank, by RankIncreaseETXAnd RankIncreaseREIt codetermines, RankIncreaseETXIt is expected to retransmit
Increment, usually the expectation number of retransmissions of node, RankIncreaseREFor dump energy increment.
Parameter alpha and β can be configured according to practical application, and ETX (Expected Transmission Count) is it is expected
Number of retransmissions, RE (Remaining Energy) are dump energy.MAXenergyFor maximum node energy, usually sink nodes
Energy, NodeenergyFor present node energy.MinHopInc is constant, indicates minimum Rank amplification, is set as 256. wherein
RankIncreaseETX、MAXenergy、NodeenergyCalculating be discussed in detail in RFC6551, which is not described herein again.
Step 22：If the number of plies is more than or equal to 2, node broadcasts cluster head challenge message outward, is carried in the cluster head challenge message
The Rank value of the number of plies and node where node opens cluster head discovery mechanism.
Step 23：After cluster head node is taken up the post of, then the number of plies and the cluster head node source where carrying cluster head node are broadcasted outward
The cluster head of address takes up the post of information, other nodes receive after the cluster head takes up the post of information, first determine whether be in the cluster head node
Same layer, if not abandoned if same layer；If in same layer, judge whether itself has entered cluster, if not entering cluster, decision is
No addition cluster judges that the cluster head node of itself takes up the post of the cluster head node source in information with the cluster head received if having entered cluster
Whether address is same, if same, then cluster information is updated, if not the same then direct discarding.
Step 24：Node determines after some cluster is added, and cluster solicited message is transmitted into cluster head node, request into clusters letter
The number of plies and source address of other nodes are carried in breath.
After cluster head node receives the request into clusters information that other nodes are sent, the request into clusters letter is first determined whether
The number of plies carried in breath is in same layer with the cluster head node, if not abandoning the request into clusters information in same layer, if
In same layer, then according to the source address of the other nodes carried in request into clusters information, continue to judge whether other nodes are clusters
The optimal father node of first node agrees to institute if then recovery of node refuses its addition if it is not, then being sent to other nodes
It states other nodes and enters replying message for cluster；
Step 25：After other nodes receive replying message from cluster head node, if the information adhereed to, then update
Simultaneously father node list is added in cluster head node by oneself state information, as suboptimum father node；The information being added if refusal then weighs
The new cluster head discovery mechanism started in step 21.
By above step, the topology of number of plies routing, which is established, to be completed.
Remaining node is the bunch member node of cluster head node, if the optimal father when cluster head node and netinit of node
Node is not same, then this node can keep two father nodes
Embodiment two
The cluster head discovery mechanism in step 22 is described in detail in combination of embodiment of the present invention attached drawing 3, including following
Processing step：
Step 31：After node receives the cluster head challenge message from other nodes, the node starts timer, extracts institute
State the number of plies and Rank value information in cluster head challenge message, judge the number of plies in the cluster head challenge message whether with where oneself
The number of plies it is identical, if differing, ignore；If identical, Rank value that the node will carry in the cluster head challenge message
It is compared with the Rank value of node itself；
When the Rank value carried in the cluster head challenge message is bigger than the Rank value of node itself, then the node continues
The cluster head challenge message that other nodes to be received are sent, when the Rank value carried in the cluster head challenge message is than node itself
Rank value is small or equal, while (Received Signal Strength Indication are received the RSSI of the node
Signal strength) received signal strength be more than given threshold, then the node exit cluster head node competition, no longer receive other nodes
The cluster head challenge message of transmission.Wherein Rank is codetermined by Rank value and node adjacency degree, it is intended to select position in each layer
Relatively top and node that surrounding neighbours node is more is as cluster head.
Step 32：After the timing length of the timer, taken in the cluster head challenge message that the node receives
Rank value of the Rank value of band all than node itself is big, then the cluster head node of layer where the node becomes it.
Embodiment three
The embodiment of the present invention describes to cluster head rotation process in detail
When the father node of cluster head node changes, the cluster head node broadcasts cluster head node resignation message outward, should
The number of plies and source address of the cluster head node are carried in cluster head node resignation message；
After receiving the cluster head node resignation message with other nodes of cluster with the cluster head node, the cluster head is checked
The number of plies carried in node resignation message is identical with the number of plies where own node, is carried in the cluster head node resignation message
Source address is identical with the source address of the suboptimum father node of own node, then by the cluster head node from the routing iinformation of oneself node
In delete；
Each node in cluster where the cluster head node, which reopens, finds cluster head competition process, the cluster head node
The cluster head competition of next round is not participated in.
Example IV
Data routing is described in detail in the embodiment of the present invention
After the completion of the number of plies type Route establishment in the wireless sensor network, node receives the number of lower level node upload
According to rear, the data whether fused mistake is judged, if fused mistake, sends said data to the optimal of the node
Father node；If the data, without fusion treatment, the suboptimum father node for sending said data to the node is merged
Processing.
In conclusion the embodiment of the present invention is route by the hierarchical based on RPL, by being layered to network, every
Cluster head node is selected in one layer, using the directed acyclic graph characteristic of RPL, it is possible to prevente effectively from loop.Meanwhile by the number after fusion
It is separately transmitted according to non-fused data, balanced node energy consumption, averaging network flow load, the robustness of whole network is made to enhance,
Extend network lifecycle.
The present invention calculates Rank value on the basis of existing RPL Routing Protocols using two kinds of measurements of ETX and dump energy,
Rather than single route metric value, it can select the higher node of energy under the premise of ensureing network stabilization and serve as father node,
Equalising network energy consumption.Meanwhile the nodal hierarchy in network, a certain proportion of cluster head is selected, node can keep two fathers simultaneously
Fusion is separately transmitted with non-fused data, has reached equalising network and be responsible for, enhanced the purpose of network robustness, simultaneously by node
Loop is can effectively avoid using the directed acyclic graph of RPL.
One of ordinary skill in the art will appreciate that：Attached drawing is the schematic diagram of one embodiment, module in attached drawing or
Flow is not necessarily implemented necessary to the present invention.
As seen through the above description of the embodiments, those skilled in the art can be understood that the present invention can
It is realized by the mode of software plus required general hardware platform.Based on this understanding, technical scheme of the present invention essence
On in other words the part that contributes to existing technology can be expressed in the form of software products, the computer software product
It can be stored in a storage medium, such as ROM/RAM, magnetic disc, CD, including some instructions are used so that a computer equipment
(can be personal computer, server either network equipment etc.) executes the certain of each embodiment of the present invention or embodiment
Method described in part.
Each embodiment in this specification is described in a progressive manner, identical similar portion between each embodiment
Point just to refer each other, and each embodiment focuses on the differences from other embodiments.Especially for device or
For system embodiment, since it is substantially similar to the method embodiment, so describing fairly simple, related place is referring to method
The part of embodiment illustrates.Apparatus and system embodiment described above is only schematical, wherein the conduct
The unit that separating component illustrates may or may not be physically separated, the component shown as unit can be or
Person may not be physical unit, you can be located at a place, or may be distributed over multiple network units.It can root
According to actual need that some or all of module therein is selected to achieve the purpose of the solution of this embodiment.Ordinary skill
Personnel are without creative efforts, you can to understand and implement.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto,
Any one skilled in the art in the technical scope disclosed by the present invention, the change or replacement that can be readily occurred in,
It should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with scope of the claims
Subject to.
Claims (4)
1. a kind of number of plies type method for routing foundation of wireless sensor network based on RPL, which is characterized in that including：
After the completion of wireless sensor network initializes, it is competing that each node in the wireless sensor network broadcasts cluster head outward
Message is striven, the Rank value of the number of plies and node where node is carried in the cluster head challenge message；
According to the cluster head challenge message that each node in each layer of the wireless sensor network receives, utilization is scheduled
Cluster head competition mechanism determines the cluster head node in each layer；
Same layer includes each node rendezvous including cluster head node in same cluster, and the information that itself is acquired is sent to by node
Cluster head node in cluster where node, the information that the cluster head node acquires each node in cluster where itself is into row information
After fusion treatment, it is sent to the father node of the cluster head node；It is described after the completion of wireless sensor network initializes, it is described
Each node in wireless sensor network broadcasts cluster head challenge message outward, in the cluster head challenge message where carrying node
The Rank value of the number of plies and node, including：
After the completion of wireless sensor network initializes, the node in the wireless sensor network is according to the Rank value meter of itself
The number of plies where calculating itself, and judge whether the number of plies is more than 2, the Rank value is according to node in the wireless sensor network topology
In arrive the relative position of root node, determined by residue energy of node and desired number of retransmissions；
When the number of plies is more than or equal to 2, then the node broadcasts cluster head challenge message outward, and section is carried in the cluster head challenge message
The Rank value of the number of plies and node where point；Each node in each layer according to the wireless sensor network connects
The cluster head challenge message received determines the cluster head node in each layer according to scheduled cluster head competition mechanism, including：
After node receives the cluster head challenge message from other nodes, the node starts timer, extracts the cluster head competition
The number of plies in message and Rank value information, judge the number of plies in the cluster head challenge message whether with the number of plies phase where oneself
Together, if differing, ignore；If identical, the node by the Rank value carried in the cluster head challenge message and node from
The Rank value of body is compared；
When the Rank value carried in the cluster head challenge message is bigger than the Rank value of node itself, then the node continues waiting for connecing
The cluster head challenge message that other nodes are sent is received, as Rank of the Rank value carried in the cluster head challenge message than node itself
It is worth small or equal, then the node exits cluster head node competition, no longer receives the cluster head challenge message that other nodes are sent；
After the timing length of the timer, the Rank value carried in the cluster head challenge message that the node receives is all
Rank value than node itself is big, then the cluster head node of layer where the node becomes it.
2. the number of plies type method for routing foundation of the wireless sensor network according to claim 1 based on RPL, feature exist
Each node rendezvous including, the same layer includes cluster head node in same cluster, including：
After the cluster head node of layer where the node becomes it, cluster head is broadcasted outward and takes up the post of message, which, which takes up the post of in message, takes
The number of plies with cluster head node and source address；
Other nodes receive after the cluster head takes up the post of message, when the cluster head takes up the post of the number of plies carried in message and other nodes
The number of plies it is identical, the cluster head takes up the post of the source address of the optimal father node of the source address and other nodes carried in message not
Unanimously, and the cluster where the cluster head node is added in other nodes not yet, then other nodes are to cluster head node
Cluster solicited message is transmitted into, the number of plies and source address of other nodes are carried in the request into clusters information；
After the cluster head node receives the request into clusters information, when the number of plies that judges to carry in the request into clusters information with
The cluster head node is in same layer, and the source address carried in the request into clusters information and the optimal father of the cluster head node save
The source address of point is inconsistent, then is sent to other nodes and agree to that other nodes enter replying message for cluster；
After other nodes receive replying message from the cluster head node, then oneself state information is updated, by the cluster
Father node list is added in first node, as suboptimum father node.
3. the number of plies type method for routing foundation of the wireless sensor network according to claim 1 based on RPL, feature exist
In the method further includes：
After the completion of the number of plies type Route establishment in the wireless sensor network, node receives the data of lower level node upload
Afterwards, judge that whether the data fused mistake sends said data to the optimal father of the node if fused mistake
Node；If the data, without fusion treatment, the suboptimum father node for sending said data to the node carries out at fusion
Reason.
4. the number of plies type method for routing foundation of the wireless sensor network according to claim 1 based on RPL, feature exist
In the method further includes：
When the father node of the cluster head node changes, the cluster head node broadcasts cluster head node resignation message outward, should
The number of plies and source address of the cluster head node are carried in cluster head node resignation message；
After receiving the cluster head node resignation message with other nodes of cluster with the cluster head node, the cluster head node is checked
The number of plies carried in resignation message is identical with the number of plies where own node, the source carried in the cluster head node resignation message
Location is identical with the source address of the suboptimum father node of own node, then deletes the cluster head node from the routing iinformation of oneself node
Fall；
Each node in cluster where the cluster head node, which reopens, finds that cluster head competition process, the cluster head node are not joined
The cluster head of next round is added to compete.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510313121.6A CN104869604B (en) | 2015-06-09 | 2015-06-09 | The number of plies type method for routing foundation of wireless sensor network based on RPL |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510313121.6A CN104869604B (en) | 2015-06-09 | 2015-06-09 | The number of plies type method for routing foundation of wireless sensor network based on RPL |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104869604A CN104869604A (en) | 2015-08-26 |
| CN104869604B true CN104869604B (en) | 2018-08-10 |
Family
ID=53915023
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510313121.6A Expired - Fee Related CN104869604B (en) | 2015-06-09 | 2015-06-09 | The number of plies type method for routing foundation of wireless sensor network based on RPL |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104869604B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106488507A (en) * | 2015-08-27 | 2017-03-08 | 四川师范大学 | The Uneven Cluster sensor network energy cavity avoiding method of routing overhead shunting |
| JP6395977B2 (en) * | 2016-04-19 | 2018-09-26 | 三菱電機株式会社 | Wireless communication apparatus and wireless communication method |
| CN106255167B (en) * | 2016-08-31 | 2023-09-12 | 杭州鸿雁智能科技有限公司 | Wireless sensor network based on low-power consumption lossy network routing protocol |
| CN107920368A (en) * | 2016-10-09 | 2018-04-17 | 郑州大学 | RPL routing optimization methods based on life cycle in a kind of wireless sense network |
| CN108111418B (en) * | 2016-11-25 | 2020-07-21 | 电信科学技术研究院 | Communication system, data transmission method and node |
| WO2018098759A1 (en) * | 2016-11-30 | 2018-06-07 | 深圳天珑无线科技有限公司 | Method for selecting cluster head in distributed network, node, and system |
| CN110391995A (en) * | 2018-04-17 | 2019-10-29 | 华为技术有限公司 | A kind of RPL network load balancing method and device |
| CN114189898B (en) * | 2021-12-15 | 2023-07-18 | 重庆邮电大学 | IPv6 wireless sensor network point-to-point routing method based on RPL routing protocol |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN103702383A (en) * | 2014-01-09 | 2014-04-02 | 北京交通大学 | Clustering routing method of wireless sensor network |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
-
2015
- 2015-06-09 CN CN201510313121.6A patent/CN104869604B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360051A (en) * | 2008-07-11 | 2009-02-04 | 西安电子科技大学 | Energy efficient wireless sensor network routing method |
| CN103702383A (en) * | 2014-01-09 | 2014-04-02 | 北京交通大学 | Clustering routing method of wireless sensor network |
| CN104411000A (en) * | 2014-12-15 | 2015-03-11 | 南昌航空大学 | Method for selecting cluster head of hierarchical routing protocol in wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| 分层的无线传感器网络非均匀分簇路由算法;王桐;《黑龙江科技学院学报》;20130131;引言、第2.1节-第2.3节 * |
| 基于RPL的无线传感器网络分簇路由研究与实现;高筱菲;《中国优秀硕士学位论文全文数据库》;20150315;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104869604A (en) | 2015-08-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104869604B (en) | The number of plies type method for routing foundation of wireless sensor network based on RPL | |
| Sinwar et al. | Analysis and comparison of ant colony optimization algorithm with DSDV, AODV, and AOMDV based on shortest path in MANET | |
| CN107360612A (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| Robinson et al. | FPSOEE: Fuzzy-enabled particle swarm optimization-based energy-efficient algorithm in mobile ad-hoc networks | |
| CN107071850A (en) | A kind of improved AODV Routing Protocols for being suitable for different motion scene | |
| CN110324877A (en) | Relaying robot method for routing based on servo backbone network Yu Vikor multi-standard decision | |
| Manjhi et al. | Signal strength based route selection in MANETs | |
| Srinivasan et al. | REAQ-AODV: Route stability and energy aware QoS routing in mobile Ad Hoc networks | |
| CN107529196A (en) | A kind of method and system of the data transmission of internet of things based on dummy node | |
| Yu et al. | TTL-based efficient forwarding for nanonetworks with multiple coordinated IoT gateways | |
| CN106685822A (en) | Route determination method and device | |
| Bhatia et al. | AODV Based Congestion Control Protocols | |
| CN106851766A (en) | A kind of wireless sense network route method of high robust low latency | |
| CN103491596B (en) | A kind of micro power radio communication method | |
| CN103747497A (en) | Method of data download in wireless sensor network | |
| Chavan et al. | Event Based Clustering Localized Energy Efficient Ant Colony Optimization for Performance Enhancement of Wireless Sensor Network. | |
| Förster et al. | Machine learning across the WSN layers | |
| Pandey et al. | Efficient routing in mobile ad hoc networks based on awareness of link quality | |
| CN105791053B (en) | A kind of method for measuring connectivity of discontinuous connected network | |
| Srinivas | A soft computing approach for data routing in hospital area networks (HAN) | |
| Gunasekaran et al. | Resourceful and reliable routing selection scheme in MANET | |
| Sivakumar et al. | An energy efficient routing technique to improve the performance of wireless sensor network through adaptive tree based sink relocation | |
| Mhatre et al. | Performance analysis of prediction and priority based routing protocol for MANET's | |
| Gupta et al. | Power Saving Routing Protocol for Ad hoc Networks based on AODV | |
| Kumar et al. | A brief survey on energy efficient routing parameters protocols in WSN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180810 Termination date: 20190609 |