CN105916183A - Wireless sensor network routing method based on link quality and residual energy - Google Patents
Wireless sensor network routing method based on link quality and residual energy Download PDFInfo
- Publication number
- CN105916183A CN105916183A CN201610423770.6A CN201610423770A CN105916183A CN 105916183 A CN105916183 A CN 105916183A CN 201610423770 A CN201610423770 A CN 201610423770A CN 105916183 A CN105916183 A CN 105916183A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- link
- quality
- route
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a wireless sensor network routing method based on link quality and residual energy. Whether the link quality is good or bad is judged by using a link quality index; sending of a data packet is carried out by selecting a link having the better link quality among sensor nodes; furthermore, the residual energy of the nodes is comprehensively considered; the condition that a single node is excessively used in other algorithms can be avoided; therefore, the load of the whole wireless network is balanced; and the service life and the service quality of a wireless sensor network are increased.
Description
Technical field
The present invention relates to wireless sensor network technology field, particularly relate to a kind of based on link-quality with the nothing of dump energy
Line sensor network route selection method.
Background technology
Wireless sensor network is a kind of emerging network, and this network is made up of multiple single node, and each node is by sensing
Or state modulator realize with environment mutual；Node just must can complete certain task by interrelated, and individual node
The most generally cannot play a role；Internodal relatedness is realized by radio communication.
When in wireless sensor network, a source node needs the destination node sending the packets to it, if source node
Can not directly carry out the transmission of packet, then it can only rely on the help of intermediate node to forward these packets, from
And define a multihop network.Routing layer Routing Protocol determines the strategy of forwarding by the routing algorithm proposed.Wired
In network, Routing Protocol is typically based on (Dijkstra or the Bellman-Ford calculation of connection status or distance vector algorithm
Method), and in the wireless network, because network is particularly likely that movement, multi-hop, so Routing Protocol should be distribution
Formula, low overhead, self-configuring, the network topology structure of being good at processing frequently change.Wireless Network Routing Protocol can
It is divided into two big classes: the Routing Protocol of (i) table-driven (Table-driven) or priori formula (Proactive) is originally；(ii) on-demand routing
Agreement.
First aspect is in wireless sensor network is applied, owing to sensor node is difficult to be connected with cable power, and must
Self-contained battery must be relied on to power, and therefore energy efficiency is a very important index, and existing wireless network route
Agreement does not accounts for energy efficient problem；Second aspect wireless sensor network application is closely related with environmental factors, due to
The polytropy of environmental factors, wireless sensor network application has higher requirement to service quality (QoS), therefore route association
View stability and reliability be also two very important indexs, existing Wireless Network Routing Protocol do not account for this two
Point.3rd aspect, in wireless sensor network is applied, exhausts owing to the communication between node is likely to be due to node energy,
The factors such as node damage cause permanent discontinuation, and therefore wireless sensor network node typically requires redundant deployment, existing wireless
Network routing protocol does not accounts for fault-tolerance yet.
In sum, existing table-driven and on-demand routing protocol do not account for wireless sensor network node finite energy and ring
The impact of border factor, it is impossible to meet energy of wireless sensor network height and use and the requirement of higher quality of service.
Summary of the invention
The technical problem to be solved is to provide a kind of based on link-quality with the wireless sensor network of dump energy
Route selection method, makes the node energy consumption in whole network more equalize, improves the life span of whole network；Choose simultaneously
The link that between node, link-quality is higher communicates, and improves stability and the accuracy of data transmission, improves wireless sensing
The service quality of device network.
The technical solution adopted for the present invention to solve the technical problems is: provide a kind of based on link-quality with the nothing of dump energy
Line sensor network route selection method, adds in nodal cache routing table, RREQ packet and RREP packet
The number of links that between average nodal dump energy state and path interior joint, link-quality is relatively low two fields, specifically include following
Step:
(1) when source node needs to carry out communication with destination node, source node is by all neighbor node flooded broadcast roads
By request RREQ packet, and wait routing reply RREP packet；
(2) when the first intermediate node receives the copy package of a RREQ packet, obtain the first intermediate node and send out
Give the link-quality between the upper hop node of this RREQ packet and the energy state of the first intermediate node self, and right
In RREQ packet, between average nodal dump energy state and path interior joint, the value of the number of links that link-quality is relatively low is carried out more
Newly；
(3) judge whether the routing table of this first intermediate nodes cache exists the active path leading to destination node, if not
Exist, then forward RREQ packet to neighbor node；If there is active path, then according to the information of RREQ packet,
Generating a routing reply RREP information, the active path that the first intermediate node leads to destination node accesses the first middle node
Put to the reverse path of source node, form the complete reverse path from destination node to source node, and by the way of clean culture
It is sent to source node via reverse path；
After (4) second intermediate nodes receive routing reply RREP packet, whether the second intermediate node inspection oneself is
Source node, if it is not, then continue reverse path to forward RREP packet；If the second intermediate node is source node, then basis
The information of RREP reverse path, establishment source node, to the forward path of destination node, is saved in route list；
(5) optimum routing updates algorithm is performed, it is judged that the path that this RREQ packet is searched considers link
Whether quality and node energy are optimal paths, if optimal path, then source node is sent to destination node by this path
Data, complete communication.
Number of links that in described step (5), between jumping figure according to path, path interior joint, link-quality is relatively low and averagely saving
Path is chosen by point three aspects of dump energy state.
Described step (5) particularly as follows:
(51) if route finding process finds a new route, the average nodal residue in new route and original path is compared
Energy state, if both are equal, compares the path jumping figure in new route and original path, if the path jumping figure of new route is more at most
Continue to compare the number of links that between the interior joint of path, link-quality is relatively low, if link-quality is relatively between the path interior joint in original path
Low number of links is less, then new route is optimum route, needs to update routing table；
(52) if the average nodal dump energy state of new route is less than original path, then continue to compare the road of two paths
Footpath jumping figure, if the path jumping figure of new route is compared with continuing at least to compare the number of links that between the interior joint of path, link-quality is relatively low, if
The number of links that between the path interior joint in original path, link-quality is relatively low is less, then new route is optimum route, needs to update road
By table；
(53) if the average nodal dump energy state of new route is more than original path, then continue to compare between the interior joint of path
The number of links that link-quality is relatively low, if the number of links that between the path interior joint in original path, link-quality is relatively low is less, then than
The relatively path jumping figure of two paths, if the jumping figure of new route is more, then new route is optimum route, needs to update routing table；
(54) do not meet case above then re-starts route discovery.
Beneficial effect
Owing to have employed above-mentioned technical scheme, the present invention compared with prior art, has the following advantages that and good effect:
By the present invention in that the quality judging link-quality with Link Quality Index, by choosing link-quality between sensor node
Preferably link carries out the transmission of packet, and consider the dump energy of node, it is to avoid single node in other algorithms
Situation about excessively using, makes the load balancing of whole wireless network, improves life-span and the service quality of wireless sensor network.
Accompanying drawing explanation
Fig. 1 is the flow chart of the present invention；
Fig. 2 is optimum Route Selection flow chart in the present invention.
Detailed description of the invention
Below in conjunction with specific embodiment, the present invention is expanded on further.Should be understood that these embodiments be merely to illustrate the present invention and
It is not used in restriction the scope of the present invention.In addition, it is to be understood that after having read the content that the present invention lectures, people in the art
The present invention can be made various changes or modifications by member, and these equivalent form of values fall within the application appended claims equally and limited
Scope.
Embodiments of the present invention relate to a kind of wireless sensor network Route Selection side based on link-quality and dump energy
Method, this method considers the dump energy of the link-quality between node and node, when designing Routing Protocol, delays at node
Deposit the average nodal dump energy state that with the addition of in routing table, RREQ packet and RREP packet
Two fields of number of links Low-Link that between RemainingEnergy and path interior joint, link-quality is relatively low.Optimum route
Update algorithm is selected to consider the link-quality between the jumping figure in path, path interior joint, the residual energy of path interior joint
Amount state.As it is shown in figure 1, specifically include following steps:
Step 1, when source node S need with destination node D carry out communication time, source node S by all neighbor nodes general
Flood broadcast route request RREQ packet, and wait routing reply RREP packet, start route finding process；
Step 2, when intermediate node i receives the copy package of a RREQ packet, intermediate node i and transmission need to be judged
Whether the link-quality between the upper hop node i-1 of this RREQ packet is less than a fixing link quality threshold,
If the link-quality between intermediate node i and upper hop node i-1 is less than this threshold value, then update this RREQ data
The value of LowLink in bag, the value of LowLink adds 1, obtains the dump energy state of intermediate node i right simultaneously
RemainingEnergy is updated；
Step 3, judge whether the routing table that this intermediate node i caches exists the active path of the D leading to destination node,
If not existing, then forward RREQ packet to neighbor node；If there is active path, then according to RREQ information, generate
One routing reply RREP information, leads to active path access node i of destination node D to source node by intermediate node i
In the reverse path of S, form the complete reverse path from destination node D to source node, and via instead by the way of clean culture
It is sent to source node S to path；
After step 4, intermediate node j receive routing reply RREP packet, node j checks whether oneself is source node,
If it is not, then continue reverse path to forward RREP packet.If this node is source node S, then according to the reverse road of RREP
The information in footpath, establishment source node S, to the forward path of destination node D, is saved in route list.
Step 5, the optimum routing updates algorithm of execution, it is judged that the path that this RREQ packet is searched considers chain
Whether road quality and node energy are optimal paths.If optimal path, then source node passes through time path to destination node D
Send data, complete communication.
As can be seen here, the present invention solves following two technical barrier:
1) in wireless sensor network, same node repeatedly can cause the consumption of this node energy too fast as intermediate node, accelerates
The death of this node, thus cause the change of whole network topology, add the process of route discovery, reduce whole network
Life span.
2) link circuit condition between node causes the decline of communication quality between node due to the impact of environmental factors, node it
Between data send out the probability that is successfully transmitted and reduce or can not be successfully transmitted, reduce the service quality of wireless sensor network.
The present invention can make the node energy consumption in whole network more equalize, and improves the life span of whole network；Choose simultaneously
The link that between node, link-quality is higher communicates, and improves stability and the accuracy of data transmission, improves wireless sensing
The service quality (QoS) of device network.
Optimum routing updates algorithm is as described below:
In path, low quality links number Low-Link value is:
L is link-quality between node, LQIthFor the link quality threshold set, the LQI under varying environmentthIt is different,
Between node, link-quality is more than LQIthDuring value, between node, link circuit condition is good, can accurately send data between node
Bag, now Q (L) value is set to 0, and between node, link-quality is less than LQIthDuring value, between node, link circuit condition is poor, joint
Can not accurately send packet between point, now Q (L) value is set to 1, the low quality become to whole path of suing for peace Q (L) value
Number of links Low-Link value, the reason the most directly using LQI value is that the node operational capability of wireless sensor network has
Limit, complicated calculating can consume more node resource, consume a lot of energy.
The present invention uses LQI as the index of balance link-quality, do not use the RSSI, RSSI can only reaction signal
Intensity, in the case of such environmental effects is bigger, it is impossible to accurately reaction node between link-quality, LQI be
Regulation in IEEE 802.15.4 standard, existing sensor node chip such as CC2420 can record LQI value and RSSI
Value, compares RSSI value, and LQI value can preferably reflect the environmental factors impact on link-quality.
In path, average nodal dump energy state RemainingEnergy value is:
EiFor the dump energy state of node i,For the average nodal dump energy state of nodes all in path, EoriginFor
Primary energy, EremainFor dump energy.
The jumping figure in path is H.
When a node receives a route requests RREQ packet, can to RemainingEnergy value in RREQ and
Low-Link value is updated.
Optimum routing updates algorithm is as in figure 2 it is shown, to be embodied as step as follows:
If step 1 route finding process finds a new path B, compare path B's and original path A
RemainingEnergy valueIf EA=EB, then compare jumping figure and the jumping figure of path B of path A, if HA>HBThen continue
Continuing and compare Low-Link value, if the Low-Link value of path B is less, then path B is optimum route, needs to update road
By table.
If step 2 EA<EB, then continue to compare HAWith HBValue, if HA<HBThen continue to compare Low-Link value,
If the Low-Link value of path B is less, then path B is optimum route, needs to update routing table.
If step 3 EA>EB, then continue to compare Low-Link value, if the Low-Link value of path B is less, then continue
Continue and compare HAWith HBValue, if HA>HBThen path B is optimum route, needs to update routing table.
Step 4, do not meet above step situation, re-start route discovery.
As can be seen here, optimum routing updates algorithm according to the jumping figure in path and path Low-Link value and
Path is chosen and is retrained by three aspects of RemainingEnergy value, deletes unnecessary path, and minimizing need not
The route finding process wanted.
Claims (3)
1. one kind based on link-quality and the route selection method for wireless sensor network of dump energy, it is characterised in that at node
Cache routing table, RREQ packet and RREP packet with the addition of average nodal dump energy state and path
Two fields of the number of links that between interior joint, link-quality is relatively low, specifically include following steps:
(1) when source node needs to carry out communication with destination node, source node is by asking to all neighbor node flooded broadcast route
Seek RREQ packet, and wait routing reply RREP packet；
(2) when the first intermediate node receives the copy package of a RREQ packet, obtain the first intermediate node and send this
Link-quality between the upper hop node of individual RREQ packet and the energy state of the first intermediate node self, and
To the number of links that in RREQ packet, between average nodal dump energy state and path interior joint, link-quality is relatively low
Value is updated；
(3) judge whether the routing table of this first intermediate nodes cache exists the active path leading to destination node, if not depositing
, then forward RREQ packet to neighbor node；If there is active path, then according to the letter of RREQ packet
Breath, generates a routing reply RREP information, and the active path that the first intermediate node leads to destination node accesses
First intermediate node, in the reverse path of source node, forms the complete reverse path from destination node to source node,
And it is sent to source node via reverse path by the way of clean culture；
After (4) second intermediate nodes receive routing reply RREP packet, whether the second intermediate node inspection oneself is source joint
Point, if it is not, then continue reverse path to forward RREP packet；If the second intermediate node is source node, then root
According to the information of RREP reverse path, establishment source node, to the forward path of destination node, is saved in route list；
(5) optimum routing updates algorithm is performed, it is judged that the path that this RREQ packet is searched considers link-quality
Whether is optimal path with node energy, if optimal path, then source node is sent out to destination node by this path
Send data, complete communication.
The most according to claim 1 based on link-quality with the route selection method for wireless sensor network of dump energy, its
Be characterised by, the number of links that in described step (5), between jumping figure according to path, path interior joint, link-quality is relatively low with
And path chosen by three aspects of average nodal dump energy state.
The most according to claim 2 based on link-quality with the route selection method for wireless sensor network of dump energy, its
Be characterised by, described step (5) particularly as follows:
(51) if route finding process finds a new route, the average nodal residue in new route and original path is compared
Energy state, if both are equal, compares the path jumping figure in new route and original path, if the path jumping figure of new route is relatively
Continue at most to compare the number of links that between the interior joint of path, link-quality is relatively low, if chain between the path interior joint in original path
Quality relatively low number of links in road is less, then new route is optimum route, needs to update routing table；
(52) if the average nodal dump energy state of new route is less than original path, then continue to compare the road of two paths
Footpath jumping figure, if the path jumping figure of new route is compared with continuing at least to compare the number of links that between the interior joint of path, link-quality is relatively low,
If the number of links that between the path interior joint in original path, link-quality is relatively low is less, then new route is optimum route, needs
Routing table to be updated；
(53) if the average nodal dump energy state of new route is more than original path, then continue to compare between the interior joint of path
The number of links that link-quality is relatively low, if the number of links that between the path interior joint in original path, link-quality is relatively low is less,
Then comparing the path jumping figure of two paths, if the jumping figure of new route is more, then new route is optimum route, needs more
New routing table；
(54) do not meet case above then re-starts route discovery.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610423770.6A CN105916183B (en) | 2016-06-15 | 2016-06-15 | Wireless sensor network routing method based on link quality and residual energy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610423770.6A CN105916183B (en) | 2016-06-15 | 2016-06-15 | Wireless sensor network routing method based on link quality and residual energy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105916183A true CN105916183A (en) | 2016-08-31 |
| CN105916183B CN105916183B (en) | 2022-01-28 |
Family
ID=56751476
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610423770.6A Active CN105916183B (en) | 2016-06-15 | 2016-06-15 | Wireless sensor network routing method based on link quality and residual energy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105916183B (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106304152A (en) * | 2016-09-20 | 2017-01-04 | 北京农业信息技术研究中心 | Farmland multipath channel probability sensing network link prediction method and device |
| CN106658638A (en) * | 2016-12-16 | 2017-05-10 | 天津大学 | Time sequence prediction method based on HH-VBF |
| CN107809781A (en) * | 2017-11-02 | 2018-03-16 | 中国科学院声学研究所 | A kind of loop free route selection method of load balancing |
| CN109548112A (en) * | 2019-01-14 | 2019-03-29 | 三峡大学 | A kind of wireless sense network distributed routing method based on the various dimensions path quality factor |
| CN109873765A (en) * | 2019-03-21 | 2019-06-11 | 中铁西南科学研究院有限公司 | The effective route decision method of energy of wireless sensor network under a kind of tunnel environment |
| CN109996308A (en) * | 2019-03-04 | 2019-07-09 | 西安电子科技大学 | It is a kind of based on energy-optimised mobile ad hoc network method for routing and device |
| CN110121185A (en) * | 2019-06-17 | 2019-08-13 | 广东电网有限责任公司 | A kind of power distribution communication network route optimization method |
| CN110831025A (en) * | 2018-08-10 | 2020-02-21 | 展讯通信（上海）有限公司 | Method and device for uploading data by user terminal, storage equipment and user terminal |
| CN111314863A (en) * | 2020-02-22 | 2020-06-19 | 中国电子科技集团公司第三十四研究所 | Pre-switching efficient MLLN routing method |
| CN112187342A (en) * | 2020-09-30 | 2021-01-05 | 西安交通大学 | Satellite traffic routing method and system based on energy perception and load balancing |
| CN114449612A (en) * | 2022-02-10 | 2022-05-06 | 重庆大学 | Dual-mode Mesh networking method for power Internet of things |
| CN115529647A (en) * | 2022-09-28 | 2022-12-27 | 南通大学 | Load balancing routing algorithm based on path quality |
| CN117580125A (en) * | 2023-11-16 | 2024-02-20 | 中山大学 | Underwater sensor network routing protocol system based on weighted link quality |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083595A (en) * | 2006-05-30 | 2007-12-05 | 株式会社Ntt都科摩 | Method for routing foundation |
| US20130107909A1 (en) * | 2011-10-27 | 2013-05-02 | Benjamin Peter John Jones | Multi-path radio transmission input/output devices, network, systems and methods with link suitability determination |
| CN103648144A (en) * | 2013-12-13 | 2014-03-19 | 重庆邮电大学 | Method for generating multiple paths with multiple QoS constraints in wireless multi-hop network |
| EP2840860A1 (en) * | 2013-08-23 | 2015-02-25 | Airties Kablosuz Iletism Sanayi ve Disticaret AS | Hybrid Mesh Network |
-
2016
- 2016-06-15 CN CN201610423770.6A patent/CN105916183B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083595A (en) * | 2006-05-30 | 2007-12-05 | 株式会社Ntt都科摩 | Method for routing foundation |
| US20130107909A1 (en) * | 2011-10-27 | 2013-05-02 | Benjamin Peter John Jones | Multi-path radio transmission input/output devices, network, systems and methods with link suitability determination |
| EP2840860A1 (en) * | 2013-08-23 | 2015-02-25 | Airties Kablosuz Iletism Sanayi ve Disticaret AS | Hybrid Mesh Network |
| CN103648144A (en) * | 2013-12-13 | 2014-03-19 | 重庆邮电大学 | Method for generating multiple paths with multiple QoS constraints in wireless multi-hop network |
Non-Patent Citations (2)
| Title |
|---|
| BHABANI SANKAR GOUDA 等: "A new optimal approach for improving energy efficiency in wireless ad-hoc networks", 《PROCEEDINGS OF 2013 IEEE CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES》 * |
| 田海江 等: "适用于语音业务的MANET机会路由机制", 《重庆大学学报》 * |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106304152B (en) * | 2016-09-20 | 2019-05-24 | 北京农业信息技术研究中心 | Farmland multipath channel probability sensing network link prediction method and device |
| CN106304152A (en) * | 2016-09-20 | 2017-01-04 | 北京农业信息技术研究中心 | Farmland multipath channel probability sensing network link prediction method and device |
| CN106658638A (en) * | 2016-12-16 | 2017-05-10 | 天津大学 | Time sequence prediction method based on HH-VBF |
| CN106658638B (en) * | 2016-12-16 | 2020-02-07 | 天津大学 | HH-VBF-based time sequence prediction method |
| CN107809781A (en) * | 2017-11-02 | 2018-03-16 | 中国科学院声学研究所 | A kind of loop free route selection method of load balancing |
| CN107809781B (en) * | 2017-11-02 | 2020-02-18 | 中国科学院声学研究所 | Load balancing loop-free routing method |
| CN110831025A (en) * | 2018-08-10 | 2020-02-21 | 展讯通信（上海）有限公司 | Method and device for uploading data by user terminal, storage equipment and user terminal |
| CN110831025B (en) * | 2018-08-10 | 2021-12-10 | 展讯通信（上海）有限公司 | Method and device for uploading data by user terminal, storage medium and user terminal |
| CN109548112A (en) * | 2019-01-14 | 2019-03-29 | 三峡大学 | A kind of wireless sense network distributed routing method based on the various dimensions path quality factor |
| CN109548112B (en) * | 2019-01-14 | 2021-11-09 | 三峡大学 | Wireless sensor network distributed routing method based on multi-dimensional path quality factor |
| CN109996308B (en) * | 2019-03-04 | 2021-05-07 | 西安电子科技大学 | Mobile ad hoc network routing method and device based on energy optimization |
| CN109996308A (en) * | 2019-03-04 | 2019-07-09 | 西安电子科技大学 | It is a kind of based on energy-optimised mobile ad hoc network method for routing and device |
| CN109873765B (en) * | 2019-03-21 | 2021-02-19 | 中铁西南科学研究院有限公司 | Energy-efficient routing decision method for wireless sensor network in tunnel environment |
| CN109873765A (en) * | 2019-03-21 | 2019-06-11 | 中铁西南科学研究院有限公司 | The effective route decision method of energy of wireless sensor network under a kind of tunnel environment |
| CN110121185B (en) * | 2019-06-17 | 2020-12-08 | 广东电网有限责任公司 | Power distribution communication network route optimization method |
| CN110121185A (en) * | 2019-06-17 | 2019-08-13 | 广东电网有限责任公司 | A kind of power distribution communication network route optimization method |
| CN111314863A (en) * | 2020-02-22 | 2020-06-19 | 中国电子科技集团公司第三十四研究所 | Pre-switching efficient MLLN routing method |
| CN112187342A (en) * | 2020-09-30 | 2021-01-05 | 西安交通大学 | Satellite traffic routing method and system based on energy perception and load balancing |
| CN112187342B (en) * | 2020-09-30 | 2021-10-01 | 西安交通大学 | Satellite traffic routing method and system based on energy perception and load balancing |
| CN114449612A (en) * | 2022-02-10 | 2022-05-06 | 重庆大学 | Dual-mode Mesh networking method for power Internet of things |
| CN115529647A (en) * | 2022-09-28 | 2022-12-27 | 南通大学 | Load balancing routing algorithm based on path quality |
| CN115529647B (en) * | 2022-09-28 | 2024-08-02 | 南通大学 | Load balancing route selection method based on path quality |
| CN117580125A (en) * | 2023-11-16 | 2024-02-20 | 中山大学 | Underwater sensor network routing protocol system based on weighted link quality |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105916183B (en) | 2022-01-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105916183A (en) | Wireless sensor network routing method based on link quality and residual energy | |
| Liu et al. | Energy efficient on-demand multipath routing protocol for multi-hop ad hoc networks | |
| Cai et al. | ACO based QoS routing algorithm for wireless sensor networks | |
| CN105577547B (en) | Multi-Qos route selection method is based in a kind of mobile ad-hoc network | |
| Yu et al. | A link availability-based QoS-aware routing protocol for mobile ad hoc sensor networks | |
| Alghamdi | Cuckoo energy-efficient load-balancing on-demand multipath routing protocol | |
| Sisodia et al. | Performance evaluation of a table driven and on-demand routing protocol in energy constraint MANETs | |
| Sargolzaey et al. | A review and comparison of reliable unicast routing protocols for mobile ad hoc networks | |
| Dorle et al. | Evaluation of multipath, unipath and hybrid routing protocols for vehicular Ad hoc networks | |
| Sahayaraj et al. | An Implementation of the DCF-MAC protocol based VANET | |
| Er-rouidi et al. | A balanced energy consumption in mobile ad hoc network | |
| Khan et al. | An investigation on existing protocols in MANET | |
| Yu et al. | A low overhead dynamic route repairing mechanism for mobile ad hoc networks | |
| Tabatabaei et al. | Fuzzy-based routing protocol to increase throughput in mobile ad hoc networks | |
| CN106685819A (en) | AOMDV protocol energy saving method based on node energy division | |
| Bhosale et al. | Comparison of routing protocols with performance parameters in manet using ns3 | |
| Shokrani et al. | A novel ant-based QoS routing for mobile adhoc networks | |
| SreeRangaRaju et al. | Optimized ZRP for MANETs and its Applications | |
| Batth et al. | Performance evaluation of ant colony optimization based routing algorithms for mobile ad hoc networks | |
| Aissani et al. | Optimizations and performance study of the dynamic source routing protocol | |
| Liu et al. | Research and equilibrium optimization of AODV routing protocol in Ad Hoc network | |
| Mei et al. | Augmenting coverage in a cellular network with dtn routing | |
| Xu et al. | A Reliable Multipath Routing Protocol Based on Link Stability | |
| Xiao et al. | QoS routing protocol for ad hoc networks with mobile backbones | |
| Nagula Meera et al. | Ad hoc networks: route discovery channel for mobile network with low power consumption |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |