CHAPTER 7 SIMULATION OBSERVATIONS

Similar documents
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

Unicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks

Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks

Fast, Efficient, and Robust Multicast in Wireless Mesh Networks

Routing Protocols in MANETs

Issues of Long-Hop and Short-Hop Routing in Mobile Ad Hoc Networks: A Comprehensive Study

Wireless Sensor Networks

Wireless Sensor Networks

Subject: Adhoc Networks

3. Evaluation of Selected Tree and Mesh based Routing Protocols

A Directional MAC Protocol with the DATA-frame Fragmentation and Short Busy Advertisement Signal for Mitigating the Directional Hidden Node Problem

Performance Evaluation of Route Failure Detection in Mobile Ad Hoc Networks

QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET

Transport layer issues

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Wireless Networking & Mobile Computing

Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model

Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness

15-441: Computer Networking. Wireless Networking

TMMAC: A TDMA Based Multi-Channel MAC Protocol using a Single. Radio Transceiver for Mobile Ad Hoc Networks

An Implementation of Cross Layer Approach to Improve TCP Performance in MANET

Final Exam: Mobile Networking (Part II of the course Réseaux et mobilité )

Analysis of TCP and UDP Traffic in MANETs. Thomas D. Dyer Rajendra V. Boppana CS Department UT San Antonio

Lecture 16: Wireless Networks

Homework #4. Due: December 2, 4PM. CWND (#pkts)

Design of Link and Routing Protocols for Cache-and- Forward Networks. Shweta Jain, Ayesha Saleem, Hongbo Liu, Yanyong Zhang, Dipankar Raychaudhuri

AODV-PA: AODV with Path Accumulation

Outline. Lecture 16: Wireless Networking. Physical Layer (Layer 1) Ethernet: Wireless is Different. Attenuation Over Space

A Literature survey on Improving AODV protocol through cross layer design in MANET

Towards a Robust Protocol Stack for Diverse Wireless Networks Arun Venkataramani

A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver

Arvind Krishnamurthy Fall 2003

Outline. Wireless Channel Characteristics. Multi-path Fading. Opportunistic Communication - with a focus on WLAN environments -

Qos-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks

Chapter 7 CONCLUSION

SENSOR-MAC CASE STUDY

A Medium Access Control Protocol with Retransmission using NACK and Directional Antennas for Broadcasting in Wireless Ad-Hoc Networks

Mobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

4.3 IEEE Physical Layer IEEE IEEE b IEEE a IEEE g IEEE n IEEE 802.

Improved Local Route Repair And Congestion Control In Self Organizing Networks

MAC LAYER. Murat Demirbas SUNY Buffalo

MAC protocols. Lecturer: Dmitri A. Moltchanov

ECE 598HH: Special Topics in Wireless Networks and Mobile Systems

Lecture 16: Wireless Networking

Lecture 16: QoS and "

An Efficient Scheme for Detecting Malicious Nodes in Mobile ad Hoc Networks

Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks Λ

Scalability of Routing Methods in Ad Hoc Networks

Dynamic Source Routing in ad hoc wireless networks

An energy-efficient MAC protocol for infrastructure WLAN based on modified PCF/ DCF access schemes using a bidirectional data packet exchange

Effects of Wireless Physical Layer Modeling in Mobile Ad Hoc Networks

ENERGY EFFICIENT MULTIPATH ROUTING FOR MOBILE AD HOC NETWORKS

Routing in ad-hoc networks Marina Dupcinov, Srdjan Krco Applied Research Lab, EEI, Ericsson Ireland

Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14

Wireless MACs: MACAW/802.11

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols

CS551 Ad-hoc Routing

Throughput Improvement by Adjusting RTS Transmission Range for W-LAN Ad Hoc Network

An Efficient Scheduling Scheme for High Speed IEEE WLANs

Congestion-Aware Routing Protocol for Mobile Ad Hoc Networks

Wireless Internet Routing. Learning from Deployments Link Metrics

CERIAS Tech Report A Simulation Study on Multi-Rate Mobile Ad Hoc Networks by G Ding, X Wu, B Bhar Center for Education and Research

Performance of Route Caching Strategies in Dynamic Source Routing

Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s

Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol

UCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.

Performance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols

Review: Performance Evaluation of TCP Congestion Control Mechanisms Using Random-Way-Point Mobility Model

CMPE 257: Wireless and Mobile Networking

IEEE Fragmentation-Aware Energy-Efficient Ad-Hoc Routing Protocols

CMPE 257: Wireless and Mobile Networking

Performance Evaluation of MANET through NS2 Simulation

A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks

COMP3331/9331 XXXX Computer Networks and Applications Final Examination (SAMPLE SOLUTIONS)

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

Computation of Multiple Node Disjoint Paths

Medium Access Control. MAC protocols: design goals, challenges, contention-based and contention-free protocols

Design and Evaluation of a new MAC Protocol for Long- Distance Mesh Networks by Bhaskaran Raman & Kameswari Chebrolu ACM Mobicom 2005

Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP

Mobile Communications. Ad-hoc and Mesh Networks

Mohamed Khedr.

Wireless Networks (MAC)

Collisions & Virtual collisions in IEEE networks

Wireless and Mobile Networks

Alleviating Effects of Mobility on TCP Performance in Ad Hoc Networks using Signal Strength based Link Management

Impact of IEEE MAC Packet Size on Performance of Wireless Sensor Networks

Improving of TCP Performance Evaluation in Mobile Ad Hoc Networks

Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks

Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1

CARA: Collision-Aware Rate Adaptation for IEEE WLANs. Presented by Eric Wang

High-Throughput Multicast Routing Metrics in Wireless Mesh Networks

Intelligent Transportation Systems. Medium Access Control. Prof. Dr. Thomas Strang

Physical Carrier Sensing and Spatial Reuse in Multirate and Multihop Wireless Ad Hoc Networks

Distributed Web-Topology Formation with Directional Antenna in Mesh Environment

Poonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)

Lecture 12 December 04, Wireless Access. Graduate course in Communications Engineering. University of Rome La Sapienza. Rome, Italy

A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET

Chapter 16 Networking

Transcription:

CHAPTER 7

CHAPTER 7 SIMULATION OBSERVATIONS Over a randomly distributed wireless network system with the specification is modeled with the suggested algorithms for communication from a selected source to destination. The architecture is designed to have the suggested algorithm running per node and the observations were made for various quality metrics to evaluate the robustness of the network. Quality metrics such as throughput, average packet delivery ratio, communication delay, BER, at the variation of data rate, offered bandwidth, interference level etc. were evaluated. The developed method is evaluated over two advanced routing schemes in wireless network namely DSR and AODV routing scheme to observe its feasibility. For the simulation of the developed algorithm a distributed network is created with following specifications,

Table 7.1: Network specification used for the network modeling

Figure 7.1: distributed and random values for parameters and specifications

The energy consumption model, which is obtained from the measurements of 82.11 DS High Rate network interface card (NIC) operating at 2 Mbps. Power consumption in three modes of operation i.e. transmission(tx), Reception (Rx), Idle and sleeping. The values used are given as; Table 7.2: power consumption values used for simulation Figure 7.2: simulated values for used power consumption The link parameters used for the created network is presented in table below. Path loss Model BS antenna gain plus Cable Loss Carrier Frequency Rx antenna Tx antenna User antenna gain Maximun user EIRP Maximum B S EIRP CL Power Control Transmission Rates (kbit/s) TTI Scheduling Period Target L=128.1+37.6 Log1(R) 14 dbi 2 GHz 1 1 dbi 21dBm 24 dbm 1 db step size 8,16,32,64,128,256,384 1 ms Every 1 TTI 5.23 db (- % 7 load factor) Table 7.3: link parameter for simulation

Figure 7.3: link parameters for the created networks

System developed three important performance metrics are evaluated: - Packet Delivery Report: This is the data packets delivered to destinations with those generated by the sources. - Goodput: This is the amount of data that the sender is estimated divided by the time the highest ACK was received. If all packets are accepted in certain simulation time, the amount of data is separated from the whole simulation time. - MT Load Routing: This is the number of routing packets transmitted data packet sent to the destination. Also forwarded each packet is calculated as a transmission. This metric is also much related to the number of route changes that occur in the simulation. All the 82.11b wireless interfaces were modeled to have a bit rate of 1 Mbps. Here, a zero pause time i.e. continuous mobility is considered. The number of source destination pairs is 15 and the sources are designed with 512-byte packets. Each data point is an average of at least 3 runs with identical traffic scenarios but randomly generated mobility scenarios. Each of the 15 source destination pairs sends at a rate of 3 packets/s, a relatively low packet rate in order to avoid network congestion. All nodes have the same transmit power, in each experiment the transmit power is varied from 1 dbm to 24.5 dbm. The performance is evaluated for the variation of quality parameters at different data rate and the observation made is as outlined below,

