A Selective Downlink Scheduling Algorithm to Enhance Quality of VOD Services for WAVE Networks

Abstract

Providing quality-of-service- (QoS-) guaranteed video on demand (VOD) services over wireless access in vehicular environments (WAVEs) is a challenge as WAVE adopts enhanced distributive channel access (EDCA), a contention-based channel access mechanism, for air interface access control. This paper proposes a selective downlink scheduling (SDS) algorithm to enhance the quality of VOD for WAVE networks. According to the importance of video decoding, video packets are categorized into high and low priorities. The categorized packets are put into different queues in roadside units (RSUs) to contend for transmission opportunities. Aiming to improve video playback quality and reduce video playback delay, the proposed SDS algorithm schedules video packets based on their importance, playback deadline, and their real-time parameters of receiving onboard units (OBUs), such as velocity and remaining dwelling time. The effectiveness of SDS algorithm is verified by simulations.

1. Introduction

Wireless access in vehicular environments (WAVEs) [1] is a next generation intelligent transportation technology that aims to improve transportation environments. The physical layer in WAVE is defined in IEEE 802.11 [2] and amended by IEEE 802.11p [3]. The spectrum of WAVE is allocated at the range of 5.86 5.92 GHz, and it is divided into seven channels each of 10 MHz bandwidth. Apart from improving transportation environment safety and intelligent management, the WAVE systems also provide a convenient means to provision data exchange services, such as video on demand (VOD), when people are traveling in vehicles. However, some specific features of WAVE networks, such as fast movement of vehicles and topology dynamic changes, render the provisioning of VOD services as a challenge. In this paper, we endeavor to tackle this problem by proposing a selective downlink scheduling (SDS) algorithm for VOD services in WAVE networks.

Communications in WAVE systems are conducted in two modes: vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications. There are two types of devices in WAVE: roadside unit (RSU) and onboard unit (OBU). Both RSU and OBU support at least one control channel (CCH) and multiple service channels (SCHs). An RSU is installed in a fixed position along roadside to support communication with OBUs wirelessly in its cell coverage. An OBU is a mobile device, normally fitted in a vehicle, to support communications with RSUs and other OBUs. Figure 1 illustrates a WAVE network that is adopted in this paper, where RSUs have fixed links to the Internet, and OBUs moving in both directions communicate with RSUs in a V2I mode. A VOD server is connected to the Internet. The OBUs request VOD services through the RSUs and video streams data flows from the VOD server to the requested OBUs (e.g., OBUs 1, 3, 5, 4, and 7 as shown in Figure 1).

Figure 1

A WAVE network for VOD services.

Compressed video streams are able to tolerate small amount of packet loss without degrading the quality of video playback very much, since some packets are less important for video decoding [4]. This feature can be used for schedule algorithms to deliver important packets and discard unimportant packets when traffic is heavy, or a wireless channel is unreliable. In this paper, the proposed SDS algorithm is designed to improve video playback quality and reduce video playback delay, especially when traffic load is heavy.

The existing works related to the issues concerned in this paper can be classified into two categories. The first category focuses on traffic scheduling of contention-based wireless networks, such as [5–9]. The second category concerns the issues on video streaming in wireless networks [10–13]. The WAVE standard does not specify particular scheduling algorithms for its media access control (MAC). The conventional first-come-first-service (FCFS) algorithm adopted by [6] is still recommended to be used in WAVE in coordination with IEEE 802.11e enhanced distributed channel access (EDCA) technology [1, 14]. The earliest deadline first (EDF) algorithm is widely used in traffic scheduling on wireless channels for multimedia [7, 9]. EDF can improve the QoS of multimedia services and overall system utilization when the deadline of each packet in the traffic is known. In [5], Chang et al. proposed a maximum freedom last (MFL) scheduling algorithm specifically for dedicated short-range communication (DSRC) networks. MFL is an enhancement of EDF which achieves a low-handoff rate by taking DSRC network parameters, such as cell size and vehicle dwelling time, into account.

Video streaming over IEEE 802.11 networks attracted much research interest. The authors of [11–13] proposed mechanisms to transport H.264 and MPEG-4 over IEEE 802.11e/a networks. However, their mechanisms are based on hybrid coordination function controlled channel access (HCCA) [14]. HCCA is a polling-based channel access mechanism which is different from contention-based EDCA used in WAVE. Furthermore, these mechanisms are only suitable for scalable video streams. Ksentini et al. [10] proposed a cross-layer architecture for H.264 over IEEE 802.11e. They utilized a specific feature of H.264 data partitioning (defined in the extended profile of H.264 standard). In their work, the bitstreaming of a frame is classified into three data partitions with different importance levels. The data partitions are delivered by different access categories (ACs) in IEEE 802.11e MAC. However, they only dealt with the different importance of data partitions within a frame, and they did not distinguish the importance between different video frame-types.

