CN105577547A - Multi-Qos based route selection method in mobile self-organizing network - Google Patents
Multi-Qos based route selection method in mobile self-organizing network Download PDFInfo
- Publication number
- CN105577547A CN105577547A CN201610030662.2A CN201610030662A CN105577547A CN 105577547 A CN105577547 A CN 105577547A CN 201610030662 A CN201610030662 A CN 201610030662A CN 105577547 A CN105577547 A CN 105577547A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- path
- rreq
- grouping
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- 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 invention relates to a multi-Qos based route selection method in mobile self-organizing network belonging to the mobile communication technical field. The method comprises following steps: generating a route request message: comprising querying own route table, if there is no reachable route, initiating a route discovery process, copying a node serial number in the route table to the destination node serial number domain of a route request message subgroup and broadcasting the route request message to an adjacent node by a source node; processing and forwarding the route request message: comprising judging an access criterion, correspondingly processing the judging result of the access criterion, judging whether nodes receive the route request message subgroups of the same ID or the same source node IP address according to route forwarding table information, correspondingly processing the judging result; generating and processing a route reply message: comprising generating the route reply by the destination node, generating the route reply by an intermediate node, processing the route reply message by the intermediate node, and processing non route reply path. According to the method, performance bottleneck nodes are avoided; the route cost is saved; and the system performance is improved.
Description
Technical field
The invention belongs to mobile communication technology field, relate in a kind of mobile ad-hoc network based on multi-Qos route selection method.
Background technology
Along with the fast development of radio communication and mobile calculation technique, and the increasing rapidly of radio communication device (as hand-held digital device, computer and in-vehicle wireless device can be worn), user both can fast access into network, accesses network resource, again can networking whenever and wherever possible, share information.
According to the difference of networking control mode, cordless communication network is generally divided into centralized and non-stop layer self-organizing formula two class.Centralized network (as cell mobile communication systems, wired backbone) needs the fixed network infrastructure such as base station, switching center of having disposed in advance.But some special occasions (temporary meetings etc. as the communication on battlefield, the rescue after earthquake, the examination of field science, remote districts) does not have the fixation means disposed, usually therefore, it is possible to the MAENT of interim quickly networking just arises at the historic moment in these cases.
Word " AdHoc " derives from Latin language, looks like for " specific, special ", also can be described as " self-organization network " or " without fixation means net ".IEEE802.11 standard committee original adoption " AdHoc network " word describes this self-organizing network, and AdHoc network is called MANET by Internet engineering duty group (TheInternetEngineeringTaskForce, IETF).Can the node in network direct communication depend on node maximum communication scope and two internodal distances, and the node not in direct communications range, need via node to forward, therefore MANET is also referred to as wireless multi-hop network.
Along with mobile ad-hoc network application extensive, multimedia massive dataflow and in real time application are in the urgent need to transmitting rapidly accurately and reliably, these all propose high requirement to the QoS performance of MANET, need Routing Protocol that certain QoS can be provided to ensure.The resource-constraineds such as nodes energy, the network bandwidth, make the research of MANET route become difficult and complicated.
Therefore, study and realize how utilizing limited Internet resources to find, between source node and destination node, there is the difficult point that method for routing that higher QoS ensures becomes research, have important practical significance.
Summary of the invention
In view of this, to the object of the present invention is to provide in a kind of mobile ad-hoc network based on multi-Qos route selection method, specifically comprise the following steps:
S1: the generation of route request information: comprise self routing table of inquiry, if can not route be reached, initiate route finding process, copy the destination node serial number field that in routing table, destination node sequence number divides into groups to route request information, source node broadcasts by request message to neighbor node;
S2: the process of route request information and forwarding: comprise the judgement to access criterion, respective handling is carried out to access criterion judged result, whether receive the route request information grouping of identical route request information ID<RREQ_ID> and identical sources node IP address according to route forwarding table information decision node, and respective handling is done to judged result;
S3: the generation of route replies message and process: comprise destination node produce route replies, intermediate node produce route replies, intermediate node to the process of route response message, without the process in route replies path.
Further, in step sl, if cannot obtain the sequence number of this destination node, then in being divided into groups by route request information <RREQ>, " U " territory puts 1, and destination node sequence number is labeled as the unknown; Current sequence number source node sequence number in this RREQ message being set to this node oneself adds 1, RREQ_ID territory and is set to the RREQ_ID that present node uses and adds 1, by the jumping figure territory zero setting in this RREQ message.
Further, in step sl, source node broadcast RREQ message is to neighbor node, and source node is by the RREQ_ID of this RREQ message and source node IP address caching a period of time, and this time span equals the path finding time; When this RREQ that this source node receives the transmission of its adjacent node divides into groups, abandon this RREQ and divide into groups.
Further, in step s 2, the process of described route request information and forwarding, after intermediate node receives route request information grouping, first carry out access criterion to judge, whether decision node buffer area queue length is lower than 80% of maximum queue length, and whether residue energy of node is greater than 10% of primary power.
Further, in step s 2, two kinds of situations are divided into:
1) if node does not meet access criterion, then the route request information grouping that this node receives no longer continues to forward, and node cannot access path;
2) if meet access criterion, then the route request information grouping with identical route request information ID and source node IP address whether had been received according to routing forwarding list decision node again;
If node meets access criterion, in two kinds of situation:
21) if identical, then abandon this RERQ and divide into groups;
22) if different, illustrate that RREQ arrives this node through different path, then preserve entrained information in RREQ grouping, set up reverse route; Jumping figure in the RREQ grouping that first time receives adds 1, the TTL territory in IP header is subtracted 1, upgrades path quality territory C in RREQ
path.
Further, in step s3, described destination node produces route replies: comprise after destination node receives RREQ grouping, judge the destination node sequence number that RREQ divides into groups, if the destination node sequence number in RREQ grouping is greater than destination node current sequence number, upgrade destination node current sequence number; Destination node waits for certain hour RRL (route replies postpones, RoutingReplyDelay), divides into groups to receive more RREQ; Be divided into two kinds of situations:
1) if a path from source node to destination node is only sought in RREQ grouping, then destination node builds RREP grouping, along the reverse route in this path, carries out route replies;
2) if RREQ grouping seek many paths from source node to destination node, calculating path evaluation function value, select optimal path carry out route replies, path evaluation function such as formula:
Wherein:
for the quality in path, H
path (S, D)∈ [1, H
max] be jumping figure
Wherein:
Known:
0.02≤C
path(S,D)＜1；
In formula, C
path (S, D)for the quality in path, H
path (S, D)for jumping figure, C
link (i, j)for from node i to the link-quality of node j, Q
mfor the maximum node queue length that node can bear, Q
jfor the queue length of node, E
jfor the dump energy of current node, E
0for the primary power of node;
Calculate the evaluation function value in all paths arriving this node from source node according to path evaluation function, select optimal path to carry out route replies.
Further, in step s3, described intermediate node produces route replies, and intermediate node inquires about reverse routing table, in two kinds of situation: 1) if only there is a reverse path, then directly carry out route replies; 2) if there is mulitpath, the evaluation function value in all paths arriving this node from source node is then calculated according to described path evaluation function, optimal path is selected to carry out route replies, the destination node sequence number that intermediate node is known copies in RREP grouping, and the time expiration in route entry is deducted current time.
Further, in step s3, described intermediate node is to the process of route replies (RREP) message: comprise intermediate node receive route replies RREP grouping time, from routing forwarding list RFT, check the number N of the corresponding RREQ of storage; In two kinds of situation:
1) if N=1, intermediate node directly forwards RREP to the previous dive node in RFT;
2) if N > 1, illustrate from source node arrive present node there is mulitpath, intermediate node is according to the routing information stored in RFT, calculate the evaluation function value in all paths arriving this node from source node according to described path evaluation function, select optimal path to carry out route replies; If larger movement occurs node, there is not the path that can reach source node in intermediate node, then the local pathfinding process being initiated to source node.
Further, in step s3, the described process without route replies path: if do not find route in network latency, again broadcasts RREQ message and finds route; Re-start when once broadcasting, increase and upgrade RREQID, and the TTL territory of IP head is set, to control the spread scope that this RREQ divides into groups.
Further, in step s3, the described process without route replies path: again broadcast RREQ message searching route and still do not find reachable path, then all packets of destination node corresponding in buffer area are abandoned, then send the unreachable message of destination node to application layer.
Beneficial effect of the present invention is: while the method for the invention can ensure meeting elementary path qos parameter, consider the residue energy of node in path and node queue's length, and access judgement is carried out to next-hop node, avoid performance bottleneck node, select comparatively stabilizing path as far as possible, reduce route discovery frequency; By the route finding process of the method for improvement of method for routing, add process when reverse routing table interior joint moves when message returns, many QoS route selection method performance in Packet delivery fractions, routing cost and route discovery frequency etc. all increases.Meanwhile, in or environment that offered load is larger longer at node time out, the QoS performance of multi-Qos route selection method also increases.
Accompanying drawing explanation
In order to make object of the present invention, technical scheme and beneficial effect clearly, the invention provides following accompanying drawing and being described:
Fig. 1 is that node performs many QoS route selecting method flow chart;
Fig. 2 is route request information form;
Fig. 3 is route replies message format.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
Based on multi-Qos route selection method in a kind of mobile ad-hoc network provided by the invention, the method comprises the steps: the generation of route request information, the process of route request information and forwarding, the generation of route replies message and process.The generation of described route request information comprises self routing table of inquiry, if can not route be reached, initiate route finding process, copy the destination node serial number field that in routing table, destination node sequence number divides into groups to route request information, source node broadcasts by request message to neighbor node; The process of described route request information and forwarding comprise the judgement to access criterion, respective handling is carried out to access criterion judged result, whether receive the route request information grouping of identical route request information ID<RREQ_ID> and identical sources node IP address according to route forwarding table information decision node, and respective handling is done to judged result; The generation of described route replies message and process, comprise destination node produce route replies, intermediate node produce route replies, intermediate node to the process of route response message, without the process in route replies path.Simultaneously, the invention provides in a kind of mobile ad-hoc network based on multi-Qos route selection method, consider the residue energy of node in path and node queue's length, and access judgement is carried out to next-hop node, avoid performance bottleneck node, select comparatively stabilizing path as far as possible, reduce route discovery frequency; By the route finding process of the method for improvement of method for routing, add process when reverse routing table interior joint moves when message returns, many QoS route selection method performance in Packet delivery fractions, routing cost and route discovery frequency etc. all increases.Meanwhile, in or environment that offered load is larger longer at node time out, the QoS performance of multi-Qos route selection method also increases.
The present invention is in line with the comprehensive principle of decision factor, consider the defect of existing mobile ad-hoc network QoS route selection method on decision factor is selected, emphasis considers dynamic decision factor, by realizing the selection of optimum access network to the process of dynamic decision factor, the relevant Decision factor table for QoS Route Selection that the present invention selects is as follows:
The decision factor table of table 1QoS Route Selection
Node primary power E
0limited, if certain node sends mass data, may can approach exhaustion, cause path failure.The primary power of node is the key factor affecting path stability.
Data packet number is the key factor affecting node buffering area, in node buffering area, waits the number of packet to be sent to be generally defined as node queue's length, and the transmission buffer congestion degree of node can be expressed as:
wherein, Q
irepresent the queue length of node, Q
mrepresent the maximum node queue length that node can bear, from the above, under certain condition, when in node buffering area, data packet number is more, buffer congestion degree is larger, when node queue's remaining space length and the total length of buffer queue of node ratio (0,0.2] in interval range time, node generation heavy congestion; When being in (0.2,0.5] between time, node generation severe congestion; When being greater than 0.5, think that node does not occur congestion condition.
Node packet sending speed is the principal element affecting offered load, and when packet sending speed improves, offered load increases, and the Packet delivery fractions of method for routing declines, and when offered load is larger, packet loss is higher, and network overhead increases, and route discovery frequency increases.
This method considers the information such as node energy information, node queue's length, node packet sending speed, propose many QoS route selecting method, the method performs access criterion to node and judges, avoids congested and energy bottleneck node, path performance is evaluated simultaneously, select relatively shortest path.By many QoS Routing Algorithm, improve many QoS route selection method, obtain a kind of single path method for routing that there is QoS and ensure.Path selected by the method, on the basis ensureing basic QoS performance, has the longer lifetime, avoids route discovery frequently, reduce path failure probability.The method is in Packet delivery fractions, routing cost and route discovery frequency etc., and in or environment that offered load is larger longer at node time out, performance all increases.
Based on multi-Qos route selection method in a kind of mobile ad-hoc network, comprise three large steps: the generation of route request information, the process of route request information and forwarding, the generation of route replies message and process.The generation of route request information comprises self routing table of inquiry, if can not route be reached, initiate route finding process, copy the destination node serial number field that in routing table, destination node sequence number divides into groups to route request information, source node broadcasts by request message to neighbor node; The process of route request information and forwarding comprise the judgement to access criterion, respective handling is carried out to access criterion judged result, whether receive the route request information grouping of identical ID and identical sources node IP address according to route forwarding table information decision node, and respective handling is done to judged result; The generation of route replies message and process comprise destination node produce route replies, intermediate node produce route replies, intermediate node to the process of route response message, without the process in route replies path.By these modules route upgraded and process, to improve the validity and reliability of method for routing.
Fig. 1 is that node performs many QoS route selecting method flow chart, as shown in the figure:
Step one: as shown in Figure 1 after node receives route request information grouping, first carry out access criterion to judge, whether decision node buffer area queue length is lower than 80% of maximum queue length, and whether residue energy of node is greater than 10% of primary power, in two kinds of situation:
(1) if node does not meet access criterion, then the route request information grouping that this node receives no longer continues to forward, and node cannot access path.
(2) if meet access criterion, then the route request information grouping with identical route request information ID and source node IP address whether had been received according to routing forwarding list decision node again, in two kinds of situation:
If 1. identical, then abandon this RERQ and divide into groups;
If 2. different, illustrate that RREQ arrives this node through different path, then preserve entrained information in RREQ grouping, set up reverse route.Jumping figure in the RREQ grouping that first time receives adds 1, the TTL territory in IP header is subtracted 1, upgrades path quality territory C in RREQ
path.
Step 2: as shown in Figure 1, grouping meets access criterion, judge node for the purpose of present node whether, after destination node receives RREQ grouping, judge the destination node sequence number that RREQ divides into groups, if the destination node sequence number in RREQ grouping is greater than destination node current sequence number, upgrade destination node current sequence number.Destination node waits for certain hour RRL (route replies postpones, RoutingReplyDelay), divides into groups to receive more RREQ.In two kinds of situation:
(1) if a path from source node to destination node is only sought in RREQ grouping, then destination node builds RREP grouping, along the reverse route in this path, carries out route replies;
(2) if RREQ grouping seek many paths from source node to destination node, calculating path evaluation function value, select optimal path carry out route replies, path evaluation function such as formula:
Wherein:
for the quality in path, H
path (S, D)∈ [1, H
max] be jumping figure
Wherein:
It is known,
0.02≤C
path(S,D)＜1；
In formula, C
path (S, D)---the quality in path
H
path (S, D)---jumping figure
C
link (i, j)---from node i to the link-quality of node j
Q
m---the maximum node queue length that node can bear
Q
j---the queue length of node
E
j---the dump energy of current node
E
0---the primary power of node
Calculate the evaluation function value in all paths arriving this node from source node according to path evaluation function, select optimal path to carry out route replies.
Fig. 2 is route request information form:
As shown in Figure 2, the meaning of each field is as follows:
Type---type, length is 8 bits, and value is 1;
2.J---" adding " indicates, length 1 bit, is preserved for multiple target transmission;
3.R---" reparation " indicates, length 1 bit, is preserved for multiple target transmission;
4.G---without request RREP mark, length 1 bit, represent and be sent to without request RREP grouping the node that destination node IP address field determines by one the need of according to single goal mode, put 1 expression needs, setting to 0 expression does not need;
The node-node transmission mark of 5.D---monocular, length 1 bit;
6.U---unknown nucleotide sequence number, length 1 bit, represents and does not know destination node sequence number;
7.Reserved---retain, length 11 bit;
8.HopCount---jumping figure, length 8 bit, represent from source node IP address arrive process this RREQ message node between forwarding jumping figure;
9.RREQID---route requests identification code, this is a sequence number, uses RREQID and source node IP address uniquely can identify a RREQ message;
10.DestinationIPAddress---destination node IP address, this address must exist, and represents the destination node address of a route;
11.DestinationSequenceNumber---destination node sequence number, this destination node latest sequence number that source node has received;
12.OriginatorIPAddress---source node IP address, produces the node IP address of this RREQ message;
13.OriginatorSequenceNumber---source node sequence number, the sequence number that the source node that this entry points to this RREQ message is using at present;
14.C
path---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, length 8 bit, value is 3;
(2) N---non-delete mark, length 1 bit.When node complete to the local restore of link time, be set to " 1 " by N, its upstream node does not delete this route;
(3) DestCount---unreachable destination node counter, length 8 bit, represents the quantity of unreachable destination node, and the value in this territory at least must equal 1, and for single goal communication, the value of DestCount is 1;
(4) UnreachableDestinationIPAddress---unreachable destination node IP, the influenced sequence number having become inaccessible destination node due to link down;
(5) UnreachableDestinationSequenceNumber---unreachable destination node sequence number, represents the sequence number of the unreachable destination node that last territory, this territory is listed.
What finally illustrate is, above preferred embodiment is only in order to illustrate technical scheme of the present invention and unrestricted, although by above preferred embodiment to invention has been detailed description, but those skilled in the art are to be understood that, various change can be made to it in the form and details, and not depart from claims of the present invention limited range.
Claims (10)
1. in mobile ad-hoc network based on a multi-Qos route selection method, it is characterized in that: comprise the following steps:
S1: the generation of route request information: comprise self routing table of inquiry, if can not route be reached, initiate route finding process, copy the destination node serial number field that in routing table, destination node sequence number divides into groups to route request information, source node broadcasts by request message to neighbor node;
S2: the process of route request information and forwarding: comprise the judgement to access criterion, respective handling is carried out to access criterion judged result, whether receive the route request information grouping of identical route request information ID<RREQ_ID> and identical sources node IP address according to route forwarding table information decision node, and respective handling is done to judged result;
S3: the generation of route replies message and process: comprise destination node produce route replies, intermediate node produce route replies, intermediate node to the process of route response message, without the process in route replies path.
2. in a kind of mobile ad-hoc network according to claim 1 based on multi-Qos route selection method, it is characterized in that: in step sl, if the sequence number of this destination node cannot be obtained, in then being divided into groups by route request information <RREQ>, " U " territory puts 1, and destination node sequence number is labeled as the unknown; Current sequence number source node sequence number in this RREQ message being set to this node oneself adds 1, RREQ_ID territory and is set to the RREQ_ID that present node uses and adds 1, by the jumping figure territory zero setting in this RREQ message.
3. in a kind of mobile ad-hoc network according to claim 1 based on multi-Qos route selection method, it is characterized in that: in step sl, source node broadcast RREQ message is to neighbor node, source node is by the RREQ_ID of this RREQ message and source node IP address caching a period of time, and this time span equals the path finding time; When this RREQ that this source node receives the transmission of its adjacent node divides into groups, abandon this RREQ and divide into groups.
4. in a kind of mobile ad-hoc network according to claim 1 based on multi-Qos route selection method, it is characterized in that: in step s 2, the process of described route request information and forwarding, after intermediate node receives route request information grouping, first carry out access criterion to judge, whether decision node buffer area queue length is lower than 80% of maximum queue length, and whether residue energy of node is greater than 10% of primary power.
5. in a kind of mobile ad-hoc network according to claim 4 based on multi-Qos route selection method, it is characterized in that: in step s 2, be divided into two kinds of situations:
1) if node does not meet access criterion, then the route request information grouping that this node receives no longer continues to forward, and node cannot access path;
2) if meet access criterion, then the route request information grouping with identical route request information ID and source node IP address whether had been received according to routing forwarding list decision node again;
If node meets access criterion, in two kinds of situation:
21) if identical, then abandon this RERQ and divide into groups;
22) if different, illustrate that RREQ arrives this node through different path, then preserve entrained information in RREQ grouping, set up reverse route; Jumping figure in the RREQ grouping that first time receives adds 1, the TTL territory in IP header is subtracted 1, upgrades path quality territory C in RREQ
path.
6. in a kind of mobile ad-hoc network according to claim 1 based on multi-Qos route selection method, it is characterized in that: in step s3, described destination node produces route replies: comprise after destination node receives RREQ grouping, judge the destination node sequence number that RREQ divides into groups, if the destination node sequence number in RREQ grouping is greater than destination node current sequence number, upgrade destination node current sequence number; Destination node waits for certain hour RRL (route replies postpones, RoutingReplyDelay), divides into groups to receive more RREQ; Be divided into two kinds of situations:
1) if a path from source node to destination node is only sought in RREQ grouping, then destination node builds RREP grouping, along the reverse route in this path, carries out route replies;
2) if RREQ grouping seek many paths from source node to destination node, calculating path evaluation function value, select optimal path carry out route replies, path evaluation function such as formula:
Wherein:
For the quality in path, H
path (S, D)∈ [1, H
max] be jumping figure
Wherein:
Known:
0.02≤C
path(S,D)＜1；
In formula, C
path (S, D)for the quality in path, H
path (S, D)for jumping figure, C
link (i, j)for from node i to the link-quality of node j, Q
mfor the maximum node queue length that node can bear, Q
jfor the queue length of node, E
jfor the dump energy of current node, E
0for the primary power of node;
Calculate the evaluation function value in all paths arriving this node from source node according to path evaluation function, select optimal path to carry out route replies.
7. in a kind of mobile ad-hoc network according to claim 6 based on multi-Qos route selection method, it is characterized in that: in step s3, described intermediate node produces route replies, intermediate node inquires about reverse routing table, in two kinds of situation: 1) if only there is a reverse path, then directly carry out route replies; 2) if there is mulitpath, the evaluation function value in all paths arriving this node from source node is then calculated according to described path evaluation function, optimal path is selected to carry out route replies, the destination node sequence number that intermediate node is known copies in RREP grouping, and the time expiration in route entry is deducted current time.
8. in a kind of mobile ad-hoc network according to claim 7 based on multi-Qos route selection method, it is characterized in that: in step s3, described intermediate node is to the process of route replies (RREP) message: comprise intermediate node receive route replies RREP grouping time, from routing forwarding list RFT, check the number N of the corresponding RREQ of storage; In two kinds of situation:
1) if N=1, intermediate node directly forwards RREP to the previous dive node in RFT;
2) if N > 1, illustrate from source node arrive present node there is mulitpath, intermediate node is according to the routing information stored in RFT, calculate the evaluation function value in all paths arriving this node from source node according to described path evaluation function, select optimal path to carry out route replies; If larger movement occurs node, there is not the path that can reach source node in intermediate node, then the local pathfinding process being initiated to source node.
9. in a kind of mobile ad-hoc network according to claim 8 based on multi-Qos route selection method, it is characterized in that: in step s3, the described process without route replies path: if do not find route in network latency, again broadcasts RREQ message and finds route; Re-start when once broadcasting, increase and upgrade RREQID, and the TTL territory of IP head is set, to control the spread scope that this RREQ divides into groups.
10. in a kind of mobile ad-hoc network according to claim 9 based on multi-Qos route selection method, it is characterized in that: in step s3, the described process without route replies path: again broadcast RREQ message searching route and still do not find reachable path, then all packets of destination node corresponding in buffer area are abandoned, then send the unreachable message of destination node to application layer.
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 true CN105577547A (en) | 2016-05-11 |
| CN105577547B 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) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106131917A (en) * | 2016-06-17 | 2016-11-16 | 重庆邮电大学 | Adaptive broadcasting agreement based on distance and speed in a kind of vehicular ad hoc network |
| CN107102918A (en) * | 2017-05-26 | 2017-08-29 | 郑州云海信息技术有限公司 | A kind of data processing method and device |
| CN108184246A (en) * | 2018-03-06 | 2018-06-19 | 中国船舶重工集团公司第七二四研究所 | Mobile ad-hoc network routing optimization method based on position and service quality |
| CN108449271A (en) * | 2018-04-13 | 2018-08-24 | 吉林大学 | A kind of method for routing of 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 |
| CN109729557A (en) * | 2018-12-28 | 2019-05-07 | 上海昭宁信息科技有限公司 | A kind of method and terminal of wireless networking |
| CN112533262A (en) * | 2020-10-15 | 2021-03-19 | 广州大学 | Multi-path on-demand routing method of rechargeable wireless sensor network |
| CN114189887A (en) * | 2021-11-23 | 2022-03-15 | 西安电子科技大学 | Method for optimizing mobile ad hoc network routing based on improved sparrow search algorithm |
| CN114567893A (en) * | 2022-01-10 | 2022-05-31 | 重庆邮电大学 | Multi-service group switching method based on multi-objective optimization |
| US11394646B2 (en) * | 2018-05-11 | 2022-07-19 | Huawei Technologies Co., Ltd. | Packet sending method, network node, and system |
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 (2)
| Title |
|---|
| 陈年生: "无线移动自组织网络QoS路由协议的研究", 《中国博士学位论文全文数据库》 * |
| 陶洋等: "MANETs基于QoS的多路径路由协议研究", 《广东通信技术》 * |
Cited By (15)
| 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 |
| CN106131917A (en) * | 2016-06-17 | 2016-11-16 | 重庆邮电大学 | Adaptive broadcasting agreement based on distance and speed in a kind of vehicular ad hoc network |
| CN107102918A (en) * | 2017-05-26 | 2017-08-29 | 郑州云海信息技术有限公司 | A kind of data processing method and device |
| CN108184246A (en) * | 2018-03-06 | 2018-06-19 | 中国船舶重工集团公司第七二四研究所 | Mobile ad-hoc network routing optimization method based on position and service quality |
| CN108184246B (en) * | 2018-03-06 | 2021-05-28 | 中国船舶重工集团公司第七二四研究所 | Mobile self-organizing network route optimization method based on position and service quality |
| CN108449271A (en) * | 2018-04-13 | 2018-08-24 | 吉林大学 | A kind of method for routing of monitoring path node energy and queue length |
| 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 |
| US11394646B2 (en) * | 2018-05-11 | 2022-07-19 | Huawei Technologies Co., Ltd. | Packet sending method, network node, and system |
| CN109729557A (en) * | 2018-12-28 | 2019-05-07 | 上海昭宁信息科技有限公司 | A kind of method and terminal of wireless networking |
| CN112533262A (en) * | 2020-10-15 | 2021-03-19 | 广州大学 | Multi-path on-demand routing method of rechargeable wireless sensor network |
| CN112533262B (en) * | 2020-10-15 | 2022-12-30 | 广州大学 | Multi-path on-demand routing method of rechargeable wireless sensor network |
| CN114189887A (en) * | 2021-11-23 | 2022-03-15 | 西安电子科技大学 | Method for optimizing mobile ad hoc network routing based on improved sparrow search algorithm |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105577547B (en) | 2019-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105577547A (en) | Multi-Qos based route selection method in mobile self-organizing network | |
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| Wu et al. | Domination and its applications in ad hoc wireless networks with unidirectional links | |
| JP2007325261A (en) | Method of establishing route | |
| Khan et al. | A novel approach for reliable route discovery in mobile ad-hoc network | |
| Devi et al. | Mobile ad hoc networks and routing protocols in IoT enabled | |
| Mishra et al. | Comparison of MANET routing protocols | |
| Bendale et al. | Study of various routing protocols in mobile ad-hoc networks | |
| JP4627465B2 (en) | Wireless communication terminal and QoS information collecting method | |
| Alnabhan et al. | Performance Evaluation of Unicast Routing Protocols in MANETs-Current State and Future Prospects. | |
| KR100833506B1 (en) | An Path Recovery Mechanism and Apparatus using Candidate Node in AODV | |
| Al-Khwildi et al. | Adaptive link-weight routing protocol using cross-layer communication for MANET | |
| CN101409905A (en) | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode | |
| Aitha et al. | A strategy to reduce the control packet load of aodv using weighted rough set model for manet | |
| Said et al. | Comparative study between the performance of proactive and reactive mobile ad-hoc networks (MANET) routing protocols with varying mobility | |
| Qin et al. | Localized topology control and on-demand power-efficient routing for wireless ad hoc and sensor networks | |
| Lim et al. | Landmark guided forwarding | |
| Ramakrishnan et al. | Mathematical modeling of routing protocol selection for optimal performance of MANET | |
| JP2007221568A (en) | Transfer delay control method and radio terminal | |
| De Rango et al. | Hierarchical trajectory-based routing protocol for Vehicular Ad Hoc Networks | |
| Zhang et al. | A Novel Road Topology-aware Routing in VANETs | |
| Kausar Fatima et al. | Performance Estimation of Adhoc Routing Protocols with Ns2 Simulator | |
| Khan et al. | Enhancement of manet routing protocol | |
| Chand et al. | Performance Comparison of Two On-Demands Routing Protocols for Mobile Ad-hoc Networks | |
| Reddy et al. | Temporary parallel route recovery for frequent link failure in VANET |
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 |