Reaching spatial or networking saturation in VANET

Serkan Öztürk; Jelena Mišić; Vojislav B Mišić

doi:10.1186/1687-1499-2011-174

Research
Open Access

Reaching spatial or networking saturation in VANET

Serkan Öztürk¹Email author,
Jelena Mišić² and
Vojislav B Mišić²

EURASIP Journal on Wireless Communications and Networking20112011:174

https://doi.org/10.1186/1687-1499-2011-174

Received: 29 June 2011
Accepted: 18 November 2011
Published: 18 November 2011

Abstract

In this article, we investigate the network transition between non-saturation and saturation regimes for a Vehicular Ad hoc Network (VANET) which is composed of mobile nodes. We combine vehicular traffic theory, queuing model, and Markov chain to evaluate the performance of the network under spatial or networking saturation for multiple data classes over control channel and service channel. Our results indicate that the vehicle density growth can result in saturation of wireless medium around the roadside unit (RSU), further resulting in buffer overflows at on board units (OBUs). We also investigate the network saturation points for different transmission ranges of a RSU. Our results show that RSU's transmission coverage has to be chosen with respect to data patterns of OBUs, minimal distance between vehicles, and number of lanes in order to avoid network saturation condition.

Keywords

IEEE 802.11p
vehicular traffic theory
free-flow regime
network saturation

1 Introduction

Vehicular Ad hoc Network (VANET) is a special type of Mobile Ad hoc Network (MANET) based on short-range communications among moving vehicles and between vehicles and roadside units (RSUs). IEEE 802.11p is referred to as dedicated short-range communications (DSRC) standard for wireless access in vehicular environment (WAVE). For DSRC, 75MHz of licensed spectrum at 5.9 GHz has been allocated. This 75MHz band is divided into one central control channel (CCH) and six service channels (SCHs) as shown in Figure 1. CCH is dedicated for transmission of traffic safety messages, while SCHs are dedicated to transfer of various application data. Both CCH and SCH support four data classes with aggressively differentiated priorities as shown in Tables 1 and 2. Each data class has its own MAC resources.

Table 1

EDCA parameter set used on the CCH (adapted from [13])

ACI	AC	CWmin	CWmax	AIFSN
1	Background	15	511	9
0	Best effort	7	15	6
2	Video	3	7	3
3	Voice	3	7	2

Table 2

EDCA parameter set used on the SCH (adapted from [13])

ACI	AC	CWmin	CWmax	AIFSN
1	Background	15	511	7
0	Best effort	15	511	3
2	Video	7	15	2
3	Voice	3	7	2

With IEEE 802.11 technologies, often a single shared wireless channel is used for both uplink (from vehicles to the RSU) and downlink (from the RSU to vehicles). Because of the distributed nature of contention, the capacity actually depends on the behavior of contending vehicles [1]. The number of contending vehicles covered by an RSU depends on the vehicle mobility and density. Furthermore, as shown in Figure 2, vehicles have different payload transmission rates according to their distance to the RSU [2]. The sojourn time of a vehicle for each of the different ranges is dependent on its speed.

Figure 2
**Transmission ranges for different data rates**.

A VANET is unstable when a queue of any on board unit (OBU) in the network is saturated. A queue is saturated if it always has at least one frame waiting to be served. VANET cannot operate under saturation conditions because the OBU's buffer will overflow and frames queuing delay will grow unacceptably. Since all the data classes need to operate in stable conditions, the network performance must be investigated under non-saturation regime. However, network performance in non-saturation regime has received much less attention because of its complexity. In [3], the authors investigate the performance of an IEEE 802.11p-based network in non-saturation regime with static nodes.

On the other hand, spatial saturation occurs when the distance between vehicles reaches minimal (jamming) value because of the vehicular traffic congestion. While spatial saturation of vehicles during rush hours or accidents cannot be avoided, networking saturation can be avoided by proper dimensioning of resources.

In this study, we combine vehicular traffic theory, M/G/1 queuing analysis, and Markov chain analysis in order to investigate the transition between non-saturation and saturation regimes for an IEEE 802.11p-based network which is composed of mobile nodes with multiple data combinations and multiple data classes per combination. We consider the neighbourhood of a single RSU operating in non-saturation regime deployed on a bidirectional road segment. The number of vehicles in each direction (lane) under free-flow model [4] is considered as a Poisson distribution. Assuming error-prone channel conditions, we derive probability distributions for frame backoff time, waiting time in queue, collision probability of a transmission, and normalized throughput for each channel and each data class with different transmission rates depending on the vehicle's distance from the RSU.

The remainder of the article is organized as follows: in Section 2 we discuss related work and in Section 3 we develop analytical model. Section 4 presents the numerical results. Finally, Section 5 concludes the article.

2 Related work

Vehicular traffic flow models are classified as "microscopic", "macroscopic", and "mesoscopic" [5]. Microscopic traffic flow models describe each vehicle separately. In macroscopic models, all individual vehicles are aggregated and described as flows. The speed-flow-density relationships are used in these models [4, 6]. Mesoscopic models combine microscopic and macroscopic elements in a unified approach. In [7] the authors investigate the connectivity of VANETs operating in free-flow regime. They use a common model [4] in vehicular traffic theory in which any observer in space sees cars passing it that are separated by exponentially distributed times.