Inspired by EDF, MFL, and aforementioned video streaming schemes over wireless mechanisms, the SDS algorithm proposed in this paper aims to improve video playback quality and reduce video playback delay in WAVE networks. The SDS algorithm schedules video packets based on their importance, playback deadline, and their real-time parameters of receiving OBUs, such as velocity and remaining dwelling time. The SDS algorithm selectively drops unimportant video packets when it is not possible to transmit all packets due to limited dwelling time, heavy load, or undesired channel conditions. This selective packet dropping feature is of benefit to graceful quality degradation. In the SDS algorithm, video packets destined to different OBUs are coordinately scheduled by their playback deadline. This feature can be used to reduce the video playback delay of all OBUs. The proposed mechanism in this paper is not designed for only a specific video codec scheme (such as H.264), but it is also applicable to other popular video compression formats, such as H.263, MPEG-2.

The rest of the paper is outlined as follows. Section 2 presents some preliminaries, and Section 3 discusses the system model. In which the system architecture and system operations are discussed. The proposed scheduling algorithm is presented in Section 4. In Section 5, the scheduling algorithm is evaluated by simulations, and performance of the algorithms is analyzed. Finally, Section 6 concludes the paper.

2. Preliminaries

2.1. Video Frame and Packet

In video compression technologies, such as MEPG and H.264 [4], encoded pictures (or frames) are arranged in groups of pictures (GOPs). An encoded video stream consists of successive GOPs. A GOP can contain the following frame types: I-frame, P-frame, and B-frame. The order of intraframes and interframes is specified in a GOP. An I-frame is a reference picture which is intracoded corresponding to a fixed image and it is independent of other pictures. A P-frame is predictive-coded frame which contains motion-compensated difference information from the preceding I- or P-frame. A B-frame is bidirectionally predictive-coded frame which contains different information from the preceding and following I- or P-frame within a GOP. I-frame and P-frame are often referred to as anchor frames. A GOP always begins with an I-frame. Afterwards, several P-frames follow. The B-frames are inserted between two consecutive anchor frames.

Since I-frames contain all the information for image reconstruction without the need of referring to other frames, the more I-frames a video stream has, the more resilient it is for transmission over wireless links. However, having more I-frames increases the video stream size. In order to save bandwidth, it is common that video streams are encoded with only one I-frame per GOP. In WAVE, the errors of video stream decoding can occur in OBUs due to packet loss or transmission error. A successfully received I-frame can correct any errors caused by any preceding frames. Therefore, I-frames are much more important than P- and B-frames. In the cases of heavy traffic load or severe packet loss, it is wise to deliver I-frames to OBUs first to enhance the quality of video playback.

Figure 2 depicts an example of video encoding pattern ("IBBPBBPBB") and video stream packetization. Encoded video frames are packetized into video packets for transportation by lower layer protocols. For instance, a video stream encoded by H.264 can be transported over real-time transport protocol (RTP) [15]. In the procedures of video packetization, the importance of a video packet can be marked as either high or low priority, so that it can be scheduled and delivered differently in lower layers. As shown in Figure 2, I-frame packets are marked as high-priority packets, whereas P- and B-frame packets are marked as low priority. The video packet priority marking will be discussed in detail in Section 3.1.

Figure 2

Video frame and packet.

It should be noted that the sequence of video frames for transmission is different from the sequence of video playback. Taking the encoding pattern "IBBP" as an example, the actual transmission sequence is "IPBB", that is, the P-frame is transmitted before the B-frames. This is due to the fact that decoding B-frames requires both I- and P-frames received in an ONU's buffer. In this paper, the playback deadline of a frame or packet means the latest time that a frame (or packet) has to be available in an ONU's decoding buffer.

2.2. Wave Channel Operations

Detailed description of multiple channel operations in WAVE networks can be found at [1]. In order to better understand the operations of the proposed SDS algorithm in Section 3, we summarize the typical channel operations as follows. First, upon power on, an OBU monitors the CCH until a WAVE service advertisement (WSA) sent by an RSU is received. A WSA carries the information of available SCHs and their access parameters, such as channel numbers. Based on the WSA information, the OBU then synchronizes with the RSU, and the OBU can exchange data with the RSU in SCHs.

