JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.

ORG

61

Simulation Analysis of DSR and TORA: On Demand Wireless Adhoc Routing Protocols
Dr. Rahul Malhotra, Gurpreet Singh
AbstractCommunication has become a lifeline of the fastest moving world. The technology has spread its wings to reduce the need of complex cabling techniques to the emergence of wireless technology. This change has led to the need of secure and reliable communication medium without use of wired infrastructure and emergence of wireless ad-hoc networks. Wireless adhoc networks are a collection of mobile and semi-mobile nodes without an existing infrastructure, forming a temporary network. All the nodes in the network use a wireless Interface and communicate with each other through radio frequency or infrared. An ad-hoc network is a local area network built spontaneously when the devices connect. Dynamic Source Routing protocol is a self-organizing and self-configuring routing protocol and works on the principle of Route Discovery and Route Maintenance. Temporally Ordered Routing Algorithm is a distributed routing algorithm based on the concept of link reversal. TORA is implemented where nodes are continuously moving from one place to another. This paper focuses to compare the performances of on-demand routing protocols, DSR and TORA for wireless adhoc networks. The implementation of a network using network simulator OPNET has been done for 50 network nodes and the performance of these two network protocols for traffic sent and received, end to end delay during data communication and download and upload response time have been analyzed. The Dynamic source routing protocol is able to forward 95% of the traffic received. On the other hand, Temporally Ordered Routing Algorithm protocol forwards only 39% of the traffic received. The results from the simulation show that dynamic source routing protocol has given comparatively better performance than Temporally Ordered Routing Algorithm protocol. Index TermsAdhoc networks, DSR, TORA, wireless networks, routing, OPNET Simulator.

1 INTRODUCTION
ireless Networks provides a global opportunity for archival value contributions documenting these fast growing areas of interest. It enables people to communicate and access applications and information without wires. This provides freedom of movement and the ability to extend applications to different parts of a building, city, or nearly anywhere in the world Wireless networks utilize radio waves and/or microwaves to maintain communication channels between computers. The use of pulsing lights carrying information through Morse code between ships has been and still is an important form of communications. Cell phones are also a type of wireless communication and are popular today for people talking to each other worldwide. An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. Ad Hoc network is a self-organizing and selfmaintenance multi-hop wireless network, which relies neither on fixed infrastructure nor on predetermined connectivity, due to self-configuration and selfmaintenance capabilities, Mobile adhoc networks have become very popular in recent years. High node mobility, low bandwidth, reconfigurable and lack of centralized entity are the main characteristics of ad hoc networks.
Rahul Malhotra is with the Department of Electronics and CommunicationEngineering, Bhai Maha Singh College of Engineering, Muktsar, Punjab,India Gurpreet Singh is with the Department of Electronics and CommunicationEngineering, Bhai Maha Singh College of Engineering, Muktsar, Punjab,India.

Generally, routing protocols are classified into two main categories: Table-driven routing protocols and source initiated on-demand driven routing protocols. The table driven routing protocols maintain consistent and up-to-date routing information from each node to the rest of the nodes in the network in one or more routing tables regardless of the need of such routes. The source initiated on-demand routing protocols are developed and employed in mobile ad-hoc networks and initiates routing activities only when needed. In another classification these protocols generally fall into one of two categories: proactive or reactive. Proactive routing attempts to maintain optimal routes to all destinations at all times, regardless of whether they are needed. To support this, the routing protocol propagates information updates about a networks topology throughout the network. In contrast, reactive or on-demand routing protocols determine routes to given destinations only when there is data to send to those destinations. If a route is unknown, the source node initiates a search to find one. Proactive routing protocols have the advantage of having short routes available at all times, thereby avoiding the delay of searching for a route on demand. Reactive routing protocols have the advantage of only generating routing overhead to find routes when routes are needed, independent of network topology changes.

2 DYNAMIC SOURCE ROUTING PROTOCOL

The Dynamic Source Routing protocol is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

62

