This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Performance Analysis for Downlink Transmission in Multi-Connectivity Cellular V2X Networks

Luofang Jiao, Member, IEEE, Jiwei Zhao, Member, IEEE, Yunting Xu, Member, IEEE, Tianqi Zhang, Member, IEEE, Haibo Zhou, Senior Member, IEEE and Dongmei Zhao, Senior Member, IEEE
This work is supported in part by the National Natural Science Foundation Original Exploration Project of China under Grant 62250004, the National Natural Science Foundation of China under Grant 62271244, the Natural Science Fund for Distinguished Young Scholars of Jiangsu Province under Grant BK20220067, the High-level Innovation and Entrepreneurship Talent Introduction Program Team of Jiangsu Province under Grant JSSCTD202202. L. Jiao, J. Zhao, Y. Xu, T, Zhang, and H. Zhou (Corresponding author) are with the School of Electronic Science and Engineering, Nanjing University, Nanjing 210023, China (e-mail: luofang_jiao@smail.nju.edu.cn; jw_zhao@smail.nju.edu.cn; yuntingxu@smail.nju.edu.cn; tianqizhang@smail.nju.edu.cn; haibozhou@nju.edu.cn). D. Zhao is with the Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON L8S 4L, Canada (e-mail: dzhao@mcmaster.ca). Copyright (c) 2023 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending a request to pubs-permissions@ieee.org.
Abstract

With the ever-increasing number of connected vehicles in the fifth-generation mobile communication networks (5G) and beyond 5G (B5G), ensuring the reliability and high-speed demand of cellular vehicle-to-everything (C-V2X) communication in scenarios where vehicles are moving at high speeds poses a significant challenge. Recently, multi-connectivity technology has become a promising network access paradigm for improving network performance and reliability for C-V2X in the 5G and B5G era. To this end, this paper proposes an analytical framework for the performance of downlink in multi-connectivity C-V2X networks. Specifically, by modeling the vehicles and base stations as one-dimensional Poisson point processes, we first derive and analyze the joint distance distribution of multi-connectivity. Then through leveraging the tools of stochastic geometry, the coverage probability and spectral efficiency are obtained based on the previous results for general multi-connectivity cases in C-V2X. Additionally, we evaluate the effect of path loss exponent and the density of downlink base station on system performance indicators. We demonstrate through extensive Monte Carlo simulations that multi-connectivity technology can effectively enhance network performance in C-V2X. Our findings have important implications for the research and application of multi-connectivity C-V2X in the 5G and B5G era.

Index Terms:
C-V2X, multi-connectivity, coverage probability, spectral efficiency, stochastic geometry.

I Introduction

With the evolution of the fifth-generation mobile communication networks (5G) and beyond 5G (B5G), reliable and high-performance wireless communication systems have become essential to fully exploit the potential of intelligent transportation systems (ITS) [1, 2, 3]. Cellular vehicle-to-everything (C-V2X) has emerged as a promising technology that utilizes the existing cellular network infrastructure and spectrum to provide efficient and reliable communication between vehicles (V2V), as well as between vehicles and other network entities such as base stations (BS), roadside units, pedestrians, and cloud servers (V2I) [4]. This technology aims to enhance the efficiency and safety of vehicular traffic while enabling various applications such as collision avoidance, traffic management, cooperative driving, platooning, and autonomous driving, that require high-speed and low-latency communication in ITS [5, 6]. However, as the number of connected vehicles continues to increase, C-V2X is rapidly developing towards ultra-dense, whcih poses challenges such as interference management, security, and energy efficiency, and require further research and development to enable reliable and efficient vehicular communication. C-V2X also faces significant challenges due to the high-speed mobility and dynamic topology of vehicles, which may cause rapid fluctuations in the quality of wireless links, frequent handovers, and increased signaling overhead. These challenges is severely impacting the communication performance and influence the quality of experience (QoE) and quality of service (QoS) of ITS applications.

In recent years, multi-connectivity technology has attracted significant attention to address these aforementioned challenges [7]. Multi-connectivity enables a vehicle to establish multiple simultaneous connections with different BSs using various radio access technologies (RATs), access points (APs), or channels, thus taking advantage of the diversity and availability of wireless resources in the cellular network [3]. The multi-connectivity technology, as compared to the traditional point-to-point communication, offers substantial advantages in terms of various communication performance metrics, e.g., enhanced reliability[8], improved coverage [9], and enabled seamless mobility and handover[10]. Through accessing multiple BSs, vehicles can switch between available connections without disrupting ongoing communication, providing uninterrupted connectivity even when moving across network boundaries or transiting under different coverage of networks. In additions, based on the specific requirements of the application or user preferences, multi-connectivity is capable of offering flexibility for choosing the most suitable network connections and providing better spectral efficiency by dynamic adaptation to changing network conditions[11]. Thus, applying multi-connectivity to C-V2X is of remarkable significance for improving communication performance and makes it more suitable for ITS applications.

In the context of multi-connectivity in C-V2X, coverage probability and spectral efficiency are two important performance metrics for evaluating wireless communication system performance [9]. However, establishing a comprehensive analytical framework with regard to these performance metrics is challenging and holds significant academic importance. following a spatial point process [12, 13]. System modeling and analytical performance evaluation based on stochastic geometry have proven to be a powerful method for monitoring the effects of important system parameters as well as optimizing system configurations, all without the need for computationally expensive and resource-intensive computer simulations [14]. Moreover, there is a research gap in the analysis of uplink and downlink performance for multi-connectivity C-V2X communication. While most of the existing studies primarily focused on the uplink transmission and performance optimization [9, 15], the downlink transmission based on an analytical framework has not been sufficiently explored. This is a significant limitation since downlink transmission plays a crucial role in supporting various ITS applications that rely on receiving downlink information from infrastructures. Therefore, conducting in-depth studies on the downlink performance of multi-connectivity C-V2X communication is substantial for filling this existing gap and ensuring a holistic analysis of the system’s capabilities for supporting diverse ITS applications.

Therefore, this paper considers multi-connectivity as an effective solution to resolve the challenges faced by C-V2X communication, aiming to enhance the communication performance for ITS applications. A feasible analytical framework for downlink transmission in multi-connectivity C-V2X networks is proposed by modeling the vehicles and downlink base stations (DBSs) as one-dimensional (1-D) Poisson point processes (PPPs), the tools of stochastic geometry are used to derive crucial performance indicators, including joint distance distribution, coverage probability, and spectral efficiency. The key contributions of this paper are summarized below:

  • We present a novel multi-connectivity performance analytical framework for C-V2X, which enables the evaluation of network performance in the 5G/B5G era. This framework provides a foundation for further research and potential performance improvement of multi-connectivity technology in C-V2X systems.

  • We derive precise expressions of coverage probability and spectral efficiency for general multi-connectivity cases in C-V2X based on the joint distance distribution. We also provide important insights into the design and optimization of C-V2X networks by analyzing the effect of path loss exponent and DBS density on system performance indicators.

  • We conduct comprehensive Monte Carlo simulations to confirm the effectiveness of the presented multi-connectivity performance analytical framework, which shows that multi-connectivity technology can significantly improve network performance in C-V2X. This finding has important implications for the practical applications of multi-connectivity C-V2X in the 5G/B5G era.

The subsequent sections of this paper are structured as follows. We briefly introduce the existing research works related to our work in Section II. Section III presents the proposed framework for analyzing multi-connectivity performance. Section IV conducts a performance analysis of the system, including the joint distance distribution, coverage probability and spectral efficiency. In Section V, the simulation setup and results obtained from extensive Monte Carlo simulations are presented, providing verification of the proposed framework and evaluation of the system performance. Section VI presents the concluding remarks of this paper.

II Related work

The adoption of C-V2X has emerged as a critical network paradigm for enabling vehicular communication with other vehicles and the infrastructure, offering diversified safety and efficiency applications for ITS [16]. However, despite of its significant potential, the implementation of C-V2X communication is confronted with numerous challenges, such as high mobility, dynamic topology, heterogeneous network, and stringent QoS requirements [12]. In high-speed C-V2X scenarios, single connectivity with just one base station frequently leads to handover issues [9, 7], resulting in a rapid decline in communication speed and reliability, thus no longer meeting C-V2X’s QoS requirements. In recent years, multi-connectivity has been considered to be a promising technology to tackle these challenges in C-V2X through enhancing reliability, reducing latency, and boosting overall network performance.

With multiple BSs access, multi-connectivity supports seamless mobility and handover between different BS coverage. Exploiting simultaneous connections, multi-connectivity offers considerable availability for the improvement of spectral efficiency [17]. A number of studies have investigated the potential benefits of applying multi-connectivity in C-V2X and wireless networks. Numerous studies have delved into the potential advantages of implementing multi-connectivity within C-V2X and wireless networks. These investigations cover various aspects, ranging from resource optimization in C-V2X multi-connectivity to performance analyses in wireless networks.

In the context of C-V2X, some studies concentrate on optimizing communication resources. Rabitsch et al. [8] explored multi-connectivity algorithms tailored to meet the stringent requirements for communication availability and latency in V2I networks. Lu et al. [7] introduced a novel approach to reduce duplication rates in DBSs in fully-decoupled C-V2X networks. They achieved this by formulating and solving optimization problems using Lyapunov stochastic optimization techniques to help vehicles select access BSs for multi-connectivity and optimize bandwidth resources to meet user communication requirements. Kousaridas et al. [18] analyzed multi-connectivity management in a Manhattan model for V2X communication.

Other studies aim to evaluate the performance of multi-connectivity in both wireless networks and C-V2X scenarios. Moltchanov et al. [19] provided a closed-form upper bound on the probability density function (PDF) for multi-connectivity, shedding light on its statistical characteristics. Weedage et al. [3] scrutinized the downlink performance of multi-connectivity in wireless networks. Wu et al. [9] proposed a multi-connectivity scheme for uplink C-V2X communications, deriving precise expressions for the outage probability using stochastic geometry tools.

