Unmanned aerial vehicle (UAV)-empowered edge computing has been widely investigated in obstacle-free scenarios, where a moving UAV is in charge of handling offloaded singleton tasks from mobile devices on the ground. However, little attention has been paid to the scenario, in which the UAV serves a complex area with multiple obstacles and dependent tasks . A dependent task can be formulated as a directed acyclic graph (DAG) that contains a number of subtasks; and each subtask can be executed by a corresponding service function (SF) deployed on the UAV. In this backdrop, the joint UAV trajectory planning, DAG task scheduling, and SF deployment is formulated as an optimization problem in this article. Afterwards, a deep reinforcement learning (DRL)-based algorithm is presented to tackle the NP-hard problem. The state space, action space, and the reward function of the agent, i.e., the UAV, are defined, respectively, under the DRL framework. To evaluate the effectiveness of the proposal, a series of experiments is conducted with different parameter settings. Results show that the DRL-based algorithm performs much better than three heuristic algorithms in success rate of trajectory planning, the number of executed tasks, and the average task response latency.
4 February 2021 in IEEE/ACM Transactions on Networking
Edge computing applications typically require generated data to be preprocessed at the source and then transmitted to an edge server. In such cases, transmission time and preprocessing time are coupled, yielding a tradeoff between them to achieve the targeted objective. This paper presents analysis of such a system with the objective of optimizing freshness of received data at the edge server. We model this system as two queues in tandem whose service times are independent but the transmission service time is monotonically dependent on the computation service time in mean value. This dependence captures the natural decrease in transmission time due to lower offloaded computation. We analyze various queue management schemes in this tandem queue where the compute queue has a single server, Poisson packet arrivals, general independent service and no extra buffer to save incoming packets. The transmit queue has a single server receiving packets from the compute queue with memoryless service time. We consider the transmit queue in two forms: (i) No data buffer and (ii) One unit data buffer and last come first serve with discarding. We analyze various non-preemptive as well as preemptive cases. We perform stationary distribution analysis and obtain closed form expressions for average age of information (AoI) and average peak AoI. Our numerical results illustrate analytical findings on how computation and transmission times could be traded off to optimize AoI and reveal a consequent tradeoff between average AoI and average peak AoI.
30 December 2019 in IEEE Transactions on Information Theory
In this paper, we explore the potential of server waiting before packet transmission in improving the Age of Information (AoI) in status update systems. We consider a non-preemptive queue with Poisson arrivals and independent general service distribution and we incorporate waiting before serving in two packet management schemes: M/GI/1/1 and M/GI/1/2*. In M/GI/1/1 there is no data buffer and a packet is taken to server only when it is idle whereas in M/GI/1/2* there is a single unit buffer that captures the latest arriving status update packet. In both schemes, we introduce “server waiting”: In M/GI/1/1 scheme, the server waits for a deterministic time immediately after a packet enters the server. In M/GI/1/2* scheme, depending on queue state, the server waits for a deterministic time before starting service. In both cases, if a newer arrival is captured, existing packet is discarded with no reset of the waiting period. Different from most existing works, we analyze AoI evolution by indexing the incoming packets, which is enabled by an alternative method of partitioning the area under the evolution of instantaneous AoI to calculate its time average. We obtain expressions for average AoI and average peak AoI for both queueing disciplines with waiting. Our numerical results demonstrate that waiting before service can bring significant improvement in average age, particularly, for heavy-tailed service distributions. This improvement comes at the expense of an increase in average peak AoI. We highlight the trade-off between average and average peak AoI generated by waiting before serving.
In this paper, we examine a multi-sensor system where each sensor may monitor more than one time-varying information process and send status updates to a remote monitor over a common channel. We consider that each sensor's status update may contain information about more than one information process in the system subject to the system's constraints. To investigate the impact of this correlation on the overall system's performance, we conduct an analysis of both the average Age of Information (AoI) and source state estimation error at the monitor. Building upon this analysis, we subsequently explore the impact of the packet arrivals, correlation probabilities, and rate of processes' state change on the system's performance. Next, we consider the case where sensors have limited sensing abilities and distribute a portion of their sensing abilities across the different processes. We optimize this distribution to minimize the total AoI of the system. Interestingly, we show that monitoring multiple processes from a single source may not always be beneficial. Our results also reveal that the optimal sensing distribution for diverse arrival rates may exhibit a rapid regime switch, rather than smooth transitions, after crossing critical system values. This highlights the importance of identifying these critical thresholds to ensure effective system performance.
In this paper, we introduce a new data freshness metric, relative Age of Information (rAoI), and examine it in a single server system with various packet management schemes. The (classical) AoI metric was introduced to measure the end to end freshness of status updates at the receiver with respect to their generation at the source. In order to understand the efficiency of the update delivery system in isolation, we introduce rAoI metric to measure how fresh the data is at the receiver with respect to the data at the transmitter. This metric introduces an explicit dependence on the arrival process in the evaluation of age. We investigate several queuing disciplines and provide closed form expressions for rAoI and numerical comparisons.
The age of information (AoI) is now well established as a metric that measures the freshness of information delivered to a receiver from a source that generates status updates. This paper is motivated by the inherent value of packets arising in many cyber-physical applications (e.g., due to precision of the information content or an alarm message). In contrast to AoI, which considers all packets are of equal importance or value, we consider status update systems with update packets carrying values as well as their generated time stamps. A status update packet has a random initial value at the source and a deterministic deadline after which its value vanishes (called ultimate staleness). In our model, the value of a packet either remains constant until the deadline or decreases in time (even after reception) starting from its generation to the deadline when it vanishes. We consider two metrics for the value of information (VoI) at the receiver: sum VoI is the sum of the current values of all packets held by the receiver, whereas packet VoI is the value of a packet at the instant it is delivered to the receiver. We investigate various queuing disciplines under potential dependence between value and service time and provide closed form expressions for both average sum VoI and packet VoI at the receiver. Numerical results illustrate the average VoI for different scenarios and relations between average sum VoI and average packet VoI.