SearcharxivSearch

arXiv subjects

Abbas Yongacoglu

Publications and source records attributed to Abbas Yongacoglu.

At least 19 recordsLinked to original sources

RL-Based Cargo-UAV Trajectory Planning and Cell Association for Minimum Handoffs, Disconnectivity, and Energy Consumption

Unmanned aerial vehicle (UAV) is a promising technology for last-mile cargo delivery. However, the limited on-board battery capacity, cellular unreliability, and frequent handoffs in the airspace are the main obstacles to unleash its full potential. Given that existing cellular networks were primarily designed to service ground users, re-utilizing the same architecture for highly mobile aerial users, e.g., cargo-UAVs, is deemed challenging. Indeed, to ensure a safe delivery using cargo-UAVs, it is crucial to utilize the available energy efficiently, while guaranteeing reliable connectivity for command-and-control and avoiding frequent handoff. To achieve this goal, we propose a novel approach for joint cargo-UAV trajectory planning and cell association. Specifically, we formulate the cargo-UAV mission as a multi-objective problem aiming to 1) minimize energy consumption, 2) reduce handoff events, and 3) guarantee cellular reliability along the trajectory. We leverage reinforcement learning (RL) to jointly optimize the cargo-UAV's trajectory and cell association. Simulation results demonstrate a performance improvement of our proposed method, in terms of handoffs, disconnectivity, and energy consumption, compared to benchmarks.

eess.SY

Resource-Efficient HAPS-RIS Enabled Beyond-Cell Communications

In the future, urban regions will encounter a massive number of capacity-hungry devices. Relying solely on terrestrial networks for serving all UEs will be a cost-ineffective approach. Consequently, with the anticipated supply and demand mismatch, several UEs will be unsupported. To offer service to the left-out UEs, we employ an energy-efficient and cost-effective beyond-cell communications approach, which uses reconfigurable intelligent surfaces (RIS) on a high-altitude platform station (HAPS). Particularly, unsupported UEs will be connected to a dedicated control station (CS) through RIS-mounted HAPS. A novel resource-efficient optimization problem is formulated that maximizes the number of connected UEs, while minimizing the total power consumed by the CS and RIS. Since the resulting problem is a mixed-integer nonlinear program (MINLP), a low-complexity two-stage algorithm is developed. Numerical results demonstrate that the proposed algorithm outperforms the benchmark approach in terms of the percentage of connected UEs and the resource-efficiency (RE). Also, the results show that the number of connected UEs is more sensitive to transmit power at the CS than the HAPS size.

eess.SY

iTUAVs: Intermittently Tethered UAVs for Future Wireless Networks

We propose the intermittently tethered unmanned aerial vehicle (iTUAV) as a tradeoff between the power availability of a tethered UAV (TUAV) and the flexibility of an untethered UAV. An iTUAV can provide cellular connectivity while being temporarily tethered to the most adequate ground anchor. Also, it can flexibly detach from one anchor, travel, then attach to another one to maintain/improve the coverage quality for mobile users. Hence, we discuss here the existing UAV-based cellular networking technologies, followed by a detailed description of the iTUAV system, its components, and mode of operation. Subsequently, we present a comparative study of the existing and proposed systems highlighting the differences in key features such as mobility and energy. To emphasize the potential of iTUAV systems, we conduct a case study, evaluate the iTUAV performance, and compare it to benchmarks. Obtained results show that with only 10 anchors in the area, the iTUAV system can serve up to 90% of the users covered by the untethered UAV swapping system. Moreover, results from a small case study prove that the iTUAV allows to balance performance/cost and can be implemented realistically. For instance, when user locations are clustered, with only 2 active iTUAVs and 4 anchors, achieved performance is superior to that of the system with 3 TUAVs, while when considering a single UAV on a 100 minutes event, a system with only 6 anchors outperforms the untethered UAV as it combines location flexibility with increased mission time.

cs.NI

Beyond-Cell Communications via HAPS-RIS

The ever-increasing number of users and new services in urban regions can lead terrestrial base stations (BSs) to become overloaded and, consequently, some users to go unserved. Compounding this, users in urban areas can face severe shadowing and blockages, which means that some users do not receive a desired quality of service (QoS). Motivated by the energy and cost benefits of reconfigurable intelligent surfaces (RIS) and the advantages of high altitude platform stations (HAPS), including their wide footprint and strong line-of-sight (LoS) links, we propose a solution to service the stranded users using the RISaided HAPS. More specifically, we propose to service the stranded users by a dedicated control station (CS) via a HAPS equipped with RIS (HAPS-RIS). Through this approach, users are not restricted from being serviced by the cell they belong to; hence, we refer to this approach as beyond-cell communication. As we demonstrate in this paper, beyond-cell communication works in tandem with legacy terrestrial networks to support uncovered or unserved users. Optimal transmit power and RIS unit assignment strategies for the users based on different network objectives are introduced. Numerical results demonstrate the benefits of the proposed beyond-cell communication approach. Moreover, the results provide insights into the different optimization objectives and their interplay with minimum quality-of-service (QoS) and network resources, such as transmit power and the number of reflectors.

