Performance Comparison of Two Retransmission Control Schemes for Slow-Frequency-Hopped Communication Systems (Special Section on Spread Spectrum Techniques and Applications)
スポンサーリンク
概要
- 論文の詳細を見る
This letter proposes a new retransmission control scheme for slow-frequency-hopped communication systems, in which the number of (re) transmitted packets is adaptively decreased in a certain period. Performance of the proposed scheme is analyzed and compared with that of the conventional scheme in terms of the normalized throughput and the 98% packet transmission delay. The numerical results show the superiority of the proposed scheme.
- 社団法人電子情報通信学会の論文
- 1998-11-25
著者
-
Sakakibara Katsumi
Faculty Of Computer Science & System Engineering Okayama Prefectural University
-
YUBA Yoshiharu
Faculty of Computer Science & System Engineering, Okayama Prefectural University
-
MOTONAGA Kazushi
Faculty of Computer Science & System Engineering, Okayama Prefectural University
-
Motonaga Kazushi
Faculty Of Computer Science & System Engineering Okayama Prefectural University
関連論文
- Analysis of Unsaturation Performance of IEEE 802.11 DCF with and without Slow Contention Window Decrease(Communication Theory, Information Theory and Its Applications)
- Combinatorial Effects of Timer Control and Backoff Algorithms on Bulk Data Transfer over Two-State Markovian Channels(Fundamental Theories)
- Combinatorial Effects of Timer Control and Backoff Algorithms on Bulk Data Transfer over Two-State Markovian Channels
- On the Stability of Five Types of Slotted ALOHA Systems with Capture and Multiple Packet Reception (Special Section on Information Theory and Its Applications)
- Performance Comparison of Two Retransmission Control Schemes for Slow-Frequency-Hopped Communication Systems (Special Section on Spread Spectrum Techniques and Applications)
- On the Unequal Error Protection Capability of a q-Ary Image 0f a L0W-Rate q^m-Ary Cyclic Code (Special Section on Information Theory and Its Applications)
- On Optimal and Proper Binary Codes from Irreducible Cyclic Codes over GF(2^m) (Special Section on Information Theory and Its Applications)