CN108174412A - A kind of RPL multi-path data transmission mechanisms of load balancing - Google Patents
A kind of RPL multi-path data transmission mechanisms of load balancing Download PDFInfo
- Publication number
- CN108174412A CN108174412A CN201810009671.2A CN201810009671A CN108174412A CN 108174412 A CN108174412 A CN 108174412A CN 201810009671 A CN201810009671 A CN 201810009671A CN 108174412 A CN108174412 A CN 108174412A
- Authority
- CN
- China
- Prior art keywords
- node
- optimal
- father
- collection
- data
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/10—Flow control between communication endpoints
- H04W28/14—Flow control between communication endpoints using intermediate storage
-
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of multi-path data transmission mechanisms of load balancing, belong to wireless sensor network field, which includes step：(1) optimal more father node collection of each node are selected according to data transmission cost, complete the initialization structure of network topology；(2) a kind of multi-path data assignment of traffic module is designed, it has been effectively combined a variety of measurements such as the child node quantity of radio link quality, residue energy of node, nodal cache occupancy and relay node, in the case where considering a variety of measurements, it can effectively reflect influence of the various measurements to weight, can accurately evaluate the specific behavior pattern in each path；(3) based on assignment of traffic module, a kind of traffic distribution strategy that can maximize balance network load is designed, to obtain optimal data transmission plan.The mechanism can maximumlly realize load balancing, and effectively balanced node energy consumption extends network lifetime and improves route reliability.
Description
Technical field
The present invention relates to wireless sensor network field, a kind of more particularly to multi-path data based on a variety of measurements passes
Defeated mechanism.
Background technology
In recent years, with the fast development of technology of Internet of things, low-power consumption lossy networks (Low Power and Lossy
Networks, LLN) as receiving research hotspot of concern.LLN has a wide range of applications scene, for example military investigation, ring
The fields such as border monitoring, Industry Control, smart home, health care, urban transportation and intelligent building.LLN is by a large amount of nothing
Line sensor node forms, and storage capacity, processing capacity and the energy of these nodes are limited, and the Radio Link between node
With damaging characteristic and unstability, therefore the features described above based on LLN and its prospect is widely applied, Internet engineering
Task groups (the Internet Engineering TaskForce, IETF) propose a kind of low-power consumption based on IPv6 and damage
Network routing protocol (IPv6RoutingProtocol for LLN, RPL).
RPL Routing Protocols are a kind of unipath routings, and node can only select optimal father's section in alternate parent
The forwarding of row data is clicked through, this is excessively single by the path for leading to structure, cannot be effectively balanced during data are transmitted
Network load, so as to be unfavorable for the performance transmitted and seriously affect network various aspects of data.After path meets with failure, RPL
It is repaired, but process needs rerun routine to monitor and establish path using local algorithm of repairing, inefficient, energy damage
It loses serious.In order to cope with the limitation of unipath routing, researcher proposes Multi-path route strategy.Multi-path route
Strategy allows the multiple father nodes of node simultaneous selection to transmit data parallel, improves the reliability of network, and reduce congestion.
Lodhi etc. proposes a kind of RPL data transmission mechanisms of interim multipath, is mainly used for alleviating network congestion.When
After relay node detects that network congestion occurs for its optimal father node, an alternate parent is selected to carry out data distribution, but logical
It crosses alternate parent and carries out data distribution, but can only temporarily solve network congestion, and the quantity of control packet can be increased, influence net
Network performance.
Zhang Zongjie etc. proposes a kind of parallel transmission that weight by path is carried out to data traffic on the basis of multipath
Scheme, core concept are dynamic for the data packet numbers received within the unit interval according to the difference and node of link-quality
Adjust the data traffic distribution of chain road, it is contemplated that path it is excessively single, it is impossible to effectively equally loaded.
Iova etc. proposes the multipath RPL Routing Protocols using node life expectancy as route metric standard, and combines stream
Amount allocation strategy is intended to make the energy consumption of each node identical so that the energy consumption of the bottleneck node on per paths reduces, so as to reach
To the purpose for extending network lifetime, but so that the energy consumption of each node is identical, do not meet practical scene.
Zhu Li ability etc. proposes a kind of RPL multi-path data distribution mechanisms of Energy Efficient, establishes one kind and meets reality
The node energy consumption models of scene measure the balancing energy degree of judgement network interior joint according to spread in energy degree, so as to
The effectively balanced energy consumption of nodes, but only consider the dispersion degree measurement of energy, other factors are not accounted for, are not had
Conducive to effective transmission of data packet.
Invention content
It is an object of the invention to overcome above-mentioned existing deficiency, it is proposed that a kind of RPL multi-path datas of load balancing
Transmission mechanism.
Technical scheme is as follows：
A kind of RPL multi-path data transmission mechanisms of load balancing, include the following steps：
S1：The initialization structure of optimal more father node collection completion network topologies of each node is selected according to data transmission cost
It builds；
S2：A kind of data traffic distribution module is designed, has been effectively combined radio link quality, node residual energy
A variety of measurements such as the child node quantity of amount, nodal cache occupancy and relay node；
S3：Based on assignment of traffic module, a kind of traffic distribution strategy that can maximize balance network load is proposed,
To obtain optimal data transmission plan.
Further, in step sl, select the specific method of the optimal father node collection of node for：
The selection of optimal more father node collection refers to during constructing network topology, calculates the data packet warp of source node respectively
The transmission cost of root node is successfully transferred to by each more father node collection.Transmission cost is smaller, then the priority of more father node collection
It is higher, using more father node collection of highest priority as optimal more father node collection of source node.
(1) calculate nodeiA data be bundled into the transmission cost that work(is transferred to its each more father node collection.
(2) data of each more father node collection of calculate node i are bundled into the transmission cost that work(is transferred to root node, wherein
C1≤C2≤···≤C|MPS(i)|。
(3) data packet for calculating source node is successfully transferred to end-to-end total biography of root node via each father node collection
Defeated cost.
CMPSi,MPS(i)=Ci,MPS(i)+RCi,MPS(i) (10)
More father node collection corresponding to the end-to-end total transmission cost minimum value of node i final choice are as its optimal more father's section
Point set.So far, optimal more father node collection selection courses of node i terminate.
Further, in step s 2, the specific method for establishing assignment of traffic standard is：
The initialization for completing network topology according to the optimal father node collection obtained in S1 first is built, then according to flow point
Source node and relay node are calculated with standard meter and its optimal father node concentrates the data traffic between each node to distribute measurement
Standard value.Data traffic distribution module has been effectively combined radio link quality, residue energy of node, nodal cache and has occupied
A variety of measurements such as rate and the child node quantity of relay node.
S11 is during constructing network topology, and each node of the optimal father node concentration of node i is according to current residual energy
Gauge calculates its life expectancy.
S12 is during constructing network topology, and each node of the optimal father node concentration of node i is respectively according to respective
Caching occupies size and calculates buffer occupancy, more so as to be conducive to the alternate parent that node i is avoided to be high load distribution
Data traffic.
In formula, current_buffer_occupancyj max_bufferRepresent that the current cache of node occupies greatly respectively
Small, largest buffered space, the largest buffered space of each node is identical in network.
For S13 during constructing network topology, each node that the optimal father node of node i is concentrated counts its sub- section respectively
The quantity of destination notice message (DestinationAdvertisement Object, DAO) that point is beamed back, you can worked as
The preceding child node quantity in connection status, so as to be conducive to avoid node i for the distribution of child node a fairly large number of father node compared with
More data traffics.
S14 is after network opens up initialization, and each node in optimal more father node collection CPS (i) is by its life expectancy, slow
The relevant informations such as occupancy and the quantity of its child node are deposited to be added in the option portion of DIO message, and above-mentioned letter will be carried
The DIO information of breath is broadcasted.
S15 node is are calculated according to receiving after its optimal more father node concentrates the DIO message of CPS (i) all node broadcasts
The data traffic allocation criterion value between each node is concentrated with optimal more father nodes.
In formula, CNjRepresent the child node number of node j, Rank represents the network depth value of node j.
Further, in step s3, the specific method based on assignment of traffic standard progress assignment of traffic is：
After the completion of constructing network topology, the size according to data traffic distribution module value carries out multi-path data flow
Distribution,
Constructing network topology is completed according to step S1 and S2 and obtains the route assignment standard value of every paths, according to data
The size of assignment of traffic module value obtains the weight size of every paths, finally carries out the distribution of multi-path data flow.
The allocation strategy specific method of this data traffic is as follows：
P (l (i, j))=W (l (i, j)) N (14)
In formula, l (i, j) represents the Radio Link between node i and the node j that its optimal more father node is concentrated, l (i, Pk)
Represent node i and optimal father node centralized node PkBetween Radio Link.In addition, metric (l (i, j)) represents node in formula
Route metric value between i and node j, | OMPS (i) | represent the node number that optimal more father nodes of node i are concentrated.P(l
(i.j)) quantity for the data packet distributed between i and the link of j, N are the data packet that node i needs forward.
Due to using the technology described above, the present invention has the following advantages：
In the present invention, during the selection of the optimal father node collection of the node, the data transmission cost of calculating
Consider the radio link quality of node and caused by caching packet loss factor, so as to effectively increase node
Receive the success rate of packet；Radio link quality, residue energy of node, nodal cache are considered in the assignment of traffic standard proposed
A variety of measurements such as occupancy and the child node quantity of relay node, can be effectively anti-in the case where considering a variety of measurements
Influence of the various measurements to weight is reflected, the specific behavior pattern in each path can be accurately evaluated, then, according to different
Weight is allocated flow, has reached balanced node energy consumption, extends the network life time and improves route reliability.
Description of the drawings
Fig. 1 is the constructing network topology process of RPL Routing Protocols in low-power consumption lossy networks.
Fig. 2 is the required multi-path data transmission mechanism network model of the present invention.
Fig. 3 is selected for the optimal father node collection of the present invention, assignment of traffic module, traffic distribution strategy flow chart.
Fig. 4 is the schematic diagram that the present invention carries out data packet transmission according to routing weights.
Specific embodiment
In order to which those skilled in the art is made to be better understood when the purpose of the present invention, technical solution and advantageous effect, below
It is completely described with attached drawing is illustrated in conjunction with specific embodiments.
RPL Routing Protocols use DIO, DAO in low-power consumption lossy networks as shown in Figure 1, and DIS control messages carry out network
The structure of topology.
It is the network model of multi-path data transmission mechanism as shown in Figure 2, the node in network model is divided into three types
Type：Source node, relay node and root node.In general, source node is only responsible for sending itself generation data packet, and relay node is responsible for
The data packet for sending the data packet of itself generation and child node being forwarded to send, root node realize the convergence process of data packet.Such as Fig. 2
Shown, S is source node, and all nodes in rectangular broken line frame are relay node, and D is root node.
It is the flow chart of multi-path data transmission mechanism as shown in Figure 3.As shown in the figure, the method for the present invention includes as follows
Step：
Step 1：The selection of optimal father node collection.The selection of optimal more father node collection refers in constructing network topology process
In, the data packet for calculating source node respectively is successfully transferred to the transmission cost of root node via each more father node collection.Transmit generation
Valency is smaller, then the priority of more father node collection is higher, using more father node collection of highest priority as the optimal more of source node
Father node collection.
(1) calculate nodeiA data be bundled into the transmission cost that work(is transferred to its each more father node collection, it is contemplated that section
The radio link quality of point and lead to the probability of packet loss due to caching, it is ensured that data packet is effectively transmitted, reduce congestion and
Improve the reliability of routing.
P in formulajlRepresent the radio link quality between node j and its most most father node centralized node l,Represent more fathers
Node centralized nodejThe probability of packet loss, MPS (i) occur due to caching) it is nodeiMore father node collection.
(2) data of each more father node collection of calculate node i are bundled into the transmission cost that work(is transferred to root node, wherein
C1≤C2≤···≤C|MPS(i)|, one data of expectation life expectancy and Successful transmissions of node are considered during calculating
The number of transmissions of father node collection is wrapped, can effectively extend the service life of network.
In formulaRepresent that a data packet of i is successfully transferred to root node via alternate parent j
Transmission cost, the size according to transmission cost are ranked up the priority of alternate parent, i.e. data transmission cost is smaller, standby
The priority for selecting father node is higher.C is learnt assuming that calculating1≤C2≤···≤C|MPS(i)|。The alternate parent j of node i
Life expectancy factor coefficient,
(3) data packet for calculating source node is successfully transferred to end-to-end total biography of root node via each father node collection
Defeated cost.
CMPSi,MPS(i)=Ci,MPS(i)+RCi,MPS(i) (17)
More father node collection corresponding to the end-to-end total transmission cost minimum value of node i final choice are as its optimal more father's section
Point set.So far, optimal more father node collection selection courses of node i terminate.
Step 2：A kind of multi-path data flow module is designed, first according to the optimal father node collection obtained in S1
The initialization structure of network topology is completed, source node and relay node and its optimal father are then calculated according to assignment of traffic standard meter
Data traffic distribution module value in set of node between each node.Data traffic distribution module is effectively combined
Radio link quality, residue energy of node, nodal cache occupancy and relay node a variety of measurements such as child node quantity.
(1) during constructing network topology, each node of the optimal father node concentration of node i is according to current residual energy
Gauge calculates its life expectancy.
(2) during constructing network topology, each node of the optimal father node concentration of node i is respectively according to respective
Caching occupies size and calculates buffer occupancy, more so as to be conducive to the alternate parent that node i is avoided to be high load distribution
Data traffic.
In formula, current_buffer_occupancyj max_bufferRepresent that the current cache of node occupies greatly respectively
Small, largest buffered space, the largest buffered space of each node is identical in network.
(3) during constructing network topology, each node that the optimal father node of node i is concentrated counts its sub- section respectively
The quantity of destination notice message (DestinationAdvertisement Object, DAO) that point is beamed back, you can worked as
The preceding child node quantity in connection status, so as to be conducive to avoid node i for the distribution of child node a fairly large number of father node compared with
More data traffics.
(4) after network opens up initialization, each node in optimal more father node collection CPS (i) is by its life expectancy, slow
The relevant informations such as occupancy and the quantity of its child node are deposited to be added in the option portion of DIO message, and above-mentioned letter will be carried
The DIO information of breath is broadcasted.
(5) node i is calculated according to receiving after its optimal more father node concentrates the DIO message of CPS (i) all node broadcasts
The data traffic allocation criterion value between each node is concentrated with optimal more father nodes.
In formula, CNjRepresent the child node number of node j, Rank represents the network depth value of node j.
Step 3：After the completion of completing constructing network topology according to step 1, the routing per paths is completed according to step 2
Allocation criterion value.According to Fig. 4, the size according to data traffic distribution module value carries out point of multi-path data flow
Match, the allocation strategy specific method of this data traffic is as follows：
P (l (i, j))=W (l (i, j)) N (21)
In formula, l (i, j) represents the Radio Link between node i and the node j that its optimal more father node is concentrated, l (i, Pk)
Represent node i and optimal father node centralized node PkBetween Radio Link.In addition, metric (l (i, j)) represents node in formula
Route metric value between i and node j, | OMPS (i) | represent the node number that optimal more father nodes of node i are concentrated.P(l
(i.j)) quantity for the data packet distributed between i and the link of j, N are the data packet that node i needs forward.
Assuming that the network topology built by optimal more father node collection selection strategies is as shown in figure 4, wireless between its interior joint
The digital representation of chain road distributes module value for data traffic.In figure, optimal more father nodes of source node S integrate as O MPS
(S)={ A, B, C } learns metric (l (S, A))=3, metric (l (S, B))=3 and metric (l (S, C)) by calculating
=3, and total data traffic (data packet number) that source node needs are sent is 20, then distribute 20 on Radio Link l (S, A)
Data packets of 20 × [4/ (3+4+3)]=8 and wireless are distributed in × [3/ (3+4+3)]=6 data packets, Radio Link l (S, B)
20 × [3/ (3+4+3)]=6 data packets are distributed on link l (S, C).Similarly, node F distributes 8 × [1/ (3+1)]+6 × [3/
(3+1.5)]=6 data packets, node E difference 6+6 × [1.5/ (3+1.5)]=8 data packets and node H distribution 8 × [3/ (3
+ 1)]=6 data packet.
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (4)
1. a kind of RPL multi-path data transmission mechanisms of load balancing, it is characterised in that：This method includes the following steps：
S1：Optimal more father node collection of each node are selected according to data transmission cost, complete the initialization structure of network topology；
S2：Design a kind of data traffic distribution module, be effectively combined radio link quality, residue energy of node,
A variety of measurements such as nodal cache occupancy and the child node quantity of relay node；
S3：Based on assignment of traffic module, a kind of traffic distribution strategy that can maximize balance network load is proposed, to obtain
Obtain optimal data transmission plan.
2. a kind of RPL multi-path data transmission mechanisms of load balancing according to claim 1, it is characterised in that：It is described
The specific method of step S1 is：
The selection of optimal more father node collection refers to during constructing network topology, calculates the data packet of source node respectively via each
A more father node collection are successfully transferred to the transmission cost of root node；Transmission cost is smaller, then the priority of more father node collection is got over
Height using more father node collection of highest priority as optimal more father node collection of source node, is as follows：
S11：Calculate nodeiA data be bundled into the transmission cost that work(is transferred to its each more father node collection；
S12：One data of each more father node collection of calculate node i are bundled into the transmission cost that work(is transferred to root node, C1≤C2
≤···≤C|MPS(i)|；
S13：A data packet for calculating source node is successfully transferred to the end-to-end transmission generation of root node via each father node collection
Valency；
CMPSi,MPS(i)=Ci,MPS(i)+RCi,MPS(i) (3)
More father node collection corresponding to the end-to-end total transmission cost minimum value of node i final choice are as its optimal more father node
Collection, so far, optimal more father node collection selection courses of node i terminate.
3. a kind of RPL multi-path data transmission mechanisms of load balancing according to claim 2, it is characterised in that：It is described
The specific method of step S2 is：
The initialization for completing network topology according to the optimal father node collection obtained in S1 first is built, then according to assignment of traffic mark
Standard calculates source node and relay node and its optimal father node concentrates the data traffic between each node to distribute module
Value；Data traffic distribution module be effectively combined radio link quality, residue energy of node, nodal cache occupancy with
And a variety of measurements such as child node quantity of relay node；It is as follows：
S21：During constructing network topology, each node of the optimal father node concentration of node i is according to current remaining
Calculate its life expectancy；
S22：During constructing network topology, each node that the optimal father node of node i is concentrated delays respectively according to respective
It deposits and occupies size calculating buffer occupancy, more number is distributed so as to be conducive to the alternate parent that node i is avoided to be high load
According to flow；
In formula, current_buffer_occupancyj max_bufferRepresent that the current cache of node occupies size respectively, most
Big spatial cache, the largest buffered space of each node is identical in network；
S23：During constructing network topology, each node that the optimal father node of node i is concentrated counts its child node respectively
The quantity of destination notice message (DestinationAdvertisement Object, DAO) beamed back, you can obtain current
Child node quantity in connection status, so as to be conducive to avoid node i more for a fairly large number of father node distribution of child node
Data traffic；
S24：After network opens up initialization, each node in optimal more father node collection CPS (i) is by its life expectancy, caching
The relevant informations such as the quantity of occupancy and its child node are added in the option portion of DIO message, and will carry above- mentioned information
DIO information be broadcasted；
S25：Node i according to calculated after the DIO message for receiving its optimal more father node and concentrating CPS (i) all node broadcasts with
Optimal more father nodes concentrate the data traffic allocation criterion value between each node；
In formula, CNjRepresent the child node number of node j, Rank represents the network depth value of node j.
4. a kind of RPL multi-path data transmission mechanisms of load balancing according to claim 3, it is characterised in that：It is described
The specific method of step S3：
Constructing network topology is completed according to claim 1 and 2 and obtains the route assignment standard value of every paths；According to data flow
The size of amount distribution module value obtains the weight size of every paths, finally carries out the distribution of multi-path data flow, this
The allocation strategy specific method of data traffic is as follows：
P (l (i, j))=W (l (i, j)) N (7)
In formula, l (i, j) represents the Radio Link between node i and the node j that its optimal more father node is concentrated, l (i, Pk) represent
Node i and optimal father node centralized node PkBetween Radio Link；In addition, in formula metric (l (i, j)) represent node i with
Route metric value between node j, | OMPS (i) | represent the node number that optimal more father nodes of node i are concentrated, P (l
(i.j)) quantity for the data packet distributed between i and the link of j, N are the data packet that node i needs forward.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810009671.2A CN108174412A (en) | 2018-01-05 | 2018-01-05 | A kind of RPL multi-path data transmission mechanisms of load balancing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810009671.2A CN108174412A (en) | 2018-01-05 | 2018-01-05 | A kind of RPL multi-path data transmission mechanisms of load balancing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108174412A true CN108174412A (en) | 2018-06-15 |
Family
ID=62517472
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810009671.2A Pending CN108174412A (en) | 2018-01-05 | 2018-01-05 | A kind of RPL multi-path data transmission mechanisms of load balancing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108174412A (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110831067A (en) * | 2019-10-21 | 2020-02-21 | 阳光学院 | Method and device based on balanced routing and hybrid transmission |
| CN111385201A (en) * | 2020-03-17 | 2020-07-07 | 重庆邮电大学 | RPL routing method based on bidirectional father node decision |
| CN112153669A (en) * | 2019-06-28 | 2020-12-29 | 华为技术有限公司 | Data transmission method, device and equipment |
| CN112600753A (en) * | 2020-12-08 | 2021-04-02 | 广州技象科技有限公司 | Equipment node communication path selection method and device according to equipment access amount |
| CN113098669A (en) * | 2020-03-30 | 2021-07-09 | 深圳友讯达科技股份有限公司 | Communication failure processing method for improving communication success rate in multi-stage mesh network |
| CN113242586A (en) * | 2021-04-25 | 2021-08-10 | 重庆邮电大学 | Reliable link energy-saving-based mobile RPL routing method |
| CN114221872A (en) * | 2021-12-30 | 2022-03-22 | 电子科技大学 | Multi-metric fusion objective function construction method of routing protocol |
| CN114760529A (en) * | 2022-06-14 | 2022-07-15 | 苏州华兴源创科技股份有限公司 | Transmission method and device of multichannel video data and computer equipment |
| CN114900868A (en) * | 2022-05-12 | 2022-08-12 | 哈尔滨工业大学 | Data transmission method of unmanned aerial vehicle ad hoc network routing protocol based on energy optimization |
| CN116074242A (en) * | 2023-02-09 | 2023-05-05 | 重庆邮电大学 | Multipath joint scheduling method for TSCH network |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103338493A (en) * | 2013-05-31 | 2013-10-02 | 同济大学 | Adaptive multi-path route method based on RPL |
-
2018
- 2018-01-05 CN CN201810009671.2A patent/CN108174412A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103338493A (en) * | 2013-05-31 | 2013-10-02 | 同济大学 | Adaptive multi-path route method based on RPL |
Non-Patent Citations (3)
| Title |
|---|
| 姚玉坤等: "基于簇父集协作通信的低功耗有损网络路由算法优化", 《计算机应用》 * |
| 姚玉坤等: "集中式网络拥塞控制的高效RPL路由协议", 《系统工程与电子技术》 * |
| 张宗杰: "无线传感器网络RPL路由协议的优化与设计", 《中国学位论文全文数据库》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112153669B (en) * | 2019-06-28 | 2023-03-10 | 华为技术有限公司 | Data transmission method, device and equipment |
| CN112153669A (en) * | 2019-06-28 | 2020-12-29 | 华为技术有限公司 | Data transmission method, device and equipment |
| CN110831067A (en) * | 2019-10-21 | 2020-02-21 | 阳光学院 | Method and device based on balanced routing and hybrid transmission |
| CN110831067B (en) * | 2019-10-21 | 2022-03-29 | 阳光学院 | Method and device based on balanced routing and hybrid transmission |
| CN111385201A (en) * | 2020-03-17 | 2020-07-07 | 重庆邮电大学 | RPL routing method based on bidirectional father node decision |
| CN113098669A (en) * | 2020-03-30 | 2021-07-09 | 深圳友讯达科技股份有限公司 | Communication failure processing method for improving communication success rate in multi-stage mesh network |
| CN112600753A (en) * | 2020-12-08 | 2021-04-02 | 广州技象科技有限公司 | Equipment node communication path selection method and device according to equipment access amount |
| CN113242586A (en) * | 2021-04-25 | 2021-08-10 | 重庆邮电大学 | Reliable link energy-saving-based mobile RPL routing method |
| CN114221872A (en) * | 2021-12-30 | 2022-03-22 | 电子科技大学 | Multi-metric fusion objective function construction method of routing protocol |
| CN114900868A (en) * | 2022-05-12 | 2022-08-12 | 哈尔滨工业大学 | Data transmission method of unmanned aerial vehicle ad hoc network routing protocol based on energy optimization |
| CN114900868B (en) * | 2022-05-12 | 2022-11-25 | 哈尔滨工业大学 | Unmanned aerial vehicle ad hoc network routing protocol data transmission method based on energy optimization |
| CN114760529B (en) * | 2022-06-14 | 2022-09-27 | 苏州华兴源创科技股份有限公司 | Transmission method and device of multichannel video data and computer equipment |
| CN114760529A (en) * | 2022-06-14 | 2022-07-15 | 苏州华兴源创科技股份有限公司 | Transmission method and device of multichannel video data and computer equipment |
| CN116074242A (en) * | 2023-02-09 | 2023-05-05 | 重庆邮电大学 | Multipath joint scheduling method for TSCH network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108174412A (en) | A kind of RPL multi-path data transmission mechanisms of load balancing | |
| CN107959633A (en) | A kind of load balance method based on price mechanism in industry real-time network | |
| US8582470B2 (en) | Arrangement and method relating to network management | |
| CN112469100B (en) | Hierarchical routing algorithm based on rechargeable multi-base-station wireless heterogeneous sensor network | |
| Chen et al. | ProHet: A probabilistic routing protocol with assured delivery rate in wireless heterogeneous sensor networks | |
| CN104754688A (en) | Routing method for entangled state based wireless Mesh quantum communication network | |
| Forster et al. | CLIQUE: Role-free clustering with Q-learning for wireless sensor networks | |
| CN104883304B (en) | For part entangled quantum to the method for routing of bridge communications network | |
| CN113141592B (en) | Long-life-cycle underwater acoustic sensor network self-adaptive multi-path routing method | |
| CN107360612A (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| CN101965031A (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN112350949A (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| CN103297342A (en) | Energy-saving ZigBee network tree topology formation method | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN110932969B (en) | Advanced metering system AMI network anti-interference attack routing algorithm for smart grid | |
| Boukerche et al. | A taxonomy of routing protocols in sensor networks | |
| Peng et al. | Real-time transmission optimization for edge computing in industrial cyber-physical systems | |
| WO2014198120A1 (en) | Wireless mobile network data transmission method based on coverage maintenance and minimum spanning tree | |
| CN109309944A (en) | A kind of wireless multi-hop network topology discovery method | |
| Venkatasubramanian | Optimal Cluster head selection-based Hybrid Moth Search Algorithm with Tree Seed algorithm for multipath routing in WSN | |
| CN105120501A (en) | Green communication method with energy-renewable wireless Mesh network | |
| AM et al. | Design and Simulation of Energy Efficient Routing Protocols for Underwater Wireless Sensor Networks | |
| Khodabandeh et al. | Scalable Cluster-Based Path Planning for Timely Data Gathering in Wireless Sensor Networks | |
| Meshram et al. | Optimization of Multipath Routing for Delay and Data Integrity Using Clustering in Wireless Sensor Network | |
| Sampath et al. | Energy efficient routing strategies for large scale wireless sensor in heterogeneous 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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180615 |