
Accession Number : ADA182865
Title : Bounds and Asymptotic Results for the Performance of Asynchronous FrequencyHop Packet Radio Networks.
Descriptive Note : Technical rept.,
Corporate Author : ILLINOIS UNIV AT URBANA COORDINATED SCIENCE LAB
Personal Author(s) : Madhow,Upamanyu
Report Date : JUN 1987
Pagination or Media Count : 98
Abstract : This research is concerned with the throughput performance of fully connected asynchronous frequencyhop packet radio networks. The performance of such networks depends on several factors, but the emphasis in this study is on the effect of the multipleaccess interference on system performance. It is assumed, therefore, that there is no other interference on the channel and that perfect side information is available. The frequency hop channel is thus modeled as an erasuresonly channel, and bounded distance erasuresonly decoding is used. Using the above model, bounds on the error probability are developed, which yield corresponding bounds on the throughput. These bounds are shown to be asymptotically tight at high traffic levels for networks with an infinite population and Poisson traffic. The performance of the unslotted network considered is seen to be asymptotically the same as that of an equivalent slotted network for high traffic levels. It is also shown that the capacity of the channel can be attained using ReedSolomon coding. These results are valid for both fixed and exponentially distributed packet lengths (the two most commonly used models). For networks with a finite population, bounds on the performance are derived for systems with binomial traffic and fixedlength packets. A more complicated analysis is required for Poisson traffic, since the effect of queuing of packets at each terminal is considered. Bounds and approximations on the throughput are developed for fixed and exponentially distributed packet lengths, and some representative numerical results are presented.
Descriptors : *COMMUNICATIONS NETWORKS, *RADIO EQUIPMENT, *FREQUENCY AGILITY, *ELECTRONIC SWITCHING, APPROXIMATION(MATHEMATICS), THROUGHPUT, CAPACITY(QUANTITY), CHANNELS, ERRORS, PROBABILITY, TRAFFIC, INTERFERENCE, NUMERICAL ANALYSIS, BINOMIALS, NETWORKS, SLOTS, POPULATION, MULTIPLE ACCESS, POISSON DENSITY FUNCTIONS, SPREAD SPECTRUM, COMMUNICATIONS TRAFFIC, ASYNCHRONOUS SYSTEMS, RADIOFREQUENCY INTERFERENCE, PACKETS, QUEUEING THEORY
Subject Categories : Radio Communications
Distribution Statement : APPROVED FOR PUBLIC RELEASE