cs.IT

Disconnectivity-Aware Energy-Efficient Cargo-UAV Trajectory Planning with Minimum Handoffs

On-board battery consumption, cellular disconnectivity, and frequent handoff are key challenges for unmanned aerial vehicle (UAV) based delivery missions, a.k.a., cargo-UAV. Indeed, with the introduction of UAV technology into cargo shipping and logistics, designing energy-efficient paths becomes a serious issue for the next retail industry transformation. Typically, the latter has to guarantee uninterrupted or slightly interrupted cellular connectivity for the UAV's command and control through a small number of handoffs. In this paper, we formulate the trajectory planning as a multi-objective problem aiming to minimize both the UAV's energy consumption and the handoff rate, constrained by the UAV battery size and disconnectivity rate. Due to the problem's complexity, we propose a dynamic programming based solution. Through simulations, we demonstrate the efficiency of our approach in providing optimized UAV trajectories. Also, the impact of several parameters, such as the cargo-UAV altitude, disconnectivity rate, and type of environment, are investigated. The obtained results allow to draw recommendations and guidelines for cargo-UAV operations.

eess.SY

3D Aerial Highway: The Key Enabler of the Retail Industry Transformation

The retail industry is already facing an inevitable transformation worldwide, and with the current pandemic situation, it is even accelerating. Indeed, consumer habits are shifting from brick-and-mortar stores to online shopping. The bottleneck in the end-to-end online shopping experience remains the efficient and quick delivery of goods to consumers. In this context, unmanned aerial vehicle (UAV) technology is seen as a potential solution to address cargo delivery issues. Hence, the number of cargo-UAVs is expected to skyrocket in the next few decades and the airspace to become densely crowded. To successfully deploy UAVs for mass cargo delivery, seamless and reliable cellular connectivity for highly mobile UAVs is required. There is an urgent need for organized and connected routes in the sky. Like highways for cargo trucks, 3D routes in the airspace should be designed for cargo-UAVs to fulfill their operations safely and efficiently. We refer to these routes as 3D aerial highway. In this paper, we thoroughly investigate the feasibility of the aerial highways paradigm. First, we discuss the motivations and concerns of the aerial highway paradigm. Then, we present our vision of the 3D aerial highway framework. Finally, we present related connectivity issues and their potential solutions.

eess.SP

A Vision and Framework for the High Altitude Platform Station (HAPS) Networks of the Future

A High Altitude Platform Station (HAPS) is a network node that operates in the stratosphere at an of altitude around 20 km and is instrumental for providing communication services. Precipitated by technological innovations in the areas of autonomous avionics, array antennas, solar panel efficiency levels, and battery energy densities, and fueled by flourishing industry ecosystems, the HAPS has emerged as an indispensable component of next-generations of wireless networks. In this article, we provide a vision and framework for the HAPS networks of the future supported by a comprehensive and state-of-the-art literature review. We highlight the unrealized potential of HAPS systems and elaborate on their unique ability to serve metropolitan areas. The latest advancements and promising technologies in the HAPS energy and payload systems are discussed. The integration of the emerging Reconfigurable Smart Surface (RSS) technology in the communications payload of HAPS systems for providing a cost-effective deployment is proposed. A detailed overview of the radio resource management in HAPS systems is presented along with synergistic physical layer techniques, including Faster-Than-Nyquist (FTN) signaling. Numerous aspects of handoff management in HAPS systems are described. The notable contributions of Artificial Intelligence (AI) in HAPS, including machine learning in the design, topology management, handoff, and resource allocation aspects are emphasized. The extensive overview of the literature we provide is crucial for substantiating our vision that depicts the expected deployment opportunities and challenges in the next 10 years (next-generation networks), as well as in the subsequent 10 years (next-next-generation networks).

cs.IT

Downlink Coverage and Rate Analysis of an Aerial User in Vertical Heterogeneous Networks (VHetNets)