Numerous performance metrics have been employed in research works that explore the application of multi-connectivity technology in cellular communication scenarios. In 5G and beyond 5G networks, Sylla et al. [20] provided a comparable cellular communication analysis for multi-connectivity. Pupiales et al. [2] focused on the multi-connectivity architectures and protocols for 5G network and they described the different network entities and protocol layers involved in multi-connectivity, such as multi-connectivity coordinator, multi-connectivity agent, multi-connectivity manager and packet data. Petrov et al. [21] studied the dynamic characteristics of multi-connectivity technology, whereas Giordani et al. [22] investigated its application in 5G mmWave cellular networks.

In this paper, we mainly focus on the performance indicator of coverage probability and spectral efficiency based on distance distribution. Coverage probability and spectral efficiency are two of the most important metrics that hold significance for evaluating the wireless networks. Firstly, coverage probability determines the reliability of C-V2X communication in different geographical areas and network densities [13]. By leveraging multi-connectivity technology, the coverage probability can be improved and the risk of communication interruptions can be reduced. With multiple connections simultaneously receiving and transmitting data, even if one connection encounters interruption issues, the others can maintain communication, thereby enhancing overall coverage probability. Secondly, spectral efficiency is extremely crucial for the transmission capacity of C-V2X. C-V2X communication involves handling a substantial amount of traffic-related information, including vehicle sensor data and traffic management instructions [23]. Additional spectrum resources can be utilized in parallel or through multiplexing, thus improving spectral efficiency to support higher data transmission rates and faster response times through multi-connectivity [24]. Further improvements in coverage probability and spectral efficiency can be achieved by optimizing load balancing and resource allocation among the connections. Research in this area is of paramount importance to achieve efficient and reliable C-V2X communication, providing a more robust and efficient foundation for critical applications such as real-time vehicle communication, traffic management, and vehicular safety in ITS.

To obtain the exact analytical expression of performance metrics for multi-connectivity in C-V2X, leveraging the tools of stochastic geometry is regarded as an efficient approach and it has been increasingly popular in recent years for the performance analysis in multi-connectivity scenarios. For instance, Moltchanov et al. [19] were among the pioneers in deriving the PDF for multi-connectivity, laying essential groundwork for further investigations. Building upon this foundation, Kibria et al. [25] assessed the viability of employing dual connectivity and coordinated multiple points (CoMP) transmission in wireless communication systems, expanding the scope of multi-connectivity applications.

Moreover, the utilization of stochastic geometry in various multi-connectivity scenarios has witnessed extensive exploration. Shafie et al. [24] explored multi-connectivity in indoor communication systems using ultra-wideband terahertz (THz) technology, focusing on average ergodic capacity and connectivity likelihood. Chen et al. [12] employed coordinated multipoint techniques to enhance spectral efficiency, while Giordani et al. [22] and Kamble et al. [26] aimed to optimize the Signal-to-Interference-Plus-Noise Ratio (SINR) and outage probability in single-frequency networks. Weedage et al. [3] delved into the analysis of channel capacity and outage probability in wireless networks’ downlink scenarios.

III SYSTEM MODEL

When analyzing the overall performance of a multi-connectivity C-V2X network, a specific vehicle is considered as a typical analysis object. Therefore, the multiple roads model can still be simplified and analyzed as a single road situation. Moreover, it has been proven that the single road model can effectively reflect the performance of multi-connectivity in C-V2X [9, 7]. Therefore, to investigate the downlink multi-connectivity in C-V2X scenario, we introduce a simplified 1-D system model in this paper. A coordination scheme called Single Frequency Networks (SFN) as in [27] are leveraged for spectrum allocation. SFN enables the transmission of incoherent joint signals on the same radio resources in frequency and time, which requires BSs to coordinate when creating signals and to strictly synchronize their timing. Our focus in this paper is on the intra-frequency multi-connectivity, which requires simultaneous transmission of multiple DBSs operating at the same carrier frequency to the same vehicle. This is an important issue to address in the C-V2X scenario, where high data rates and reliable communication are need for safety-critical applications. The following of this section introduces the channel model, association policy, interference model, and performance metrics utilized in this study. Table I lists the key symbols used throughout this paper.

III-A Modeling of C-V2X Network

Fig. 1 shows the downlink multi-connectivity scenario in C-V2X networks. The vehicles are randomly distributed on an urban freeway segment, and the DBSs are densely distributed along the road. To simplify the analysis, we make the assumption that both the DBSs and vehicles utilize a single antenna, and denote the height difference between the antenna of the DBS and the vehicle as hh.

Refer to caption

Figure 1: An example of a practical 1-D scenario for downlink transmission in multi-connectivity C-V2X is illustrated. In this scenario, the target vehicle receives messages from the three closest DBSs, while transmissions from DBSs located beyond the collaboration distance can lead to interference to the target vehicle.
TABLE I: A LIST OF MAJOR SYMBOLS
Notation Description
λ\lambda; xix_{i} The density of the vehicles and DBSs on a 1-D road; The distance of iith nearest DBS to the typical vehicle.
PdP_{d}; αd\alpha_{d} The transmit power of DBS; The downlink path loss exponent parameter.
gdg_{d}; χd{\chi_{d}} The channel gain between the DBS and vehicle; The Nakagami-m fading gain.
τD\tau_{D} ; μ\mu The spectral efficiency of downlink; The mean of exponential function.
ωd\omega_{d}; δd2\delta_{d}^{2} The mean of the logarithm of χd\chi_{d}; The variance of the logarithm of χd\chi_{d}.
φV,φD{\varphi_{V}},\varphi_{D} The Poisson point processes of vehicles and DBSs.
φDt\varphi_{D}^{t}; tt The DBSs set after being executed random displacement; The predetermined threshold tt of coverage probability.
φc\varphi_{c}; ΘId\Theta_{I}^{d} The collaborative DBS set of multi-connectivity; The interference DBS set of multi-connectivity.
IdI_{d}; σd2\sigma_{d}^{2} The received interference of the typical vehicle; The noise of channel.
𝔼()\mathbb{E}\left(\cdot\right) The expectation of a random variable.
()\mathbb{P}\left(\cdot\right) The probability of a random variable.
F()F\left(\cdot\right) The cumulative distribution function of a random variable.
f()f\left(\cdot\right) The probability density function of a random variable.
ζI()\zeta_{I}\left(\cdot\right) The Laplace transform of interference II.
Γ()\Gamma\left(\cdot\right) The gamma distribution function of a random variable.

For the tractability of the downlink performance analysis, we consider a 1-D scenario on a road including vehicles, DBSs, and interference DBSs as shown in Fig. 1, as in [9, 6]. From a statistical perspective, the spatial distributions of vehicles and DBSs conform to 1-D PPP distributions [13], and we use the 1-D PPPs φV,φD{\varphi_{V}},\varphi_{D} with density λv,λd{\lambda_{v}},\lambda_{d} to denote the locations of vehicles and DBSs on the road, respectively, where φV,φD{\varphi_{V}},\varphi_{D} can be expressed as

φj={xi,jR2:i+},j={V,D}.\displaystyle\varphi_{j}\mathop{=}\limits^{\bigtriangleup}\left\{x_{i,j}\in R^{2}:i\in\mathbb{N}_{+}\right\},j=\left\{V,D\right\}.

All of the vehicles and DBSs are distributed along a road with length ll. As per Slivnyak’s theorem, the distribution of point processes remains unchanged even after adding a node at the origin [28], and in order not to lose generality and eliminate segmentation due to boundary effects, we place the typical vehicle at the origin vo=(0,0)v_{o}=(0,0), i.e. which represents the center of the road [9].

In relation to the formation of virtual cells, we assume that each vehicle is connected to the nn nearest DBSs on a Euclidean plane. The 1-D distance between the typical vehicle vov_{o} with the ii-th (ini\leq n) DBS is rir_{i}, thus the actual distance xix_{i} between the transmit antenna of DBS to receive antenna of the typical vehicle is

xi=ri2+h2.x_{i}=\sqrt{r_{i}^{2}+h^{2}}. (1)

We adopt a common power-law pathloss and Rayleigh fading model with a decay rate of xαdx^{-\alpha_{d}}, where xx denotes the distance between the DBS and the typical vehicle. The downlink pathloss exponent parameter is denoted as αd\alpha_{d} (αd>2)(\alpha_{d}>2). gdg_{d} is used to denote the power gain of Rayleigh fading and it is modeled by an exponential distribution with a mean of 1/μ1/\mu. Therefore, we have gdexp(μ)g_{d}\sim exp\left(\mu\right). The distribution function of gdg_{d} is

f(gd)=μeμgd.\displaystyle f\left(g_{d}\right)=\mu e^{-\mu g_{d}}. (2)

Furthermore, we use random variable χd{\chi_{d}} to model the effects of shadowing between the DBS and the typical vehicle in the downlink, and χd{\chi_{d}} follows a log-normal distribution given by 10log10χd(ωd,δd2)10log_{10}\chi_{d}\sim\aleph\left(\omega_{d},\delta_{d}^{2}\right), where ωd\omega_{d} represents the mean of the logarithm of χd\chi_{d} (i.e., the geometric mean of χd\chi_{d}), while δd2\delta_{d}^{2} represents the variance of the logarithm of χd\chi_{d} [29]. Hence, the received signal power of the typical vehicle from the ii-th DBS in the downlink is [30]

Pr,v(xi)=Pdgdχdxiαd,iφD,P_{r,v}(x_{i})={{P_{d}}{g_{d}}{\chi_{d}}{{x_{i}}^{-{\alpha_{d}}}},}~{i\in{\varphi_{D}}}, (3)

where PdP_{d} is the transmitting power of the DBS and assumed to be the same for all DBSs.

III-B Association policy

The typical vehicle is assumed to be connected to nn nearest DBSs by measuring all the receiving power from the nearby DBSs, finding the DBSs with the maximum receiving power (MRP) in turn [9]. Since the received power Pr,vP_{r,v} is not exponentially distributed for the modeling of the shadow fading [16], the lemma of random displacement theorem is considered to solve this issue [31]. Thus, Pr,v(xi)=PdgdχdxiαdP_{r,v}(x_{i})={P_{d}}{g_{d}}{\chi_{d}}{{x_{i}}^{-{\alpha_{d}}}} can be transformed to Pr,v(yi)=PdgdyiαdP_{r,v}(y_{i})={P_{d}}{g_{d}}{{y_{i}}^{-{\alpha_{d}}}}, where yi=χd1αdxiy_{i}={\chi_{d}^{-\frac{1}{\alpha_{d}}}}x_{i}. The 1-D PPP transformed converges to a 1-D homogeneous PPP and the intensity λd\lambda_{d} is transformed to E[χd1αd]λdE\left[{\chi_{d}^{-\frac{1}{\alpha_{d}}}}\right]\lambda_{d}, and the intensity of the 2-D PPP is E[χd2αd]λdE\left[{\chi_{d}^{-\frac{2}{\alpha_{d}}}}\right]\lambda_{d} after executing the procedure of random displacement [13]. Specifically, E[χd1αd]λE\left[{\chi_{d}^{-\frac{1}{\alpha_{d}}}}\right]\lambda can be calculated as

𝔼[χd1αd]λd=exp(ωdln1010αd+12(σdln1010αd)2)λd.\displaystyle\mathbb{E}\left[{{\chi_{d}^{-\frac{1}{\alpha_{d}}}}}\right]\lambda_{d}=\exp\left({\frac{{\omega_{d}\ln 10}}{{10\alpha_{d}}}+\frac{1}{2}{{\left({\frac{{\sigma_{d}\ln 10}}{{10\alpha_{d}}}}\right)}^{2}}}\right)\lambda_{d}. (4)

Then we use 1-D PPP φDt\varphi_{{}_{D}}^{t} to denote the transformed set of DBS and λD=E[χ1αd]λd\lambda_{D}=E\left[{\chi^{-\frac{1}{\alpha_{d}}}}\right]\lambda_{d} denotes the transformed DBS intensity. To facilitate performance analysis in the following sections, we use the symbol φDt,d\varphi_{D}^{t,d} to denote the set of distances between the DBSs and the typical vehicle,

φDt,d={x1,x2,,xi},i+,\displaystyle\varphi_{D}^{t,d}=\{x_{1},x_{2},\dots,x_{i}\},i\in\mathbb{N}_{+}, (5)

where xix_{i} denotes the distance between the typical vehicle vov_{o} and the ii-th nearest DBS φDt\in\varphi_{D}^{t}. Thus the candidate serving DBSs is changed to the nn nearest DBSs φDt\in\varphi_{D}^{t} in turn, and this can be expressed as

xi=argmaxxiφDt,d\φcdxiαd,i>m\displaystyle x_{i}=\mathop{\arg\max}\limits_{x_{i}\in{\varphi_{D}^{t,d}\backslash\varphi_{c}^{d}}}x_{i}^{-{\alpha_{d}}},i>m (6)

where we use φcd={x1,x2,,xm}\varphi_{c}^{d}=\{x_{1},x_{2},\dots,x_{m}\} to denote the set of the distances between the connected collaborative DBSs and the typical vehcle vov_{o} at the origin, mm is the number of DBSs that the typical vehicle has already connected to, and xi,i{m+1,m+2,}x_{i},{i\in\{m+1,m+2,\cdots\}} denotes the distance between the DBS outside φcd\varphi_{c}^{d} and the typical vehicle. Let φc\varphi_{c} to denote the set of the connected collaborative DBSs. This means that to expand the set φc\varphi_{c}, we need to find the nearest DBS among DBSs in φDt\φc\varphi_{D}^{t}\backslash\varphi_{c}.

III-C Interference

In the collaboration DBSs set φc\varphi_{c}, all DBSs will transmit the control and data signals simultaneously on the same subband [7]. Since the signal components of the DBSs are within the cyclic prefix, the resulting multi-connectivity SINR experienced by the typical vehicle vov_{o} in the downlink is defined as follows:

SINRD=iφcPdgdxiαdID+σd2,\displaystyle S\!I\!N\!{R_{D}}=\frac{{\sum\limits_{i\in\varphi_{c}}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}{{{I_{D}}+\sigma_{d}^{2}}}, (7)

where iφcPdgdxiαd\sum\limits_{i\in\varphi_{c}}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}} represents the sum of received signal power from the DBSs in φc\varphi_{c}. We use σd2\sigma_{d}^{2} to denote the power of the additive white Gaussian noise (AWGN) [14]. IDI_{D} is the power of aggregate interference from the DBSs outside of φc\varphi_{c} and IDI_{D} can be expressed as

ID=i{φDt\φc}Pdgdxiαd.\displaystyle{I_{D}}=\sum\limits_{i\in\left\{{\varphi_{{}_{D}}^{t}\backslash{\varphi_{c}}}\right\}}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}. (8)

III-D Performance Metrics

In order to enable advanced C-V2X applications such as automated driving applications and stream media [4, 16], it is crucial to ensure that the downlink transmission is both reliable and capable of transmitting data at a high rate. This is important not only from the perspective of a single vehicle but also from the perspective of the whole C-V2X network. To this end, this paper conducts an analytical evaluation of two performance metrics, i.e. coverage probability and spectral efficiency as follows.

  • The coverage probability of the typical vehicle vov_{o} in downlink, is defined as the probability that the received SINR outperforms a predetermined threshold tt [32]. It can be expressed as

    cov(t)=(SINRD>t).\displaystyle{\mathbb{P}_{{\mathop{cov}}}}\left(t\right)=\mathbb{P}\left({S\!I\!N\!{R_{D}}>t}\right). (9)

    It can also be calculated as the proportion of vehicles that have the received SINRDS\!I\!N\!{R_{D}} above a threshold tt, i.e., establish a successful connection with the DBSs in φc\varphi_{c}, among all vehicles in the simulation scenario. Since the cumulative distribution function (CDF) of SINRDS\!I\!N\!{R_{D}} is cov(t)=(SINRD<t){\mathbb{P}_{{\mathop{cov}}}}\left(t\right)=\mathbb{P}\left({S\!I\!N\!{R_{D}}<t}\right), the coverage probability can also be expressed as the complementary cumulative distribution function (CCDF) of the SINRDS\!I\!N\!{R_{D}} at the typical vehicle from the DBSs.

  • The spectral efficiency of the typical vehicle vov_{o} is the amount of data transmitted per unit of bandwidth [33]. According to the Shannon Theory, the spectral efficiency of the downlink is

    τD=𝔼[ln(1+SINRD)],\displaystyle\tau_{D}=\mathbb{E}\left[{\ln\left({1+S\!I\!N\!{R_{D}}}\right)}\right], (10)

    where 𝔼()\mathbb{E}(\cdot) is the expectation function. The spectral efficiency describes the likelihood of a wireless communication system achieving a specific information amount within a certain time period and space range during actual use [23]. It can help evaluate the performance of C-V2X in a multi-connectivity environment and determine whether system optimization or adjustments are needed [33].


IV Performance Analysis

We first derive the expression for the joint distance distribution from x1x_{1} to xnx_{n} in this section. To optimize system configurations without the need for time-consuming computer simulations, we leverage the stochastic geometry. Specifically, by using the tools provided by stochastic geometry, we utilize the results obtained from previous sections to derive the coverage probability and spectral efficiency of C-V2X in a multi-connectivity scenario.

IV-A The joint distance distribution of the typical vehicle to nn service DBSs

Since the typical vehicle is connected to the nn nearest DBSs in multi-connectivity, no other DBSs are closer than distance xnx_{n}. And it also means that all interference DBSs are farther than xnx_{n}. The above definition can be expressed by f(x1,x2,,xn)f\left({{x_{1}},{x_{2}},\cdots,{x_{n}}}\right), and we call it joint distance distribution for x1,x2,,xn{{x_{1}},{x_{2}},\cdots,{x_{n}}}.

Lemma 1.

The joint distance distribution of the typical vehicle to its service DBSs in set φc\varphi{{}_{c}} from x1x_{1} to xnx_{n} is

f(x1,x2,,xn)=(2λD)ne2λDxn,\displaystyle f\left({{x_{1}},{x_{2}},\cdots,{x_{n}}}\right)={\left({2{\lambda_{D}}}\right)^{n}}{e^{-2{\lambda_{D}}{x_{n}}}}, (11)

where xnx_{n} denotes the distance between the typical vehicle and the nn-th closest DBS in φc\varphi_{c}.

Proof:

The null probability of a PPP in an area AA is eλAe^{-\lambda A}, where A=2λxA=2\lambda x in 1-D PPP and A=πx2A=\pi x^{2} in 2-D PPP, thus the CCDF of x1x_{1} is [14]

[x>x1]\displaystyle\mathbb{P}\left[x>x_{1}\right] =[no DBS closer than x1]\displaystyle=\mathbb{P}\left[\text{no~DBS~closer~than~}x_{1}\right]
=e2λDx1.\displaystyle=e^{-2\lambda_{D}x_{1}}. (12)

Because the CDF=1CCDFC\!D\!F=1-C\!C\!D\!F, the CDF of x1x_{1} is

F(x1)=1e2λDx1.\displaystyle F\left(x_{1}\right)=1-{e^{-2{\lambda_{D}}x_{1}}}. (13)

Since the PDF f(x)=F(x)xf\left(x\right)=\frac{\partial F\left(x\right)}{\partial x} [28], the PDF of x1x_{1} is

f(x1)=2λDe2λDx1.\displaystyle f\left(x_{1}\right)=2{\lambda_{D}}{e^{-2{\lambda_{D}}x_{1}}}. (14)

According to the definition of Section 3.3 in [34], let f(x2|x1)f\left({{x_{2}}|{x_{1}}}\right) denote the probability that the 2nd closest DBS is at x2x_{2} given that the closest one is at the distance of x1x_{1}. Thus the probability of having no DBSs between the distances x1x_{1} and x2x_{2} can be calculated as follows

f(x2|x1)=2λDe2λD(x2x1).\displaystyle f\left({{x_{2}}|{x_{1}}}\right)=2{\lambda_{D}}{e^{-2{\lambda_{D}}\left({{x_{2}}-{x_{1}}}\right)}}. (15)

