A calculus for mobile ad hoc networks

  • Authors:
  • Jens Chr. Godskesen

  • Affiliations:
  • IT University of Copenhagen, Copenhagen S, Denmark

  • Venue:
  • COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.