ROUTING PROTOCOL ANLYSIS FOR SCALABLE VIDEO CODING (SVC) TRANSMISSION OVER MOBILE AD-HOC NETWORKS EE 5359 SPRING 2015 MULTIMEDIA PROCESSING

Transcription

1 1 ROUTING PROTOCOL ANLYSIS FOR SCALABLE VIDEO CODING (SVC) TRANSMISSION OVER MOBILE AD-HOC NETWORKS EE 5359 SPRING 2015 MULTIMEDIA PROCESSING A PROJECT REPORT UNDER GUIDANCE OF K.R.RAO PRAJWAL S SANKET UNIVERSITY OF TEXAS AT ARLINGTON ELECTRICAL ENGINEERING UTA ID:

2 2 TABLE OF CONTENTS LIST OF ACRONYMS AND ABBREVIATIONS... 4 ABSTRACT... 6 INTRODUCTION... 7 OVERVIEW OF VIDEO CODING... 8 SCALABLE VIDEO CODING... 9 TYPES OF SVC TEMPORAL SCALABILITY SPATIAL SCALABILITY QUALITY SCALABILITY SVC ENCODER SVC DECODER IEEE PHYSICAL LAYER SPECIFICATIONS IEEE FEATURES IEEE E FEATURES AD-HOC VS INFRASTRUCTURED NETWORKS MANET ROUTING PROTOCOLS: PROTOCOLS OVERVIEW MANET PROTOCOLS AD-HOC ON DEMAND DISTANCE VECTOR ROUTING DISTANCE SEQUENCE DISTANCE VECTOR DYNAMIC SOURCE ROUTING AD-HOC ON-DEMAND MULTIPATH DISTANCE VECTOR ROUTING IMPLEMENTATION IMPLEMENTATION SNAPSHOTS PACKET END TO END DELAY IEEE NETWORK SIMULATION RESULTS FOR DIFFERENT PROTOCOLS IEEE E NETWORK SIMULATION RESULTS FOR DIFFERENT PROTOCOLS PSNR PLOTS FOR DSDV AND AOMDV PROTOCOLS SUMMARY OF AVERAGE PSNR VALUES GRAPHICAL PSNR COMPARISON... 46

3 3 COMPARISON OF PERFORMANCE BETWEEN THE NETWORKS EXAMPLE OF CONSECUTIVE VIDEO FRAMES CONCLUSIONS FUTURE WORK APPENDIX REFERENCES... 58

4 4 LIST OF ACRONYMS AND ABBREVIATIONS AODV: Ad-hoc on demand Distance Vector Routing AODMV: ad-hoc on demand multipath distance vector routing. CH: Cluster head CGS: Coarse grain quality scalability DSR: Dynamic source routing DSDV: Destination Sequenced DV GOP: group of pictures IP: Internet Protocol JVT: Joint Video Team ISP: Intelligent signal Processing LAR: location aided routing LAN: Local Area Network MANET: Mobile Ad-hoc network MPEG: Moving Pictures Expert group. MGS: Medium-Grain quality scalability MAC: Media Access Control Layer

5 5 NAL: Network Abstraction Layer OLSR: Optimized link state routing PDR: Packet delivery ratio QOS: Quality of service RREQ: Route request Message RREP: Route replay SVC: scalable video coding SVEF: scalable video evaluation Framework. SNR: Signal to noise Ratio TCP: transmission control Protocol TORA: Temporally ordered routing algorithm TDMA: Time Division Multiple Access UDP: User datagram protocol VCL: Video Coding Layer WLAN: Wireless Local Area Network

6 6 ABSTRACT Video streaming is a multimedia service that has gained significant development in the recent years. The main problem to tackle within this network is the bandwidth fluctuation in the network. [1] The challenge of a wireless network is to provide the quality of service (QOS) and quality of experience to satisfy the customer. Satisfying the customer requires better streaming capability for the networks. This project is focused on performance analysis of routing protocols over MANET for scalable video streaming. The video codec under evaluation is H.264/SVC and routing protocols are DSR, AODV and AODMV. Performance of Ad-hoc Networks such as IEEE and IEEE e are evaluated using this study. This evaluation is carried out using NS-2 simulators configured to support the ad-hoc networks. [1]

7 7 INTRODUCTION Today, the developments in telecommunication technology are increasingly demanding the use of broadband and data transmission with the high speeds. Especially in mobile video services where there is a need for higher bandwidth and more speed of transmission data to meet the market demand. The demand for the user of this technology and 4G standards even 5G preparation led to various schemes and innovations from various parties mainly academics, research institutions and communication vendors. [1] Mobile Ad-hoc Network (MANET) is a collection of communication devices or nodes that wish to communicate without any fixed infrastructure and pre-determined organization of available links. The MANET performance widely depends on the used routing mechanisms and protocols. Routing protocols may be classified into three categories- dynamic cluster based routing, proactive and reactive. [1] The main concept of cluster based routing is network diving into interconnected substructures, called clusters. Each cluster has a cluster head (CH) which acts as a coordinator inside a cluster. It maintains the contact with other cluster heads (CH). [1] Reactive MANET protocol dynamically finds the route between the nodes. A reactive protocol performs route discovery and route maintainability. Route discovery is responsible for finding new routes. And route maintainability is responsible for finding the broken links and repairing the existing route. For example: AODV, LAR, and DSR. [3] A proactive or table driven protocol is based on exchange of control packets and continuous update on the route information in the routing table. Hence, the route is readily available. For example: DSDV, OLSR. [3]

