Analysis and Design of Functional Device for Vehicular Cloud Computing

Abstract

Relay technology application becomes prevalent nowadays, as it can effectively extend the communication distance, especially for vehicular networks with a limited communication range. Combined with vehicular cloud (VC), transmission efficiency can be improved by offloading partial data. Hence, designing a vehicle relay algorithm and implementation embedded vehicle device is critical. In this paper, VC is considered to deal with the complexity computation in our proposed system model. Without a loss of generality, an end-to-end vehicle communication with one assisted vehicle is analyzed firstly on a transmission link based on VC. Here, the signal-to-noise ratio (SNR) on the receiving end and link outage probability is obtained to enhance the link reliability. The VC computing helps us further simplify computational complexity. Subsequently, an embedded vehicle-enabled device is designed to achieve the optimal path relay selection in realistic vehicular environments. In the functional device framework, we display an optimal path relay selection algorithm according to the link quality. Finally, the performance of the transmission link on the outage probability related with SNR is verified in the simulation results. Meanwhile, the effect of the relay gain is also analyzed. The application of a vehicle-enabled embedded device could improve the performance of vehicular networks.

1. Introduction

Vehicular ad hoc networks (VANETs) are a special mobile ad hoc network for implementing various road traffic applications [1]. It can improve the future development of the transportation system via wireless communication technologies, such as advanced information processing, wireless communication, and device-to-device communication [2,3]. The highly dynamic topological changes on the network structure and multiple service requirements of users bring significant challenges for VANET applications.

As we all know, safety message transmissions are critical to ensure road traffic safety in vehicular networks. IEEE standards 802.11p [4] and 1609.4 [5] were developed to ensure reliable communication in the highly dynamic propagation environment of vehicular networks. The original IEEE 802.11p standard was based on a media access control (MAC) sublayer that showed poor performances in provisioning the quality of service (QoS) for different applications in dense VANETs [6,7]. These problems were particularly important for the reliable transmission of safety messages. Therefore, the multichannel extension IEEE 1609.4 standard was proposed to improve the imperfection in the IEEE802.11p standard.

In suburban environments, there are spare infrastructures and few vehicles, which is why cooperative relay technologies have been proposed recently as an efficient solution to cope with the many challenges in VANETs [8,9,10,11]. In vehicular networks, road-safety warnings, road-condition reports, and other safety messages are critical for ensuring road traffic safety. To employ a rational use of networks resources, cooperation can be employed to help users take advantage of the broadcast nature of radio frequency transmissions. In this paper, we consider the two-hop transmission case between the source vehicle and destination vehicle. It is possible that there is not a direct link between the source vehicle and destination vehicle. When a source vehicle communicates with a destination vehicle via another vehicle acting as a relay-assisted role, a two-hop vehicular system is formed. We will analyze these two-hop vehicular networks in performance and further realize it in following works.

Specifically, we study the end-to-end vehicle communication in obeying Dedicated Short Range Communications (DSRC). The assisted vehicle can be introduced to relay transmission messages between two end-to-end vehicles. Then, we analyze the performance of assisted vehicles on a transmission link based on VC. In addition, an optimal path relay selection algorithm is proposed and applied to design an embedded vehicle-enabled device. The major contributions of this paper are as follows:

• Employs a novel graph model to model a vehicle-to-vehicle communication scenario which deploys respectively in a two adjacent Roadside Units (RSUs) area.
• Analyzes link outage probability and gives out expresses depending on SNR in receiving end in end-to-end communication.
• Designs a functional device for vehicular cloud computing to realize a relay-assisted scheme for vehicular application.
• Proposes an optimal path relay selection algorithm to cope with the vehicle transmission problem which is beyond the transmission range.

The rest of this paper is organized as follows. Some related works are introduced in Section 2. Section 3 provides the system model of amplify-and-forward (AF) relay-assisted vehicular networks. Based on the Section 3, Section 4 discusses the specific performance analysis on the probability of an outage with a directing communication channel and relay-assisted communication channel. Whereafter, a relay-assisted scheme for vehicular networks is proposed in Section 5. In Section 6, the simulation results reveal that the relationship between the outage probability and the SNR are evaluated to confirm the suitability of the proposed relay-assisted scheme. Finally, Section 7 summarizes and concludes this paper.

2. Related Works