packet delivery ratio(%) 1 9 DSR-ref DSR-ma AODV-ma ADOV-ref 8 7 6 5 4 1 12 14 16 18 2 22 24 26 28 3 transmit power(dbm) Figure 7.4 : packet delivery ratio over varaible transmitted power at CST = -84dB Transmit power Packet delivery ratio DSR-ref DSR-ma AODV-ma AODV-ref 1 48 62 79 76 15 78 84 88 83 2 94 94 94 93 3 1 1 1 1 Table 7.4: Packet delivery ratio for the developed routing methods at CST = -84dB

packet delivery ratio(%) 1 9 DSR-ref DSR-ma AODV-ma ADOV-ref 8 7 6 5 4 1 12 14 16 18 2 22 24 26 28 3 transmit power(dbm) Figure 7.5: Packet delivery ratio over variable transmitted power, at CST=-81dBm Transmit Power Packet Delivery Ratio DSR-REF DSR-MA AODV-MA AODV-REF 1 48 7 72 69 15 68 82 82 78 2 95 94 95 92 3 1 97 1 96 Table 7.5: Packet delivery ratio wrt. Transmitted power at CST=-81dBm Figure 7.4, illustrate that for CST= -84 dbm, the packet delivery ratios for reference and proposed are very similar with transmit power Pt higher than 16 dbm. When the transmit power is lower than 16 dbm, the proposed method outperforms the conventional method in terms of packet delivery ratio. However at any transmit power, the conventional

method demonstrates significantly lower routing load than the proposed method. This is due to the conventional method aggressive use of route caching. The conventional method is likely to find a route in the cache and avoid using route discovery every time a link is broken. In previous approaches, it was found that 55 percent of the route replies were from the route caches and even though 41 percent of the route replies were based on cached data contained broken routes, the the conventional method route maintenance was able to deliver good performance. However for Pt < 16 dbm, caching degrades the performance of the conventional method. In this case, low transmit powers yield frequent link failures. As a result, the conventional method caches will not be up to date, and stale routes are chosen from the cache. However, such a big degradation in the proposed method is not observed, largely because of the use of sequence numbers maintained at each node to determine the freshness of the routing information. The proposed method also features timer-based states in each node. A routing entry is deleted if it not used during a specified amount of time. On the other hand, conventional method keeps the routing entries in the cache until a link on the route is found to be broken.

normalized routing load 1.6 1.4 1.2 DSR-ref DSR-ma AODV-ma ADOV-ref 1.8.6.4.2 1 12 14 16 18 2 22 24 26 28 3 transmit power(dbm) Figure 7.6: Normalized routing load over variable transmitted power, at CST=-84dBm Transmit Power(dbm) Normalized Routing Load DSR-REF DSR-MA AODV-MA AODV-REF 1.8.6.5.41 15.31.1.5.2 2.26.25.23.2 25.2.19.18.17 3.16.15.14.13 Table 7.6: Normalized routing load over variable transmitted power, at CST=-84dBm For both proposed and the conventional method, the gap between the results shrinks as the transmit power increases. However, this gap is

much wider for Conventional Method at low transmit power. Thus, our most important observation is that the performance of conventional method can depend strongly on the physical layer model [146][147]. For example, in Figure 7.5 for Pt = 1 dbm that the choice of layer model affects conventional method packet delivery ratio by 5 percent. On the other hand, the performance of proposed method appears to be relatively insensitive to the choice of physical layer model [146][147]. Increasing the CST value increases the packet delivery ratio because the number of instantaneous transmissions increases, but there is no SINR tracking to record the cumulative effect of interference which would actually degrade the performance. When using a specific rate for the unicast data packets, the choice of rate used for the broadcast data packets and the MAC control packets can dramatically affect the results.

normalized routing load 2 1.5 DSR-ref DSR-ma AODV-ma ADOV-ref 1.5 -.5 1 12 14 16 18 2 22 24 26 28 3 packet rate (pkts/s) Figure 7.7: Normalized routing load over variable packet rate at CST=- 81dBm Packet Rate(pkts/s) Normalized Routing Load DSR-REF DSR-MA AODV-MA AODV-REF 1.8.6.55.7 15.45.3.18 2.37.35 -.3 25.3.3 -.35 -.4 3.25.2 -.45 -.3 Table 7.7: Normalized routing load over variable packet rate at CST=- 81dBm