Current state of the art in this area is a combination of saturated IEEE 802.11 model with free-flow vehicular traffic regime and spatial Poisson arrangement of vehicles [1, 8–12]. In [1], authors have developed an analytical framework to evaluate the upload performance for Drive-thru Internet as a function of vehicle density. In [8], authors have derived an analytical model to quantify the impact of parameters such as road traffic density and vehicle speed on the download performance of moving vehicles in Drive-thru Internet systems. Authors in [9] have considered heterogeneous vehicular environments where vehicles may have different mobility characteristics. A model to estimate the collision probability in VANETs has been proposed in [10]. This model integrated the characteristics of VANETs (vehicle density and speed) into the traditional collision probability model. In [11], authors have proposed a model to improve the efficiency of communication between vehicles and RSUs. In this model, every vehicle can individually calculate its own priority of communication based on its speed and location. Authors in [12] have proposed an analytical model to evaluate the MAC throughput under different node speeds in Drive-thru Internet system. All the proposed models have deployed IEEE 802.11b as the wireless communication standard for VANETs instead of IEEE 802.11p. None of the proposed models have considered non-saturation regime, so far.

3 Analytical model

Let us consider the neighbourhood of a single RSU operating in non-saturation regime deployed on a bidirectional road segment as shown in Figure 3. According to the location to RSU, the road segment is divided into multiple regions [2]. In each region (Rg_i) within the RSU coverage area vehicles have different pay-load transmission rates according to their distance to the RSU. Each vehicle can transmit frames from data classes ACk, k = 0.. 3, in either CCH or SCH. We assume that there are d_cdata combinations on CCH and d_sdata combinations on SCH. Data combination d_xon channel x ∈ (c, s) is characterized with an array of [c(x, d, 0) c(x, d, 1) c(x, d, 2) c(x, d, 3)]. The index value c(x, d, k) = 1 denotes the presence of data class k, while the value of c(x, d, k)= 0 denotes its absence. Packets from data class k in channel x arrive to the vehicle according to a Poisson process with rate λ_x,k. Time unit in our model is one backoff slot. For data class k within channel x at each region (Rg_r), we assume variable frame size of ld_x,k,rslots which includes payload, MAC header, and physical header. The PGF for frame size within the transmission range L of the RSU is

L d_{x, k} (z) = \sum_{r = 1}^{R g_{max}} \frac{l_{r}}{L} z^{l d_{x, k, r}}

(1)

where l_ris the length of the region Rg_r. Duration of the SIFS period in slots will be denoted as sifs. We assume that RTS/CTS transmission scheme is used. Duration of RTS, CTS, and ACK frames expressed in slots will be denoted as rts, cts, and ack, respectively. We model the channel errors through Bit Error Rate (ber). In each region, the probability that a frame will not be corrupted by noise is denoted as

δ_{k, r} = {(1 - b e r)}^{r t s_{b} + c t s_{b} + l d_{b, x, k, r} + a c k_{b}}

where subscript b denotes values expressed in bits. Also, we consider OBU devices equipped with a single networking interface only. Each interface switches between CCH and SCH during the sync interval, as shown in Figure 4. Duration of synchronization interval is SI = 100 ms and duration of guard intervals is grd = 5 ms each, as specified in the standard [13]. Duration of CCH is (SI - 2grd)SO. We assume that duty cycle of CCH vs. SCH is SO = 0.5. For this value, backoff process should be completed within (SI/2) ms in each channel in order to avoid handover for another RSU [3]. The handover probability in each channel interval for any packets from data class k is

h d_{x, k} = \frac{(S I / 2) v}{L} S O (1 - e^{(S I / 2) λ_{x, k})} \leq 0.0004

(2)

where v is the mean speed of the vehicle. The handover probability is neglected because of its small value and we assume that the backoff process will be completed in the vicinity of a single RSU.

We assume that vehicle's buffer has infinite length and use an M/G/1 queuing model. The PGF for successful packet transmission time is

S t_{x, k} (z) = z^{r t s + c t s + 3 s i f s + a c k} \sum_{r = 1}^{R g_{max}} \frac{l_{r}}{L} z^{l d_{x, k, r}}

(3)

In case of collision of RTS packets, activity on the medium has the PGF of Ct(z) = z^rts+cts+sifs.

3.1 Distribution of vehicles

The number of vehicles in each lane of road segment follows a Poisson distribution. Let F be the vehicle flow which corresponds to the number of vehicles that pass a fixed roadside point per unit time. Also, let λ_dbe vehicle density, i.e., the number of vehicles per unit distance in one direction along the road segment. From the traffic flow theory [4], mean speed, flow, and density are related through is

F = v λ_{d}

(4)

Figure 5 shows the relationships among these parameters. The solid portion of the curves represents stable or free-flow state. This state holds until the vehicle density reaches a critical value. The peak of the curves is the maximum rate of flow or the capacity of road segment. Beyond the critical density, some breakdown locations appear on the road segment, which lead to the formation of some queues of vehicles. This state is called unstable or forced flow and is shown by the dashed portion of the curves. If the density increases, the traffic reaches the jam state, at which vehicles have to completely stop [7].

Figure 5
**Relationships between flow, speed, and density** [4].

Moreover, Greenshield's model [6] captures the dependency between speed and density by assuming a liner relationship as follows:

v = v_{f} (1 - λ_{d} ∕ λ_{d, jam})

(5)

