Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-06T14:40:19.314Z Has data issue: false hasContentIssue false

The Offset Problem

Published online by Cambridge University Press:  01 June 1997

LENORE COWEN
Affiliation:
Department of Mathematical Sciences, Johns Hopkins University, Baltimore, MD 21218, USA (e-mail: cowen@mts.jhu.edu)
RUDOLPH MATHAR
Affiliation:
Department of Stochastics, Aachen University of Technology, D-52056 Aachen, Germany (e-mail: mathar@stochastik.rwth_aachen.de)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 areas, or over mobile networks. In the case of two locally coordinated groups of 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.

Information

Type
Research Article
Copyright
1997 Cambridge University Press