Recently, many works have been researched on relay selection applications due to its advantages in vehicular networks [12,13,14,15]. Reference [12] proposed a power allocation and relay selection scheme limited by outage probability to increase the performance of vehicular networks. Reference [13] reported on cooperative diversity with relay selection over cascaded Rayleigh fading channels in dual-hop decode-and-forward (DF) vehicular networks. Reference [14] proposed the optimal relay scheme by considering the vehicle location and link capacity in vehicular networks. However, these relay schemes also brought complicated data frame communication process and computing on performance analysis. The cooperative communication tailored as vehicular cooperative media access control (VC-MAC) is designed in Reference [15] to maximize the system capacity. The current results are within the limits of congestion control issues, the Rayleigh fading channel assumption, the maximum end-to-end capacity, and cooperation downloads for vehicular networks. Experimental and theoretical studies have researched appropriate fading models under the condition of a Rayleigh fading channel for inter-vehicular channels.

In cascaded rayleigh fading, the performance of relaying for vehicular cooperative strategy assisted by a RSU or relay which acts as relay is investigated [16]. It carried out a further comprehensive analysis based on Reference [17] which only considers RSUs which act as relays. Reference [18] proposed a vehicle-to-vehicle communication protocol for cooperative collision warnings. However, they mainly consider a low latency when delivering emergency warnings in various road situations. The QoS of vehicular networks, which considers the possibility of an outage during emergency warnings communication, is not considered. To improve QoS, decentralized relay-assisted multiuser multiple-input multiple-output (MIMO) approaches are widely used in References [19,20,21,22]. Reference [23] mainly studied the promising effects of cooperative transmissions in radio frequency communications. The two-transmitter case was considered, but it did not consider the direct transmission case between the source vehicle and destination vehicle. The introduction of vehicular cloud computing has promoted the development of related vehicular technologies [24,25]. In Reference [26], two opportunistic relay selection algorithms were proposed and the results showed that the selected relay had an impact on the interference generated in the network and the stability of the relay. To minimize these interference, the authors proposed a suitable relay selection scheme [27]. These works also did not consider the complicated calculations and transmission delay caused by the analysis.

Real-time data transmission response was the key feature of DSRC in a rapidly changing environment. Data dissemination was one of most critical issues for vehicular traffic environments [28]. These real-time data applications required complex computations and brought challenges in implementing applications for vehicle devices [29,30]. Recently, many researches adopted clod computing to address these challenges for vehicle devices. Reference [31] proposed a geocast routing protocol for the reliable and efficient dissemination of data due to an increase in vehicular applications favoring geocasting. Reference [32] designed a beaconless packet forwarding protocol by considering the vehicle direction and link quality during packet transmission. However, these protocols suffered from higher end-to-end delays in vehicular networks.

3. System Model

The main reliable wireless technologies implementation of the vehicular networks is DSRC. Due to vehicle mobility and network topology changes, communication between vehicles is sometimes not possible by direct transmission according to DSRC. We focus on a two adjacent RSUs and vehicles scenario where vehicle S attempts to transmit a message to vehicle D, as shown in Figure 1. The road is a two-lane unidirectional road, and RSUs (such as $RS{U}_a$ and $RS{U}_b$) are deployed along the road. Vehicles on the road have uninterrupted traffic in a free flow state. When communicating between the source vehicle S and the destination vehicle D, we assume they are in two adjacent different areas. DSRC provides two communication modes in the networks: Vehicle-to-Infrastructure (V2I) communication and Vehicle-to-Vehicle (V2V) communication. Cloud-based services and vehicular networks are combined to form a VC. It provides powerful computing power, also known as vehicular cloud computing. Some complex calculations can depend on VC to realize the computation in this V2I transmission mode, and the V2V transmission mode ensures a transmission between the source vehicle and destination vehicle.

3.1. V2I Communication

All vehicles communications in vehicular networks can be regard as a VC for processing some complicated service applications. In addition, all vehicles can upload data to the VCs through RSUs in their respective region. Meanwhile, each RSU also provides wireless access services within its communication range for the vehicles. For complex service applications and computation, vehicles transmit their data to RSUs by a V2I communication mode as of limited computation resource. Based on the V2I communication mode, the vehicle can only access the corresponding RSU located on the road when it runs within a given segment.

The communication between the adjacent RSUs through wireless backhauls. The RSUs establish a communication connection with the VCs. Vehicles within the communication range of each RSU cannot transmit the received data to the other RSU. In other words, the vehicle in the coverage area of $RS{U}_a$ cannot communicate with $RS{U}_b$ directly. The same applies to vehicles in the coverage area of $RS{U}_b$. The vehicle cloud formed by all vehicles in networks can communicate with any device in the entire network. This communication mechanism can improve the transmission efficiency of wireless backhauls. Vehicles also receive data/commands from the corresponding RSU for VC.

3.2. V2V Communication

In vehicular networks, both the vehicles and RSUs have short range communications due to their DSRC devices. In addition, a vehicle runs on a road with a steady speed, and the traffic in terms of vehicles remains stable. When one vehicle within the $RS{U}_a$ coverage range attempts to transmit messages to another vehicle within the $RS{U}_b$ coverage range, a V2V communication link is required to forward messages through one relay vehicle (such as $R_i$, $i\in \{1,2,\cdots ,N\}$, where N is the total number of candidate relay nodes). The system model is shown in Figure 1.

In a Rayleigh-fading work scenario, a moving vehicle S has critical messages to transmit to a moving vehicle D. Each vehicle is equipped with a GPS device. Hence, the position coordinates are known. The maximum communication range for every vehicle is fixation $R_{max}$, and the distance between vehicle S and vehicle D is denoted as $d_{SD}$, which is

$$d_{SD}=\sqrt{{(y_D-y_S)}^2+{(x_D-x_S)}^2}.$$

(1)

where $(x_S,y_S)$ and $(x_D,y_D)$ are the respective coordinates of vehicle S and vehicle D.

When vehicle S attempts to establish a communication link with vehicle D, there are two cases: direct communication and indirect communication. One case happens at $d_{SD}\le R_{max}$ and the other case happens at $d_{SD}>R_{max}$, where $R_{max}$ is the maximum communication range of one vehicle. We assume that vehicle S attempts to transmit a signal $x\left(t\right)$, which has an average power $P_s$, to vehicle D.

3.2.1. Direct Communication

For the case of direct communication, the vehicle D receives a signal $x\left(t\right)$ from vehicle S via a wireless channel. The receiving signal is written as

$$y_0\left(t\right)=\sqrt{P_s}{h}_{0}x\left(t\right)+n_0\left(t\right).$$

(2)

where $h_0$ is an $S\to D$ channel coefficient and $n_0\left(t\right)$ is an additive white Gaussian noise (AWGN) term with a one-sided power spectral density (PSD) $N_0$.

The SNR related to a direct communication link at the receiving end can be calculated as

$$\begin{array}{ll}{\gamma }_0& =\frac{P_s{\left|h_0\right|}^2}{|n_0{\left(t\right)|}^2}\\ & =\frac{P_s{\left|h_0\right|}^2}{N_0}.\end{array}$$

(3)

3.2.2. Indirect Communication

For the case of indirect communication, the candidate vehicle set $R_i$ is adopted in this case, and the $R_i$ which occurs between vehicle S and vehicle D is essential. The vehicle S transmits a signal $x\left(t\right)$ to vehicle D, which is beyond the communication range, with the help of one assisted vehicle belonging to $R_i$. Suppose the established links are independent of each other.

Similarly, we assume that vehicle S is transmitting a signal $x\left(t\right)$ to vehicle D via one relay-assisted vehicle that is within the $R_i$ set. The received signal $y_r\left(t\right)$ by one relay vehicle which is in $R_i$ is given by

$$y_r\left(t\right)=\sqrt{P_s}{h}_{1}x\left(t\right)+n_1\left(t\right),$$

(4)

where $h_1$ is an $S\to R_i$ channel coefficient and $n_1\left(t\right)$ is an AWGN term with a one-sided PSD $N_0$. The term $n_1$ exists in the first hop channel.

When the signal is received by one relay vehicle, which is in $R_i$, it will be processed (Obeying Amplify-and-Forward (AF) protocol) by gaining modulation A. Then, the processed signal is transmitted to the destination vehicle via a relay channel that is between $R_i$ and D. The received signal at terminal D can be expressed as

$$\begin{array}{c}\hfill y_d\left(t\right)=\sqrt{P_s}{h}_1{h}_{2}Ax\left(t\right)+A{h}_2{n}_1\left(t\right)+n_2\left(t\right).\end{array}$$

(5)

where $h_2$ is an $R_i\to D$ channel coefficients and $n_2\left(t\right)$ is an AWGN with a one-sided PSD $N_0$. The term $n_2$ is in the second-hop channel. According to Equation (5), the overall SNR at the receiving terminal can be written as

$$\begin{array}{ll}{\gamma }_{AF}& =\frac{P_s{\left|A{h}_1{h}_2\right|}^2}{{\left|A{h}_2{n}_1\left(t\right)\right|}^2+{\left|n_2\left(t\right)\right|}^2}\\ & =\frac{P_s\frac{{\left|h_1\right|}^2}{N_0}\frac{{\left|h_2\right|}^2}{N_0}}{\frac{h_2^2}{N_0}+\frac{1}{A^2{N}_0}}.\end{array}$$

(6)

Under certain environmental or channel correlation coefficients, we can infer from Equation (6) that the choice of AF relay gain A is equivalent to the SNR for two-hop channels. The AF relay gain A is thus given by Reference [33]

