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

A Performance Comparison of MultiHop Wireless Ad Hoc Network Routing Protocols MOBICOM 1998 Dallas Texas Josh Broch David Maltz David Johnson Yih Chun Hu and Jorjeta Jetcheva Computer. g shooter detection Goals of clock synchronization Compensate offset between clocks Compensate drift between clocks terms are explained on following slides Time Synchronization Sensing Localization Duty Cycling TDMA Ad Hoc and Sensor Networks Roger W Maltz David B Johnson YihChun Hu Jorjeta Jetcheva Computer Science Department Carnegie Mellon University Pittsburgh PA 15213 httpwwwmonarchcscmuedu Abstract An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary n free because waste a lot bandwidth and packets inay never reach their destination. route failures and a stable a result of node protocol should handle stale and types the free that few become isolated Michael . Schapira. (Yale University . and . UC Berkeley). Joint work with . Yaping. Zhu . and . Jennifer Rexford . (Princeton University). Once Upon a Time… . Internet Inter-Network Routing:. . in . Storing and Non-Storing . Modes. draft-. ko. -roll-mix-network-. pathology. JeongGil Ko. , . J.Jeong. , . J.Park. , . J.Jun. , . N.Kim. , . O.Gnawali. 2012/11/05. IETF 85th Meeting -- Atlanta, GA. VANETs. SAMEERA SIDDIQUI. PhD STUDENT. UNIVERSITY OF OTTAWA. 0. Introduction . Problems in Routing Procedures. Classification Of Routing Protocols. Taxonomy of Previous Literature. Objective of the Project. THE . Nineth. MEETING. Wireless networking in general:. Wireless networks typically work by one of the . configuration network . topology . either . Ad-Hoc or Infrastructure network.. Topology on Network consists of. Michael . Schapira. Joint work with . Yaping. Zhu . and . Jennifer Rexford. (Princeton University). Once Upon a Time… . Internet Inter-Network Routing:. . Small network. Single administrative entity. Communication . Networks. . Materials with thanks to Scott . Shenker. ,. . Jennifer Rexford, Ion . Stoica. , Vern . Paxson. and other colleagues at Princeton and UC Berkeley. Wireless. . – there is no cat!. Addressing routing scalability issues. NSF Ignite Project . 1. Routing protocol challenges . All Routing . P. rotocols face. S. calability issues – dependency on network size. Flooding on information changes. By . Ian Cavitt. Arbitrary Physical Node. Essentially a dummy node. More Utility, Higher Cost. Create hierarchy, obfuscate location information, addition to TAP countermeasures, increase cost of specific attacks. Broch. et al. Presented by Brian Card. 1. Outline. Introduction. NS enhancements. Protocols:. DSDV. TORA. DRS. AODV. Evaluation. Conclusions. 2. 3. Node1. Node2. Node3. Node4. Introduction. 4. Node1. Routing Distance Vector (DV) Routing Sets up minimum distance routes to all nodes in a network Routing tables created at each node with following fields: The core algorithm is based on ‘ Bellman Ford shortest path algorithm Simon S. Lam. The University of Texas at Austin. (Based on joint work with Chen . Qian. ). Keynote, IEEE ICNP, October 31, 2012. Multi-hop DT (Simon S. . Lam. ). 2. Delaunay triangulation (DT)?. A set of point in 2D.