8 8 OVERVIEW OF VIDEO CODING Non-scalable video coding: There are three basic types for Moving Picture Experts Group (MPEG) video frames: (1) I-frame, or intra-coded frame, where the frame is encoded independently of other frames and decoded by itself, (2) P-frame, or predictive-frame, where the frame is encoded using predictions from a preceding I- or P-frame in the video sequence, and (3) B-frame, or bi-directionally predictivecoded frame, where the frame is encoded using predictions from preceding and succeeding I- or P-frames. Generally, the entire video sequence can be decomposed into smaller units, which are then coded together, called the Group of Pictures (GOP). A GOP pattern is characterized by two parameters, G (N, M): N is the I-to- I frame distance and M is the I-to-P frame distance. For example, as shown in Fig. 1, G (9, 3) means that the GOP includes one I-frame, two P-frames, and six B- frames. The second I-frame showed in Fig.1indicates the beginning of the next GOP. The arrows indicate that the B-frames and P-frames decoded are dependent on the preceding or succeeding I-frames and P-frames. [5] Figure 1: An example of MPEG coding with GOP (N=9, M=3) [5]

9 9 SCALABLE VIDEO CODING In scalable or layered video coding, the video is encoded hierarchically into a base layer and one or more enhancement layers. Decoding the base layer offers low but standard video quality, while decoding the base layer together with additional enhancement layers provides further refinement of the video quality. There are different forms of scalability, including temporal, spatial, and SNR scalability. Figure 2 shows an example of the temporal scalable encoding. The I- and P-frames form the base layer, and the B-frames form the enhancement layer. The base layer provides the basic video quality with a lower frame rate. Adding the enhancement layer to the base layer increases the smoothness of the video quality. H.264/SVC is a scalable extension of H.264/AVC. [2] It is a current standardization of the Joint Video Team (JVT). An encoded SVC bit stream consists of an H.264/AVCcompatible base layer and one or more scalable enhancement layers. Conceptually, the design of H.264/AVC covers a Video Coding Layer (VCL) and a Network Abstraction Layer (NAL). While the VCL creates a coded representation of the source content, the NAL formats these data and provides the header information in a way that enables simple and effective customization of the use of VCL data for a wide variety of systems. Figure 2: An Example of Temporal Video coding [5]

10 10 TYPES OF SVC Figure 3: Types of scalable video coding [13] TEMPORAL SCALABILITY A video bit stream is called temporal scalable when parts of the stream can be removed in a way that the resulting sub stream forms another valid bit stream for some target decoder, and the sub stream represents the source content with a frame rate that is smaller than the frame rate of the complete original bit stream. As depicted in Figure 3, temporal scalability can be achieved by partitioning the access units of a bit stream (each access unit corresponds to a video picture) into a temporal base layer and one or more temporal enhancement layers with the following property: Let the temporal layers be identified by a temporal layer identifier T, which starts from 0 for the base layer and is increased by 1 from one temporal layer to the next. Then for each natural number k, the bit stream that is obtained by removing all access units of all temporal layers with a temporal layer identifier T greater than k forms another valid bit stream for the given decoder. For hybrid video codecs, temporal scalability can generally be enabled by restricting motion-compensated prediction to reference pictures with a temporal layer identifier that is less than or equal to the temporal layer identifier of the picture to be predicted. The prior video coding standards MPEG-1, H.262/MPEG-2 Video, H.263, and MPEG-4 Visual all support temporal scalability to some degree. H.264/AVC provides a significantly increased flexibility for temporal scalability

11 because of its reference picture memory control. It allows the coding of picture sequences with arbitrary temporal dependencies, which are only restricted by the maximum usable DPB size. Hence, for supporting temporal scalability with a reasonable number of temporal layers, no changes to the design of H.264/AVC were required. The only related change in SVC refers to the signaling of temporal layers. A very efficient concept for providing temporal scalability is the usage of hierarchical prediction structures, which have been proposed by the Image and Video Coding group. [13] 11 Figure 4: Hierarchical prediction structures for enabling temporal scalability (a) Coding with hierarchical B or P pictures, (b) non-dyadic hierarchical prediction structure, and (c) Hierarchical prediction structure with a structural encoder/decoder delay of zero. The numbers directly below the pictures specify the coding order; the symbols Tk specify the temporal layers with k representing the corresponding temporal layer identifier.

