CDCui-Qin Dai

Cui-Qin Dai

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Cui-Qin Dai has a total of 46 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Task-Oriented 6G Native-AI Network Architecture

    by Yang Yang, Jianjun Wu, Tianjiao Chen, Chenghui Peng, Jun Wang, Juan Deng, Xiaofeng Tao, Guangyi Liu, Wenjing Li, Li Yang, et al.

    The vision for 6G networks is to offer pervasive intelligence and internet of intelligence, in which the networks natively support artificial intelligence (AI), empower smart applications and scenarios in various fields, and create a "ubiquitous-intelligence" world. In this vision, the traditional session-oriented architecture cannot achieve flexible per-user customization, ultimate performance, security and reliability required by future AI services. In addition, users’ requirements for personalized AI services may become a key feature in the near future. However, the traditional AI deployment based on cloud/mobile edge computing (MEC) has limitations such as low throughput, long delay, poor privacy, and high carbon emissions, resulting in the inability to provide personalized quality of experience (QoE) assurance. By integrating AI in the network, the network AI has more advantages than cloud/MEC AI, such as better QoS assurance, lower latency, less transmission and computing overhead, and stronger security and privacy. Therefore, this article proposes the task-oriented native-AI network architecture (TONA), to natively support the network AI. By introducing task control and quality of AI services (QoAIS) assurance mechanisms at the control layer of 6G, the TONA can achieve the finest service granularity at the task level for guaranteeing every user’s personalized QoE.


  • Dynamic Scheduling Scheme With Task Laxity for Data Relay Satellite Networks

    by Cui-Qin Dai, Yu Zhang, Fei Richard Yu, Qianbin Chen

    With the increase of spacecrafts, data relay satellite network (DRSN) plays an essential role in the space task transmission and processing through broad coverage and efficient information distribution of data relay satellites. However, the growing demand of space tasks and the limited number of satellite antenna lead to the conflicts between high-priority unpredictable tasks and common tasks with timely processing requirements, which further result in the decreasing scheduling efficiency of space tasks. In this paper, a dynamic scheduling scheme with task laxity (DSTL) is proposed to solve scheduling conflicts and enhance scheduling efficiency. Firstly, a task model in visible time window is analyzed according to the processing time limit of tasks and the intermittent connection nature of satellites under a constructed DRSN model. After that, the task laxity is defined by the deadline and execution time of tasks to judge the urgency of tasks, and the optimization problem is formulated to maximize the number of tasks and prioritize high priority tasks by calculating task laxity. Then, the DSTL scheme is designed via four stages, which are task preprocessing, task-resource matching, task-conflict assessment, task-resource updating. In DSTL, a task sorting method with task laxity is raised to arrange the priority of tasks; an urgent task scheduling algorithm (UTS) is put forward to prioritize unpredictable tasks; a task-conflict resolution algorithm (TCR) is brought up to assess conflicting tasks and reschedule them. Following that, an adaptive large neighborhood search algorithm combined with deadline-aware scheduling (ALNS-DAS) is presented to obtain the optimal scheduling scheme, which has the maximum number of completed tasks. The simulation results show that the DSTL can maximize the guarantee ratio of completed tasks and ensure timely processing with the increase of tasks demand.


  • Distributed User Association With Grouping in Satellite–Terrestrial Integrated Networks

    by Cui-Qin Dai, Shipeng Li, Jinsong Wu, Qianbin Chen

    The satellite–terrestrial integrated network (STIN) has been envisioned as an emerging architecture to provide global anytime anywhere network access, and satisfy transmission requirements of high-capacity backhaul data. However, the integration of satellite and terrestrial networks will aggravate the diversity of base stations (BSs) in backhaul delay and capacity, as well as coverage area, which makes it difficult for users with diverse requirements to access the most suitable service BS. As an effort to address the above problems, a distributed user association with grouping (DUAG) mechanism is proposed via the interaction between BSs and users to maximize the sum rate and balance the load of STIN while meeting the user’s demand by user grouping. First, the transmission characteristics of terrestrial and backhaul links are analyzed after constructing a STIN model, which consists of satellite, three types of BSs, and the variety of intelligent terminals. Then, the user association problems are formulated to maximize the sum rate and balance the load of STIN via jointly considering the backhaul capacity of BSs and mobility and delay of users. Meanwhile, the DUAG mechanism is proposed to associate users with the most suitable service BSs. In DUAG, a greedy-based user association algorithm with user grouping is developed for maximizing the sum rate via giving priority to users with high data rate, and a matching algorithm with user grouping is designed for balancing the load by means of performing multiple iterations between users and BSs. Simulation results demonstrate that the proposed DUAG can maximize the sum rate and balance the load of STIN while guaranteeing the delay demand of user with the increase of user density.


  • Dynamic Scheduling for Emergency Tasks in Space Data Relay Network

    by Cui-Qin Dai, Chong Li, Shu Fu, Jian Zhao, Qianbin Chen

    As a platform for data transmission, space data relay network (SDRN), which has high coverage and continuous communications, provides data relay services for the space-crafts and satellites by allocating antenna resource. However, the diversity between emergency tasks and common tasks for antenna requirements may result in the conflicts of resource occupation. This leads to the loss of emergency information and the low scheduling efficiency. In this paper, a real-time dynamic scheduling (RTDS) scheme is proposed to ensure the transmission of emergency tasks and improve the scheduling efficiency by scheduling sequence adjustment and task management. Firstly, the relative SDRN system models are given and a dynamic scheduling mechanism is designed to deal with the disturbance factors during the scheduling process. Then, based on the dynamic scheduling mechanism, the RTDS scheme is implemented in three stages, which include initial scheduling, dynamic scheduling for emergency tasks, and final scheduling. The simulation results demonstrate that the proposed RTDS scheme can guarantee the timely transmission of emergency tasks and enhance the scheduling efficiency compared with the existing scheduling algorithms.


  • Dynamic User Association for Resilient Backhauling in Satellite–Terrestrial Integrated Networks

    by Cui-Qin Dai, Junfeng Luo, Shu Fu, Jinsong Wu, Qianbin Chen

    The satellite–terrestrial integrated networks (STINs) have gradually become a new class of effective ways to satisfy the requirements of a higher capacity and stronger connection in the future communications. In contrast with terrestrial networks, the fast periodic motion of satellites results in the dynamic time-varying features of STIN, which further leads to frequent changes in the connectivity of satellite–terrestrial links and the backhaul capacities of satellite networks. To balance the accessible capacity of STIN under the intermittent connectivity and dynamic backhaul capacity, an effective user association mechanism is needed. In this article, a dynamic user association (DUA) mechanism with task classification is proposed to meet the requirements of load balancing and the user task processing. First, a STIN model is constructed with low earth orbit satellites and the three types of base station, which are a macro base station, small cell base station, and low earth orbit based base station. After that, the optimization problem is formulated via jointly considering the task classification, the load condition of base stations, and the backhaul capacity of low earth orbit based base stations. Then, the DUA mechanism is proposed to find the most suitable base station serving each user. In DUA, a dynamic cell range extension algorithm is developed to adjust the load of STIN in terms of the resilient backhaul capacity, and a greedy-based user-centric user association with task classification algorithm is proposed to find the base station, which has the maximum rate and minimum load for each user and to meet the requirements of user task processing. The simulation results show that the proposed DUA can enhance the load balance and guarantee the task processing demand of STIN compared with the reference signal receiving power association and the max-sum rate association algorithms.


  • QoE-Aware Intelligent Satellite Constellation Design in Satellite Internet of Things

    by Cui-Qin Dai, Mingjian Zhang, Chong Li, Jian Zhao, Qianbin Chen

    In satellite Internet of Things (SIoT), satellite constellation design is used to satisfy more communication demands with fewer satellites by optimizing satellite orbits in specific areas. However, the diversity of user demands and satellite resource poses a great challenge in evaluating the quality of experience (QoE) of satellite constellation. In this paper, a QoE-aware satellite constellation design scheme is proposed to enhance the user satisfaction by constructing QoE factors. Firstly, a SIoT network model is established with low-earth-orbit (LEO) satellites and ground Internet of Things (IoT) devices, and the problem is formulated to calculate the QoE for different areas after analyzing the dynamic network topology. Then, the QoE factors are defined to assess QoE by taking into account the coverage performance, communication fluency, regional demand capacity and profitability. Following that, an intelligent optimization algorithm named multi-layer tabu search (MLTS) is designed to obtain reasonable satellite orbits with the best QoE, which provides orbit parameters for satellite constellation configuration. The simulation results demonstrate that the designed satellite constellation can effectively improve the users QoE by optimizing the various QoE factors.


  • Service‐oriented routing with Markov space‐time graph in low earth orbit satellite networks

    by Cui‐Qin Dai, Guangyan Liao, Qianbin Chen

    Low earth orbit (LEO) satellite network has been more and more widely used because of its advantages of low delay, low overhead, and flexible networking. However, the reliability and effectiveness of data transmission are affected by the specific characteristics of LEO satellite networks (LSN), such as time‐varying topology, uneven distribution of service demands, and multiple types of service. In this article, a service‐oriented routing with Markov space‐time graph (SOR‐MSG) in LSN is proposed to improve the reliability and effectiveness of information transmission. First, for the time‐varying topology, a Markov space‐time graph (MSG) model is constructed by calculating the connectivity time and connectivity probability between satellite node states. Then, in light of the uneven distribution of service demands, the space‐time factor (STF) is defined to balance the network load by scheduling the intersatellite link with lower loads. After that, we formulate the general routing problem caused by different quality of service (QoS) requirements for multimedia services and uneven load distribution and propose a multi‐QoS optimization objective function according to delay, remaining bandwidth, packet loss rate, and STF. Following this, based on the established MSG, the state transition rule and pheromone updating rule are optimally adjusted to select the next hop node, so as to finally determine the best information transmission path. Finally, the simulation results show that the SOR‐MSG algorithm can not only adapt to dynamically changing topologies and meet multiservice QoS requirements but also well balance the network load.


  • Reverse Auction for Cloud-Based Traffic Offloading in Hybrid Satellite-Terrestrial Networks

    by Cui-Qin Dai, Lan Jin, Qianbin Chen

    The hybrid satellite-terrestrial networks (HSTNs) are expected to support extremely high traffic demands. In HSTN, cellular cells and satellite network are operated by the mobile network operator (MNO) and the satellite network operator respectively, traffic offloading strategies need to be designed via jointly considering the throughput of HSTN and economic profits of MNO. In this paper, a reverse auction with cell grouping (RA-CG) scheme is proposed for cloud-based traffic offloading in HSTN. Firstly, a HSTN model is constructed and the problem of co-channel interference is analyzed. Then, an auction model is adopted to analyze the economic profits of traffic offloading in HSTN, and the optimization problem is formulated to maximize the profits of MNO. Following that, a Hungarian-based reverse auction (HRA) algorithm is designed to find the optimal cell-satellite association solution in terms of the economic profits within each interference-free group, which is obtained by a cell grouping method. Simulation results show that the proposed RA-CG scheme can not only maximize the profits of MNO and improve the network offloading rate, but also achieve higher spectrum efficiency.


  • Multi-service Routing with Guaranteed Load Balancing for LEO Satellite Networks

    by Cui-Qin Dai, Guangyan Liao, P. Takis Mathiopoulos, Qianbin Chen