packet delivery ratio(%) 1 9 8 DSR-ref DSR-ma AODV-ma ADOV-ref 7 6 5 4 3 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.8: packet delivery ration at 11Mbps with broadcast packets at 1Mbps. Packet Rate(pkts/s) Packet delivery ratio(%) DSR-REF DSR-MA AODV-MA AODV-REF 4 5 49 48.5 48 5 72 52 52 34 6 75 51 52 34 7 68 52 48 68 8 53 52 34 32 9 53 52 41 32 1 62 52 48 43 Table7.8: packet delivery ration at 11Mbps with broadcast packets at 1Mbps.

packet delivery ratio(%) 4 35 DSR-ref DSR-ma AODV-ma ADOV-ref 3 25 2 15 1 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.9: packet delivery ration at 11Mbps with broadcast packets at 1Mbps. Packet Packet Delivery Ratio (%) Rate(Pkts/sec) DSR-REF DSR-MA AODV-MA AODV-REF 4 19 19 3 28 5 18.88 18.44 31.466 27.25 6 16.649 17.82 31.289 25.785 7 14.847 16.892 3.813 22.962 8 14.561 15.585 3.624 22.578 9 14.441 14.35 3.417 2.38 1 14.255 14.8 3.273 2.81 Table 7.9: packet delivery ratio at 4-1 packet/sec variation

normalized routing load The route discovery in proposed and conventional routing is made by the use of request packets. These route request packets are sent as broadcast data packets. Therefore the number of nodes participating in the route discovery and the distance between the nodes in the chosen path is affected by the physical rate chosen for transmitting broadcast data packets. A lower rate results in a higher range and therefore longer hops. However, in a single rate environment, the routing should be done with the rate that's used for transmitting the actual unicast data packets. For example, if the rate chosen for data packets is 11Mbps but the route is constructed with 1Mbps packets, the routing protocol may find a route that has hops that can't support an 11Mbps data rate. This may result in frequent link breakages and an unstable network behavior. 1 9 8 DSR-ref DSR-ma AODV-ma ADOV-ref 7 6 5 4 3 2 1 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.1: Normalized routing load over variable packet rate at 11Mbps with broadcast and control packets at 1Mbps.

normalized routing load PACKET PACKET DELIVERY RATIO(%) RATE(ptks/sec) DSR-REF DSR-MA AODV-MA AODV-REF 4 2.1 2.1 4.3 2.2 5 1.7421 1.7249 3.891 2.24 6 1.7342 1.5937 3.65 1.8748 7 1.229 1.2769 3.299 1.8661 8 1.164 1.2213 2.8651 1.8329 9 1.1459 1.1734 2.522 1.8286 1 1.655 1.272 2.319 1.736 Table 7.1: Normalized routing load over packet rate. The impact of signal sense on the aggregate throughput is observed. It is seen that, the smaller the carrier sense range, the better the spatial reuse; but the interference at a receiver can also increase. With the increase of the carrier sensing range, as carrier sensing range is smaller, more spatial reuse is possible. 1 9 8 DSR-ref DSR-ma AODV-ma ADOV-ref 7 6 5 4 3 2 1 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.11: Normalized routing load over variable packet rate at 11Mbps with broadcast data and control packets at 1Mbps.

PACKET PACKET DELIVERY RATIO(%) RATE(ptks/sec) DSR-REF DSR-MA AODV-MA AODV-REF 4 2.1 2.1 8.1 6.2 5 2.46 2.435 6.927 4.927 6 2.367 2.237 6.8695 4.8695 7 2.35 2.122 6.5371 4.5371 8 1.9811 2.5 5.9689 3.9689 9 1.9548 1.968 5.659 3.659 1 1.9431 1.948 5.839 3.839 Table 7.11: Normalized routing load over variable packet rate. 82.11b supports two types of access modes: the physical carrier sensing mechanism and the RTS/CTS based mechanism. Since transmitting RTS and CTS frames increases the overhead, there is a trade-off between such overhead and the overhead from collisions between packets in the physical carrier sensing mode. Especially in high-rate situations this can degrade the network performance because the physical headers including the PLCP preambles of data, ACK, RTS and CTS frames are transmitted at 1Mbps regardless of the data rate.

packet delivery ratio(%) 1 95 9 DSR-ref DSR-ma AODV-ma ADOV-ref 85 8 75 7 65 6 55 5 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.12: packet delivery ratio for variable packet rate at 11Mbps with 512-byte packets RTS/CTS ON PACKET PACKET DELIVERY RATIO(%) RATE(ptks/sec) DSR-REF DSR-MA AODV-MA AODV-REF 4 97.946 98.164 99.965 99.844 5 97.944 97.967 99.899 99.816 6 97.658 97.667 99.714 99.723 7 97.657 97.579 99.685 99.67 8 97.634 97.352 99.626 99.591 9 97.63 97.33 99.539 99.582 1 97.614 97.29 99.59 99.556 Table 7.12: packet delivery ratio for variable packet rate

