Collision resolution algorithms in multistation packet-radio networks

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 1989-12, Vol.37 (12), p.1387-1391
Main Authors: Bar-David, A., Sidi, M.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Analytical models
Applied sciences
Computational modeling
Exact sciences and technology
Interference
Performance analysis
Radiocommunication specific techniques
Radiocommunications
Telecommunications
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:0090-6778
1558-0857
DOI:10.1109/26.44212