Simulative evaluation of a decentralized packet synchronization algorithm for short range mobile radio networks

Hoff et al. (Proc. IEEE Vehic. Techn. Conf., 1991) presented the transmit majority synchronization (TMS) algorithm for decentralized mobile radio networks. A first scenario was analyzed, and early simulation results were given. Detailed simulation results of TMS are presented with a comparison to a...

Full description

Saved in:
Bibliographic Details
Published inIEEE Globecom, 1992 pp. 1349 - 1353 vol.3
Main Authors Hubner, D., Hoff, S.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1992
Subjects
Access protocols
Analytical models
Base stations
Computational modeling
Computer science
Computer simulation
Frequency synchronization
Land mobile radio
Size measurement
Velocity measurement
Online AccessGet full text
ISBN9780780306080
0780306082
DOI10.1109/GLOCOM.1992.276611

Cover

More Information
Summary:Hoff et al. (Proc. IEEE Vehic. Techn. Conf., 1991) presented the transmit majority synchronization (TMS) algorithm for decentralized mobile radio networks. A first scenario was analyzed, and early simulation results were given. Detailed simulation results of TMS are presented with a comparison to a simple reference protocol called last received synchronization (LRS). A different performance measure, the synchronization time of two unsynchronized groups, is evaluated for different group sizes and vehicle speeds. TMS shows a good performance in any case. Looking at realistic group sizes and group ranges TMS needs fewer than three frames to synchronize the two groups completely. LRS is a trivial algorithm, which does not need any overhead. Nevertheless, the performance is worse than that of TMS. The synchronization time of LRS is 2 to 6 times larger than with TMS.< >
ISBN:9780780306080
0780306082
DOI:10.1109/GLOCOM.1992.276611