12 12 SPATIAL SCALABILITY A bit stream is called spatial scalable when parts of the stream can be removed in a way that the resulting sub stream forms another valid bit stream for some target decoder, and the sub stream represents the source content with a spatial resolution that is less than that of the complete original bit stream. For supporting spatial scalable coding, SVC follows the conventional approach of multi-layer coding, which is also used in H.262/MPEG-2 Video, H.263, and MPEG-4 Visual. [2] Each layer corresponds to a supported spatial resolution and is referred to by a spatial layer or dependency identifier D. The dependency identifier D for the base layer is equal to 0, and it is increased by 1 from one spatial layer to the next. In each spatial layer, motion-compensated prediction and intra prediction are employed as for single-layer coding. But in order to improve coding efficiency in comparison to simulcasting different spatial resolutions in separate bit streams, additional so-called inter-layer prediction mechanisms are incorporated as illustrated in Figure 4. The inter-layer prediction techniques have been developed by the Image and Video coding group and include: Inter-layer intra prediction Inter-layer macroblock mode and motion prediction Inter-layer residual prediction As an important feature the inter-layer prediction techniques are designed in a way that each spatial enhancement layer can be decoded with a single motioncompensation loop. [13]

13 13 Figure 5:Multi-Layer structure with additional inter-layer prediction [13] QUALITY SCALABILITY video bit stream is called quality scalable when parts of the stream can be removed in a way that the resulting sub stream forms another valid bit stream for some target decoder, and the sub stream represents the source content with a reconstruction quality that is less than that of the complete original bit stream. Quality scalability can be considered as a special case of spatial scalability with identical picture sizes in base and enhancement layer. The SVC approach supports the same inter-layer prediction mechanisms as for spatial scalability, but without using the corresponding up sampling operations. Furthermore, the inter-layer intraand residual- prediction are directly performed in the transform domain. The approach of re-using the concepts for spatial scalability is also referred to as coarse-grain quality scalability (CGS). When utilizing inter-layer prediction for quality scalability in SVC, a refinement of texture information is typically achieved by re-quantizing the residual texture signal in the enhancement layer with a smaller quantization step size relative to that used for the preceding quality layer. However, this multilayer concept for quality scalable coding only allows a few selected bit rates to be supported in a scalable bit stream. In general, the number of supported rate points is identical to the number of coded quality layers. Switching between different quality layers can only be done at defined points in the bit stream. Furthermore, the multilayer concept for quality scalable coding becomes less efficient, when the relative rate difference between successive quality layers gets smaller.

14 Especially for increasing the flexibility of bit stream adaptation and error robustness, but also for improving the coding efficiency for bit streams that have to provide a variety of bit rates, a variation of the CGS approach, which is also referred to as medium-grain quality scalability (MGS), is included in the SVC design. Besides the modified high-level signaling, the following additional concepts are supported in medium-grain quality scalable coding: 14 Key picture concept for adjusting a suitable trade-off between drift and enhancement layer coding efficiency. Transform coefficient partitioning for increasing the granularity of quality scalable coding [13]

15 15 SVC ENCODER Figure 6: Block diagram of a H.264/SVC encoder for two spatial layers [3] A two-layer temporally scalable coding structure consisting of a base- and an enhancement- layer is shown in Fig. 6. Consider video input at full temporal rate to temporal demultiplexer; in our example it is temporally demultiplexed to form two video sequences, one input to the base-layer encoder and the other input to the enhancement-layer encoder. The base- layer encoder is a main- profile encoder operating at half- temporal rate, the enhancement- layer encoder is like a mainprofile encoder and also operates at half- temporal rate except that it uses base-layer decoded pictures for motion compensated prediction. The encoded bitstreams of base-and enhancement-layers are multiplexed as a single stream in the systems multiplexer. [3]

16 16 SVC DECODER Figure 7: Block diagram of a H.264/SVC decoder for two spatial layers [4] The system demultiplexer in Figure 6 extracts two bitstreams and inputs corresponding bitstreams to base- and enhancement- layer decoders. Out_h is the enhanced layer and Out_I is the base layer. The output of the base-layer decoder can be shown independently at half-temporal rate or after multiplexing with enhancement-layer decoded frames and shown at full temporal-rate. [4]

17 17 IEEE PHYSICAL LAYER SPECIFICATIONS This family of standards deals with the Physical and Data Link layers as defined by the International Organization for Standardization (ISO) Open Systems Interconnection (OSI) Basic Reference Model (ISO/IEC :1994). The access standards define seven types of medium access technologies and associated physical media, each appropriate for particular applications or system objectives. Other types are under investigation. [19]

18 18 IEEE FEATURES The IEEE standard provides MAC and PHY functionality for wireless connectivity of fixed, portable and moving stations moving at pedestrian and vehicular speeds within a local area. Specific features of the IEEE standard include the following: Support of asynchronous and time-bounded delivery service Continuity of service within extended areas via a Distribution System, such as Ethernet Accommodation of transmission rates of 1 and 2 Mbps Support of most market applications Multicast (including broadcast) services Network management services Registration and authentication services Like all IEEE standards, the IEEE standards focus on the bottom two levels of the ISO model, the physical layer and data link layer (Figure 1). Any LAN application, network operating system, or protocol, including TCP/IP and Novell NetWare, will run on an compliant WLAN as easily as they run over Ethernet. [2]