Due to vehicles' fast movement, the topology of WAVE networks changes frequently. To maximum the time used for data exchange, WAVE devices do not use active scanning, association, and authenticating procedures as usually utilized in IEEE 802.11 [1]. WAVE defines a channel synchronization procedure which manages channel coordination. Figure 3 shows a WAVE sync interval which consists of a CCH interval, an SCH interval, and guard intervals between them. The CCH interval is used to send high-priority safety messages and WSAs, whereas the SCH interval is used for data services. The length of the CCH and SCH intervals, that is, and , can be adjusted adaptively. However, the total length of the sync interval, , is fixed to . When joining to a WAVE basic service set (WBSS), OBUs are required to synchronize with the WBSS provider, that is, an RSU, in V2I model. The synchronization ensures the OBUs to monitor CCH during CCH intervals. Video packets are delivered in SCH intervals.

Figure 3

WAVE SYNC interval.

The discussion above is based on single-channel WAVE devices. With a single channel, an OBU can work on either CCH or SCH at a time. If two or more channels are facilitated in a WAVE device, the operations in CCH interval and SCH interval can be conducted simultaneously. In this paper, we consider single-channel WAVE devices only as this is common for OBUs.

3. System Model of VOD in WAVE Networks

3.1. System Architecture

The architecture of WAVE downlink scheduling for video streaming is shown in Figure 4(a). There are two types of transport protocols used in WAVE MAC: WAVE short message protocol (WSMP) and Internet protocol (IP). WSMP is used to transport WAVE system information, such as management, control, and safety information. WAVE short message (WSM) and WSA are transported by WSMP. IP is used to convey video packets and other application data. WSMP packets can be exchanged on both CCH and SCH. However, IP packets are only allowed on the SCH. These two protocol types are identified by the EtherType field of IEEE 802.2 header. The channel router routes packets to CCH or SCH according to this field.

Figure 4

The proposed scheduling architecture of VOD in WAVE.

Inside the CCH, there is a CCH classifier which categorizes packets into four queues identified by access category index (ACI). These four queues have different traffic specifications, such as access priorities, which are defined in IEEE 802.11e EDCA. Each access category has its own channel access function and uses specified EDCA parameters. These parameters are (1) arbitration interframe space (AIFS) which defines the minimum time interval between the wireless medium becoming idle and the start of another transmission; (2) contention windows (CW) which defines a random number generation window for random collision backoff mechanism; (3) transmit opportunity (TXOP) limit which defines the maximum time duration for which a WAVE device can transmit after obtaining a TXOP. The sum of TXOPs of these four queues is a CCH interval, that is, , where is the TXOP of the queue in the CCH channel. The SCH scheduler schedules these four access category queues based on their access parameters. There is no specific scheduling algorithm defined in the WAVE standard, and the scheduling operations may differ in different implementations.

In the proposed scheduling architecture, SCH's packet queuing procedure is similar to that of CCH's. The SCH classifier is in charge of putting packets into these four access category queues. It is the same as CCH that . SCH differs from CCH in the following manners: (1) the queue (Figure 4(c)) is dedicated for video streaming packets, and it is further separated into subqueues for each OBU to store high- and low-priority video packets; (2) the SCH scheduler implements the proposed SDS algorithm (as discussed in Section 4).

Before sending video packets to a channel router, the priority of each video packet is marked by the priority marking module. Some reserved bits in video bitstream header can be used to identify the importance of a packet. Taking H.264 over RTP [15] as an example, the with values 30 and 31 are not specified in the standard [15]. As shown in Figure 4(b), we can mark high-priority video packets as type 30, and low priority video packets as type 31.

3.2. System Operations

Figure 5 illustrates the operations in an RSU. In a CCH interval, as shown in Figure 5(a), the RSU announces the video streaming services provisioned via WSA messages. The video streams are identified by provider service identifiers (PSIDs). Upon receiving the WSAs, an OBU which is interested to playback the video stream replies to the RSU to join in a WBSS. The OBU also sends its current location (coordinates from global positioning system, or GPS), direction, and speed (estimated by the OBU itself based on the GPS coordinates) to the RSU. Based on the OBU's information, the RSU estimates the time that the OBU leaves its radio coverage (or cell), that is, the out-of-cell time , where is the index of the OBU. The RSU also monitors the signal strength of each OBU and estimates a transmission rate, denoted as , for each OBU. The RSU maintains a WBSS user list which keeps each OBU's PSID, , and (as shown in the middle of Figure 5).