$$A=\sqrt{\frac{P_i}{P_s{h}_1^2+N_0}}.$$

(7)

where $P_i$ is the power of the relay node, and we assume all vehicles have the same power in this paper, that is $P_i=P_s$.

As a short hand notation, we use the notations ${\gamma }_1=\sqrt{P_s}{h}_1^2/N_0$ and ${\gamma }_2=\sqrt{P_s}{h}_2^2/N_0$ to denote the SNRs of the per hop channel. The instantaneous SNR of a two-hop channel is

$$\left\{\begin{array}{c}\hfill {\gamma }_1\sim \xi (1/{\overline{\gamma }}_1),\\ \hfill {\gamma }_2\sim \xi (1/{\overline{\gamma }}_2),\end{array}\right.$$

(8)

where ${\overline{\gamma }}_1$ and ${\overline{\gamma }}_2$ are the average SNRs of the two channels respectively. The notation $y\sim \xi \left(x\right)$ denotes that y is exponentially distributed with parameter x.

In this case, by substituting Equation (7) into Equation (6) and by assuming $P_s=P_i=1$, we obtain ${\gamma }_{AF}$ as follows

$${\gamma }_{AF}=\frac{{\gamma }_1{\gamma }_2}{{\gamma }_1+{\gamma }_2+1}.$$

(9)

The form of the equivalent SNR in Equation (9) is not easily tractable with our approach. This is due to the complexity in finding the statistics (i.e., the Probability Density Function (PDF), Cumulative Distribution Function (CDF), and Moment Generation Function (MGF)) associated with it. The fading parameter of the first link $h_1$ is low. The choice of the above gain aims to limit the output power of the vehicle (relay) $R_i,i\in \{1,2,\dots ,N\}$.

At a higher SNR, the constant 1 in the denominator of Equation (9) can be omitted. Fortunately, this treatment can be tightly bounded. As a result, Equation (9) can be approximated by

$$\begin{array}{ll}{\gamma }_{AF}& \approx \frac{{\gamma }_1{\gamma }_2}{{\gamma }_1+{\gamma }_2}\\ & ={\left(\frac{1}{{\gamma }_1}+\frac{1}{{\gamma }_2}\right)}^{-1}.\end{array}$$

(10)

In Equation (10), the fading parameter of the $S\to R_i$ channel, ${\gamma }_1$, is high. This implies that the relay choice gain A in Equation (7) can omit the noise, $N_0$, and can be re-written as

$$A=\frac{1}{h_1}.$$

(11)

To get the PDF of ${\gamma }_{AF}$, we need to recall the definition of the harmonic mean and of an exponential variation in Reference [34,35]. We notice that

$${\gamma }_{AF}=\frac{1}{2}\times \mu ({\gamma }_{S,R_i},{\gamma }_{R_i,D}),$$

(12)

where $\mu ({\gamma }_1,{\gamma }_2)$ is defined as the reciprocal of the arithmetic mean of the reciprocals of channel $S\to R_i$ and $R_i\to D$.

From Equation (8), we can get key results on the statistics of the harmonic mean of two independent exponential RVs (Random Variables). If we assume that

$$\left\{\begin{array}{ccc}\hfill {\gamma }_1& =& 1/\overline{{\gamma }_1},\hfill \\ \hfill {\gamma }_2& =& 1/\overline{{\gamma }_2},\hfill \end{array}\right.$$

(13)

then we can get the PDF of ${\gamma }_{AF}$ in Equation (10) by using the following transformation of variables

$$p_{\tau }\left(\gamma \right)=2p\left(2\gamma \right).$$

(14)

The PDF ${\gamma }_{AF}$ is now written as $p_{\tau }\left(\gamma \right)$ by substituting Equation (8) into Equation (14) and in light of the PDF of the Harmonic Mean of Two Exponential RVs in Reference [34] and after two modifications. Hence,

$$p_{\tau }\left(\gamma \right)=\frac{2\gamma e^{-\gamma (\frac{1}{\overline{{\gamma }_{S,R_i}}}+\frac{1}{\overline{{\gamma }_{R_i,D}}})}}{1/(\overline{{\gamma }_{S,R_i}}·\overline{{\gamma }_{R_i,D}})}\left[\left(\frac{\overline{{\gamma }_{S,R_i}}+\overline{{\gamma }_{R_i,D}}}{\sqrt{\overline{{\gamma }_{S,R_i}}·\overline{{\gamma }_{R_i,D}}}}\right)K_1\left(\frac{2\gamma }{\sqrt{\overline{{\gamma }_{S,R_i}}·\overline{{\gamma }_{R_i,D}}}}\right)+2K_0\left(\frac{2\gamma }{\sqrt{\overline{{\gamma }_{S,R_i}}·\overline{{\gamma }_{R_i,D}}}}\right)\right].$$

(15)

4. Performance of Two-Hop Relay-Assisted Vehicular Networks

In terms of mobility and the changing topology of vehicular networks, we need to ensure that safety messages will be transmitted with a high quality and timeliness. In this case, we assume that the end-to-end transmission rate is R. As we know, the channel capacity is a measure of the maximum channel capacity to transmit information.

4.1. $S\to D$ Link

For wireless vehicular networks, the mutual information capacity $C_{SD}$ of the $S\to D$ link channel could be easy to achieve from Equation (3) via the Shannon theory,

$$C_{SD}=\frac{1}{2}{log}_2\left(1+{\gamma }_0\right).$$

(16)

The outage probability is defined as the probability of event $C_{SD}<R$ that the instantaneous channel capacity $C_{SD}$ falls below this desired rate R, namely

$$\begin{array}{ll}{P}_{out}^{SD}& =P[C_{SD}<R]\\ & =P[\frac{1}{2}{log}_2\left(1+{\gamma }_0\right)<R]\\ & =P[{\gamma }_0<2^{2R}-1]\\ & =1-e^{-\frac{2^{2R}-1}{{\gamma }_0}}.\end{array}$$

(17)

There have been a lot of research works in this direct communication case. Therefore, this work mainly focuses on the following $S\to R_i\to D$ link case.

4.2. $S\to R_i\to D$ Link

The capacity of the $S\to R_i\to D$ link can be inferred using the Shannon theory and in combination with Equation (9). The capacity of this link is denoted as $C_{AF}$,

$$C_{AF}=\frac{1}{2}{log}_2\left(1+\frac{{\gamma }_1{\gamma }_2}{{\gamma }_1+{\gamma }_2+1}\right).$$

(18)

To ensure QoS, the SNR threshold ${\gamma }_{th}$ is defined, and it essentially depends on the modulation type. In this case, the outage probability of the link $(S\to R_i\to D)$ is defined as the probability with an instantaneous SNR, $\gamma$, that falls below a protection threshold, namely [34]

$$P_{out}=P\left(\gamma <{\gamma }_{th}\right).$$

(19)

Here, ${\gamma }_{th}$ is given by

$${\gamma }_{th}=2^{2R}-1.$$

(20)

Substituting Equation (14) into Equation (13) leads to the approximate expression in Equation (13) for the case in Equation (10), which is given by

$$\begin{array}{ll}{P}_{out}& =P\left({\left(\frac{1}{\frac{1}{{\gamma }_1}+\frac{1}{{\gamma }_2}}\right)}^{-1}<2^{2R}-1\right)\\ & =1-\frac{2{\gamma }_{th}}{\sqrt{\overline{{\gamma }_1}\overline{{\gamma }_2}}}{K}_1\left(\frac{2{\gamma }_{th}}{\sqrt{\overline{{\gamma }_1}\overline{{\gamma }_2}}}\right)e^{\left(\frac{-{\gamma }_{th}}{\overline{{\gamma }_1}}+\frac{-{\gamma }_{th}}{\overline{{\gamma }_2}}\right)},\end{array}$$

(21)

where $K\left(•\right)$ is a first-order modified Bessel function of the second kind. Therefore, from the above context and Equation (8), we see that the distribution of the approximated expression of in Equation (15) is given as follows [35]:

$$P_{out}\approx 1-\frac{2\left(2^{2R}-1\right)}{\sqrt{\overline{{\gamma }_1}\overline{{\gamma }_2}}}{K}_1\left(\frac{2\left(2^{2R}-1\right)}{\sqrt{\overline{{\gamma }_1}\overline{{\gamma }_2}}}\right)e^{\left(\frac{-\left(2^{2R}-1\right)}{\overline{{\gamma }_1}}+\frac{-\left(2^{2R}-1\right)}{\overline{{\gamma }_2}}\right)}.$$

(22)

This complex operation can be handled at VC for reducing communication loads on a vehicle. Although the introduction of VC technology has increased the computing power for the vehicular networks, complex calculations will increase the time consumption of a VC computing process [36]. This will increase the safety messages transmission delay. Therefore, further computational simplification is necessary.

When $K_1\left(x\right)\approx 1/x,x\to 0$ [37], $K_1\left(\frac{2{\gamma }_{th}}{\sqrt{\overline{{\gamma }_1}\overline{{\gamma }_2}}}\right)\approx \frac{\sqrt{\overline{{\gamma }_1}\overline{{\gamma }_2}}}{2{\gamma }_{th}}$ at a higher SNR. Hence, we can utilize the property to re-calculate the outage probability in Equation (22) as

$$P_{out}\approx 1-e^{\left(\frac{-\left(2^{2R}-1\right)}{\overline{{\gamma }_1}}+\frac{-\left(2^{2R}-1\right)}{\overline{{\gamma }_2}}\right)}.$$

(23)

By utilizing the first-order Taylor formula approximation about the exponential function, we can approximate the expression in Equation (23) further as

$$P_{out}\approx \left(\frac{1}{\overline{{\gamma }_1}}+\frac{1}{\overline{{\gamma }_2}}\right)\left(2^{2R}-1\right).$$

(24)

Equation (24) for the outage probability, in addition to being an approximate formula for the choice of destination SNR in Equation (10), is also a simple lower bound for AF relay-assisted vehicular networks. To benefit the device deployment, the process also reduces the computational complexity of the equipment.

5. Design of Relay-Assisted Scheme for Vehicular Application

5.1. Embedded Device Design

The designed function module diagram of the vehicular device is illustrated in Figure 2 and based on Reference [38]. This embedded function device includes the following five modules: Receiving Unit, Collection Unit, Determining Unit, Sending Unit, and Storage Unit. Various Units work compatibly with one another. The Collection Unit, Determining Unit, and Storage Unit can be implemented by one or more processors. Additionally, the Receiving Unit and Sending Unit can be implemented by the antenna, filter, modulator-demodulator, and coder-decoder.

In this device, the modules cooperate with one another. The functions of each part of this relay-assisted device are described as follows:

Receiving Unit: Can be configured to receive relay-assisted setup requests from a source communication device.

Collection Unit: Can be configured to respond to channel information collecting requests and to collect two-hop channel SNRs.

Determining Unit: Can be configured to receive SNRs from all candidate relay-assisted communication devices and to determine if one or more relay-assisted communication devices are needed.

Sending Unit: Can be configured to transfer a relay-assisted setup request to and from a source communication device, one or more relay-assisted communication devices, and a destination device.

Storage Unit: Can be configured to save the acquired SNRs and relative tags of all candidate relay-assisted communication devices.

This device can be placed in the control device of vehicular networks, and it is not limited to this placement. In summary, this device can be placed in any vehicle that is part of the vehicular networks. Source vehicle S can transfer messages to the destination vehicle D via relay-assisted vehicles $R_i$. Figure 1 illustrates this vehicular networks scenario.

Source vehicle S can send a relay setup request and/or channel information collection requests to the designed device. The Receiving Unit of this designed device receives the requests. Then, the Collection Unit of this designed device detects the channel information from where it is. Subsequently, the Determining Unit of this designed device achieves the SNRs, ${\gamma }_1$ and ${\gamma }_2$, for each candidate vehicle and selects one candidate vehicle as the relay-assisted vehicle on the basis of this information to communicate with destination vehicle D. The ${\gamma }_1$ and ${\gamma }_2$ are obtained from the VC. We note that the Determining Unit can also be configured to be a Storage Unit. This way, the system can further reduce the amount of information requiring an exchange between the candidate communication devices and the designed device that can improve the network’s efficiency. Finally, the Sending Unit sends the relay setup information mark, which has been designated to carry out the communication process to the source vehicle, selected relay vehicle, and destination vehicle. Storage Unit b must also save this information to reduce the processing time and to improve the network efficiency.

To the best of my knowledge, some mentioned embodiments of this designed device can be implemented by partially or fully using hardware and/or firmware. Therefore, this device can be widely used in vehicular networks in the future.

5.2. Optimal Path Selection Algorithm

With topological changes and high speed vehicles joining vehicular networks, especially on freeways, vehicular networks have many additional technical challenges, such as great channel fading and poorly received signal quality. Cooperation-based communication technologies can take advantage of wireless terminal devices to establish multiple communication links when sending and receiving information that can overcome fading radio channels via conventional multi-antenna spatial diversity techniques and by improving wireless network system performance and robustness. This way of selecting relay-assisted vehicles could achieve a higher functionality when communication links are dynamically selected. Furthermore, the vehicular network communication efficiency can be improved by this process.

Here, one vehicle communicates with another vehicle via a relay-assisted vehicle when zero-forcing (ZF) detectors [33] are employed to receive the messages and suppress interference. This type of relay technique is leveraged in this paper, which is an industrial communication solution for long-distance, cooperative connectivity [13]. For high-speed vehicular networks, Reference [39] proposed a scheme to provide a full-duplex relaying connectivity for an unstable direct link and imprecise channel state information (CSI). Reference [40] also cites out the effect of outdated channel state information on the outage and error rate performance of AF relay selection, where only one out of the set of available relays is selected.

Relay techniques are further exploited in this paper. These techniques have been an industrial communication solution for long-distance transmission. The basic system model is illustrated in Figure 1.

From Equation (10), we need to know ${\gamma }_{AF}$ at the ith path. Apparently, this random formula accounts for the channel gain of both $S\to R_i$ and $R_i\to D$ links. The total SNR set via the ith path is defined as

$$U_i={\gamma }_{AF}\left(i\right),i=1,2,\dots ,N.$$

(25)

Theoretically, we know that the designed device can be theoretically put into any device in the vehicular networks, as described in Section 5.1. In this paper, we assume that the designed device is embedded in the source vehicle. On the other hand, we assume that the source vehicle could get all outdated CSI from the set of relays. When the source vehicle receives packets, which include $U_i$, the destination will analyze this set and select the “best” relay-assisted vehicle $n^{\ast }$, expressed as

$$n^{\ast }=argma{x}_{i\in 1,2,\dots ,N}{U}_i.$$

(26)

The presence of an optimal path selection operation within a vehicle device in two-hop vehicular networks is identified by Algorithm 1. This algorithm is executed in the VC, and the execution results are notified by the VC to all vehicles in the vehicular networks via an RSU. All vehicles transmit their own information and related channel information to the cloud. After a series of processing as in Section 5.1, the cloud feeds the final result back to all vehicles in vehicular networks to help the source vehicle discover the assisted vehicle.

When the source vehicle S requires the assisted vehicle to relay information to the destination vehicle D, it is easy to see from Algorithm 1 that all vehicles upload their own information and channel information to the VC. The VC uses its computing power to compute the SNR of each link between vehicles according to our analysis in Section 4. Then, the VC downloads the final results to all vehicles in the vehicular networks. The source vehicle S could select an optimal vehicle as an assisted vehicle to transmit information to the destination vehicle D according the received information from the VC.

Algorithm 1 The optimal path relay selection based on the vehicular cloud (VC).

1: Geographical location coordinate acquisition: $(x_S,y_S)\to S$, $(x_D,y_D)\to S$;   2: S uploads computing information: $S\to VC$;   3: forSdo   4:       $d_{SD}=\sqrt{{(y_D-y_S)}^2+{(x_D-x_S)}^2};$   5: end for   6: if$d_{SD}\ge R_{max}$then   7:       Collecting the maximum number of vehicles $R_i,i\in \{1,\dots ,N\}$ with the range of radius $R_{max}$ from S to D;   8:       for $i=1$ to N do   9:           Upload the first hop link channel information: $h_{S,R_i}\to VC$; 10:           Upload the second hop link channel information: $h_{R_i,D}\to VC$; 11:           VC: ${\gamma }_{1,i}=h_{S,R_i}^2/N_0$ and ${\gamma }_{2,i}=h_{R_i,D}^2/N_0$; 12:           Download computation results ${\gamma }_{AF,i}={(\frac{1}{{\gamma }_{1,i}}+\frac{1}{{\gamma }_{2,i}})}^{-1}$: $VC\to S$; 13:       end for 14:       $U=sort\left({\gamma }_{AF}\right)$; 15:       $Q=fliplr\left(U\right)$; 16:       $n^{\ast }=Q\left(1\right)$. 17:       $n^{\ast }$ is denoted as an optimal relay-assisted vehicle. 18: else 19:       S communicates directly with D. 20: end if

6. Simulation Results

In this section, we use a rigorous mathematical analysis to discuss the performance of vehicular networks. The experimental results evaluate the performance of vehicular networks for an outage probability based on the designed relay-assisted selection scheme by using MATLAB tools. As directing the transmission between S and D is a simply wireless communication link from Section 4.1 and has many experimental results, we cannot do the experiments again in this work. The simulation scenario mainly considers a two-hop relay vehicular network where a vehicle can transmit messages to other vehicles via a relay vehicle. According to Section 5.1, vehicles could collect SNR information which is embedded in the packet header from the upper vehicles in the device.

To verify the performance of the system, a Monte Carlo simulation (1000 times) is adopted via MATLAB toolboxes. Subsequently, the PDF in Equation (15) is illustrated in Figure 3. The analytical results are an excellent match to the simulation results for the cases where ${\gamma }_1={\gamma }_2$, $2{\gamma }_2$, and $3{\gamma }_2$. With the growth of $\gamma$, the outage probability of $p_{\tau }\left(\gamma \right)$ gradually decreases until it reaches 0. Before $\gamma =0.5$, the outage probability of $p_{\tau }\left(\gamma \right)$ gradually increases from the bottom (diamond line) to the top (star line). After $\gamma =0.5$, we get opposite results from before $\gamma =0.5$.

Based on the analysis of Section 3, we know the instantaneous SNR ${\gamma }_{AF}$ depends on the gain A. When the gain A is $\sqrt{P_s/(P_s{h}_1^2+N_0)}$, the instantaneous SNR ${\gamma }_{AF}$ is equivalent to Equation (9). Hereafter, we get the approximated instantaneous SNR Equation (10). In this situation, the gain A is $1/h_1$. The various SNRs have some effects on the outage probability of vehicular networks. In vehicular networks, a vehicle-assisted network adopts the AF protocol. The gain’s influence on the relay system is shown in Figure 4.

Equation (7) helps us get a tight lower bound for an AF system instead of being an exact formula for the choice of relay gain in Equation (11). From the analysis of Section 3, we know the instantaneous SNR ${\gamma }_{AF}$ is dependent on the gain A. The different SNRs have some effects on the outage probability of vehicular networks. Figure 4 plots the types of relay gain effects on relay systems. We can see from the figure that the two curves are essentially indistinguishable for all practical purposes with the growth of SNR. Thus, the outage probability is essentially indistinguishable according to the two curves, especially at higher SNRs.

The variation of the outage probability with $\gamma$ at different AF relay A gains has been studied for setting an outage threshold ${\gamma }_{th}$. The results of the outage probability versus outage threshold ${\gamma }_{th}$ are shown in Figure 5 for different values of $\gamma$. We can see that the higher SNR $\gamma$ reduces the outage probability in all AF relay gain cases. Moreover, it is clear that, for the same $\gamma$ case, the two curves are essentially indistinguishable.

During the process of deriving the final outage probability, we obtained some intermediate results, such as Equations (22) and (23). These results can help us better evaluate the performance of vehicular networks. Figure 6 compares the performance of AF relay-assisted vehicles for the cases where ${\gamma }_1={\gamma }_2$, $2{\gamma }_2$, and $3{\gamma }_2$ in terms of Equation (22). With the growth of SNR $\gamma$, the outage probability $P_{out}$ gradually decreases to 0. At a lower SNR, the outage probability $P_{out}={10}^0$ varies slowly until a sharp decline at $\gamma =5$ dB. On the other hand, the outage probability is essentially indistinguishable with the growth of ${\gamma }_1$ when compared with ${\gamma }_2$ from the SNR $\gamma =25$ dB.

In comparison with Equation (22), Equation (23) provides more accurate approximate results at a higher SNR via the handling function $K_1\left(x\right)$. The outage probability numerical results are shown in Figure 7. It shows almost the same curve trend as that shown in Figure 6, except there is a subtle difference in the case of ${\gamma }_1={\gamma }_2$, $2{\gamma }_2$, and $3{\gamma }_2$. At a lower SNR, the outage probability $P_{out}={10}^0$ varies slowly until it sharply declines at $\gamma =3$ dB.

Figure 8 shows the outage probability of AF relay-assisted vehicular networks based on the Taylor expansion $e^x$. The result of Equation (24) greatly reduces the complexity of the outage probability $P_{out}$. In Figure 8, the outage probability $P_{out}$ declines with the growth of SNR $\gamma$. Similarly, in Figure 6 and Figure 7, when ${\gamma }_1=2{\gamma }_2$ and ${\gamma }_3$, the outage probability results are essentially indistinguishable. It is easier to achieve an in-vehicle device in practice; however, the outage probability deteriorates from ${10}^0$ to ${10}^{0.7}$ at $\gamma =2$ dB. However, this deterioration is stopped at a high SNR where $\gamma =35$ dB.

In spite of simplifying the gradually outage probability expression from Equation (22) and Equation (23) to Equation (24), there is an excellent match expression among the analytical results. Figure 9 compares the performance of the outage probability versus the outage threshold ${\gamma }_{th}$, while the overall SNR $\gamma =8$. With regard to the achieved trend related to ${\gamma }_1={\gamma }_2,2{\gamma }_2$, and $3{\gamma }_2$, it can be observed that the three outage probability type curves are essentially indistinguishable between the three subgraphs. The final expression could describe the performance of system. However, the computational complexity is greatly reduced.

7. Conclusions

In this paper, we proposed a system model of AF relay-assisted two-hop vehicular networks in Rayleigh fading channels. By analyzing these results, we designed a relay-assisted scheme for vehicular applications that includes device deployment units and a relay-assisted vehicle selection algorithm. In addition, the numerical results show that the proposed relay-assisted selection scheme could improve the performance of vehicular networks, and the expression is simple. The outage probability of networks deteriorates at a low SNR. However, at a high SNR, these essentially indistinguishable results show that the three kinds of outage probability expressions are essentially equivalent.