6610-l18- - Ad-hoc Routing 1 Puzzle Monty Hall Problem You...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Ad-hoc Routing
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Puzzle Monty Hall Problem You are a contestant on a game show. In front of you are three closed doors. The game show host informs you that behind one of these doors is the motor car of your dreams, but behind the other two doors lies a peanut (which you're allergic to anyway!). The quiz-master asks you to select a door. After you have selected, he then opens one of the other two doors that does not contain the car. He does this every week to build up the suspense for the watching millions. He asks if you would like to open the door you originally selected and take home that prize, or switch to the remaining door and go home with that prize. Is it in your best interests to switch, or to remain with your original selection ?
Background image of page 2
Exam 2 In class, 11/5 Closed book, no calculators, no cheat sheets Topics (in decreasing order of importance): Topics since exam 1 (wireless scheduling, mobile IP/mobility support, wireless transport, ad-hoc networks – including today’s discussions) PA2/PA3 Old topics (networking basics, wireless data networks, wireless MAC)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Exam 2 Topics Wireless scheduling Why do wireline scheduling algorithms not work well in wireless environments? What are the key solution components to handle scheduling in wireless environments? What are the different approaches to realize these components? Mobility support Why does IP have issues in mobile environments? How is this handled by mobile IP? Other approaches to handle mobility? Wireless transport Why does TCP have issues in wireless/mobile environments? What are the solutions to address these approaches? Ad-hoc networks Routing
Background image of page 4
5 Dynamic Source Routing Based on source routing On-demand Route computation performed on a per-connection basis Source, after route computation, appends each packet with a source-route Intermediate hosts forward packet based on source route
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 DSR – Basic Operation When higher layer gives DSR a packet to transmit, and there exists no route in the route-cache, route computation is performed Source S floods the network with a RREQ (route request) packet for the destination D Every host I that receives the RREQ packet checks to see if I=D. If not, I adds its identifier to the RREQ packet header and forwards the packet
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/14/2009 for the course ECE 6610 taught by Professor Staff during the Fall '08 term at Georgia Institute of Technology.

Page1 / 31

6610-l18- - Ad-hoc Routing 1 Puzzle Monty Hall Problem You...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online