Analyzing a distributed slot assignment protocol by Markov chains

Authors

R. Mathar, A. Mann,

Abstract

        Packet radio networks must be able to handle rapid changes in connectivity, e.g. for a continuous data exchange in inter-car communication. In a concurrent slot assignment protocol this is achieved by random access to time synchronized frames and exchange of individual channel observation by each of the involved stations. An important question is how fast this synchronization tool works. We investigate its performance by analyzing the (random) first stable time in a Markov chain model. Numerical results for a variety of parameters are given.

BibTEX Reference Entry 

@inproceedings{MaMa92,
	author = {Rudolf Mathar and Andreas Mann},
	title = "Analyzing a distributed slot assignment protocol by {M}arkov chains",
	pages = "715-720",
	booktitle = "{IEEE} 42nd VTC",
	address = {Denver},
	year = 1992,
	}

Downloads

 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.