Distributed Routing Protocol in Wireless Network Simulation

Slides:



Advertisements
Similar presentations
1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Advertisements

Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
DSR The Dynamic Source Routing Protocol Students: Mirko Gilioli Mohammed El Allali.
Geographic Routing Without Location Information A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, I. Stoica Paper and Slides by Presented by Ryan Carr.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
TCP/IP Protocol Suite 1 Upon completion you will be able to: Mobile IP Understand the addressing scheme for mobile hosts. To define home, care-of, and.
Ad Hoc Wireless Routing CS Winter 2001 Review of conventional routing schemes Proactive wireless routing schemes Hierarchical routing Reactive (on.
CS 268: Ad Hoc Routing Kevin Lai Feb 20, Ad Hoc Motivation  Internet goal: decentralized control -someone still has to deploy.
Ns Simulation of IEEE SC546 Project (Fall 2002) SOO IL KIM JISUN YOON
Ad Hoc Routing CMU David Andersen. Ad Hoc Routing Goal: Communication between wireless nodes –No external setup (self-configuring) –Often need.
Ad Hoc Wireless Routing COS 461: Computer Networks
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
Chapter 4: Managing LAN Traffic
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
Count to infinity problem
Mobile Ad-Hoc Networking By Jared Roberts. Overview What is a MANET? What is a MANET? Problems with routing in a MANET Problems with routing in a MANET.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Institut für Betriebssysteme und Rechnerverbund Technische Universität Braunschweig Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur.
Mobile Adhoc Network: Routing Protocol:AODV
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Routing Protocols for Mobile Ad-Hoc Networks By : Neha Durwas For: Professor U.T. Nguyen COSC 6590.
1 Ad Hoc On-Demand Distance Vector Routing (AODV) Dr. R. B. Patel.
Chapter 15 The Addressing Structure in NS. The Default Address Format 32 lower bits for port-id, 1 higher bit for mcast and the rest 32 higher bits for.
Usman Rafique NAME : USMAN RAFIQUE SUPERVISOR: Prof Rikku Jänttii.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
DSR: Introduction Reference: D. B. Johnson, D. A. Maltz, Y.-C. Hu, and J. G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,”
On-Demand Routing Protocols Routes are established “on demand” as requested by the source Only the active routes are maintained by each node Channel/Memory.
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
PERFORMANCE EVALUATION OF COMMON POWER ROUTING FOR AD-HOC NETWORK Zhan Liang Supervisor: Prof. Sven-Gustav Häggman Instructor: Researcher Boris Makarevitch.
Remote Deployment of Sensor Networks Presentation 3: Providing connectivity between sensor nodes and uplinks.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
: MobileIP. : r Goal: Allow machines to roam around and maintain IP connectivity r Problem: IP addresses => location m This is important for efficient.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Wireless Ad Hoc Network Routing Protocols
Ad Hoc Wireless Routing
ROUTING.
Chapter 5 Network and Transport Layers
Analysis the performance of vehicles ad hoc network simulation based
The Ad Hoc On-Demand Distance-Vector Protocol (AODV)
AODV-OLSR Scalable Ad hoc Routing
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
DSDV Highly Dynamic Destination-Sequenced Distance-Vector Routing
Chapter 16 Mobile Networking in ns
(How the routers’ tables are filled in)
Simulators for Sensor Networks
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
Zone Routing Protocol (ZRP) Update
A comparison of Ad-Hoc Routing Protocols
Introduction to Networking
Sensor Network Routing
THE NETWORK LAYER.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Ad Hoc Wireless Routing
Mobile and Wireless Networking
Ad hoc Routing Protocols
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
Intradomain Routing Outline Introduction to Routing
RFC 1058 & RFC 2453 Routing Information Protocol
Proactive vs. Reactive Routing
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Vinay Singh Graduate school of Software Dongseo University
Distance Vector Routing Protocols
Chapter 24 Mobile IP.
DSDV Destination-Sequenced Distance-Vector Routing Protocol
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

Distributed Routing Protocol in Wireless Network Simulation Oct 9, 2001

Wireless Network Routing in ns IP: decide the next hop by looking up the routing table Routing protocol: DSDV, DSR, TORA, AODV MAC: 802.11 PHY: Propagation Model Free Space Model, Two Way Ground Reflection Model, Shadowing Model

Problem in Distributed Simulation TCP/Source N1 ? TCP/Sink N2 N3 N4 proxy proxy Federate A Federate B How to route? Can proxy work? No. We don’t know where we can put the proxies. (unlike wired) How to refer the remote agent?

Solution – Distributed routing protocol TCP/Source N1 ? TCP/Sink N2 N3 N4 gw gw Federate A Federate B Simulation behaves just like in real network A gateway represents a neighboring partition. GWs is a special mobilenode, no position associated. A lot of GW pairs.

Cont. Routing updates Cross boundary data exchange A mobilenode sends the routing messages to all the partitions if applicable through GWs. A mobile node’s routing entry records which GW to go through if needed for the next hop. Cross boundary data exchange The packet containing the source node position will be sent to local GW without loss. The local GW exchanges data with remote GW through RTI Remote GW pretends to be the source node to sends packet to the target node.

Cont Node object reference with IP address Agent object reference with IP address + Port # Avoid invalid object handle/id across/pointer across address space Pro: A federate only need to know its own partition. No knowledge about other partitions is required.