1 / 6

Distributed Routing Protocol in Wireless Network Simulation

Distributed Routing Protocol in Wireless Network Simulation. Oct 9, 2001. Wireless Network Routing in ns. N1. N2. N3. N4. IP: decide the next hop by looking up the routing table Routing protocol: DSDV, DSR, TORA, AODV MAC: 802.11 PHY: Propagation Model

edie
Download Presentation

Distributed Routing Protocol in Wireless Network Simulation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Distributed Routing Protocol in Wireless Network Simulation Oct 9, 2001

  2. Wireless Network Routing in ns N1 N2 N3 N4 • 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

  3. Problem in Distributed Simulation TCP/Source • 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? N1 ? TCP/Sink N2 N3 N4 proxy proxy Federate A Federate B

  4. Solution – Distributed routing protocol TCP/Source • 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. N1 ? TCP/Sink N2 N3 N4 gw gw Federate A Federate B

  5. Cont. • Routing updates • 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.

  6. 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.

More Related