Abstract
Snapshot algorithms are fundamental algorithms in distributed computing. However, most existing snapshot algorithms are designed for a static network system in which the set of channels and the processes at the endpoints of the channels do not change with time. They cannot be applied directly in recent emerging MANETs, which usually have no fixed infrastructure and may experience dynamic topology changes in the mid of execution. In this paper, we report recent results on developing snapshot algorithms for MANETs.
This research was supported by the Direct Grant of The Chinese University of Hong Kong (project code: 2050424).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Vaidya, N.: Mobile Ad Hoc Networks: Routing, MAC, and Transport Issues. In: IEEE INFOCOM 2006 Tutorials (2006)
Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems 3(1), 63–75 (1985)
McDowell, C.E., Helmbold, D.P.: Debugging concurrent programs. ACM Comput. Surv. 21(4), 593–622 (1989)
Chandy, K.M., Misra, J., Haas, L.: Distributed Deadlock Detection. ACM Transactions on Computer Systems 1(2), 144–156 (1983)
Mattern, F.: Algorithms for Distributed Termination Detection. Distributed Computing 2, 161–175 (1987)
Misra, J.: Detecting Termination of Distributed Computation Using Markers. In: PODC, pp. 290–294 (1983)
Mattern, F.: Efficient algorithms for distributed snapshots and global virtual time approximation. Journal of Parallel and Distributed Computing 18(4), 423–434 (1993)
Alagar, A., Venkatesan, S.: An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering. Information Processing Letters 50, 311–316 (1994)
Lai, T.H., Yang, T.H.: On distributed snapshots. Information Processing Letters 25(3), 153–158 (1987)
Law, C.H., Wong, M.H.: Distributed snapshot for ad-hoc network systems. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2004), Las Vegas, Nevada, USA, pp. 1124–1130 (June 2004)
Wu, D., Cheong, C.H., Wong, M.H.: A Snapshot Algorithm for Mobile Ad Hoc Networks, Technical Report (January 2009), http://www.cse.cuhk.edu.hk/~dwu1/papers/snapshot09.pdf
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
Kshemkalyani, A.D., Raynal, M., Singhal, M.: An Introduction to Snapshot Algorithms in Distributed Computing. Distributed Systems Eng. J. 2(4), 224–233 (1995)
Mattern, F.: Virtual time and global states of distributed systems. In: Parallel and Distributed Algorithms, pp. 215–226 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, D., Cheong, C.H., Wong, M.H. (2009). A Snapshot Algorithm for Mobile Ad Hoc Networks. In: Omatu, S., et al. Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02481-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-02481-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02480-1
Online ISBN: 978-3-642-02481-8
eBook Packages: Computer ScienceComputer Science (R0)