NTNi Tian

Ni Tian

*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


Ni Tian has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Enhancing Service Function Chain Performance in SDN/NFV-Enabled Space-Air-Ground Integrated Vehicular Networks: A Three-Sided Stable Matching Approach

    by Mengqiu Tian, Xiaoming Yuan, Ni Tian, Hongwei Ding, Celimuge Wu, Zhu Han

    Leveraging network function virtualization and software-defined networking, 6G space-air-ground integrated vehicular networks (SAGIVNs) are envisioned to provide efficient and customized services on a global scale. However, on-demand resource allocation for vehicle users (VUs) remains challenging due to the rigidity of service chains, the diversity of user demands, and the complexity of network environments. Existing studies also suffer from inaccurate scene recognition and inefficient virtual resource scheduling. To address these issues, this paper proposes a scene-recognition-based on-demand resource scheduling strategy. Specifically, we first develop a scene recognition mechanism to identify VU demands by analyzing the impact of scenes. Then, the multi-criteria services of multi-dimensional resources are characterized through a polychromatic-set-based description, which supports a unified and extensible representation of heterogeneous resource attributes. Meanwhile, the on-demand matching degree is introduced to measure the satisfaction level of multi-criteria demands. Next, resources are scheduled in the form of groups to improve the efficiency of virtual resource mapping and deployment. Furthermore, a three-sided matching problem among SAGIVN equipment, VU groups, and VUs is formulated, based on which a SAGIVN-equipment-oriented resource scheduling algorithm and a VU-oriented resource scheduling algorithm are developed to achieve accurate service-demand matching. Simulation results demonstrate the superiority of the proposed schemes over benchmark methods.


  • Latency- and Quality-Efficient Human-Centric VR Video Streaming in Hybrid VLC-RF Networks

    by Long Zhang, Wenzhe Wang, Hongliang Zhang, Fang Yang, Ni Tian, Anming Dong, Jian Song, Dusit Niyato, Zhu Han

    Emerging virtual reality (VR) applications enable users to immerse themselves in an artificial world. However, the stringent requirements for ultra-high bandwidth and ultra-low latency streaming pose significant challenges to current radio frequency (RF)-based wireless networks. The convergence of visible light communication (VLC) and RF networks synergizes their complementary advantages in terms of enhanced channel capacity and ubiquitous coverage, thereby holding substantial potential for 360$^{\circ }$ VR video streaming. Moreover, the holistic integration of users' multidimensional perceptual needs of latency and video quality is critical to enhancing immersive experiences, which necessitates the human-centric design. Therefore, this paper presents a latency- and quality-efficient human-centric VR video streaming scheme over an indoor hybrid VLC-RF network. The VR video streaming issue is addressed to maximize the overall human-centric streaming utility by jointly designing the user's resolution adaptation, user association, and transmit power allocation of the VLC and RF access points. The formulated problem is a binary constrained and multi-variable coupled optimization problem, and is then decomposed into two subproblems. An overall iterative algorithm is proposed to solve these subproblems jointly. Simulation results illustrated that the proposed scheme achieves significant improvement in overall performance compared to the baselines.

  • Top Cited Papers

    Edge-Driven Industrial Computing Power Networks: Digital Twin-Empowered Service Provisioning by Hybrid Soft Actor-Critic

    by Long Zhang, Deng-Ao Song, Hongliang Zhang, Ni Tian, Zirui Zhuang, Dusit Niyato, Zhu Han

    With the proliferation of data-intensive industrial applications, the collaboration of computing powers among standalone edge servers is vital to provision such services for smart devices. In this paper, we propose an edge-driven industrial computing power network (CPN) by orchestrating the computing and network resources of edge servers through the centralized resource scheduling and decentralized task computing. However, efficient task offloading and collaborative processing is challenging, which requires higher degrees of network automation and intelligence. Therefore, we incorporate digital twins (DTs) into the edge-driven CPN architecture, where the DTs are created as the digital replicas to assist both the computation offloading and collaborative processing. A joint optimization problem of the computing power assignment, service association, task partition, and transmit power control is formulated for maximizing the system average weighted utility. Due to the temporal-spatial variability of tasks and the resulted dynamic environment, we transform the original problem as a Markov decision process aiming at maximizing the long-term average weighted utility. To efficiently handle the high-dimensional discrete-continuous action space, a hybrid soft actor-critic based deep reinforcement learning algorithm is developed for optimizing the joint design. Simulation results validate the superiority of our proposed algorithm over the benchmarks, showing the significant gains obtained by integrating DTs into the edge-driven CPN.


  • Open Access

    Decentralized Power Control for an ALOHA-Type Random Multiple Access System with Short Packet Transmission

    by Ni Tian, Changle Li, Jun Cheng, Wenwei Yue, Maofeng Luo

    Machine to machine communication is an important scenario in a 6G communication network. Random multiple access has recently been revisited and considered a key technology for machine to machine communication scenarios due to many advantages such as without coordination setup time. It is a regret that packet collision probability will be extremely higher for random multiple access when massive devices randomly accessing base station. Decentralized power control is an efficient scheme in random multiple access systems which can support intraslot successive interference cancellation to recover multiple collided packets at receivers. However, existing studies of decentralized power control for random multiple access are with the assumption that blocklength of transmitted packets is infinite, which neglects that machine to machine communication is characterized by finite blocklength transmission (i.e., short packet) in 6G. This paper focuses decentralized power control with short packet transmission in random multiple access systems. First, the closed-form expression of signal to interference plus noise ratio (SINR) threshold for short packets is derived. Then, decentralized transmission power profile is defined based on derived SINR threshold of short packets, which can support intraslot successive interference cancellation deciding at receivers for an ALOHA-type random multiple access system. Further, we propose derivation method to maximize system throughput, which can reduce optimization cost. Theoretical findings in this paper can provide valuable benchmark for short packet transmission with decentralized power control in random multiple access systems.


  • Short-Packet Transmission in Irregular Repetition Slotted ALOHA System Over the Rayleigh Fading Channel

    by Ni Tian, Xuelian Cai, Jun Cheng, Wenwei Yue, Maofeng Luo

    Random access systems are potential for Internet of Things in the future wireless communication network for its operational simplicity. Irregular repetition slotted ALOHA (IRSA) system is one of the high-efficiency random access systems. In this paper, performance analysis of the irregular repetition slotted ALOHA systems with short-packet, i.e. finite-blocklength, transmission for the quasi-static Rayleigh fading channel is given. A cumulative distribution function of signal-to-interference power ratio (SIR) is derived and thus a closed-form expression of an average packet error probability (PEP) at the SIR with short packets for the Rayleigh fading channel is given. The closed-form expression makes it possible to optimize the degree distributions at a specific blocklength in the sense that the systems give the maximum system load.