Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beal, J.: Persistent nodes for reliable memory in geographically local networks. Tech Report AIM-2003-11, MIT (2003)
Beal, J.: A robust amorphous hierarchy from persistent nodes. In: Proc. of Communication Systems and Networks (2003)
Camp, T., Liu, Y.: An adaptive mesh-based protocol for geocast routing. Journal of Parallel and Distributed Computing: Special Issue on Mobile Ad-hoc Networking and Computing, 196–213 (2002)
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: An efficient communication strategy for ad-hoc mobile networks. In: Proc. 15th International Symp. on Distributed Computing (2001)
Dolev, S., Gilbert, S., Lynch, N.A., Schiller, E., Shvartsman, A.A., Welch, J.L.: Virtual mobile nodes for mobile adhoc networks. Tech Report LCS-TR-937, MIT (2004)
Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A.A., Welch, J.: Geoquorums: Implementing atomic memory in mobile ad hoc networks. In: Proceeding of the 17th International Conference on Distributed Computing (2003)
Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A.A., Welch, J.L.: Geoquorums: Implementing atomic memory in ad hoc networks. Tech Report LCS-TR-900, MIT (2003)
Dolev, S., Schiller, E., Welch, J.: Random walk for self-stabilizing group communication in ad-hoc networks. In: Proc. of the 21st IEEE Symp. on Reliable Distributed Systems (2002)
Communications of the ACM, Special section on Group Communication Systems 39(4) (1996)
Hatzis, K.P., Pentaris, G.P., Spirakis, P.G., Tampakas, V.T., Tan, R.B.: Fundamental control algorithms in mobile networks. In: Proc. of the 1st ACM Symp. on Parallel Algorithms and Architectures archive, Saint Malo, France (1999)
Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: The theory of timed I/O automata. Tech Report MIT-LCS-TR-917a, MIT (2004)
Keidar, I.: A highly available paradigm for consistent object replication. Master’s thesis, Hebrew University, Jerusalem (1994), http://www.cs.huji.ac.il/simtransis/publications.html
Keidar, I., Dolev, D.: Efficient message ordering in dynamic networks. In: Proc. of the 15th annual ACM Symp. on Principles of distributed computing (1996)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Li, Q., Rus, D.: Sending messages to mobile users in disconnected ad-hoc wireless networks. In: Proc. of the 6th MobiCom (2000)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Nagpal, R., Shrobe, H., Bachrach, J.: Organizing a global coordinate system from local information on an ad hoc sensor network. In: 2nd Workshop on Information Processing in Sensor Networks (2003)
Nath, B., Niculescu, D.: Routing on a curve. ACM SIGCOMM Computer Communication Review 33(1), 150–160 (2003)
Navas, J.C., Imielinski, T.: Geocast – geographic addressing and routing. In: Proc. of the 3rd MobiCom (1997)
Priyantha, N.B., Chakraborty, A., Balakrishnan, H.: The cricket location-support system. In: Proc. of the 6th MobiCom (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dolev, S., Gilbert, S., Lynch, N.A., Schiller, E., Shvartsman, A.A., Welch, J.L. (2004). Virtual Mobile Nodes for Mobile Ad Hoc Networks. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-30186-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23306-0
Online ISBN: 978-3-540-30186-8
eBook Packages: Springer Book Archive