In this paper, we analyze the downlink coverage probability and rate of an aerial user in vertical HetNets (VHetNets) comprising aerial base stations (aerial-BSs) and terrestrial-BSs. The locations of terrestrial-BSs are modeled as an infinite 2-D Poisson Point Process (PPP), while the locations of aerial-BSs are modeled as a finite 2-D Binomial Point Process (BPP). Our cellular-to-air (C2A) channel model incorporates line-of-sight (LoS) and non-LoS transmissions between terrestrial-BSs and a typical aerial user, while we assume LoS transmissions for all aerial links. We assume that the aerial user is associated with an aerial-BS or terrestrial-BS that provides the strongest average received power. Using stochastic geometry, we derive exact and approximate expressions of the coverage probability and rate in terms of interference power's Laplace transform. The expressions are simplified assuming only LoS transmissions for the C2A channels. This enables easy-to-compute equations with good accuracy at elevated aerial user heights. We find that aerial users hovering at low altitudes tend to connect to aerial-BSs in denser terrestrial environments. Employing directive beamforming at aerial-BSs guarantees an acceptable performance at the aerial user by reducing interference signals received from the aerial-BSs. In denser terrestrial networks, the performance at the aerial user degrades substantially despite beamforming.

eess.SP

On the Optimal 3D Placement of a UAV Base Station for Maximal Coverage of UAV Users

Unmanned aerial vehicles (UAVs) can be users that support new applications, or be communication access points that serve terrestrial and/or aerial users. In this paper, we focus on the connectivity problem of aerial users when they are exclusively served by aerial base stations (BS), i.e., UAVBSs. Specifically, the 3D placement problem of a directional antenna equipped UAV-BS, aiming to maximize the number of covered aerial users under a spectrum sharing policy with terrestrial networks, is investigated. Given a known spectrum sharing policy between the aerial and terrestrial networks, we propose a 3D placement algorithm that achieves optimality. Simulation results show the performance of our approach, in terms of number of covered aerial users, for different configurations and parameters, such as the spectrum sharing policy, antenna beamwidth, transmit power, and aerial users density. These results represent novel guidelines for exclusive aerial networks deployment and applications, distinctively for orthogonal and non-orthogonal spectrum sharing policies with terrestrial networks.

eess.SP

Wireless Networks with Cache-Enabled and Backhaul-Limited Aerial Base Stations

Use of aerial base stations (ABSs) is a promising approach to enhance the agility and flexibility of future wireless networks. ABSs can improve the coverage and/or capacity of a network by moving supply towards demand. Deploying ABSs in a network presents several challenges such as finding an efficient 3D-placement of ABSs that takes network objectives into account. Another challenge is the limited wireless backhaul capacity of ABSs and consequently, potentially higher latency incurred. Content caching is proposed to alleviate the backhaul congestion and decrease the latency. We consider a limited backhaul capacity for ABSs due to varying position-dependent path loss values and define two groups of users (delay-tolerant and delay-sensitive) with different data rate requirements. We study the problem of jointly determining backhaul-aware 3D placement for ABSs, user-BS associations and corresponding bandwidth allocations while minimizing total downlink transmit power. Proposed iterative algorithm applies a decomposition method. First, the 3D locations of ABSs are found using semi-definite relaxation and coordinate descent methods, and then user-BS associations and bandwidth allocations are optimized. The simulation results demonstrate the effectiveness of the proposed algorithm and provide insights about the impact of traffic distribution and content caching on transmit power and backhaul usage of ABSs.

cs.NI

Optimal Location of Cellular Base Station via Convex Optimization

An optimal base station (BS) location depends on the traffic (user) distribution, propagation pathloss and many system parameters, which renders its analytical study difficult so that numerical algorithms are widely used instead. In this paper, the problem is studied analytically. First, it is formulated as a convex optimization problem to minimize the total BS transmit power subject to quality-of-service (QoS) constraints, which also account for fairness among users. Due to its convex nature, Karush-Kuhn-Tucker (KKT) conditions are used to characterize a globally-optimum location as a convex combination of user locations, where convex weights depend on user parameters, pathloss exponent and overall geometry of the problem. Based on this characterization, a number of closed-form solutions are obtained. In particular, the optimum BS location is the mean of user locations in the case of free-space propagation and identical user parameters. If the user set is symmetric (as defined in the paper), the optimal BS location is independent of pathloss exponent, which is not the case in general. The analytical results show the impact of propagation conditions as well as system and user parameters on optimal BS location and can be used to develop design guidelines.

cs.IT

Multi-UAV Data Collection Framework for Wireless Sensor Networks

In this paper, we propose a framework design for wireless sensor networks based on multiple unmanned aerial vehicles (UAVs). Specifically, we aim to minimize deployment and operational costs, with respect to budget and power constraints. To this end, we first optimize the number and locations of cluster heads (CHs) guaranteeing data collection from all sensors. Then, to minimize the data collection flight time, we optimize the number and trajectories of UAVs. Accordingly, we distinguish two trajectory approaches: 1) where a UAV hovers exactly above the visited CH; and 2) where a UAV hovers within a range of the CH. The results of this include guidelines for data collection design. The characteristics of sensor nodes' K-means clustering are then discussed. Next, we illustrate the performance of optimal and heuristic solutions for trajectory planning. The genetic algorithm is shown to be near-optimal with only $3.5\%$ degradation. The impacts of the trajectory approach, environment, and UAVs' altitude are investigated. Finally, fairness of UAVs trajectories is discussed.

