16 May 2022 in IEEE Transactions on Vehicular Technology
This paper studies an unmanned aerial vehicle (UAV)-assisted wireless network, where a UAV is dispatched to gather information from ground sensor nodes (SN) and transfer the collected data to the depot. The information freshness is captured by the age of information (AoI) metric, whilst the energy consumption of the UAV is seen as another performance criterion. Most importantly, the AoI and energy efficiency are inherently competing metrics, since decreasing the AoI requires the UAV returning to the depot more frequently, leading to a higher energy consumption. To this end, we design UAV paths that optimize these two competing metrics jointly and reveal the Pareto frontier. To formulate this problem, a multi-objective mixed integer linear programming (MILP) is proposed with a flow-based constraint set and we apply Bender's decomposition on the proposed formulation. Numerical results show that the proposed method allows deriving non-dominated solutions among two competing metrics when designing the UAV path.
25 April 2023 in IEEE Transactions on Vehicular Technology
Airborne base stations (ABSs) have drawn a significant interest since they can enhance network capacity and coverage thanks to their dominant line-of-sight links as well as flexible deployment. However, the system performance of ABS-assisted networks is severely confined by the limited endurance of the on-board battery. To overcome this energy issue, we are exploring the robotic airborne base station (RABS) with energy neutral grasping end-effectors able to autonomously perch at tall urban landforms. This paper studies the optimal deployment (fly to another grasping location or remain in the same one) and operation (active or sleep mode at an epoch) of RABS based on the spatio-temporal distribution of underlying traffic load, which problem is formulated as an integer linear programming (ILP) aiming to maximize the volume of served traffic load under the on-board energy constraints. To tackle the curse of dimensionality in this ILP formulation, we first investigate a special case with a single RABS in the system and develop a Lagrangian heuristic algorithm to solve it by exploiting the totally unimodularity structure. A polynomial-time method is then proposed to decompose the multi-RABS problem into several single-RABS cases based on the Hungarian algorithm. In terms of aggregated traffic that can be supported, numerical results reveal that a single RABS outperforms four (4) fixed micro cells when the serving duration ranges from 10 to 24 hours, allowing in that sense efficient network densification. The traffic loaded in a RABS is 3.2 times higher than a fixed small cell when the traffic distribution is highly heterogeneous. Finally, the efficiency and performance of the proposed algorithms are also detailed.
4 December 2023 in IEEE Wireless Communications Letters
Robotic aerial base stations (RABSs) that are able to anchor at tall urban landforms are expected to bring further flexibility to millimeter-wave (mmWave) multi-hop backhaul networks in highly dense urban environments. In this paper, a swarm of RABSs are deployed to construct a dynamic mmWave backhaul network according to the traffic spatial distribution, and relocate their positions in subsequent time epochs according to the traffic temporal dynamic. The overall energy efficiency of the proposed framework is maximized by determining the RABS deployment, relocation and route formation under the channel capacity and hop constraints. The problem is formulated as a mixed-integer linear fractional programming (MILFP) and a two-stage method is developed to overcome the computational complexity. A wide set of numerical investigations reveal that compared to fixed small cells, only half as many RABSs are required to cover the same volume of traffic demand.
7 July 2023 in IEEE Wireless Communications Letters
The envisioned robotic aerial base station (RABS) concept is expected to bring further flexibility to integrated sensing and communication (ISAC) systems. In this letter, characterizing the spatial traffic distribution on a grid-based model, the RABS-assisted ISAC system is formulated as a robust optimization problem to maximize the minimum satisfaction rate (SR) under a cardinality constrained uncertainty set. The problem is reformulated as a mixed-integer linear programming (MILP) and solved approximately by the iterative linear programming rounding algorithm. Numerical investigations show that the minimum SR can be improved by 28.61% on average compared to fixed small cells.
22 November 2024 in IEEE Open Journal of the Communications Society
Despite the numerous advantages of aerial base stations (ABSs), including their relatively ease of deployment and inherent flexibility for relocation to adapt to highly dynamic networks, their service endurance is constrained by the limited capacity of their onboard batteries. To address this limiting factor, we explore the use of robotic aerial base stations (RABSs) that are equipped with grasping end-effectors able to anchor onto tall urban landforms such as lampposts. Energy-neutral anchoring conserves energy consumption by eliminating the need for hovering or flying during service time, thereby massively improving communication service endurance. In this paper, a joint RABS deployment and wireless backhauling scheme with the aim of maximizing served traffic is proposed to support future dynamic and densified wireless networks experiencing unprecedented data traffic growth. To meet this significant increase in traffic demand, which requires substantial bandwidth for both access and backhaul, we employ sub-Terahertz (sub-THz) band communication due to its ultra-wide spectrum resources. Given the sub-THz band’s susceptibility to blockages and severe propagation losses due to absorption, we propose a multi-hop wireless scheme to extend network coverage. The optimization interplay between RABS grasping locations, route flow control, and sub-band allocation to ensure link capacity, is framed as a robust optimization problem aimed at maximizing served traffic with a cardinality-constrained uncertainty set. Since the grasping locations are determined from all candidate locations, the number of corresponding candidate routes can significantly increase with the network size in this multi-hop enabled network. In this work, we propose a column generation (CG) based algorithm to tackle the curse of dimensionality due to the exponentially increased number of candidate routes. To this end, a near-optimal decision making is proposed with significantly reduced computational complexity. A wide set of numerical investigations demonstrates the superiority of the proposed network scheme over baseline schemes. For instance, the aggregated served traffic demand improved by 125% compared to a network with fixed small cell deployment which could be considered as the nominal use case and a common deployment option for increasing network capacity.
5 November 2025 in IEEE Transactions on Vehicular Technology
Edge computing that enables satellites to process raw data locally is expected to bring further timeliness and flexibility to satellite-terrestrial networks (STNs). In this letter, we propose a three-layer edge computing protocol, where raw data collected by the satellites can be processed locally, or transmitted to other satellites or the ground station via multi-hop routing for further processing. The overall computing capacity of the proposed framework is maximized by determining the offloading strategy and routing formation, subject to channel capacity and hop constraints. Given that the problem scale grows exponentially with the number of satellites and maximum-allowed hops, the column generation approach is employed to obtain the global optimal solution by activating only a subset of variables. Numerical results reveal that the proposed three-layer protocol improves the computing capacity by 45% and 42% compared to the single-layer and two-layer configurations, respectively.