CN104618945B - Routing failure restoration methods based on link-quality renewal in WLAN - Google Patents
Routing failure restoration methods based on link-quality renewal in WLAN Download PDFInfo
- Publication number
- CN104618945B CN104618945B CN201510004730.3A CN201510004730A CN104618945B CN 104618945 B CN104618945 B CN 104618945B CN 201510004730 A CN201510004730 A CN 201510004730A CN 104618945 B CN104618945 B CN 104618945B
- Authority
- CN
- China
- Prior art keywords
- values
- link
- quality
- node
- per
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000004904 shortening Methods 0.000 claims abstract description 5
- 230000001133 acceleration Effects 0.000 claims abstract description 4
- 238000005457 optimization Methods 0.000 claims description 8
- 230000008569 process Effects 0.000 claims description 7
- 230000002708 enhancing effect Effects 0.000 abstract description 2
- 230000005540 biological transmission Effects 0.000 description 13
- 238000004891 communication Methods 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000011084 recovery Methods 0.000 description 3
- 230000007423 decrease Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000002045 lasting effect Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000006424 Flood reaction Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000033228 biological regulation Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000000151 deposition Methods 0.000 description 1
- 230000006866 deterioration Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000001771 impaired effect Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000004804 winding Methods 0.000 description 1
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/04—Arrangements for maintaining operational condition
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 discloses the routing failure restoration methods based on link-quality renewal in a kind of WLAN, the routing failure restoration methods based on link-quality renewal in a kind of its WLAN, it is characterised in that it includes herein below：By shortening the broadcast interval of Hello bags, increase broadcasting frequency；By reducing clearance time interval, the renewal of acceleration source node listing；Link-quality RQ values are improved, accelerate convergence rate.The present invention combines the broadcast interval for shortening Hello bags, increases the optimisation strategy of broadcasting frequency, routing table update interval and RQ values so that the time of network re-convergence when the agreement shortens nodes break down, further enhancing the robustness of network.
Description
Technical field
The invention belongs to the route based on link-quality renewal in technical field of communication network, more particularly to WLAN
Fault recovery method.
Background technology
L2MPM (two layers of MESH agreements of Layer 2Mesh Protocol for Mobile movement equipment) Routing Protocol work
Make in data link layer, be a kind of Proactive routing protocols.The basic thought of L2MPM Routing Protocols is all lists in source node
Jump up to the best neighbor node found in neighbor node for purpose node in respective path, and use best neighbor point as number
According to the next-hop node in repeating process, topology and routing iinformation without calculating, determining whole network.Determine optimal
The foundation of neighbor node is link-quality, and the quality of link-quality determines speed and the property of network that network is established and updated
Energy.
The data packet to communicate between L2MPM agreements is Hello bags, is obtained by periodically broadcasting Hello bags in network
Neighbor node response message, and then maintain routing table.Hello bags mainly have in the protocol effect it is as follows：
(1) existence of other node perceived source nodes is made.Neighbors determines depositing for source node after Hello bags are received
The routing table that itself arrives source node is being established after to processing data packets, is then forwarding the bag.
(2) as the judgment basis that next-hop route is selected in multi-hop strategy.RQ (Route in Hello bags
Quality), path quality weights) routing metric as L2MPM agreements, reflection be transmission path quality, be worth higher table
Bright link-quality is better.
(3) L2MPM agreements operation principle is as follows：Node periodically sends Hello bags first, is saved according to neighbours in network
The response message of point establishes the routing table of oneself, it takes the Optimization route that global route is decomposed into optimal next-hop route
Strategy, the step that floods can simply be divided into following three step：
A. source node periodic broadcast Hello bags.
B. neighbor node receives can forward it to the neighbor node of oneself after the Hello bags of source node, i.e. source node
Two hop nodes.
C. two hop nodes forward the Hello bags to give three hop nodes of its neighbor node, i.e. source node again, circulate successively,
Hello bags will flood to whole network.Stop flooding after all nodes at least receive a Hello bag in network, meanwhile,
If the time-to-live of Hello bags expires or packet loss can also stop.
In L2MPM agreements, the transmission quality of link is calculated using following three values：
NQ (Node Quality, node link quality), node receive the counting of the Hello bags of certain local neighbor node
Value.
EQ (Echo Quality, winding link-quality), node receive what is be sent to certain local neighbor node and returned
Hello packet count value.
RQ (Route Quality, path quality weights), node are sent to the hundred of the hello packet of certain local neighbor node
Divide ratio.
Its calculation formula is as follows：
RQ=EQ/NQ
Each node calculates the local RQ values (RQ of oneself in networkLocal), source node initialization RQ values are 255,
According to equation below
RQGlobs=RQ × RQLocal
Calculate the global RQ values (RQ in Hello bagsGlobe), then the Hello packet broadcasts after renewal are gone out, so
The transmission quality of link can be constantly updated.
More accurately to weigh link-quality, L2MPM protocol RQ values are by the nearest n times Hello bag received total
RQ values carry out average computation and obtain, and wherein n is RQ-GLOBAL-WINDOW-SIZE, and 5 are defaulted as in L2MPM agreements.It is more having
In a local neighbor node towards the destination address path, according to the RQ values in each path, RQ value sopranos are chosen, carry out data
Transmission.
RQ values are done by the RQ values of nearest n time received Hello bag in existing L2MPM agreements is averaged that (n is global window
Mouthful, acquiescence is that 5), for the Hello bags of loss, agreement is given tacit consent to its RQ value zero setting, and is filtered out when average value is calculated
Null value, thus packet loss after generate null value and be not involved in the calculating of RQ average values, Hello bags be not reaching to global window it
Before, the RQ values of packet loss will not have an impact average value, will cause after certain link disconnects, to wait global window as sky
Shi Caihui is switched to another link.Therefore RQ values cannot reflect communication link quality in real time.
The broadcast of Hello bags acquiescence is clear at intervals of 1 second, i.e. Hello-BROADCAST-INTERVAL=1s, acquiescence in L2MPM
The Routing Protocol cleaning interval time of reason is 200s, i.e. PURGE-TIMEOUT=200s.
In conclusion the prior art has the following disadvantages：Network convergence rate is slower, influence routing policy it is quick more
Newly, it is difficult to which the short time excludes the influences of the factor to network performance such as network equipment failure.
The content of the invention
In order to solve the above-mentioned problems in the prior art, the object of the present invention is to provide chain is based in WLAN
The routing failure restoration methods of road quality renewal, it can improve the multi-hop transmission performance of wireless network and the robustness of network,
Loss caused by reducing network failure, recovers network as early as possible to reach.
To achieve these goals, the technical solution adopted by the present invention is：Link-quality is based in a kind of WLAN
The routing failure restoration methods of renewal include herein below：
A：By shortening the broadcast interval of Hello bags, increase broadcasting frequency；
B：By reducing clearance time interval, the renewal of acceleration source node listing；
C：Link-quality RQ values are improved, accelerate convergence rate.
Preferable technical solution, the process improved to link-quality RQ values comprise the following steps：
Step S1, the optimization of link RQ average values：If certain node does not receive the Hello bags via its neighbors, by this
The RQ values of node are arranged to " 1 ", and when calculating link RQ values, the unreceived Hello bags RQ values of the node participate in average value
Calculate.
Further preferred technical solution, the process improved to link-quality RQ values further include step S2：
The threshold value SNR of one signal strength is set, when certain node is received from certain source node by its neighbors
During Hello bags, the signal strength snr that its neighbors is sent is extractedt, and pass through the penalty value of following formula calculating RQ
Wherein RQIt is excellentFor the RQ values after optimization, RQ is initial value.
Technical solution still more preferably, the process improved to link-quality RQ values further include step S3：
If certain node forwarding performance decline, by Acquisition Processor utilization rate CPU, memory usage MEM and network interface card load LOAD come
Optimize RQ values, make per=CPU+MEM+LOAD, two threshold value PER are added by the way of hysteresis loopLAnd PERH；
If the performance of certain a moment t nodes is pert,
Work as pert<PERLWhen,
Work as pert>PER HWhen,
Wherein, RQNewlyFor the RQ values after renewal.
Using above technical scheme, the present invention has the advantages that：
1. by shortening the broadcast interval (prior art is given tacit consent to 1 second) of Hello bags, increase broadcasting frequency, so that faster
It was found that malfunctioning node.
2. by reducing clearance time interval (prior art gives tacit consent to 200s), acceleration source node listing renewal, so as to faster
Node of fixing a breakdown, realize fault recovery.
3. the present invention solves the problems, such as packet loss, the RQ values of unreceived Hello bags are arranged to ' 1 ', in the case, if
When certain node A does not receive the Hello bags via its neighbors B, its RQ value is put 1, link when so taking average for the first time
RQ values are (255*4+1)/5, i.e., 204.When this link continues packet loss, since value 1 participates in averagely, the RQ values at this will increasingly
It is small, so as to greatly accelerate convergence, accelerate the speed for finding failure.
4. invention introduces penalty mechanism, if certain node signal continues lowly in network, this node can be determined as height
Endanger node, though link is in connected state at high-risk node, but its network congestion and transmission rate it is slower, using penalty mechanism
(signal-to-noise ratio is punished to itRQ values will be influenced with ratio forms), it can be achieved that the failure predication function of agreement.
5. if node device cpu performance, memory use and network port etc. occurs when something goes wrong in operation, node turns
Hair and routing performance decline, if neighbors is still functional and largely forward data with its, easily lead to the node collapses.The present invention
Optimize RQ values by gathering utilization rate CPU, memory usage MEM and network interface card load tri- major parameters of LOAD, with reference to Hello
The optimisation strategy of the broadcast interval of bag, routing table update interval and RQ values so that the net when agreement shortens nodes break down
Network convergent time again, so as to further enhancing the robustness of network.
Brief description of the drawings
Fig. 1 is the link transmission principle schematic in network.
Embodiment
To make the object, technical solutions and advantages of the present invention of greater clarity, with reference to instantiation and with reference to attached
Figure, the present invention is described in more detail.It should be understood that these descriptions are merely illustrative, and it is not intended to limit the present invention's
Scope.In addition, in the following description, the description to known features and technology is eliminated, to avoid the present invention is unnecessarily obscured
Concept.
Embodiment one：
The present invention provides a kind of new routing convergence strategy, to realize the recovery of routing failure in time.It is due to transmission
Caused by link-quality and external interference transmission when data packet continue packet loss, according to the present invention in its RQ value after Hello packet losses
Computed improved, can quickly exclude the serious routed path of packet loss, avoid recipient's communication impaired.
As shown in Figure 1, wherein, all host As, B, C, D have two pieces of network interface cards to be responsible for link transmission in network, therefore from
Host A has two paths to host C transmission, is respectively：A0-B1-B2-C1 and A1-D1-D2-C2, if A1 to C2 links occur
Serious packet loss, if the RQ values of the Hello bags of loss are set to 0, and 0 value can be filtered when calculating RQ values, then is needed when losing
Just it can be found that the deterioration of link, RQ results calculate as follows when bag reaches global window size n：
| RQ averages | |||||||
| For the first time： | A1 | —— | 255 | 255 | 255 | 255 | 255 |
| A0 | 166 | 172 | 174 | 178 | 165 | 171 | |
| Second： | A1 | —— | —— | 255 | 255 | 255 | 255 |
| A0 | 164 | 176 | 178 | 163 | 179 | 172 | |
| For the third time： | A1 | —— | —— | —— | 255 | 255 | 255 |
| A0 | 171 | 167 | 173 | 167 | 177 | 171 | |
| 4th time： | A1 | —— | —— | —— | —— | 255 | 255 |
| A0 | 168 | 170 | 178 | 177 | 162 | 171 | |
| 5th time： | A1 | —— | —— | —— | —— | —— | 0 |
| A0 | 169 | 171 | 176 | 173 | 166 | 171 |
Only (maximized window number n=5 herein) just meeting when lasting packet loss number reaches maximized window number in can seeing the above table
The H data on this road is gone into another routed path；After the RQ values of the Hello bags of loss are changed to 1, the calculating of its RQ value
It is as follows：
| RQ averages | |||||||
| For the first time： | A1 | 1 | 255 | 255 | 255 | 255 | 204 |
| A0 | 166 | 172 | 174 | 178 | 165 | 171 | |
| Second： | A1 | 1 | 1 | 255 | 255 | 255 | 153 |
| A0 | 164 | 176 | 178 | 163 | 179 | 172 |
After improvement by the present invention, after continuing less packet loss several times in link, such as second of packet loss in upper table, you can
RQ averages are quickly lowered, the data on A1 paths can be pass on after contrasting at this time on A0 paths, so as to reduce lasting packet loss
Influence of the path to network transmission.
Due to nodes, efficiency of transmission is deteriorated caused by load aggravates, or because dtr signal causes wireless network office
Portion's performance is unstable, and the present invention adjusts RQ values by the real-time performance parameter of combination node, introducing penalty value mechanism, dynamic, and then
Optimize performance.
There are multiple nodes in the wireless network, node A receives the Hello bags transmitted from node B, the meeting pair in node A
This bag is handled, and updates routing table to calculate new RQ values, makes RQ values=168 present invention institutes at node A increased
Processing step is as follows：
Signal strength optimization：
(1) node A extractions receive the signal strength values snr of data interior joint Bb=-35dBm.
(2) node A is by snrbWith default signal threshold value SNR=-50dBm, make following computing
Signal strength penalty value is obtained as 1.3.
(3) by penalty value bring into RQ signals optimization formula in, i.e. RQ=RQ*1.3=218.4, this i.e. signal optimize after
RQ values.
Joint behavior parameter regulation：
(4) performance parameter of node B, per=CPU+MEM+LOAD, if per at this time are extractedb=84.
(5) per is judgedbWith the PER of predetermined threshold valueLAnd PERHSize, PER hereinL=40 and PERH=70；It is it can be seen that big
In upper limit value.Calculating upper limit penalty value：
Penalty value is obtained as 0.992.
(6) binding ability punishment parameter calculates new RQ values.RQ=218.4*0.992=216.65, this is at node A
The penalty value of renewal.
From the above, it can be seen that after signal parameter and performance parameter penalty value is introduced, the RQ values of node A more can science
Reflect the characteristic of neighbor node, adjust optimization for the dynamic equalization of wireless network overall load, and then reduce in path
Localised load and avoid high load capacity node due to big quantity processing collapse.
It should be appreciated that the above-mentioned embodiment of the present invention is used only for exemplary illustration or explains the present invention's
Principle, without being construed as limiting the invention.Therefore, done in the case of without departing from the thought and scope of the present invention any
Modification, equivalent substitution, improvement etc., should all be included in the protection scope of the present invention.In addition, appended claims purport of the present invention
Covering the whole changes fallen into scope and border or this scope and the equivalents on border and repairing
Change.
Claims (1)
1. in a kind of WLAN based on link-quality renewal routing failure restoration methods, it is characterised in that it include with
Lower content：
By shortening the broadcast interval of Hello bags, increase broadcasting frequency；
By reducing clearance time interval, the renewal of acceleration source node listing；
Link-quality RQ values are improved, accelerate convergence rate；
The process improved to link-quality RQ values comprises the following steps：
Step S1, the optimization of link-quality RQ average values：If certain node does not receive the Hello bags via its neighbors, by this
The RQ values of node are arranged to " 1 ", and when calculating link-quality RQ values, the unreceived Hello bags RQ values of the node participate in flat
Mean value computation；
The process improved to link-quality RQ values further includes step S2：
The threshold value SNR of one signal strength is set, when certain node receives the Hello bags from certain source node by its neighbors
When, extract the signal strength snr that its neighbors is sentt, and pass through the penalty value of following formula calculating RQ
Wherein RQIt is excellentFor the RQ values after optimization, RQ is initial value；
The process improved to link-quality RQ values further includes step S3：If certain node forwarding performance declines, pass through
Acquisition Processor utilization rate CPU, memory usage MEM and network interface card load LOAD to optimize RQ values, make per=CPU+MEM+
LOAD, adds two threshold value PER by the way of hysteresis loopLAnd PERH；
If the performance of certain a moment t nodes is pert,
Work as pert<PERLWhen,
Work as pert>PERHWhen,
Wherein, RQNewlyFor the RQ values after renewal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510004730.3A CN104618945B (en) | 2015-01-06 | 2015-01-06 | Routing failure restoration methods based on link-quality renewal in WLAN |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510004730.3A CN104618945B (en) | 2015-01-06 | 2015-01-06 | Routing failure restoration methods based on link-quality renewal in WLAN |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104618945A CN104618945A (en) | 2015-05-13 |
| CN104618945B true CN104618945B (en) | 2018-05-01 |
Family
ID=53153171
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510004730.3A Expired - Fee Related CN104618945B (en) | 2015-01-06 | 2015-01-06 | Routing failure restoration methods based on link-quality renewal in WLAN |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104618945B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106130905B (en) * | 2016-06-03 | 2019-04-23 | 西安电子科技大学 | A Link Restoration Method for HWMP A priori Tree Routing Mode |
| CN109450800B (en) * | 2018-12-17 | 2021-12-07 | 西安空间无线电技术研究所 | Method and system for dynamically adjusting route interaction period of cluster ad hoc network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102036337A (en) * | 2010-12-15 | 2011-04-27 | 山东大学 | Communication method based on improved AODV protocol |
| CN102368864A (en) * | 2011-09-02 | 2012-03-07 | 中国人民解放军总参谋部第六十三研究所 | Dynamic multi-path routing algorithm based on interference activity estimation |
| CN103108374A (en) * | 2013-01-29 | 2013-05-15 | 北京交通大学 | Energy saving routing algorithm of composite structure mine emergency rescue wireless mesh network |
| CN104010289A (en) * | 2014-05-21 | 2014-08-27 | 广东工业大学 | A communication method for mutual discovery of neighbor nodes in wireless ad hoc network |
| CN104202787A (en) * | 2014-09-10 | 2014-12-10 | 西安电子科技大学 | Optimum redundancy based adaptive wireless sensor network routing method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101294973B1 (en) * | 2009-12-08 | 2013-08-09 | 한국전자통신연구원 | Multi-channel/multi-interface mesh router and method for fixed-distirbuted channel assignment |
-
2015
- 2015-01-06 CN CN201510004730.3A patent/CN104618945B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102036337A (en) * | 2010-12-15 | 2011-04-27 | 山东大学 | Communication method based on improved AODV protocol |
| CN102368864A (en) * | 2011-09-02 | 2012-03-07 | 中国人民解放军总参谋部第六十三研究所 | Dynamic multi-path routing algorithm based on interference activity estimation |
| CN103108374A (en) * | 2013-01-29 | 2013-05-15 | 北京交通大学 | Energy saving routing algorithm of composite structure mine emergency rescue wireless mesh network |
| CN104010289A (en) * | 2014-05-21 | 2014-08-27 | 广东工业大学 | A communication method for mutual discovery of neighbor nodes in wireless ad hoc network |
| CN104202787A (en) * | 2014-09-10 | 2014-12-10 | 西安电子科技大学 | Optimum redundancy based adaptive wireless sensor network routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104618945A (en) | 2015-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101415248B (en) | Establishment method of cross-layer dynamic source routing protocol based on load balancing | |
| CN101674630B (en) | Implementation method of cross-layer routing capable of perceiving congestion | |
| Ha et al. | Dynamic and distributed load balancing scheme in multi-gateway based 6LoWPAN | |
| Tekaya et al. | Multipath routing mechanism with load balancing in ad hoc network | |
| CN108449271A (en) | A Routing Method for Monitoring Path Node Energy and Queue Length | |
| Guo et al. | UAV-aided cross-layer routing for MANETs | |
| Nguyen et al. | A load-aware routing metric for wireless mesh networks | |
| CN104618945B (en) | Routing failure restoration methods based on link-quality renewal in WLAN | |
| Chai et al. | Access-enhanced hybrid routing protocol for hybrid wireless mesh network | |
| CN102316527A (en) | Multi-path ad hoc on-demand distance vector (AODV) routing method based on service quality sensing | |
| CN110267321A (en) | Design method of greedy multicast routing protocol in 3D scene | |
| Ahmad et al. | Enhanced AODV route Discovery and Route Establishment for QOS provision for real time transmission in MANET | |
| CN105517050B (en) | Wireless route method based on congestion control | |
| Le et al. | LARM: A load-aware routing metric for multi-radio wireless mesh networks | |
| CN115150914A (en) | An Efficient Routing Mechanism Based on Multipath Routing | |
| Gaur et al. | Load-aware routing for non-persistent small-world wireless mesh networks | |
| Agarkar et al. | An Efficient Restricted Flooding Based Route Discovery (RFBRD) Scheme for AODV Routing | |
| CN111148175A (en) | Self-adaptive route repairing method in wireless self-organizing network | |
| Jing et al. | On-demand multipath routing protocol with preferential path selection probabilities for MANET | |
| Gui et al. | An entropy-based long-life multipath routing algorithm in manet | |
| Rao et al. | Performance Evaluation of routing protocols in Wireless Mesh networks | |
| Li et al. | The network-based candidate forwarding set optimization approach for opportunistic routing in wireless sensor network | |
| Bhardwaj et al. | Congestion aware multi-path routing protocol for mobile ad-hoc networks | |
| Szwabe et al. | Integration of multi-path Optimized Link State Protocol with max-weight scheduling | |
| JP5483489B2 (en) | Radio and bandwidth aware routing metrics for multi-radio, multi-channel and multi-hop wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180501 Termination date: 20220106 |