MLS An Efficient Location Service for Mobile Ad Hoc Networks

Roland Flury, Roger Wattenhofer Computer Engineering and Networks Lab, ETH Zurich Ch-8092 Zurich, Switzerland [email_address] , [email_address] , 指導老師：張耀仁老師學號： 9476613 姓名：廖泰成 MLS An Efficient Location Service for Mobile Ad Hoc Networks

Outline ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Introduction ,[object Object],[object Object],[object Object],- A node forwards a message to its neighbor closest to the destination - To surround routing voids a message may be routed along the border of the hole

Introduction ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Introduction ,[object Object],[object Object],[object Object],[object Object]

Introduction ,[object Object],[object Object],?

Related work ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Related work - GLS ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],26, 31, 32, 74, 75, 79, 98 ,[object Object],[object Object],2 55 43 75 98 31 63 17 79 12 27 87 32 23 81 33 8 56 4 28 99 62 74 12 26 91 23 23 23 23 23 23

Related work - LLS ,[object Object],[object Object],[object Object],[object Object],[object Object],“ O()”= ＞ lookup algorithm “ d”= ＞ distance of node to node

MLS contribution ,[object Object],[object Object],[object Object],[object Object],[object Object]

Model ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Model ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Algorithm & Analysis ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],t t

Algorithm & Analysis ,[object Object],[object Object],[object Object],[object Object],[object Object],Performance If the destination is d away from sender, the lookup path is O( d ).

Algorithm & Analysis ,[object Object],[object Object],[object Object],[object Object],[object Object],Performance If the destination is d away from sender, the lookup path to find a first location pointer is O( d ).

Algorithm & Analysis ,[object Object],[object Object],[object Object],[object Object],[object Object],Unbounded publish cost!

Algorithm & Analysis ,[object Object],[object Object],Only update a location pointer if the node has moved away quite a bit Breaks the location pointer chain! ?

Algorithm & Analysis ,[object Object],[object Object]

Algorithm & Analysis ,[object Object],? ,[object Object],[object Object],[object Object],[object Object],[object Object],Note: These problems arise independently of the node speed.

Algorithm & Analysis ,[object Object],[object Object],[object Object],Do not delete a location or forwarding pointer, but replace it with a Temporary Forwarding Pointer (TFP) TFP are temporary and must be removed after a well known time.

Algorithm & Analysis ,[object Object],[object Object],[object Object]

Algorithm & Analysis ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Simulation ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Simulation Smallest three levels around node “t”

Simulation (Result) Max speed of node

Conclusion ,[object Object],[object Object],[object Object],[object Object],[object Object]

MLS An Efficient Location Service for Mobile Ad Hoc Networks

Recommandé

Recommandé

Contenu connexe

Tendances

Tendances (20)

En vedette

En vedette (7)

Similaire à MLS An Efficient Location Service for Mobile Ad Hoc Networks

Similaire à MLS An Efficient Location Service for Mobile Ad Hoc Networks (20)

Dernier

Dernier (20)

MLS An Efficient Location Service for Mobile Ad Hoc Networks