Method for predicting the mobility in mobile ad hoc networks
First Claim
1. Method for predicting the mobility in mobile ad hoc networks, the method comprising steps of:
- constructing neighborhood local view of a node;
predicting locations of said node and its neighbor nodes at the same future time using said neighborhood local view in prescribed time interval;
updating neighborhood local view by aggregating neighbors'"'"' predicted location;
reconstructing said neighborhood local view by setting smaller neighborhood range.
1 Assignment
0 Petitions
Accused Products
Abstract
Disclosed are methods for determining the neighborhood local view of a mobile node in time which can facilitate the forwarding decision in the design of network protocols. In conventional mobile ad hoc networks nodes set up local topology view based on periodical received “Hello” messages. The conventional method is replaced with proactive and adaptive methods of predicting locations of nodes based on preserved historical information extracted from received “Hello” messages and constructing neighborhood view by aggregating predicted locations. This method is useful for providing updated and consistent topology local view that a network communication employs to determine optimal forward decisions and improve communication performance.
-
Citations
9 Claims
-
1. Method for predicting the mobility in mobile ad hoc networks, the method comprising steps of:
-
constructing neighborhood local view of a node; predicting locations of said node and its neighbor nodes at the same future time using said neighborhood local view in prescribed time interval; updating neighborhood local view by aggregating neighbors'"'"' predicted location; reconstructing said neighborhood local view by setting smaller neighborhood range. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
2. The method as claimed in claim 1, wherein the prescribed time interval is time period within which any neighbor node stays in the transmission range of said node, Tdwell is given by
-
[ T dwell ] = π A E [ V ] L where E[Tdwell] is average value of the Tdwell, A is the area of the transmission range, L is the perimeter of this area, E[V] is average value of V and V is relative velocity vector of node.
-
-
3. The method as claimed in claim 2, wherein average value of V, E[V] is given by
-
[ V ] = 1 π 2 ∫ V min V max ∫ V min V max ( v 1 + v 2 ) F e ( 2 v 1 v 2 v 1 + v 2 ) f V ( v 1 ) f V ( v 2 ) v 1 v 2 where is complete elliptic integral of the second kind, fv(v1), fv(v2) is the joint pdf of the random variables V1, V2.
-
-
4. The method as claimed in claim 1, wherein in said step of predicting locations of said node and its neighbor nodes, each location (xp, yp, zp) at a future time tp is calculated as
-
h + x 1 h - x 2 h t 1 h - t 2 h ( t p - t 1 h ) y p = y 1 h + y 1 h - y 2 h t 1 h - t 2 h ( t p - t 1 h ) z p = z 1 h + z 1 h - z 2 h t 1 h - t 2 h ( t p - t 1 h ) where (x1h, y1h, z1h) is a location at a time t1h, (x2h, y2h, z2h) is a location at a time t2h, and t1h>
t2h.
-
-
5. The method as claimed in claim 1, wherein in said step of predicting locations of said node and its neighbor nodes, each location (xp, yp, zp) at a future time tp is calculated as
-
h + v x ′ ( t p - t 1 h ) y p = y 1 h + v y ′ ( t p - t 1 h ) z p = z 1 h + v z ′ ( t p - t 1 h ) where (x1h, y1h, z1h) is a location at a time t1h, (v′
x, v′
y, v′
z) is a velocity of latest update for a particular node.
-
-
6. The method as claimed in claim 1, wherein in said step of predicting locations of said node and its neighbor nodes, each location (xp, yp, zp) at a future time tp is calculated as
-
h + 2 v x ′ + ( v x ′ - v x ″ ) t p - t 1 h t 1 h - t 2 h 2 ( t p - t 1 h ) y p = y 1 h + 2 v y ′ + ( v y ′ - v y ″ ) t p - t 1 h t 1 h - t 2 h 2 ( t p - t 1 h ) z p = z 1 h + 2 v z ′ + ( v z ′ - v z ″ ) t p - t 1 h t 1 h - t 2 h 2 ( t p - t 1 h ) where (x1h, y1h, z1h) is a location at a time t1h, (v′
x, v′
y, v′
z) is the velocity of first update for a particular node, and (v−
x, v″
y, v″
z) is the velocity of second update for a particular node.
-
-
7. The method as claimed in claim 1, wherein said smaller neighborhood range SR is given by
E[SR]=(1−-
p)R1
where p is probability that any node moves into the transmission range of node S, R1 is radius of node S.
-
p)R1
-
8. The method as claimed in claim 7, wherein
-
( V → 2 , V → 1 , a , b ) = { 1 ; a ≤ V → 2 - V → 1 ≤ b 0 ; otherwise . where v is a relative speed, {right arrow over (V)} is the random relative velocity vector proposed in previous section and s is the maximum speed for any node.
-
-
9. The method as claimed in claim 8, wherein
-
V → ( t ) ≈ F V → ( δ t ) - F V → ( t ) δ t = P ( t ≤ V → ≤ t + δ t ) δ t = ∮ ( 0 , 0 ) ( 2 π , s ) ∮ ( 0 , 0 ) ( 2 π , s ) R ( V → 2 , V → 1 , t , t + δ t ) ( 2 π s ) 2 δ t · V → 2 V → 1 , where f□
{right arrow over (V)}□
(t) is the distribution function, δ
t is a small positive value, and
-
-
2. The method as claimed in claim 1, wherein the prescribed time interval is time period within which any neighbor node stays in the transmission range of said node, Tdwell is given by
-
Specification
- Resources
-
Current AssigneeIndustry-Academic Cooperation Foundation Yonsei University
-
Original AssigneeIndustry-Academic Cooperation Foundation Yonsei University
-
InventorsXu, Hui, Lee, Young-Koo, Lee, Sungyoung
-
Application NumberUS11/892,031Publication NumberTime in Patent OfficeDaysField of SearchUS Class Current370/338CPC Class CodesH04W 40/18 based on predicted eventsH04W 40/20 based on geographic positio...H04W 40/24 Connectivity information ma...H04W 8/005 Discovery of network device...