There is no need of any existing network infrastructure or administration in Dynamic Source Routing protocol. Dynamic Source Routing protocol has been implemented by numerous groups, and deployed on several test beds. Networks using the Dynamic Source Routing protocol protocol have been connected to the Internet. Dynamic Source Routing protocol can interoperate with Mobile IP, and nodes using Mobile IP and Dynamic Source Routing protocol have seamlessly migrated between WLANs, cellular data services, and Dynamic Source Routing protocol mobile ad hoc networks This protocol is composed of two main methods to allow the discovery and maintenance of source routes, which work together to allow nodes to discover and maintain routes to arbitrary destinations in the ad hoc network To find a route to its destination, a source broadcasts a route request packet to all nodes within its radio transmission range. In addition to the addresses of the source and the destination nodes, a route request packet contains a route record, which is an accumulated record of nodes visited by the route request packet. When a node receives a route request, if the destination address of the request matches its own address, then it is the destination. The route record in the packet contains the route by which the request reached this node from the source. This route is sent back to the source in a route reply packet by following the same route in reverse order. Otherwise, it is an intermediate node. If the node has not seen this request before and has a route to the destination in its cache table, it creates a route reply packet with the route from its cache, and sends it back to the source. Such replies are called Intermediate-Node replies; if it does not have a route, it appends its own address to the route record, and increments hop count by one, and rebroadcast the request. When the source receives a route reply, it adds this route to its cache and sends any pending data packets. If any link on a source route is broken, a route error packet is generated. The route error is unicasted back to the source using the part of the route traversed so far, erasing all entries that contain the broken link in the route caches along the way.

ble routing overhead is involved due to the sourcerouting mechanism employed in Dynamic Source Routing protocol. This routing overhead is directly proportional to the path length.

3 TEMPORALLY ORDERED ROUTING ALGORITHM (TORA)

Temporally Ordered Routing Algorithm is an adaptive and efficient routing algorithm primarily designed for Mobile Ad Hoc Networks. It comes under the category of on-demand MANET routing protocol, with sourceinitiated feature. Temporally Ordered Routing Algorithm is fully distributed, in that routers need only maintain information about adjacent routers i.e. one hop knowledge and there is no centralized control. This is essential for all Ad Hoc routing protocols. Temporally Ordered Routing Algorithm would be able to patch itself up around the point of failure. This feature allows Temporally Ordered Routing Algorithm to scale up to larger networks but has higher overhead for smaller networks. Like a distance-vector routing approach, Temporally Ordered Routing Algorithm maintains state on a per-destination basis. However, it does not continuously execute shortestpath computation and thus the metric used to establish the routing structure does not represent a distance Temporally Ordered Routing Algorithm has basically three phases i.e. route creation, route maintenance and route erasure. Initially, all nodes are disconnected in route creation because routes are created mostly in reactive mode, then Directed Acyclic Graph is formed by the routing protocol. The criterion of adding node is based on a metric called height. The node j is added with the node i, which is already member of the DAG if hi > hj. The metric height consists of five arguments all of which define the height of the node. A QRY packet is send by the source node to indicating the destination node. The QRY packet propagates until it reaches a node whose neighbor is the specified destination which then transmits a update packet. All is done locally. i.e. the nodes know only their neighbors and not all members of the network. The route is maintained only for nodes with non-null height during the route maintenance. All of its links are reversed based on link reversal algorithm suppose if a node is not connected to any node with height smaller than its own. Route is erased on the reception of CLR packet from a source in route erasure phase. A node, on receiving CLR packet, sets its own height and heights of all its neighbors to NULL and broadcasts CLR packet. This way, route erasure is performed.

2.1 Advantages and Disadvantages This This protocol uses a reactive approach which eliminates the need to periodically flood the network with table update messages which are required in a table-driven approach. In a reactive (on-demand) approach such as this, a route is established only when it is required and hence the need to find routes to all other nodes in the network as required by the table-driven approach is eliminated. The intermediate nodes also utilize the route cache information efficiently to reduce the control overhead. The disadvantage of this protocol is that the route maintenance mechanism does not locally repair a broken link. Stale route cache information could also result in inconsistencies during the route reconstruction phase. The connection setup delay is higher than in table-driven protocols. Even though the protocol performs well in static and low-mobility environments, the performance degrades rapidly with increasing mobility. Also, considera-

