Last Encounter Routing under Random Waypoint Mobility

Last Encounter Routing (LER) algorithms for mobile ad hoc networks rely only on encounter histories at every node to route packets, and therefore do not need control traffic to track topology changes due to node mobility. LER exploits the fact that past information about a node’s mobility helps to locate that node in the future. As we have pointed out in earlier work [1], the performance of LER algorithms depends on the mobility processes of nodes.

[1]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[2]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

[3]  Jean-Yves Le Boudec,et al.  Min-plus and Max-plus System Theory Applied to Communication Networks , 2003, POSTA.

[4]  Matthias Grossglauser,et al.  Space-Time Routing in Ad Hoc Networks , 2003, ADHOC-NOW.

[5]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[6]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Martin Vetterli,et al.  Locating nodes with EASE: last encounter routing in ad hoc networks through mobility diffusion , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Lee D. Davisson,et al.  An Introduction To Statistical Signal Processing , 2004 .