A snapshot algorithm for mobile Ad Hoc networks

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wu, D., Cheong, C. H., & Wong, M. H. (2009). A snapshot algorithm for mobile Ad Hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5518 LNCS, pp. 107–115). https://doi.org/10.1007/978-3-642-02481-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free