Throughput analysis of channel load sense multiple access with overload detection protocol in spread spectrum packet radio networks

1991 ◽  
Vol 27 (20) ◽  
pp. 1809 ◽  
Author(s):  
D.M. Lim ◽  
H.S. Lee
1996 ◽  
Vol 06 (05) ◽  
pp. 453-474
Author(s):  
KHAIRI ASHOUR MOHAMED ◽  
LÁSZLÓ PAP

This paper is concerned with the performance analysis of unslotted frequency-hopped spread spectrum packet radio networks with Reed-Solomon forward error control coding. The following different network alternatives are analyzed in a unified manner (i) random/one-coincidence frequency hopping patterns, (ii) one/several code symbols per dwell interval, (iii) independent/dependent packet arrival processes, (iv) fixed/variable length packets. Joint probability generating functions for the pair-wise hit patterns and the effective multiple-access interference vector are determined for the different alternatives. Closed form formulae and expressions for packet capture probabilities are readily obtained from these generating functions. A direct proof is given that in the case of single symbol/dwell packets symbol errors, are asymptotically independent. Numerical results indicate that the unslotted networks outperform the corresponding slotted ones at low to moderate traffic levels, and the difference between the two networks is diminishing when the number of frequency bins is large.


1996 ◽  
Vol 06 (05) ◽  
pp. 435-452
Author(s):  
KHAIRI ASHOUR MOHAMED ◽  
LÁSZLÓ PAP

This paper is concerned with the performance analysis of slotted frequency-hopped packet radio networks with Reed-Solomon forward error control coding. Both random and one coincidence frequency hopping patterns are considered. A new concept of the pair-wise hit patterns and the effective multiple-access interference are introduced. The joint probability generating functions of these interference vectors are determined for both synchronous and asynchronous hopping. Closed form expressions for packet capture probabilities and throughput are derived in terms of these joint generating functions. Finally a direct proof is given that hits in different symbols are asymptotically independent.


Sign in / Sign up

Export Citation Format

Share Document