4 PROBLEM FORMULATION
The two on-demand routing protocols dynamic source routing and temporally ordered routing algorithm protocols have been compared for their performance for different network parameters. The two network scenarios have been designed with 50 wireless network nodes and a network server having same network configurations ex-

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

63

cept the routing protocols for both the network scenarios. The following are the common configurations for both the networks as shown in Table 1 to 8. The network for DSR and Temporally Ordered Routing Algorithm routing protocols is shown in figure 1 and 2 respectively. TABLE 1 APPLICATION SUPPORT PROFILES Profile Name Traffic Type FTP All Discrete

TABLE 6 CPU RESOURCE PARAMETERS Number of Resources Task Contention Mode Processing Speed Multiplier 1 Contention Already Modeled 1.0

TABLE 7 CONFIGURATION PARAMETERS FOR WLAN_SERVER_ADV NODE_0 OF THE NETWORK name model Application: Segment Size Wireless LAN MAC Address Wireless LAN Parameters node_0 wlan_server_adv 64,000 Auto Assigned (...)

TABLE 2 APPLICATION DESCRIPTION FOR FTP Command Mix Inter-Request Time File Size Symbolic Server Name Type of Service 50% constant (20) constant 1000) FTP Server Best Effort (0)

TABLE 3 PROFILE CONFIGURATION FOR NODES Profile Name Applications Operation Mode Start Time Duration Repeatability FTP (...) Serial (Ordered) uniform (100, 3400) End of Simulation Once at Start Time

TABLE 8 W IRELESS LAN PARAMETERS FOR WLAN_SERVER_ADV NODE_0 OF THE NETWORK BSS Identifier Access Point Functionality Physical Characteristics Data Rate Channel Settings Transmit Power Packet Reception-Power Threshold Rts Threshold Fragmentation Threshold CTS-to-self Option Short Retry Limit Long Retry Limit AP Beacon Interval Max Receive Lifetime Buffer Size Roaming Capability Large Packet Processing PCF Parameters HCF Parameters Auto Assigned Disabled Direct Sequence 1 Mbps Auto Assigned 0.005 -95 None None Enabled 7 4 0.02 0.5 256000 Disabled Drop Disabled Not Supported

TABLE 4 PROFILE CONFIGURATION APPLICATIONS REPEATABILITY Inter-repetition Time Number of Repetitions Repetition Pattern uniform (10, 20) constant (3) Serial

TABLE 5 RECEIVER GROUP CONFIGURATION name model Affected Transmitter Set Begin Time (seconds) Channel Match Criteria Distance Threshold (meters) End Time (seconds) Initial Receiver Set Pathloss Threshold (dB) Refresh (seconds) Interval

Rx Group Config receiver_group_config All Transmistters Start of Simulation Strict Match 1,500 End of Simulation Calculated by Specified Rx group None
Never Distance and Pathloss Match

TABLE 9 CONFIGURATION PARAMETERS FOR WLAN_ WKSTN _ADV STATION_1 TO STATION _50 OF THE NETWORK name model eApplication: Segment Size Wireless LAN MAC Address Wireless LAN Parameters station_1 wlan_wkstn_adv 64,000 Auto Assigned (...)

Selection Criteria

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

64

TABLE 10 W IRELESS LAN PARAMETERS FOR WLAN_ WKSTN _ADV, STATION_1 TO STATION _50 OF THE NETWORK BSS Identifier Access Point Functionality Physical Characteristics Data Rate Channel Settings Transmit Power Packet Reception-Power Threshold Rts Threshold Fragmentation Threshold CTS-to-self Option Short Retry Limit Long Retry Limit AP Beacon Interval Max Receive Lifetime Buffer Size Roaming Capability Large Packet Processing PCF Parameters HCF Parameters Auto Assigned Disabled Direct Sequence 1 Mbps Auto Assigned 0.005 -95 None None Enabled 7 4 0.02 0.5 256000 Disabled Drop Disabled Not Supported

The network in figure 2 shows a 50 node Temporally ordered routing algorithm protocol network. All nodes in the network are configured to run TORA and multiple FTP sessions. The Receiver Group Configuration node is added to speed up the simulation. It is configured to eliminate all receivers that are over 1500 meters away.

5 RESULTS AND DISCUSSIONS

The two routing protocols Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm have been compared while keeping all other network parameters same but the different routing protocols. The different network parameters compared are tabulated in this section. Simulation results for FTP download response time for Dynamic Source Routing protocol and Temporally TABLE 11 TIME AVERAGE OF FTP DOWNLOAD RESPONSE TIME Attribute Initial value Final value Sample mean Variance Standard deviation ROUTING PROTOCOL DSR TORA undefined undefined 350.21ms 318.13ms 496.74ms 312.88ms 34.00ms 2.24ms 18.44ms 47.36ms

The network in figure 1 shows a 50 node Dynamic source routing protocol Dynamic Source Routing protocol network. All nodes in the network are configured to run Dynamic Source Routing protocol and multiple FTP sessions. The Receiver Group Configuration node is added to speed up the simulation. It is configured to eliminate all receivers that are over 1500 meters away.

Figure 1. Network Layout 1 for Dynamic source routing protocol

Ordered Routing Algorithm routing protocols have been compared in the figure 3. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value attribute for simulation results gives undefined value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e. last output value of the simulation for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm are 350.21 and 318.13 respectively with a mean value of 496.74 and 312.88 respectively, Variance of 34 and 2.24, with a standard deviation of 18.44 and 47.36 respectively. The values are calculated using time average filter for the FTP download response time of the Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols.

Figure 2. Network Layout 1 for Temporally ordered routing algorithm protocol

Figure 3. Comparison of time average of ftp download response time for DSR and TORA

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

65

TABLE 12 TIME AVERAGE OF FTP UPLOAD RESPONSE TIME Attribute Initial value Final value Sample mean Variance Standard deviation ROUTING PROTOCOL DSR TORA undefined Undefined 177.16ms 254.80ms 215.69ms 282.39ms 1.93ms 29.72ms 44.04ms 17.24ms

Simulation results for FTP upload response time for Dynamic Source Routing protocol and TORA routing protocols have been compared in the figure 4. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s for simulation results gives undefined value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for DSR and TORA are 177.16 and 254.80 respectively with a mean value of 215.69 and 282.39 respectively, Variance of 1.93and 29.72, with a standard deviation 44.04 and 17.24 respectively. The values are calculated using time average filter for the FTP download response time of the Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols.

Simulation results for Wireless LAN Delay time for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols have been compared in the figure 5. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s for simulation results gives undefined for dynamic source routing protocol and 0.00683 foe temporally ordered routing algorithm value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm are 5.51 and 4.96 respectively with a mean value of 5.36 and 4.99 respectively, Variance of 6047.7 and 0.029, with a standard deviation 0.245 and 0.244 respectively. The values are calculated using time average filter for the FTP download response time of the Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols.

Figure 5. Comparison of time average of Wireless LAN Delay for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm

TABLE 14 TIME AVERAGE OF W IRELESS LAN THROUGHPUT IN SECONDS Attribute Initial value Final value Sample mean Variance Standard deviation ROUTING PROTOCOL DSR TORA 0.0 5,288.8 4,297.6 7,201.0 3,470.732 6,346.9 2,148,232.2 1,704,403.8 1,465.6 1,305.5

Figure 4. Comparison of time average of ftp upload response time for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm

TABLE 13 TIME AVERAGE OF W IRELESS LAN DELAY IN SECONDS Attribute Initial value Final value Sample mean Variance Standard deviation ROUTING PROTOCOL DSR undefined 0.0055 0.0053 6.047 0.000245 TORA 0.00683 0.0049 0.0049 6.000 0.000244

Simulation results for Wireless LAN Throughput time for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols have been compared in the figure 6. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s for simulation results gives 0.0 for dynamic source routing protocol and 5288.8 for temporally ordered routing algorithm, value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm are 4,297.6 and 7,201.0 respectively with a mean value of 3,470.7 and 6,346.9 respectively, Variance of 2,148,232.2 and 1,704,403.8 with a

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

66

standard deviation 1,465.6 and 1,305.5 respectively.

TABLE 16 OFFICE NETWORK.NODE_0.SERVER FTP.TRAFFIC SENT (PACKETS/SEC) Attribute Initial value Final value Sample mean Variance Standard deviation DSR 0.0 0.054 0.04269 0.0003252 0.018034 TORA 0.0 0.054 0.04268 0.0003253 0.018038

Figure 6. Comparison of time average of Wireless LAN Throughput for DSR and TORA protocol

TABLE 15 W IRELESS LAN LOAD IN BITS/SECOND Attribute Initial value Final value Sample mean Variance Standard deviation ROUTING PROTOCOLS DSR TORA 0.0 3,600 4,240.1 5,900.2 3,416.22 5,079.41 2,099,692.91 1,449.03 1,500,135.05 1,224.80

Simulation results for FTP traffic sent time for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols have been compared in the figure 8. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s for simulation results gives 0.0 value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm are 0.054 and 0.054 respectively with a mean value of 0.4269 and 0.4268 respectively, Variance of 0.0003252and 0.0003253, with a standard deviation 0.018034 and 0.018038 respectively.

Simulation results for wireless LAN Load in bits/sec for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols have been compared in the figure 7. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s for simulation results gives 0.0 for dynamic source routing protocol and 3600 for temporally ordered routing algorithm, value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm are 4,240.1 and 5900.2 respectively with a mean value of 3416.2 and 5079.4 respectively, Variance of 2,099,692.9 and 1,500,135.05 with a standard deviation 1,449.0 and 1,224.8 respectively.

Figure8. Office Network.node_0.Server Ftp.Traffic Sent (packets/sec)

TABLE 17 OFFICE NETWORK.NODE_0.SERVER FTP.TRAFFIC RECEIVED Attribute Initial value Final value Sample mean Variance Standard deviation DSR 0.0 0.054 0.04269 0.0003252 0.018034 TORA 0.0 0.054 0.04268 0.0003253 0.018038

Figure 7. Comparison of time average of Wireless LAN Throughput for DSR and TORA protocol

Simulation results for FTP traffic sent time for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm routing protocols have been compared in the figure 8. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

67

for simulation results gives 0.0 value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm are 0.054 and 0.054 respectively with a mean value of 0.4269 and 0.4268 respectively, Variance of 0.0003252and 0.0003253, with a standard deviation 0.018034 and 0.018038 respectively.

Figure 10: Traffic sent and Received for TORA in packets/sec

TABLE 19 DSR TOTAL TRAFFIC SENT ANDRECEIVED PACKETS/SEC Attribute Figure 9: Office Network.node_0.Server Ftp.Traffic Received TABLE 18 Initial value Final value Sample mean Variance Standard deviation ROUTING PROTOCOL DSR DSR Traffic sent Traffic Received 0.0 0.0 0.0 0.0 3.193 3.340 56.94 65.36 7.54 8.08

TRAFFIC SENT AND RECEIVED IN PACKETS/SEC

Attaribute Initial value Final value Sample mean Variance Standard tion deviaROUTING PROTOCOL TORA TORA Traffic sent 0.0 0.0 0.0 0.0 1.96 5.00 64.005 415.43 8.00 20.38

Simulation results for control traffic sent and received for Temporally Ordered Routing Algorithm routing protocols have been compared in the figure 10. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s for simulation results gives 0.0 for both traffic sent and for traffic received value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for control traffic sent and received for temporally ordered routing algorithm are 0.0 and 0.0 respectively with a mean value of 1.96 and 5.00 respectively, variance of 64.005 and 415.43, with a standard deviation 8.00 and 20.38 respectively. This above results show that almost 39% of the total traffic received is forwarded by this routing protocol.