Figure 5

RSU operations.

Before delivering packets in an SCH interval, the RSU has to decide how to use the SCH interval for all OBUs. This is where scheduling algorithms come to play. In the proposed architecture, the SDS algorithm schedules downlink packets based on a service list to specify the sequence of the OBUs to be served and which packets in the queues are granted to deliver to OBUs. As shown in Figure 5, OBU 3 will be served first and then OBU 1. There are 21 packets () in the high-priority queue and 31 packet () in the low-priority queue granted to be delivered to OBU 3. For OBU 1, only high-priority packets are granted to be delivered in this SCH interval. The high-priority packets of OBU 1 are not granted, and they are probably expired and thus discarded. The SDS algorithm generates or updates the service list in the RSU just before each SCH interval. The service list is indexed by OBU IDs and it is ordered by a weight factor (as discussed in Section 4 below).

After the service list is generated or updated, as shown in Figure 5(b), the RSU serves the OBUs according to this list one by one by following the order. The granted video packets are delivered within the current SCH interval. The above operational procedure repeated in each WAVE sync interval.

4. Proposed SDS Algorithm

As aforementioned, an RSU delivers downlink packets to OBUs based on a service list. The first task for the SDS algorithm to do is to generate or update the service list, so that the RSU can use it to deliver packets in SCH intervals.

To clarify the problem and the proposed algorithm, we give the following definitions. OBU requests to playback a packetized video stream . consists of a sequence of packets , where is the th packet, and is the total number of video packets. Each packet is defined by a tuple where is the size of the packet, is the playback deadline, and is the priority of the packet, . The sequences of packets are fed into the queue, and they are stored in OBUs' high and low subqueues based on their destined OBUs and (refer to Figure 4). In each subqueue, the packets with the same playback deadline are further grouped into a group of packets (GP). Let and represent the th high-and low-priority GPs in OBU . They are defined by and , respectively. We have

(1)

The sizes of and are

(2)

Let represents the current time on the absolute time axis. We use to denote the unallocated time in the current SCH interval for the queue, , before running the algorithm.

As aforementioned, the RSU keeps each OBU's out-of-cell time, , and transmission rate . The possible (maximum) transmission time can be allocated to OBU is

(3)

that is, either the service interval is entirely allocated to OBU or the RSU allocates the OBU's with its remaining dwelling time . Based on a GP's playback deadline, we can calculate a tolerable playback delay of this GP. For example, the tolerable playback delay of a high-priority GP is . The RSU also keeps the time that each GP already waited in the queue, that is, queuing delay. For example, the queuing delay of a high-priority GP is . Based on the total size of a GP and the transmission rate to OBU , the total time needed to transmit a GP to OBU can be calculated, for example, for GP it is or , for high-and low-priority GPs, respectively.

The objective of the scheduling algorithm is to generate or update a service list and then schedule packets based on this service list (see Algorithm 1). The service list indicates the order of the OBUs to be served and the packets in each OBU queue to be delivered. Let be the number OBUs connected to the RSU. We sort the OBUs by using a scheduling weight factor which is defined as

(4)

where is the time needed to send the first high-priority GPs to OBU , and is the tolerable playback deadline of the first high-priority GPs. The equation implies that the OBUs with small dwelling time, small tolerable playback delay, larger queuing delay, and larger amount of high-priority packets will be scheduled first.

Algorithm 1: Service list generation and updating algorithm.

• (1) Initialize the service list: remove an OBU from the list if it is no longer connected to the RSU;

  add an OBU into the list if it is newly connected to the RSU.

• (2) In each sub-queue, discard the packets if their playback deadlines are reached.

• (3) Calculate for each OBU by using (4).

• (4) Sort the service list (indexed by OBUs ID) by weight factor , the weightiest the first.

• (5) for all , calculate and for all GP that

  and .

• (6) Calculate and .

• (7) .

• (8) if then

• (9)   Grant all the high priority GPs with deadlines in current .

• (10)   Update .

• (11)   ifthen

• (12)     Grant all the low priority packets with deadlines in current .

• (13)     Update .

(14):   else only part of low priority GPs can be sent

• (15)     Grant low priority GPs in the sorted OBU order and update once a GP is granted, until .

• (16)     algorithm ends

• (17)   endif

• (18) else

• (19)   Grant high priority GPs in the sorted OBU order and update once a GP is granted, until .

• (20)   algorithm ends