19 19 IEEE E FEATURES IEEE e enhances the IEEE Media Access Control layer (MAC layer) with a coordinated time division multiple access (TDMA) construct, and adds error-correcting mechanisms for delay-sensitive applications such as voice and video. The e specification provides seamless interoperability between business, home, and public environments such as airports and hotels, and is especially well suited for use in networks that include multimedia capability. It offers all subscribers high-speed Internet access with full-motion video, highfidelity audio, and voice over IP. Networks employing IEEE e operate at radio frequencies between either of two ranges: GHz to GHz (the same as IEEE b networks), or GHz to GHz (the same as IEEE a networks). There are certain advantages to the higher frequency range, including faster data transfer speed, more channels, and reduced susceptibility to interference. [2]

20 20 AD-HOC VS INFRASTRUCTURED NETWORKS The ad hoc and infrastructure modes are used by wireless local area networks to connect devices to the networks. Although both modes allow computers and devices to connect to each other on a wireless network, infrastructure mode requires the use of an access point for this communication to take place. Ad hoc mode, on the other hand, uses a direct computer-to-computer connection and is best suited for small home networks. Ad hoc mode involves connecting a computer directly to another computer, so it is often called peer-to-peer networking. Ad hoc and infrastructure modes differ greatly in how the network is set up. In an ad hoc network, each device's network adapter directly communicates with other devices through the use of software. This software can be included with the device's operating system or purchased from a third party. This provides an inexpensive and quicker way to connect than using infrastructure mode. Another benefit of an ad hoc network is that the connection speeds can be significantly faster than when using a wireless accent point with infrastructure mode. Infrastructure networks consist of the networked devices and the wireless access point or wireless router. Each device must connect to the access point before having access to other computers on the network. While both ad hoc and infrastructure networks can provide a secure connection, infrastructure mode supports various encryption methods. Additional security features allow the use of passwords and allow computers to connect by checking a device's media access control (MAC) address. Another difference between ad hoc and infrastructure networks is in the area of expandability. The access point used with infrastructure mode can support multiple clients on both wireless and wired networks. The direct connection method used with ad hoc mode is prone to interference and is not useful for a large corporate network. In addition, ad hoc mode does not support wireless clients, so all computers will need wireless adapters. Wireless access points used in infrastructure mode can also support additional features, including Internet sharing, roaming and the ability to expand a network using multiple access points. Although infrastructure mode is usually more useful than ad hoc mode, wireless access points lead to increased costs and more time for initially setting up the network. Another downside is that the network speed will be lower than an ad hoc network's because data must travel to the access point before reaching another

21 computer. Large networks usually do, however, benefit from using infrastructure mode anyway. [3] 21

22 22 MANET ROUTING PROTOCOLS: PROTOCOLS OVERVIEW MANET routing protocols are classified into three classes: proactive, reactive and hybrid. Figure 7, illustrates routing protocol classification. Figure 8: Manet routing Protocols [4] Routing Protocols Reactive Proactive Hybrid DSR AODV OLSR DSDV TORA

23 23 MANET PROTOCOLS AD-HOC ON DEMAND DISTANCE VECTOR ROUTING In AODV routing protocol the node works independently and does not carry information related to other nodes. When a route request is sent by RREQ, the source node broadcasts all other nodes for the destination node. When destination node is found it replies with RREP back to source node. Each RREQ has a lifespan after which it times out. If source nodes are unable to find the destination node within this lifespan, it adds some more lifespan and sends another RREQ with a different sequence number. [4] DISTANCE SEQUENCE DISTANCE VECTOR DSDV is a proactive protocol, is designed according to Bellman-ford algorithm. It maintains information about next node and each and every node. It collects a list of all destinations and number of hops to the destination and each gateway is numbered, and incremental packets are used to lower the traffic volume due to network route updates. The only advantage of this protocol is preventing creation of routing loops in networks containing mobile routers. [4] DYNAMIC SOURCE ROUTING The DSR is on-demand routing protocol, where route is calculated only when it is required. It is designed to use in multi-hop ad-hoc networks. DSR allows the network to be self-organized and self-configured with any central administration and network infrastructure. DSR doesn t use periodic routing messages like AODV, thus reduces bandwidth overhead and conserved battery power. It only needs support from MAC layer to identify link failure. [4] AD-HOC ON-DEMAND MULTIPATH DISTANCE VECTOR ROUTING. AOMDV had many characteristics like AODV. The main difference lies in the number of routes found in each route discovery. In AODMV, the propagation of RREQ from source towards the destination establishes multiple reverse paths both at intermediate nodes as well as the destination. Multiple RREPs traverse these reverse paths back to form multiple forward paths to the destination at the source and intermediate nodes. AODMV also provides intermediate nodes with alternate paths as they are found to be useful in order to reduce the route discovery frequency. [4]

