CN101715225A - Routing method of self-adapting self-organized network in cognitive network - Google Patents
Routing method of self-adapting self-organized network in cognitive network Download PDFInfo
- Publication number
- CN101715225A CN101715225A CN200910219099A CN200910219099A CN101715225A CN 101715225 A CN101715225 A CN 101715225A CN 200910219099 A CN200910219099 A CN 200910219099A CN 200910219099 A CN200910219099 A CN 200910219099A CN 101715225 A CN101715225 A CN 101715225A
- Authority
- CN
- China
- Prior art keywords
- node
- information
- network
- route
- rrep
- 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
Images
Abstract
The invention discloses a routing method of a self-adapting self-organized network in a cognitive network, mainly solving the problem that the traditional cognitive network routing methods lack of network QoS (quality of service) guarantees. The routing method comprises the following steps of: sending RREQ information by a source node by adopting a broadcast flooding method; when a relay node transmits the RREQ information, extracting the state of a network node, estimating the waiting time delay of the node in the network and adding the waiting time delay during transmitting the RREQ information; after a target node receives the RREQ information, sending the RREQ information according to a principle of firstly returning early arrived information and establishing a route; after establishing the route, repeatedly sending the same RREQ information to the resource node by the target node to update network state information; and detecting the quality of the route and determining whether to increase or reduce the life time of the route or not. The method has the advantages of short data transmission time delay, small packet loss, high route efficiency and large network load capacity and can be applied to cognitive radio networks.
Description
Technical field
The present invention relates to wireless communication field, particularly set up the method for route, can be used for cognition wireless network.
Background technology
Cognition wireless network (Cognitive Network) is defined as: wireless cognition network possesses a cognitive process to present network condition, produces network behavior based on this process.Wireless cognition network can be learnt the variation of network, and behavior is in the future made a prediction, and considers the end-to-end target requirement that gets simultaneously.
A kind of routing mechanism that is applicable to environment of cognitive radio network of the prior art is improvement AODV (Ad hoc on-demand distance vector) the MANET routing algorithm based on Q study (Q-learning) technology that is proposed by people such as Minsoo Lee.This algorithm with the Q learning art and as required route combine, adopt the similar routing mechanism as required of distance vector as required with AODV, route set up be divided into route requests and two stages of route response.In route request stage, source node is broadcast to the route request information RREQ (Router Request) of destination node, and is broadcast to destination node in the mode of flooding; After destination node was received RREQ, the propagation path of selecting this RREQ was the route that source node arrives destination node, started the route response process, according to the principle of accumulation time delay minimum, set up route response message RREP (Router Response) and was returned to source node; If source node is received RREP, the expression route is set up successfully, and repayment R (Rewards) is incentive repayment, and the Q value increasing degree in the Q study is bigger, and Route Age prolongs; Otherwise if source node does not have RREP, the expression route is set up failure, and repayment R (Rewards) is the punitive repayment; Q value increasing degree in the Q study is very little, and Route Age reduces.
There is following problem at least in above-mentioned prior art:
Only realized the part of functions of cognition network routing algorithm based on the improvement AODV MANET routing algorithm of Q learning art, only be confined to successfully adjust network state with judging whether route is set up, and lack perception to the various performances of self network state, and its algorithm has significant limitation to the adaptivity of network, lacks the consideration that network service quality QoS (Quality of Service) is guaranteed.
Summary of the invention
The objective of the invention is to problem at above-mentioned prior art, self-adapting self-organized network method for routing in a kind of cognition network is proposed, to realize having bigger adaptivity, improved the service quality of network to the perception of the various performances of self network with to network.
To achieve these goals, cognitive network route method of the present invention comprises the steps:
A. source node and destination node send the information step:
Source node in the network adopts the broadcast flooding mode to send RREQ information, destination node is received after the RREQ information according to arriving first the principle of returning earlier, set up and send RREP information and answer source node, after source node is received RREP information, route is set up for the first time, and destination node repeats to send identical RREP information to source node in this route in life cycle;
B. via node changes route step life cycle
Via node in the network is received the RREP information that destination node sends, and when transmitting RREP information, upgrades the state information of this node, detects routing state, changes the life cycle of route;
C. via node is transmitted RREQ information step
Source node in the network is crossed after date in route entry, sends RREQ information once more to the destination node pathfinding, and via node carries out following operation when this RREQ information of forwarding:
(C1) number of packet and estimate its propagation delay time in the buffer memory of statistics present node MAC layer, according to node packet loss L in the state information of this node and the packet arrival rate λ in a period of time from now on, utilize the little theorem to extrapolate the average waiting time delay W of this node;
(C2) according to the average waiting time delay W that obtains, postpone W and transmit RREQ information after the time, adjust the selection of routed path.
The present invention has following advantage:
1) because destination node repeats to send identical RREP information to source node on existing route, make the via node on this route to make network can obtain up-to-date node status information fast constantly by the node status information of RREP information updating oneself;
2) because by adopting the Q learning method, make network can carry out autonomous learning, route length life cycle in the adaptive adjustment network, make the measured route entry of matter obtain longer life cycle, ropy route entry life span reduces, help network and seek the route of better quality again, improved the performance of network;
3) via node can estimate the average latency of node, and transmits RREQ information after postponing the average latency, make can avoid when selecting route through transmittability near saturated node, balance the load of node in the network;
In sum, method for routing of the present invention can be adjusted Route Selection and Route Age dynamically according to the state variation of network, has shortened the transmission delay of business in the network, has improved the efficient of route and the peak load ability of network.
Description of drawings
Fig. 1 is the flow chart that the present invention sets up route;
Fig. 2 is that Q value of the present invention is upgraded flow chart;
Fig. 3 is node time-delay analysis figure of the present invention.
Embodiment
With reference to Fig. 1, route of the present invention is set up and is comprised the steps:
Step 1, source node send the pathfinding of RREQ information, and destination node sends RREP information and answers source node.
(1a) source node in the network adopts the broadcast flooding mode to send RREQ information, destination node is received after the RREQ information according to arriving first the principle of returning earlier, set up and also to send RREP information and answer source node, the transmit path of RREP information is that the path Yuan Lu according to the RREQ information via of being received returns;
After (2a) source node is received the RREP information of destination node transmission, finish the first foundation of route, destination node sends packet on this path, carry out transfer of data;
After (2a) foundation of route was finished, in the life cycle of its route, destination node repeated to send identical RREP information at regular intervals to source node.
Step 2, via node in the network are upgraded node status information and are changed route life cycle.
Finished after this in route foundation, via node receives the RREP information that destination node sends, when transmitting RREP information, collect the state information of via node, detect routing state, whether decision increases or reduces the life cycle of this route, and its concrete steps are as follows with reference to Fig. 2:
(2a) via node extracts the RREP number Num that the upstream neighbors in the RREP information sends
Send, add up the RREP number Num that oneself receives altogether simultaneously
Receive, according to packet loss immediately
Estimate the packet loss of via node: L
f=α L
F-1+ (1-α) L
f, 0＜α＜1 is with L
fDeposit in the state information of node;
(2b) via node extracts the time of the RREP information of the upstream neighbors transmission in the RREP information, extract the time that oneself receives RREP information simultaneously, estimate a jumping time delay W of via node with this, W is deposited in the state information of node, and in RREP information, put into the transmission RREP information time of oneself;
(2c) according to the estimating bag-losing ratio L that obtains
fWith time delay W of estimation, utilize the Q learning method, the target setting function: G=(1-L
f) W+L
f(T
r+ G), repay function immediately
Release and repay function immediately:
T
rBe to wait for the time that retransmits behind the packet loss;
Return value immediately when (2d) setting the l time renewal is R
l, the return value that obtains the l time is: R
l=α R
L-1+ (1-α) R
l, 0＜α＜1, R
L-1It is the return value that the l-1 time renewal obtains;
The R of return value immediately when (2e) utilizing the l time renewal
lWith the return value R that upgrades to obtain for the l-1 time
L-1Compare, upgrade the Q value, if R
L-1＜R
l, Q
l=α * R
l+ (1-α) Q
L-1If R
L-1〉=R
l,
0＜α＜1, Q
L-1It is the Q value that obtains of the l-1 time renewal, n is the node number in the network, after the Q value reaches certain wealthy family limit value, illustrates that the quality in this path is better, can and keep lower packet loss with short time delay transferring large number of data bag, prolong the life cycle of this road warp; Otherwise, after the Q value reaches certain threshold ones, this paths poor quality being described, propagation delay time is big and packet loss is higher, reduces the life cycle in this path, so that source node can resend the pathfinding of RREQ information faster, seeks better path.
Step 3, the average waiting time delay of via node estimation node, time delay is transmitted in decision.
With reference to Fig. 3, the time delay in the network is divided into usually: processing delay, queuing delay, propagation delay time and propagation delay; Processing delay is meant the time delay between the output of input that grouping arrives a node and this node of this grouping arrival; Queuing delay is meant that grouping enters transmit queue to the actual time delay that enters transmission of this grouping; Propagation delay time is meant that sending node begins to send first bit to last the bit required time that distributes this grouping on transmission link; Propagation delay is meant that sending node sends first bit arrives receiving node constantly to this bit time delay on transmission link.Owing to the significantly raising of computer process ability, processing delay and propagation delay are very small, can ignore, so only consider the queuing delay and the propagation delay time of node in the reality.
Via node in the network according to the little theorem, is estimated the average waiting time delay W of node after receiving RREQ information and extracting and add up required node status information, estimation steps is as follows:
(2a) setting network at the middle and upper levels the data packet arrival process obey memoryless Poisson process, the at interval obeys index distribution of giving out a contract for a project, node in the network carries one or more business through oneself, by according to the approximate principle of Kleinrock independence, obtain the queuing system that the network delay characteristic is obeyed M/M/1;
When (2b) via node is transmitted RREQ information by statistics the number N of packet in the buffer memory of present node, extract the average arrival rate λ of system in the state information of node, by little theorem average delay as can be known
(2c) access delay of each node is:
R
cThe probability that the node that expression participates in the competition bumps, W
0Expression minimum competition window number, Num represents to compete the node number;
(2d) according to the number N of packet and the access delay D of node in the buffer memory of the MAC layer that obtains
Backoff, the average service time of calculating each user is:
T
rBe to wait for the time that retransmits, d behind the packet loss
PacketBe each packet size, C is a Channel Transmission speed;
(2e) according to each user's average delay T and average service time
Obtain each user's average latency:
When transmitting RREQ information, via node postpones to transmit this RREQ information behind the average latency W, avoids in the time of can making routing thus selecting the routed path of high-quality more through the excessive via node of overload, improves the throughput and the router efficiency of whole network.
Terminological interpretation
AODV:Ad hoc on-demand distance vector, the self network organized and distance vector;
RREQ:Router Request, routing information request;
RREP:Router Reply, the route reply message;
R:Rewards, repayment;
QOS:Quality Of Service, service quality.
Claims (5)
1. the self-adapting self-organized network method for routing in the cognition network comprises:
A. source node and destination node send the information step:
Source node in the network adopts the broadcast flooding mode to send RREQ information, destination node is received after the RREQ information according to arriving first the principle of returning earlier, set up and send RREP information and answer source node, after source node is received RREP information, route is set up for the first time, and destination node repeats to send identical RREP information to source node in this route in life cycle;
B. via node changes route step life cycle
Via node in the network is received the RREP information that destination node sends, and when transmitting RREP information, upgrades the state information of this node, detects routing state, changes the life cycle of route;
C. via node is transmitted RREQ information step
Source node in the network is crossed after date in route entry, sends RREQ information once more to the destination node pathfinding, and via node carries out following operation when this RREQ information of forwarding:
(C1) number of packet and estimate its propagation delay time in the buffer memory of statistics present node MAC layer, according to node packet loss L in the state information of this node and the packet arrival rate λ in a period of time from now on, utilize the little theorem to extrapolate the average waiting time delay W of this node;
(C2) according to the average waiting time delay W that obtains, postpone W and transmit RREQ information after the time, adjust the selection of routed path.
2. cognitive network route method according to claim 1, wherein the described via node of step B upgrades the state information of this node, detects routing state, changes the life cycle of route, carries out as follows:
(B1) extract the RREP information number Num that the upstream neighbors in the RREP information sends
Send, add up the RREP information number Num that oneself receives altogether simultaneously
Receive, the packet loss L of estimation via node
f, with L
fDeposit in the state information of node, and in RREP information, put into the number that sends RREP information of oneself;
(B2) the upstream neighbors in the extraction RREP information sends the time of RREP information, extract the time that oneself receives RREP information simultaneously, with this jumping time delay W who estimates via node, W is deposited in the state information of node, and in RREP information, put into the transmission RREP information time of oneself;
(B3) statistics obtains current packet arrival rate λ thus when the route entry number of this node, λ is deposited in the state information of node;
(B4) utilize existing data in the node status information, according to the Q learning method by target function G=(1-L
f) W+L
f(T
r+ G), calculate return value immediately
T
rBe the wait re-transmission time behind the given packet loss,
(B5) according to the variation of return value R immediately, upgrade Q value, when Q value during, increase the life cycle of this road warp greater than the wealthy family limit value of setting, when Q value during, reduce the route life cycle in this path less than the threshold ones of setting.
3. cognitive network route method according to claim 2, wherein the packet loss L of the described estimation via node of step (B1)
f, be to carry out following operation:
At first, calculate packet loss immediately
Num
ReceiveBe the RREP number that the node statistics receives altogether oneself, Num
SendBe the RREP number of the upstream neighbors transmission in the extraction RREP information,
Secondly, according to packet loss L immediately
f, estimate that the packet loss of via node is: L
f=α L
F-1+ (1-α) L
f, 0＜α＜1.
4. cognitive network route method according to claim 2, wherein step (B5) is upgraded the Q value according to return value R immediately, is to carry out according to following steps:
Return value immediately when (4a) setting the l time renewal is R
l, the return value that obtains the l time is: R
l=α R
L-1+ (1-α) R
l, 0＜α＜1, R
L-1It is the return value that the l-1 time renewal obtains;
The R of return value immediately when (4b) upgrading with the l time
lWith the return value R that upgrades to obtain for the l-1 time
L-1Compare, upgrade the Q value, if R
L-1＜R
l, Q
l=α * R
l+ (1-α) Q
L-1If R
L-1〉=R
l,
0＜α＜1, Q
L-1Be the Q value that obtains of the l-1 time renewal, n is the node number in the network.
5. cognitive network route method according to claim 1, wherein the described little of the utilization theorem of step (C1) is extrapolated the average waiting time delay of this node, carries out according to following steps:
(5a) arrival process of setting network upper layer data bag is obeyed memoryless Poisson process, and the obeys index distribution at interval of giving out a contract for a project according to the approximate principle of Kleinrock independence, obtains the queuing system that the network delay characteristic is obeyed M/M/1;
When (5b) via node was transmitted RREQ information, the number N of packet in the buffer memory of statistics present node MAC layer extracted the average arrival rate λ of system in the state information of node, is obtained each user's average delay by the little theorem
(5c) calculate the access delay of each node:
P
cThe probability that the node that expression participates in the competition bumps, W
0Expression minimum competition window number, Num represents to compete the node number;
(5d) according to the number N of packet in the buffer memory of MAC layer and the access delay D of node
Backoff, calculate each user's average service time:
D wherein
PacketBe each packet size, C is a Channel Transmission speed;
(5e) according to each user's average delay T and average service time
, obtain average latency of each user:
When transmitting RREQ information, via node postpones to transmit this RREQ information behind the average latency W.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910219099 CN101715225B (en) | 2009-11-20 | 2009-11-20 | Routing method of self-adapting self-organized network in cognitive network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200910219099 CN101715225B (en) | 2009-11-20 | 2009-11-20 | Routing method of self-adapting self-organized network in cognitive network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101715225A true CN101715225A (en) | 2010-05-26 |
| CN101715225B CN101715225B (en) | 2012-12-05 |
Family
ID=42418384
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200910219099 Expired - Fee Related CN101715225B (en) | 2009-11-20 | 2009-11-20 | Routing method of self-adapting self-organized network in cognitive network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101715225B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854695A (en) * | 2010-06-12 | 2010-10-06 | 苏州联科盛世科技有限公司 | Method for determining routing of wireless sensor network based on energy and delay ant colony optimization |
| CN102025621A (en) * | 2010-12-07 | 2011-04-20 | 南京邮电大学 | Routing selection method of cognitive network based on mapping mechanism |
| CN102025620A (en) * | 2010-12-07 | 2011-04-20 | 南京邮电大学 | Cognitive network QoS (quality of service) guarantee method on basis of service differentiation |
| CN102170706A (en) * | 2011-05-30 | 2011-08-31 | 西安电子科技大学 | Spectrum access method for distributed cognitive radio system |
| CN102413469A (en) * | 2011-10-21 | 2012-04-11 | 重庆大学 | Networking method of cognitive wireless shadow network and terminal access method thereof |
| CN102413539A (en) * | 2011-10-19 | 2012-04-11 | 西安电子科技大学 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
| CN103037416A (en) * | 2012-12-17 | 2013-04-10 | 中国石油大学(华东) | Multi-node cooperation distance measuring method in ultra wide band wireless sensor network |
| CN103188152A (en) * | 2011-12-31 | 2013-07-03 | 南京邮电大学 | Cognitive network quality of service (QoS) routing method based on service differentiation |
| CN103686734A (en) * | 2013-12-03 | 2014-03-26 | 西安电子科技大学 | Method for selecting multi-homed mobile subnet credible mobile router based on cloud trust model |
| CN105867952A (en) * | 2015-01-20 | 2016-08-17 | 中国科学院上海高等研究院 | Software upgrading method and system |
| CN105897585A (en) * | 2016-04-11 | 2016-08-24 | 电子科技大学 | Q learning packet transmission method based on delay constraints for ad hoc network |
| CN105979559A (en) * | 2016-04-19 | 2016-09-28 | 上海海事大学 | Residual path delivery time estimation method for differentiated queuing service system |
| CN107370677A (en) * | 2016-05-12 | 2017-11-21 | 西安三星电子研究有限公司 | The method and apparatus that node determines path life span |
| CN111356197A (en) * | 2019-12-11 | 2020-06-30 | 航天行云科技有限公司 | Path switching method of multi-node routing and related equipment |
| WO2021088801A1 (en) * | 2019-11-06 | 2021-05-14 | 中兴通讯股份有限公司 | Routing method, network controller, system, and storage medium |
| CN114938530A (en) * | 2022-06-10 | 2022-08-23 | 电子科技大学 | Wireless ad hoc network intelligent networking method based on deep reinforcement learning |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1214572C (en) * | 2002-07-16 | 2005-08-10 | 华为技术有限公司 | Routing calculation method based on opened shortest route priority routing protocol |
| EP1720297A1 (en) * | 2005-05-02 | 2006-11-08 | Siemens Aktiengesellschaft | Routing method for the optimisation of the load of links and of the improvement of availability |
| CN100413291C (en) * | 2005-10-26 | 2008-08-20 | 广东省电信有限公司研究院 | Method of implementing business discrimination and business service quality control on broadband network |
-
2009
- 2009-11-20 CN CN 200910219099 patent/CN101715225B/en not_active Expired - Fee Related
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854695A (en) * | 2010-06-12 | 2010-10-06 | 苏州联科盛世科技有限公司 | Method for determining routing of wireless sensor network based on energy and delay ant colony optimization |
| CN102025621B (en) * | 2010-12-07 | 2013-08-07 | 南京邮电大学 | Routing selection method of cognitive network based on mapping mechanism |
| CN102025621A (en) * | 2010-12-07 | 2011-04-20 | 南京邮电大学 | Routing selection method of cognitive network based on mapping mechanism |
| CN102025620A (en) * | 2010-12-07 | 2011-04-20 | 南京邮电大学 | Cognitive network QoS (quality of service) guarantee method on basis of service differentiation |
| CN102025620B (en) * | 2010-12-07 | 2013-01-02 | 南京邮电大学 | Cognitive network QoS (quality of service) guarantee method on basis of service differentiation |
| CN102170706A (en) * | 2011-05-30 | 2011-08-31 | 西安电子科技大学 | Spectrum access method for distributed cognitive radio system |
| CN102170706B (en) * | 2011-05-30 | 2013-09-25 | 西安电子科技大学 | Spectrum access method for distributed cognitive radio system |
| CN102413539B (en) * | 2011-10-19 | 2014-04-16 | 西安电子科技大学 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
| CN102413539A (en) * | 2011-10-19 | 2012-04-11 | 西安电子科技大学 | Geographical position-based large-scale wireless distribution type network self-adaptive cooperative routing method |
| CN102413469A (en) * | 2011-10-21 | 2012-04-11 | 重庆大学 | Networking method of cognitive wireless shadow network and terminal access method thereof |
| CN102413469B (en) * | 2011-10-21 | 2014-05-07 | 重庆大学 | Networking method of cognitive wireless shadow network and terminal access method thereof |
| CN103188152A (en) * | 2011-12-31 | 2013-07-03 | 南京邮电大学 | Cognitive network quality of service (QoS) routing method based on service differentiation |
| CN103188152B (en) * | 2011-12-31 | 2015-07-08 | 南京邮电大学 | Cognitive network quality of service (QoS) routing method based on service differentiation |
| CN103037416A (en) * | 2012-12-17 | 2013-04-10 | 中国石油大学(华东) | Multi-node cooperation distance measuring method in ultra wide band wireless sensor network |
| CN103686734A (en) * | 2013-12-03 | 2014-03-26 | 西安电子科技大学 | Method for selecting multi-homed mobile subnet credible mobile router based on cloud trust model |
| CN103686734B (en) * | 2013-12-03 | 2016-08-17 | 西安电子科技大学 | Many places mobile subnetwork based on cloud trust model credible mobile router system of selection |
| CN105867952A (en) * | 2015-01-20 | 2016-08-17 | 中国科学院上海高等研究院 | Software upgrading method and system |
| CN105897585A (en) * | 2016-04-11 | 2016-08-24 | 电子科技大学 | Q learning packet transmission method based on delay constraints for ad hoc network |
| CN105897585B (en) * | 2016-04-11 | 2019-07-23 | 电子科技大学 | A kind of Q study block transmission method of the self-organizing network based on delay constraint |
| CN105979559A (en) * | 2016-04-19 | 2016-09-28 | 上海海事大学 | Residual path delivery time estimation method for differentiated queuing service system |
| CN105979559B (en) * | 2016-04-19 | 2019-09-10 | 上海海事大学 | A kind of residual paths time of delivery estimation method for difference queue service system |
| CN107370677A (en) * | 2016-05-12 | 2017-11-21 | 西安三星电子研究有限公司 | The method and apparatus that node determines path life span |
| CN107370677B (en) * | 2016-05-12 | 2021-01-26 | 西安三星电子研究有限公司 | Method and equipment for determining path survival time by node |
| WO2021088801A1 (en) * | 2019-11-06 | 2021-05-14 | 中兴通讯股份有限公司 | Routing method, network controller, system, and storage medium |
| CN111356197A (en) * | 2019-12-11 | 2020-06-30 | 航天行云科技有限公司 | Path switching method of multi-node routing and related equipment |
| CN114938530A (en) * | 2022-06-10 | 2022-08-23 | 电子科技大学 | Wireless ad hoc network intelligent networking method based on deep reinforcement learning |
| CN114938530B (en) * | 2022-06-10 | 2023-03-21 | 电子科技大学 | Wireless ad hoc network intelligent networking method based on deep reinforcement learning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101715225B (en) | 2012-12-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101715225B (en) | Routing method of self-adapting self-organized network in cognitive network | |
| Li et al. | Adaptive quality-of-service-based routing for vehicular ad hoc networks with ant colony optimization | |
| CN111479306B (en) | Q-learning-based flight ad hoc network QoS routing method | |
| CN101534523B (en) | Cognitive network route method with service sensing ability | |
| CN101980565B (en) | QoS-based Ad Hoc network adaptive node speed multi-path routing method | |
| CN101600227B (en) | Distributed network routing method and routing device | |
| CN110708736B (en) | Dynamic routing method and system based on energy efficiency relay selection | |
| EP1368941A2 (en) | Efficient path learning in network | |
| CN103476086B (en) | Dynamic multi-path AODV method for routing based on the prediction of node congestion degree | |
| CN101932062A (en) | Multipath routing method in Ad Hoc network environment | |
| Ghaffari et al. | Energy-efficient and QoS-aware geographic routing protocol for wireless sensor networks | |
| CN113141592B (en) | Long-life-cycle underwater acoustic sensor network self-adaptive multi-path routing method | |
| CN105636062A (en) | Cognitive radio network transmission learning method for moderate business services | |
| CN111148178B (en) | DSR routing protocol implementation method based on unmanned aerial vehicle ad hoc network | |
| CN103108372B (en) | Interference sensing cross-layer routing method based on node sending and receiving capacity | |
| CN110191053B (en) | Wireless ad hoc network multipath routing method based on cognitive learning | |
| CN108684065A (en) | Relay selection method based on ant group optimization in a kind of car networking | |
| CN107105388B (en) | A kind of vehicle-mounted network route method of cross-layer based on link transmission ability | |
| KR100872351B1 (en) | Routing method of ad-hoc network | |
| Chai et al. | A multi-objective Dyna-Q based routing in wireless mesh network | |
| CN101155125B (en) | Method for processing congestion | |
| Zhong et al. | Adaptive load balancing algorithm for multiple homing mobile nodes | |
| He et al. | A feedback control scheme for resource allocation in wireless multi-hop ad hoc networks | |
| Musyoka et al. | Mutation Based Hybrid Routing Algorithm for Mobile Ad-hoc Networks | |
| El Ouadrhiri et al. | Controlling messages for probabilistic routing protocols in Delay-Tolerant 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121205 Termination date: 20181120 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |