Pith. sign in

REVIEW

Optimization of UAV Heading for the Ground-to-Air Uplink

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1107.0078 v3 pith:PSOSS5GF submitted 2011-06-30 cs.IT math.IT

Optimization of UAV Heading for the Ground-to-Air Uplink

classification cs.IT math.IT
keywords groundheadingnodesrateuplinkalgorithmboundchannel
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper we consider a collection of single-antenna ground nodes communicating with a multi-antenna unmanned aerial vehicle (UAV) over a multiple-access ground-to-air wireless communications link. The UAV uses beamforming to mitigate the inter-user interference and achieve spatial division multiple access (SDMA). First, we consider a simple scenario with two static ground nodes and analytically investigate the effect of the UAV heading on the system sum rate. We then study a more general setting with multiple mobile ground-based terminals, and develop an algorithm for dynamically adjusting the UAV heading in order to maximize a lower bound on the ergodic sum rate of the uplink channel, using a Kalman filter to track the positions of the mobile ground nodes. Fairness among the users can be guaranteed through weighting the bound for each user's ergodic rate with a factor inversely proportional to their average data rate. For the common scenario where a high $K$-factor channel exists between the ground nodes and UAV, we use an asymptotic analysis to find simplified versions of the algorithm for low and high SNR. We present simulation results that demonstrate the benefits of adapting the UAV heading in order to optimize the uplink communications performance. The simulation results also show that the simplified algorithms perform near-optimal performance.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.