An energy-harvesting sensor node that is sending status updates to a destination is considered. The sensor is equipped with a battery of finite size to save its incoming energy, and consumes one unit of energy per status update transmission, which is delivered to the destination instantly over an error-free channel. The setting is online in which the harvested energy is revealed to the sensor causally over time after it arrives, and the goal is to design status update transmission times (policy) such that the long term average age of information (AoI) is minimized. The AoI is defined as the time elapsed since the latest update has reached at the destination. Two energy arrival models are considered: a random battery recharge (RBR) model, and an incremental battery recharge (IBR) model. In both models, energy arrives according to a Poisson process with unit rate, with values that completely fill up the battery in the RBR model, and with values that fill up the battery incrementally in a unit-by-unit fashion in the IBR model. The key approach to characterizing the optimal status update policy for both models is showing the optimality of renewal policies , in which the inter-update times follow a renewal process in a certain manner that depends on the energy arrival model and the battery size. It is then shown that the optimal renewal policy has an energy-dependent threshold structure, in which the sensor sends a status update only if the AoI grows above a certain threshold that depends on the energy available in its battery. For both the random and the incremental battery recharge models, the optimal energy-dependent thresholds are characterized explicitly , i.e., in closed-form, in terms of the optimal long term average AoI. It is also shown that the optimal thresholds are monotonically decreasing in the energy available in the battery, and that the smallest threshold, which comes in effect when the battery is full, is equal to the optimal long term average AoI.

Non-orthogonal multiple access (NOMA) has been widely recognized as a promising way to scale up the number of users, enhance the spectral efficiency, and improve the user-fairness in wireless networks, by allowing more than one user to share one wireless resource. NOMA can be flexibly combined with many existing wireless technologies and emerging ones including multiple-input multiple-output (MIMO), massive MIMO, millimeter wave communications, cognitive and cooperative communications, visible light communications, physical layer security, energy harvesting, wireless caching, and so on. Combination of NOMA with these technologies can further increase scalability, spectral efficiency, energy efficiency, and greenness of future communication networks. This paper provides a comprehensive survey of the interplay between NOMA and the above technologies. The emphasis is on how the above techniques can benefit from NOMA and vice versa. Moreover, challenges and future research directions are identified.

A two-hop energy harvesting communication network is considered, in which measurement updates are transmitted by a source to a destination through an intermediate relay. Updates are to be sent in a timely fashion that minimizes the age of information, defined as the time elapsed since the most recent update at the destination was generated at the source. The source and the relay communicate using energy harvested from nature, which is stored in infinite-sized batteries. Both nodes use fixed transmission rates, and hence updates incur fixed delays (service times). Two problems are formulated: an offline problem, in which the energy arrival information is known a priori, and an online problem, in which such information is revealed casually over time. In both problems, it is shown that it is optimal to transmit updates from the source just in time as the relay is ready to forward them to the destination, making the source and the relay act as one combined node. A recurring theme in the optimal policy is that updates should be as uniformly spread out over time as possible, subject to energy causality and service time constraints. This is perfectly achieved in the offline setting, and is achieved almost surely in the online setting by a best effort policy.

Optimization of information freshness in wireless networks has usually been performed based on queueing analysis that captures only the temporal traffic dynamics associated with the transmitters and receivers. However, the effect of interference, which is mainly dominated by the interferers' geographic locations, is not well understood. In this paper, we leverage a spatiotemporal model, which allows one to characterize the age of information (AoI) from a joint queueing-geometry perspective, for the design of a decentralized scheduling policy that exploits local observation to make transmission decisions that minimize the AoI. To quantify the performance, we also derive accurate and tractable expressions for the peak AoI. Numerical results reveal that: i) the packet arrival rate directly affects the service process due to queueing interactions, ii) the proposed scheme can adapt to traffic variations and largely reduce the peak AoI, and iii) the proposed scheme scales well as the network grows in size. This is done by adaptively adjusting the radio access probability at each transmitter to the change of the ambient environment.

A downlink single-input single-output non-orthogonal multiple access setting is considered, in which a base station (BS) is communicating with two legitimate users in two possible scenarios of unsecure environments: existence of an external eavesdropper and communicating through an untrusted relay. For the first scenario, a number of trusted cooperative half-duplex relays is employed to assist with the BS's transmission and secure its signals from the external eavesdropper. Various relaying schemes are proposed and analyzed for that matter: cooperative jamming, decode-and-forward, and amplify-and-forward. For each scheme, secure beamforming signals are devised at the relays to maximize the achievable secrecy rate regions. For the second scenario, with the untrusted relay, achievable secrecy rate regions are derived for two different relaying schemes, compress-and-forward and amplify-and-forward, under two different modes of operation. In the first mode, coined passive user mode, the users receive signals from both the BS and the untrusted relay and combine them to decode their messages. In the second mode, termed the active user mode, the users transmit a cooperative jamming signal simultaneously with the BS's transmission to further confuse the relay. Focusing on half-duplex nodes, the users cannot receive the BS's signal while jamming the relay, i.e., while being active, and rely only on the signals forwarded to them by the relay. It is shown that the best relaying scheme highly depends on the system parameters, in particular the distances between the nodes, and also on the part of the secrecy rate region at which the system is to operate.

We introduce the concept of fresh data trading, in which a destination user requests, and pays for, fresh data updates from a source provider, and data freshness is captured by the age of information (AoI) metric. Keeping data fresh relies on costly frequent data updates by the source, which motivates the source to price fresh data. In this work, the destination incurs an age-related cost, modeled as a general increasing function of the AoI. The source designs a pricing mechanism to maximize its profit, while the destination chooses a data update schedule to trade off its payments to the source and its age-related cost. Depending on different real-time applications and scenarios, we study both a finite-horizon model and an infinite-horizon model with time discounting. The key challenge of designing the optimal pricing scheme lies in the destination's time-interdependent valuations, due to the nature of AoI, and the infinite-dimensional dynamic optimization. To this end, we exploit three different dimensions in designing pricing by studying three pricing schemes: a time-dependent pricing scheme, in which the price for each update depends on when it is requested; a quantity-based pricing scheme, in which the price of each update depends on how many updates have been previously requested; and a simple subscription-based pricing scheme, in which the price per update is constant but the source charges an additional subscription fee. Our analysis reveals that (1) the optimal subscription-based pricing maximizes the source's profit among all possible pricing schemes under both finite-horizon and infinite-horizon models; (2) the optimal quantity-based pricing scheme is only optimal with a finite horizon; and (3) the time-dependent pricing scheme, under the infinite-horizon model with significant time discounting, is asymptotically optimal. Numerical results show that the profit-maximizing pricing schemes can also lead to significant reductions in AoI and social costs, and that a moderate degree of time discounting is enough to achieve a close-to-optimal time-dependent pricing scheme.