Simulation results for total traffic sent and received for Dynamic Source Routing protocol routing protocols have been compared in the figure 11. The simulations were carried out for the time period of one hour with Number of Values, i.e. seed equal to 1000. The initial value at time =0s for simulation results gives undefined value as there is an interval of few seconds for the network nodes to start communication. The final value, i.e., at time 3600s of the simulation for Dynamic Source Routing protocol and TORA are 0.0 with a mean value of 3.193 and 3.340 respectively, Variance of 56.94 and 65.36, with a standard deviation 7.54 and 8.08 respectively. This above results shows that almost 94% of the total traffic received is forwarded by this routing protocol.

Figure 11: DSR Total Traffic Sent/received in packets/sec

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

68

6 CONCLUSIONS
The two on-demand routing protocols Dynamic Source Routing protocol and Temporally Ordered Routing Algorithm have been compared in this paper for their performance by calculating the ftp download and upload response time, wireless LAN end-to-end delay, Load and Throughput. Traffic sent and traffic received for both the protocols have been also compared. ftp download response time shows the better performance of Temporally Ordered Routing Algorithm as compared to Dynamic Source Routing protocol but Dynamic Source Routing protocol gives the better results for ftp upload response time. The value of throughput shows that Dynamic Source Routing protocol performs better than Temporally Ordered Routing Algorithm. While comparing end-to-end delay, it is found that Dynamic Source Routing protocol performs better at start but its delay starts on increasing with the increase in simulation time. The comparative results for traffic sent and traffic received also show the better performance of Dynamic Source Routing protocol as compared with Temporally Ordered Routing Algorithm. Summarizing the above results, it is evident that Dynamic Source Routing protocol performs better than Temporally Ordered Routing Algorithm for the given network structure and size. However, the performance of these protocols may vary depending on the network design. The performance of both protocols degrades with the increase in the number of nodes.

REFERENCES
[1] H. Zhou, S. Singh, (1998), Content based multicast (CBM) in ad hoc networks, Journal on Routing in Mobile Communication Networks, vol. 1, no. 2, pp. 246-257 J. Liu, S. Singh, (2001), ATCP: TCP for Mobile Ad Hoc Networks, IEEE Journal on selected in communication, vol. 19, no. 7, pp. 1506-1531 S. Lee, C. Kim, (2002), A new wireless ad hoc multicast routing protocol, Journal of Computer Networks and Isdn Systems on Computer Networks vol. 38, no. 2, pp. 121-135 E. M. Belding-Royer, C. E. Perkins,(2003), Evolution and future directions of the ad hoc on-demand distance-vector routing protocol, Journal of Ad Hoc Networks, vol. 1, no. 1, pp.125 150 G. Zussman., S. Adrian, (2003), Energy efficient routing in ad hoc disaster recovery networks, Journal of Ad Hoc Networks, vol. 1, no. 4, pp. 405-421 P. Papadimitratos, J. Zygmunt, (2003), Secure message transmission in mobile ad hoc networks, Journal on Ad Hoc Networks , vol. 1, no. 1, pp. 193-209 Y. Hu, D. B. Johnson, A. Perrig, (2003) , SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks, Journal of Ad Hoc Networks , vol. 1, no. 1, pp. 175-192 M. Abolhasan, T. Wysocki, E. Dutkiewicz, (2004), A review of routing protocols for mobile ad hoc networks, Journal of Ad Hoc Networks, vol. 2, no. 1, pp. 122. P. P. Pham, S. Perreau, (2004), Increasing the network performance using multi-path routing mechanism with load balance, Journal of Ad Hoc Networks, vol. 2, no. 4, pp. 433459

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10] X. WANG, Y. Xiao-hu, (2008), An effective connected dominating set based mobility management algorithm in MANETs, Journal of Zhejiang University Science , vol. 10, no. 10, pp. 13181325 [11] K. Matrouk , B. Landfeldt, (2009), RETT-gen: A globally efficient routing protocol for wireless sensor networks by equalising sensor energy and avoiding energy holes, Journal of Ad Hoc Networks vol.7, no. 3, pp.514536. [12] L. DING, Z. Wen-jun, W. Xin-bing, Q. Liang, (2009), Adaptive fractional window increment of TCP in multihop ad hoc networks, Journal of Zhejiang University Science , vol. 10, no. 6, pp. 820-827 [13] E. Stavrou, A. Pitsillides, (2010), A survey on secure multipath routing protocols in WSNs, Journal of Computer Networks and Isdn Systems on computer networks, vol. 54, no. 13, pp. 2215-2238. [14] F. Bajaber , I. Awan, (2010), Energy efficient clustering protocol to enhance lifetime of wireless sensor network, Journal of Ambient Intelligence and Humanized Computing, vol. 1, no. 1, pp. 239248 [15] J. Ben-othman ,Basher Yahya, (2010), Energy efficient and QoS based routing protocol for wireless sensor networks, Journal of Parallel and Distributed Computing Vol. 70, no. 8, pp. 849857 [16] K. C. Lee, P. Cheng, M. Gerla, (2010), GeoCross: A geographic routing protocol in the presence of loops in urban scenarios, Journal of Ad Hoc Networks vol.8, no. 5, pp. 474488 [17] R. Ramdhany, P. Grace, G. Coulson, D. Hutchison, (2010), Dynamic deployment and reconfiguration of ad-hoc routing protocols, Journal of Internet Services and Applications, vol. 1, no. 2, pp. 135152 [18] T. Braun, M. Heissenbttel, T. Roth, (2010), Performance of the beacon-less routing protocol in realistic scenarios, Journal of Ad Hoc Networks, vol. 8, no.1, pp. 96107 [19] Q. Yang , A. Lim, S. Li , J. Fang, P. Agrawal, (2010), ACAR: Adaptive Connectivity Aware Routing for Vehicular Ad Hoc Networks in City Scenarios, Journal of Mobile Networks and Application, vol. 15, no. 1, pp. 36-60 [20] Y. Liu , R.L. Olsen , H. Schwefel, (2010) Cooperation of Network and Service Layer in Mobile Ad hoc Networks, Journal of Wireless Personal Communications, vol. 52, no. 1, pp. 253263 [21] M. Saleem,, I. Ullah , S. Khayam, M. Farooq, (2011), On the reliability of ad hoc routing protocols for loss-and-delay sensitive applications, Elsevier journal of Ad Hoc Networks, vol. 9, no. 3, pp. 285-299 [22] S. Kakumanu., S. Raghupathy, (2011),Lattice routing: A 4D routing scheme for multiradio multichannel ad hoc networks Journal of Ad Hoc Networks, vol. 9,no. 1, pp. 95107 [23] V.C.M. Borges , M. Curado, E. Monteiro, (2011), The impact of interference-aware routing metrics on video streaming in Wireless Mesh Networks, Journal of Ad Hoc Networks, vol. 9, no. 4, pp. 652661 [24] Md. A. Razzaque, C. Seon Hong, (2009), Analysis of energy-tax for multipath routing in wireless sensor networks, Journal of networks, vol. 4, no. 8, pp.58-69, [25] M. Tarique, K. E.Tepe, S. Adibi, S. Erfani, (2009), Survey of multipath routing protocols for mobile ad hoc networks, Journal of Network and Computer Applications on ad hoc networks, Vol. 32, No.6, pp. 11251143.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617

JOURNAL OF COMPUTING, VOLUME 3, ISSUE 8, AUGUST 2011, ISSN 2151-9617 HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/ WWW.JOURNALOFCOMPUTING.ORG

69

