Showing papers on "Dynamic Source Routing published in 2019"

Segment Routing with the MPLS Data Plane

Abstract: Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS dataplane, the SR header is instantiated through a label stack. This document specifies the forwarding behavior to allow instantiating SR over the MPLS dataplane.

OSPF Extensions for Segment Routing

Abstract: Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the OSPFv3 extensions required for Segment Routing with MPLS data plane.

IS-IS Extensions for Segment Routing

Abstract: Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the necessary IS-IS extensions that need to be introduced for Segment Routing operating on an MPLS data-plane.

An optimization routing protocol for FANETs

Abstract: With the wide-ranging application of mobile ad hoc networks, flying ad hoc networks (FANETs) have received more and more attention from the industry. Routing technology is a key technology of ad hoc networks. The high-speed mobility of nodes poses a greater challenge to FANET routing technology. Based on the Dynamic Source Routing (DSR) protocol, the continuous Hopfield neural network is used to optimize the route to be adapted to the high-speed movement of the FANET node. In a simulation using NS3, the result shows that the optimized DSR protocol has greatly improved key indicators such as end-to-end average delay, throughput, and packet delivery ratio.

A rule based delay constrained energy efficient routing technique for wireless sensor networks

Abstract: In wireless sensor networks (WSN), the nodes are used to collect and gather the data from different environments. Hence, the network consumes more energy which is the main and challenging issue in WSNs. Since the sensor is operating under battery, recharging is impossible and hence the lifetime of each sensor is an important issue. Therefore, it is necessary to introduce new and efficient techniques to extend the network lifetime. In this paper, a new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs. This approach introduces a delay constraint based reliable routing approach which reduces the energy consumption by constructing efficient clusters without increasing the end-to-end delay. Moreover, the proposed technique called the rule based clustering for routing model provides better performance in terms of network lifetime than the other existing techniques since they consume more energy during the formation of clusters and finding the shortest path. Moreover, additional overhead on the cluster head selection is tackled also using rules in this proposed model in an efficient manner by building balanced clusters. The main advantage of the proposed approach is that it extends the lifetime of the network and increases the throughput, energy efficiency, link quality and scalability. The experimental verification of this technique has been carried out using MATLAB simulations and proved that this model increases the packet delivery rate, network performance and reduces the delay and energy consumption.

Active detection in mitigating routing misbehavior for MANETs

Abstract: Mobile ad hoc network (MANET) is vulnerable to security attacks because of the shared radio medium and lack of centralized coordination. Since most multi-hop routing protocols implicitly assume cooperative routing and are not originally designed for security attacks, MANET has been challenged by diverse denial-of-service attacks that often interfere with the protocol and interrupt on-going communication. In this paper, we propose an explore-based active detection scheme, called EBAD, to efficiently mitigate the routing misbehaviors in MANETs running with dynamic source routing. The basic idea is that a source node broadcasts a route request packet with a fictitious destination node to lure potential malicious nodes to reply a fake route reply packet. If the source node receives the fake route reply packet or an intermediate node cannot decrypt the received route reply packet, the routing misbehavior can be detected. We also propose a route expiry timer based approach to reduce the effect of route cache pollution because of the fake route reply. We present a simple analytical model of the EBAD and its numerical result in terms of detection rate. We also conduct extensive simulation experiments using the OMNeT++ for performance evaluation and comparison with the existing schemes, CBDS and 2ACK. The simulation results show that the proposed countermeasure can not only improve the detection rate and packet delivery ratio but also can reduce the energy consumption and detection latency.

A multipath QoS multicast routing protocol based on link stability and route reliability in mobile ad-hoc networks

Abstract: Recently, the use of real-time multimedia applications has attracted the attention of mobile ad hoc network users. These applications support service quality. The characteristics of mobile ad hoc networks such as lack of central coordinator, mobility of hosts, dynamic changes in network topology and the limitation of access to resources have caused remarkable challenges in providing high quality services for mobile ad hoc networks. Bandwidth limitation of wireless nodes and the lack of adequate multicast trees are regarded as the main challenges for quality of service-based multicast routing. In this paper, an attempt was made to propose a more stable and more reliable in multi-path quality of service multicast routing protocol (SR-MQMR) for mobile ad-hoc networks. In the proposed method, considering the requested bandwidth, the researchers first used the signal strength of nodes to select the most stable nodes. Then, using the two parameters of route expiration time and the number of hops, we selected a route which had low delay and high stability. The results of simulations conducted in the present study indicated that the SR-MQMR protocol used less time slots than the MQMR protocol in the routing process which resulted in an increase in success ratio. Furthermore, the production of stable routes led to a significant enhancement of reliability. Since the reduction of route request packet exchange decreased overhead in the proposed method, the degree of consumed bandwidth decreased which led to an increase in network lifetime.

DRADS: depth and reliability aware delay sensitive cooperative routing for underwater wireless sensor networks

Abstract: In this paper, depth and reliability aware delay sensitive (DRADS), interference aware DRADS (iDRADS) and cooperative iDRADS (Co-iDRADS) routing protocols are proposed for maximizing network good-put while minimizing end-to-end delay. We have introduced a new metric called depth threshold to minimize the number of hops between source and destination while ensuring successful packet delivery. Our interference aware and co-operative routing based algorithms select the best relay node at each hop. Extensive simulation results validate that the proposed routing techniques perform better than the selected existing ones in terms of good-put and energy cost of the network.

Mobile Ad-Hoc Network (MANET) Routing Protocols: A Performance Assessment

Abstract: Mobile Ad Hoc network (MANET) is a collection of mobile devices which form a communication network. There are multiple type of routing protocols that de-signed for MANETs. This paper presents an investigation of four MANET protocols’ performance, namely the Ad Hoc On-Demand Distance Vector (AODV), Destination-Sequenced Distance-Vector (DSDV), Dynamic Source Routing (DSR) and Ad Hoc On-Demand Multipath Distance (AOMDV). These protocols are evaluated using three difference performance metrics; average end-to-end, throughput and packet delivery ratio. Simulations of MANET is conducted to analyze the behavior of these protocols with different node mobility and node speed. From the results, it is indicated that different protocols performs better than the other on different performance metrics. For Average end-to-end metric, AODV is shown as the best performer even with the increment of speed. All four protocols meanwhile shows similar performance when node speed are increased for the throughput performance metric. For the final metric, it is shown that AOMDV returns the highest packet delivery ratio.

A novel dynamic reputation-based source routing protocol for mobile ad hoc networks

Abstract: Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets. In order to find the better paths that include nodes willing to cooperate, we propose a new routing algorithm based on the reputation of the nodes. In our proposal, each node locally assigns a reputation value to the rest of the nodes in the network and next it uses the assigned reputation values to find out the better routing paths, in order to minimize the overall packet loss ratio. We assume that nodes have a stationary routing behavior, but we also include a mechanism to detect changes in their behavior. Our approach has been evaluated in the presence of selfish nodes, in order to compare it with the dynamic source routing algorithm, obtaining a reduction in the packet loss ratio at the expenses of a small increase in the number of hops taken by the packets to reach their destinations.

Enhanced mobility aware routing protocol for Low Power and Lossy Networks

Abstract: Due to the technological advancement in Low Power and Lossy Networks (LLNs), sensor node mobility becomes a basic requirement for many extensive applications. Routing protocol designed for LLNs must ensure real-time data transmission with minimum power consumption. However, the existing mobility support protocols cannot work efficiently in LLNs as they are unable to adapt to the change in the network topology quickly. Therefore, we propose an Enhanced Routing Protocol for LLNs (ERPL), which updates the Preferred Parent (PP) of the Mobile Node (MN) quickly whenever the MN moves away from the already selected PP. Further, a new objective function that takes the mobility of the node into an account while selecting a PP is proposed. Performance of the ERPL has been evaluated with the varying system and traffic parameters under different topologies similar to most of the real-life networks. The simulation results showed that the proposed ERPL reduced the power consumption, packet overhead, latency and increased the packet delivery ratio as compared to other existing works.

Comparative study of zigBee topologies for IoT-based lighting automation

Abstract: ZigBee standard is the popular communication protocol for wireless sensor networks (WSN) and Internet of Things (IoT) networks. An energy efficient WSN technology is a good choice for an IoT based lighting control technology. This article is a comparative analysis for finding the quality of service parameters provided by the different topologies of ZigBee for a wireless networked lighting control system. In order to estimate the energy consumption in ZigBee topologies for lighting automation, this work analyses the star, mesh, and tree topology-based WSN with two routing protocols Adhoc on-demand distance vector (AODV) and dynamic source routing (DSR). Lighting automation using wireless control networks with sensor-actuator nodes in a laboratory is considered as the test scenario. The applicability of ZigBee topologies for IoT-based lighting automation is discussed by the evaluation of performance parameters like average jitter, throughput, end-to-end delay, and energy model.

Fault-Tolerant Adaptive Routing in Dragonfly Networks

Abstract: Dragonfly networks have been widely used in the current high-performance computers or high-end servers. Fault-tolerant routing in dragonfly networks is essential. The rich interconnects provide good fault-tolerance ability for the network. A new deadlock-free adaptive fault-tolerant routing algorithm based on a new two-layer safety information model, is proposed by mapping routers in a group, and groups of the dragonfly network into two separate hypercubes. The new fault-tolerant routing algorithm tolerates static and dynamic faults. Our method can determine whether a packet can reach the destination at the source by using the new safety information model, which avoids dead-ends and aimless misrouting. Sufficient simulation results show that the proposed fault-tolerant routing algorithm even outperforms the previous minimal routing algorithm in fault-free networks in many cases.

Trust Based Routing Algorithm to Improve Quality of Service in DSR Protocol

Abstract: Wireless sensor networks involve low power fixed and mobile nodes with limited energy resources. Lack of resources such as energy and bandwidth, could reduce cooperation between nodes that may lead to lower quality of service parameters. Lack of cooperation would result in not forwarding incoming packets by each node to save its remaining energy. Also, due to inherent characteristics of wireless sensor networks, they are vulnerable to be attacked by malicious or selfish nodes. Trust management methods can be used to deal with such problems by designing a routing protocol that is based on trust and can improve quality of service parameters. In this paper, we utilize a trust management system and provide a method to reduce energy consumption and improve quality of service parameters. We improved packet delivery ratio and the amount of remaining energy in Dynamic Source Routing protocol, while maintaining the end to end delay.

Energy Efficient Node Rank-Based Routing Algorithm in Mobile Ad-Hoc Networks

Abstract: Mobile Ad-hoc Network (MANET) is an emerging technology, infrastructure less with self-organizing, selfhealing, multi-hop wireless routing networks in real time. In such networks, many routing problems arise due to complexity in the network mobility which results from difficulty in achieving energy efficient routing in the field of MANET. Due to the dynamic nature and the limited battery energy of the mobile nodes, the communication links between intermediate relay nodes may fail frequently, thus affecting the routing performance of the network and also the availability of the nodes. Though existing protocols are not concentrating about communication links and battery energy, node links are very important factor for improving quality of routing protocols because Node Rank helps us to determine whether the node is within transmission range or out of transmission range through considering residual energy of the node during the routing process. This paper proposes a novel Energy Efficient Node Rank-based Routing (EENRR algorithm which includes certain performance metrics such as control overhead and residual energy in order to improve the Packet Delivery Ratio (PDR), and Network Life Time (NLT) from its originally observed routing performance obtained through other existing protocols. Simulation results show that, when the number of nodes increases from 10 to 100 nodes, EENRR algorithm increases the average residual energy by 31.08% and 21.26% over the existing Dynamic Source Routing (DSR) and Energy Efficient Delay Time Routing (EEDTR) protocols, respectively. Similarly it increases the PDR by 45.38% and 28.3% over the existing DSR and EEDTR protocols respectively.

An efficient city energy management system with secure routing communication using WSN

Abstract: The major goal of this work is to reduce the economic consumption of power in the electricity as well as reduce the cost even in the high peak time usage of electricity. Another aspect is to maintain the information secure during the transmission between the producer and consumer. Here, need to maintain the balance on the efficient demand by reducing the cost of the electrical power. This proposed approach is developed to minimize the energy consumption, maintain the load in the peak hours and reduce the cost based on the TOU tariff. This helps to enhance the OREM scheme. Simulation results have performed using iHEM technology with the local energy presence. Another important aspect of the proposed approach helps to detect the intrusions. With the help of a modified dynamic source routing with adaptive local routing protocol routing (MDSR-ALR) protocol, misrouting paths are identified in wireless sensor network. These misrouting paths will generate a higher drop rate and that can be detected and reduced by the proposed application. This proposed WSN-based city energy management applications approach uses MDSR-ALR protocol which deals with the collection of information about neighbors, shortest path, and normal path and then guard time. Finally, this proposed protocol concentrates on secure routing as well as reduce the energy consumption and cost and then maintain the load.

An Improvement in DSR Routing Protocol of MANETs Using ANFIS

Abstract: In mobile ad hoc networks(MANET’s), dynamically changing topology, constraints over energy, breakage of links and providing security to network results in the generation of multiple routes from source to destination. One of the well-known reactive routing protocol of MANET is named as Dynamic Source Routing (DSR) which stored the value of previously determined path to be used in route cache of intermediate nodes. Therefore, while selection from multiple routes this cache information is used to determine new route. Since the amount of cache is limited, therefore it is impossible to store all the information over cache. One of the solutions to this problem is to have cache information not only on the basis of hop count as done by DSR. Hence in the proposed algorithm, the output parameter “Anfis cost (Anf)” is computed on the basis of input parameters “hop count”, “energy”, and “delay” to select the optimal route in cache. The proposed routing algorithm uses adaptive fuzzy inference system (ANFIS) to improve the performance of DSR protocol hence named as A-DSR. The simulation results proved that the proposed A-DSR protocol have substantial high value of packet delivery ratio compared to state-of-art soft computing-based protocol and the conventional DSR.

Optimized dynamic source routing protocol for MANETs

Abstract: Mobile ad-hoc networks (MANETs) are wireless networks comprising of small, battery powered mobile devices/nodes. All these nodes communicate cooperatively without fixed infrastructure and able to operate alone or in coordination with wired infrastructure by using gateway nodes. In this work, the performance of optimized dynamic source routing protocol (DSR) is investigated for MANETs. To find the optimal paths between the communicating nodes, traditional DSR algorithm is modified by using the Fire fly algorithm. In recent times a population based method named as Firefly algorithm is stimulated by the surveillance of real firefly and its brightness behaviour. So firefly algorithm is used for the proposed method on MANET which improves the DSR routing performance with well-organized packets transfer from the source to destination node. Optimal route is found based on link quality, node mobility and end to end delay. Simulations are conducted with 25 nodes and the performance of the traditional DSR, link quality based DSR for selecting a route and proposed firefly algorithm for optimal route finding are compared by the parameters such as throughput, end to end delay, number of retransmitted packets and the number of hops to the destination.

Load balancing routing with queue overflow prediction for WSNs

Abstract: The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

Particle Swarm Based Resource Optimized Geographic Routing for Improved Network Lifetime in MANET

Abstract: In a Mobile ad hoc network (MANET), scalability, dynamic topology and high mobility are the most significant challenges to perform the routing with improved network lifetime. According to the geographical location, geographic routing termed as position-based routing performs data transmission between source node and destination node in a MANET. But, geographic routing protocols were not able achieve effective routing with enhanced network lifetime by improving the resource optimization and optimal coverage performance. In order to improve the resource optimization and network lifetime, an efficient Particle Swarm based Resource Optimized Geographic Routing (PS-ROGR) technique is introduced in MANET. Initially, each particle (i.e. mobile node) movement in a network is controlled by its local best known position in the search space (i.e. geographic location). The PSO permits all the particles in the network to communicate with the other particles with minimum energy. The particle which has the better global best function is selected for energy efficient routing based on the fitness value. Therefore the entire particles share the similar best position to optimize the network resources. Thereby, the PS-ROGR technique prolong the lifetime of the network with minimum energy utilization. Simulation is carried out on the factors such as packet delivery ratio, average end to end delay, energy consumption and network lifetime. Thus, the proposed PS-ROGR technique improves the network lifetime by 22% and reduces the average end to end delay by 46%. Then, the packet delivery ratio is enhanced up to 11% and energy consumption is minimized to 16% with the help of proposed PS-ROGR technique.

An efficient approach to circumvent black hole nodes in manets

Abstract: MANETs are self-configured network. Nodes in Manets need not follow a specific infrastructure. Nodes are connected wirelessly and so nodes can travel to any direction. Manets assure that all its nodes are cooperating with each other. Sometimes, some nodes may not be reliable. These unreliable intermediate nodes participate in the packet forwarding and drop the packets instead of forwarding them to the destination node. This type of security attack is called black hole attack (Baadache and Belmehdi in Int Comput Sci Inf Sec 7(1):1–10, 2010). In this paper, an efficient method of route discovery process is used which bypasses the black hole nodes and uses only the reliable route for transmission. The main advantage of using the proposed method is that there is no need to maintain black hole list. So, there is no need to check the black hole list each time during route discovery. Dynamic source routing (DSR) is used for the transmission of packets. The simulations are done to measure packet delivery ratio, packet drop, average throughput, normalized routing overhead and average end-to-end delay. Simulation results shows that the proposed method improves the packet delivery ratio in presence of black hole and reduces the packet drop. Also the communication overhead is reduced which in turn minimizes the resource utilization in Manets.

NS2 based performance comparison study between DSR and AODV protocols

Abstract: Mobile AD-HOC Network (MANETs) are useful when no traditional communication infrastructure exists, and have applications in military and other fields; MANET is a set of nodes capable of communicating with each other irrespective of infrastructure or centralized management. The mobility of system nodes leads them to be arranged and designed automatically. In addition, wireless networks have received extensive attention in the fields of communication systems owing to their prospective applications in different fields such as military, industrial and private area networks. Moreover, wireless networks are easy to install, inexpensive, reliable, and do not need a fixed infrastructure, unlike the wired networks. In the MANETs, routing protocols play an essential role to discover the ways between the source and the destination. Generally, an appointed routing protocol system aims to address the difficulties of the progressively evolving topologies. It is possible to divide MANET routing protocols into three kinds: proactive, receptive and hybrid. In this report, routing protocol topology such as queue size and a number of nodes was altered and the efficiency metrics of two reactive routing protocols such as Ad hoc On-Demand Distance Vector AODV and Dynamic Source Routing DSR were contrasted in terms of average end-to-end delay, average throughput and packet delivery ratio.

Evaluating DTN Routing Schemes for Application in Vehicular Networks

Abstract: Vehicle-to-vehicle networks have gained significant interest in recent times from researchers all around the world. V2V/V2I are emerging as an efficient solution for achieving road safety and securely transmitting data from one vehicle to other. However, in such opportunistic environments such as a sparse vehicular network where disruption, dynamic network topology, fast vehicle movement, and environmental conditions are the major concerns, data forwarding is extremely challenging. Traditional ad-hoc routing protocols like Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) fail to deliver in such laborious conditions. Routing protocols of Delay/Disruption Tolerant Networks(DTN) exploit the Store-Carry-Forward Mechanism (SCF) strategy in these cases. Taking advantage of temporary connections to disseminate information is the focus of DTN. DTN helps to increase information propagation coverage in sparse areas where there are very few devices. In this paper, we first compare the performance of AllJoyn framework and Direct Delivery protocol in a single-hop scenario and then draw the attention towards a multi-hop scenario by comparing other three routing protocols that use DTN as the underlying paradigm. These protocols are Flooding, Epidemic, and PRoPHET. The performances are evaluated by transmitting the files of size 1, 4, and 10 MB from a static sender to a mobile receiver in the multi-hop scenario. We also develop an Android application that contains the implementation of these routing protocols along with file sharing functionality. From the outcomes of this experiment, it can be said that Epidemic routing protocol performs the best in our considered multi-hop scenario in terms of transfer delay, coverage, and throughput whereas, Direct Delivery routing protocol performs better than AllJoyn in single-hop communication.

Formal modeling and analysis of ad hoc Zone Routing Protocol in Event-B

Abstract: Ad hoc routing protocols are responsible for searching a route from the source to the destination under the dynamic network topology. Hybrid routing protocols combine the features of proactive and reactive approaches. So, the formal specification of a hybrid routing protocol in the dynamic network environment is a challenge. In this paper, we formally analyze the Zone Routing Protocol (ZRP), a hybrid routing framework, using Event-B. We develop the formal specification by the refinement mechanism. It allows us to gradually model the network environment, the construction of routing zones, route discovery based on bordercasting service and routing update. We prove the stabilization property in the inactive environment. In addition, we demonstrate that discovered routes hold the loop freedom and validity in each reachable system state. To present that the formalization is consistent with the informally expressed requirements, we adopt an animator, ProB, to validate our model. Our work provides reference to analyze extensions of the ZRP and other hybrid routing protocols.

Asymmetric AODV-P2P-RPL in Low-Power and Lossy Networks (LLNs)

Abstract: Route discovery for symmetric and asymmetric Point-to-Point (P2P) traffic flows is a desirable feature in Low power and Lossy Networks (LLNs). For that purpose, this document specifies a reactive P2P route discovery mechanism for both hop-by-hop routing and source routing: Ad Hoc On-demand Distance Vector Routing (AODV) based RPL protocol. Paired Instances are used to construct directional paths, in case some of the links between source and target node are asymmetric.

A Detailed Study on Internet Connectivity Schemes for Mobile ad Hoc Network

Abstract: Integration of Mobile ad hoc network (MANET) with the fixed Internet has paid immense attention in the field of heterogeneous networks. Such integration has many advantages and offer many usage scenarios for both MANET and the Internet. The MANET routing protocol ad hoc on-demand distance vector and dynamic source routing provide communication within the MANET. However, MANET router which desires communication with the Internet require global connectivity. This paper presents a survey of most significant proposals for MANET-Internet connectivity by describing their characteristics, evaluation metrics, quality parameters and approaches referred. The study of various gateway discovery and gateway selection schemes have been presented based on routing metrics, load balancing, adaptive technique, fuzzy system, address configuration and ant colony optimization approaches. Summary of significant contributions of existing schemes and issues found in literature for MANET-Internet connectivity have been presented. The survey concludes with additional investigation for future research work.

BGP-LS extensions for Segment Routing BGP Egress Peer Engineering

Abstract: Segment Routing (SR) leverages source routing A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header A segment can represent any instruction, topological or service-based SR segments allow steering a flow through any topological path and service chain while maintaining per-flow state only at the ingress node of the SR domain This document describes an extension to BGP Link-State (BGP-LS) for advertisement of BGP Peering Segments along with their BGP peering node information so that efficient BGP Egress Peer Engineering (EPE) policies and strategies can be computed based on Segment Routing

Performance Evaluation of Routing Protocols in Synchrophasor Communication Networks

Abstract: The modern power system is rapidly growing in terms of its generation, transmission and distribution capabilities, resulting in the realization of smart grid. The most fundamental component of smart grid is the phasor measurement unit (PMU), which monitors the health of the smart grid in real-time and communicates these health metrics to the phasor data concentrator (PDC) which can be viewed as control center for processing. The PMU data contains time synchronized voltage and current phasors, which are referred to as synchrophasor data and which indicates the real-time heath of the grid. The synchrophasor data is communicated to remotely located PDC using synchrophasor communication system (SPCS) for analyzing and further processing to detect anomalies in the smart grid. The synchrophasor data should be communicated to the PDC effectively in real-time with minimum delay and maximum reliability. This paper explores the effect of various network layer routing protocols on the SPCS such as Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (AODV) protocols. The SPCS is designed and implemented using the QualNet5.2 network simulator and the performance is evaluated through the packet delivery ratio (PDR) and average end-to-end delay (ETD).