• (21) endif

• (22) ifthen still some time left

• (23) Grant the packets in all high priority sub-queues and then all low priority sub-queues in a round-robin

  manner and in the sorted OBU order, update once a packets is granted, until .

• (24) endif

• (25) algorithm ends

The algorithm first initializes the service list by removing disconnected OBUs and adding newly connected OBUs (line 1). It then discards the packets with playback deadlines are reached (line 2). The algorithm calculates the scheduling weight factors (line 3) and sorts the OBUs by their factors (line 4). After that, for each OBU, all the transmission time required for transmitting high- and low-priority GPs with deadlines within current WAVE sync interval is calculated (line 5). This step is to find the packets which will be expired if they are not transmitted within current sync interval. Line 6 calculates the total time required to transmit all high- and low-priority GPs. Line 7 initializes to . If the unallocated time is enough for transmitting the high-priority GPs (line 8), all high-priority GPs will be granted (line 9). Line 10 updates the unallocated time . If there is still enough time for low-priority GPs (line 11), all packets in the low-priority GPs will be granted (line 12). If the unallocated time is not enough to transmit all low-priority GPs (line 15), will be used for allocating the GPs according to the order yielded in line 4, until the TXOP is fully allocated, that is, . It is the same if is not enough for all high-priority GPs (line 19), and only part of high-priority GPs can be granted according to the order yielded in line 4. If there is still some time left after all the high- and low-priority GPs with the playback deadlines within current are granted (line 22), the remaining time will be used to grant the packets in all high-priority subqueues and then all low-priority subqueues in a round-robin manner in the sorted OBU order. The reason to use round-robin here is for computational simplicity, since these packets' playback deadlines are not reached until next SCH interval and they can be transmitted in next sync interval if they are not scheduled in current .

Figure 6 shows an example of video packet grouping. There are four OBUs currently connected to an RSU, and there are four playback deadlines , , and as marked in the figure, where . Assume that we have , that is, the packets with playback deadlines as and have to be transmitted in this TXOP. The video packets with the same playback deadlines are grouped together to form GPs. Assume that the order of the OBUs in the service list is OBU 3, OBU 1, OBU 4, and OBU 2, which is decided by their scheduling weight factors (4). According to the algorithm, the granting sequence of the GPs will be , , , , , and for the high-priority GPs. If there is still some time left, the low-priority GPs will be granted in the sequence of , , , , , and . After that, if there is still some time left, the rest GPs can be scheduled in the order of , , , , , , , and .

Figure 6

An example of video packet grouping.

5. Simulation and Result Analysis

5.1. Simulation Setup

We have developed a WAVE network simulator to simulate WAVE networks. It simulates a two-lane straight highway of 30 km with each lane for each direction of traffic flow. In each lane, there are more than one sublane all carrying traffic to same direction. These sublanes enable vehicles overtaking each other. There are 50 RSUs uniformly distributed in the highway, each has 300 m transmission coverage radius. This makes a full coverage of the simulated highway. Simulated vehicles with mounted single-channel OBUs randomly enter the highway with exponentially distributed interarrival time at a rate of 100 vehicles per minute. Vehicle speed follows a Gaussian distribution with a mean of 100 km/h and a standard deviation of 10 km/h. The capacity of the RSU is 54 Mbps. Channel data rate varies between 1 to 54 Mbps and is a function of distance in our simulation for simplicity. The EDCA parameters used in the WAVE MAC are listed in Table 1. The contention window size is milliseconds and milliseconds.

Table 1 WAVE MAC EDCA parameters.

Since the focus of the proposed algorithm is to schedule the packets in the RSU queues, handover is not considered directly in this paper. In the simulations, we assumed that the video packets associated to an OBU are always available in its currently connected RSU. If the OBU is not associated with the RSU due to mobility, the proposed algorithm will discard all the packets related to the OBU in the RSU queues.

We tested our algorithm with several other benchmark video streams [16]. The encoding parameters of the benchmark videos and the parameters used in our experiments are listed in Table 2. The statistics of the four video streams used are presented in Tables 3 and 4. The maximum packet size of the video streaming is set to 1000 bytes, so that large frames will be packetized into two or more packets. The ratios between high- and low-priority packets are fixed for the chosen video clip which is listed in Table 5.

Table 2 Parameters of video streams used in the simulations.

Table 3 Statistics of video streams used in the simulations (high priority frame and packet).

Table 4 Statistics of video streams used in the simulations (low priority frame and packet).

