Nannan Zhang's research while affiliated with Zhejiang University and other places

In-network aggregation is a fundamental operation for massive packets in the Internet of Things (IoT). By aggregating ultra-small packets, the energy consumption for data transmission is not related to the packet number, while the average delay performance depends on the delay of all packets even if they are aggregated. In this paper, we propose a low-delay ultra-small packet transmission scheme with in-network aggregation in energy-harvesting multi-hop networks, where each device periodically transmits packets in a collect-wait-forward relaying manner. Considering the resulting extra waiting time during relaying, we first drive the tractable form of the average end-to-end delay by problem transformation. By characterizing the two-dimensional evolution property from the perspective of both hops and time, the delay minimization problem is reformulated as an infinite-horizon average-cost Markov decision process with a two-dimensional optimality equation. To deal with the curse of dimensionality, we decompose the global Bellman equation into several per-device local relay selection problems. Based on the problem decomposition, we propose a distributed ultra-Small Packet Aggregation Relay SElection (SPARSE) algorithm via stochastic learning. The convergence is further proved theoretically and verified by simulation. Simulation results reveal that the proposed scheme achieves significant performance gain over the baselines for ultra-small packets.

Simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) are gaining great attention for their ability to achieve full-space coverage. In this paper, the queue-aware STAR-RIS assisted non-orthogonal multiple access (NOMA) communication system is investigated to ensure system stability. To tackle the challenge of infinite time periods for stability, the long-term stability-oriented problem is reformulated as a per-slot queue-weighted sum rate (QWSR) maximization problem using Lyapunov drift theory. Particularly, the allocated rate weight for each user is determined by the corresponding data queue at the base station (BS). By jointly optimizing the NOMA decoding order, the active beamforming coefficients at the BS, and the passive transmission and reflection coefficients at the STAR-RIS, three STAR-RIS operating protocols are considered, namely energy splitting (ES), mode switching (MS), and time switching (TS). An equivalent-combined channel gain based scheme is proposed to obtain the desired decoding order. For ES, the highly coupled and non-convex problem is solved iteratively and alternatively by invoking the blocked coordinate descent and the successive convex approximation methods. This approach is further expanded to a penalty-based two-loop algorithm to solve the binary amplitude constrained problem for MS. For TS, the problem is decomposed into two subproblems, each of which is solved similarly as ES. Simulation results show that: i) our proposed STAR-RIS assisted NOMA communication achieves superior performance to the conventional schemes; ii) the reformulated QWSR maximization problem is proven to ensure the system stability; and iii) TS performs best in both the QWSR and the average queue length.

In this paper, the queue-aware simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS) assisted non-orthogonal multiple access (NOMA) communication system is investigated to ensure the system stability, where the long-term stability-oriented problem is reformulated to maximize the per-slot queue-weighted sum rate (QWSR) of users based on the Lyapunov drift theory. By jointly optimizing the NOMA decoding order, the active beamforming coefficients at the BS, and the passive transmission and reflection coefficients at the STAR-RIS, three STAR-RIS operating protocols are considered, namely energy splitting (ES), mode switching (MS), and time switching (TS). For ES, the blocked coordinate descent and the successive convex approximation methods are invoked to handle the highly-coupled and non-convex problem. For MS, the proposed algorithm is further extended to a penalty-based two-loop algorithm to solve the binary amplitude constrained problem. For TS, the formulated problem is decomposed into two subproblems, each of which can be solved in a similar manner to ES. Simulation results show that: i) our proposed STAR-RIS assisted NOMA communication achieves better performance than the conventional schemes; ii) the reformulated QWSR maximization problem confirms the system stability; and iii) TS achieves superior performance with respect to both the QWSR and the average queue length.

Caching popular contents in close proximity to the users can effectively reduce the latency in communication systems. Considering the imperfect content fetching from the original server, the caching management at the edge node should be determined according to not only the content popularity but also how difficult to fetch these content objects from their corresponding original servers. In this paper, we study the edge caching for minimizing the long-term average delay, where the fetching delay of the uncached contents is introduced. We construct a decision-theoretic framework for this delay-optimal content-caching problem, where the main obstacle is that the consideration of the imperfect content fetching breaks the Markovian property in the decision-theoretic framework. To overcome this obstacle, by analyzing the queue dynamics within the content fetching delay after the content object is removed from the cache, we transform the problem for meeting the Markovian property, and model it as an infinite horizon semi-Markov decision process (SMDP). Achieving the delay optimality of the caching problem needs to solve the Bellman equation of the SMDP, but it leads to the curse of dimensionality. We decompose the global optimality equation into several per-content optimality equations, and propose a low-complexity delay-optimal content caching algorithm by stochastic learning for each content. Finally, the simulation results show that our proposed algorithm achieves significantly lower delay than conventional caching algorithms.