[26] M. Masoudifar , (2009), A review and performance comparison of QoS multicast routing protocols for MANETs, Journal of Ad Hoc Networks , vol. 7, no. 6, pp. 1150-1155 [27] O. Souihli, M. Frikha, M. Hamouda,(2009), Load-balancing in MANET shortest-path routing protocols, Journal of Ad Hoc Networks, Vol. 7, No. 2 pp. 431442. [28] S. Madria, J. Yin, (2009), SeRWA: A secure routing protocol against wormhole attacks in sensor networks, Journal of Ad Hoc Networks, vol. 7, no. 5 pp. 10511063 [29] Y. Gu, R. Venkatesha P. Ignas N., (2009), Mobility Modeling for Personal Networks, Journal of Wireless Personal Communications, vol. 51, no. 4, pp. 1342- 1361 [30] B. Awerbuch, R. Herbert, (2010) High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks, Journal of Wireless Networks - WINET , vol. 16, no. 3, pp. 813-82710. [31] Y. Liu, S. Hans-Peter, (2010), Cooperation of Network and Service Layer in Mobile Ad hoc Networks, Journal of Wireless Personal Communication, vol. 52, no. 1, pp. 253-263 [32] D. Passos, Clio V. N., E.M. Campista, C. Otto, (2011), Minimum loss multiplicative routing metrics for wireless mesh Networks, Journal of Internet Service and Application, vol. 1, pp. 201214 [33] J. Zhou, M. Jacobsson, E. Onur, I. Niemegeers, (2011) An Investigation of Link Quality Assessment for Mobile Multi-hop and Multi-rate Wireless Networks, vol. 11, no. 1, pp. 1-23 [34] Z. You-ping, K. Xing-hong, HUANG Pei-wei, (2007), Improved Algorithm for Distributed Localization in Wireless Sensor Networks, Journal of Shanghai Jiaotong University science, vol. 15, no. 1, pp. 64-69, [35] D. Amis, Ravi Prakash, Thai H.P., Vuong Dung T. Huynh, (2008) Max-Min D-Cluster Formation in Wireless Ad Hoc Networks, Journal of computer science, vol. 4, no.3, pp. 192204 [36] H. Lan Nguyen, T. Uyen , (2008), A study of different types of attacks on multicast in mobile ad hoc networks, Journal of Ad Hoc Networks vol. 6, no. 4, pp. 32-46 [37] L. Junhai, X. Liu, Y. Danxia, (2008), Research on multicast routing protocols for mobile ad-hoc networks, Journal of Computer Networks and Isdn Systems - CN , vol. 52, no. 5, pp. 988-997 [38] L. Rosati, M. Berioli , G. Reali, (2008), On ant routing algorithms in ad hoc networks with critical connectivity, Journal of Ad Hoc Networks , vol. 6, no. 6, pp. 827-859, [39] M. J. Miller, N. H. Vaidya, (2008), Ad hoc routing for multilevel power save protocols, Elsevier Journal of Ad Hoc Networks, vol.6 ,no 2. pp. 210225 [40] T. R. Andel, A. Yasinsac, (2008), Adaptive Threat Modeling for Secure Ad Hoc Routing Protocols, Electronic Notes in Theoretical Computer Science on ad hoc networks, Vol. 197, No. 2, pp. 3-14. [41] X. Wu, H. R. Sadjadpour, J.J. Garcia-Luna-Aceves, (2008), Modeling of topology evolutions and implication on proactive routing overhead in MANETs, Journal of Computer Communications, vol. 31, no. 4, pp. 782-792.

Rahul Malhotra has received his Bachelor of Engineering Degree in Electronics & Communication Engineering from Baba Saheb Naik College of Engineering, Pusad under Amravati University, Amravati - India in 2001 and M.Tech degree in Electronics & Communication Engineering from Giani Zail Singh College of Engineering & Technology, Bathinda, India in 2008 and Ph.D in Electronics and Communication Engineering from Punjab Technical University, Jalandhar in 2011. He joined as a Lecturer in 2001 at Guru Gobind Singh College of Engineering & Technology, Talwandi Sabo, India. He joined as Assistant Professor in Adesh Institute of Engineering & Technology, Faridkot, India in 2008. Presently, He is working as Associate Professor at BMS College of Engineering, Muktsar. His area of interest includes Wireless Communication, Adhoc Networks, and Fuzzy Logic & Genetic Algorithms. He is a member of Indian Society for Technical Education, The Institution of Electronics & Telecommunication Engineers (India), Institution of Engineers (India). Gurpreet Singh obtained Bachelor of Engineering from Bhai Maha Singh College of Engineering, Sri Muktsar Sahib (Punjab Technical University, Jalandhar) in Year 2009 and presently pursuing Master of Technology in Microelectronics from Bhai Maha Singh College of Engineering, Sri Muktsar sahib. His areas of interest include Wireless networks, Digital Electronics, Liner Integrated Circuits.

2011 Journal of Computing Press, NY, USA, ISSN 2151-9617