According to the conditional probability Bayes theorem [35], f(x2,x1)f\left({{x_{2}},{x_{1}}}\right) denotes the joint distance distribution to the two nearest distances, i.e., the probability of having at least one point in x2+xx_{2}+\triangle x, where x\triangle x is an infinitesimal quantity, is

f(x1,x2)=f(x2|x1)f(x1)=(2λD)2e2λDx2.\displaystyle f\left({{x_{1}},{x_{2}}}\right)=f\left({{x_{2}}|{x_{1}}}\right)f\left({{x_{1}}}\right)={\left({2{\lambda_{D}}}\right)^{2}}{e^{-2{\lambda_{D}}{x_{2}}}}. (16)

By following the similar procedures in Eq. (15) and Eq. (16), the joint distance distribution f(x1,x2xn)f\left({{x_{1}},{x_{2}}\cdots{x_{n}}}\right) from x1x_{1} to xnx_{n} is

f(x1,x2,,xn)=(2λD)ne2λDxn.\displaystyle f\left({{x_{1}},{x_{2}},\cdots,{x_{n}}}\right)={\left({2{\lambda_{D}}}\right)^{n}}{e^{-2{\lambda_{D}}{x_{n}}}}. (17)

To compare the joint distance distribution f(x1,x2,,xn)f\left({{x_{1}},{x_{2}},\cdots,{x_{n}}}\right) and the PDF of xnx_{n}, we provide the PDF of xnx_{n} in Eq. (18) as

f(xn)=(2λbxn)nxnΓ(n)e2λbxn,\displaystyle f\left({{x_{n}}}\right)=\frac{{{{\left({2{\lambda_{b}}{x_{n}}}\right)}^{n}}}}{{{x_{n}}\Gamma\left(n\right)}}{e^{-2{\lambda_{b}}{x_{n}}}}, (18)

where Γ(n)=(n1)!\Gamma(n)=(n-1)! when nn is a positive integer.

IV-B Coverage Probability

A general expression for the coverage probability of multi-connectivity in C-V2X is calculated in this subsection.

Theorem 1.

A vehicle is considered to be within the coverage area if its SINRDS\!I\!N\!R_{D} value from the nearest base station exceeds a certain threshold value tt. On the other hand, if the SINRDS\!I\!N\!R_{D} falls below tt, the vehicle is dropped from the network. Thus, the coverage probability of downlink for multi-connectivity C-V2X is