Table 5 The ratio between high- and low-priority packets.

In the simulations, we assume that all OBUs request VOD services after they enter the simulated highway. The requested video streams are randomly selected from the aforementioned four benchmark video streams. Except for the video data (), other types of downlink traffics are generated by following rules: (1) voice traffic is generated randomly in the range of (32 kbps, 128 kbps) (2) self-similar BE traffic is generated randomly in the range of (0 kbps, 128 kbps) (3) background traffic is generated randomly in the range of (0 kbps, 256 kbps).

In the simulations, the proposed SDS algorithm is compared with the conventional FCFS [6], EDF [7], and MFL [5] algorithms in terms of video packet delivery ratio and video playback delay. We run the simulation 50 rounds and collect the results for analysis.

5.2. Delivery Ratio of Video Packets

More high-priority packets delivered means better video playback quality at OBUs. We measure the number of high- and low-priority packets delivered in all simulation runs with different traffic loads (from 1 to 160%). The average delivery ratio of high- and low-priority packets is shown in Figures 7 and 8, respectively.

Figure 7

Average delivery ratio of high-priority packets.

Figure 8

Average delivery ratio of low-priority packets.

Figure 7 shows the average delivery ratio of high-priority packets. When the total traffic load is under 80%, there is no high-priority packet loss. After the traffic load reaches a saturation point (100% of traffic load), the delivery ratio drops. The FCFS algorithm drops the fastest. This is because it does not distinguish the difference in packets. By distinguishing playback deadlines, the EDF and MFL perform better than FCFS in all video streams. Amongst EDF and MFL, MFL performs better due to the fact that it considered some specific features of vehicular networks, such as remaining dwelling time and tolerable maximum transmission delay. As EDF and MFL do not take the importance of different types of video packet into account, they treat high- and low-priority packets in the same way. The SDS algorithm outperforms the others due to the fact that the high-priority packets are preferentially treated. In all four video streams, the SDS algorithm always achieves the highest delivery ratio. Even though the overall traffic load is 160%, the SDS algorithm's average delivery ratio is still higher than 80% in all video streams. This reflects the specific feature of the SDS algorithm, that is, to deliver high-priority packets first.

Apart from the delivery ratio of high-priority packets, we are also interested to analyze the delivery ratio of low-priority packets. As shown in Figure 8, when the traffic load becomes higher than the saturation point, the delivery ratios of all algorithms drop quickly for all video streams. As can be observed, the delivery ratio of the SDS algorithm is lower than EDF and MFL in most of the cases. It is even lower than FCFS in video stream Tokyo Olympics after the traffic load is larger than 140%. This reflects the fact that the high-delivery ratio of high-priority packets is at the cost of low-delivery ratio of low-priority packets when the traffic load is very heavy.

5.3. Video Playback Delay

Apart from higher delivery ratio of high-priority packets, another main objective of the proposed SDS algorithm is to reduce video playback delay. In the situations of heavy traffic load and severe channel condition, video playback delay is unavoidable. In this simulation, video playback delay is defined as the accumulated time of the video discontinuity during the overall video stream playback. Video discontinuity is caused because the required high-priority packets (which constitute I-frames) are undelivered within their playback deadlines.

Figure 9 depicts the average video playback delay in all simulation runs. As can be observed, FCFS has the longest delay in all simulations. EDF and MFL perform better than FCFS, and MFL is slightly better than EDF. It can be also observed that video streams with a smaller packet size, such as the video stream silence of the lambs, suffer less playback delay. Since high-priority packets are always delivered first, our SDS algorithm achieves the smallest delay in all video streams. The playback delay of the SDS algorithm is nearly half of the MFL for all cases.

Figure 9

Average video playback delay.

6. Conclusion

In this paper, we have proposed a selective downlink scheduling algorithm, SDS, for WAVE networks in order to improve the quality of VOD services. Video packets are marked into high and low priorities before they are fed into WAVE MAC. Marked video packets are put into different access category queues. Our proposed SDS algorithm schedules the video packets according to their playback deadline and received OBU's network parameters, such as the time remained to communicate with current RSU and so on. The SDS algorithm is evaluated through simulations, showing its effectiveness and efficiency for video streaming over WAVE networks. In this work, we only focus on increasing the delivery ratio of high-priority packets and reducing video playback delay. We believe that these two parameters are fundamental for the quality of video streaming over WAVE. Other video quality evaluations, such as peak signal-to-noise ratio (PSNR) and mean opinion score (MOS), will be studied in our future work.