One of the most significant challenges introduced by mobile networks is coping with the unpredictable motion and the unreliable behavior of mobile nodes. In this paper, we define the Virtual Mobile Node Abstraction, which consists of robust virtual nodes that are both predictable and reliable. We present the Mobile Point Emulator, a new algorithm that implements the Virtual Mobile Node Abstraction. This algorithm replicates each virtual node at a constantly
changing set of real nodes, modifying the set of replicas as the real nodes move in and out of the path of the virtual node.
We show that the Mobile Point Emulator correctly implements a virtual mobile node, and that it is robust as long as the virtual
node travels through well-populated areas of the network. The Virtual Mobile Node Abstraction significantly simplifies the
design of efficient algorithms for highly dynamic mobile ad hoc networks.
This work is supported in part by NSF grants CCR-0098305, ITR-0121277, 64961-CS, 9988304, 0311368, 9984774 and 0098305, AFOSR
#F49620-00-1-0097, USAF–AFRL Award #FA9550-04-1-0121, DARPA #F33615-01-C-1896, NTT MIT9904-12,Texas Advanced Research Program
000512-0091-2001, an IBM faculty award, the Israeli Ministry of Defense, the Ministry of Trade and Industry, and the Rita
Altura chair. Part of the work of the first and fourth authors has been done during visits to MIT and Texas A&M.