where v_fis the free-flow speed corresponding to the maximum desired speed (usually taken as the road's speed limit). λ_d,jamis the maximum allowable traffic density (jam density). Then, the maximum number of vehicles, vh_max, in each lane of the road segment within the transmission range L of the RSU can be calculated as

v h_{max} = L λ_{d, jam}

(6)

The probability that there are n vehicles in each lane of the road segment is given by

P (n) = \frac{e^{- L λ_{d} \frac{{(L λ_{d})}^{n}}{n!}}}{\sum_{i = 0}^{v h_{max}} e^{- L λ_{d} \frac{{(L λ_{d})}^{i}}{i!}}}

(7)

3.2 Model of IEEE 802.11p features

Let us now briefly review AIFSN-based prioritization, as shown in Figure 6. If the medium gets busy during the backoff countdown, the backoff counter will be frozen until the medium becomes idle again for the uninterrupted duration of aifs_x,k= sifs + AIFSN_x,k· σ where σ is the duration of the slot time and x ∈ (c,s) denotes the channel type. We model this action through k freezing counters [14]. They need to be re-started from the beginning if the medium becomes busy at any time during the countdown. Since access is synchronized with the end of previous transmission, no access is possible during AIFS_x,3. Figure 7 presents the Markov chain for freezing countdown, the initial values of freezing counters are set to B_x,k= AIFSN_x,k- AIFSN_x,3, k = 0.. 3.

Figure 6
**EDCA channel prioritized access for IEEE 802.11p**.

Figure 7
**Sub-chain for freezing counter**.

When the backoff count reaches zero, the transmission starts. If a collision occurs, backoff procedure has to be repeated but with increased contention window size. There are m_x,k+ 1 backoff phases, starting from the phase 0, with increasing values of contention window. Frame can be re-transmitted up to R times, but window size will grow only until phase m_x,kas indicated in Tables 1 and 2. The size of contention window for channel x ∈ (c, s) and AC = k in the i th backoff stage (i = 0.. m_x,k) has the value of

W_{x, k, i} = \{\begin{matrix} 2^{i} (C W {min}_{x, k} + 1) - 1, & 0 \leq i \leq m_{x, k} \\ 2^{m_{k, L}} (C W {min}_{x, k} + 1) - 1, & R \geq i > m_{x, k} \end{matrix}

(8)

As shown in Figure 6, duration of periods where data classes k and higher can access channel x are denoted as A_x,kand their maximum durations are

A_{x, k, max} = \{\begin{matrix} A I F S N_{x, k - 1} - A I F S N_{x, k}, & k = 1 . . 3 \\ W_{x, 0, max}, & k = 0 \end{matrix}

(9)

Because of internal collisions of frames from different data classes within the vehicle itself, probability that a frame has completed the backoff process (we will denote it as virtual access probability, θ_x,d,k) might be different from access probability τ_x,d,k:

\begin{gathered} τ_{x, d, 3} = θ_{x, d, 3} \\ τ_{x, d, k} = θ_{x, d, k} \prod_{l = k + 1}^{3} (1 - c (x, d, k) θ_{x, d, l}), k = 0 . . 2 \end{gathered}

(10)

Let the probability that a backoff period is the last in the target channel be

X_{c} = \frac{1}{c c h}

and

X_{s} = \frac{1}{s c h}

for CCH and SCH, respectively. Probability that the medium will be idle during a single backoff slot in the target channel interval A_x,kis

f_{x, k} = (1 - X_{k}) \prod_{t = 1}^{t_{x}} \prod_{l = k}^{3} {(1 - c (x, d, k) τ_{x, d, l})}^{n_{x, d, l}}

(11)

where n_x,d,kis the total number of vehicles from channel x ∈ c, s with data combination d, transmitting frames from data class k. However, because of virtual collisions, what the stream c(x, d, k) = 1 actually 'sees' is that no data class within the vehicle has finished the backoff process and that there is no access by any other vehicle. This value might be different from f_x,k, since it observes absolute access of data classes outside the vehicle and virtual access of classes inside the vehicle as

ζ_{x, d, k} = f_{x, k} \frac{\prod_{l = k + 1}^{3} (1 - c (x, d, k) θ_{x, d, l})}{\prod_{l = k + 1}^{3} (1 - c (x, d, k) τ_{x, d, l})}

(12)

Backoff counter for stream c(x, d, k) = 1, x ∈ (c, s), can be decremented during time periods A_x,l, l = 0..k, but unfortunately, with probabilities that depend on the index of the period. The overall probability of backoff counter decrement for AC_iis

\begin{align} g_{x, d, 0} & = \frac{ζ_{x, d, 0}}{1 - θ_{x, d, 0}} \\ g_{x, d, i} & = \frac{(1 - ζ_{x, d, i}^{A_{x, i, max}}) ζ_{x, d, i}}{1 - θ_{x, d, i}} + \frac{ζ_{x, d, i}^{A_{x, i, max}} (ζ_{x, d, i} - 1)}{1 - θ_{x, d, i}}, i = 1 . . 3 \end{align}

(13)

The probability that a transmission for ACk in channel x does not experience a virtual or real collision is

γ_{n_{x, d, k}} = g_{x, d, k}

. The overall collision probability per lane for data combination d with data class k in channel x can be calculated as

E [c o l_{x, d, k}] = 1 - \sum_{n = 0}^{v h_{max}} P (n) γ_{n_{x, d, k}}

(14)

3.3 PGF for the frame service time

The basic building block of the packet service time PGF is the transfer PGF for the pass through the freezing counter block which has loopback when the value of backoff counter is non-zero, and skips loopback when the backoff counter is zero. Note that transfer PGFs through the block are different if the block has to be traversed vertically from higher backoff state or laterally from the same backoff state but from higher value of backoff counter.

Let us first consider vertical traversal through the freezing counter, in which case we need to derive the probabilities Pfa_l that freezing counters of vehicles with data classes k < l will be restarted because of successful transmission on the medium in the period A_x,l, l = 1, 2, 3.

P f a_{x, l} = \sum_{d = 1}^{d_{x}} \sum_{i = 1}^{3} \frac{n_{x, d, i} τ_{x, d, i {\prod_{i = l}^{3} (1 - τ_{x, d, i})}^{n_{x, d, i}}}}{(1 - τ_{x, d, i})}

(15)

The probability that freezing counter will be restarted because of a collision is Pfc_x,l= 1 - f_x,l- Pfa_x,l.

We also need to derive duration of successful access to the medium during period A_x,l, l = 0.. 3 as

S w_{x, l} (z) = \frac{\sum_{d = 1}^{d_{x}} \sum_{i = 1}^{3} n_{x, d, i} τ_{x, d, i} S t_{x, k} (z)}{\sum_{d = 1}^{d_{x}} \sum_{i = 1}^{3} n_{x, d, i} τ_{x, d, i}}

Transfer PGFs Bfnl_x,k(z) for the zero value of backoff counter can be derived by noting that PGF is recursive because of the presence of a loop and has the form Bfnl_x,k(z) = Bfnln_x,k(z)/Bfnld_x,k(z) where

\begin{align} B f n l n_{x, k} (z) & = z^{a i f s_{x, 3}} \prod_{i = k + 1}^{3} {(f_{x, i} z)}^{A_{x, i, max}} \\ B f n l d_{x, k} (z) & = 1 - \sum_{i = k + 1}^{3} (P f a_{x, i} S w_{x, i} (z) + P f c_{x, i} C t (z)) \\ \sum_{n = 0}^{A_{x, i, max} - 1} {(z f_{x, i})}^{n} z \prod_{l = i + 1}^{3} {(z f_{x, l})}^{A_{x, l, max}} \end{align}

except for the highest traffic class where Bfnl_x,3(z) = z.

In order to calculate vertical transfer PGFs for non-zero values of backoff counter, we need the probabilities that the backoff count will be suppressed because of successful transmission or collision. Probability that the backoff count for traffic class k will be suppressed in the period A_x,l, l = 0..k, because of successful transmission is

\begin{align} P b s_{x, d, k, l} & = \sum_{i = l}^{3} \frac{n_{x, d, i} τ_{x, d, i} \prod_{i = 1}^{3} {(1 - τ_{x, d, i})}^{n_{x, d, i}}}{(1 - τ_{x, d, k}) (1 - τ_{x, d, i})} \\ - \frac{τ_{x, d, k}}{{(1 - τ_{x, d, k})}^{2}} \prod_{i = l}^{3} {(1 - τ_{x, d, i})}^{n_{x, d, i}} \end{align}

(16)

The corresponding probabilities that the backoff count will be suppressed because of the collision on the medium are $P b c_{x, d, k, l} = 1 - \frac{f_{x, l}}{1 - τ_{x, d, k}} - P b s_{x, d, k, l}$ .

Then, the vertical transfer PGF for non-zero value of backoff counter gets the form Bfl_x,d,k(z) = α/β where $α = c (x, d, k) \frac{f_{x, k}}{1 - τ_{x, t, k}} z B f n l_{x, k} (z)$ and β = 1 - zBfnl_x,k(z)(Pbs_x,d,kSw_x,k(z) + Pbc_x,d,kCt(z)).

Lateral transfer PGFs which connect the backoff freezing blocks, Bfs_x,d,k(z), can be calculated as defined in [3].

The PGF for the duration of the backoff phase i for data class k on channel x is

B_{x, d, k, i} (z) = \frac{B f n l_{x, k} (z)}{W_{x, k, i}} + \frac{B f l_{x, d, k} (z)}{W_{x, k, i}} \sum_{l = 1}^{W_{x, k, i} - 1} B f s_{x, d, k} {(z)}^{l}

(17)

The probability that the OBU's buffer is empty at arbitrary time is π_x,d,k,0= 1-ρ_x,d,k, where ρ_x,d,kdenotes offered load from data combination d with class k in channel x. The entire Markov chain for AC_kis shown in Figure 8. Markov chain has the same form for both channels since activity of the other channel is equivalent to channel busy state on the current channel. By considering Figure 8, the PGF for the backoff time for data combination d with data class AC_kin channel x becomes

\begin{align} B o f_{x, d, k} (z) & = \sum_{r = 1}^{R g_{max}} \frac{l_{r}}{L} (\sum_{i = 1}^{m_{x, k} + 1} (\prod_{j = 0}^{i - 1} B_{x, d, k, j} (z)) \\ \cdot {(1 - δ_{k, r} γ_{x, d, k})}^{i - 1} C t {(z)}^{i - 1} δ_{k, r} γ_{x, d, k} \\ + \sum_{i = m_{x, k} + 1}^{R} (\prod_{j = 0}^{m_{x, k}} B_{x, d, k, j} (z)) B_{x, d, k, m_{x, k}} {(z)}^{i - m_{x, k}} \\ \cdot {(1 - δ_{k, r} γ_{x, d, k})}^{i} C t {(z)}^{i} δ_{k, r} γ_{x, d, k} \\ + (\prod_{j = 0}^{m_{x, k}} B_{x, d, k, j} (z)) B_{x, d, k, m_{x, k}} {(z)}^{R - m_{x, k}}) \\ \cdot {(1 - δ_{k, r} γ_{x, d, k})}^{R + 1} C t {(z)}^{R + 1}) \end{align}

(18)

Figure 8
**Markov chain for** AC_kin channel x.

When the buffer is found empty upon a successful packet transmission, the vehicle can proactively undertake zeroth backoff, go to the idle state, and then attempt to transmit the next arriving packet upon waiting only for AIFS_x,k. However, if this attempt is not successful, the entire backoff process (beginning from phase 1) has to be performed; the PGF for the duration of this backoff process, Bzof_x,d,k(s), is similar to the one in (18) but with a difference in the first line:

\begin{align} B z o f_{x, d, k} (z) & = \sum_{r = 1}^{R g_{max}} \frac{l_{r}}{L} (γ_{x, d, k δ_{k, r}} + \sum_{i = 2}^{m_{x, k} + 1} (\prod_{j = 0}^{i - 1} B_{x, d, k, j} (z)) \\ \cdot {(1 - δ_{k, r} γ_{x, d, k})}^{i - 1} C t {(z)}^{i - 1} δ_{k, r} γ_{x, d, k} \\ + \sum_{i = m_{x, k} + 1}^{R} (\prod_{j = 0}^{m_{x, k}} B_{x, d, k, j} (z)) B_{x, d, k, m_{x, k}} {(z)}^{i - m_{x, k}} \\ \cdot {(1 - δ_{k, r} γ_{x, d, k})}^{i} C t {(z)}^{i} δ_{k, r} γ_{x, d, k} \\ + (\prod_{j = 0}^{m_{x, k}} B_{x, d, k, j} (z)) B_{x, d, k, m_{x, k}} {(z)}^{R - m_{x, k}}) \\ \cdot {(1 - δ_{k, r} γ_{x, d, k})}^{R + 1} C t {(z)}^{R + 1}) \end{align}

(19)

At this point, these expressions can be used to calculate extended backoff times Bofe_c,d,k(z) and Bzofe_c,d,k(z), as defined in [3].

Markov chain presents a random process with stationary distribution y_x,d,k,i,j,b, where x ∈ (c,s), d = 1..d_xdenotes vehicle type; k = 0.. 3 denotes the data class, i = 0.. m_kdenotes the index of the backoff phase, j = 0.. W_x,k,i- 1 denotes the value of backoff counter, and b = 0.. B_kdenotes the value of the freezing counter.

In order to model behavior of vehicle after the successful transmission we need to note that standard requires vehicle to perform backoff with W_x,k,0immediately after successful transmission even if the vehicle's buffer is empty. If vehicle's buffer is still empty after this backoff count, vehicle enters idle state represented by P_idlein Figure 8.

The total idle state probability is calculated by finding the distance between two accesses by the same vehicle. In order to obtain this result we use Laplace-Stieltjes Transform (LST) of backoff time PGF which is obtained as

B o f e_{x, d, k}^{*} (s) = B o f e_{x, d, k} (e^{- s})

. If we introduce probability of no frame arrivals during zeroth backoff on channel x as

v_{x, d, k, 0}^{0}

and LST of backoff process without the zeroth backoff phase as

B z o f e_{x, d, k}^{*} (s)

the distance between two transmissions becomes

\begin{matrix} D_{x, d, k}^{*} (s) = \sum_{r = 1}^{R g_{\max}} \frac{l_{r}}{L} (S t_{x, k} (e^{- s}) {π_{x, d, k, 0} B_{x, d, k, 0} (e^{- s}) \\ v_{x, d, k, 0}^{0} R_{x, k}^{*} (s) [ϕ_{i} I_{x}^{*} (s) (\prod_{l = k + 1}^{3} f_{x, l}^{A_{x, l, \max}} δ_{k, r} \\ + (1 - \prod_{l = k + 1}^{3} f_{x, l}^{A_{x, l, \max}} δ_{k, r}) B o f e_{x, d, k}^{*} (s)) + ϕ_{a} (f_{x, 0}^{a i f s_{x, k}} δ_{k, r} \\ + (1 - f_{x, 0}^{a i f s_{x, k}} δ_{k, r}) B o f e_{x, d, k}^{*} (s))] e^{- s a i f s_{x, k}} \\ + π_{x, d, k, 0} B_{x, d, k, 0} (e^{- s}) (1 - v_{x, d, k, 0}^{0}) (γ_{x, d, k} δ_{k, r} \\ + (1 - γ_{x, d, k} δ_{k, r}) B z o f e_{x, d, k}^{*} (s)) \\ + (1 - π_{x, d, k, 0}) B o f e_{x, d, k}^{*} (s)}) \end{matrix}

(20)

where

R_{x, k}^{*} (s) = \frac{λ_{x, k}}{λ_{x, k} + s}

is the LST for exponential distribution of the residual frame inter-arrival time and

I_{x}^{*} (s)

denotes LST of time needed to synchronize with the beginning of CCH or SCH period [3]. ϕ_ais the probability that the target channel is active when the vehicle exits idle state and ϕ_iis the probability that the opposite channel (or guard time) is active. Then, the LST for the total active time between two successive access point, i.e., frame service time is

\begin{matrix} T t_{x, d, k}^{*} (s) = \sum_{r = 1}^{R g_{\max}} \frac{l_{r}}{L} (S t_{x, k} (e^{- s}) {π_{x, d, k, 0} B_{x, d, k, 0} (e^{- s}) \\ v_{x, d, k, 0}^{0} [ϕ_{i} I_{x}^{*} (s) (\prod_{l = k + 1}^{3} f_{x, l}^{A_{x, l, \max}} δ_{k, r} \\ + (1 - \prod_{l = k + 1}^{3} f_{x, l}^{A_{x, l, \max}} δ_{k, r}) B o f e_{x, d, k}^{*} (s)) + ϕ_{a} (f_{x, 0}^{a i f s_{x, k}} δ_{k, r} \\ + (1 - f_{x, 0}^{a i f s_{x, k}} δ_{k, r}) B o f e_{x, d, k}^{*} (S))] e^{- s a i f s_{x, k}} \\ + π_{x, d, k, 0} B_{x, d, k, 0} (e^{- s}) (1 - v_{x, d, k, 0}^{0}) (γ_{x, d, k} δ_{k, r} \\ + (1 - γ_{x, d, k} δ_{k, r}) B z o f e_{x, d, k}^{*} (s)) \\ + (1 - π_{x, d, k, 0}) B o f e_{x, d, k}^{*} (s)}) \end{matrix}

(21)

and its first two moments are ${\bar{T t_{x, d, k}} = \frac{d T t_{x, d, k}^{*} (s)}{d s}|}_{s = 0}$ and ${\bar{T t_{x, d, k}^{(2)}} = \frac{d^{2} T t_{x, d, k}^{*} (s)}{d s^{2}}|}_{s = 0}$ . Offered load on the channel now becomes $ρ_{x, d, k} = λ_{x, k} \bar{T t_{x, d, k}}$ .

The probability that the vehicle is idle can be calculated as $P_{x, d, k, i d l e} = 1 - \frac{\bar{T t_{x, d, k}}}{\bar{D_{x, d, k}}}$ . Now we can form the equation for normalization condition as defined in [3].

3.4 Throughput and waiting time for AC_kin channel x

Normalized throughput per vehicle for data combination d with data class k in channel x can be obtained

as

T h r_{n_{x, d, k}} = \frac{\bar{l d_{x, k}}}{\bar{D_{x, d, k}}}

(22)

The overall normalized throughput per lane can be calculated as

E [T h r_{x, d, k}] = \sum_{n = 0}^{v h_{max}} P (n) T h r_{n_{x, d, k}}

(23)

The PGF for the number of frame arrivals during frame service time is

A_{x, d, k} (z) = T t_{x, d, k}^{*} (λ_{x, k} (1 - z))

, and the PGF for the number of frames left after the departing frame in the vehicle buffer is [15]

\prod_{x, d, k} (z) = \frac{π_{x, d, k, 0} (1 - z) A_{x, d, k} (z)}{A_{x, d, k} (z) - z}

(24)

In order to calculate the response time, we observe that number of frames left in the buffer after the departing frame is equal to the number of frames which arrived while the frame was buffered and serviced. If we denote the LST of the response time for AC_kin channel x as

W_{x, d, k}^{*} (s)

, last statement can be written as

\prod_{x, d, k} (z) = W_{x, d, k}^{*} (λ_{x, k} - z λ_{x, k}) T t_{x, d, k}^{*} (λ_{x, k} - z λ_{x, k})

. Because of PASTA property of M/G/1 systems, ∏_x,d,k(z) also presents probability distribution of buffer occupancy at arbitrary time. After substituting s = λ_x,k- z λ_x,k, we obtain the LST of the waiting time as

W_{x, d, k}^{*} (s) = \frac{s (1 - ρ_{x, d, k})}{s - λ_{x, k} + λ_{x, k} T t_{x, d, k}^{*} (s)}

, and its average value as

\bar{W_{n_{x, d, k}}} = \frac{λ_{x, k} \bar{T t_{k}^{(2)}}}{2 (1 - ρ_{x, d, k})}

. Similar to (23), the overall waiting time per lane can be calculated as

E [\bar{W_{x, d, k}}] = \sum_{n = 0}^{v h_{max}} P (n) \bar{W_{n_{x, d, k}}}

(25)

4 Performance evaluation

We have evaluated network performance for multiple data classes in a network with a single RSU deployed on a bidirectional road segment with transmission ranges of L = 900, 500, and 350 m, respectively. In order to investigate the network transition between non-saturation and saturation regimes, we have conducted a number of experiments with variable vehicle densities in a single contention domain of IEEE 802.11p. According to the distance of the vehicles from the RSU, data rate varies between 3 and 24 Mbps. OFDMA is chosen as the physical layer modulation mechanism with 40 μ s as the duration of preamble and header transmission. Slot time is set to 16μ s and duration of sifs is equal to 2 slots. Bit error rate is set to ber = 2 * 10^-5. Frame size is set to 500 bytes. RTS/CTS scheme is used for the medium access. Durations of synchronization interval and guard intervals are set to 100 and 5 ms, respectively. Duty cycle of CCH vs. SCH is set to 0.5. We have assumed that there are three data combinations in CCH and SCH as shown in Table 3. The maximum allowable traffic density, λ_d,jam, per lane is set to 0.1 veh/m. Data rates for different classes are shown in Table 4.

Table 3

Populations of vehicles and their data traffic running on the CCH and SCH

Data combination	Data classes	Number of vehicles
1	AC 1 and AC 3	20% of vehicles
2	AC 0 and AC 2	20% of vehicles
3	AC 0	60% of vehicles

Table 4

Data rates per data classes

AC	Data type	On CCH (kbps)	On SCH (kbps)
AC 1	Background	4	20
AC 0	Best effort	4	20
AC 2	Video	12	12
AC 3	Voice	12	12

Using these parameter values, the equations acquired from the analytical model (Markov chain and queuing models) are solved using Maple 13 [16]. In the depicted figures, the values for data classes of best effort (AC 1), backgrounds (AC 0s) in data combination 2 and 3, video (AC 2) and voice (AC 3) are shown with boxes, crosses, dashed lines, circles, and diamonds, respectively.

Figure 9 shows the mean backoff time of data classes to successfully access the medium on CCH and SCH where the transmission range of the RSU is equal to 900, 500, and 350 m, respectively. Figure 10 shows the average waiting time in the queue of the data frames of different data classes for CCH and SCH where the RSU's transmission range varies. The plots show that as the transmission range increases the network moves from non-saturation regime to saturation regime sooner upon the traffic density growth. Figures 9a, d and 10a, d indicate that in case of having the transmission range 900 m the saturation regime for the lowest data class priority occurs when the vehicle density is about 0.07 veh/m on CCH and 0.05 veh/m on SCH. The saturation boundaries are reached for the data classes earlier in the SCH compared to the CCH because the data frame arrival rates for AC 0 and AC 1 are larger in the SCH. However, when the transmission range is equal to 500 and 350 m, the lowest data class priority (AC 1) does not enter into saturation regime before the traffic density is about 0.1 veh/m per lane. Networking saturation does not occur in the transmission ranges of 500 and 350 m but spatial saturation occurs when the traffic density per lane becomes equal to 0.1 veh/m. At this traffic density, the traffic flow gradually comes to a stop as a result of the jam density.

Figure 9
**Average value of backoff time**; *top row*: CCH (a) backoff time for L = 900 m (CCH), (b) backoff time for L = 500 m (CCH), (c) backoff time for L = 350 m (CCH); *bottom row*: SCH (d) backoff time for L = 900 m (SCH), (e) backoff time for L = 500 m (SCH), (f) backoff time for L = 350 m (SCH).

Figure 10
**Average waiting time in the queue**; *top row*: CCH (a) waiting time for L = 900 m (CCH), (b) waiting time for L = 500 m (CCH), (c) waiting time for L = 350 m (CCH); *bottom row*: SCH (d) waiting time for L = 900 m (SCH), (e) waiting time for L = 500 m (SCH), (f) waiting time for L = 350 m (SCH).

Figure 11 shows the collision probability for all data classes where the traffic density increases for the transmission range of 900, 500, and 350 m, respectively. When the vehicle density grows the collision probability increases because the medium contention increases. Comparing the graphs for different transmission ranges shows that a higher transmission range leads to a higher collision probability. As the plots indicate the collision probabilities in the SCH for all data classes and the RSU's transmission ranges are larger than the corresponding values in the CCH.

Figure 11
**Collision probability**; *top row*: CCH (a) collision probability for L = 900 m (CCH), (b) collision probability for L = 500 m (CCH), (c) collision probability for L = 350 m (CCH); *bottom row*: SCH (d) collision probability for L = 900 m (SCH), (e) collision probability for L = 500 m (SCH), (f) collision probability for L = 350 m (SCH).

In Figure 12, the normalized throughput for all data classes in the CCH and SCH are depicted where the transmission range and the vehicle density vary. The results indicate that in the CCH AC 0 is the only data class which enters into saturation regime in case of spatial non-saturation. However, in the SCH only AC 1 enters into saturation regime when the traffic density is smaller than 0.1 veh/m on account of having the lowest priority in the network.

Figure 12
**Normalized throughput**; *top row*: CCH (a) normalized throughput for L = 900 m (CCH), (b) normalized throughput for L = 500 m (CCH), (c) normalized throughput for L = 350 m (CCH); *bottom row*: SCH (d) normalized throughput for L = 900 m (SCH), (e) normalized throughput for L = 500 m (SCH), (f) normalized throughput for L = 350 m (SCH).

Our results indicate that in each channel lowest priority data classes (AC 0 and AC 1) are severely affected by the number of AC 2 and AC 3 vehicles in the network. The strong prioritization of data classes in the standard is the main reason for the low performance of the low priority data classes.

These performance results would change if duty cycle of CCH vs. SCH decreases in order to give more bandwidth to SCH.

5 Conclusion

In this article, we studied the spatial and networking transition from non-saturation to saturation regimes for a VANET. We developed an analytical model to investigate the performance of the network with mobile nodes and in non-saturated regime. The model is composed of Markov chain, queuing sub-models, and probabilistic spatial model of vehicles. The model is analytically solved to calculate the performance descriptors of the network, mean backoff time to access the medium, average waiting time in queue, collision probability of a transmission, and normalized throughput, for all data classes. Our study indicates that increasing the transmission range of an RSU leads to earlier networking saturation of the data classes because of increasing the number of contending vehicles in the network. In addition, the results show that highest data classes (AC 2 and AC 3) are strongly prioritized over the lowest data classes (AC 0 and AC 1) inasmuch as the lowest data classes enter into saturation regime much earlier. The vehicle density growth also moves the vehicle traffic from a stable regime to an unstable condition.

In order to optimize the performance of the network in CCH and SCH and also balance the entry point to saturation among the channels we need to investigate the duty cycle of a VANET. In our future study, we study how duty cycle of CCH/SCH improve the performance of the network. In addition, we will study the optimal deployment of RSUs in a VANET to enhance the network performance. The RSUs' optimal deployment is required because of variable vehicle densities in different geographical areas.

Declarations

Authors' original submitted files for images

Below are the links to the authors’ original submitted files for images.

13638_2011_212_MOESM1_ESM.pdf Authors’ original file for figure 1

13638_2011_212_MOESM2_ESM.pdf Authors’ original file for figure 2

13638_2011_212_MOESM3_ESM.pdf Authors’ original file for figure 3

13638_2011_212_MOESM4_ESM.pdf Authors’ original file for figure 4

13638_2011_212_MOESM5_ESM.pdf Authors’ original file for figure 5

13638_2011_212_MOESM6_ESM.pdf Authors’ original file for figure 6

13638_2011_212_MOESM7_ESM.pdf Authors’ original file for figure 7

13638_2011_212_MOESM8_ESM.pdf Authors’ original file for figure 8

13638_2011_212_MOESM9_ESM.pdf Authors’ original file for figure 9

13638_2011_212_MOESM10_ESM.pdf Authors’ original file for figure 10

13638_2011_212_MOESM11_ESM.pdf Authors’ original file for figure 11

13638_2011_212_MOESM12_ESM.pdf Authors’ original file for figure 12

Authors’ Affiliations

(1)

Erciyes University, Kayseri, Turkey

(2)

Ryerson University, Toronto, ON, Canada

References

Zhuang Y, Viswanathan V, Pan J, Cai L: Upload Capacity Analysis for Drive-thru Internet.Technical report, University of Waterloo, ON; 2010. [https://129.97.58.88/ojs-2.2/index.php/pptvt/article/view/619/213]Google Scholar
Campolo C, Molinaro A: Data rate selection in WBSS-based IEEE 802.11p/WAVE vehicular ad hoc networks. CSNDSP 2010 2010, 412-416.Google Scholar
Mišsićc J, Badawy G, Mišsićc VB: Performance characterization for IEEE 802.11p network with single channel devices. IEEE Trans Veh Technol 2011, 60(4):1775-1787.View ArticleGoogle Scholar
Roess RP, Prassas ES, McShane WR: Traffic Engineering. 3rd edition. Pearson Prentice Hall, Upper Saddle River; 2004.Google Scholar
Woensel TV, Vandaele N: Modeling traffic flows with quequeing models: a review. Asia-Pacific J Oper Res (APJOR) 2007, 24(4):435-461. 10.1142/S0217595907001383View ArticleGoogle Scholar
Fricker JD, Whitford RK: Fundamentals of Transportation Engineering: A Multimodal Systems Approach. Prentice Hall, Upper Saddle River; 2004.Google Scholar
Yousefi S, Altman E, El-Azouzi R, Fathy M: Analytical model for connectivity in vehicular ad hoc networks. IEEE Trans Veh Technol 2008, 57(6):3341-3356.View ArticleGoogle Scholar
Tan WL, Lau WC, Yue O: Modeling resource sharing for a road-side access point supporting Drive-thru Internet. In ACM VANET'09. Beijing, China; 2009:33-42.View ArticleGoogle Scholar
Bruno R, Conti M: Throughput and fairness analysis of 802.11-based vehicle-to-infrastructure data transfers. In IEEE MASS 2011. Valencia, Spain; 2011:232-241.Google Scholar
An J, Guo X, Yang Y: Analysis of collision probability in vehicular ad hoc networks. In ACM GEC'09. Shanghai, China, ACM, New York; 2009:791-794.View ArticleGoogle Scholar
Wu TY, Guizani S, Lee WT, Liao KH: Improving RSU service time by distributed sorting mechanism. Ad Hoc Networks 2010.Google Scholar
Luan TH, Ling X, Shen XS: MAC in motion: impact of mobility on the MAC of Drive-thru Internet. IEEE Trans Mobile Comput 2011. in press [http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5714694]Google Scholar
IEEE Trial-Use Standard for Wireless Access in Vehicular Environments (WAVE)--Multi-channel Operation New York, NY; 2007.Google Scholar
Lee JY, Lee HS: A performance analysis model for IEEE 802.11e EDCA under saturation condition. IEEE Trans Commun 2009, 57(1):56-63.View ArticleGoogle Scholar
Takagi H: Queueing Analysis Vacation and Priority Systems. Volume 1. North-Holland, Amsterdam; 1991.Google Scholar
Maple 13. Maplesoft, a division of Waterloo Maple, Inc., Waterloo, ON; 2009.Google Scholar

Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reaching spatial or networking saturation in VANET

3.1 Distribution of vehicles

3.2 Model of IEEE 802.11p features

3.3 PGF for the frame service time

3.4 Throughput and waiting time for AC k in channel x

3.4 Throughput and waiting time for AC_kin channel x