packet delivery ratio(%) 1 95 9 DSR-ref DSR-ma AODV-ma ADOV-ref 85 8 75 7 65 6 55 5 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.13: packet delivery ratio wrt. packet rate for 11Mbps with 512- byte packets RTS/CTS ON PACKET PACKET DELIVERY RATIO(%) RATE(ptks/sec) DSR-REF DSR-MA AODV-MA AODV-REF 4 96.855 92.234 96.629 95.881 5 9.83 83.825 95.749 95.244 6 76.128 77.626 95.28 92.443 7 75.835 77.413 91.949 9.745 8 74.762 73.782 91.8 9.547 9 69.859 72.155 9.142 88.449 1 65.55 71.915 88.389 88.175 Table 7.13: packet delivery ratio wrt. packet rate

normalized routing load The effect of loading the network were observed with two different power levels, Pt=16 dbm and Pt=24.5 dbm. The packet rate of each source is slowly increased from 1 to 1, changing the total offered load to the network from 24 kb/s to 6kb/s in case of 512-byte packets and from 7 kb/s to 176 kb/s for 15-byte packets. The result obtained shows the packet delivery ratio and the normalized routing load for both proposed and reference method at 1Mbps with 512-byte packets and RTS/CTS option turned on. 2 1.8 1.6 DSR-ref DSR-ma AODV-ma ADOV-ref 1.4 1.2 1.8.6.4.2 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.14: normalized routing load over variable packet rate at 11Mbps with 512-byte packets RTS/CTS ON

PACKET PACKET DELIVERY RATIO(%) RATE(ptks/sec) DSR-REF DSR-MA AODV-MA AODV-REF 4.16629.19186.34113.29551 5.1654.16641.3417.2955 6.16366.16311.33762.2885 7.1639.15214.31656.2672 8.15924.1515.2869.25876 9.1572.14492.27167.24977 1.1167.13434.2996.2385 Table 7.14: packet delivery ratio over variable packet rate The reference s packet delivery ratio is almost the same as proposed at Pt=24.5 dbm, whereas the proposed method is 2% better than reference at Pt=16 dbm at every packet rate. This is due to the fact that in a situation induced by lower transmit power, conventional method fails to find reliable routes during route maintenance because of its aggressive caching strategy.

normalized routing load 2 1.8 1.6 DSR-ref DSR-ma AODV-ma ADOV-ref 1.4 1.2 1.8.6.4.2 4 5 6 7 8 9 1 packet rate(pkts/s) Figure 7.15: normalized routing load at variable data rate of 11Mbps with 512-byte packets RTS/CTS ON PACKET RATE(pkts/sec) PACKET DELIVERY RATIO(%) DSR-REF DSR-MA AODV-MA AODV-REF 4.3996.38666.58948.49796 5.3928.38493.57553.48171 6.3721.3698.53239.4646 7.36373.35754.5652.4395 8.36164.3536.4927.4364 9.35933.35135.47818.42952 1.35798.353.47188.41434 Table 7.15: % of offered packet delivery ratio at packet rate of 4-1 pkts/sec When focused on the impact of the physical layer model [146][147] on the packet delivery ratio, it is observed that both methods are relatively

insensitive to the choice of physical layer model [146][147]. This is because the offered load is high for 1Mbps and packet losses are high due to congestion, regardless of the physical layer model. In above Figure it is observed that the results of the same simulations with RTS/CTS option turned off. Here the qualitative behavior is exactly the same. However, the packet delivery ratios are 1% better than the previous simulations. It is seen that when the packet length is increased, the relative overhead of RTS/CTS handshake decreases therefore the difference in performance between RTS/CTS and basic scheme is much less than the 512-byte case. 1 AODV Mean=.24 std=.148 9 8 7 6 5 4 3 2 1.5 1 1.5 2 2.5 3 3.5 4 4.5 goodput(mbps) Figure 7.16: observed goodput for mean route of AODV =.24 and standard deviation of.148

25 AODV mean=.166 std=.168 2 15 1 5.5 1 1.5 2 2.5 3 3.5 4 4.5 normalized routing load Figure 7.17: Normalized routing load for mean route of AODV =.166 and standard deviation of.168 12 DSR mean=.26 std=.149 1 8 6 4 2 1 2 3 4 5 6 7 goodput(mbps) Figure 7.18: observed goodput for mean route of DSR =.26 and standard deviation of.149

