Collision resolution algorithms in multistation packet-radio networks

Author

Bar-David, Ayal ; Sidi, Moshe

Author_Institution

QUALCOMM, San Diego, CA, USA

Volume

37

Issue

12

fYear

1989

fDate

12/1/1989 12:00:00 AM

Firstpage

1387

Lastpage

1391

Abstract

The performance of a multistation packet-radio network in which the nodes of the network employ some collision resolution algorithm (CRA) for accessing a shared radio channel is analyzed. The two CRAs considered here are the binary-tree CRA (BTCRA) and the clipped binary-tree CRA (CBTCRA). The exact analysis of a multistation network with these access schemes is intractable. Therefore, the authors present an approximate method that captures the interactions among the nodes of different stations. The mean idea is to view the interference among the nodes of different stations as independent random noises and compute the probabilities of these noises, taking into account the interactions between the nodes. Numerical results of the approximate analysis are presented and compared with the results of simulations

Keywords

multi-access systems; packet switching; protocols; radio networks; access schemes; approximate analysis; binary-tree; clipped binary-tree; collision resolution algorithm; multiple access; multistation packet-radio networks; protocols; random noises; simulations; Access protocols; Algorithm design and analysis; Analytical models; Bandwidth; Computational modeling; Error probability; Fading; Filters; Gaussian noise; Intelligent networks; Interference; Performance analysis; Rician channels; Working environment noise;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.44212

Filename

44212