24 24 IMPLEMENTATION SVEF is used for implementation. SVEF is meant to reproduce a distribution chain formed by three factors: streaming server, middle box and receiver. All factors are connected by an IP network. Figure 10 shows the structure of SVEF with interactions between single tools and data flows depicted as arrows. The software modules inherited from the JSVM package are represented in grey. The whole process, from the encoding of the original video source to the evaluation after the streaming over a network can be summarized in four steps, better detailed in the following sub-sections: Step 1: Raw YUV video: This is the video source file. These files are commonly in the YUV 4CIF ( ), YUV CIF ( ), or QCIF ( ) formats. Step 2: JSVM Encoder: The encoding process is based on configuration files. Users can enable spatial scalability, temporal scalability, SNR scalability, or combined scalability. Figure 8 shows an example of encoding process. The second field shows the frame number and frame type. The third field is in temporal_id (TId), dependency_id (DId), and quality_id (QId) format. DId allows spatial scalability, TId denotes the temporal scalability, and QId represents the quality scalability. For the current SVEF version 1.4 [5], the SVEF does not take the spatial scalability into consideration, and only supports SVC with a single dependency layer and an arbitrary number of quality enhancement layers. Therefore, with the same value for the DId and TId parameters, a NALU having qid (the value of QId) > 0 depends on NALUs having qid-1. With the same value for the DId and QId, a NALU having tid (the value of TId) > 0 and qid=0 depends on NALUs having tid - 1. The remaining fields indicate the quantization parameter, Y-PSNR, U- PSNR, V-PSNR, and encoded frame size. The Peak Signal Noise Ratio (PSNR) can be calculated for both luminance (Y-PSNR) and chrominance (U- PSNR and V-PSNR) components of the video. Since the human eye is more sensitive to luminance (brightness) than chrominance (color), the PSNR is typically evaluated only for the luminance (Y) component. The following equation

25 shows the definition of the PSNR between the luminance component Y of source image and destination image D: 25 V peak PSNR(n) = 20 log 10 1 N N ( col N row col N row j=0 [Y s (n, i, j) Y D (n, i, j)] 2 i=0 ) Equation 1: Calculation of PSNR (db) [8] Where V peak =2 k -1 and k=number of bits per pixel. N col presents the number of columns, while N row is the number of rows in an image. PSNR measures the error between a reconstructed image and the original one. A larger PSNR measures the error between a reconstructed image and the original one. A larger PSNR value corresponds to a better image quality. [3] Step 3: JSVM BitstreamExtractor: Figure 9: Example of encoding process After encoding, a H.264 video file is generated. This video file is then fed into BitstreamExtractor to produce the original Network Abstraction Layer Unit (NALU) trace file. However, this trace file does not contain frame number information. So this trace file is processed by an F-N Stamp to generate a NALU trace with frame number information in it. In Figure 9, the meanings of all fields are as follows: memory offset, NALU-size, DId, TId, UId,

26 26 Type, Discardable, Truncatable, Frame-number, and Frame-sending time or Frame-receiving time Figure 10: Example of original NALU trace file [5] Streamer: The streamer reads the original NALU trace file, loads the data from H.264 file, and then sends the NALUs over the IP network. The sent out packets consists of an IP header, UDP header, custom layer-5 header, and then payload. If a packet is too large and exceeds the fragmentation limit, the SVC will let the IP layer to do IP fragmentation/reassembly jobs. MiddleBox: This component is optional. The creators of the SVEF use this MiddleBox as an example to do packet scheduling. When the available bandwidth is less than the sending rate, MiddleBox will decide which packets can send out and which packets cannot in accordance with the DId, TId, and QId fields in the packet header. The Receiver-side Tools (NALU-Receiver, NALU-Filter, and Frame-Filler): In the receiver side, the NALU-Receiver is used to receive packets, and builds a received NALU trace file at the same time. The file format is the same as in Figure 9, but the last field is recorded as frame-receiving time. Next, the received NALU trace file is processed by the NALU-Filter. This filter reorders the NALUs in accordance with the sending order, and removes NALUs that are too late or the NALUs with unfulfilled decoding dependencies. Then, the filtered NALU trace file is passed to JSVM BitstreamExtractor to retrieve the NALUs that are effectively decoded at the receiving side, and then decodes them into YUV video. It is worth noting that JSVM decoder does not directly decode the received NALUs. This is because the JSVM decoder cannot handle out-of-order, corrupted, or missing NALUs properly. In the final step, in order to compare the PSNR values, the same number of frames with the original raw YUV video is needed.

27 27 Therefore, Frame-Filler is used to conceal the missing frames by copying the previous frame. Figure 11: SVEF Software Chain [4]

28 28 IMPLEMENTATION SNAPSHOTS STEP 1: H.264/SVC Transmissions over IEEE have been done. The test Video Sequence Foreman is used for simulations in YUV CIF format and comprises of 300 frames. It is encoded by JSVM with temporal scalability enabled. The screenshot of the result and the summarized table is given below. Layer Resolution Frame Rate Bit Rate (Dld,Tld,Qld) x (0,0,0) x (0,1,0) x (0,2,0) Table 1: Parameters for Foreman video