(SINRD>t)\displaystyle\mathbb{P}\left({{S\!I\!N\!{R_{D}}}>{{t}}}\right)
=0<x1<x2<<xm<ζID(j)exp(μtσd2i=1mPdxiαd)×\displaystyle=\int_{0<{x_{1}}<{x_{2}}<\cdots<{x_{m}}<\infty}{{\zeta_{I_{D}}}\left(j\right)\exp\left({-\frac{{\mu t\sigma_{d}^{{2}}}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right)\times}
f(x1,x2,,xm)dx1dx2dxm,\displaystyle f\left({{x_{1}},{x_{2}},\cdots,{x_{m}}}\right)d{x_{1}}d{x_{2}}\cdots d{x_{m}}, (19)

where j=μti=1mPdxiαdj=\frac{\mu t}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}, mm is the number of cooperating DBSs in the cooperative set, ζID(j)\zeta_{I_{D}}\left(j\right) is the Laplace transform of random variable interference IDI_{D} evaluated at jj and ζID(j)\zeta_{I_{D}}\left(j\right) is

ζID(j)=exp[2λDxm1μjPdxiαd+μdxi].\displaystyle{\zeta_{{I_{D}}}}\left(j\right)=\exp\left[{-2{\lambda_{D}}\int_{x_{m}}^{\infty}{1-\frac{\mu}{{j{P_{d}}x_{i}^{-{\alpha_{d}}}+\mu}}d{x_{i}}}}\right]. (20)
Proof:

The proof of coverage probability in the downlink is

(SINRD>t)\displaystyle{\mathbb{P}}\left({{{S\!I\!N\!}}{{{R}}_{D}}>{{t}}}\right)
=(a)(i=1mPdgdxiαdID+σd2>t)\displaystyle{{\mathop{=}\limits^{\left(a\right)}\mathbb{P}}}\left({\frac{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}{g_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}{{{I_{D}}{{+}}\sigma_{d}^{{2}}}}>{{t}}}\right)
=(gd>t(ID+σd2)i=1mPDxiαd)\displaystyle=\mathbb{P}\left({{g_{d}}>\frac{{t\left({{I_{D}}{{+}}\sigma_{d}^{{2}}}\right)}}{{\sum\limits_{{{i=1}}}^{m}{{P_{D}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right)
=(b)𝔼xi,ID[exp(μt(ID+σd2)i=1mPdxiαd)]\displaystyle\mathop{=}\limits^{\left(b\right)}{\mathbb{E}_{{x_{i}},{I_{D}}}}\left[{\exp\left({-\frac{{\mu t\left({{I_{D}}{{+}}\sigma_{d}^{{2}}}\right)}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right)}\right]
=(c)𝔼xi[exp(μtσd2i=1mPdxiαd)ζID(j)]\displaystyle\mathop{=}\limits^{\left(c\right)}{\mathbb{E}_{{x_{i}}}}\left[{\exp\left({-\frac{{\mu t\sigma_{d}^{{2}}}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right){\zeta_{I_{D}}}\left(j\right)}\right]
=0<x1<x2<<xm<ζID(j)exp(μtσd2i=1mPdxiαd)×\displaystyle=\int_{0<{x_{1}}<{x_{2}}<\cdots<{x_{m}}<\infty}{{\zeta_{I_{D}}}\left(j\right)\exp\left({-\frac{{\mu t\sigma_{d}^{{2}}}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right)\times}
f(x1,x2,,xm)dx1dx2dxm,\displaystyle f\left({{x_{1}},{x_{2}},\cdots,{x_{m}}}\right)d{x_{1}}d{x_{2}}\cdots d{x_{m}}, (21)

where (a) is obtained by substituting the expression of SINRDS\!I\!N\!R_{D} in Eq. (7). (b) is obtained by finding the CCDF of gdg_{d} which is exponentially distributed with parameter μ\mu. ζID(j)\zeta_{I_{D}}\left(j\right) is the Laplace transform of interference IDI_{D} in (c), and j=μti=1mPdxiαdj=\frac{\mu t}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}. Based on the definition of the Laplace transform, the derivation of ζID(j)\zeta_{I_{D}}\left(j\right) is

ζID(j)=𝔼ID[ejID]\displaystyle{\zeta_{{I_{D}}}}\left(j\right)={\mathbb{E}_{{I_{D}}}}\left[{{e^{-j{I_{D}}}}}\right]
=(a)𝔼ID[exp(jiφDt\φcPdgdxiαd)]\displaystyle\mathop{=}\limits^{(a)}{\mathbb{E}_{{I_{D}}}}\left[{\exp\left({-j\sum\limits_{i\in\varphi_{D}^{t}\backslash\varphi_{c}}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}\right)}\right]
=(b)𝔼ΘId,{gd}[iΘIdejPdgdxiαd]\displaystyle\mathop{=}\limits^{\left(b\right)}{\mathbb{E}_{\Theta_{I}^{d},\left\{{{g_{d}}}\right\}}}\left[{\prod\limits_{i\in\Theta_{I}^{d}}{{e^{-j{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}}\right]
=(c)exp[2λDxm1\displaystyle\mathop{=}\limits^{\left(c\right)}\exp\left[{-2{\lambda_{D}}\int_{{x_{m}}}^{\infty}{1-}}\right.
𝔼gd[exp(jPdgdxiαd)]dxi]\displaystyle\left.{{\mathbb{E}_{{g_{d}}}}\left[{\exp\left({-j{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}\right)}\right]d{x_{i}}}\right]
=(d)exp[2λDxm1μjPdxiαd+μdxi],\displaystyle\mathop{=}\limits^{(d)}\exp\left[{-2{\lambda_{D}}\int_{x_{m}}^{\infty}{1-\frac{\mu}{{j{P_{d}}x_{i}^{-{\alpha_{d}}}+\mu}}d{x_{i}}}}\right], (22)

where we use ΘId=φDt\φc{\Theta_{I}^{d}}=\varphi_{D}^{t}\backslash\varphi_{c} to denote the interference DBSs, interference IDI_{D} can be obtained in Eq. (8). (b) is obtained by finding the CCDF of gdg_{d} which is exponentially distributed with parameter μ\mu. (c) is derived from the probability generating functional (PGFL) of the PPP [36], i.e.,

𝔼(f(x))=exp(λR2(1f(x))𝑑x).\displaystyle\mathbb{E}\left(\prod f\left(x\right)\right)=exp\left(-\lambda\int_{R^{2}}\left(1-f\left(x\right)\right)dx\right). (23)

𝔼gd[exp(jPdgdxiαd)]\mathbb{E}_{{g_{d}}}\left[{\exp\left({-j{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}\right)}\right] in (d) can be derived as

𝔼gd[exp(jPdgdxiαd)]\displaystyle{\mathbb{E}_{{g_{d}}}}\left[{\exp\left({-j{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}\right)}\right]
=0ejPdgdxiαdμeμgd𝑑gd\displaystyle=\int_{0}^{\infty}{{e^{-j{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}{\mu e^{-\mu{g_{d}}}}}d{g_{d}}
=μej(Pdxiαd+μ)gdjPdxiαd+μ|0\displaystyle=-\frac{{{\mu e^{-j\left({{P_{d}}x_{i}^{-{\alpha_{d}}}+\mu}\right){g_{d}}}}}}{{j{P_{d}}x_{i}^{-{\alpha_{d}}}+\mu}}\left|{{}_{0}^{\infty}}\right.
=μjPdxiαd+μ.\displaystyle=\frac{\mu}{{j{P_{d}}x_{i}^{-{\alpha_{d}}}+\mu}}. (24)

Since the farthest cooperation DBS is at a distance of xmx_{m}, the integration limits are from xmx_{m} to \infty in (d).

IV-C Spectral efficiency

This subsection derives the expression of spectral efficiency for the downlink by using the tools of stochastic geometry for C-V2X in multi-connectivity. We computed the spectral efficiency in units of nats/s/Hznats/s/Hz (1bit=ln(2)=0.693nats1~bit=ln(2)=0.693~nats) for the typical vehicle.

Theorem 2.

The spectral efficiency of the downlink in multi-connectivity C-V2X is

τD\displaystyle\tau_{D} =0<x1<x2<<xm<f(x1,x2,,xm)×\displaystyle=\int_{0<{x_{1}}<{x_{2}}<\cdots<{x_{m}}<\infty}f{\left({{x_{1}},{x_{2}},\cdots,{x_{m}}}\right)}\times
𝔼[ln(1+SINRD)]dx1dx2dxm,\displaystyle\mathbb{E}\left[{\ln\left({1+S\!I\!N\!R_{D}}\right)}\right]d{x_{1}}d{x_{2}}\cdots d{x_{m}}, (25)

where mm is the number of cooperating DBSs. 𝔼[ln(1+SINRD)]\mathbb{E}\left[{\ln\left({1+S\!I\!N\!R_{D}}\right)}\right] is

𝔼[ln(1+SINRD)]=\displaystyle\mathbb{E}\left[{\ln\left({1+S\!I\!N\!{R_{D}}}\right)}\right]=
t>0P[ln(1+i=1mPdgdxiαdID+σd2)>t]𝑑t,\displaystyle\int_{t>0}{P\left[\ln\left({1+\frac{{\sum\limits_{i=1}^{m}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}{{{I_{D}}+\sigma_{d}^{2}}}}\right)>t\right]}dt, (26)

where

[ln(1+i=1mPdgdxiαdID+σd2)>t]\displaystyle\mathbb{P}\left[{\ln\left({1+\frac{{\sum\limits_{i=1}^{m}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}{{{I_{D}}+\sigma_{d}^{2}}}}\right)}>t\right]
=exp(βσd2i=1mPdxiαd)ζID(j),\displaystyle\mathop{=}\limits\exp\left({-\frac{{\beta\sigma_{d}^{{2}}}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right){\zeta_{I_{D}}}\left(j\right),{} (27)

where β=μ(et1)\beta=\mu\left({{e^{t}}-1}\right) and j=βi=1mPdxiαdj=\frac{\beta}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}. ζID(j){\zeta_{I_{D}}}\left(j\right) is the Laplace transform of interference IDI_{D}, and ζID(j){\zeta_{I_{D}}}\left(j\right) is the same as in Eq. (IV-B),

ζID(j)=exp[2λDxm(1μjPdxiαd+μ)𝑑xi].\displaystyle{\zeta_{I_{D}}}\left({{j}}\right)=\exp\left[{-2{\lambda_{D}}\int_{{x_{m}}}^{\infty}{\left({1-\frac{\mu}{{jP_{d}x_{i}^{-{\alpha_{d}}}+\mu}}}\right)d{x_{i}}}}\right]. (28)
Proof:

The proof of spectral efficiency of downlink is

τD\displaystyle\tau_{D} =𝔼[ln(1+SINRD)]\displaystyle=\mathbb{E}\left[{\ln\left({1+S\!I\!N\!{R_{D}}}\right)}\right]
=0<x1<x2<<xm<f(x1,x2,,xm)×\displaystyle=\int_{0<{x_{1}}<{x_{2}}<\cdots<{x_{m}}<\infty}f{\left({{x_{1}},{x_{2}},\cdots,{x_{m}}}\right)}\times
𝔼[ln(1+i=1mPdgdxiαdID+σd2)]dx1dx2dxm\displaystyle\mathbb{E}\left[{\ln\left({1+\frac{{\sum\limits_{i=1}^{m}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}{{{I_{D}}+\sigma_{d}^{2}}}}\right)}\right]d{x_{1}}d{x_{2}}\cdots d{x_{m}}
=(a)0<x1<x2<<xm<f(x1,x2,,xm)×\displaystyle{{\mathop{=}\limits^{(a)}}}\int_{0<{x_{1}}<{x_{2}}<\cdots<{x_{m}}<\infty}{f\left({{x_{1}},{x_{2}},\cdots,{x_{m}}}\right)}\times
t>0[ln(1+i=1mPdgdxiαdID+σd2)>t]𝑑t𝑑x1𝑑x2𝑑xm,\displaystyle\int_{t>0}{\mathbb{P}\left[\ln\left({1+\frac{{\sum\limits_{i=1}^{m}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}{{{I_{D}}+\sigma_{d}^{2}}}}\right)>t\right]}dtd{x_{1}}d{x_{2}}\cdots d{x_{m}}, (29)

where tt is the predetermined threshold. As a positive random variable XX is considered, it follows that 𝔼(X)\mathbb{E}\left(X\right) can be calculated as 0(X>t)𝑑t\int_{0}^{\infty}\mathbb{P}(X>t)dt [14], thus the 𝔼[ln(1+SINRD)]\mathbb{E}\left[{\ln\left({1+S\!I\!N\!R_{D}}\right)}\right] can be calculated in (a). Furthermore, [ln(1+i=1mPdgdxiαd/(ID+σd2))>t]{\mathbb{P}\left[\ln\left({1+{{\sum\limits_{i=1}^{m}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}/({{{I_{D}}+\sigma_{d}^{2}}}})\right)>t\right]} is

[ln(1+i=1mPdgdxiαdID+σd2)>t]\displaystyle\mathbb{P}\left[{\ln\left({1+\frac{{\sum\limits_{i=1}^{m}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}{{{I_{D}}+\sigma_{d}^{2}}}}\right)}>t\right]
=(a)(i=1mPdgdxiαdID+σd2>et1)\displaystyle\mathop{=}\limits^{\left(a\right)}\mathbb{P}\left({\frac{{\sum\limits_{i=1}^{m}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}{{I_{D}+\sigma_{d}^{2}}}>{e^{t}}-1}\right)
=(b)𝔼gd[gd>(et1)(ID+σd2)i=1mPdxiαd]\displaystyle\mathop{=}\limits^{\left(b\right)}{\mathbb{E}_{{g_{d}}}}\left[{{g_{d}}>\frac{{\left({{e^{t}}-1}\right)\left({I_{D}+\sigma_{d}^{2}}\right)}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right]
=(c)𝔼ID[exp(μ(et1)(ID+σd2)i=1mPdxiαd)]\displaystyle\mathop{=}\limits^{(c)}{\mathbb{E}_{{I_{D}}}}\left[{\exp\left({-\frac{{\mu\left({{e^{t}}-1}\right)\left({{I_{{D}}}{{+}}\sigma_{d}^{{2}}}\right)}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right)}\right]
=(d)exp(βσd2i=1mPdxiαd)ζID(j),\displaystyle\mathop{=}\limits^{(d)}\exp\left({-\frac{{\beta\sigma_{d}^{{2}}}}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}}\right){\zeta_{I_{D}}}\left(j\right),{} (30)

where (a) first solves the logarithm, then calculate the expectation of the channel gain gdg_{d} in (b), and gdg_{d} follows the exponential distribution with mean 1/μ1/\mu in (c). Since some variables have nothing to do with IDI_{D}, they can be treated as constants and remain unchanged in (d). For the simplicity of the formula, we use β=μ(et1)\beta=\mu\left({{e^{t}}-1}\right) and j=βi=1mPdxiαdj=\frac{\beta}{{\sum\limits_{{{i=1}}}^{{m}}{{P_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}}. The Laplace transform ζID\zeta_{I_{D}} is the same with Eq. (IV-B) and is omitted here.

Refer to caption

Figure 2: Simulation scenario of multi-connectivity in C-V2X.

IV-D Special case: Single-connectivity

In order to compare the performance with multi-connectivity in C-V2X, this subsection focuses on the calculation of the coverage probability and spectral efficiency in a cellular single-connectivity scenario, which represents the most basic approach. In this scenario, the typical vehicle associates with the cellular base station (CBS) whit the MRP.

As the single-connectivity is a special case of multi-connectivity, we model the similar channel model as in multi-connectivity scenario, and use λC\lambda_{C} to denote the transformed intensity λc\lambda_{c} of CBS ϱCt\varrho_{{}_{C}}^{t} after executing the procedures of random displacement, and λC>λD\lambda_{C}>\lambda_{D}. As the CBS are distributed along the road following a 1-D PPP, the PDF of distance distribution is

f(x)=2λCe2λCx,\displaystyle f\left(x\right)=2{\lambda_{C}}{e^{-2{\lambda_{C}}x}}, (31)

where xx is the distance between the nearest CBS and the typical vehicle.

The coverage probability of the downlink in cellular single-connectivity is

cov(SINRcD>t)\displaystyle{\mathbb{P}_{{\mathop{cov}}}}\left({S\!I\!N\!{R_{c}^{D}}>t}\right)
=02λCeμtσd2xαd/Pde2λCxζIdc(j)𝑑x,\displaystyle=\int_{0}^{\infty}2{\lambda_{C}}{{e^{-\mu t\sigma_{d}^{2}{x^{{\alpha_{d}}}}/{P_{d}}}}}{e^{-2{\lambda_{C}}x}}{\zeta_{I_{d}^{c}}}\left(j\right)dx, (32)

where j=μtxαd/Pdj=\mu t{x^{{\alpha_{d}}}}/{P_{d}}, the SINRcDS\!I\!N\!R_{c}^{D} is

SINRcD=PdgdxiαdIdc+σd2,S\!I\!N\!R_{c}^{D}=\frac{{{P_{d}}{g_{d}}x_{i}^{{{-}}{\alpha_{d}}}}}{{I_{d}^{c}{{+}}\sigma_{d}^{{2}}}}, (33)

where the interference IdcI_{d}^{c} is

Idc=iϱCtPdgdxiαd.{I_{d}^{c}}=\sum\limits_{i\in{\varrho_{{}_{C}}^{t}}}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}. (34)

The Laplace transform of IdcI_{d}^{c} is

ζIdc(j)=exp[2λCx1μjPdxiαd+μdxi].\displaystyle{\zeta_{I_{d}^{c}}}\left(j\right)=\exp\left[{-2{\lambda_{C}}\int_{{}_{x}}^{\infty}{1-\frac{\mu}{{j{P_{d}}x_{i}^{-{\alpha_{d}}}+\mu}}d{x_{i}}}}\right]. (35)
Proof:

Given the similarity in the proof to that of Theorem 1, we omit the specific steps here. ∎

The spectral efficiency of cellular single-connectivity for downlink is

τcD=0f(x)E[ln(1+SINRcD)>t]𝑑x,\displaystyle\tau_{c}^{D}=\int_{0}^{\infty}{f\left(x\right)}E\left[{\ln\left({1+S\!I\!N\!R_{c}^{D}}\right)>t}\right]dx, (36)

where

𝔼[ln(1+SINRcD)>t]=0eμ(et1)xαdσd2PdζIdc(j)𝑑t,\displaystyle\mathbb{E}\left[{\ln\left({1+S\!I\!N\!R_{c}^{D}}\right)>t}\right]=\int_{0}^{\infty}{{e^{-\frac{{\mu\left({{e^{t}}-1}\right){x^{{\alpha_{d}}}}\sigma_{d}^{2}}}{{{P_{d}}}}}}{\zeta_{I_{d}^{c}}}\left(j\right)}dt, (37)

where j=μ(et1)xαd/Pdj=\mu({e^{t}}-1){x^{{\alpha_{d}}}}/{P_{d}}, the ζIdc(j){\zeta_{I_{d}^{c}}}\left(j\right) is

ζIdc(j)=\displaystyle{\zeta_{I_{d}^{c}}}\left(j\right)=
exp[2λDx(1μ(et1)xαdxiαd+μ)𝑑xi]S\displaystyle~\exp\left[{-2{\lambda_{D}}\int_{{}_{x}}^{\infty}{\left({1-\frac{\mu}{{\left({{e^{t}}-1}\right){x^{{\alpha_{d}}}}x_{i}^{-{\alpha_{d}}}+\mu}}}\right)d{x_{i}}}}\right]S (38)
Proof:

The proof of spectral efficiency of downlink for cellular single-connectivity is similar to Theorem 2, the specific steps are omitted here. ∎

Input: simulation number nn, road length ll, threshold tt, DBS density λd\lambda_{d}, vehicle density λv\lambda_{v};
Output: Coverage probability CPC\!P, spectral efficiency τD\tau_{D};
1 Initialize τ𝐨𝟎n×λvl{\bf\tau_{o}}\leftarrow{\bf 0}_{n\times\lambda_{v}l} , 𝐏𝟎n×λvl{\bf P}\leftarrow{\bf 0}_{n\times\lambda_{v}l}, CPn𝟎1×n{C\!P_{n}}\leftarrow{\bf 0}_{1\times n}, τn𝟎1×n{\tau_{n}}\leftarrow{\bf 0}_{1\times n}
2 for i=1;in;i++i=1;i\leq n;i++ do
3  Generate the locations 𝐦\bf{m}, 𝐕\bf{V} of DBSs and vehicles following 1-D PPP, respectively;
4  for v=1;vλvl;v++v=1;v\leq\lambda_{v}l;v++ do
5     Select collaborative DBSs according to Eq. (6);
6     Calculate SINRDS\!I\!N\!R_{D} of DL according to Eq. (7);
7     τ𝐨(i,v)=ln(1+SINRD){\bf{\tau_{o}}}(i,v)=ln(1+S\!I\!N\!R_{D}), 𝐏(i,v)=SINRD{\bf P}(i,v)=S\!I\!N\!R_{D};
8  end for
9  CPn(i)=i=1λvl(𝐏(i,:)>t)/(λvl)C\!P_{n}(i)=\sum_{i=1}^{\lambda_{v}l}({\bf P}(i,:)>t)/(\lambda_{v}l);
10  τn(i){\tau_{n}}(i) =i=1λvl=\sum_{i=1}^{\lambda_{v}l}τ𝐨\bf{\tau_{o}}(ii,:) /(λvl\lambda_{v}l);
11 
12 end for
Return τD=i=1n{\bf{\tau}}_{D}=\sum_{i=1}^{n}τn(i)/n\tau_{n}(i)/n, CP=i=1n{C\!P}=\sum_{i=1}^{n}CPn(i)/nC\!P_{n}(i)/n;
Simulation 1 Simulation for multi-connectivity in C-V2X

V NUMERICAL and Simulation RESULTS

A two-tier communication scenario on a straight urban freeway is considered in this section. The length of the freeway is set as 30 km. The specific simulation scenario is shown in Fig. 2. We first verify the proposed theoretical derivation in previous sections over 10,000 Monte Carlo simulations of the DBSs and vehicles following 1-D PPPs. The detailed steps of the simulation are in Simulation 1. We use ‘Cellu 1’, ‘Conn 2’, and ‘Conn 3’ to abbreviate single-connectivity, dual-connectivity, and triple-connectivity, respectively, in the legends of the figures. According to [37, 38, 39], Table II summarizes the system simulation parameters employed in this paper.

Refer to caption
(a) a
Refer to caption
(b) b
Refer to caption
(c) c
Figure 3: The distance distributions f(xi)f(x_{i}) and joint distance distribution f(x1,x2,,xm)f\left({{x_{1}},{x_{2}},\cdots,{x_{m}}}\right) under different distances. (a) Distance distribution for nearest distances x1,x2x_{1},x_{2} and x3x_{3}. (b) The joint distance distribution of f(x1),f(x1,x2)f(x_{1}),f(x_{1},x_{2}) and f(x1,x2,x3)f(x_{1},x_{2},x_{3}). (c) Since f(x1)f(x_{1}) and f(x1,x2)f(x_{1},x_{2}) is much smaller than f(x1,x2,x3)f(x_{1},x_{2},x_{3}), the two functions are highlighted here.
TABLE II: MAIN PARAMETERS
Channel Parameters Value
DBS transmitting power PdP_{d} (dBm) 23
Pathloss exponent for downlink αd\alpha_{d} 2.162.1\sim 6
Noise power σd2\sigma_{d}^{2} (dBm) -96
Mean of log-normal shadowing gain (dB) 0
Std of shadowing gain for MBS (dB) 2
Simulation parameters Value
The length of road (km) 30
The number of iteration 10,000
Density of vehicle on road λv\lambda_{v} (nodes/km) 20
Density of DBS λd\lambda_{d} (nodes/km) 0.055.70.05\sim 5.7
Threshold (dB) 0400\sim 40

V-A Joint distance distribution

Fig. 3(a) shows the distance distribution of x1x_{1}, x2x_{2}, and x3x_{3}. We can see that the peak is gradually moving away from the origin from x1x_{1} to x3x_{3}. Fig. 3(b) and Fig. 3(c) depict the joint distance distribution for f(x1,x2)f(x_{1},x_{2}) and f(x1,x2,x3)f(x_{1},x_{2},x_{3}). We can see that the peak of f(x1,x2,x3)f(x_{1},x_{2},x_{3}) is closest to the origin, followed by f(x1,x2)f(x_{1},x_{2}), and the furthest is f(x1)f(x_{1}). Compared with distance distributions in Fig. 3(a), the peak of joint distance distribution has a huge boost. The closer the distance between the peak and the origin, the better the performance. It can be observed that in single-connectivity, f(x1)f(x_{1}) exhibits better performance. Compared to a single-connectivity, a greater number of DBSs connections in multi-connectivity lead to a more significant performance improvement.

V-B Coverage probability

The coverage probability variation of downlink with threshold tt is illustrated in Fig. 4. It is apparent that the simulation values closely match the theoretical values, which further verifies the validity of the theoretical derivation results. The density of BS λc\lambda_{c} in single-connectivity is set as 3 nodes/km, and the density λd\lambda_{d} of DBSs in multi-connectivity is set as 6 nodes/km. Though λc>λd\lambda_{c}>\lambda_{d}, we can see that the dual-connectivity and triple-connectivity still have a greater coverage probability than single-connectivity. This suggests that multi-connectivity performs better than cellular single-connectivity in C-V2X and multi-connectivity enhances the coverage area of communications.

Refer to caption

Figure 4: Coverage probability variation with threshold tt t[0,40]t\in[0,40] (λd=3nodes/km,λc=6nodes/km\lambda_{d}=3~nodes/km,\lambda_{c}=6~nodes/km).

Refer to caption

Figure 5: The effect of path loss exponent on coverage probability( αd[2.1,6]\alpha_{d}\in[2.1,6]).

Fig. 5 illustrates the coverage probability as a function of path loss exponent αd\alpha_{d}. It can be seen that the Monte Carlo simulation data and analytical data fit well. Considering the dense deployment of DBSs in the simulation, vehicles are in an interference-limited state. At this moment, the interference power will decrease in accordance with the increase of αd\alpha_{d}, which in turn lead to a promotion of SINR. Therefore, the coverage probability will be improved even if the channel gain decrease.

For a better investigation of the impact of path loss exponent αd\alpha_{d} on the coverage probability under different densities of DBSs, we plot Fig. 6 in a dual-connectivity scenario. As shown in Fig. 6, when the density of DBSs is in a dense deployment, the system is an interference-limited network. The distance between the signal DBSs φc\in\varphi_{c} and the interference DBSs is close to the typical vehicle, so the increase of αd\alpha_{d} leads to a greater impact on the interference signal power, resulting in an increase in the coverage probability. However, when the density is low enough, the system can be considered as a noise-limited network. Both the signal DBSs and the interference DBSs are far away from the typical vehicle, so the increase of αd\alpha_{d} has a greater impact on the receiving signal power, leading to a continuous decrease in the coverage probability. When the density λd\lambda_{d} is at an appropriate size, such as λd\lambda_{d} =0.005nodes/km=0.005~nodes/km, the coverage probability first increases and then decreases with the increase of αd\alpha_{d}.

Refer to caption
Figure 6: Coverage probability of dual-connectivity varies with different path loss exponent in different densities of DBSs αd(2.15.7)\alpha_{d}~(2.1\sim 5.7).

The coverage probability of all cases decreases as the threshold tt increases, while the difference between single-connectivity and multi-connectivity first increases and then decreases in Fig. 7. This is mainly because the coverage probability is respectively high and low at small and large thresholds, respectively. Only when the threshold value is in the middle range, the difference in coverage probability is large, and the advantage of applying multi-connectivity is also demonstrated. It can be observed that increasing the number of connected DBSs does not result in a proportional increase in the coverage probability gain. Hence, at a particular threshold, there exists a balance tradeoff between the number of corporation DBSs that are connected and the associated cost.

Refer to caption
Figure 7: Coverage probability differences variation with threshold t(040dB)t~(0\sim 40~dB).
Refer to caption
Figure 8: Coverage probability variation with base station density λd\lambda_{d} (0.110.1\sim 1 nodes/km).
Refer to caption
Figure 9: Spectral efficiency variation with the path loss exponent αd(2.15.9)\alpha_{d}~(2.1\sim 5.9).
Refer to caption
Figure 10: Spectral efficiency of dual-connectivity varies with different path loss exponent in different densities of DBSs αd(2.13.9)\alpha_{d}~(2.1\sim 3.9).
Refer to caption
Figure 11: Spectral efficiency percentage increase of multi-connectivity compared to single-connectivity.
Refer to caption
Figure 12: Spectral efficiency as a function of base station density λd\lambda_{d} (0.050.50.05\sim 0.5 nodes/km ).

As shown in Fig. 8, the coverage probability varies with the density λd\lambda_{d} of DBSs. The coverage probability goes up first and then stays relatively constant for both cellular single-connectivity and multi-connectivity when the density λd\lambda_{d} increases. It can also be seen that the growth rate of multi-connection is faster than that of single-connection, and it also reaches a stable point later. At the same time, it can be seen that the coverage probability does not increase significantly when comparing triple-connectivity to dual-connectivity. Therefore, increasing the number of cooperative BSs can improve communication coverage area, but it may also incur high costs. By observing the horizontal axis, it can be noted that the change in DBS density λd\lambda_{d} is relatively small in magnitude. This implies that the coverage probability is sensitive to changes in λd\lambda_{d}, and suggests that simply increasing λd\lambda_{d} does not necessarily lead to an improvement in coverage probability.

V-C Spectral efficiency

The spectral efficiency varies with the path loss exponent αd\alpha_{d} is illustrated in Fig. 9. The simulation data is represented by the points and the theoretical data is represented by the dashed line in Fig. 9. We can observe that the simulation data matches the theoretical data well, demonstrating the correctness of the theoretical derivation. The increase of path loss exponent leads to a gradual increase in spectral efficiency and an approximately linear relationship. The reason is that, as the dense deployment of DBSs, vehicles are in a interference-limited state, with the increase of path loss exponent αd\alpha_{d}, the interference signals weaken more than the signals transmitted by the cooperative BSs, resulting in an increase in SINR and consequently spectral efficiency. It appears that there exists a close-to-linear relationship between the path loss exponent αd\alpha_{d}, mainly because after dividing the received signal power iφcPdgdxiαd{{\sum\limits_{i\in\varphi_{c}}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}} into the denominator of Eq. (9), since the thermal noise is much smaller than the received signal and thus σd2/iφcPdgdxiαd0\sigma_{d}^{2}/{{\sum\limits_{i\in\varphi_{c}}{{P_{d}}{g_{d}}x_{i}^{-{\alpha_{d}}}}}}\approx 0, then after logarithmic calculation, it approximates to a linear relationship. Fig. 12 depicts the spectral efficiency of dual-connectivity as a function of αd\alpha_{d} in different densities of DBSs. Since the spectral efficiency is mainly affected by SINR, it can be seen that the trend of spectral efficiency is similar to that of coverage probability in Fig. 6 when the DBSs layout changes from extremely dense to extremely sparse.

Fig. 11 plots the spectral efficiency improvements between the multi-connectivity and single-connectivity. It can be observed that the application of multi-connectivity technology greatly improves the spectral efficiency in C-V2X. The improvement achieved by dual-connectivity can reach up to 40%, and that achieved by triple-connectivity can increase to more than 75%. With the increase of path loss exponent αd\alpha_{d}, the performance improvement of spectral efficiency does not increase significantly. This indicates that multi-connectivity technology has a stable performance gain.

Fig. 12 illustrates the spectral efficiency varies with the DBS density λd\lambda_{d}. With the increase of λd\lambda_{d}, the spectral efficiency first improves and then remains stable. Moreover, the improvement of multi-connectivity is greater than that of single-connectivity, and the stable point is also further back. This means that multi-connectivity has a larger range of performance improvement. Similar to Fig. 8, adding too many DBSs does not continuously improve spectral efficiency. Additionally, it can be observed that the stable point of spectral efficiency arrives earlier than the stable point of coverage probability. Thus, when increasing the density of DBSs λd\lambda_{d}, it is necessary to comprehensively consider the demands between spectral efficiency and coverage probability.

VI CONCLUSION

This paper has demonstrated the potential of enhancing network performance in C-V2X by using the proposed multi-connectivity performance analysis framework. By analyzing performance indicators such as coverage probability and spectral efficiency in the downlink, this paper has provided insights into the effect of path loss exponent and the density of DBS on the system performance indicators. The extensive Monte Carlo simulations have effectively validated the proposed framework and demonstrated the effectiveness of multi-connectivity technology in enhancing the performance of C-V2X networks. The results of this paper have important implications for the research and practical applications of multi-connectivity C-V2X in the 5G and B5G era, and further investigations are warranted to explore the full potential of this technology for next-generation communication systems.

References

  • [1] A. Wolf, P. Schulz, M. Dörpinghaus, J. C. S. Santos Filho, and G. Fettweis, “How reliable and capable is multi-connectivity?” IEEE Transactions on Communications, vol. 67, no. 2, pp. 1506–1520, 2018.
  • [2] C. Pupiales, D. Laselva, Q. De Coninck, A. Jain, and I. Demirkol, “Multi-connectivity in mobile networks: Challenges and benefits,” IEEE Communications Magazine, vol. 59, no. 11, pp. 116–122, 2021.
  • [3] L. Weedage, C. Stegehuis, and S. Bayhan, “Impact of multi-connectivity on channel capacity and outage probability in wireless networks,” IEEE Transactions on Vehicular Technology, 2023.
  • [4] Y. Xu, H. Zhou, T. Ma, J. Zhao, B. Qian, and X. Shen, “Leveraging multiagent learning for automated vehicles scheduling at nonsignalized intersections,” IEEE Internet of Things Journal, vol. 8, no. 14, pp. 11 427–11 439, 2021.
  • [5] S. Chen, J. Hu, Y. Shi, Y. Peng, J. Fang, R. Zhao, and L. Zhao, “Vehicle-to-everything (V2X) services supported by LTE-based systems and 5G,” IEEE Communications Standards Magazine, vol. 1, no. 2, pp. 70–76, 2017.
  • [6] J. Chen, G. Mao, C. Li, W. Liang, and D.-g. Zhang, “Capacity of cooperative vehicular networks with infrastructure support: Multiuser case,” IEEE Transactions on Vehicular Technology, vol. 67, no. 2, pp. 1546–1560, 2017.
  • [7] Z. Lu, T. Zhang, X. Ji, B. Qian, L. Jiao, and H. Zhou, “Personalized Wireless Resource Allocation in Multi-Connectivity B5G C-V2X Networks,” in 2022 14th International Conference on Wireless Communications and Signal Processing (WCSP). IEEE, 2022, pp. 1–6.
  • [8] A. Rabitsch, K.-J. Grinnemo, A. Brunstrom, H. Abrahamsson, F. B. Abdesslem, S. Alfredsson, and B. Ahlgren, “Utilizing multi-connectivity to reduce latency and enhance availability for vehicle to infrastructure communication,” IEEE Transactions on Mobile Computing, vol. 21, no. 5, pp. 1874–1891, 2020.
  • [9] P. Wu, L. Ding, Y. Wang, L. Li, H. Zheng, and J. Zhang, “Performance analysis for uplink transmission in user-centric ultra-dense V2I networks,” IEEE Transactions on Vehicular Technology, vol. 69, no. 9, pp. 9342–9355, 2020.
  • [10] F. B. Tesema, A. Awada, I. Viering, M. Simsek, and G. Fettweis, “Evaluation of context-aware mobility robustness optimization and multi-connectivity in intra-frequency 5G ultra dense networks,” IEEE Wireless Communications Letters, vol. 5, no. 6, pp. 608–611, 2016.
  • [11] L. Diez, A. Garcia-Saavedra, V. Valls, X. Li, X. Costa-Perez, and R. Agüero, “LaSR: A supple multi-connectivity scheduler for multi-RAT OFDMA systems,” IEEE Transactions on Mobile Computing, vol. 19, no. 3, pp. 624–639, 2018.
  • [12] S. Chen, T. Zhao, H.-H. Chen, Z. Lu, and W. Meng, “Performance analysis of downlink coordinated multipoint joint transmission in ultra-dense networks,” IEEE Network, vol. 31, no. 5, pp. 106–114, 2017.
  • [13] V. V. Chetlur and H. S. Dhillon, “Coverage analysis of a vehicular network modeled as Cox process driven by Poisson line process,” IEEE Transactions on Wireless Communications, vol. 17, no. 7, pp. 4401–4416, 2018.
  • [14] J. G. Andrews, F. Baccelli, and R. K. Ganti, “A tractable approach to coverage and rate in cellular networks,” IEEE Transactions on communications, vol. 59, no. 11, pp. 3122–3134, 2011.
  • [15] L. P. Qian, Y. Wu, H. Zhou, and X. Shen, “Non-orthogonal multiple access vehicular small cell networks: Architecture and solution,” IEEE Network, vol. 31, no. 4, pp. 15–21, 2017.
  • [16] K. Yu, H. Zhou, Z. Tang, X. Shen, and F. Hou, “Deep reinforcement learning-based RAN slicing for UL/DL decoupled cellular V2X,” IEEE Transactions on Wireless Communications, vol. 21, no. 5, pp. 3523–3535, 2021.
  • [17] Y. Xu, B. Qian, K. Yu, T. Ma, L. Zhao, and H. Zhou, “Federated Learning Over Fully-Decoupled RAN Architecture for Two-tier Computing Acceleration,” IEEE Journal on Selected Areas in Communications, 2023.
  • [18] A. Kousaridas, C. Zhou, D. Martín-Sacristán, D. Garcia-Roger, J. F. Monserrat, and S. Roger, “Multi-connectivity management for 5G V2X communication,” in 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). IEEE, 2019, pp. 1–7.
  • [19] D. Moltchanov, A. Ometov, S. Andreev, and Y. Koucheryavy, “Upper bound on capacity of 5G mmWave cellular with multi-connectivity capabilities,” Electronics Letters, vol. 54, no. 11, pp. 724–726, 2018.
  • [20] T. Sylla, L. Mendiboure, S. Maaloul, H. Aniss, M. A. Chalouf, and S. Delbruel, “Multi-Connectivity for 5G Networks and Beyond: A Survey,” Sensors, vol. 22, no. 19, p. 7591, 2022.
  • [21] V. Petrov, D. Solomitckii, A. Samuylov, M. A. Lema, M. Gapeyenko, D. Moltchanov, S. Andreev, V. Naumov, K. Samouylov, M. Dohler et al., “Dynamic multi-connectivity performance in ultra-dense urban mmWave deployments,” IEEE Journal on Selected Areas in Communications, vol. 35, no. 9, pp. 2038–2055, 2017.
  • [22] M. Giordani, M. Mezzavilla, S. Rangan, and M. Zorzi, “Multi-connectivity in 5G mmWave cellular networks,” in 2016 Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net). IEEE, 2016, pp. 1–7.
  • [23] Z. Sattar, J. V. Evangelista, G. Kaddoum, and N. Batani, “Spectral efficiency analysis of the decoupled access for downlink and uplink in two-tier network,” IEEE Transactions on Vehicular Technology, vol. 68, no. 5, pp. 4871–4883, 2019.
  • [24] A. Shafie, N. Yang, and C. Han, “Multi-connectivity for indoor terahertz communication with self and dynamic blockage,” in ICC 2020-2020 IEEE International Conference on Communications (ICC). IEEE, 2020, pp. 1–7.
  • [25] M. G. Kibria, K. Nguyen, G. P. Villardi, W.-S. Liao, K. Ishizu, and F. Kojima, “A stochastic geometry analysis of multiconnectivity in heterogeneous wireless networks,” IEEE Transactions on Vehicular Technology, vol. 67, no. 10, pp. 9734–9746, 2018.
  • [26] V. Kamble, S. Kalyanasundaram, V. Ramachandran, and R. Agrawal, “Efficient resource allocation strategies for multicast/broadcast services in 3GPP long term evolution single frequency networks,” in 2009 IEEE Wireless Communications and Networking Conference. IEEE, 2009, pp. 1–6.
  • [27] M. Simsek, T. Hößler, E. Jorswieck, H. Klessig, and G. Fettweis, “Multiconnectivity in multicellular, multiuser systems: A matching-based approach,” Proceedings of the IEEE, vol. 107, no. 2, pp. 394–413, 2019.
  • [28] S. N. Chiu, D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic geometry and its applications. John Wiley & Sons, 2013.
  • [29] A. Abdulqader Hussein, T. A. Rahman, and C. Y. Leow, “Performance evaluation of localization accuracy for a log-normal shadow fading wireless sensor network under physical barrier attacks,” Sensors, vol. 15, no. 12, pp. 30 545–30 570, 2015.
  • [30] Chetlur, Vishnu Vardhan and Dhillon, Harpreet S, “Coverage and rate analysis of downlink cellular vehicle-to-everything (C-V2X) communication,” IEEE Transactions on Wireless Communications, vol. 19, no. 3, pp. 1738–1753, 2019.
  • [31] C. Xu, M. Sheng, V. S. Varma, T. Q. Quek, and J. Li, “Wireless service provider selection and bandwidth resource allocation in multi-tier HCNs,” IEEE Transactions on Communications, vol. 64, no. 12, pp. 5108–5124, 2016.
  • [32] X. Yang and A. O. Fapojuwo, “Coverage probability analysis of heterogeneous cellular networks in Rician/Rayleigh fading environments,” IEEE Communications Letters, vol. 19, no. 7, pp. 1197–1200, 2015.
  • [33] M. Jia, Z. Yin, Q. Guo, G. Liu, and X. Gu, “Downlink design for spectrum efficient IoT network,” IEEE Internet of Things Journal, vol. 5, no. 5, pp. 3397–3404, 2017.
  • [34] D. Moltchanov, “Distance distributions in random networks,” Ad Hoc Networks, vol. 10, no. 6, pp. 1146–1166, 2012.
  • [35] D. Berrar, “Bayes’ theorem and naive bayes classifier,” Encyclopedia of Bioinformatics and Computational Biology: ABC of Bioinformatics, vol. 403, p. 412, 2018.
  • [36] D. Stoyan, W. S. Kendall, S. N. Chiu, and J. Mecke, Stochastic geometry and its applications. John Wiley & Sons, 2013.
  • [37] “Study on evaluation methodology of new vehicle-to-everything (V2X) use cases for LTE and NR,” Sophia Antipolis Cedex, France, 3GPP, Tech. Rep. 37.885 v15.2.0, Dec 2018.
  • [38] “Coordinated multi-point operation for LTE physical layer aspects,” Sophia Antipolis Cedex, France, 3GPP, Tech. Rep. 36.819 v11.2.0, Sep 2013.
  • [39] H. Elshaer, M. N. Kulkarni, F. Boccardi, J. G. Andrews, and M. Dohler, “Downlink and uplink cell association with traditional macrocells and millimeter wave small cells,” IEEE Transactions on Wireless Communications, vol. 15, no. 9, pp. 6244–6258, 2016.
[Uncaptioned image] Luofang Jiao (Student Member, IEEE) received the B.S. degree in detection guidance and control technology from the University of Electronic Science and Technology of China, Chengdu, China, in 2020. He is currently working toward the Ph.D. degree with the School of Electronic Science and Engineering, Nanjing University, Nanjing, China. His research interests include uplink/downlink decoupled access, C-V2X, and heterogeneous networks.
[Uncaptioned image] Jiwei Zhao (Student Member, IEEE) received the M.S. degree in information and communication system from Xidian University, Xi’an, China, in 2018. He is currently working toward the Ph.D. degree with the School of Electronic Science and Engineering, Nanjing University, Nanjing, China. He won the first prize in the 2016 CCF (China Computer Federation) China Big Data and Cloud Computing Intelligence Contest. His research interests include fully-decoupled RAN architecture, coordinated multi-point, and machine learning applications for wireless communication.
[Uncaptioned image] Yunting Xu (Student Member, IEEE) received the B.S. degree in communication engineering from Nanjing University, Nanjing, China, in 2017, where he is currently pursuing the Ph.D. degree with the School of Electronic Science and Engineering. He mainly focuses on the dynamic resource management and networking optimization in the field of emerging wireless networks.
[Uncaptioned image] Tianqi Zhang (Student Member, IEEE) received the B.S. degree in electronic information science and technology from Nanjing University, Nanjing, China, in 2021, where he is currently pursuing the Ph.D. degree with the School of Electronic Science and Engineering. He mainly focuses on the FD-RAN, V2X, and machine learning in the field of emerging wireless networks.
[Uncaptioned image] Haibo Zhou (Senior Member, IEEE) received the Ph.D. degree in information and communication engineering from Shanghai Jiao Tong University, Shanghai, China, in 2014. From 2014 to 2017, he was a Postdoctoral Fellow with the Broadband Communications Research Group, Department of Electrical and Computer Engineering, University of Waterloo. He is currently a Full Professor with the School of Electronic Science and Engineering, Nanjing University, Nanjing, China. He was elected as an IET fellow in 2022, highly cited researcher by Clarivate Analytics in 2022 & 2020. He was a recipient of the 2019 IEEE ComSoc Asia–Pacific Outstanding Young Researcher Award, 2023-2024 IEEE ComSoc Distinguished Lecturer, and 2023-2025 IEEE VTS Distinguished Lecturer. He served as Track/Symposium CoChair for IEEE/CIC ICCC 2019, IEEE VTC-Fall 2020, IEEE VTC-Fall 2021, WCSP 2022, IEEE GLOBECOM 2022, IEEE ICC 2024. He is currently an Associate Editor of the IEEE Transactions on Wireless Communications, IEEE Internet of Things Journal, IEEE Network Magazine, and Journal of Communications and Information Networks. His research interests include resource management and protocol design in B5G/6G networks, vehicular ad hoc networks, and space-air-ground integrated networks.
[Uncaptioned image] Dongmei Zhao (Senior Member, IEEE) received the B.S.degree in wireless communication from Northern Jiaotong University (currently, Beijing Jiaotong University), Beijing, China, in 1992, and the Ph.D degree from the Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada, in June 2002. In July 2002, she joined the Department of Electrical and Computer Engineering, McMaster University, where she is a Full Professor. From April 2004 to March 2009, she was an Adjunct Assistant Professor with the Department of Electrical and Computer Engineering, University of Waterloo. Her current research areas are mainly in mobile computation offloading, energy efficient wireless networking, and vehicular communication networks. She is a Co-Chair of the Mobile and Wireless Networks Symposium of IEEE GLOBECOM Conference 2020, the Wireless Networking Symposium in IEEE GLOBECOM Conference 2007, the Green Computing, Networking, and Communications Symposium in International Conference on Computing, Networking and Communications 2020, the technical program committee for IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks 2016, the General Symposium of the International Wireless Communications and Mobile Computing (IWCMC) Conference 2007, and a co-chair of the Vehicular Networks Symposium of IWCMC from 2012 to 2019. He is an Associate Editor of the IEEE INTERNET OF THINGS JOURNAL. She served as an Associate Editor for the IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY from 2007 to 2017. She also served as an Editor for EURASIP Journal on Wireless Communications and Networking and Journal of Communications and Networks. She has been in Technical Program Committee of many international conferences in her fields. She is a Professional Engineer of Ontario.