A Timed Calculus for Mobile Ad Hoc Networks

Mengying Wang
Yang Lu

We develop a timed calculus for Mobile Ad Hoc Networks embodying the peculiarities of local broadcast, node mobility and communication interference. We present a Reduction Semantics and a Labelled Transition Semantics and prove the equivalence between them. We then apply our calculus to model and study some MAC-layer protocols with special emphasis on node mobility and communication interference.

A main purpose of the semantics is to describe the various forms of interference while nodes change their locations in the network. Such interference only occurs when a node is simultaneously reached by more than one ongoing transmission over the same channel.

In Peter Csaba Ölveczky and Cyrille Artho: Proceedings First International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS 2012), Kyoto, Japan, November 12, 2012, Electronic Proceedings in Theoretical Computer Science 105, pp. 118–134.
Published: 29th December 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.105.9 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org