29 29 STEP 2: Generate NALU Trace File: Figure 12: Image of NALU Trace File After Encoding, a H.264 Video file is generated. This Video file is then fed into BitstreamExtractor to produce the original Network Abstraction Layer Unit (NALU) trace File. However this trace file does not contain frame number information. So this trace file is processed by an F-N Stamp to generate a NALU trace with frame number information in it. In Figure 9, the meanings of all fields are as follows: memory offset, NALU-size, DId, TId, UId, Type, Discardable, Truncatable, Frame-number, and Frame-sending time or Frame-receiving time.

30 30 Step 3: Use F-N stamp to generate frame numbers Step 4: Figure 13: Image of bitstreams with F-N stamps Prepare sending trace needed using SVEF Figure 14: Image of prepare_sendtrace This step decides the time when svc video should start transmitting. Here the video transmission starts at 0.5s.

31 31 STEP 5: Prepare a TCL script for 802_11 network with DSDV routing protocol for the network simulator. Figure 15: Sample image of TCL Script Step 6: Simulate the Tcl file in the network simulator.

32 32 Step 7: After simulation we receive a receiver Trace file. The first field is receiving time, the second is frame-number, the third is packet size, the fourth is lid, the fifth is tid, the sixth is qid, the seventh is packet id, and the last one is sending time

33 33 Step 8: Plot the graph for Packet end to end delay. The figure 16 shows an example graph for DSDV simulation. Figure 16: End to End delay for 802_11 Network DSDV Simulation.

34 34 Step 9: Convert the required rd file format to Receiver Trace file required for SVEF. Step 10: We have to compare the received file with the original file with the frame numbers. The NALU filter will discard too late frames and frames that cannot be decoded due to frame dependencies. Step 11: The current version of JSVM (9.19.8) cannot decode video streams affected by out of order, corrupted, or missing NALUs. Therefore, SVEF uses filtered packet trace file to extract the corresponding packets in original h.264 video file by means of BitStreamExtractorStatic.

35 35 Step 12: The video sequence is decoded by temporal scalability. The initial drop is due to loss of frames. Since we lose some of the frames while decoding, we have to copy the previous frame in order to have the same PSNR. An Example of PSNR vs frame number is shown in Figure 17. Figure 17: PSNR plot for 802_11 DSDV simulation

36 36 PACKET END TO END DELAY IEEE NETWORK SIMULATION RESULTS FOR DIFFERENT PROTOCOLS Figure 18: Packet end to end delay using AODV protocol for IEEE

37 Figure 19: Packet end to end delay using DSDV protocol for IEEE

38 38 Figure 20: Packet end to end delay using DSR protocol for IEEE Figure 21: Packet end to end delay using AOMDV protocol for IEEE

39 Figure 22: Comparison between Different Routing protocols on IEEE

40 40 IEEE E NETWORK SIMULATION RESULTS FOR DIFFERENT PROTOCOLS Figure 23: Packet end to end delay using DSDV protocol for IEEE

41 Figure 24: Packet end to end delay using AODV protocol for IEEE

42 Figure 25: Packet end to end delay using DSR protocol for IEEE

43 Figure 26:Packet end to end delay using AOMDV protocol for IEEE

44 Figure 27: Comparison between Different Routing protocols on IEEE E 44

45 45 PSNR PLOTS FOR DSDV AND AOMDV PROTOCOLS Figure 28: Comparison of PSNR for different network for AODV protocol Figure 29: Comparison of PSNR for different network for AOMDV protocol

46 46 SUMMARY OF AVERAGE PSNR VALUES PROTOCOL IEEE PSNR (db) IEEE E PSNR (db) DSDV AODV DSR AODMV GRAPHICAL PSNR COMPARISON IEEE E PSNR (db) DSDV AODV DSR AODMV IEEE PSNR (db) DSDV AODV DSR AODMV

47 47 COMPARISON OF PERFORMANCE BETWEEN THE NETWORKS Figure 30: Comparison of Performance between networks IEEE IEEE e 51.44% 9.22% Table 2: Packet Loss Rate Table 2 and Fig.30 show the network level performance metrics, i.e., the packet loss rate and end-to-end delay. It is clearly seen from Table 2 that when all traffic packets are transmitted over IEEE networks, the packet loss rate is high. This is because all packets go into the same output interface queue and the queue size is limited. When the queue is full, it starts to drop the packets. On the contrary, when video packets are transmitted over IEEE e, these packets do not need to contend with best effort or background traffic packets. Therefore, IEEE e can achieve the lowest packet loss rate. Next, if we compare the end-to-end delay,

48 we can see that when the packet sequence number is below 500, the packets with IEEE e are lower than those with However, when the packet sequence number is above 500, the packets with e become larger. When the simulation time is below 8 seconds, the queue length is small. The video packets do not need to wait for so long. Therefore, the end-to-end delay is also small. 48 EXAMPLE OF CONSECUTIVE VIDEO FRAMES Figure 31: Frame 144

