Performance Evaluation of Reactive Routing Protocols in MANET Using NS2

Purpose Quality communication is a big challenge in mobile ad hoc networks because of a restricted environment for mobile devices, bandwidth-constrained radio connections, random mobility of connected devices, etc. High-quality communication through wireless links mainly depends on available bandwidth, link stability, energy of nodes, etc. Many researchers proposed stability and link quality methods to improve these issues, but they still require optimization. This study aims to contribute towards better quality communication in temporarily formed networks. The authors propose the stable and bandwidth aware dynamic routing (SBADR) protocol with the aim to provide an efficient, stable path with sufficient bandwidth and enough energy hold nodes for all types of quality of service (QoS) data communication. Design/methodology/approach The proposal made in this work used received signal strength from the media access control (MAC) layer to estimate the stability of the radio connection. The proposed path stability model combines the stability of the individual link to compute path stability. The amount of bandwidth available for communication at a specific time on a link is defined as the available link bandwidth that is understood as the maximum throughput of that link. Bandwidth as a QoS parameter ensures high-quality communication for every application in such a network. One other improvement, towards quality data transmission, is made by incorporating residual energies of communicating and receiving nodes in the calculation of available link bandwidth. Findings Communication quality in mobile ad hoc network (MANET) does not depend on a single parameter such as bandwidth, energy, path stability, etc. To address and enhance quality communication, this paper focused on high impact factors, such as path stability, available link bandwidth and energy of nodes. The performance of SBADR is evaluated on the network simulator and compared with that of other routing protocols, i.e. route stability based QoS routing (RSQR), route stability based ad-hoc on-demand distance vector (RSAODV) and Ad-hoc on-demand distance vector (AODV). Experimental outcomes show that SBADR significantly enhanced network performance in terms of throughput, packet delivery ratio (PDR) and normalized control overhead (NCO). Performance shows that SBADR is suitable for any application of MANET having random and high mobility. Research limitations/implications QoS in MANET is a challenging task. To achieve high-quality communication, the authors worked on multiple network parameters, i.e. path stability, available link bandwidth and energy of mobile nodes. The performance of the proposed routing protocol named SBADR is evaluated by a network simulator and compared with that of other routing protocols. Statistical analysis done on results proves significant enhancement in network performance. SBADR is suitable for applications of MANET having random and high mobility. It is also efficient for applications having a requirement of high throughput. Practical implications SBADR shows a significant enhancement in received data bytes, which are 1,709, 788 and 326 more in comparison of AODV, RSAODV and RSQR, respectively. PDR increased by 21.27%, 12.1%, 4.15%, and NCO decreased by 9.67%, 5.93%, 2.8% in comparison of AODV, RSAODV and RSQR, respectively. Social implications Outcomes show SBADR will perform better with applications of MANET such as disaster recovery, city tours, university or hospital networks, etc. SBADR is suitable for every application of MANET having random and high mobility. Originality/value This is to certify that the reported work in the paper entitled “SBADR: stable and bandwidth aware dynamic routing protocol for mobile ad hoc network” is an original one and has not been submitted for publication elsewhere. The authors further certify that proper citations to the previously reported work have been given and no data/tables/figures have been quoted verbatim from the other publications without giving due acknowledgment and without permission of the author(s).

In recent times, different routing protocols have been proposed in the Internet of Things enabled Underwater Wireless Sensor Networks (IoT-UWSNs) to explore the underwater environment for different purposes, i.e., scientific and military purposes. However, high Energy Consumption (EC), End to End (E2E) delay, low Packet Delivery Ratio (PDR) and minimum network lifetime make the energy efficient communication a challenging task in Underwater Wireless Sensor Network (UWSN). The high E2E delay, EC and reliable data delivery are the critical issues, which play an important role to enhance the network throughput. So, this paper presents two energy efficient routing protocols namely: Shortest Path-Collision avoidance Based Energy Efficient Routing (SP-CBE2R) protocol and Improved-Collision avoidance Based Energy Efficient Routing (Im-CBE2R) protocol. At this end, both routing protocols minimize the probability of void hole occurrence and in return minimizes the EC and E2E delay. In both routing protocols, courier nodes are positioned at different strategic locations to keep the greedy forwarding continuous. The proposed routing protocols are also analyzed by varying the Packet Size (PS) and Data Rate (DR). Additionally, various simulations have been performed to authenticate the proposed routing protocols. Simulation results show that the proposed routing protocols outperform the baseline routing protocols in counterparts.

Critical and public safety operations require real-time communication from the incident area(s) to the distant operations command center going through the evacuation and medical support areas. Data transmitted throughout such type of network is extremely useful for decisions makers and operations' conducting. Therefore, any delay in communication may cause lives' loss. Above all, the existing infrastructure communication systems (PSTN, WiFi, 4/5 G, etc.) can be damaged and is often not available solution. An alternate option is to deploy autonomous tactical network at unpredictable location and time. However, in this context there are many challenge especially how to effectively rout or disseminate the information. In this paper, we present behavior of varied multi-hops routing protocols evaluated in a disaster-simulated scenario with different communication technologies (i.e. WiFi IEEE 802.11; WSN IEEE 802.15.4; WBAN IEEE 802.15.6). Studied routing strategies are classified: Ad hoc proactive and reactive protocols, geographic-based and gradient-based protocols. To be realistic, we have conducted our simulations by considering a Mall in Doha city in the State of Qatar. Moreover, we have generated a mobility trace to model the rescue teams and crowd movements during the disaster. In conclusion, extensive simulations showed that WiFi IEEE 802.11 is the best wireless technology to consider in an emergency urban with the studied protocols. On the other hand, gradient based routing protocol performed much better especially with WBAN IEEE 802.15.6. Keyword: Tactical Ad-hoc Networks; Public Safety and Emergency; Routing Protocols; IEEE 802.11; IEEE 802.15.4; IEEE 802.15.6; Performance Evaluation I. Introduction Public safety is a worldwide governments' concern. It is a special continuous reactive set of studies, operations and actions in order to predict plan and perform a successful reaction in a disaster case. Coupled with the raise of number and variety of disasters, not only the economies and infrastructures are affected, but significant number of human lives. With regards to the emergency response to these disasters, the role of existing Public Safety Network (PSN) infrastructures (e.g. TETRA, LTE) is extremely vital. However, it is anticipated that, during and after the disasters, existing PSN infrastructures can be flawed, oversaturated or completely damaged. Therefore, there is a growing demand for ubiquitous emergency response system that could be easily and rapidly deployed at unpredictable location and time. Wherefore Wearable Body Area Networks (W-BAN) is a relevant candidate that can play a key role to monitor the physiological status of involved workforces and the affected individuals. Composed by small and low-power devices connected to a coordinator, WBAN communication architecture relies on three levels: On-Body (or intra-Body), Body-to-Body (or inter-Body) and off-Body communication networks. In disaster scenarios, the network connectivity and data is a challenging problem due to the dynamic mobility and harsh environment [1]. It is envisioned that, in case of unavailable or out-of-range network infrastructures, the WBANs coordinators along with WBANs sensors can exploit cooperative and multi-hop body-to-body communications to extend the end-to-end network connectivity. The Opportunistic and Mobility Aware Routing (OMAR) scheme is an on-body routing protocol proposed in one of our earlier works [2]. A realistic mobility model is also a major challenge related to the simulations. To the best knowledge of the authors, no comparable study in disaster context is conducted by considering a realistic disaster mobility pattern. In this paper, we investigate varied classes of multi-hop Body-to-Body routing protocols using a realistic mobility modeling software provided by Bonn University in Germany [3]. The mobility pattern is exploited by the WSNET simulator as a mobility trace of the nodes moving during and after the disaster. Note here that individuals are considered mobile nodes in the scenario. In the conducted simulations, each iteration, one communication technology configuration is selected (i.e. WiFi IEEE 802.11; WSN IEEE 802.15.4; WBAN IEEE 802.15.6), then simulations are ran with the routing protocols (i.e. proactive, reactive, gradient-based and geographical-based). This strategy provides a vision not only on the behavior of the routing protocols in the disaster context, but evaluates the communication technologies in such case also. For proactive, reactive, gradient-based and geographical-based routing protocols, Optimized Link State Routing protocol version 2 (OLSRv2) [4], Ad-hoc On-Demand Distance Vector (AODVv2) [5], Directed Diffusion (DD) [6] and Greedy Perimeter Stateless Routing (GPSR) [7] protocols are selected respectively The remainder of this abstract is organized as follows. In section II, we present briefly the disaster scenario considered. In section III, we explain the results of the simulations. Finally, in Section IV, we conclude and discuss perspectives. II. Landmark disaster scenario we are investigating a disaster scenario (fire triggering) in the “Landmark” shopping mall. The mobility model used is generated by the BonnMotion tool. We assume that the incident is caused by fire into two different locations. Rescuers are immediately called to intervene. We consider that firefighters are divided into 3 groups of vehicles with 26 firefighters in each group. Medical emergency teams that probably could reach the mall just after the incident, are consisting of 6 ambulances with 5 medical staff in each ambulance (30 rescuers in total). Civilians could also help rescuers and they are also considered in the mobility trace generation. Injured individuals are transported from the incident areas to the patients waiting for treatment areas to get first aids. Then, they will be transported to the patients clearing areas where they will be either put under observation or evacuated to hospitals by ambulance or helicopter. A tactical command center conducting the operations is represented by WSNET is an event-driven simulator for wireless networks. WSNET is able to design, configure and simulate a whole communication stack from the Physical to the Application Layer. We benefit from these features to vary the payload with the selected MAC and routing layer in each iteration. These combinations provided a deep review on the possible communication architecture to consider in disaster operations. The following section describes the outcome of these extensive simulations. III. Performance evaluation The main difference between the disaster and any other scenario is the emergency aspect. All flowing data in the network is considered highly important. The probability of packets that did not reach the destination must be zero. For this reason, our evaluation is regarded to the Packet Reception rate (PRR). Likewise, a delayed packet is such like an unreceived packet. That's why we consider the delay as decisive factor. Similarly, the energy consumption is also observed. The following table summarizes the obtained results. In terms of average PRR, WiFi IEEE 802.11 is convincingly better than the two counterparts combined with all the routing protocols. GPSR has a considerable PRR with WBAN IEEE 802.15.6, but the location information of the nodes is considered as known. Regarding the delay, DD is particularly efficient with WiFi and WBAN. To conclude, DD is an efficient routing protocol to consider in case of Indoor operations, while GPSR is most relevant in Outdoor operations where locations can be obtained from GPS. IV. Conclusion Disasters are growing remarkably worldwide. The existing communication infrastructures are not considered a part of the communication recuing system. Consequently, to monitor deployed individuals (rescue teams, injured individuals, etc.) data should be forwarded throughout these individuals (WBANs) to reach a distant command center. In order to evaluate the performance of diverse multi-hop routing protocols, we have conducted extensive simulations on WNSET using a realistic mobility model. The simulations showed that all evaluated routing protocols (i.e.AODVv2, OLSRv2, DD and GPSR) has the best PRR with the WiFi technology. While, DD was found to be the most efficient with the WBAN technology. GPSR also could be considered when the location information is available. Acknowledgment The work was supported by NPRP grant #[6-1508-2-616] from the Qatar National Research Fund which is a member of Qatar Foundation. The statements made herein are solely the responsibility of the authors.

Due to the increased use of mobile devices with the high demand for applications such as video application, most companies have tended to pay attention to Mobile Ad hoc Networks. This type of network is characterized by multi-hop wireless networks where data packets are sent in a "store and forward" manner from the source to an arbitrary destination via intermediate nodes. The mobile nodes are connected by multi-routes routing as the nodes in this network not only serve as hosts but also as routers where data is routed to and from other nodes in the network and therefore the mobile node not only sends its data packets but also sends data packets of other mobile nodes. The network architecture changes dynamically, mainly because of Mobility of nodes, so we need routing protocols to establish the connection. Routing protocols are categorized into proactive routing protocols, reactive routing protocols and hybrid routing protocols. So in this research, we has been studied Geographical Routing Protocol (GRP ), Optimized Link State Routing Protocol (OLSR) routing protocols which is one of proactive routing protocols and hybrid routing protocols respectively on the basis of Throughput, Delay and Load..etc and evaluated the performance in a large mobile ad hoc network and in a small mobile ad hoc network as well as for different video resolutions, the OPNET 14.5 network simulator was used to obtain research results. It was found that the GRP protocol performs better for a small number of nodes whether the video resolution is low or high while its performance decreases when the number of nodes increases in the network but the OLSR protocol improves when the number of nodes is increased.

An adaptive and multi-path greedy perimeter stateless routing protocol in flying ad hoc networks

Data routing is an essential operation in working of a MANET. Many researchers have proposed novel routing protocols for MANET. Working of the routing protocols differs with each other. Each routing protocol follows a set of rules and has different characteristics. Various network simulators are popularly used to test performance and working of the novel routing protocols. However, there is a need to formally verify working of any novel routing protocol and to statistically validate experimental results collected from simulation. Our last research contribution proposed a novel trust-based opportunistic routing protocol, viz. ORPSN. This paper presents formal verification of ORPSN protocol using analytical proofs. The paper gives analytical proofs about optimality of the algorithm and loop freedom. The paper uses t-test to validate experimental results and observations. It compares performance of ORPSN and CORMAN opportunistic routing protocols in various test conditions. After statistical validation of experimental results, it is observed that performance of ORPSN is significantly better than CORMAN.

