Abstract
Busy tone multiple access protocols have been used in multihop networks to reduce the effect of the hidden terminal problem. Due to complexity, the performance of these protocols for large networks has not been analyzed. In this paper, using a Markov chain model and an approximation, we are able to analyze and evaluate the throughput performance of the non-persistent CSMA protocol, the conservative busy tone multiple access (C-BTMA) protocol and the ideal destination-based busy tone multiple access (ID-BTMA) protocol for large networks. The throughput comparison of the protocols is given. The results show that in a large multihop network, the BTMA protocols have a better performance than the non-persistent CSMA protocol and the ID-BTMA protocol has a better performance than the C-BTMA protocol at light channel loads.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 159-177 |
| Number of pages | 19 |
| Journal | Information sciences |
| Volume | 120 |
| Issue number | 1 |
| DOIs | |
| State | Published - Nov 1999 |
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence