Archive

  • Select all
    |
    FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
  • FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
    Peng Liang, Wang Xiaoxiang
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    The low Earth orbit (LEO) satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment, which can provide a broader range of communication services and has become an essential supplement to the terrestrial network. However, the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing. Even worse, the harsh space environment often leads to incomplete collection of network state data for routing decision-making, which further complicates this challenge. To address this problem, this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm (SIDMRA) to maximize network efficiency even with incomplete state data as input. Specifically, we model the multipath routing problem as a markov decision process (MDP) and then combine the deep deterministic policy gradient (DDPG) and the $K$ shortest paths (KSP) algorithm to solve the optimal multipath routing policy. We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network (MPNN) for data enhancement. Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.

  • FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
    Gang Yuanshuo, Zhang Yuexia, Wu Peng, Zheng Hui, Fan Guangteng
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    Low Earth orbit (LEO) satellite networks have the advantages of low transmission delay and low deployment cost, playing an important role in providing reliable services to ground users. This paper studies an efficient inter-satellite cooperative computation offloading (ICCO) algorithm for LEO satellite networks. Specifically, an ICCO system model is constructed, which considers using neighboring satellites in the LEO satellite networks to collaboratively process tasks generated by ground user terminals, effectively improving resource utilization efficiency. Additionally, the optimization objective of minimizing the system task computation offloading delay and energy consumption is established, which is decoupled into two sub-problems. In terms of computational resource allocation, the convexity of the problem is proved through theoretical derivation, and the Lagrange multiplier method is used to obtain the optimal solution of computational resources. To deal with the task offloading decision, a dynamic sticky binary particle swarm optimization algorithm is designed to obtain the offloading decision by iteration. Simulation results show that the ICCO algorithm can effectively reduce the delay and energy consumption.

  • FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
    Wu Qi, Li Xintong, Zhu Lidong
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    Low-earth-orbit (LEO) satellite network has become a critical component of the satellite-terrestrial integrated network (STIN) due to its superior signal quality and minimal communication latency. However, the highly dynamic nature of LEO satellites leads to limited and rapidly varying contact time between them and Earth stations (ESs), making it difficult to timely download massive communication and remote sensing data within the limited time window. To address this challenge in heterogeneous satellite networks with coexisting geostationary-earth-orbit (GEO) and LEO satellites, this paper proposes a dynamic collaborative inter-satellite data download strategy to optimize the long-term weighted energy consumption and data downloads within the constraints of on-board power, backlog stability and time-varying contact. Specifically, the Lyapunov optimization theory is applied to transform the long-term stochastic optimization problem, subject to time-varying contact time and on-board power constraints, into multiple deterministic single time slot problems, based on which online distributed algorithms are developed to enable each satellite to independently obtain the transmit power allocation and data processing decisions in closed-form. Finally, the simulation results demonstrate the superiority of the proposed scheme over benchmarks, e.g., achieving asymptotic optimality of the weighted energy consumption and data downloads, while maintaining stability of the on-board backlog.

  • FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
    Zhen Pan, Zhang Bangning, Wang Heng, Ma Wenfeng, Guo Daoxing
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    The increasing demand for radio-authorized applications in the 6G era necessitates enhanced monitoring and management of radio resources, particularly for precise control over the electromagnetic environment. The radio map serves as a crucial tool for describing signal strength distribution within the current electromagnetic environment. However, most existing algorithms rely on sparse measurements of radio strength, disregarding the impact of building information. In this paper, we propose a spectrum cartography (SC) algorithm that eliminates the need for relying on sparse ground-based radio strength measurements by utilizing a satellite network to collect data on buildings and transmitters. Our algorithm leverages Pix2Pix Generative Adversarial Network (GAN) to construct accurate radio maps using transmitter information within real geographical environments. Finally, simulation results demonstrate that our algorithm exhibits superior accuracy compared to previously proposed methods.

  • FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
    Chen Nuo, Sun Zhili, Song Yujie, Cao Yue, Xia Xu, Aduwati Binti Sali
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    To support ubiquitous communication and enhance other 6G applications, the Space-Air-Ground Integrated Network (SAGIN) has become a research hotspot. Traditionally, satellite-ground fusion technologies integrate network entities from space, aerial, and terrestrial domains. However, they face challenges such as spectrum scarcity and inefficient satellite handover. This paper explores the Channel-Aware Handover Management (CAHM) strategy in SAGIN for data allocation. Specifically, CAHM utilizes the data receiving capability of Low Earth Orbit (LEO) satellites, considering satellite-ground distance, free-space path loss, and channel gain. Furthermore, CAHM assesses LEO satellite data forwarding capability using signal-to-noise ratio, link duration and buffer queue length. Then, CAHM applies historical data on LEO satellite transmission successes and failures to effectively reduce overall interruption ratio. Simulation results show that CAHM outperforms baseline algorithms in terms of delivery ratio, latency, and interruption ratio.

  • FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
    Zhu Hongtao, Wang Zhenyong, Li Dezhi, Yang Mingchuan, Guo Qing
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    The rapid development of mega low earth orbit (LEO) satellite networks is expected to have a significant impact on 6G networks. Unlike terrestrial networks, due to the high-speed movement of satellites, users will frequently hand over between satellites even if their positions remain unchanged. Furthermore, the extensive coverage characteristic of satellites leads to massive users executing handovers simultaneously. To address these challenges, we propose a novel double grouping-based group handover scheme (DGGH) specifically tailored for mega LEO satellite networks. First, we develop a user grouping strategy based on beam-limited hierarchical clustering to divide users into distinct groups. Next, we reframe the challenge of managing multiple users' simultaneous handovers as a single-objective optimization problem, solving it with a satellite grouping strategy that leverages the accuracy of greedy algorithms and the simplicity of dynamic programming. Additionally, we develop a group handover algorithm based on minimal handover waiting time to improve the satellite grouping process further. The detailed steps of the DGGH scheme's handover procedure are meticulously outlined. Comprehensive simulations show that the proposed DGGH scheme outperforms single-user handover schemes in terms of handover signaling overhead and handover success rate.

  • FEATURE TOPIC:EFFICIENT COOPERATIVE TRANSMISSION OVER SATELLITE INTERNET FOR 6G
    Xie Haoran, Zhan Yafeng, Fang Xin
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    Frequent extreme disasters have led to frequent large-scale power outages in recent years. To quickly restore power, it is necessary to understand the damage information of the distribution network accurately. However, the public network communication system is easily damaged after disasters, causing the operation center to lose control of the distribution network. In this paper, we considered using satellites to transmit the distribution network data and focus on the resource scheduling problem of the satellite emergency communication system for the distribution network. Specifically, this paper first formulates the satellite beam-pointing problem and the access-channel joint resource allocation problem. Then, this paper proposes the Priority-based Beam-pointing and Access-Channel joint optimization algorithm (PBAC), which uses convex optimization theory to solve the satellite beam pointing problem, and adopts the block coordinate descent method, Lagrangian dual method, and a greedy algorithm to solve the access-channel joint resource allocation problem, thereby obtaining the optimal resource scheduling scheme for the satellite network. Finally, this paper conducts comparative experiments with existing methods to verify the effectiveness of the proposed methods. The results show that the total weighted transmitted data of the proposed algorithm is increased by about 19.29$\sim$26.29% compared with other algorithms.

  • REVIEW PAPER
  • REVIEW PAPER
    Qin Ziao, Yin Haifan
    Abstract ( ) Download PDF ( ) HTML ( )   Knowledge map   Save

    Codebooks have been indispensable for wireless communication standard since the first release of the Long-Term Evolution in 2009. They offer an efficient way to acquire the channel state information (CSI) for multiple antenna systems. Nowadays, a codebook is not limited to a set of pre-defined precoders, it refers to a CSI feedback framework, which is more and more sophisticated. In this paper, we review the codebooks in 5G New Radio (NR) standards. The codebook timeline and the evolution trend are shown. Each codebook is elaborated with its motivation, the corresponding feedback mechanism, and the format of the precoding matrix indicator. Some insights are given to help grasp the underlying reasons and intuitions of these codebooks. Finally, we point out some unresolved challenges of the codebooks for future evolution of the standards. In general, this paper provides a comprehensive review of the codebooks in 5G NR and aims to help researchers understand the CSI feedback schemes from a standard and industrial perspective.

  • COMMUNICATIONS THEORIES & SYSTEMS
  • COMMUNICATIONS THEORIES & SYSTEMS
    Miao Wei, Dou Jianwu, Cui Yijun, Yang Zhenyu
    Abstract ( )   Knowledge map   Save
    In this paper, a physical model of RIS of bistatic polarized radar cross section is derived starting from the Stratton-Chu equations under the assumptions of physical optics, PEC, far field and rectangular RIS element. In the context of important physical characteristics of the backscattering polarization of RIS, the modeling of the RIS wireless channel requires a tradeoff between complexity and accuracy, as well as usability and simplicity. For channel modeling of RIS systems, RIS is modelled as multi-equivalent virtual base stations (BSs) induced by multi polarized electromagnetic waves from different incident directions. The comparison between test and simulation results demonstrates that the proposed algorithm effectively captures the key characteristics of the general RIS element polarization physical model and provides accurate results.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Zhang Yuchen, Xiao Sa, Wang Jianquan, Ning Boyu, Yuan Xiaojun, Tang Wanbin
    Abstract ( )   Knowledge map   Save
    In this paper, we investigate covert communications under multi-antenna detection, and explore the impacts of the warden's channel state information (CSI) availability and the noise uncertainty on system covert capability. The detection performance at warden is analyzed in two cases under the perfect and statistical CSI at warden, respectively. In particular, for the former one, the warden utilizes the likelihood ratio (LR) detector, while for the latter one, the generalized likelihood ratio (GLR) detector is adopted. We first consider the scenario where the blocklength is finite, and demonstrate that the covert rate under both cases asymptotically goes to zero as the blocklength goes to infinity. Subsequently, we take the noise uncertainty at the warden into account which leads to positive covert rate, and characterize the covert rate for infinite blocklength. Specially, we derive the optimal transmit power for the legitimate transmitter that maximizes the covert rate. Besides, the rate gap under two cases, with different CSI availability at the warden, can be presented in closed form. Finally, numerical results validate the effectiveness of our theoretical analysis and also demonstrate the impacts of the factors studied on the system covertness.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Ehsan Alemzadeh, Amir Masoud Rabiei
    Abstract ( )   Knowledge map   Save
    Non-orthogonal multiple access (NOMA) is a promising technology for the next generation wireless communication networks. The benefits of this technology can be further enhanced through deployment in conjunction with multiple-input multiple-output (MIMO) systems. Antenna selection plays a critical role in MIMO--NOMA systems as it has the potential to significantly reduce the cost and complexity associated with radio frequency chains. This paper considers antenna selection for downlink MIMO--NOMA networks with multiple-antenna basestation (BS) and multiple-antenna user equipments (UEs). An iterative antenna selection scheme is developed for a two-user system, and to determine the initial power required for this selection scheme, a power estimation method is also proposed. The proposed algorithm is then extended to a general multiuser NOMA system. Numerical results demonstrate that the proposed antenna selection algorithm achieves near-optimal performance with much lower computational complexity in both two-user and multiuser scenarios.
  • COMMUNICATIONS THEORIES & SYSTEMS
    Zhu Jinchi, Ma Xiaoyu, Liu Chang, Yu Dingguo
    Abstract ( )   Knowledge map   Save
    Recent deep neural network (DNN) based blind image quality assessment (BIQA) approaches take mean opinion score (MOS) as ground-truth labels, which would lead to cross-datasets biases and limited generalization ability of the DNN-based BIQA model. This work validates the natural instability of MOS through investigating the neuropsychological characteristics inside the human visual system during quality perception. By combining persistent homology analysis with electroencephalogram (EEG), the physiologically meaningful features of the brain responses to different distortion levels are extracted. The physiological features indicate that although volunteers view exactly the same image content, their EEG features are quite varied. Based on the physiological results, we advocate treating MOS as noisy labels and optimizing the DNN based BIQA model with early-stop strategies. Experimental results on both inner-dataset and cross-dataset demonstrate the superiority of our optimization approach in terms of generalization ability.
  • NETWORKS & SECURITY
  • NETWORKS & SECURITY
    Deng Zaihui, Li Zihang, Guo Jianzhong, Gan Guangming, Kong Dejin
    Abstract ( )   Knowledge map   Save
    Intrusion detection systems play a vital role in cyberspace security. In this study, a network intrusion detection method based on the feature selection algorithm (FSA) and a deep learning model is developed using a fusion of a recursive feature elimination (RFE) algorithm and a bidirectional gated recurrent unit (BGRU). Particularly, the RFE algorithm is employed to select features from high-dimensional data to reduce weak correlations between features and remove redundant features in the numerical feature space. Then, a neural network that combines the BGRU and multilayer perceptron (MLP) is adopted to extract deep intrusion behavior features. Finally, a support vector machine (SVM) classifier is used to classify intrusion behaviors. The proposed model is verified by experiments on the NSL-KDD dataset. The results indicate that the proposed model achieves a 90.25% accuracy and a 97.51% detection rate in binary classification and outperforms other machine learning and deep learning models in intrusion classification. The proposed method can provide new insight into network intrusion detection.
  • NETWORKS & SECURITY
    Lu Xinjin, Lei Jing, Li Wei
    Abstract ( )   Knowledge map   Save
    The physical layer key generation technique provides an efficient method, which utilizes the natural dynamics of wireless channel. However, there are some extremely challenging security scenarios such as static or quasi-static environment, which lead to the low randomness of generated keys. Meanwhile, the coefficients of the static channel may be dropped into the guard space and discarded by the quantization approach, which causes low key generation rate. To tackle these issues, we propose a random coefficient-moving product based wireless key generation scheme (RCMP-WKG), where new random resources with remarkable fluctuations can be obtained by applying random coefficient and by moving product on the legitimate nodes. Furthermore, appropriate quantization approaches are used to increase the key generation rate. Moreover, the security of our proposed scheme is evaluated by analyzing different attacks and the eavesdropper's mean square error (MSE). The simulation results reveal that the proposed scheme can achieve better performances in key capacity, key inconsistency rate (KIR) and key generation rate (KGR) compared with the prior works in static environment. Besides, the proposed scheme can deteriorate the MSE performance of the eavesdropper and improve the key generation performance of legitimate nodes by controlling the length of the moving product.
  • NETWORKS & SECURITY
    Ma Anhua, Pan Su, Zhou Weiwei
    Abstract ( )   Knowledge map   Save
    Maximize the resource utilization efficiency and guarantee the quality of service(QoS) of users by selecting the network are the key issues for heterogeneous network operators, but the resources occupied by users in different networks cannot be compared directly. This paper proposes a network selection algorithm for heterogeneous network. Firstly, the concept of equivalent bandwidth is proposed, through which the actual resources occupied by users with certain QoS requirements in different networks can be compared directly. Then the concept of network applicability is defined to express the abilities of networks to support different services. The proposed network selection algorithm first evaluates whether the network has enough equivalent bandwidth required by the user and then prioritizes network with poor applicability to avoid the situation that there are still residual resources in entire network, but advanced services can not be admitted. The simulation results show that the proposed algorithm obtained better performance than the baselines in terms of reducing call blocking probability and improving network resource utilization efficiency.
  • NETWORKS & SECURITY
    Xie Zhigang, Song Xin, Xu Siyang, Cao Jing
    Abstract ( )   Knowledge map   Save
    Recently, one of the main challenges facing the smart grid is insufficient computing resources and intermittent energy supply for various distributed components (such as monitoring systems for renewable energy power stations). To solve the problem, we propose an energy harvesting based task scheduling and resource management framework to provide robust and low-cost edge computing services for smart grid. First, we formulate an energy consumption minimization problem with regard to task offloading, time switching, and resource allocation for mobile devices, which can be decoupled and transformed into a typical knapsack problem. Then, solutions are derived by two different algorithms. Furthermore, we deploy renewable energy and energy storage units at edge servers to tackle intermittency and instability problems. Finally, we design an energy management algorithm based on sampling average approximation for edge computing servers to derive the optimal charging/discharging strategies, number of energy storage units, and renewable energy utilization. The simulation results show the efficiency and superiority of our proposed framework.
  • EMERGING TECHNOLOGIES & APPLICATIONS
  • EMERGING TECHNOLOGIES & APPLICATIONS
    Cui Huanxi, Xiao Zhenyu, Zhu Lipeng
    Abstract ( )   Knowledge map   Save
    This paper investigates the resource allocation for rate-splitting multiple access (RSMA) enabled multibeam satellite communication systems. Specifically, we minimize the total unmet user rate, which denotes the difference between the users' rate requirement and the practical achievable rate, as well as the total transmit power of the satellite by optimizing the precoding, power allocation, and rate allocation, under the per-feed power and rate constraints. To solve the non-convex optimization problem, a two-stage scheme is proposed. In particular, in the first stage, we present a precoding scheme by maximizing the signal-to-leakage-plus-noise ratio of each beam to eliminate the inter-beam interference. In the second stage, we introduce auxiliary variables to obtain an upper bound on the objective function under the given precoding matrix and transform the rate constraints of the original problem into second-order cones (SOC) and linear matrix inequations (LMI). Then, the successive convex approximation (SCA) technique is used to obtain suboptimal power and rate allocation solutions. Moreover, the initial feasible solution for power allocation is provided by using the standard interior point method. Finally, numerical results verify the superiority of our proposed solution compared to the benchmark methods in terms of objective function values.
  • EMERGING TECHNOLOGIES & APPLICATIONS
    Xue Guanchang, Yang Mingchuan, Yuan Shuai, Guo Qing, Liu Xiaofeng
    Abstract ( )   Knowledge map   Save
    In this paper, we propose a joint power and frequency allocation algorithm considering interference protection in the integrated satellite and terrestrial network (ISTN). We efficiently utilize spectrum resources by allowing user equipment (UE) of terrestrial networks to share frequencies with satellite networks. In order to protect the satellite terminal (ST), the base station (BS) needs to control the transmit power and frequency resources of the UE. The optimization problem involves maximizing the achievable throughput while satisfying the interference protection constraints of the ST and the quality of service (QoS) of the UE. However, this problem is highly non-convex, and we decompose it into power allocation and frequency resource scheduling subproblems. In the power allocation subproblem, we propose a power allocation algorithm based on interference probability (PAIP) to address channel uncertainty. We obtain the suboptimal power allocation solution through iterative optimization. In the frequency resource scheduling subproblem, we develop a heuristic algorithm to handle the non-convexity of the problem. The simulation results show that the combination of power allocation and frequency resource scheduling algorithms can improve spectrum utilization.
  • EMERGING TECHNOLOGIES & APPLICATIONS
    Ding Qingfeng, Wang Song, Fu Tingmei, Xi Tao
    Abstract ( )   Knowledge map   Save
    In high-speed railway (HSR) wireless communication, the rapid channel changes and limited high-capacity access cause significant impact on the link performance. Meanwhile, the Doppler shift caused by high mobility leads to the inter-carrier interference. In this paper, we propose a reconfigurable intelligent surface (RIS)-assisted receive spatial modulation (SM) scheme based on the spatial-temporal correlated HSR Rician channel. The characteristics of SM and the phase shift adjustment of RIS are used to mitigate the performance degradation in high mobility scenarios. Considering the influence of channel spatial-temporal correlation and Doppler shift, the effects of different parameters on average bit error rate (BER) performance and upper bound of ergodic capacity are analyzed. Therefore, a joint antenna and RIS-unit selection algorithm based on the antenna removal method is proposed to increase the capacity performance of communication links. Numerical results show that the proposed RIS-assisted receive SM scheme can maintain high transmission capacity compared to the conventional HSR-SM scheme, whereas the degradation of BER performance can be compensated by arranging a large number of RIS-units. In addition, selecting more RIS-units has better capacity performance than activating more antennas in the low signal-to-noise ratio regions.
  • EMERGING TECHNOLOGIES & APPLICATIONS
    S. Leones Sherwin Vimalraj, J. Lydia
    Abstract ( )   Knowledge map   Save
    Wireless Sensor Network (WSN) comprises a set of interconnected, compact, autonomous, and resource-constrained sensor nodes that are wirelessly linked to monitor and gather data from the physical environment. WSNs are commonly used in various applications such as environmental monitoring, surveillance, healthcare, agriculture, and industrial automation. Despite the benefits of WSN, energy efficiency remains a challenging problem that needs to be addressed. Clustering and routing can be considered effective solutions to accomplish energy efficiency in WSNs. Recent studies have reported that metaheuristic algorithms can be applied to optimize cluster formation and routing decisions. This study introduces a new Northern Goshawk Optimization with boosted coati optimization algorithm for cluster-based routing (NGOBCO-CBR) method for WSN. The proposed NGOBCO-CBR method resolves the hot spot problem, uneven load balancing, and energy consumption in WSN. The NGOBCO-CBR technique comprises two major processes such as NGO based clustering and BCO-based routing. In the initial phase, the NGO-based clustering method is designed for cluster head (CH) selection and cluster construction using five input variables such as residual energy (RE), node proximity, load balancing, network average energy, and distance to BS (DBS).
    Besides, the NGOBCO-CBR technique applies the BCO algorithm for the optimum selection of routes to BS. The experimental results of the NGOBCO-CBR technique are studied under different scenarios, and the obtained results showcased the improved efficiency of the NGOBCO-CBR technique over recent approaches in terms of different measures.