CN110831067B - Method and device based on balanced routing and hybrid transmission - Google Patents
Method and device based on balanced routing and hybrid transmission Download PDFInfo
- Publication number
- CN110831067B CN110831067B CN201910998243.1A CN201910998243A CN110831067B CN 110831067 B CN110831067 B CN 110831067B CN 201910998243 A CN201910998243 A CN 201910998243A CN 110831067 B CN110831067 B CN 110831067B
- Authority
- CN
- China
- Prior art keywords
- path
- component
- node
- link
- optimal
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
- H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
- H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- 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
The invention provides a method and a device based on balanced routing and hybrid transmission, wherein the method comprises the following steps: the path updating component updates the link cost of each path according to the current data link information; the load balancing component balances the load condition of the current whole link network; the traffic generation component collects link data at each link node according to a preset frequency to transmit the detected traffic data to a destination data sink; the optimal policy component maximizes the network lifecycle by parsing the optimal path for each node to minimize the power consumption of the greedy nodes. By the scheme, the network life cycle can be greatly improved, and the residual energy of the surviving nodes can be effectively utilized.
Description
Technical Field
The present invention relates to the field of link networks, and in particular, to a method and an apparatus based on balanced routing and hybrid transmission.
Background
As shown in fig. 1, the schematic diagram of a Cluster-based WSN (wireless sensor network) routing includes a Sink (Sink) and 80 clusters (Cluster), each Cluster Head (Cluster Head) manages sensor nodes, merges all sensed data in a Cluster, and sends collected packets to the Sink. To achieve uniform power utilization in the cluster, the ch (cluster head) with the largest remaining battery capacity may be selected. Assuming that the nodes are uniformly distributed, the transmission distance of each node is R, and the shortest path from each sensor to the receiver is determined by utilizing Dijkstra algorithm. Over the shortest path, each node sends sensed data through the forwarding node, where data packets are periodically generated to the target receiver. Assuming the link cost in each path is the same, Dijkstra's algorithm determines all shortest paths from CH to the data sink according to WSN deployment. In each time interval, each CH intermittently transmits its sensing data to the data sink.
After each network operation cycle, all nodes report to Sink, numbered 41, and the packets are forwarded through the four primary forwarding nodes on the SCA. Therefore, the statistical information of each node is estimated by Sink, and the number of forwarding packets of each node is generated and displayed by four blocks having different colors in fig. 1. These four blocks are associated with an SCA node number. According to our observation, the average packet forwarding rates of the four primary SCA nodes are not equal at all. It can be found that the sensed data of the blue color patches of the sensors 1-36 are mainly transmitted to the receiver through 5-14-23-32 paths. In terms of forwarding paths and power consumption rates, the behavior of the routing path has a power consumption rate of 36 at node 32 and 20 via nodes 40 and 42. Surprisingly, the power consumption rate through the node 50 remains only 4, and it clearly shows an unfair forwarding load in SCA. The power consumption ratio of node 32 to node 50 is 9, which is a high imbalance in power utilization. This is because Dijkstra's algorithm basically generates the first shortest path as the primary routing path without considering the energy consumption balance.
In WSN research, the lifetime of a network is typically defined as the number of operations before the first sensor node drains its battery. Ideally, a WSN can achieve a maximum lifecycle when the nodes in the SCA almost simultaneously deplete the power supply. This means that the remaining energy in the SCA is balanced as much as possible when the network system is not operational. However, since the highest power consuming sensor per data transmission cycle becomes the bottleneck in determining the lifetime of the entire network, achieving a uniform distribution of power usage among sensors to extend the network lifetime remains a significant challenge.
Disclosure of Invention
For this reason, it is necessary to provide a technical solution based on balanced routing and hybrid transmission to solve the problem of network life cycle extension due to uneven distribution of power usage among sensors in the WSN network.
To achieve the above object, the inventors provide an apparatus based on balanced routing and hybrid transport, the apparatus comprising a path updating component, a load balancing component, a traffic generating component and an optimal policy component;
the path updating component is connected with the load balancing component, the load balancing component is connected with the traffic generating component, and the traffic generating component is connected with the optimal strategy component;
the path updating component is used for updating the link cost of each path according to the current data link information; the path refers to link information from a sender to a receiver;
the load balancing component is used for balancing the load condition of the current whole link network;
the traffic generation component is configured to collect link data at each link node according to a preset frequency to transmit the detected traffic data to a destination data sink;
the optimal strategy component is used for minimizing the power consumption of the greedy node by analyzing the optimal path of each node, so that the life cycle of the network is maximized; the optimal path is a path obtained by updating the path updating component.
Further, the path updating component is configured to update the path of each link node when the neighboring node of the link node changes.
Further, the changing of the neighboring node comprises: nodes join or leave the current link network.
Further, the load balancing component is configured to balance the load condition of the current entire link network, including:
the load balancing component generates a first shortest path for each link node, and determines a second shortest path according to the generated first shortest path; the path length between the first shortest path and the second shortest path is the same.
Further, the optimal policy component is operative to determine an optimal path selection probability for each link node according to the following formulapiAnd mixed single-hop/multi-hop transmission probability qiAnd optimizing power consumption of the least greedy node:
s.t.0≤pi，qi≤1，i＝1...N
where n is the number of sensing nodes, Pi,1And Pi,2Is a power consumption value of node i that sends a packet to the receiver via a multi-hop policy for two unrelated shortest paths 1 and 2, and CiIs the power consumption value of sensor i.
The inventor also provides a method based on balanced routing and hybrid transmission, which is applied to a device based on balanced routing and hybrid transmission, and the device comprises a path updating component, a load balancing component, a traffic generation component and an optimal strategy component; the path updating component is connected with the load balancing component, the load balancing component is connected with the traffic generating component, and the traffic generating component is connected with the optimal strategy component;
the method comprises the following steps:
the path updating component updates the link cost of each path according to the current data link information; the path refers to link information from a sender to a receiver;
the load balancing component balances the load condition of the current whole link network;
the traffic generation component collects link data at each link node according to a preset frequency to transmit the detected traffic data to a destination data sink;
the optimal strategy component minimizes the power consumption of the greedy node by analyzing the optimal path of each node, so that the life cycle of the network is maximized; the optimal path is a path obtained by updating the path updating component.
Further, the method comprises:
the path update component updates the path of each link node when the neighboring node of the link node changes.
Further, the step of changing the neighboring node comprises: nodes join or leave the current link network.
Further, the load balancing component balancing the load condition of the current whole link network comprises:
the load balancing component generates a first shortest path for each link node, and determines a second shortest path according to the generated first shortest path; the path length between the first shortest path and the second shortest path is the same.
Further, the method comprises:
the optimal policy component determines an optimal path selection probability p for each link node according to the following formulaiAnd mixed single-hop/multi-hop transmission probability qiAnd optimizing power consumption of the least greedy node:
s.t.0≤pi，qi≤1，i＝1...n
where n is the number of sensing nodes, Pi,1And Pi,2Is a power consumption value of node i that sends a packet to the receiver via a multi-hop policy for two unrelated shortest paths 1 and 2, and CiIs the power consumption value of sensor i.
The invention provides a method and a device based on balanced routing and hybrid transmission, wherein the method comprises the following steps: estimating the total data capacity; requesting a memory block with a size matched with the estimated total data capacity, and dividing the memory block into a plurality of memory partitions; and receiving a plurality of service requests, and configuring the corresponding relation between each service request and the memory partition so as to call the memory partition corresponding to each service request for processing when each service request is processed. According to the method and the device, the proper memory requirement size is designed in advance, the continuous large memory is directly applied to the system at one time, the performance consumption caused by frequent application of the small memory in the system operation process is reduced, and the memory use performance is improved. Meanwhile, the processing of the service request corresponds to the memory partition, so that resource access competition of multithreading is avoided, and the execution performance consumption of multithreading concurrent access is greatly reduced.
Drawings
FIG. 1 is a schematic diagram of cluster-based WSN routing;
fig. 2 is a schematic diagram of an apparatus based on balanced routing and hybrid transmission according to an embodiment of the present invention;
fig. 3 is a flowchart of a method for balanced routing and hybrid transmission according to an embodiment of the present invention;
reference numerals:
101. a path update component;
102. a load balancing component;
103. a flow generation component;
104. an optimization strategy component.
Detailed Description
To explain technical contents, structural features, and objects and effects of the technical solutions in detail, the following detailed description is given with reference to the accompanying drawings in conjunction with the embodiments.
From the point of view of the routing path shown in fig. 1, an interesting phenomenon is also found, that there is only one shortest path from some nodes to the node 41, and there are more than two shortest paths from some nodes to the node 41. The nodes with only one shortest path comprise: 5/14/23/32,37/38/39/40,45/44/43/42 and 77/68/59/50. While all other nodes may find more than two shortest paths to reach node 41. For example, node 12 may transmit via path 1: 13-14-23-32, path 2, which is not associated with path 1: 21-30-39-40 and path 3 associated with path 1: 21-22-23-32 sends packet packets to node 41. A path refers to a network node that is traversed in the middle, except for the originating node and the terminating node. A related path means that two paths have the same node, and an unrelated path means that no node exists between the two paths. Based on a plurality of independent shortest path characteristics, a novel shortest balanced routing method is developed to research the relationship between two unrelated shortest paths.
From another perspective, hybrid transmission, multi-hop packet routing from a source node to a receiver achieves better power efficiency than direct communication in a WSN. However, multi-hop forwarding transmission may cause imbalance in power consumption to the receiver by the SCA layer and all other layers. In direct transmission, hot spots typically occur at the outermost periphery of the network and may alleviate the forwarding traffic load in SCA. Therefore, there is a trade-off between power efficiency and power balance of the inter-layer sensors in hybrid single-hop/multi-hop transmission.
With the SCA imbalance of fig. 1, the battery power of node 32 will be drained first, because the packets forwarded by the receiver's primary routing node are not uniformly propagated. After the primary routing node 32 has drained its battery energy, there are still 35 remaining nodes with sufficient power in the battery, but these nodes cannot transmit packets to the receiver. Furthermore, the average remaining battery power of the other 79 nodes in the network is up to 87%. In this case, the subnetworks will be isolated first, and the entire network will also have serious energy inefficient problems. Accordingly, the design goals herein are directed to address the unbalanced SCA and inefficient energy utilization issues of WSNs and to introduce routing based on two unrelated balanced paths and a hybrid opportunistic transmission strategy to enhance network lifecycle.
In order to jointly research the research topic of balanced routing and network power balancing, a balanced routing decision model is proposed, please refer to fig. 2, which is a device based on balanced routing and hybrid transmission according to an embodiment of the present invention, and the device includes a path updating component 101, a load balancing component 102, a traffic generating component 103, and an optimal policy component 104.
The path updating component 101 is connected with a load balancing component 102, the load balancing component 102 is connected with a traffic generating component 103, and the traffic generating component 103 is connected with an optimal policy component 104;
the path updating component 101 is configured to update the link cost of each path according to the current data link information; the path refers to link information from a sender to a receiver;
the load balancing component 102 is configured to balance a load condition of the current entire link network;
the traffic generation component 103 is configured to collect link data at each link node according to a preset frequency to transmit the detected traffic data to a destination data sink;
the optimal policy component 104 is configured to maximize the network lifecycle by parsing the optimal path for each node to minimize the power consumption of the greedy node; the optimal path is a path obtained by updating the path updating component.
In some embodiments, the path update component is configured to update the path of each link node when a change occurs in a neighboring node of the link node. Preferably, the changing of the neighboring node includes: nodes join or leave the current link network.
In the path update component, each sensor triggers a balanced routing decision model based on changing conditions of neighboring nodes or other link weighting factors (packet transmission success rate, packet delay time, etc.). The node change condition can be classified as both a node joining or leaving the network, and the link cost can be used to estimate the packet success rate of each data link from the sender to the receiver. Accordingly, the path update component may update the link cost for each path based on the data link information of the path update component and update the new balanced path by the receiver.
The transmitter may be a cluster head or a sensor, and the data cluster is the last receiver data sink. The cluster head or the sensor can be used as a repeater, and the repeater can receive the packet and then retransmit the packet. The data link information refers to packets transmitted on a link, and the link cost is a success rate of transmitting statistical data link information. The updated balanced path refers to the path with the lowest link cost.
In some embodiments, the load balancing component for balancing the load condition of the current entire link network comprises: the load balancing component generates a first shortest path for each link node, and determines a second shortest path according to the generated first shortest path; the path length between the first shortest path and the second shortest path is the same. The load balancing component is also called as an SCA load balancing component and aims to realize SCA forwarding load fairness and network energy balancing. The present application modifies the Dijkstra algorithm, which is designed to compute two unrelated shortest paths for most sensor nodes, and the intermediate forwarding nodes along both paths are different. Two phases are implemented in the modified Dijkstra algorithm. In a first stage, a first shortest path is randomly generated for a node. In the second phase, the next shortest path is created and compared to the original path. The newly generated path needs to satisfy two conditions, both having the same path length but different intermediate nodes from the source to the destination compared to the original path. If there is only one shortest path for a node, the load balancing component will go to the next node and repeat the process again to determine one or two shortest paths for all other nodes. Then, in the actual use process, the paths corresponding to each node can be alternately adopted for data transmission with different duty ratios, so that each layer of the whole network has the probability of realizing load balance. With the help of two uncorrelated shortest paths, the load fairness of the SCA and the energy balance in all other layers can be greatly improved. The duty ratio refers to the probability of selecting two unrelated paths, and the larger the duty ratio is, the greater the probability of being selected is, the closer the overall path is to the balance.
In some embodiments, data may be intermittently collected at each node or triggered to send detected data to a destination data sink by a traffic generation component. After receiving the packet, if the shortest path from the node to the destination is more than two, the node will transmit the received packet to the data sink according to the duty ratio of each shortest path.
In some embodiments, a min-max optimization problem is formed based on a network balancing optimization strategy by an optimization strategy component to balance the energy consumption of each node and ensure the longest network lifecycle. In particular, in order to extend the network lifetime, the fast energy consumption of some critical sensor nodes must be prevented. Therefore, in order to balance the power efficiency and the utilization rate of the WSN, it is necessary to invent a balanced routing algorithm with a hybrid transmission strategy. This goal is achieved by parsing the best path for each node to minimize the power consumption of the greedy-most node, thereby achieving network lifecycle maximization.
The greedy node is the node with the largest power consumption, and the power consumption of the greedy node is minimized to achieve the balance of the network. The energy consumption of the node depends on the total energy consumed in forwarding the packet.
To estimate the transmission power consumption, assume that the communication range in each cluster is d, the path loss exponent is 2, and the transmission power is associated with d according to the free space channel model2And (4) in proportion. For hybrid transmissions, the transmission duty cycle may be determined by an optimal policy component, and the duty cycle may be used for hybrid single-hop/multi-hop transmissions. Thus, the network balancing strategy minimizes the maximum power consumption between sensors, enabling us to maximize power utilization and improve the overall network life cycle. To balance overall network power consumption and utilization, an optimal path selection probability p is determined for each node iiAnd mixed single-hop/multi-hop transmission probability qiAnd the min-max optimization problem is represented as follows:
s.t.0≤pi，qi≤1，i＝1...n
where n is the number of sensing nodes, Pi,1 and Pi,2 are the power consumption values of the nodes i that send packets to the receiver via the multi-hop policy for two unrelated shortest paths 1 and 2, and Ci is the power consumption value of the sensor i for transmitting data to the receiver via the single-hop policy (referring to the power policy consumed by the nodes to transmit directly to the sink). In addition, qi is the probability of selecting a single-hop strategy, with the aim of minimizing the maximum node power consumption of the network, which enables us to maximize power utilization, and pi is the path selection probability in each data cycle of node i. The optimization problem in equation (1) can be equivalently restated as a linear program, which can be effectively solved by using optimization tools such as CVX.
Fig. 3 is a flowchart of a method for balanced routing and hybrid transmission according to an embodiment of the present invention. The method is applied to a device based on balanced routing and hybrid transmission, and the device comprises a path updating component, a load balancing component, a traffic generation component and an optimal strategy component; the path updating component is connected with the load balancing component, the load balancing component is connected with the traffic generating component, and the traffic generating component is connected with the optimal strategy component;
the method comprises the following steps:
firstly, entering a step S301 that a path updating component updates the link cost of each path according to the current data link information; the path refers to link information from a sender to a receiver;
then step S302 is entered, the load balancing component balances the load condition of the current whole link network;
then, the flow generation component in step S303 collects link data at each link node according to a preset frequency to send the detected flow data to a destination data sink;
then, the optimal strategy assembly in the step S304 minimizes the power consumption of the greedy node by analyzing the optimal path of each node, so that the life cycle of the network is maximized; the optimal path is a path obtained by updating the path updating component.
In certain embodiments, the method comprises: the path update component updates the path of each link node when the neighboring node of the link node changes. Preferably, the step of changing the neighboring node comprises: nodes join or leave the current link network.
In some embodiments, the load balancing component balancing the load condition of the current entire link network comprises: the load balancing component generates a first shortest path for each link node, and determines a second shortest path according to the generated first shortest path; the path length between the first shortest path and the second shortest path is the same.
In certain embodiments, the method comprises:
the optimal policy component determines an optimal path selection probability p for each link node according to the following formulaiAnd mixed single-hop/multi-hop transmission probability qiAnd optimizing power consumption of the least greedy node:
s.t.0≤pi，qi≤1，i＝l...n
where n is the number of sensing nodes, Pi,1And Pi,2Is a power consumption value of node i that sends a packet to the receiver via a multi-hop policy for two unrelated shortest paths 1 and 2, and CiIs the power consumption value of sensor i.
The invention provides a method and a device based on balanced routing and hybrid transmission, wherein the method comprises the following steps: the path updating component updates the link cost of each path according to the current data link information; the load balancing component balances the load condition of the current whole link network; the traffic generation component collects link data at each link node according to a preset frequency to transmit the detected traffic data to a destination data sink; the optimal policy component maximizes the network lifecycle by parsing the optimal path for each node to minimize the power consumption of the greedy nodes. By the scheme, the network life cycle can be greatly improved, and the residual energy of the surviving nodes can be effectively utilized.
It should be noted that, although the above embodiments have been described herein, the invention is not limited thereto. Therefore, based on the innovative concepts of the present invention, the technical solutions of the present invention can be directly or indirectly applied to other related technical fields by making changes and modifications to the embodiments described herein, or by using equivalent structures or equivalent processes performed in the content of the present specification and the attached drawings, which are included in the scope of the present invention.
Claims (8)
1. An apparatus based on balanced routing and hybrid transport, the apparatus comprising a path update component, a load balancing component, a traffic generation component, and an optimal policy component;
the path updating component is connected with the load balancing component, the load balancing component is connected with the traffic generating component, and the traffic generating component is connected with the optimal strategy component;
the path updating component is used for updating the link cost of each path according to the current data link information; the path refers to link information from a sender to a receiver;
the load balancing component is used for balancing the load condition of the current whole link network;
the traffic generation component is configured to collect link data at each link node according to a preset frequency to transmit the detected traffic data to a destination data sink;
the optimal strategy component is used for minimizing the power consumption of the greedy node by analyzing the optimal path of each node, so that the life cycle of the network is maximized; the optimal path is a path obtained by updating the path updating component;
the optimal policy component is for determining an optimal path selection probability p for each link node according to the following formulaiAnd mixed single-hop/multi-hop transmission probability qiAnd optimizing power consumption of the least greedy node:
s.t.0≤pi，qi≤1，i＝1...n
where n is the number of sensing nodes, Pi,1And Pi,2Is a power consumption value of node i that sends a packet to the receiver via a multi-hop policy for two unrelated shortest paths 1 and 2, and CiIs the power consumption value of sensor i.
2. The balanced routing and hybrid transmission-based apparatus of claim 1, wherein the path update component is configured to update the path of each link node when a change occurs in a neighboring node of the link node.
3. The apparatus for balanced routing and hybrid transmission based on claim 2, wherein the neighboring node being changed comprises: nodes join or leave the current link network.
4. The apparatus for balanced routing and hybrid transport based according to claim 1, wherein the load balancing component for balancing the load condition of the current entire link network comprises:
the load balancing component generates a first shortest path for each link node, and determines a second shortest path according to the generated first shortest path; the path length between the first shortest path and the second shortest path is the same.
5. A method based on balanced routing and hybrid transmission is characterized in that the method is applied to a device based on balanced routing and hybrid transmission, and the device comprises a path updating component, a load balancing component, a traffic generation component and an optimal strategy component; the path updating component is connected with the load balancing component, the load balancing component is connected with the traffic generating component, and the traffic generating component is connected with the optimal strategy component;
the method comprises the following steps:
the path updating component updates the link cost of each path according to the current data link information; the path refers to link information from a sender to a receiver;
the load balancing component balances the load condition of the current whole link network;
the traffic generation component collects link data at each link node according to a preset frequency to transmit the detected traffic data to a destination data sink;
the optimal strategy component minimizes the power consumption of the greedy node by analyzing the optimal path of each node, so that the life cycle of the network is maximized; the optimal path is a path obtained by updating the path updating component;
the optimal policy component determines an optimal path selection probability p for each link node according to the following formulaiAnd mixed single-hop/multi-hop transmission probability qiAnd optimizing power consumption of the least greedy node:
s.t.0≤pi，qi≤1，i＝1...n
where n is the number of sensing nodes, Pi,1And Pi,2Is a power consumption value of node i that sends a packet to the receiver via a multi-hop policy for two unrelated shortest paths 1 and 2, and CiIs the power consumption value of sensor i.
6. The method for balanced routing and hybrid transport based on claim 5, wherein the method comprises:
the path update component updates the path of each link node when the neighboring node of the link node changes.
7. The method for balanced routing and hybrid transmission based on claim 6, wherein the step of the neighbor node changing comprises: nodes join or leave the current link network.
8. The method for balancing routing and hybrid transport based on claim 5, wherein the load balancing component balancing the load condition of the current entire link network comprises:
the load balancing component generates a first shortest path for each link node, and determines a second shortest path according to the generated first shortest path; the path length between the first shortest path and the second shortest path is the same.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910998243.1A CN110831067B (en) | 2019-10-21 | 2019-10-21 | Method and device based on balanced routing and hybrid transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910998243.1A CN110831067B (en) | 2019-10-21 | 2019-10-21 | Method and device based on balanced routing and hybrid transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110831067A CN110831067A (en) | 2020-02-21 |
| CN110831067B true CN110831067B (en) | 2022-03-29 |
Family
ID=69549825
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910998243.1A Active CN110831067B (en) | 2019-10-21 | 2019-10-21 | Method and device based on balanced routing and hybrid transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110831067B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111556544B (en) * | 2020-03-17 | 2022-04-01 | 阳光学院 | Method and storage device for combining balanced routing and transmission radius control |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802205A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Load balancing routing method for wireless sensor network |
| CN107911859A (en) * | 2017-10-24 | 2018-04-13 | 天津大学 | The life cycle of underwater wireless sensor network based on cross layer design extends method |
| CN108174412A (en) * | 2018-01-05 | 2018-06-15 | 重庆邮电大学 | A kind of RPL multi-path data transmission mechanisms of load balancing |
| CN108768736A (en) * | 2018-06-05 | 2018-11-06 | 中国人民解放军国防科技大学 | Optimization method of hybrid service function chain embedding cost |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120182865A1 (en) * | 2009-02-06 | 2012-07-19 | Vpisystems, Inc. | Systems, Methods, and Apparatuses for Managing the Flow of Traffic in Data Networks |
-
2019
- 2019-10-21 CN CN201910998243.1A patent/CN110831067B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102802205A (en) * | 2012-09-01 | 2012-11-28 | 北京理工大学 | Load balancing routing method for wireless sensor network |
| CN107911859A (en) * | 2017-10-24 | 2018-04-13 | 天津大学 | The life cycle of underwater wireless sensor network based on cross layer design extends method |
| CN108174412A (en) * | 2018-01-05 | 2018-06-15 | 重庆邮电大学 | A kind of RPL multi-path data transmission mechanisms of load balancing |
| CN108768736A (en) * | 2018-06-05 | 2018-11-06 | 中国人民解放军国防科技大学 | Optimization method of hybrid service function chain embedding cost |
Non-Patent Citations (2)
| Title |
|---|
| Joint Hybrid Transmission and Adaptive Routing for Lifetime Extension of WSNs;CHIH-MIN YU 等;《IEEE ACCESS》;20180509;全文 * |
| 内容传递网络处理能力受限代理放置贪婪算法;陈益峰 等;《软件学报》;20070131;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110831067A (en) | 2020-02-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103621144B (en) | For the method for finding route set in a network | |
| Wu et al. | Maximizing network lifetime of WirelessHART networks under graph routing | |
| Bhattacharjee et al. | Lifetime maximizing dynamic energy efficient routing protocol for multi hop wireless networks | |
| Chen et al. | Joint topology control and routing in IEEE 802.11-based multiradio multichannel mesh networks | |
| Abdelaziz et al. | Metric-based taxonomy of routing protocols for cognitive radio ad hoc networks | |
| Gogu et al. | Review of optimization problems in wireless sensor networks | |
| US20120320812A1 (en) | Method for Associating Time Slots with Links Between Network Nodes of a Wireless Interconnected Network | |
| CN110831006B (en) | Ad hoc network system and data transmission method thereof | |
| Yazdinejad et al. | Increasing the performance of reactive routing protocol using the load balancing and congestion control mechanism in manet | |
| Wang et al. | Interference aware multipath routing protocol for wireless sensor networks | |
| CN110831067B (en) | Method and device based on balanced routing and hybrid transmission | |
| Jia et al. | Relay-assisted routing in cognitive radio networks | |
| CN104754589A (en) | Traffic awareness based dynamic networking method | |
| Li et al. | Multi-hop effective bandwidth based routing in multi-radio wireless mesh networks | |
| CN102075864A (en) | MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure | |
| Wang et al. | Journey from mobile ad hoc networks to wireless mesh networks | |
| Bari et al. | Optimal placement and routing strategies for resilient two‐tiered sensor networks | |
| Kim et al. | An energy-aware multipath routing algorithm in wireless sensor networks | |
| Al Sharah et al. | Trade-off between Energy Consumption and Transmission Rate in Mobile Ad-Hoc Network | |
| Sadat et al. | A trade-off between reliability and energy efficiency for inter-cluster communication in wireless sensor networks | |
| Amiri‐Doomari et al. | Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks | |
| Liu et al. | Collision-constrained minimum energy node-disjoint multipath routing in ad hoc networks | |
| Kumar et al. | Connectivity-aware routing in sensor networks | |
| Ming Lu et al. | An energy‐efficient multipath routing protocol for wireless sensor networks | |
| Zhu et al. | A unified MAC and routing framework for multichannel multi-interface ad hoc 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |