CN105577547B - Multi-Qos route selection method is based in a kind of mobile ad-hoc network - Google Patents
Multi-Qos route selection method is based in a kind of mobile ad-hoc network Download PDFInfo
- Publication number
- CN105577547B CN105577547B CN201610030662.2A CN201610030662A CN105577547B CN 105577547 B CN105577547 B CN 105577547B CN 201610030662 A CN201610030662 A CN 201610030662A CN 105577547 B CN105577547 B CN 105577547B
- Authority
- CN
- China
- Prior art keywords
- node
- route
- path
- rreq
- routing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- 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/302—Route determination based on requested QoS
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present invention relates to multi-Qos route selection method is based in a kind of mobile ad-hoc network, belong to mobile communication technology field.Method includes the following steps: the generation of route request information: including inquiring itself routing table, if without up to routing, initiate route finding process, the destination node sequence number domain that destination node sequence number is grouped to route request information in duplication routing table, source node broadcasts are by request message to neighbor node；The processing and forwarding of route request information: including the judgement to access criterion, respective handling is carried out to access criterion judging result, judge whether node receives the route request information grouping of identical ID and identical sources node IP address according to route forwarding table information, and respective handling is done to judging result；The generation and processing of route replies message: route replies are generated including destination node, intermediate node generates route replies, processing of the intermediate node to routing response message, the processing in no route replies path.This method avoid performance bottleneck nodes, save routing cost, improve system performance.
Description
Technical field
The invention belongs to mobile communication technology field, it is related in a kind of mobile ad-hoc network based on multi-Qos Route Selection
Method.
Background technique
With the fast development of wireless communication and mobile calculation technique and wireless communication device (as hand-held digital device,
Wearable computer and in-vehicle wireless device) increase rapidly, user both can fast access into network, access Internet resources, and energy
Networking whenever and wherever possible, shared information.
According to the difference of networking control mode, cordless communication network is generally divided into centralization and non-stop layer self-organizing formula two
Class.Centralized network (such as cell mobile communication systems, wired backbone) needs the preparatory base station disposed, switching centre
Fixed network infrastructure.However certain special occasions are (as the communication on battlefield, the rescue after earthquake, field science are examined or check, are remote
The temporary meeting etc. in area) fixation means disposed are not had usually, therefore it is capable of the MAENT of interim quickly networking just at these
In the case of come into being.
Word " AdHoc " derives from Latin language, looks like for " specific, dedicated ", alternatively referred to as " self-organization network " or " nothing
Fixation means net ".IEEE802.11 standard committee original adoption " Ad Hoc network " word describes this self-organizing network,
Internet engineering task force (The Internet Engineering Task Force, IETF) claims Ad Hoc network
For MANET.Node in network can direct communication depend on the distance between node maximum communication range and two nodes, not straight
The node in communication range is connect, relay node is needed to forward, therefore MANET is also referred to as wireless multi-hop network.
With mobile ad-hoc network application it is extensive, multimedia massive dataflow and in real time application there is an urgent need to
It accurately and reliably can rapidly transmit, these all propose high requirement to the QoS performance of MANET, need Routing Protocol can
Certain QoS guarantee is provided.The resources such as nodes energy, network bandwidth are limited, make MANET routing research become difficult and
It is complicated.
Therefore, study and realize how using limited Internet resources find between source node and destination node have compared with
The method for routing of high QoS guarantee becomes the difficult point of research, has important practical significance.
Summary of the invention
In view of this, the purpose of the present invention is to provide be based on multi-Qos Route Selection side in a kind of mobile ad-hoc network
Method, specifically includes the following steps:
S1: the generation of route request information: including inquiring itself routing table, if initiating route discovery mistake without up to routing
Journey replicates the destination node sequence number domain that destination node sequence number is grouped to route request information in routing table, source node broadcast
Route request information is to neighbor node；
S2: the processing and forwarding of route request information: including to access criterion judgement, to access criterion judging result into
Row respective handling judges whether node receives identical route request information ID<RREQ_ID>and phase according to route forwarding table information
The route request information of source node IP address is grouped, and does respective handling to judging result；
S3: the generation and processing of route replies message: route replies are generated including destination node, intermediate node generates routing
Response, processing of the intermediate node to routing response message, the processing in no route replies path.
Further, in step sl, if the sequence number of the destination node can not be obtained, by route request information<RREQ>
The domain " U " sets 1 in grouping, and destination node sequence number is labeled as unknown；Source node sequence number in the RREQ message is set as the section
The current sequence number of point oneself adds the domain 1, RREQ_ID to be set as the RREQ_ID that present node uses and adds 1, will be in the RREQ message
The zero setting of hop count domain.
Further, in step sl, source node broadcasts RREQ message to neighbor node, and source node is by the RREQ message
RREQ_ID and source node IP address caching a period of time, the time span are equal to path hunting time；When the source node receives
When the RREQ grouping that its adjacent node is sent, RREQ grouping is abandoned.
Further, in step s 2, the processing and forwarding of the route request information, intermediate node receive route requests and disappear
After breath grouping, access criterion judgement is carried out first, judges whether nodal cache area queue length is lower than maximum queue length
80%, whether residue energy of node is greater than the 10% of primary power.
Further, in step s 2, it is divided into two kinds of situations:
If 1) node is unsatisfactory for access criterion, the route request information grouping which receives does not continue to forward, and saves
Point can not access path；
If 2) meet access criterion, further according to routing forwarding list judge node whether received mistake with mutually going the same way
It is grouped by the route request information of request message ID and source node IP address；
If node meets access criterion, in two kinds of situation:
21) RERQ grouping if they are the same, is then abandoned；
22) if it is different, illustrating that RREQ reaches the node through different paths, then entrained information in RREQ grouping is saved, is built
Vertical reverse route；The hop count in RREQ grouping received for the first time adds 1, subtracts 1 for the TTL field in IP header, updates in RREQ
Path quality domain Cpath。
Further, in step s3, the destination node generates route replies: receiving RREQ grouping including destination node
Afterwards, the destination node sequence number of RREQ grouping is judged, if the destination node sequence number in RREQ grouping is current greater than destination node
Sequence number updates destination node current sequence number；Destination node waits certain time RRL (route replies delay, Routing
Reply Delay), to receive more RREQ groupings；It is divided into two kinds of situations:
1) if RREQ grouping is only sought to a path from source node to destination node, RREP points of destination node building
Group, the reverse route along the path carry out route replies；
If 2) a plurality of path from source node to destination node is sought in RREQ grouping, path evaluation functional value, choosing are calculated
It selects optimal path and carries out route replies, path evaluation function such as formula:
Wherein:For the quality in path, Hpath(S,D)∈[1,Hmax] it is hop count
Wherein:
Known to:
0.02≤Cpath(S,D)< 1；
In formula, CPath (S, D)For the quality in path, Hpath(S,D)For hop count, Clink(i,j)For from node i to the link of node j
Quality, QmFor the maximum node queue length that node can be born, QjFor the queue length of node, EjFor the residual energy of current node
Amount, E0For the primary power of node；
The evaluation function value for reaching all paths of the node from source node is calculated according to path evaluation function, is selected optimal
Path carries out route replies.
Further, in step s3, the intermediate node generates route replies, and intermediate node inquires reverse route table, point
Two kinds of situations: if 1) only existing a reverse path, route replies are directly carried out；2) mulitpath if it exists, then according to institute
It states path evaluation function and calculates the evaluation function value for reaching all paths of the node from source node, optimal path is selected to carry out road
By response, the destination node sequence number that intermediate node is known is copied in RREP grouping, and will be expired in routing entry
Time subtracts current time.
Further, in step s3, processing of the intermediate node to route replies (RREP) message: including intermediate node
When receiving route replies RREP grouping, the number N of the corresponding RREQ of storage is checked from routing forwarding list RFT；It is divided to two kinds of feelings
Condition:
If 1) N=1, intermediate node directly forwards RREP to the previous hop node in RFT；
If 2) N > 1, illustrate that from source node arrival present node, intermediate node is stored according in RFT there are mulitpath
Routing information, the evaluation function value for reaching from source node all paths of the node is calculated according to the path evaluation function,
Optimal path is selected to carry out route replies；If larger movement occurs for node, the path up to source node is not present in intermediate node,
The then local pathfinding process for initiating to arrive source node.
Further, in step s3, the processing in the no route replies path: if do not looked in network latency
To routing, re-broadcasts RREQ message and find routing；When re-starting primary broadcast, increases and update RREQ ID, and IP is set
The TTL field of head, to control the spread scope of RREQ grouping.
Further, in step s3, it the processing in the no route replies path: re-broadcasts RREQ message and finds routing still
Reachable path is not so found, then is abandoned all data groupings of destination node corresponding in buffer area, is then sent out to application layer
Send the unreachable message of destination node.
The beneficial effects of the present invention are: the method for the invention can meet the same of elementary path qos parameter guarantee
When, consider the residue energy of node and node queue's length in path, and access judgement, avoiding property are carried out to next-hop node
Energy bottleneck node, as far as possible selection reduce route discovery frequency compared with stabilizing path；This method is used to improve the routing of method for routing
Discovery procedure, increases processing when reverse route table interior joint is mobile when message returns, and more QoS route selection methods are being grouped
Delivery ratio, routing cost and route discovery frequency etc. performance all increase.Meanwhile node time out is longer or net
Network loads in biggish environment, and the QoS performance of multi-Qos route selection method also increases.
Detailed description of the invention
In order to keep the purpose of the present invention, technical scheme and beneficial effects clearer, the present invention provides following attached drawing and carries out
Illustrate:
Fig. 1 is that node executes more QoS route selecting method flow charts；
Fig. 2 is route request information format；
Fig. 3 is route replies message format.
Specific embodiment
Below in conjunction with attached drawing, a preferred embodiment of the present invention will be described in detail.
Multi-Qos route selection method is based in a kind of mobile ad-hoc network provided by the invention, this method includes as follows
Step: the generation of route request information, the processing and forwarding of route request information, the generation and processing of route replies message.Institute
The generation for stating route request information includes inquiring itself routing table, if initiating route finding process, duplication routing without up to routing
The destination node sequence number domain that destination node sequence number is grouped to route request information in table, source node broadcasts are by request message
To neighbor node；The processing and forwarding of the route request information include the judgement to access criterion, to access criterion judgement knot
Fruit carries out respective handling, judges whether node receives identical route request information ID<RREQ_ID>according to route forwarding table information
It is grouped with the route request information of identical sources node IP address, and respective handling is done to judging result；The route replies message
Generation and processing, including destination node generate route replies, intermediate node generate route replies, intermediate node is to route replies
The processing of message, the processing in no route replies path.Meanwhile the present invention is provided in a kind of mobile ad-hoc network based on multi-Qos
Route selection method, it is contemplated that residue energy of node and node queue's length in path, and next-hop node is accessed
Judgement, avoids performance bottleneck node, and selection as far as possible reduces route discovery frequency compared with stabilizing path；This method is used to improve
The route finding process of method for routing increases processing when reverse route table interior joint is mobile when message returns, more QoS routings
Selection method Packet delivery fractions, routing cost and in terms of performance all increase.Meanwhile it is temporary in node
Between stopping time in the biggish environment of longer or network load, the QoS performance of multi-Qos route selection method also increases.
The present invention principle comprehensive in line with decision factor, comprehensively considers existing mobile ad-hoc network QoS Route Selection
Defect of the method in decision factor selection, emphasis consider dynamic decision factor, are realized by the processing to dynamic decision factor
The selection of optimal access network, the relevant Decision factor meter for QoS Route Selection that the present invention selects are as follows:
The decision factor table of table 1QoS Route Selection
Node primary power E0It is limited, if some node sends mass data, its energy may be made depleted, caused
Path failure.The primary power of node is an important factor for influencing path stability.
Data packet number is that the key factor of influence node buffer area waits data packet to be sent in node buffer area
Number be generally defined as node queue's length, the transmission buffer congestion degree of node can indicate are as follows:
Wherein, QiIndicate the queue length of node, QmIndicate the maximum node that node can be born
Queue length, it can be seen from the above, under certain condition, when data packet number is more in node buffer area, buffer congestion degree
It is bigger, when the ratio of node queue's remaining space length and the total length of buffer queue of node (0,0.2] in interval range when, node
Heavy congestion occurs；When in (0.2,0.5] between when, node occur severe congestion；When being greater than 0.5, it is believed that node does not have
There is congestion condition.
Node packet sending speed is to influence the principal element of network load, and when packet sending speed improves, network load increases, routing
The Packet delivery fractions of method decline, and when network load is larger, packet loss is higher, and network overhead increases, and route discovery frequency increases
Add.
This method comprehensively considers the information such as node energy information, node queue's length, node packet sending speed, proposes more QoS
Route selecting method, this method execute access criterion judgement to node, avoid congestion and energy bottleneck node, at the same to path performance into
Row evaluation, selection relatively shortest path.By more QoS Routing Algorithms, more QoS route selection methods are improved, are obtained a kind of with QoS
The single path method for routing of guarantee.Path selected by this method has longer life on the basis of guaranteeing basic QoS performance
Phase avoids frequent route discovery, reduces path failure probability.This method is in Packet delivery fractions, routing cost and routing hair
Existing frequency etc., node time out is longer or the biggish environment of network load in, performance increases.
Multi-Qos route selection method is based in a kind of mobile ad-hoc network, including three big steps: route request information
It generates, the processing and forwarding of route request information, the generation and processing of route replies message.The generation of route request information includes
Inquire itself routing table, if without up to routing, initiate route finding process, replicate routing table in destination node sequence number to route
The destination node sequence number domain of request message grouping, source node broadcasts are by request message to neighbor node；Route request information
Processing and forwarding include to access criterion judgement, to access criterion judging result carry out respective handling, according to routing forwarding
Table information judges whether node receives the route request information grouping of identical ID and identical sources node IP address, and to judging result
Do respective handling；The generation and processing of route replies message include that destination node generates route replies, and intermediate node generates routing
Response, processing of the intermediate node to routing response message, the processing in no route replies path.By these modules to route into
Row updates and processing, to improve the validity and reliability of method for routing.
Fig. 1 is that node executes more QoS route selecting method flow charts, as shown in the figure:
Step 1: as shown in Figure 1 after node receives route request information grouping, access criterion judgement is carried out first, is sentenced
Whether disconnected nodal cache area queue length is lower than the 80% of maximum queue length, and whether residue energy of node is greater than primary power
10%, in two kinds of situation:
(1) if node is unsatisfactory for access criterion, the route request information grouping which receives does not continue to forward, and saves
Point can not access path.
(2) if meeting access criterion, further according to routing forwarding list judge node whether received mistake with identical
The grouping of the route request information of route request information ID and source node IP address, in two kinds of situation:
1. if they are the same, then abandoning RERQ grouping；
2. then saving entrained information in RREQ grouping if it is different, illustrating that RREQ reaches the node through different paths, establishing
Reverse route.The hop count in RREQ grouping received for the first time adds 1, subtracts 1 for the TTL field in IP header, updates the Road RREQ
Path quality domain Cpath。
Step 2: as shown in Figure 1, grouping meets access criterion, judge whether present node is purpose node, when purpose section
After point receives RREQ grouping, the destination node sequence number of RREQ grouping is judged, if the destination node sequence number in RREQ grouping
Greater than destination node current sequence number, destination node current sequence number is updated.Destination node waits certain time RRL, and (routing is answered
Answer delay, RoutingReplyDelay), to receive more RREQ groupings.In two kinds of situation:
(1) if RREQ grouping is only sought to a path from source node to destination node, destination node building RREP
Grouping, the reverse route along the path carry out route replies；
(2) if a plurality of path from source node to destination node is sought in RREQ grouping, path evaluation functional value, choosing are calculated
It selects optimal path and carries out route replies, path evaluation function such as formula:
Wherein:For the quality in path, Hpath(S,D)∈[1,Hmax] it is hop count
Wherein:
It is found that
0.02≤Cpath(S,D)< 1；
In formula, CPath (S, D)--- the quality in path
Hpath(S,D)--- hop count
Clink(i,j)--- from node i to the link-quality of node j
Qm--- the maximum node queue length that node can be born
Qj--- the queue length of node
Ej--- the dump energy of current node
E0--- the primary power of node
The evaluation function value for reaching all paths of the node from source node is calculated according to path evaluation function, is selected optimal
Path carries out route replies.
Fig. 2 is route request information format:
As shown in Fig. 2, the meaning of each field is as follows:
Type --- type, length are 8 bits, value 1；
2.J --- " addition " mark, 1 bit of length is preserved for multiple target transmission；
3.R --- " reparation " mark, 1 bit of length is preserved for multiple target transmission；
4.G --- without request RREP mark, 1 bit of length represents whether and asks a nothing according to single goal mode
It asks RREP grouping to be sent to the node that destination node IP address domain determines, sets 1 expression needs, set 0 expression and do not need；
The node-node transmission mark of 5.D --- monocular, 1 bit of length；
Destination node sequence number is not known in 6.U --- unknown nucleotide sequence number, 1 bit of length, expression；
7.Reserved --- retain, 11 bit of length；
8.Hop Count --- hop count, 8 bit of length indicate to reach this RREQ message of processing from source node IP address
Node between forwarding hop count；
9.RREQ ID --- route requests identification code, this is a sequence number, with RREQ ID and source node IP address
It being capable of one RREQ message of unique identification；
10.Destination IPAddress --- destination node IP address, what which was necessarily present, indicate one
The destination node address of item routing；
11.Destination Sequence Number --- destination node sequence number, what source node had been received is somebody's turn to do
Destination node latest sequence number；
12.Originator IPAddress --- source node IP address generates the node IP address of this RREQ message；
13.Originator SequenceNumber --- source node sequence number, the entry are directed toward this RREQ message
Source node sequence number currently in use；
14.Cpath--- path quality.
Fig. 3 is route replies message format:
As shown in figure 3, the meaning of each field is as follows:
(1) Type --- type, 8 bit of length, value 3；
(2) N --- non-delete mark, 1 bit of length,.When node complete to link locally repair when, N is set to
" 1 ", upstream node do not delete this routing；
(3) DestCount --- unreachable destination node counter, 8 bit of length indicate the number of unreachable destination node
The value of amount, this domain must communicate single goal at least equal to 1, and the value of DestCount is 1；
(4) Unreachable Destination IPAddress --- unreachable destination node IP, due to link down
And the impacted sequence number for having become inaccessible destination node；
(5) Unreachable Destination Sequence Number --- unreachable destination node sequence number, table
Show the sequence number for the unreachable destination node that the previous domain in this domain is listed.
Finally, it is stated that preferred embodiment above is only used to illustrate the technical scheme of the present invention and not to limit it, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (9)
1. being based on multi-Qos route selection method in a kind of mobile ad-hoc network, it is characterised in that: the following steps are included:
S1: the generation of route request information: multiple if initiating route finding process without up to routing including inquiring itself routing table
The destination node sequence number domain that destination node sequence number is grouped to route request information in routing table processed, source node broadcasts are by asking
Ask message to neighbor node；
S2: including the judgement to access criterion, phase the processing and forwarding of route request information: is carried out to access criterion judging result
It should handle, judge whether node receives identical route request information ID<RREQ_ID>and identical sources according to route forwarding table information
The route request information of node IP address is grouped, and does respective handling to judging result；
S3: the generation and processing of route replies message: route replies are generated including destination node, intermediate node generates routing and answers
It answers, processing of the intermediate node to routing response message, the processing in no route replies path；
In step s3, the destination node generates route replies: after receiving RREQ grouping including destination node, judging RREQ
The destination node sequence number of grouping updates if the destination node sequence number in RREQ grouping is greater than destination node current sequence number
Destination node current sequence number；Destination node waits certain time RRL (route replies delay, Routing Reply Delay),
To receive more RREQ groupings；It is divided into two kinds of situations:
If 1) RREQ grouping is only sought to a path from source node to destination node, destination node building RREP grouping,
Reverse route along the path carries out route replies；
If 2) a plurality of path from source node to destination node is sought in RREQ grouping, path evaluation functional value is calculated, selection is most
Shortest path carries out route replies, path evaluation function such as formula:
Wherein:For the quality in path, Hpath(S,D)∈[1,Hmax] it is hop count, in which:
Known to:
0.02≤Cpath(S,D)< 1；
In formula, CPath (S, D)For the quality in path, Hpath(S,D)For hop count, Clink(i,j)For from node i to the link-quality of node j,
QmFor the maximum node queue length that node can be born, QjFor the queue length of node, EjFor the dump energy of current node, E0
For the primary power of node；
The evaluation function value for reaching all paths of the node from source node is calculated according to path evaluation function, selects optimal path
Carry out route replies.
2. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 1, feature exists
In: in step sl, if the sequence number of the destination node can not be obtained, by domain " U " in route request information<RREQ>grouping
1 is set, destination node sequence number is labeled as unknown；Source node sequence number in the RREQ message is set as the current of the node oneself
Sequence number adds the domain 1, RREQ_ID to be set as the RREQ_ID that present node uses and adds 1, by the hop count domain zero setting in the RREQ message.
3. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 1, feature exists
In: in step sl, source node broadcasts RREQ message to neighbor node, and source node saves the RREQ_ID of the RREQ message and source
Point IP address caching a period of time, the time span are equal to path hunting time；When the source node receives its adjacent node hair
When the RREQ grouping sent, RREQ grouping is abandoned.
4. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 1, feature exists
In: in step s 2, the processing and forwarding of the route request information are first after intermediate node receives route request information grouping
Access criterion judgement is first carried out, judges whether nodal cache area queue length is lower than the 80% of maximum queue length, node is remaining
Whether energy is greater than the 10% of primary power.
5. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 4, feature exists
In: in step s 2, it is divided into two kinds of situations:
If 1) node is unsatisfactory for access criterion, the grouping of route request information which receives does not continue to forward, node without
Method access path；
If 2) meet access criterion, judge whether there is received mistake node identical routing to ask further according to routing forwarding list
The route request information of message id and source node IP address is asked to be grouped；
If node meets access criterion, in two kinds of situation:
21) RREQ grouping if they are the same, is then abandoned；
22) if it is different, illustrating that RREQ reaches the node through different paths, then entrained information in RREQ grouping is saved, established anti-
To routing；The hop count in RREQ grouping received for the first time adds 1, subtracts 1 for the TTL field in IP header, updates path in RREQ
Mass domain Cpath。
6. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 1, feature exists
In: in step s3, the intermediate node generates route replies, and intermediate node inquires reverse route table, in two kinds of situation: if 1)
A reverse path is only existed, then directly carries out route replies；2) mulitpath if it exists, then according to the path evaluation function
The evaluation function value for reaching all paths of the node from source node is calculated, optimal path is selected to carry out route replies, middle node
When putting the destination node sequence number known to copy in RREP grouping, and the time expiration in routing entry being subtracted current
Between.
7. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 6, feature exists
In: in step s3, route replies processing of the intermediate node to route replies (RREP) message: are received including intermediate node
When RREP is grouped, the number N of the corresponding RREQ of storage is checked from routing forwarding list RFT；In two kinds of situation:
If 1) N=1, intermediate node directly forwards RREP to the previous hop node in RFT；
If 2) N > 1, illustrate from source node reach present node there are mulitpaths, intermediate node is according to the road stored in RFT
Diameter information calculates the evaluation function value that all paths of the node are reached from source node, selection according to the path evaluation function
Optimal path carries out route replies；If larger movement occurs for node, the path up to source node is not present in intermediate node, then originally
Initiate the pathfinding process to source node in ground.
8. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 7, feature exists
In: in step s3, the processing in the no route replies path: if not finding routing in network latency, again
It broadcasts RREQ message and finds routing；When re-starting primary broadcast, increases and updates RREQ ID, and IP TTL fields are set,
To control the spread scope of RREQ grouping.
9. being based on multi-Qos route selection method in a kind of mobile ad-hoc network according to claim 8, feature exists
In: in step s3, the processing in the no route replies path: re-broadcasts RREQ message and find routing still do not find can
Up to path, then all data groupings of destination node corresponding in buffer area are abandoned, the section of an entry is then sent to application layer
The unreachable message of point.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610030662.2A CN105577547B (en) | 2016-01-18 | 2016-01-18 | Multi-Qos route selection method is based in a kind of mobile ad-hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610030662.2A CN105577547B (en) | 2016-01-18 | 2016-01-18 | Multi-Qos route selection method is based in a kind of mobile ad-hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105577547A CN105577547A (en) | 2016-05-11 |
| CN105577547B true CN105577547B (en) | 2019-03-22 |
Family
ID=55887233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610030662.2A Active CN105577547B (en) | 2016-01-18 | 2016-01-18 | Multi-Qos route selection method is based in a kind of mobile ad-hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105577547B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131917B (en) * | 2016-06-17 | 2019-06-28 | 重庆邮电大学 | A kind of adaptive broadcasting method based on distance and speed in vehicular ad hoc network |
| CN107102918B (en) * | 2017-05-26 | 2020-06-16 | 苏州浪潮智能科技有限公司 | Data processing method and device |
| CN108184246B (en) * | 2018-03-06 | 2021-05-28 | 中国船舶重工集团公司第七二四研究所 | Mobile self-organizing network route optimization method based on position and service quality |
| CN108449271B (en) * | 2018-04-13 | 2021-06-04 | 吉林大学 | Routing method for monitoring path node energy and queue length |
| CN108770003A (en) * | 2018-05-07 | 2018-11-06 | 南京邮电大学 | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing |
| CN110474853B (en) * | 2018-05-11 | 2022-10-18 | 华为技术有限公司 | Message sending method, network node and system |
| CN109729557A (en) * | 2018-12-28 | 2019-05-07 | 上海昭宁信息科技有限公司 | A kind of method and terminal of wireless networking |
| CN112533262B (en) * | 2020-10-15 | 2022-12-30 | 广州大学 | Multi-path on-demand routing method of rechargeable wireless sensor network |
| CN114189887B (en) * | 2021-11-23 | 2023-08-08 | 西安电子科技大学 | Method for optimizing mobile ad hoc network route based on improved sparrow search algorithm |
| CN114567893A (en) * | 2022-01-10 | 2022-05-31 | 重庆邮电大学 | Multi-service group switching method based on multi-objective optimization |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101932062A (en) * | 2010-09-03 | 2010-12-29 | 电子科技大学 | Multipath routing method in Ad Hoc network environment |
| CN101980565A (en) * | 2010-09-25 | 2011-02-23 | 重庆邮电大学 | QoS-based Ad Hoc network adaptive node speed multi-path routing method |
| CN102170660A (en) * | 2011-05-11 | 2011-08-31 | 北京交通大学 | Multi-path route constructing method and system based on APDV (Ad Hoc On-demand Distance Vector) |
| CN104883304A (en) * | 2015-05-12 | 2015-09-02 | 东南大学 | Method for routing part entangled quantum pair bridging communication network |
-
2016
- 2016-01-18 CN CN201610030662.2A patent/CN105577547B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101932062A (en) * | 2010-09-03 | 2010-12-29 | 电子科技大学 | Multipath routing method in Ad Hoc network environment |
| CN101980565A (en) * | 2010-09-25 | 2011-02-23 | 重庆邮电大学 | QoS-based Ad Hoc network adaptive node speed multi-path routing method |
| CN102170660A (en) * | 2011-05-11 | 2011-08-31 | 北京交通大学 | Multi-path route constructing method and system based on APDV (Ad Hoc On-demand Distance Vector) |
| CN104883304A (en) * | 2015-05-12 | 2015-09-02 | 东南大学 | Method for routing part entangled quantum pair bridging communication network |
Non-Patent Citations (1)
| Title |
|---|
| 无线移动自组织网络QoS路由协议的研究;陈年生;《中国博士学位论文全文数据库》;20071215;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105577547A (en) | 2016-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105577547B (en) | Multi-Qos route selection method is based in a kind of mobile ad-hoc network | |
| Mbarushimana et al. | Comparative study of reactive and proactive routing protocols performance in mobile ad hoc networks | |
| Gwalani et al. | AODV-PA: AODV with path accumulation | |
| Gupta et al. | Performance metric comparison of AODV and DSDV routing protocols in MANETs using NS-2 | |
| CN105848247B (en) | Self-adaptive routing protocol method of vehicle-mounted Ad Hoc network | |
| Vijaya et al. | Influence of routing protocols in performance of wireless mobile adhoc network | |
| Li et al. | A multipath routing protocol with load balancing and energy constraining based on AOMDV in ad hoc network | |
| CN108449271A (en) | A kind of method for routing of monitoring path node energy and queue length | |
| Bhangwar et al. | On routing protocols for high performance | |
| Er-rouidi et al. | A balanced energy consumption in mobile ad hoc network | |
| Gupta et al. | Routing protocols in mobile ad-hoc networks | |
| Gupta et al. | Comparison of DYMO, AODV, DSR and DSDV MANET Routing protocols over varying traffic | |
| Othmen et al. | Power and delay-aware routing protocol for ad hoc networks | |
| Suchdeo et al. | Comparison of on-demand routing protocols | |
| Marwaha et al. | Biologically inspired ant-based routing in mobile ad hoc networks (MANET): a survey | |
| Said et al. | Comparative study between the performance of proactive and reactive mobile ad-hoc networks (MANET) routing protocols with varying mobility | |
| Yang et al. | Performance research of an improved hybrid routing protocol | |
| Memon et al. | Performance evaluation of mobile ad hoc routing mechanisms | |
| Ramakrishnan et al. | Mathematical modeling of routing protocol selection for optimal performance of MANET | |
| Prasanna et al. | Analysis of ANTHOCNET and AODV performance using NS-2 | |
| JP2009124303A (en) | Message transfer method in ad hoc network | |
| Mohammed et al. | A comparative performance analysis of AODV and DSR routing protocol for mobile Ad-hoc network | |
| Patnaik et al. | An efficient route repairing technique of aodv protocol in manet | |
| Oh | A hybrid routing protocol for wireless Mesh Networks | |
| Sithitavorn et al. | Mobility prediction with direction tracking on dynamic source routing |
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 |