31 March 2022 in IEEE Transactions on Aerospace and Electronic Systems
In recent years, satellite-integrated content centric networking (SCCN) has become an important solution for the future network with excellent bandwidth savings and file distribution capability in a wide range by the intrinsic caching function. At present, however, the high-speed changes of satellite network topology and coverage make it difficult to predict the file popularity of SCCN network, resulting in a low timeliness. This will lead to low node cache efficiency and bad data distribution performance. To address this issue, in this article, we have proposed a deep learning-enabled file popularity-aware caching replacement mechanism to achieve efficient file distribution in SCCN. In the proposed mechanism, we have developed a virtual location division scheme to keep the return path of content data invariable by remapping the time-varying topology of network into a static topology with virtual nodes. Furthermore, we have put forward a minimum delay file-caching set algorithm to predict the popularity of files in the proposed SCCN via a well-designed deep learning framework, which can find those high-popularity files most worthy of caching. The simulation results verified the proposed method can obviously degrade the access delay of all users and the cache hit ratio of satellite nodes, compared with current strategies, i.e., cache everything everywhere with least recently used, probCache, content-aware placement and discovery, and replacement (APDR), respectively.
26 September 2024 in IEEE/ACM Transactions on Networking
In large-scale satellite networks, data delivery confronts obvious challenges such as high loss rate and long propagation delay leading to low Packet Delivery Ratio (PDR) and huge delivery latency over intermittent Inter-Satellite Links (ISLs), making the current routing algorithms exploiting typical Automatic Repeat reQuest (ARQ) mechanisms extremely inefficient and even incapable. To address this issue, in this paper, we propose a semantic-aware coding and routing joint mechanism called Semantic Adaptive Coding and Routing (SACR) by considering both the semantic correlations in the context-dependent data and the link status knowledge. In particular, the proposed SACR achieves excellent error-tolerant and routing-agile capabilities by an elaborately interactive design consisting of a customized routing-aware Semantic Adaptive Coding Hybrid ARQ (SAC-HARQ) mechanism and a Semantic Coding-based Routing Mechanism (SCRM). The simulation results indicate that the proposed SACR mechanism performs better in reducing the average delivery latency and improving the effective throughput compared with typical routing mechanisms such as Open Shortest Path First (OSPF) routing, Deep Q-Networks based Intelligent Routing (DQN-IR), and Real-Time Hop-by-hop routing (RTHop), integrating with typical semantic coding methods, i.e., Deep Learning-based Joint Channel-Source Coding (DL-JSCC), Deep learning-based Semantic Communication system (DeepSC), and Semantic Coding HARQ (SCHARQ), respectively.
14 December 2022 in IEEE Internet of Things Journal
Low orbit satellite constellation as a relay network provides a possible solution for remote real-time data gathering applications, in which freshness information updates will be forwarded via dynamical intersatellite links (ISLs). Modeling by a time-varying network, this article studies minimizing Age of Information (AoI) of delivering the data through a multihop path, in particular, focusing on the effect of frequent interruptions of ISLs. Subjected to two constraints of path and effective arrival rate, the minimizing AoI problem is formulated to find a pair of optimal transmission delay and arrival rate. In particular, the $\mathcal {H}$ -approximate optimal algorithm, called a latest update routing (LUR) algorithm, is proposed with a well-designed continuous time-varying graph. Using LUR, a set of paths can be obtained with degraded transmission delay that satisfies a given arrival rate. By screening all the arrival rates satisfying the effective constraint, the maximum rate and a corresponding path set that minimizes age can be found. The simulation results verified that a degraded average AoI can be obtained by the proposed path selection mechanism compared with the typical shortest delay path (SDP) strategy, minimum spanning tree (MST) strategy, and MAoIG. In particular, the numerical findings show that the proposed LUR reduces average AoI by a maximum of 12.66% compared with SDP, 75.28% compared with MST, and 69.3% compared with MAoIG, respectively, under different scenarios.
12 January 2022 in IEEE Internet of Things Journal
In this article, we consider the data updating problem in the Satellite-integrated Internet of Things network for the time-critical scenarios, i.e., animal tracking and environmental monitoring. Due to the limited channel rate during contact of transmission, however, constantly updating data with huge volume over the uplink will incur obvious waiting and transmission delay bringing stale information to the satellite node. To address this issue, we propose a novel metric, spatially temporally correlative mutual information (STI), to characterize the information timeliness from perspective of information entropy by considering the correlations between the last update message and the status of the information source. By maximizing the averaged STI, we find the optimal allocation policy of channel slots with a fixed updating period by formulating the problem as a Markov decision process (MDP) with possibly infinite state space. Furthermore, we derive the optimal amounts of allocated time slots in a unit frame by solving a constrained range integer optimization problem with respect to the average STI. The simulation results show that the proposed periodically updating policy can significantly improve the information freshness compared with the original slot allocation strategy and current commonly used scheduled access strategies, i.e., slotted ALOHA and Threshold-ALOHA.
29 December 2021 in IEEE Transactions on Vehicular Technology
Explorations on the Lunar Far-side Surface (LFS) have recently developed rapidly with various landers, cruisers, and orbital space vehicles. Research on relay satellites with Earth-Moon Libration Point (EMLP) orbits has aroused widespread interest in supporting these probe missions, i.e., “Queqiao” spacecraft, due to their particular relative positions in the Earth-Lunar system. For example, a Halo orbital relay satellite at the Earth-Moon L2 point can provide more transmission opportunities for communication nodes on LFS to the destination nodes on the Earth. However, a single Halo orbital spacecraft could not provide all-time connections for the cislunar communication with its limited coverage on the LFS. In this paper, we proposed a dual-relay Halo orbit constellation for the cislunar communication network, providing high-proportion coverage on the LFS at any time using an analytical method of the grid point. Based on the proposed constellation, we designed an energy efficiency-optimal relay selection algorithm for the nodes on the LFS to return data back to the Earth by solving a MIP (Mixed-Integer-Programming) problem with collaborative considerations of source and relay node’s power allocation. The simulation results demonstrate that the proposed algorithm has the maximum energy efficiency (EE) while ensuring the user’s quality of service, compared with the algorithm of Spectrum Efficiency Maximization (SEM).
5 March 2024 in IEEE Internet of Things Journal
In the Satellite-Integrated Internet of Things (SIoT), typical multiaccess schemes, i.e., contention resolution diversity slotted ALOHA scheme (CRDSA), face with the obvious challenge of heavily conflicting packets regarding high channel traffic, which is not well addressed by the methods of successive interference cancellation (SIC) due to the stubborn loop issues. In this work, therefore, we develop a generalized deduplication (GD)-based CRDSA scheme with a compulsory divorce (CD-CRDSA) mechanism by considering the correlative properties among the accessing data from the users. In particular, the proposed mechanism could effectively separate individual packets from conflicting slots to maintain the sustainability of SIC process, thus achieve better throughput. Moreover, we make the theoretical analysis on the throughput performance with the compression gain of the proposed mechanism. The simulation results indicate that compared to the typical CRDSA protocol and the nonorthogonal multiple access (NOMA) scheme, the proposed CD-CRDSA significantly reduces the amounts of un-resolved slots and improves throughput performance, especially in high load areas.