3 November 2023 in IEEE Journal on Selected Areas in Information Theory
Intelligent real-time applications, such as video surveillance, demand intensive computation to extract status information from raw sensing data. This poses a substantial challenge in orchestrating computation and communication resources to provide fresh status information. In this paper, we consider a scenario where multiple energy-constrained devices served by an edge server. To extract status information, each device can either do the computation locally or offload it to the edge server. A scheduling policy is needed to determine when and where to compute for each device, taking into account communication and computation capabilities, as well as task-specific timeliness requirements. To that end, we first model the timeliness requirements as general penalty functions of Age of Information (AoI). A convex optimization problem is formulated to provide a lower bound of the minimum AoI penalty given system parameters. Using KKT conditions, we proposed a novel scheduling policy which evaluates status update priorities based on communication and computation delays and task-specific timeliness requirements. The proposed policy is applied to an object tracking application and carried out on a large video dataset. Simulation results show that our policy improves tracking accuracy compared with scheduling policies based on video content information.
2 July 2025 in IEEE Transactions on Intelligent Transportation Systems
We consider the problem of exploring travel demand statistics to optimize ride-sharing routing, which is to determine a route to transport multiple customers with similar itineraries and schedules in a cost-effective and timely manner. This problem is important for unleashing the economic and societal benefits of ride-sharing. Meanwhile, it is challenging due to the need to (i) meet the travel delay requirements of customers and (ii) make online decisions without knowing the exact travel demands beforehand. We present a general framework for exploring the new design space enabled by the demand-aware approach. We show that demand-aware ride-sharing routing is fundamentally a two-stage stochastic optimization problem. While the problem is combinatorial in nature and challenging, we exploit the two-stage structure to design an optimal solution that maximizes the expected reward of the route with polynomial time complexity, which makes it amenable to practical implementation. Our approach can be applied to optimize a variety of objectives in a ride-sharing trip, including revenue, driver’s profit, and total travel time reduction compared to serving customers individually. We carry out extensive simulations based on real-world travel demand traces in Manhattan. Simulation results show that applying our demand-aware solution increases the revenue by 26% against conceivable alternatives. As compared to the case without ride-sharing, our ride-sharing solution increases the driver’s profit per slot by 12% and decreases the total vehicle travel time (an indicator of greenhouse gas emission) by 16%.