Packet Error Probabilities in Frequency-Hopped Spread Spectrum Packet Radio Networks - Markov Frequency Hopping Patterns Considered.
Abstract
We compute the packet error probability induced in a frequency-hopped spread spectrum packet radio network, which utilizes first order Markov frequency hopping patterns. The frequency spectrum is divided into q frequency bins and the packets are divided into M bytes each. Every user in the network sends each of the M bytes of his packet at a frequency bin, which is different from the frequency bin used by the previous byte, but equally likely to be any one of the remaining q-1 frequency bins (Markov frequency hopping patterns). Furthermore, different users in the network utilize statistically independent frequency hopping patterns. Provided that, K users have simultaneously transmitted their packets on the channel, and a receiver has locked on to one of these K packets, we present a method for the computation of P sub e (K) (i.e. the probability that this packet is incorrectly decoded). Furthermore, we present numerical results (i.e. P sub e (K) versus K) for various values of the multiple access interference K, when Reed Solomon (RS) codes are used for the encoding of packets. Finally, some useful comparisons, with the packet error probability induced, if we assume that the byte errors are independent, are made; based on these comparisons, we can easily evaluate the performance of our spread spectrum system.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 18, 1987
- Accession Number
- ADA186071
Entities
People
- M. Georgiopoulos
- P. Kazakos
Organizations
- University of Virginia