Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimization of a Finite Frequency-Hopping Ad Hoc Network in Nakagami Fading (1207.4083v3)

Published 17 Jul 2012 in cs.IT and math.IT

Abstract: This paper considers the analysis and optimization of a frequency-hopping ad hoc network with a finite number of mobiles and finite spatial extent. The mobiles communicate using coded continuous-phase frequency-shift keying (CPFSK) modulation. The performance of the system is a function of the number of hopping channels, the rate of the error-correction code, and the modulation index used by the CPFSK modulation. For a given channel model and density of mobiles, these parameters are jointly optimized by maximizing the (modulation-constrained) transmission capacity, which is a measure of the spatial spectral efficiency of the system. The transmission capacity of the finite network is found by using a recent expression for the spatially averaged outage probability in the presence of Nakagami fading, which is found in closed form in the absence of shadowing and can be solved using numerical integration in the presence of shadowing.

Citations (4)

Summary

We haven't generated a summary for this paper yet.