A Random Access Algorithm for Frequency Hopped Spread Spectrum Packet Radio Networks
Abstract
The authors consider packet radio multi-user spread-spectrum environments, where frequency hopping spread spectrum techniques are deployed for protection against intelligent adversaries. When the users in such environments are mobile and bursty, random access frequency hopping transmission algorithms should be adopted, for efficiency in throughput and delay control. This paper proposes and analyzes such an algorithm, named Collision Resolution Algorithm for Frequency Hopping (CRAFH). The CRAFH is a limited sensing random access algorithm utilizing receiver oriented frequency hopping patterns. In its design, the experience from random access algorithms for non spread spectrum multi-user channels is utilized. Utilizing the regenerative character of the induced by the algorithm transmission process, the authors compute throughputs and expected per packet delays. In the presence of interferences between transmissions to different receivers, we compute throughputs, subject to an upper bound on the probability of erroneous data decoding. The CRAFH induces uniformly good delays within its stability region, and is particularly appropriate for environments where the users are highly mobile.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1986
- Accession Number
- ADA165935
Entities
People
- Michael Georgiopoulos
- P. Papantoni-kazakos
Organizations
- University of Connecticut