Mobile ad hoc Networks (MANETs) is a type of wireless ad hoc network which is a self-arranging network of mobile nodes connected by wireless links that create a discretionary topology. The mobile nodes are free to move randomly and to arrange themselves in a random manner. Thus, the wireless ad hoc network topology may expand rapidly and unpredictably. In Mobile ad hoc networks, the routing protocol plays an important role for improving Quality of Service (QoS). There are many different types of routing protocols such as reactive, proactive, and hybrid. In reactive routing protocol, AODV is a one which establishes routes on-demand, as they are needed. In this paper, we proposed a new routing protocol called Reverse Ad hoc On-Demand Distance Vector (R-AODV) routing which reduces route path fail correction messages and gives better performance than the original AODV routing protocol with respect to set of performance metric such as packet delivery ratio, throughput, energy consumption, and overhead under different pause time. We designed the R-AODV routing protocol and implemented with certain simulation parameters using Network Simulator (NS-2) tool. The performance analysis of routing protocol designed for wireless networks has been very challenging. Hence, simulations are always utilized to obtain the desired performance results.

Greedy Perimeter Stateless Routing (GPSR) protocol is best suited position-based routing protocol for unpredicted topology of vehicular ad hoc networks (VANETs). However, presence of malicious vehicles makes network vulnerable to various attacks. They broadcast the beacons with forged position, producing an illusion of right vehicle for packet forwarding resulting in high packet drop or may broadcast event messages with fabricate information, triggering catastrophic situation. So, we proposed an enhancement of GPSR protocol which considers vehicle trustworthiness in path selection process. The trustworthiness is measured by direct trust-based evaluation method, assuring the reliability of each communicated message. Our protocol also introduces a location verification method to avoid location-faking behavior of malicious vehicles. Simulation conducted using network simulator (NS-2) platform depicted that the DT-GPSR enhances the packet delivery ratio by more than 20% with less delay than standard GPSR routing protocol even in the presence of malicious vehicles.KeywordsVehicular ad hoc networkPosition-based routingTrustGPSREvent messageBeacon messageInfotainment message

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Ad hoc networks are useful for providing communication support where no fixed infrastructure exists or the deployment of a fixed infrastructure is not economically profitable, and movement of communicating parties are allowed. Due to the dynamic topology, developing better routing protocol became a challenging task. The Dynamic Source Routing (DSR) protocol is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. Multi-path routing protocol is one of the approaches used to have less overhead, better bandwidth cost by distributing the load among a set of paths . However, due to interfering in the channels of the paths, multi-path increases the end to end delay and do not work well in highly congested networks. In this paper we propose a congestion aware multi-path Dynamic Source Routing Protocol. we generate a set of disjoint multi-paths and handle the problem of end to end delay using the correlation factor measurement. A set of path selection criteria have been used to improve the end to end delay. The simulation experiments are conducted using ns-2 network simulator. We will compare the performance of the suggested algorithm to the performance of the conventional Dynamic Source Routing Protocol (DSR).

Wireless mesh networks (WMNs) are gaining significant momentum as a promising technology for the next-coming state-of-the-art wireless networking. Among many factors, the performance of WMNs would be largely affected by the properness of the deployed routing protocols and the efficient usage of wireless resources. Routing protocols are required to well capture WMNs' features while wireless channels should be used efficiently in order to accommodate high amount of traffics over the mesh backbone. Recently, a Tree-based Routing (TBR) protocol become a popular state-of-the-art proactive routing protocol and its tree-based broadcasting become an often used technique. Though TBR protocol is well-suited for WMNs' architecture and the skewed nature of traffic toward the root, the protocol in its current form faces issues which has to be addressed. Specifically, when some or all nodes are equipped with multiple radios, to reduce collision and co-channel interference, not only the parent-child relationship but also the sibling relationship need to be constructed by the TBR protocol in the multi-channel WMNs. In this paper, we propose a hybrid tree-based protocol for concurrent routing and channel assignment over WMNs. The protocol makes use of sibling links to mitigate the aforementioned shortcomings of TBR protocol. Moreover, in order to address high backbone traffic, the protocol integrates a receiver-based channel assignment scheme. The protocol efficiently deploys the parent-child topological relationships of nodes to enhance efficiency of broadcast transmissions over receiver-based multi-channel WMNs. Simulation results over NS-2 network simulator reveal that our proposed hybrid tree-based protocol achieves much higher performance than the utilization of the original receiver-based CA and TBR protocol.

An adhoc network is a collection of mobile nodes connected by a wireless link, where each node acts as a router. In order to facilitate the communication within the network, a routing protocol is needed. Due to bandwidth constraint and dynamic topology of the mobile adhoc Networks supporting Quality of Service (QoS) is challenging task. The aim of this work is to present QoS enabled routing protocol in adhoc networks and compare it with normal routing protocol. The Optimized Link State Routing (OLSR) protocol is an optimization of the classical link state protocol, which is used for implement the QoS. Such protocol is adopted for the reason that it reduces the size of control messages and minimizes the overhead from the flooding of control traffic. The performance of both routing and QoS routing protocols are evaluated using Network simulator Ns-2.QoS enabled routing protocol shows a significant improvement in protocol performance metrics applied in our measurements, such as packet delivery ratio, packet loss and delay.

Mobile Ad hoc Networks (MANETs) is a type of wireless ad-hoc network which is a self-arranging network of mobile nodes connected by wireless links which creates a discretionary topology. The mobile nodes are free to move randomly and to arrange themselves in a random manner. Thus, the wireless ad hoc network topology may expand rapidly and unpredictably. In Mobile Adhoc networks, the routing protocol plays an important role in improving Quality of Service (QoS). There are many different types of routing protocols such as reactive, proactive and hybrid. The AODV is a reactive routing protocol which establishes routes on-demand, as they are needed. In this paper, we described a new protocol based on the AODV which gives better performance than the original AODV routing protocol with respect to set of performance metric such as a packet delivery ratio, throughput, energy consumption and overhead, under different conditions. The proposed routing protocol Modified Ad-Hoc On-Demand Distance Vector (M-AODV) describes that the new operation for routing path reconstruction should be made from the source. It also explains a new method for identifying multiple disjoint routes. Performance analysis of routing protocol designed for wireless networks has been very challenging. Hence, simulations are always utilized to obtain the desired performance results. Simulations were performed by Network Simulator (NS2).

Wireless sensor networks, a distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. The routing protocols developed for these distributed sensor networks need to be energy efficient and scalable. To create a better understanding of the performance of various routing protocols proposed it is very important to perform a detailed analysis of them. Network simulators enable us to study the performance and behavior of these protocols on various network topologies. Many Sensor Network frameworks were developed to explore both the networking issues and the distributed computing aspects of wireless sensor networks. The current work of simulation study of routing protocols is done on SensorSimulator, a discrete event simulation framework developed at Sensor Networks Research Laboratory, LSU and on a popular event driven network simulator ns2 developed at UC Berkeley. SensorSimulator is a discrete event simulation framework for sensor networks built over OMNeT++ (Objective Modular Network Test-bed in C++). This framework allows the user to debug and test software for distributed sensor networks. SensorSimulator allows developers and researchers in the area of Sensor Networks to investigate topological, phenomenological, networking, robustness and scaling issues, to explore arbitrary algorithms for distributed sensors, and to defeat those algorithms through simulated failure. The framework has modules for all the layers of a Sensor Network Protocol stack. This thesis is focused on the simulation and performance evaluation of various routing protocols on SensorSimulator and ns2. The performance of the simulator is validated with a comparative study of Directed Diffusion Routing Protocol on both ns2 and SensorSimulator. Then the simulations are done to evaluate the performance of Optimized Broadcast Protocols for Sensor Networks, Efficient Coordination Protocol for Wireless Sensor Networks on SensorSimulator. Also a performance study of Random Asynchronous Wakeup protocol for Sensor Networks is done on ns2.

Mobile ad-hoc network is infrastructure less networks having nodes which can act as a transmitter, router or receiver. MANETs have a dynamic topology where nodes are mobile. To monitor the working of the nodes and nature in which they behave while sending, receiving or forwarding data is classified by a set of rules known as routing protocols. Many routing protocols have been designed to fit the needs of Communication in MANET. These protocols have their own advantages and disadvantages depending in which network they are used. This paper will discuss the evaluation of performances of three routing protocols which include Dynamic Source Routing (DSR), Ad Hoc On-demand Distance Vector (AODV) and Destination Sequenced Distance Vector DSDV. The goal of our work is to study the behavior of above mentioned routing protocols with multimedia traffic source in the network based on the following performance metrics: energy consumption, jitter, packet delivery ratio, and packet drop, control overhead, delay. A simulation model using Network Simulator 2 (NS2) is developed to study the scenario and evaluate them.