Truthful UAV Placement for Secrecy: Median Rules Tuned by Closed-Form Outage Analysis

Suppose a drone acting as a flying base station must pick one hover point along a road, and the users it will serve must say in advance where they will be. Each user wants the drone close by, because a nearer transmitter makes it less likely that a nearby eavesdropper can decode their traffic. Each user also has a reason to lie, since exaggerating one's position pulls the drone toward oneself. Mechanism design without money (choosing an outcome from reported preferences so that no participant gains by lying, with no payments involved) has a clean answer on a line. Pick the median of the reports, or more generally a "generalized median" that mixes in fixed artificial reports called phantoms. Physical layer security (protecting wireless links by exploiting fading and geometry rather than encryption) has its own clean tool. It derives closed-form expressions for the secrecy outage probability, the chance that the legitimate link's capacity advantage over the eavesdropper's falls below a target rate. This note connects the two. The closed-form outage expression tells us exactly what each user's cost looks like as a function of the drone's position. That shape decides both whether median-type rules stay truthful and how much secrecy they give up.

The central observation is that, for standard fading with randomly scattered eavesdroppers, a user's outage probability is S-shaped in her distance to the transmitter. It is convex when she is close and concave when she is far, and it saturates near one. Existing approximation guarantees for truthful location rules cover linear, concave, or convex costs, but not this sigmoid shape. We propose to prove guarantees for sigmoid costs in which the bound depends on a physical quantity: the ratio of the users' spread to the distance at which outage turns from convex to concave, an inflection point that the closed form gives directly. We then use the closed form to optimize phantom positions. This searches over the class of truthful generalized-median rules for the one that minimizes the expected number of users in secrecy outage.

Core Claim

Assume a stationary Poisson point process of eavesdroppers (eavesdroppers scattered at random with uniform density, so their statistics do not depend on where the drone hovers), Rayleigh fading, and path-loss exponent $\alpha$. The secrecy outage of a user at horizontal offset $d$ from a drone at altitude $h$ should then take a Weibull-like form:

$$P_{out}(d) \approx 1 - \exp\!\big(-c\,(d^2+h^2)^{\beta/2}\big),$$

Here $c$ collects eavesdropper density, target secrecy rate $R_s$, and transmit SNR, and $\beta > 1$ is tied to $\alpha$. Deriving the exact expression, including the Rician case, is the first task. This form is our working hypothesis. It is the shape that stochastic-geometry secrecy analyses such as Physical Layer Security for STAR-RIS-NOMA: A Stochastic Geometry Approach produce for spatially random eavesdroppers.

Two consequences follow. First, $P_{out}$ increases with $|x-y|$, where $x$ is the user's true position and $y$ the hover point. Preferences over $y$ are therefore single-peaked, and every generalized median rule is strategyproof regardless of the curve's shape. Second, the curve has an inflection offset $d^\star(c,\beta,h)$ in closed form. We conjecture, and will try to prove, that the approximation ratio of the median for total outage, and of the best deterministic truthful rule for worst-case outage, is controlled by the dimensionless spread $\sigma/d^\star$. The ratio should approach the linear-cost guarantees when users are spread far beyond $d^\star$ and degrade in a quantifiable way when they cluster inside it.

What is new is the pairing itself. The physics supplies the cost shape, the cost shape determines the mechanism's guarantee, and the closed form makes optimizing over all truthful rules computationally feasible.

Relation to Prior Work

The closed-form side supplies our method. Secure Outage Analysis for RIS-Aided MISO Systems with Randomly Located Eavesdroppers and On Secrecy Performance of RIS-Assisted MISO Systems over Rician Channels with Spatially Random Eavesdroppers use Meijer G-functions to reduce spatially random eavesdroppers and fading to exact outage expressions. On the Secrecy of UAV Systems With Linear Trajectory bounds outage for a drone moving along a line. We reuse these techniques. Our goal differs, however: they evaluate a given geometry, while we treat outage as a per-user cost inside an allocation rule. Relay Placement for Physical Layer Security: A Secure Connection Perspective finds the outage-minimizing relay position, near the source–destination midpoint, chosen by an engineer who knows all positions. We drop that omniscience.

