Abstract
The busy tone multiple access (BTMA) protocol had been proposed to alleviate the hidden terminal effect in multihop networks. Because the analysis of BTMA networks is complicated, the studies of BTMA networks so far have been carried out only for small or regular networks. For large networks, in which the number of terminals are assume to be infinite and they are distributed as 2-D Poisson point process, Takagi and Kleinrock used an approximate approach to analyze the throughput performance of the CSMA protocols. However, their throughput result is not the long run average value. In this paper, we will extend their analysis and obtain the long run average throughput by the Markov chain model. By adopting the same approximation idea and making use of a Markov chain model, we analyze the performance of the conservative BTMA and idealistic destination-based BTMA protocols in a large network.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory - Proceedings |
| Publisher | IEEE Computer Society |
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw Duration: Jun 27 1994 → Jul 1 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Symposium on Information Theory |
|---|---|
| City | Trodheim, Norw |
| Period | 6/27/94 → 7/1/94 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering