We suggest a Calculus for Mobile Ad Hoc Networks, CMAN. A node in a network is a process equipped with a location, it may communicate with other nodes using synchronous spatially oriented broadcast where only the current neighbors receive the message. Nodes may autonomously change their neighbor relationship and thereby change the network topology. We define a natural reduction semantics and a reduction congruence as well as a labeled transition semantics and prove a weak contextual bisimulation to be a sound and complete co-inductive characterization of the reduction congruence. Finally, we apply CMAN on a small example of a cryptographic routing protocol. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Godskesen, J. C. (2007). A Calculus for Mobile Ad Hoc Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4467 LNCS, pp. 132–150). Springer Verlag. https://doi.org/10.1007/978-3-540-72794-1_8
Mendeley helps you to discover research relevant for your work.