Two papers combine secrecy with incentives and motivate the gap. Physical Layer Security Game: Interaction between Source, Eavesdropper, and Friendly Jammer uses a pricing game in which jammers sell power. It relies on money and on instantaneous knowledge of the eavesdropper's channel. Distributed Coalition Formation Games for Secure Wireless Transmission is payment-free but assumes truthful negotiation. Neither offers a truthful rule. Neither uses statistical outage, which is the only option against a passive eavesdropper whose channel cannot be measured.

The mechanism side both supplies and constrains the design. Moulin's median result, surveyed in Mechanism Design for Facility Location Problems: A Survey, and the phantom characterization used in The Capacity Constrained Facility Location Problem define the truthful class we optimize over. Strategyproof facility location for concave cost functions gives the key constraint: bounded randomized guarantees exist for concave costs, while strictly convex costs admit no bounded-ratio truthful mechanism in their multi-facility setting. A sigmoid sits between these two regimes. Our guarantees must therefore depend on which regime the users occupy, and this dependence is the point of the analysis rather than a technicality. Random Rank and the prediction-augmented Harmonic mechanism of Strategic Facility Location via Predictions are alternative truthful or near-truthful designs that we use as baselines.

Research Program

Physics. The first stage derives the per-user outage curve for a hovering drone with eavesdroppers scattered at random. We treat Rayleigh first, then Rician, following the Meijer-G route. We locate the inflection offset $d^\star$ in closed form and check single-peakedness under all parameter settings. One case may break it: if eavesdroppers are not stationary, for example clustered near a building, outage is no longer a function of distance alone. We will identify when single-peakedness fails, because then the median loses its truthfulness guarantee.

Theory. The second stage proves approximation bounds for the median, for social cost (expected number of users in outage), and for the best deterministic truthful rule, for worst-case cost (maximum outage). Both bounds are stated as functions of $\sigma/d^\star$. We expect the linear-cost guarantees (1 for social cost, 2 for maximum cost) to be recovered as $\sigma/d^\star \to \infty$. We also want to establish how the ratio grows as users cluster inside the convex region.

Optimization. The third stage optimizes phantoms. A generalized median with phantoms $p_1,\dots,p_{n+1}$ outputs

$$y = \mathrm{med}(x_1,\dots,x_n,p_1,\dots,p_{n+1}),$$

and it is truthful for any choice of the $p_j$. Given a prior over user positions, we choose the phantoms to minimize $\mathbb{E}\big[\sum_i P_{out}(|x_i-y|)\big]$. Order statistics give the distribution of $y$, and the closed form gives the integrand, so this objective can be evaluated quickly. One caveat applies. Our preference domain, symmetric sigmoids in distance, is narrower than arbitrary single-peaked preferences, so truthful rules outside the generalized-median family might exist. We optimize within that family and flag this as an open question.

Extension. The fourth stage tackles two drones, where deterministic truthful rules are already weak even with linear costs. We test whether an EQUAL COST-style randomization keeps bounded worst-case outage when costs are sigmoid.

Baselines

Fixed hover. The naive reference parks the drone at the center of the road segment, ignoring all reports. It is trivially truthful and shows the value of using reports at all.

Genie-optimal placement. This minimizes total outage using true positions. It is the efficiency ceiling, and every ratio we report is measured against it. We also run it on strategic reports, where agents best-respond until reports stabilize, to show the cost of ignoring incentives.

Plain median (Moulin). This is the strongest existing truthful competitor, and the one most likely to be good enough. The reported guarantee is a 1-approximation for linear social cost, with a deterministic 2-approximation and a randomized 3/2 (Left-Right-Middle) for maximum cost, per Mechanism Design for Facility Location Problems: A Survey. We found no reported result on Lacuna for any truthful rule under secrecy-outage costs, so all outage-cost numbers will be ours.

