Abstract.
A distributed dynamic channel allocation algorithm has been proposed in [11]. In this paper the algorithm is modelled using predicate/transition nets. The same model can be used for any number of cell and channel configurations. The Maria reachability analyser has been used to analyse the protocol for some configurations. These are deadlock-free and are shown to satisfy the requirement that the same channel is never allocated to two neighbouring cells. The suitability of high-level nets for the modelling and analysis of distributed algorithms is discussed.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Published online: 24 August 2001
Rights and permissions
About this article
Cite this article
Ojala, L., Husberg, N. & Tynjälä, T. Modelling and analysing a distributed dynamic channel allocation algorithm for mobile computing using high-level net methods. STTT 3, 382–393 (2001). https://doi.org/10.1007/s100090100057
Issue Date:
DOI: https://doi.org/10.1007/s100090100057