25 DSR mean=.44 std=.48 2 15 1 5.5 1 1.5 2 2.5 3 3.5 4 4.5 normalized routting load Figure 7.19: normalized routing load for mean route of DSR =.44 and standard deviation of.48 1 AODV mean=.154 std=.161 9 8 7 6 5 4 3 2 1.5 1 1.5 2 2.5 3 3.5 4 4.5 goodput(mbps) Figure 7.2: observed goodput for mean route of AODV =.154 and standard deviation of.161

2 AODV mean=.913 std=2.12 18 16 14 12 1 8 6 4 2.5 1 1.5 2 2.5 3 3.5 4 4.5 normalized routing load Figure 7.21: normalized rotuing load for mean route of AODV =.913 and standard deviation of 2.12 1 DSR mean=.184 std=.141 9 8 7 6 5 4 3 2 1.5 1 1.5 2 2.5 3 3.5 4 4.5 goodput(mbps) Figure 7.22: observed goodput for mean route of DSR =.184 and standard deviation of.141

2 DSR mean=.264 std=1.191 18 16 14 12 1 8 6 4 2.5 1 1.5 2 2.5 3 3.5 4 4.5 normalized routing load Figure 7.23: normalized rotuing load for mean route of DSR =.264 and standard deviation of 1.191 2 DSR mean=.264 std=1.191 18 16 14 12 1 8 6 4 2.5 1 1.5 2 2.5 3 3.5 4 4.5 normalized routing load Figure 7.24: normalized routing load for mean route of DSR =.264 and standard deviation of 1.191

1 AODV mean=.183 std=.188 9 8 7 6 5 4 3 2 1.5 1 1.5 2 2.5 3 3.5 4 4.5 goodput(mbps) Figure 7.25: observed goodput for mean route of AODV =.183 and standard deviation of.188 1 AODV mean=.183 std=.188 9 8 7 6 5 4 3 2 1.5 1 1.5 2 2.5 3 3.5 4 4.5 goodput(mbps) Figure 7.26: observed goodput for mean route of AODV =.183 and standard deviation of.188

2 AODV mean=.654 std=.439 18 16 14 12 1 8 6 4 2.5 1 1.5 2 2.5 3 3.5 4 4.5 normalized routing load Figure 7.27: normalized routing load for mean route of AODV =.654 and standard deviation of.439 1 DSR mean=.194 std=.183 9 8 7 6 5 4 3 2 1.5 1 1.5 2 2.5 3 3.5 4 4.5 goodput(mbps) Figure 7.28: observed goodput for mean route of DSR =.194 and standard deviation of.183

2 DSR mean=.159 std=.128 18 16 14 12 1 8 6 4 2.5 1 1.5 2 2.5 3 3.5 4 4.5 normalized routing load Figure 7.29: normalized routing load for mean route ofdsr =.159 and standard deviation of.128 For a 512-byte data packets at 1 Mbps data rate and the transmit power was 1 dbm. In observation Figures obtained, it is observed that three peaks in the good put plot are present. The first peak around.5mbps belongs to the connections with one hop. With one hop communications there can't be any collisions once the route is found since there's just one FTP pair in the network. Therefore there is not much difference between the good put of two method at one hop. When compared, the 1 hop good put distribution of the results of the experiments with RTS/CTS ON with its RTS/CTS OFF complement, it is observed that they are almost the same. The only difference is that throughput with RTS/CTS OFF is a little higher than with RTS/CTS ON because of the overhead of the

RTS/CTS. The reason of this similarity is the fact that during route discovery, the route request packets are broadcasted and therefore not preceded with an RTS/CTS exchange. Because of this, the route discovery in two different scenarios is identical. This can be seen in above Figures. It is observe that, despite the fact that the results of stationery scenarios with just one FTP connection, there is still a big difference between the two results. This is due to the sender's inability to accurately determine the cause of a packet loss. The sender assumes that all packet losses are caused by congestion. Thus, when a link on a route breaks, the sender reacts as if congestion was the cause, reducing its congestion window and, in the instance of a timeout, backing-off its retransmission timeout (RTO). Therefore, link breakages degrade the performance, and these breakages occur more often in conventional routing scheme. From all these observations made it is observed that the routing scheme of for a wireless network with distributed architecture is outperforming the performances as compared to the conventional method.