Institute for Theoretical Information Technology

The offset problem

Authors

L. Cowen, R. Mathar,

Abstract

        This paper is concerned with the analysis of locally time-synchronized slot systems for broadcast in packet radio networks. Local synchronization has been proposed in practice as less expensive than global synchronization over very wide area, or over mobile networks. In the case of two locally coordinated stations, under the assumption that the phase shift on the clocks between the two groups is random, it is shown that the probability of no collision is maximized when occupied slots within each group are chosen consecutively, regardless of the number of total slots, or the number of occupied slots in either group.

BibT_EX Reference Entry 

@article{CoMa97,
	author = {Lenore Cowen and Rudolf Mathar},
	title = "The offset problem",
	pages = "159-164",
	journal = "Combinatorics, Probability, and Computing",
	volume = "6",
	year = 1997,
	hsb = RWTH-CONV-223153,
	}

Downloads

 _{Download bibtex-file}

Sorry, this paper is currently not available for download.