Pith. sign in

REVIEW

Sum Capacity Maximization in Multi-Hop Mobile Networks with Flying Base Stations

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 2210.11884 v1 pith:76WTJO4X submitted 2022-10-21 eess.SY cs.SY

classification eess.SYcs.SY
keywords flybsscapacitynetworksbaseconstraintsflyingwellbackhaul
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deployment of multi-hop network of unmanned aerial vehicles (UAVs) acting as flying base stations (FlyBSs) presents a remarkable potential to effectively enhance the performance of wireless networks. Such potential enhancement, however, relies on an efficient positioning of the FlyBSs as well as a management of resources. In this paper, we study the problem of sum capacity maximization in an extended model for mobile networks where multiple FlyBSs are deployed between the ground base station and the users. Due to an inclusion of multiple hops, the existing solutions for two-hop networks cannot be applied due to the incurred backhaul constraints for each hop. To this end, we propose an analytical approach based on an alternating optimization of the FlyBSs' 3D positions as well as the association of the users to the FlyBSs over time. The proposed optimization is provided under practical constraints on the FlyBS's flying speed and altitude as well as the constraints on the achievable capacity at the backhaul link. The proposed solution is of a low complexity and extends the sum capacity by 23%-38% comparing to state-of-the-art solutions.

Discussion (0). Continue with ORCID to comment.

Pith tools