In recent years, Small Satellite Networks (SSNs) are attracting increasing attention due to its economical prospects and advantages in high bandwidth and low latency. More and more companies and organizations are planning to construct large-scale SSNs to provide global services. In this way, the traffic pattern is more complicated because of random transmission requirements and stochastic packet generations/arrivals, and routing faces more challenges due to network scale and limited resource in small satellites. Traditional satellite routing algorithms, which attempt to exploit the predictable satellite's trajectory with time-discrete graph models, cannot handle these challenges. In this paper, we propose a novel Temporal Netgrid Model (TNM) to portray the time-varying topology of large-scale SSNs. In TNM, the whole space is divided into small cubes (i.e., netgrids) and then, satellites can be located by netgrids instead of coordinates. By doing so, we can construct a network topology for random traffic routing. Furthermore, an efficient Netgrid-based Shortest Path Routing (NSR) algorithm is proposed based on TNM; NSR attempts to find the optimal path from source netgrid to any other reachable netgrids. In this way, the routing complexity is significantly reduced. We also develop a Large-scale Satellite Network Simulator (LSNS) to validate our study. The results show that NSR achieves a significant reduction in computational complexity as well as near-optimal routing performance in terms of end-to-end delay and packet drop rate in scenarios of large-scale SSNs compared with existing satellite routing algorithms.

To solve the blockage effect in millimeter wave (mmWave) communication, intelligent reflecting surface (IRS) is introduced to create additional links and enhance the system performance, by properly optimizing the IRS phase shifts based on the channel state information (CSI). However, channel estimation in IRS-enhanced mmWave system is challenging, since IRS is unable to perform signal processing and the large number of reflecting elements of IRS leads to high complexity. To reduce the overhead and obtain accurate CSI, we propose a channel estimation scheme based on least square (LS) estimation with partial on-off and super-resolution (SR) network. Specifically, we switch on part of the reflecting elements and estimate the cascaded channel matrix, which can be considered as a low-resolution (LR) image with low-precision. Then it is expanded to a high-resolution (HR) image with low-precision by linear interpolation. Furthermore, we feed this HR image into an SR network to improve the estimation accuracy. Numerical results demonstrate the advantages of our proposed SR channel estimation compared with benchmark schemes.

Intelligent reflecting surface (IRS) is a potential technology to build programmable wireless environment in future communication systems. In this paper, we consider a multi-IRS-assisted multi-base station (multi-BS) multi-user millimeter wave (mmWave) downlink communication system, exploiting IRS to extend mmWave signal coverage to blind spots. Considering the impact of IRS on user association in multi-BS mmWave systems, we formulate a sum rate maximization problem by jointly optimizing passive beamforming at IRS, power allocation and user association. This leads to an intractable non-convex problem, for which to tackle we propose a computationally affordable iterative algorithm, capitalizing on alternating optimization, sequential fractional programming (SFP) and forward-reverse auction (FRA). In particular, passive beamforming at IRS is optimized by utilizing the SFP method, power allocation is solved through means of standard convex optimization method, and user association is handled by the network optimization based FRA algorithm. Simulation results demonstrate that the proposed algorithm can achieve significant performance gains, e.g., it can provide up to 147% higher sum rate compared with the benchmark and 116% higher energy efficiency compared with amplify-and-forward relay.

In the traditional cellular-based mobile edge computing (MEC), users at the edge of the cell are prone to suffer severe inter-cell interference and signal attenuation, leading to low throughput even transmission interruptions. Such edge effect severely obstructs offloading of tasks to MEC servers. To address this issue, we propose user-centric mobile edge computing (UCMEC), a novel MEC architecture integrating user-centric transmission, which can ensure high throughput and reliable communication for task offloading. Then, we formulate an long-term delay minimization problem by jointly optimizing task offloading, power allocation, and computing resource allocation in UCMEC. To solve the intractable problem, we propose two decentralized joint optimization schemes based on multi-agent deep reinforcement learning (MADRL) and convex optimization, which consider both cooperation and non-cooperation among network nodes. Simulation results demonstrate that the proposed schemes in UCMEC can significantly improve the uplink transmission rate by at least 176.99% and reduce the long-term average total delay by at least 16.36% compared to traditional cellular-based MEC.

The reliability of current virtual reality (VR) delivery is low due to the limited resources on VR head-mounted displays (HMDs) and the transmission rate bottleneck of sub-6 GHz networks. In this paper, we propose a dual-connectivity sub-6 GHz and mmWave heterogeneous network architecture empowered by mobile edge capability. The core idea of the proposed architecture is to utilize the complementary advantages of sub-6 GHz links and mmWave links to conduct a collaborative edge resource design, which aims to improve the reliability of VR delivery. From the perspective of stochastic geometry, we analyze the reliability of VR delivery and theoretically demonstrate that sub-6 GHz links can be used to enhance the reliability of VR delivery despite the large mmWave bandwidth. Based on our analytical work, we formulate a joint caching and computing optimization problem with the goal to maximize the reliability of VR delivery. By analyzing the coupling caching and computing strategies at HMDs, sub-6 GHz and mmWave base stations (BSs), we further transform the problem into a multiple-choice multi-dimension knapsack problem. A best-first branch and bound algorithm and a difference of convex programming algorithm are proposed to obtain the optimal and sub-optimal solution, respectively. Numerical simulations demonstrate the performance improvement using the proposed algorithms, and reveal that caching more monocular videos at sub-6 GHz BSs and more stereoscopic videos at mmWave BSs can improve the VR delivery reliability efficiently.

To relieve the stress on channel estimation and decoding complexity in cell-free massive multiple-input multiple-output (MIMO) systems, user grouping problem is investigated in this paper, where access points (APs) based on time-division duplex (TDD) are considered to serve users on different time resources and the same frequency resource. In addition, when quality of service (QoS) requirements are considered, widely-used max-min power control is no longer applicable. We derive the minimum power constraints under diverse QoS requirements considering user grouping. Based on the analysis, we formulate the joint power and user grouping problem under QoS constraints, aiming at minimizing the total transmit power. A generalized benders decomposition (GBD) based algorithm is proposed, where the primal problem and master problem are solved iteratively to approach the optimal solution. Simulation results demonstrate that by user grouping, the number of users served in cell-free MIMO systems can be as much as the number of APs without increasing the complexity of channel estimation and decoding. Furthermore, with the proposed user grouping strategy, the power consumption can be reduced by 2–3 dB compared with the reference user grouping strategy, and by 7 dB compared with the total transmit power without grouping.