49 49 Figure 32: Frame 145 Figure 33: Frame 146

50 50 CONCLUSIONS The objective of this project is two-fold. The first is to integrate SVEF and NS2 to create the myevalsvc framework for the evaluation of H.264/SVC transmission in a simulated environment. Researchers who work on video coding can simulate the effects of a more realistic network on video sequences resulting from their coding schemes, while researchers who work on network technology can evaluate the impact of real video streams on the proposed network architecture or protocols. The evaluation starts from encoding the raw YUV video, parse the video content, prepare the NS2 traffic trace file, and perform the simulation. After the simulation, the network-level performance metrics such as packet loss rate and end-to-end delay can be obtained with the aid of programs provided in myevalsvc. Moreover, the received video can be constructed through the process of filtering out very late and undecodable NALUs and through frame concealment. Lastly, the end-to-end application level metric, PSNR, can be calculated by comparison of the received final YUV video with the original raw YUV video. In addition, visual evaluation is also possible with the help of the YUV viewer program. [7] FUTURE WORK Further work on this project can be done by implementing HEVC [8] video sequences in IEEE and e networks. Different routing protocols can also be tested for their performance.

51 51 APPENDIX 802 Overview Basics of physical and logical networking concepts Bridging LAN/MAN bridging and management. Covers management and the lower sub-layers of OSI Layer 2, including MAC-based bridging (Media Access Control), virtual LANs and port-based access control Logical Link Commonly referred to as the LLC or Logical Link Control specification. The LLC is the top sub-layer in the data-link layer, OSI Layer 2. Interfaces with the network Layer Ethernet Provides asynchronous networking using "carrier sense, multiple access with collision detect" (CSMA/CD) over coax, twisted-pair copper, and fiber media. Current speeds range from 10 Mbps to 10Gbps Token Bus Disbanded Token Ring The original token-passing standard for twisted-pair, shielded copper cables. Supports copper and fiber cabling from 4 Mbps to 100 Mbps. Often called "IBM Token-Ring."

52 Distributed queue dual bus (DQDB) "Superseded **Revision of 802.1D-1990 edition (ISO/IEC 10038) D incorporates P802.1p and P802.12e. It also incorporates and supersedes published standards 802.1j and 802.6k Broadband LAN Practices Withdrawn Standard. Withdrawn Date: Feb 07, No longer endorsed by the IEEE Fiber Optic Practices Withdrawn PAR. Standards project no longer endorsed by the IEEE Integrated Services LAN Withdrawn PAR. Standards project no longer endorsed by the IEEE Interoperable LAN security Superseded **Contains: IEEE Std b Wi-Fi Wireless LAN Media Access Control and Physical Layer specification a, b,g, etc. are amendments to the original standard. Products that implement standards must pass tests and are referred to as "Wi-Fi certified." a Specifies a PHY that operates in the 5GHz U-NII band in the US - initially AND since expanded to additional frequencies

53 53 Uses Orthogonal Frequency-Division Multiplexing Enhanced data speed to 54 Mbps Ratified after b Enhancement to that added higher data rate modes to the DSSS (Direct Sequence Spread Spectrum) already defined in the original standard b Boosted data speed to 11 Mbps 22 MHz Bandwidth yields 3 non-overlapping channels in the frequency range of GHz to GHz Beacons at 1 Mbps, falls back to 5.5, 2, or 1 Mbps from 11 Mbps max d Enhancement to a and b that allows for global roaming Particulars can be set at Media Access Control (MAC) layer e Enhancement to that includes quality of service ( QoS ) features Facilitates prioritization of data, voice, and video transmissions

54 g Extends the maximum data rate of WLAN devices that operate in the 2.4 GHz band, in a fashion that permits interoperation with b devices Uses OFDM Modulation (Orthogonal FDM) Operates at up to 54 megabits per second (Mbps), with fall-back speeds that include the "b" speeds h Enhancement to a that resolves interference issues Dynamic frequency selection (DFS) Transmit power control (TPC) Enhancement to that offers additional security for WLAN applications i Defines more robust encryption, authentication, and key exchange, as well as options for key caching and preauthentication j Japanese regulatory extensions to a specification Frequency range 4.9 GHz to 5.0 GHz k Radio resource measurements for networks using family specifications

55 m Maintenance of family specifications Corrections and amendments to existing documentation Higher-speed standards Several competing and non-compatible technologies; often called "pre-n" n Top speeds claimed of 108, 240, and 350+ MHz Competing proposals come from the groups, EWC, TGn Sync, and WWiSE and are all variations based on MIMO (multiple input, multiple output) x Mis-used "generic" term for family specifications Demand Priority Increases Ethernet data rate to 100 Mbps by controlling media utilization Not used Not used Cable modems Withdrawn PAR. Standards project no longer endorsed by the IEEE.