Random Rank and random dictatorship. Random Rank represents fairness-oriented randomized truthful rules.

Harmonic mechanism. The Harmonic mechanism of Strategic Facility Location via Predictions receives the prior mean as its prediction. It tests whether side information beats exact truthfulness. Its reported consistency is a price of anarchy of $\gamma(1+2c)$, but that bound is for distance costs, not outage.

Fairness of comparison. All rules see the same sampled user configurations, eavesdropper realizations, and channel parameters. The prior used to optimize phantoms is also given to Harmonic as its prediction. Tuning budgets are equal: optimized phantoms and the Harmonic parameter $c$ each get the same number of objective evaluations on held-out configurations.

Ablations. Two ablations isolate the key ingredient. In the first, phantoms are optimized under a linear distance cost and then evaluated under true outage. This isolates whether knowing the sigmoid shape matters. In the second, phantoms are optimized with Monte Carlo outage estimates under the same wall-clock budget. This isolates whether the closed form matters computationally or only for convenience.

What beating the baselines means. The proposal succeeds if optimized phantoms reduce expected users in outage relative to the plain median by a margin larger than Monte Carlo error, under the same prior. It must also beat the linear-cost phantoms. Otherwise the physics is not what is doing the work.

Why not just…?

Why not just use the plain median? This is a real threat. If users are spread well beyond $d^\star$, sigmoid costs behave almost like saturated step functions, and the median may already be near-optimal. The phantom-optimization experiment settles this directly. If the gain over the median stays within a few percent across all regimes of $\sigma/d^\star$, we will report that. The contribution then narrows to the theory explaining why the median is enough, which is still a usable design rule for operators.

Why not just measure user positions instead of asking? If positions can be measured at decision time, incentive compatibility is unnecessary, and we concede this. Our setting is the one where the hover point must be committed before users arrive, for flight planning and battery budgeting, so the drone can only rely on declared intentions. We will also run a variant where the drone measures positions with localization noise. That variant marks how noisy measurement must be before truthful elicitation wins.

Why not just pay users, as in pricing games? Physical Layer Security Game shows such schemes need iterative price exchange and instantaneous eavesdropper channels. Neither is available against a passive eavesdropper or in ad-hoc deployments without a clearinghouse. We do not claim payments are worse where they are feasible. We study the regime where they are not.

Why not just optimize placement on whatever users report? A mean-like or genie optimizer invites exaggeration, as the survey's facility-location results show. Our strategic-report run of the genie baseline will quantify this. It will measure how far equilibrium placement drifts and how much total outage rises compared with truthful rules.

Proposed Experiments

Setup. Simulations place users on a road segment under uniform, bimodal, and tightly clustered priors. Eavesdroppers are scattered at random over a range of densities. We vary path-loss exponent $\alpha \in \{2,3,4\}$, since Relay Placement for Physical Layer Security reports that at $\alpha=2$ relaying gives no benefit over direct transmission. Drone altitude and target secrecy rate are also varied, and fading is Rayleigh or Rician. No wireless ray-tracing dataset was found on Lacuna, so all channels are synthetic.

Metrics. We report expected number of users in outage, maximum outage, ratio to the genie optimum, and empirical manipulation gain. Manipulation gain is the best unilateral misreport improvement found by grid search, and it should be exactly zero for truthful rules and positive for the others.

Decisive checks. Three checks determine success. First, the closed-form outage curve and its inflection offset must match Monte Carlo within a stated tolerance; the check fails if the Weibull-like hypothesis is wrong. Second, approximation ratios from different $\alpha$, densities, and altitudes should collapse onto a single curve when plotted against $\sigma/d^\star$. That collapse is the core empirical prediction of the theory, and its failure would falsify the claim that $d^\star$ is the controlling quantity. Third, phantoms optimized under the Rayleigh closed form are evaluated under Rician ground truth, to test whether the gain over the plain median survives model misspecification.