Bowen Li

Bowen Li

Auto-generated profile, based on publicly available information

Bowen Li

Linköping University

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 August 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
BLBowen Li
Bowen Li
JCJunting Chen
Junting Chen
Herein, an interference-aware predictive aerial-and-terrestrial communication problem is studied, where an unmanned aerial vehicle (UAV) delivers some data payload to a few nodes within a communication deadline. The first challenge is the possible interference to the ground base stations (BSs) and users possibly at unknown locations. This paper develops a radio-map-based approach to predict the channel to the receivers and the unintended nodes. Therefore, a predictive communication strategy can be optimized ahead of time to reduce the interference power and duration for the ground nodes. Such predictive optimization raises the second challenge of developing a low-complexity solution for a batch of transmission strategies over T time slots for N receivers before the flight. Mathematically, while the proposed interference-aware predictive communication problem is non-convex, it is converted into a relaxed convex problem, and solved by a novel dual-based algorithm, which is shown to achieve global optimality at asymptotically small slot duration. The proposed algorithm demonstrates orders of magnitude of the computational time saving compared to several existing solvers. Simulations show that the radio-map-assisted scheme can reduce the interference to the unintended receivers at known locations below a prescribed threshold and significantly reduce the interference to the users at unknown locations.

26 April 2024 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
BLBowen Li
Bowen Li
JCJunting Chen
Junting Chen
This paper studies a delay-tolerant data transportation problem over an aerial ad hoc network where the aerial nodes have predetermined trajectories. The challenge is how to exploit the large-scale channel information predicted from the predetermined trajectories of the aerial nodes to optimize for the communication strategy in a distributive way. The objective is to minimize both the communication energy and the communication time to control the interference leakage to the ground. Most existing approaches for aerial network communications require intensive centralized coordination, but the trajectory information may not be globally available. To tackle these issues, this paper develops a large timescale two-layer optimization strategy using a game theoretical approach. In the inner layer, a mixed timescale optimization on the power allocation and transmission timing is formulated, which is converted into a one-parameter optimization with an optimality guarantee for a deterministic proxy of the original problem. In the outer layer, a handover time game is formulated, and a neighbor coordinate response strategy based on local information exchange is developed, demonstrating rapid convergence and near-global optimality in simulations. Numerical experiments demonstrate that, under large timescale optimization, an order of magnitude of cost saving can be achieved.

11 February 2026 in IEEE Internet of Things Magazine
Verified
Journal Article
Closed access
JCJunting Chen
Junting Chen
BLBowen Li
Bowen Li
HSHao Sun
Hao Sun
SCShuguang Cui
Shuguang Cui
Nikolaos PappasNikolaos Pappas
Nikolaos Pappas
The emergence of dense, mission-driven aerial networks supporting the low-altitude economy presents unique communication and security challenges, including extreme channel dynamics and severe cross-tier interference. Traditional reactive communication paradigms are ill-suited to these environments, as they fail to leverage the network’s inherent predictability. This paper introduces predictive communication, a novel paradigm transforming network management from reactive adaptation to proactive optimization. The approach is enabled by fusing predictable mission trajectories with stable, large-scale radio environment models (e.g., radio maps). Specifically, we present a hierarchical framework that decomposes the predictive cross-layer resource allocation problem into three layers: strategic (routing), tactical (timing), and operational (power). This structure aligns decision-making timescales with the accuracy levels and ranges of available predictive information. We demonstrate that this foresight-driven framework achieves an order-of-magnitude reduction in cross-tier interference and enables proactive security against threats such as jamming and spoofing, laying the groundwork for efficient, resilient, and secure low-altitude communication systems.

15 December 2025 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
BLBowen Li
Bowen Li
JCJunting Chen
Junting Chen
Dynamic low altitude networks offer significant potential for efficient and reliable data transport via unmanned aerial vehicles (UAVs) relays which usually operate with pre-determined trajectories. However, it is challenging to optimize the data routing and resource allocation due to the time-varying topology and the need to control interference with terrestrial systems. Traditional schemes rely on time-expanded graphs with uniform and fine time subdivisions, making them impractical for interference-aware applications. This paper develops a dynamic space-time graph model with a cross-layer optimization framework that converts a joint routing and predictive resource allocation problem into a joint bottleneck path planning and resource allocation problem. We develop explicit deterministic bounds to handle the channel uncertainty and prove a monotonicity property in the problem structure that enables us to efficiently reach the globally optimal solution to the predictive resource allocation subproblem. Then, this approach is extended to multi-commodity transmission tasks through time-frequency allocation, and a bisection search algorithm is developed to find the optimum solution by leveraging the monotonicity of the feasible set family. Simulations verify that the single commodity algorithm approaches global optimality with more than 30 dB performance gain over the classical graph-based methods for delay-sensitive and large data transportation. At the same time, the multi-commodity method achieves 100X improvements in dense service scenarios and enables an additional 20 dB performance gain by data segmenting.

13 December 2023
Verified
Conference Paper
Open access
BOBrandon Van Over
Brandon Van Over
BLBowen Li
Bowen Li
ECEdwin K. P. Chong
Edwin K. P. Chong
APAli Pezeshki
Ali Pezeshki
We study the optimization problem of choosing strings of finite length to maximize string submodular functions on string matroids, which is a broader class of problems than maximizing set submodular functions on set matroids. We provide a lower bound for the performance of the greedy algorithm in our problem, and then prove that our bound is superior to the greedy curvature bound of Conforti and Cornuéjols, Our bound has lower computational complexity than most previously proposed curvature bounds. Finally, we demonstrate the strength of our result on a sensor coverage problem.

1 April 2019
Verified
Conference Paper
Closed access
BLBowen Li
Bowen Li
ZGZhenxiang Gao
Zhenxiang Gao
XSXu Shan
Xu Shan
WZWeihua Zhou
Weihua Zhou
EFEmilio Ferrara
Emilio Ferrara
Mobile Social Networks (MSNs) have been evolving and enabling various fields in recent years. Recent advances in mobile edge computing, caching, and device-to-device communications, can have significant impacts on 5G systems. In those settings, identifying central users is crucial. It can provide important insights into designing and deploying diverse services and applications. However, it is challenging to evaluate the centrality of nodes in MSNs with dynamic environments. In this paper, we propose a Social-Relation based Centrality (SoReC) measure, in which social network information is used to quantify the influence of each user in MSNs. We first introduce a new metric to estimate direct social relations among users via direct contacts, and then extend the metric to explore indirect social relations among users bridging to their neighbors. Based on direct and indirect social relations, we detect the influence spheres of users and quantify their influence in the networks. Simulations on real-world networks show that the proposed measure can perform well in identifying future influential users in MSNs.