CN101827413A - Dynamic multipath routing algorithm based on mobility prediction - Google Patents
Dynamic multipath routing algorithm based on mobility prediction Download PDFInfo
- Publication number
- CN101827413A CN101827413A CN200910021387A CN200910021387A CN101827413A CN 101827413 A CN101827413 A CN 101827413A CN 200910021387 A CN200910021387 A CN 200910021387A CN 200910021387 A CN200910021387 A CN 200910021387A CN 101827413 A CN101827413 A CN 101827413A
- Authority
- CN
- China
- Prior art keywords
- route
- node
- ret
- rreq
- caching
- 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.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a dynamic multipath routing algorithm based on mobility prediction, being applied to a high-speed mobile wireless Mesh network. The algorithm comprises the following steps: firstly predicting the route lifetime by utilizing the mobile information of nodes and introducing the ideal of route lifetime into the route discovery process of the DSR protocol; routing multiple paths from the source node to the destination node by utilizing the comprehensive evaluation value generated by non-relevance between the route lifetime and multipath routes and improving the route maintenance, selection and cache mechanism by utilizing the route lifetime. The invention can search for relatively stable routes for the nodes in the high-speed mobile wireless Mesh network, and the searched multiple paths have higher non-relevance, thus reducing the frequency of route discovery, effectively lowering the routing overhead, improving the performances of the original DSR protocols and ensuring the algorithm to be adaptive to the high-speed mobile network environment.
Description
Technical field
The present invention relates to a kind of dynamic multipath routing algorithm that is applicable to the wireless Mesh netword of high-speed mobile, belong to the cordless communication network technical field based on moving projection.
Background technology
Wireless Mesh netword, promptly wireless mesh network is the netted topological network of a kind of wireless multi-hop that occurs recently, have self-organizing, certainly the management, self-healing ability.It has merged WLAN (wireless local area network) and mobile Ad Hoc network advantages, has stronger compatibility and interoperability, can combine with multiple wireless access wide band technology, is the ideal solution that WiMAX inserts.
A key issue in the wireless Mesh netword design is exploitation can provide high quality and high efficiency communication between two nodes a Routing Protocol.At present, wireless Mesh netword does not also have the Routing Protocol official standard.Because a kind of specific form that mobile Ad Hoc network is a wireless Mesh netword is so in the wireless Mesh netword of high-speed mobile, Routing Protocol can be used for reference the Routing Protocol of Ad Hoc network.
The Routing Protocol of Ad Hoc network roughly can be divided into priori formula Routing Protocol and reaction equation Routing Protocol.In priori formula Routing Protocol,, all in network, broadcast the variation that routing update message is grasped networking natural topology structure and generation thereof, more new routing information no matter have or not communication requirement.In a single day source node will send message, can obtain to arrive the route of destination node immediately, and the required time delay of pathfinding is less.But the expense that routing update needs is bigger, and the topological structure of dynamic change may make routing iinformation out-of-date, is difficult for convergence.The reaction equation Routing Protocol is a kind of Route Selection mode of just searching route when needing, and node is not preserved routing iinformation promptly and accurately.When source node will be when destination node sends message, source node is initiated the route querying process in network, find corresponding route after, just begin to send message.The expense of reaction equation Routing Protocol is less, but the time delay of creating route is bigger.
From present research situation, the reaction equation route is the development in future direction, because it can better adapt to the variation of network topology.But at present several main Ad Hoc reaction equation Routing Protocols such as DSR, AODV, TORA, route finding process is only carried out Route Selection according to parameters such as the renewal degree of route and hop counts, and do not consider the factor of route quality aspect, this has increased the possibility of using unreliable route to a great extent.And in the wireless Mesh netword of high-speed mobile, the free movement that each node can be separate, network topology structure changes fast, and the data transfer path of having set up in routing procedure is often owing to the node motion is ruptured.When in use rupture in certain path, just need rebulid route, find corresponding available path to come resume data transmission.These are rebuild routing operations and have greatly consumed the limited Internet resources and the electric power energy of node, also cause the congested of network easily, rebuild the transmission delay that route is brought simultaneously, greatly influenced the service quality of network application, thereby reduced the runnability of network.So many researchers just propose based on the choice mechanism of stablizing route, this strategy trends towards replacing short, unsettled path with long, stable path.For example, utilize the term of validity of link between two neighborss of GPS locating information prediction, and this time value is attached in packet.At present, Routing Protocol DV one MP, the FORP etc. that have forecasting mechanism based on the locating information of GPS have been developed.
In wireless Mesh netword, because each node all has routing function, thereby the path from any one source node to destination node has many usually.Owing to the very strong mobility at random that node had in the network, whole topology of networks can often change simultaneously.If can replace the path to all setting up one or more for each node, the route reliability and the fault-tolerance of whole network will be improved, therefore, in order further to improve the route quality of wireless Mesh netword, the multichannel routing issue becomes this research focus in 2 years gradually.The main research thinking of multichannel routing algorithm is on the basis of existing single channel Routing Protocol now, carries out the expansion of some necessity, forms relevant multichannel route search algorithm.
Summary of the invention
1, a kind of dynamic multipath routing algorithm based on moving projection.It is characterized in that: described dynamic multipath routing algorithm comprises the steps:
1) route finding process
When source node S will send grouping to destination node D, S at first can check the route that whether has in its route-caching to D.If any, S will select suitable route to transmit.If it's not true, source node will be initiated a route finding process and be attempted finding a route that arrives destination node.
Routing information request (Route Request in the DSR agreement, RREQ) mobile message that expands node in the grouping comprises current location (x, y), present speed v, current direction θ, transmission radius r, Route Age territory RET, make RET be initialized as can keeping between the node in the network maximum time that connects.
After a node M is received a RREQ, at first judge oneself whether for this reason destination node of RREQ.
1.1) when node M was intermediate node, node M was according to steps of processing RREQ:
1.1.1) when an intermediate node M receives RREQ bag from a last hop node N, the arbitrary matching addresses during whether tabulate with route record the address of judging earlier this node M.If then route loop appears in proof, node abandons this RREQ.If the loop route do not occur, the then route requests of search node tabulation checks whether this node received identical RREQ.Request ID in the RREQ grouping and route originator address one are used from route requests grouping of unique identification, each node in the network can be safeguarded { route an originator address, the right route requests table of request ID} writes down the routing information request that this node is initiated or transmitted recently.
1.1.2) if node M is to receive this RREQ for the first time, node M is taken out position, speed, the direction of motion and the transmission radius of a last node N from RREQ bag, and then predicts that from the relevant information that link layer obtains this node self this node and last node keep the time (LET that is connected
M).
Suppose that all nodes among the mobile network all are in the middle of the free space propagation model, signal strength signal intensity is only relevant with transmitting range.Suppose the time synchronized of all nodes simultaneously.For any two nodes in a certain moment network,, can think that two nodes can keep connecting at this moment if the distance between the two is not more than effective propagation path.
Suppose that node i to adjacent node j transmission data, makes (x
i, y
i), (x
j, y
j) be respectively the coordinate of mobile node i, j, v
i, v
jBe respectively the translational speed of node i and j, θ
i, θ
j(0＜θ
i, θ
j＜2 π) be the moving direction of node i, j respectively, translational speed is decomposed into x axle and the axial component of y, promptly the movement velocity of node i, j is respectively (v
Ix, v
Iy), (v
Jx, v
Jy), behind the elapsed time t, the coordinate of node i, j is respectively (x
i+ tv
Ix, y
i+ tv
Iy), (x
j+ tv
Jx, y
j+ tv
Jy).If r
iBe the transmission radius of node i, the transmission radius formula (1) that reaches node i when two internodal distances is:
((x
i+tv
ix)-(x
j+tv
jx))
2+((y
i+tv
iy)-(y
j+tv
jy))
2＝r
i 2 (1)
Solve t by following formula (1), t is the life span LET of this link, for a route of forming by n bar link, and its Route Age RET,
RET＝min(LET
1，…，LET
i，…，LET
n) (2)
If LET
MLess than the route duration (RET in the current route requests grouping
N), then make RET
M=LET
M, otherwise RET
M=RET
N
If node M is not to receive for the first time then directly to forward 1.1.6 to by this RREQ).
1.1.3) judge the connection duration (RET in the current route requests grouping
M) whether less than the dangerous threshold value T that stipulates
ThIf RET
M≤ T
Th, illustrate that then this link is unreliable, should no longer do any processing, abandon this RREQ; Otherwise, execution in step 1.1.4 then)
1.1.4) the present node M relevant mobile message of using self covers the mobile message of a last hop node N among the REEQ, self address is added in the route record tabulation, this RREQ is broadcasted away, and with in this RREQ bag { the route originator address, request ID} is recorded in the route requests tabulation.T is set simultaneously
Max=RET
M。Execution in step 1.15 then)
1.1.5) startup timer conter T
e, wait for the RREQ that other are identical.
1.1.6) the route requests tabulation of node M search, find that this node had been received and comprise that identical { the route originator address, the RREQ of request ID} sign then checks timer T
eWhether make zero.If timer makes zero, then abandon this RREQ; Otherwise, then use the mobile message of a last hop node N who comprises among this RREQ and the relevant information of local node to predict that this node and last node keep the time (LET that is connected
Mi).If LET
MiLess than the connect hours RET in the current REEQ grouping
X(X is the numbering of a last hop node) makes RET
Mi=LET
M i, otherwise RET
Mi=RET
XJudge the connect hours RET in the current bag then
MiWhether less than the t in this nodes records
MaxIf RET
Mi＜t
Max, then abandon this RREQ; Otherwise then the present node M relevant mobile message of using self covers the mobile message of a last hop node, and self address is added to during route record tabulates, and this RREQ is broadcasted away.T is set simultaneously
Max=RET
Mi..
1.1.7) finish.
Different with the DSR algorithm is, do not allow this node to return route replies (Route Reply even there is the route that arrives destination node in the route memory of intermediate node yet, RREP), but will continue to transmit RREQ, destination node can obtain more routing iinformation like this.
1.2) when destination node D receives this RREQ, according to steps of processing RREQ:
1.2.1) tabulation of the route requests of destination node D search node, check whether this node received identical RREQ.If the RREQ grouping of the destination node that this RREQ grouping is first arrival, then execution in step 1.2.2).If this node had been received identical RREQ, then execution in step (6).
1.2.2) after destination node D receives first RREQ, take out position, speed, the direction of motion and the transmission radius of a last node the bag from RREQ bag, and then predict that from the relevant information that link layer obtains this node self this node and last node keep the time (LET that is connected
D).If LET
DLess than the route duration RET in the current route requests grouping
C(X is the numbering of a last hop node) then makes RET
D=LET
D, otherwise RET
D=RET
CExecution in step 1.2.3 then).
1.2.3) judge that whether connect hours RET in the current bag is less than dangerous threshold value T
ThIf RET
D≤ T
Th, then no longer do any processing, abandon this RREQ; Otherwise node D can produce corresponding route replies grouping (RREP) and send it to source node S.Then this route is deposited in the buffer memory, be labeled as main road by, be used for and after to route stand-by make comparisons.And with in this RREQ bag { the route originator address, request ID} is recorded in the route requests tabulation.T is set simultaneously
Max=RET
D
If node D receives then directly to forward 1.2.5 to by this RREQ for the first time)
1.2.4) startup timer conter T
d, wait for the RREQ that other are identical.
1.2.5) if the tabulation of the route requests of node D search, find that this node had been received and include that identical { the route originator address, the RREQ of request ID} sign then checks timer T
dWhether make zero.If timer makes zero, then abandon this RREQ; Otherwise, then utilize the relevant information of a last hop node mobile message and node self that comprises among this RREQ to predict that this node and last node keep the time (LET that is connected
Di).If this time is less than the connect hours RET in the current RREP grouping
X(X is the numbering of a last hop node) makes RET
Di=LET
Di, otherwise RET
Di=RET
XJudge the connect hours RET in the current bag then
DiWhether less than the t in this nodes records
MaxIf RET
Mi＜t
Max, then abandon this RREQ; Otherwise, then the route record in this RREQ bag is deposited in the route-caching of destination node, and with t
MaxReplace to the RET in the dRREQ bag
Mi
1.2.6) finish.
It should be noted that when destination node D finds first RREQ that satisfies condition, then send RREP, simultaneously the route record that carries among this RREQ is deposited in the high-speed cache, start timer T simultaneously to source node
dAt timer T
dThe RREQ that satisfies restrictive condition that receives when not making zero does not send RREP to source node immediately, but only the route record that carries among the RREQ is deposited in the high-speed cache, does further processing after waiting timer makes zero.
After timer makes zero, node D with the route stand-by in the route-caching and main road by comparing, if only exist in the route-caching 1 non-main road by route record, then destination node produces RREP, and the relevant information of this route is sent to source node.If exist in the route-caching 2 or more than 2 non-main road by route record, then utilize formula (3) to select the big route of C of comprehensive evaluation value to send RREP to source node.
Wherein, C
iBe the non-main road of i bar by the route comprehensive evaluation value, RET
iBe the non-main road of i bar by the route duration, RET
MainBe main road by the route duration, N
I, mainBe the non-main road of i bar by route and main road by comparing different interstitial contents, N
MainBe that main road is by the node number that comprises.
It can be that destination node D uses the route in the own buffer memory that destination node is sent the process of RREP to the node that rises, also can be that D initiates the route that new route finding process is sought arrival S, can also be under the situation of two-way link, thereby destination node generate a route that arrives S from D with the reverse of the route list among the RREQ.RREP in this agreement not only will comprise the route record in the RREQ bag, and will add RET in extension field.
2) route maintenance procedure
After introducing moving projection thought, the route maintenance mechanism of this agreement can be divided into initiatively prediction and two parts of passive adjustment are carried out simultaneously.
2.1) initiatively prediction
Route Age RET can divide into groups along with routing reply (RREP) be sent to source node S.S is when using this route to send data, when RET is reduced to dangerous threshold value T
ThThe time, S can search for route-caching, sees if there is the route of other known arrival D, if it's not true, will initiate the route that new route finding process finds a new arrival D in advance.When S finds the route of a new arrival D in buffer memory or by route finding process, will adopt this route, old route is deleted from buffer memory.
Initiatively prediction is carried out the required time of route maintenance procedure and mainly is made up of the process that sends the route warning and seek new route.Consider under the worst situation be route warning process the jumping figure of process be the diameter (Net_Hops) of this network, do not arrive other route of same purpose simultaneously in the route-caching of source node, must carry out route discovery again, and route finding process the hop count of process also be the diameter (Net_Hops) of this network.Because route discovery is made up of route requests and two processes of route replies, after ignoring computing and other time overhead, whole route maintenance total hop count of process be 3 * Net_Hops.If the process needed time of every hop node is Perhop_Time, the required time of so whole route process of reconstruction can be by equation expression;
T
th＝3×Net_Hops×Perhop_Time (4)
2.2) passive adjustment
This agreement is continued to use DSR agreement method originally and is made passive adjustment.When node find this node to the link of next-hop node because a variety of causes when breaking down, will send a routing error grouping RRER to this source node S of dividing into groups, indicate this link and fault occurred.Simultaneously, the routing table of this node detection oneself, if there is the route lead to destination node in the table, then this node will be replaced the original source route and be the route in its routing table, continue to transmit and divide into groups.Source node receives that the node of routing error grouping can delete the route that all comprise this faulty link.Check the route-caching of oneself then, see if there is the route that other arrive destination node, if having, then the route with other continues to transmit packet; If no, then initiate the route finding process of a new round.
3) Route Selection and route-caching strategy
This agreement is improved the Route Selection and the route-caching strategy of DSR agreement by introducing Route Age, makes mobile node can select route and management route-caching more targetedly.
3.1) routing strategy
When source node S will send data and divides into groups to D, it can search for the route-caching of oneself, if do not comprise in the route-caching towards the route of destination D, then initiates route finding process, and when receiving first routing reply grouping RREP, it can directly adopt this route.
If S search route-caching finds to exist the route of many arrival destination D, its can be selected in these many routes, rather than simply selects article one route in the buffer memory.
● its first criterion is set at RET, and S can select for use the route of RET maximum as new route;
● when the route that several RET are more or less the same occurring, judgment criterion is | RET
i-RET
j|＜Perhop_Time, S can select the less route of jumping figure in these several the routes for use, as new route.
The strategy of this selection route be equally applicable to route maintenance situation (if the route of using because near dangerous threshold value T
ThWhen perhaps uncertain reason ruptured, S just needed the route-caching inquiry of search oneself whether alternative route is arranged).
3.2) the route-caching strategy
The overtime setting of the buffer memory of DSR is to select quiescent value.When the time of the route in the buffer memory in buffer memory surpasses the time value that is provided with in advance, just this routing iinformation is removed.After introducing Route Age RET, we can be accurately overtime to its buffer memory of every Route Selection.The RET that adds this route when the route joining day proves that this route lost efficacy, and removed during smaller or equal to the current time from route-caching.
Abandoning on the strategy of cache information, if the information in the buffer memory reaches the upper limit of capacity, and have under the situation that new clauses and subclauses need add, the route joining day that cache policy can calculate each clauses and subclauses therewith route RET's and, with this and route (the promptly the most approaching overtime route) deletion that approaches the current time most, so that add new route.Like this, just can guarantee that the route that stays all is available in route-caching.
2, a kind of dynamic multipath routing algorithm as claimed in claim 1 based on moving projection, be primarily characterized in that: this algorithm can be sought metastable route for the node in the wireless Mesh netword of high-speed mobile, and the irrelevance of the mulitpath that searches out is bigger, reduce the number of times of rebuilding route, reduced routing cost and network congestion effectively.
Description of drawings
Fig. 1 is the LET sample calculation
Fig. 2 is the form of RREQ grouping.
Fig. 3 is the form of RREP grouping.
Fig. 4 is the flow chart of intermediate node handles RREQ.
Fig. 5 is the flow chart that destination node is handled RREQ.
Embodiment
Below just will be described in detail various embodiment of the present invention in conjunction with the accompanying drawings.
Fig. 1 is the LET sample calculation:
Under normal conditions, the motion class of node is similar to people's motion, or according to certain rules, certain pattern motion, or random motion.Each node can be preserved the historical record of each autokinesis simultaneously, and current moving situation, can predict effectively that according to the motion history record of node and the characteristics of motion of node 2 links between the node are at connection state sometime in future, can greatly improve the stability of link, improve reliability of data transmission, and reduce the generation of rebuilding route.
Link prediction comprises two stages:
● obtaining of node motion state information.Before carrying out link prediction, obtain the state that agreement or GPS obtain the node motion, for example node location, node movement velocity, movement direction of nodes etc. by information.
● utilization link prediction method is carried out Link State and is calculated.The prerequisite of link prediction is that the motion of node meets certain motion model substantially, is unpredictable for the motion of completely random.The strategy about link prediction that has proposed at present mainly contains 4 kinds: 1. transmission link keeps the forecast model of connect hours, and 2. 3. the link availability model estimates model, 4. node location forecast model based on the link availability of prediction.Use transmission link to keep the prediction of connect hours in this agreement.
In the wireless network that moves, suppose that all nodes all are in the middle of the free space propagation model, signal strength signal intensity is only relevant with transmitting range.Suppose that simultaneously node times all in the network is synchronous.For any two nodes in a certain moment network,, can think that two nodes can keep connecting at this moment if the distance between the two is not more than effective propagation path.
Based on this thought, the link duration of utilizing the transmission radius of node location that gps system provides, mobile information and node to calculate any two nodes:
Suppose that node i to node j transmission data, makes (x
i, y
i) be mobile node i coordinate, (x
j, y
j) be the coordinate of mobile node j, v
iAnd v
jBe the translational speed of node i and j, θ
iAnd θ
jBe (0＜θ
i, θ
j＜2 π) moving direction of node i and j, after two nodes move a period of time t along separately direction with stable speed, internodal distance reaches node i transmission radius r, if node continues to move, internodal transmission link will rupture, so we incite somebody to action during this period of time, and t thinks that node i arrives the time D of the link maintenance connection of node j
t
r
2＝(at+b)
2+(ct+d)
2 (5)
Wherein, a=v
iCos θ
i-v
jCos θ
j, b=x
i-x
j, c=v
iSin θ
i-v
jSin θ
j, d=y
i-y
j
By formula (5):
Wherein, Δ=(a
2+ c
2) r
2-(ad-bc)
2
The time that prediction is come out be two between the node the link duration (Link Expiration Time, LET).If keep two node speeds of connection consistent with direction, LET is infinitely great, promptly keeps connecting always.As LET＜0, it is invalid then to connect.If any one connects inefficacy in the route, this whole piece route just lost efficacy so.Therefore by all LET on route of prediction, can calculate RET.Suppose that a paths is made up of N bar link, then RET=min (LET
1..., LET
i..., LET
n).
What the forecast model of transmission link maintenance connect hours obtained is a time value, and the tolerance that this time value can be judged as route very easily is incorporated in the existing Routing Protocol.And, generally all can have speed measuring device in the high-speed traffic system, communication node can obtain movable information efficiently and easily.Therefore, this agreement uses transmission link to keep the prediction of connect hours.
Fig. 2 is the form of route requests grouping (RREQ): each routing information request (RREQ) comprises source node and destination node address, a unique request ID by the source node decision, mobile message (current location (the x of route record tabulation and source node S, y), present speed v, current direction θ), the transmission radius r, and in the RREQ bag, expand route retention time territory RET, make RET be initialized as T
Max(maximum of LET in the present networks).Request ID and route originator address one are used from route requests grouping of unique identification, in order to detect the route requests of whether receiving repetition, each node in the network can be safeguarded { route an originator address, the routing information request that this node is initiated or transmitted is recently write down in the route requests tabulation that request ID} is right.
When route record tabulation transmits the RREQ hop-by-hop the node address and the journal of process get off, this address list is initially the tabulation of a sky.
Fig. 3 is the form of RREP grouping, and the RREP in this agreement not only will comprise the route record in the RREQ bag, and will add RET in extension field.
● next-hop node: the node that this message next one will arrive.
● the residue jumping figure: when node is initiated route replies message, be changed to maximum, every through a node, this value subtracts 1.Be kept at 0 o'clock,, then abandon if also not processed.
● route size: when node is initiated route replies message, be changed to the route size in the route request information.In message process, do not change.
● the route of record in route record: the RREQ bag.
Send in the process of RREP to source node S at destination node D, because what this agreement was considered is one way link, so only under intermediate contact is present in situation in the route record, node just can write down this node and arrive the relevant routing iinformation of destination node and the RET among the RREP route connect hours as this node one destination node in routing table, but the RET that notes like this is inaccurate.Do not allow this node to return one of reason of RREP even there is the route that arrives destination node in the route memory of Here it is intermediate node yet.
In the environment of high-speed mobile, the routing iinformation of node storage might during this period of time lose efficacy.In addition, if allow intermediate node to produce RREP, the selection of so much footpath route can only could realize after source node is received many RREP.Can cause the propagation of unnecessary RREP in network like this.Also have, also prevented the generation of " route storm ".
" route storm " is meant when intermediate node is responded route request information according to the information in the own routing table, may produces the route replies storm in some cases.Special when the node broadcasts route request information, if its neighbors has the route that arrives destination node, then each has the neighbors of arrival destination node all can attempt to send route replies message, like this, and will waste bandwidth, and can increase the collision of network.
Fig. 4 is the flow chart of intermediate node handles RREQ.Fig. 5 is the flow chart that destination node is handled RREQ.In conjunction with Fig. 4, Fig. 5, we are elaborated to the key step based on the dynamic multipath routing algorithm of moving projection again:
1) route finding process
When source node S will send grouping to destination node D, S at first can check the route that whether has in its route-caching to D.If any, S will select suitable route to transmit.If it's not true, source node will be initiated a route finding process and be attempted finding a route that arrives destination node.
Routing information request (Route Request in the DSR agreement, RREQ) mobile message that expands node in the grouping comprises current location (x, y), present speed v, current direction θ, transmission radius r, Route Age territory RET, make RET be initialized as can keeping between the node in the network maximum time that connects.
After a node M is received a RREQ, at first judge oneself whether for this reason destination node of RREQ.
1.1) when node M was intermediate node, node M was according to steps of processing RREQ:
1.1.1) when an intermediate node M receives RREQ bag from a last hop node N, the arbitrary matching addresses during whether tabulate with route record the address of judging earlier this node M.If then route loop appears in proof, node abandons this RREQ.If the loop route do not occur, the then route requests of search node tabulation checks whether this node received identical RREQ.Request ID in the RREQ grouping and route originator address one are used from route requests grouping of unique identification, each node in the network can be safeguarded { route an originator address, the right route requests table of request ID} writes down the routing information request that this node is initiated or transmitted recently.
1.1.2) if node M is to receive this RREQ for the first time, node M is taken out position, speed, the direction of motion and the transmission radius of a last node N from RREQ bag, and then predicts that from the relevant information that link layer obtains this node self this node and last node keep the time (LET that is connected
M).
If LET
MLess than the route duration (RET in the current route requests grouping
N), then make RET
M=LET
M, otherwise RET
M=RET
N
If node M is not to receive for the first time then directly to forward 1.1.6 to by this RREQ).
1.1.3) judge the connection duration (RET in the current route requests grouping
M) whether less than the dangerous threshold value T that stipulates
ThIf RET
M≤ T
Th, illustrate that then this link is unreliable, should no longer do any processing, abandon this RREQ; Otherwise, execution in step 1.1.4 then)
1.1.4) the present node M relevant mobile message of using self covers the mobile message of a last hop node N among the REEQ, self address is added in the route record tabulation, this RREQ is broadcasted away, and with in this RREQ bag { the route originator address, request ID} is recorded in the route requests tabulation.T is set simultaneously
Max=RET
M.。Execution in step 1.15 then)
1.1.5) startup timer conter T
e, wait for the RREQ that other are identical.
1.1.6) the route requests tabulation of node M search, find that this node had been received and comprise that identical { the route originator address, the RREQ of request ID} sign then checks timer T
eWhether make zero.If timer makes zero, then abandon this RREQ; Otherwise, then use the mobile message of a last hop node N who comprises among this RREQ and the relevant information of local node to predict that this node and last node keep the time (LET that is connected
Mi).If LET
MiLess than the connect hours RET in the current REEQ grouping
X(X is the numbering of a last hop node) makes RET
Mi=LET
M i, otherwise RET
Mi=RET
XJudge the connect hours RET in the current bag then
MiWhether less than the t in this nodes records
MaxIf RET
Mi＜t
Max, then abandon this RREQ; Otherwise then the present node M relevant mobile message of using self covers the mobile message of a last hop node, and self address is added to during route record tabulates, and this RREQ is broadcasted away.T is set simultaneously
Max=RET
Mi.。
1.1.7) finish.
Different with the DSR algorithm is, do not allow this node to return route replies (Route Reply even there is the route that arrives destination node in the route memory of intermediate node yet, RREP), but will continue to transmit RREQ, destination node can obtain more routing iinformation like this.
1.2) when destination node D receives this RREQ, according to steps of processing RREQ:
1.2.1) tabulation of the route requests of destination node D search node, check whether this node received identical RREQ.If the RREQ grouping of the destination node that this RREQ grouping is first arrival, then execution in step 1.2.2).If this node had been received identical RREQ, then execution in step (6).
1.2.2) after destination node D receives first RREQ, take out position, speed, the direction of motion and the transmission radius of a last node the bag from RREQ bag, and then predict that from the relevant information that link layer obtains this node self this node and last node keep the time (LET that is connected
D).If LET
DLess than the route duration RET in the current route requests grouping
C(X is the numbering of a last hop node) then makes RET
D=LET
D, otherwise RET
D=RET
CExecution in step 1.2.3 then).
1.2.3) judge that whether connect hours RET in the current bag is less than dangerous threshold value T
ThIf RET
D≤ T
Th, then no longer do any processing, abandon this RREQ; Otherwise node D can produce corresponding route replies grouping (RREP) and send it to source node S.Then this route is deposited in the buffer memory, be labeled as main road by, be used for and after to route stand-by make comparisons.And with in this RREQ bag { the route originator address, request ID} is recorded in the route requests tabulation.T is set simultaneously
Max=RET
D
If node D receives then directly to forward 1.2.5 to by this RREQ for the first time)
1.2.4) startup timer conter T
d, wait for the RREQ that other are identical.
1.2.5) if the tabulation of the route requests of node D search, find that this node had been received and include that identical { the route originator address, the RREQ of request ID} sign then checks timer T
dWhether make zero.If timer makes zero, then abandon this RREQ; Otherwise, then utilize the relevant information of a last hop node mobile message and node self that comprises among this RREQ to predict that this node and last node keep the time (LET that is connected
Di).If this time is less than the connect hours RET in the current RREP grouping
X(X is the numbering of a last hop node) makes RET
Di=LET
Di, otherwise RET
Di=RET
XJudge the connect hours RET in the current bag then
DiWhether less than the t in this nodes records
MaxIf RET
Mi＜t
Max, then abandon this RREQ; Otherwise, then the route record in this RREQ bag is deposited in the route-caching of destination node, and with t
MaxReplace to the RET in the dRREQ bag
Mi
1.2.6) finish.
It should be noted that when destination node D finds first RREQ that satisfies condition, then send RREP, simultaneously the route record that carries among this RREQ is deposited in the high-speed cache, start timer T simultaneously to source node
dAt timer T
dThe RREQ that satisfies restrictive condition that receives when not making zero does not send RREP to source node immediately, but only the route record that carries among the RREQ is deposited in the high-speed cache, does further processing after waiting timer makes zero.
After timer makes zero, node D with the route stand-by in the route-caching and main road by comparing, if only exist in the route-caching 1 non-main road by route record, then destination node produces RREP, and the relevant information of this route is sent to source node.If exist in the route-caching 2 or more than 2 non-main road by route record, then utilize formula
Select the big route of C of comprehensive evaluation value to send RREP to source node.
Wherein, C
iBe the non-main road of i bar by the route comprehensive evaluation value, RET
iBe the non-main road of i bar by the route duration, RET
MainBe main road by the route duration, N
I, mainBe the non-main road of i bar by route and main road by comparing different interstitial contents, N
MainBe that main road is by the node number that comprises.
It can be that destination node D uses the route in the own buffer memory that destination node is sent the process of RREP to the node that rises, also can be that D initiates the route that new route finding process is sought arrival S, can also be under the situation of two-way link, thereby destination node generate a route that arrives S from D with the reverse of the route list among the RREQ.RREP in this agreement not only will comprise the route record in the RREQ bag, and will add RET in extension field.
2) route maintenance procedure
After introducing moving projection thought, the route maintenance mechanism of this agreement can be divided into initiatively prediction and two parts of passive adjustment are carried out simultaneously.
2.1) initiatively prediction
Route Age RET can divide into groups along with routing reply (RREP) be sent to source node S.S is when using this route to send data, when RET is reduced to dangerous threshold value T
ThThe time, S can search for route-caching, sees if there is the route of other known arrival D, if it's not true, will initiate the route that new route finding process finds a new arrival D in advance.When S finds the route of a new arrival D in buffer memory or by route finding process, will adopt this route, old route is deleted from buffer memory.
Initiatively prediction is carried out the required time of route maintenance procedure and mainly is made up of the process that sends the route warning and seek new route.Consider under the worst situation be route warning process the jumping figure of process be the diameter (Net_Hops) of this network, do not arrive other route of same purpose simultaneously in the route-caching of source node, must carry out route discovery again, and route finding process the hop count of process also be the diameter (Net_Hops) of this network.Because route discovery is made up of route requests and two processes of route replies, after ignoring computing and other time overhead, whole route maintenance total hop count of process be 3 * Net_Hops.If the process needed time of every hop node is Perhop_Time, the required time of so whole route process of reconstruction can be by equation expression: T
Th=3 * Net_Hops * Perhop_Time
2.2) passive adjustment
This agreement is continued to use DSR agreement method originally and is made passive adjustment.When node find this node to the link of next-hop node because a variety of causes when breaking down, will send a routing error grouping RRER to this source node S of dividing into groups, indicate this link and fault occurred.Simultaneously, the routing table of this node detection oneself, if there is the route lead to destination node in the table, then this node will be replaced the original source route and be the route in its routing table, continue to transmit and divide into groups.Source node receives that the node of routing error grouping can delete the route that all comprise this faulty link.Check the route-caching of oneself then, see if there is the route that other arrive destination node, if having, then the route with other continues to transmit packet; If no, then initiate the route finding process of a new round.
3) Route Selection and route-caching strategy
This agreement is improved the Route Selection and the route-caching strategy of DSR agreement by introducing Route Age, makes mobile node can select route and management route-caching more targetedly.
3.1) routing strategy
When source node S will send data and divides into groups to D, it can search for the route-caching of oneself, if do not comprise in the route-caching towards the route of destination D, then initiates route finding process, and when receiving first routing reply grouping RREP, it can directly adopt this route.
If S search route-caching finds to exist the route of many arrival destination D, its can be selected in these many routes, rather than simply selects article one route in the buffer memory.
● its first criterion is set at RET, and S can select for use the route of RET maximum as new route;
● when the route that several RET are more or less the same occurring, can be set to | RET
i-RET
j|＜Perhop_Time, S can select the less route of jumping figure in these several the routes for use, as new route.
The strategy of this selection route be equally applicable to route maintenance situation (if the route of using because near dangerous threshold value T
ThWhen perhaps uncertain reason ruptured, S just needed the route-caching inquiry of search oneself whether alternative route is arranged).
3.2) the route-caching strategy
The overtime setting of the buffer memory of DSR is to select quiescent value.When the time of the route in the buffer memory in buffer memory surpasses the time value that is provided with in advance, just this routing iinformation is removed.After introducing Route Age RET, we can be accurately overtime to its buffer memory of every Route Selection.The RET that adds this route when the route joining day proves that this route lost efficacy, and removed during smaller or equal to the current time from route-caching.
Abandoning on the strategy of cache information, if the information in the buffer memory reaches the upper limit of capacity, and have under the situation that new clauses and subclauses need add, the route joining day that cache policy can calculate each clauses and subclauses therewith route RET's and, with this and route (the promptly the most approaching overtime route) deletion that approaches the current time most, so that add new route.Like this, just can guarantee that the route that stays all is available in route-caching.
Claims (1)
1. dynamic multipath routing algorithm based on moving projection.It is characterized in that: described dynamic multipath routing algorithm comprises the steps:
1) route finding process
When source node S will send grouping to destination node D, S at first can check the route that whether has in its route-caching to D.If any, S will select suitable route to transmit.If it's not true, source node will be initiated a route finding process and be attempted finding a route that arrives destination node.
Routing information request (Route Request in the DSR agreement, RREQ) mobile message that expands node in the grouping comprises current location (x, y), present speed v, current direction θ, transmission radius r, Route Age territory RET, make RET be initialized as can keeping between the node in the network maximum time that connects.
After a node M is received a RREQ, at first judge oneself whether for this reason destination node of RREQ.
1.1) when node M was intermediate node, node M was according to steps of processing RREQ:
1.1.1) when an intermediate node M receives RREQ bag from a last hop node N, the arbitrary matching addresses during whether tabulate with route record the address of judging earlier this node M.If then route loop appears in proof, node abandons this RREQ.If the loop route do not occur, the then route requests of search node tabulation checks whether this node received identical RREQ.Request ID in the RREQ grouping and route originator address one are used from route requests grouping of unique identification, each node in the network can be safeguarded { route an originator address, the right route requests table of request ID} writes down the routing information request that this node is initiated or transmitted recently.
1.1.2) if node M is to receive this RREQ for the first time, node M is taken out position, speed, the direction of motion and the transmission radius of a last node N from RREQ bag, and then predicts that from the relevant information that link layer obtains this node self this node and last node keep the time (LET that is connected
M).
Suppose that all nodes among the mobile network all are in the middle of the free space propagation model, signal strength signal intensity is only relevant with transmitting range.Suppose the time synchronized of all nodes simultaneously.For any two nodes in a certain moment network,, can think that two nodes can keep connecting at this moment if the distance between the two is not more than effective propagation path.
Suppose that node i to adjacent node j transmission data, makes (x
i, y
i), (x
j, y
j) be respectively the coordinate of mobile node i, j, v
i, v
jBe respectively the translational speed of node i and j, θ
i, θ
j(0＜θ
i, θ
j＜2 π) be the moving direction of node i, j respectively, translational speed is decomposed into x axle and the axial component of y, promptly the movement velocity of node i, j is respectively (v
Ix, v
Iy), (v
Jx, v
Jy, behind the elapsed time t, the coordinate of node i, j is respectively (x
i+ tv
Ix, y
i+ tv
Iy), (x
j+ tv
Jx, y
j+ tv
Jy).If r
iBe the transmission radius of node i, the transmission radius formula (1) that reaches node i when two internodal distances is:
((x
i+tv
ix)-(x
j+tv
jx))
2+((y
i+tv
iy)-(y
j+tv
jy))
2＝r
i 2 (1)
Solve t by following formula (1), t is the life span LET of this link, for a route of forming by n bar link, and its Route Age RET,
RET＝min(LET
1，…，LET
i，…，LET
n) (2)
If LET
MLess than the route duration (RET in the current route requests grouping
N), then make RET
M=LET
M, otherwise RET
M=RET
N
If node M is not to receive for the first time then directly to forward 1.1.6 to by this RREQ).
1.1.3) judge the connection duration (RET in the current route requests grouping
M) whether less than the dangerous threshold value T that stipulates
ThIf RET
M≤ T
Th, illustrate that then this link is unreliable, should no longer do any processing, abandon this RREQ; Otherwise, execution in step 1.1.4 then)
1.1.4) the present node M relevant mobile message of using self covers the mobile message of a last hop node N among the REEQ, self address is added in the route record tabulation, this RREQ is broadcasted away, and with in this RREQ bag { the route originator address, request ID} is recorded in the route requests tabulation.T is set simultaneously
Max=RET
M。Execution in step 1.15 then)
1.1.5) startup timer conter T
e, wait for the RREQ that other are identical.
1.1.6) the route requests tabulation of node M search, find that this node had been received and comprise that identical { the route originator address, the RREQ of request ID} sign then checks timer T
eWhether make zero.If timer makes zero, then abandon this RREQ; Otherwise, then use the mobile message of a last hop node N who comprises among this RREQ and the relevant information of local node to predict that this node and last node keep the time (LET that is connected
Mi).If LET
MiLess than the connect hours RET in the current REEQ grouping
X(X is the numbering of a last hop node) makes RET
Mi=LET
M i, otherwise RET
Mi=RET
XJudge the connect hours RET in the current bag then
MiWhether less than the t in this nodes records
MaxIf RET
Mi＜t
Max, then abandon this RREQ; Otherwise then the present node M relevant mobile message of using self covers the mobile message of a last hop node, and self address is added to during route record tabulates, and this RREQ is broadcasted away.T is set simultaneously
Max=RET
Mi。
1.1.7) finish.
Different with the DSR algorithm is, do not allow this node to return route replies (Route Reply even there is the route that arrives destination node in the route memory of intermediate node yet, RREP), but will continue to transmit RREQ, destination node can obtain more routing iinformation like this.
1.2) when destination node D receives this RREQ, according to steps of processing RREQ:
1.2.1) tabulation of the route requests of destination node D search node, check whether this node received identical RREQ.If the RREQ grouping of the destination node that this RREQ grouping is first arrival, then execution in step 1.2.2).If this node had been received identical RREQ, then execution in step (6).
1.2.2) after destination node D receives first RREQ, take out position, speed, the direction of motion and the transmission radius of a last node the bag from RREQ bag, and then predict that from the relevant information that link layer obtains this node self this node and last node keep the time (LET that is connected
D).If LET
DLess than the route duration RET in the current route requests grouping
C(X is the numbering of a last hop node) then makes RET
D=LET
D, otherwise RET
D=RET
CExecution in step 1.2.3 then).
1.2.3) judge that whether connect hours RET in the current bag is less than dangerous threshold value T
ThIf RET
D≤ T
Th, then no longer do any processing, abandon this RREQ; Otherwise node D can produce corresponding route replies grouping (RREP) and send it to source node S.Then this route is deposited in the buffer memory, be labeled as main road by, be used for and after to route stand-by make comparisons.And with in this RREQ bag { the route originator address, request ID} is recorded in the route requests tabulation.T is set simultaneously
Max=RET
D
If node D receives then directly to forward 1.2.5 to by this RREQ for the first time)
1.2.4) startup timer conter T
d, wait for the RREQ that other are identical.
1.2.5) if the tabulation of the route requests of node D search, find that this node had been received and include that identical { the route originator address, the RREQ of request ID} sign then checks timer T
dWhether make zero.If timer makes zero, then abandon this RREQ; Otherwise, then utilize the relevant information of a last hop node mobile message and node self that comprises among this RREQ to predict that this node and last node keep the time (LET that is connected
Di).If this time is less than the connect hours RET in the current RREP grouping
X(X is the numbering of a last hop node) makes RET
Di=LET
Di, otherwise RET
Di=RET
XJudge the connect hours RET in the current bag then
DiWhether less than the t in this nodes records
MaxIf RET
Mi＜t
Max, then abandon this RREQ; Otherwise, then the route record in this RREQ bag is deposited in the route-caching of destination node, and with t
MaxReplace to the RET in the dRREQ bag
Mi
1.2.6) finish.
It should be noted that when destination node D finds first RREQ that satisfies condition, then send RREP, simultaneously the route record that carries among this RREQ is deposited in the high-speed cache, start timer T simultaneously to source node
dAt timer T
dThe RREQ that satisfies restrictive condition that receives when not making zero does not send RREP to source node immediately, but only the route record that carries among the RREQ is deposited in the high-speed cache, does further processing after waiting timer makes zero.
After timer makes zero, node D with the route stand-by in the route-caching and main road by comparing, if only exist in the route-caching 1 non-main road by route record, then destination node produces RREP, and the relevant information of this route is sent to source node.If exist in the route-caching 2 or more than 2 non-main road by route record, then utilize formula (3) to select the big route of C of comprehensive evaluation value to send RREP to source node.
Wherein, C
iBe the non-main road of i bar by the route comprehensive evaluation value, RET
iBe the non-main road of i bar by the route duration, RET
MainBe main road by the route duration, N
I, mamBe the non-main road of i bar by route and main road by comparing different interstitial contents, N
MainBe that main road is by the node number that comprises.
It can be that destination node D uses the route in the own buffer memory that destination node is sent the process of RREP to the node that rises, also can be that D initiates the route that new route finding process is sought arrival S, can also be under the situation of two-way link, thereby destination node generate a route that arrives S from D with the reverse of the route list among the RREQ.RREP in this agreement not only will comprise the route record in the RREQ bag, and will add RET in extension field.
2) route maintenance procedure
After introducing moving projection thought, the route maintenance mechanism of this agreement can be divided into initiatively prediction and two parts of passive adjustment are carried out simultaneously.
2.1) initiatively prediction
Route Age RET can divide into groups along with routing reply (RREP) be sent to source node S.S is when using this route to send data, when RET is reduced to dangerous threshold value T
ThThe time, S can search for route-caching, sees if there is the route of other known arrival D, if it's not true, will initiate the route that new route finding process finds a new arrival D in advance.When S finds the route of a new arrival D in buffer memory or by route finding process, will adopt this route, old route is deleted from buffer memory.
Initiatively prediction is carried out the required time of route maintenance procedure and mainly is made up of the process that sends the route warning and seek new route.Consider under the worst situation be route warning process the jumping figure of process be the diameter (Net_Hops) of this network, do not arrive other route of same purpose simultaneously in the route-caching of source node, must carry out route discovery again, and route finding process the hop count of process also be the diameter (Net_Hops) of this network.Because route discovery is made up of route requests and two processes of route replies, after ignoring computing and other time overhead, whole route maintenance total hop count of process be 3 * Net_Hops.If the process needed time of every hop node is Perhop_Time, the required time of so whole route process of reconstruction can be by equation expression;
T
th＝3×Net_Hops×Perhop_Time (4)
2.2) passive adjustment
This agreement is continued to use DSR agreement method originally and is made passive adjustment.When node find this node to the link of next-hop node because a variety of causes when breaking down, will send a routing error grouping RRER to this source node S of dividing into groups, indicate this link and fault occurred.Simultaneously, the routing table of this node detection oneself, if there is the route lead to destination node in the table, then this node will be replaced the original source route and be the route in its routing table, continue to transmit and divide into groups.Source node receives that the node of routing error grouping can delete the route that all comprise this faulty link.Check the route-caching of oneself then, see if there is the route that other arrive destination node, if having, then the route with other continues to transmit packet; If no, then initiate the route finding process of a new round.
3) Route Selection and route-caching strategy
This agreement is improved the Route Selection and the route-caching strategy of DSR agreement by introducing Route Age, makes mobile node can select route and management route-caching more targetedly.
3.1) routing strategy
When source node S will send data and divides into groups to D, it can search for the route-caching of oneself, if do not comprise in the route-caching towards the route of destination D, then initiates route finding process, and when receiving first routing reply grouping RREP, it can directly adopt this route.
If S search route-caching finds to exist the route of many arrival destination D, its can be selected in these many routes, rather than simply selects article one route in the buffer memory.
● its first criterion is set at RET, and S can select for use the route of RET maximum as new route;
● when the route that several RET are more or less the same occurring, judgment criterion is | RET
i-RET
j|＜Perhop_Time, S can select the less route of jumping figure in these several the routes for use, as new route.
The strategy of this selection route be equally applicable to route maintenance situation (if the route of using because near dangerous threshold value T
ThWhen perhaps uncertain reason ruptured, S just needed the route-caching inquiry of search oneself whether alternative route is arranged).
3.2) the route-caching strategy
The overtime setting of the buffer memory of DSR is to select quiescent value.When the time of the route in the buffer memory in buffer memory surpasses the time value that is provided with in advance, just this routing iinformation is removed.After introducing Route Age RET, we can be accurately overtime to its buffer memory of every Route Selection.The RET that adds this route when the route joining day proves that this route lost efficacy, and removed during smaller or equal to the current time from route-caching.
Abandoning on the strategy of cache information, if the information in the buffer memory reaches the upper limit of capacity, and have under the situation that new clauses and subclauses need add, the route joining day that cache policy can calculate each clauses and subclauses therewith route RET's and, with this and route (the promptly the most approaching overtime route) deletion that approaches the current time most, so that add new route.Like this, just can guarantee that the route that stays all is available in route-caching.2, a kind of dynamic multipath routing algorithm as claimed in claim 1 based on moving projection, be primarily characterized in that: this algorithm can be sought metastable route for the node in the wireless Mesh netword of high-speed mobile, and the irrelevance of the mulitpath that searches out is bigger, reduce the number of times of rebuilding route, reduced routing cost and network congestion effectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910021387A CN101827413A (en) | 2009-03-05 | 2009-03-05 | Dynamic multipath routing algorithm based on mobility prediction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910021387A CN101827413A (en) | 2009-03-05 | 2009-03-05 | Dynamic multipath routing algorithm based on mobility prediction |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101827413A true CN101827413A (en) | 2010-09-08 |
Family
ID=42691058
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910021387A Pending CN101827413A (en) | 2009-03-05 | 2009-03-05 | Dynamic multipath routing algorithm based on mobility prediction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101827413A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006651A (en) * | 2010-12-02 | 2011-04-06 | 电子科技大学 | Distributed ad hoc network stable path routing method based on link lifetime |
| CN102404819A (en) * | 2012-01-04 | 2012-04-04 | 南京大学 | Routing method based on hops and relative moving velocity of nodes in wireless ad hoc network |
| CN102595458A (en) * | 2012-03-16 | 2012-07-18 | 电子科技大学 | Distributed multi-path route-healing method |
| CN103476086A (en) * | 2013-09-18 | 2013-12-25 | 南京理工大学 | Dynamic multi-path AODV routing method based on node congestion degree prediction |
| CN103874162A (en) * | 2014-03-21 | 2014-06-18 | 徐州工业职业技术学院 | Downhole wireless sensor network on-demand routing algorithm |
| CN104023349A (en) * | 2014-05-19 | 2014-09-03 | 上海交通大学 | AODV-based link interruption prediction and restoration method |
| CN104394537A (en) * | 2014-12-11 | 2015-03-04 | 广东工业大学 | Multi-target attention wireless Mesh router deployment optimization method |
| CN105792312A (en) * | 2016-03-02 | 2016-07-20 | 山东航天电子技术研究所 | Ad-hoc network routing method based on combination of active and passive ways |
| CN107071850A (en) * | 2016-12-08 | 2017-08-18 | 南京航空航天大学 | A kind of improved AODV Routing Protocols for being suitable for different motion scene |
| CN109644386A (en) * | 2016-09-05 | 2019-04-16 | 三菱电机株式会社 | Wireless communication terminal, wireless communication system and router |
| CN111417165A (en) * | 2020-04-01 | 2020-07-14 | 南通大学 | Bluetooth Mesh energy efficiency routing method based on awakening time prediction |
| CN113055230A (en) * | 2021-03-09 | 2021-06-29 | 同济大学 | Network reconstruction method and system for information physical system |
| CN114390631A (en) * | 2022-02-15 | 2022-04-22 | 重庆邮电大学 | Multipath routing protocol method for unmanned aerial vehicle ad hoc network mobility prediction |
| CN114785727A (en) * | 2022-05-06 | 2022-07-22 | 河海大学 | Calculation method for eliminating repeated routes |
-
2009
- 2009-03-05 CN CN200910021387A patent/CN101827413A/en active Pending
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006651A (en) * | 2010-12-02 | 2011-04-06 | 电子科技大学 | Distributed ad hoc network stable path routing method based on link lifetime |
| CN102404819A (en) * | 2012-01-04 | 2012-04-04 | 南京大学 | Routing method based on hops and relative moving velocity of nodes in wireless ad hoc network |
| CN102595458A (en) * | 2012-03-16 | 2012-07-18 | 电子科技大学 | Distributed multi-path route-healing method |
| CN102595458B (en) * | 2012-03-16 | 2014-04-09 | 电子科技大学 | Distributed multi-path route-healing method |
| CN103476086B (en) * | 2013-09-18 | 2016-07-06 | 南京理工大学 | Dynamic multi-path AODV method for routing based on the prediction of node congestion degree |
| CN103476086A (en) * | 2013-09-18 | 2013-12-25 | 南京理工大学 | Dynamic multi-path AODV routing method based on node congestion degree prediction |
| CN103874162A (en) * | 2014-03-21 | 2014-06-18 | 徐州工业职业技术学院 | Downhole wireless sensor network on-demand routing algorithm |
| CN103874162B (en) * | 2014-03-21 | 2018-01-05 | 徐州工业职业技术学院 | A kind of downhole wireless sensing network routing method on demand |
| CN104023349A (en) * | 2014-05-19 | 2014-09-03 | 上海交通大学 | AODV-based link interruption prediction and restoration method |
| CN104023349B (en) * | 2014-05-19 | 2017-09-26 | 上海交通大学 | Link down prediction and restorative procedure based on AODV |
| CN104394537A (en) * | 2014-12-11 | 2015-03-04 | 广东工业大学 | Multi-target attention wireless Mesh router deployment optimization method |
| CN104394537B (en) * | 2014-12-11 | 2017-12-05 | 广东工业大学 | A kind of Wireless Mesh router disposition optimization method of multiple target concern |
| CN105792312A (en) * | 2016-03-02 | 2016-07-20 | 山东航天电子技术研究所 | Ad-hoc network routing method based on combination of active and passive ways |
| CN109644386B (en) * | 2016-09-05 | 2022-12-09 | 三菱电机株式会社 | Wireless communication terminal, wireless communication system, and recording medium |
| CN109644386A (en) * | 2016-09-05 | 2019-04-16 | 三菱电机株式会社 | Wireless communication terminal, wireless communication system and router |
| CN107071850A (en) * | 2016-12-08 | 2017-08-18 | 南京航空航天大学 | A kind of improved AODV Routing Protocols for being suitable for different motion scene |
| CN111417165A (en) * | 2020-04-01 | 2020-07-14 | 南通大学 | Bluetooth Mesh energy efficiency routing method based on awakening time prediction |
| CN111417165B (en) * | 2020-04-01 | 2023-01-24 | 南通大学 | Bluetooth Mesh energy efficiency routing method based on awakening time prediction |
| CN113055230A (en) * | 2021-03-09 | 2021-06-29 | 同济大学 | Network reconstruction method and system for information physical system |
| CN113055230B (en) * | 2021-03-09 | 2022-04-19 | 同济大学 | Network reconstruction method and system for information physical system |
| CN114390631A (en) * | 2022-02-15 | 2022-04-22 | 重庆邮电大学 | Multipath routing protocol method for unmanned aerial vehicle ad hoc network mobility prediction |
| CN114785727A (en) * | 2022-05-06 | 2022-07-22 | 河海大学 | Calculation method for eliminating repeated routes |
| CN114785727B (en) * | 2022-05-06 | 2023-04-25 | 河海大学 | Calculation method for eliminating repeated route |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101827413A (en) | Dynamic multipath routing algorithm based on mobility prediction | |
| Sood et al. | Clustering in MANET and VANET: A survey | |
| CN103118412B (en) | Trust-based on-demand multipath vector routing algorithm of Ad Hoc network | |
| Yan et al. | Provisioning vehicular ad hoc networks with quality of service | |
| CN103813364B (en) | Mobile self-organizing network interrupt data recovery method based on area perception | |
| CN102802228A (en) | AdHoc network multipath routing method oriented to link stability | |
| CN104010343A (en) | Wireless network optimization method for intelligent meter reading system | |
| CN103957571A (en) | Ad hoc network route discovery method based on Brownian motion | |
| Pandey et al. | Efficient ad hoc on demand distance vector routing protocol based on route stability in MANETs | |
| CN101355506B (en) | Method for implementing multi-path route of Ad Hoc network | |
| CN102006651A (en) | Distributed ad hoc network stable path routing method based on link lifetime | |
| Xu et al. | A Novel Link Stability and Energy Aware Routing with Tradeoff Strategy in Mobile Ad Hoc Networks. | |
| Onuara et al. | A Comprehensive Review of Routing Protocols for Mobile Ad Hoc Networks (Manets) | |
| Brahmi et al. | Routing in vehicular ad hoc networks: towards road-connectivity based routing | |
| Lim et al. | Landmark guided forwarding | |
| Kumar et al. | Energy efficient routing protocol avoiding route breaks based on DSR | |
| Kumar et al. | Study and design of route repairing mechanism in MANET | |
| Moghim et al. | Ad-hoc wireless network routing protocols and improved AODV | |
| Zhang et al. | Impact of selfish nodes on route discovery in mobile ad hoc networks | |
| Kawtar et al. | Comparative study about the routing protocols on the vehicular networks and the v2v communications | |
| Asokan et al. | Quality-of-service routing using path and power aware techniques in mobile ad hoc networks | |
| Hsu et al. | A hybrid efficient routing protocol for sink-oriented ad hoc sensor networks | |
| Kaur | Performance Analysis of AODV routing protocol in Manets | |
| Shukla et al. | Sequence-number aided timer based DSR protocol in MANET: TDSR | |
| Deshmukh et al. | 1 Adaptive routing for emergency communication via MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| DD01 | Delivery of document by public notice |
Addressee: Zhao Xin Document name: Notification of Publication of the Application for Invention |
|
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100908 |