eess.SP

On the Number and 3D Placement of Drone Base Stations in Wireless Cellular Networks

Using drone base stations (drone-BSs) in wireless networks has started attracting attention. Drone-BSs can assist the ground BSs in both capacity and coverage enhancement. One of the important problems about integrating drone-BSs to cellular networks is the management of their placement to satisfy the dynamic system requirements. In this paper, we propose a method to find the positions of drone-BSs in an area with different user densities using a heuristic algorithm. The goal is to find the minimum number of drone-BSs and their 3D placement so that all the users are served. Our simulation results show that the proposed approach can satisfy the quality-of-service requirements of the network.

cs.NI

Efficient 3D Aerial Base Station Placement Considering Users Mobility by Reinforcement Learning

This paper considers an aerial base station (aerial-BS) assisted terrestrial network where user mobility is taken into account. User movement changes the network dynamically which may result in performance loss. To avoid this loss, guarantee a minimum quality-of-service (QoS) and possibly increase the QoS, we add an aerial-BS to the network. For a fair comparison between the conventional terrestrial network and the aerial-BS assisted one, we keep the total number of BSs identical in both networks. Obtaining the best performance in such networks highly depends on the optimal placement of the aerial-BS. To this end, an algorithm which can rely on general and realistic assumptions and can decide where to go based on the past experiences is required. The proposed approach for this goal is based on a discounted reward reinforcement learning which is known as Q-learning. Simulation results show this method provides an effective placement strategy which increases the QoS of wireless networks when it is needed and promises to find the optimum position of the aerial-BS in discrete environments.

cs.NI

User Association and Bandwidth Allocation for Terrestrial and Aerial Base Stations with Backhaul Considerations

Drone base stations (DBSs) can enhance network coverage and area capacity by moving supply towards demand when required. This degree of freedom could be especially useful for future applications with extreme demands, such as ultra reliable and low latency communications (uRLLC). However, deployment of DBSs can face several challenges. One issue is finding the 3D placement of such BSs to satisfy dynamic requirements of the system. Second, the availability of reliable wireless backhaul links and the related resource allocation are principal issues that should be considered. Finally, association of the users with BSs becomes an involved problem due to mobility of DBSs. In this paper, we consider a macro-BS (MBS) and several DBSs that rely on the wireless links to the MBS for backhauling. Considering regular and uRLLC users, we propose an algorithm to find efficient 3D locations of DBSs in addition to the user-BS associations and wireless backhaul bandwidth allocations to maximize the sum logarithmic rate of the users. To this end, a decomposition method is employed to first find the user-BS association and bandwidth allocations. Then DBS locations are updated using a heuristic particle swarm optimization algorithm. Simulation results show the effectiveness of the proposed method and provide useful insights on the effects of traffic distributions and antenna beamwidth.

cs.NI

Backhaul-aware Robust 3D Drone Placement in 5G+ Wireless Networks

Using drones as flying base stations is a promising approach to enhance the network coverage and area capacity by moving supply towards demand when required. However deployment of such base stations can face some restrictions that need to be considered. One of the limitations in drone base stations (drone-BSs) deployment is the availability of reliable wireless backhaul link. This paper investigates how different types of wireless backhaul offering various data rates would affect the number of served users. Two approaches, namely, network-centric and user-centric, are introduced and the optimal 3D backhaul-aware placement of a drone-BS is found for each approach. To this end, the total number of served users and sum-rates are maximized in the network-centric and user-centric frameworks, respectively. Moreover, as it is preferred to decrease drone-BS movements to save more on battery and increase flight time and to reduce the channel variations, the robustness of the network is examined as how sensitive it is with respect to the users displacements.

cs.NI

On Holant Theorem and Its Proof

Holographic algorithms are a recent breakthrough in computer science and has found applications in information theory. This paper provides a proof to the central component of holographic algorithms, namely, the Holant theorem. Compared with previous works, the proof appears simpler and more direct. Along the proof, we also develop a mathematical tool, which we call c-tensor. We expect the notion of c-tensor may be applicable over a wide range of analysis.

cs.IT

On the k-pairs problem

We consider network coding rates for directed and undirected $k$-pairs networks. For directed networks, meagerness is known to be an upper bound on network coding rates. We show that network coding rate can be $Θ(|V|)$ multiplicative factor smaller than meagerness. For the undirected case, we show some progress in the direction of the $k$-pairs conjecture.

cs.IT