Routing Protocol Evaluation David Holmer

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Florin Dinu T. S. Eugene Ng Rice University Inferring a Network Congestion Map with Traffic Overhead 0 zero.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
CS4550: Computer Networks II network layer basics 3 routing & congestion control.
CS710 IEEE Transactions on vehicular technology 2005 A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou,
Network Layer Routing Issues (I). Infrastructure vs. multi-hop Infrastructure networks: Infrastructure networks: ◦ One or several Access-Points (AP) connected.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking David B. Johnson Department of Computer Science Rice University Monarch.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
An Analysis of the Optimum Node Density for Ad hoc Mobile Networks Elizabeth M. Royer, P. Michael Melliar-Smith and Louise E. Moser Presented by Aki Happonen.
Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
GeoLANMAR Routing: Asymptotic Analysis in Large and Dense Networks Broadnets 2005 Boston, Oct 5, 2005 Mario Gerla, Biao Zhou (UCLA) F. de Rango, S. Marano.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Lecture 8 Advance Topics in Networking.
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
SDSR – “Superior” DSR Jay Chen Siddharth Gidwani Christopher Yap.
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.
The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation Baruch Awerbuch, David Holmer, Herbert Rubens {baruch dholmer WONS Jan.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
An Overlay Architecture for High Quality VoIP Streams IEEE Trans. on Multimedia 2006 R 翁郁婷 R 周克遠.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Mobile Routing protocols MANET
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
SRI International 1 A Simulation Comparison of TBRPF, OLSR, and AODV Richard Ogier SRI International July 2002.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
TELE202 Lecture 6 Routing in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »Packet switching in Wide Area Networks »Source: chapter 10 ¥This Lecture.
Link State Routing David Holmer Generic Link State Routing  Each node monitors neighbors/local links and advertises them to the network.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Mobility Models for Wireless Ad Hoc Network Research EECS 600 Advanced Network Research, Spring 2005 Instructor: Shudong Jin March 28, 2005.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Reliable Adaptive Lightweight Multicast Protocol Ken Tang, Scalable Network Technologies Katia Obraczka, UC Santa Cruz Sung-Ju Lee, Hewlett-Packard Laboratories.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Speaker: Ju-Mei Li Virtual Paths Routing: A Highly Dynamic Routing Protocol for Ad Hoc Wireless Networks Abdulrahman H. Altalhi and Golden G. Richard Computer.
William Stallings Data and Computer Communications
A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Mesh-based Geocast Routing Protocols in an Ad Hoc Network
GPSR Greedy Perimeter Stateless Routing
Ad Hoc Networks - Performance
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Kevin Lee & Adam Piechowicz 10/10/2009
Tarun Banka Department of Computer Science Colorado State University
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Congestion Control, Quality of Service, & Internetworking
Presentation transcript:

Routing Protocol Evaluation David Holmer

Mobility Models

Random Waypoint Mobility  Two parameters Pause Time (Pt) Max Speed (Vmax)  Each node starts at a random location  Executes loop Pause for Pt seconds Select a random destination (waypoint) Move to that destination at a random speed (0,Vmax) Repeat upon arrival

Random Waypoint Properties  Advantages Easy to implement Allows heterogeneous speeds and temporarily stationary nodes  Disadvantages Non-uniform node distribution (tend towards center) Un-stable instantaneous mobility (tends towards zero and oscillates)

Random Waypoint Properties (cont)

Modified Random Waypoint  Narrow the random speed range (.1 Vmax,.9 Vmax) instead of ( 0, Vmax )  Pre-simulation mobility Mobility properties stabilize before routing and data commences Doesn’t fix non-uniform node distribution

Other Mobility Models  Billiard Model Node selects a random direction, speed, and time Moves in that direction at that speed for that time and then repeats (may have pause time as well) Bounces off simulation boundary like a “billiard ball” Maintains uniform node distribution, and uniform average speed (due to time selection)  Group mobility patterns Node mobility is sum of group mobility and individual mobility Used by clustering based routing protocols (well suited for certain applications like the military)  Trace based mobility patterns Record real life people/vehicle/etc. motion patterns Requires location hardware such as GPS Difficult to try variations or change “parameters”

Routing Performance Metrics

Routing Protocol Evaluation Metrics  Four most common metrics Delivery Ratio Latency Path Length Optimality Control Overhead

Delivery Ratio  Number of packets successfully received by the destination / number sent by the source  Evaluated by setting up a number of “test” flows in the network Commonly a number of constant bit rate (CBR) flows with a specified number of packets per second Uses UDP so every dropped packet results in a reduction of the delivery ratio (no end-to-end retransmissions)  Congestion Sensitive A large enough test load will result in reduced delivery ratio for ANY protocol due to congestion  Mobility Sensitive If the routing protocol does not respond quickly to topology change, then packets sent on links that no longer exist will be lost

Delivery Ratio Examples Delivery Ratio vs. Test LoadDelivery Ratio vs. Mobility

Latency  The time between the creation of a packet and its delivery to the destination  Usually measured using the same setup as delivery ratio  Congestion sensitive Latency will drastically increase as the congestion limit is reached (due to waiting in large buffers)  Retransmission sensitive Protocols that locally recover packets will achieve higher delivery ratio but will increase latency  On-demand sensitive Protocols that setup routes after data is sent will have higher latency on the initial packets of a flow

Latency Example

Path Length Optimality  The difference between the length of the path used for sending packets in the protocol and the length of the best possible path  Measurement Protocol path length observed for each packet using test flows Best possible path computed offline using same mobility pattern  Measure of protocol’s ability to track good routes Extra hops from non-optimal routes will result in increased congestion and medium utilization

Path Length Optimality Example

Control Overhead  Number/size of routing control packets sent by the protocol  Calculated using counters while simulating with test flows  Sometimes expressed as a ratio of control to data  Indication of how efficiently a routing protocol operates High control overhead may adversely affect delivery ratio and latency under higher loads

Control Overhead Example