56 Wireless Personal Area Networks Communications specification that was approved in early 2002 by the IEEE for wireless personal area networks (WPANs) Bluetooth Short range (10m) wireless technology for cordless mouse, keyboard, and hands-free headset at 2.4 GHz a UWB Short range, high-bandwidth "ultra wideband" link ZigBee Short range wireless sensor networks Mesh Network Extension of network coverage without increasing the transmit power or the receiver sensitivity Enhanced reliability via route redundancy Easier network configuration - Better device battery life Wireless Metropolitan Area Networks This family of standards covers Fixed and Mobile Broadband Wireless Access methods used to create Wireless Metropolitan Area Networks (WMANs.) Connects Base Stations to the Internet using OFDM in unlicensed (900 MHz, 2.4, 5.8 GHz) or licensed (700 MHz, GHz) frequency bands. Products that implement standards can undergo WiMAX certification testing.

57 Resilient Packet Ring IEEE working group description Radio Regulatory TAG IEEE standards committee Coexistence IEEE Coexistence Technical Advisory Group Mobile Broadband Wireless Access IEEE mission and project scope Media Independent Handoff IEEE mission and project scope Wireless Regional Area Network IEEE mission and project scope

58 58 REFERENCES [1] X. Lu, G.R. Martin, and X. Jin, "Performance comparison of the SVC,WSVC, and Motion JPEG 2000 Advanced Scalable Video coding schemes," in intelligent signal processing conference (ISP 2013), vol. 8, London, pp. 1-6,Dec 2013 [2] Wireless Networking. Study of IEEE Specification. [Online]. /Wireless%20Networking% htm [3] Difference between Ad-hoc and infrastructure modes. [Online]. [4] C.H. Ke, "myevalsvc: An Integrated simulation Framework for Evaluation of H.264/svc Transmission," in KSII Transactions on Internet and information systems, vol. 6, NO.1, pp ,Jan [5] C.H. Ke. (2014) How to do H.264 SVC transmission simulations. This website explains the simulation steps for SVEF Evaluation FrameWork. [Online]. [6] SVEF Framework: scalable video evaluation Framework. SVEF is a mixed online/offline open-source framework devised to evaluate the performance of H.264 SVC video streaming. It is written in C and Python and released under the GNU General Public License. [Online]. [7] Image Processing SVC Extension of H.264/AVC. This gives overview of different SVC Methods. [Online].

59 59 [8] Tutorial for network simulator. This Explains about working of network simulator. [Online]. [9] U. Iraide et al., "A Tutorial on H.264/SVC Scalable Video Coding and its Tradeoff between Quality, Coding Efficiency and Performance," in Recent Advances in video coding, Javier Del Ser, Ed.: Intech, July 2011, ch. 1, pp [Online]. [10] JSVM software. [Online]. [11] H. Yang and X. Jing, "Apaptive scalable Video coding for Wireless Networks," in IEEE Paper on Microwave, Antenna, Propogation and EMC Technologies for Wireless communication, vol. 4, chengdu,pp , Oct [12] E. Toh, C. Keong M. Rover, "A review of current Routing protocols for Adhoc Mobile Wireless Networks," in IEEE Transaction on Personal communication, vol. 6, california,, pp , April [13] Implementation of IEEE e using NS Simulator.. [Online]. [14] O.B Rhaiem and L.C. Fourati, "Routing Protocols Performance analysis for scalable video coding(svc) transmission over mobile ad-hoc networks," in IEEE Transaction on signal and image Processing applications, vol. 3, Melaka, pp , Oct [15] N.I. Sarkar and R. McHaney, "Modulation and simulation of IEEE WLAN: A case study of A Network Simulator," in AUT Transactions on Computer and information science, vol. 3, New Zealand,pp , September 2005.

60 60 [16] JSVM Software Manual. [Online]. ube.ege.edu.tr/~boztok/jsvm/softwaremanual.pdf [17] H. Schwarz, D. Marpe, and T. Wiegand, "Overview of the scalable Video Technology," in IEEE Transactions. CSVT, Special Issue on H.264/AVC, vol. 17, pp , Sept [18] A.Detti et al., "SVEF: an open source Experimental Evaluation Framework for H.264 Scalable Video Streaming," in IEEE symposium on computers and communications, vol. 5, pp , july [19] A. Puri, L. Yan, and B.G. Haskell, "Temporal resolution scalable video coding," in IEEE International Conference on Image Processing, vol. 2, pp , Nov [20] IEEE Wireless Standards Fast Reference. [Online]. Wireless-Standards-Fast-Reference [21] T. Weigand et al, "Overview of H.264/AVC Video Coding Standard," in IEEE Transactions. CSVT, Special Issue on H.264/AVC, vol. 13, pp ,July [22] M.M. Hannuksela, T. Wiegand and T. Stockhammer, "H.264/AVC in wireless environments," in IEEE Transactions. CSVT, vol. 13,, pp ,July [23] S. Wenger, "H.264/AVC over IP," in IEEE CSVT, vol. 13, pp , July [24] I.E. Richardson. H.264 / MPEG-4 Part 10 White Paper. [Online].