Manet
Download as PPT, PDF8 likes15,833 views
This document summarizes a seminar presentation on Mobile Ad-Hoc Networks (MANETs). It introduces MANETs as networks without infrastructure where nodes can connect in dynamic and flexible topologies. It discusses routing challenges in MANETs due to the dynamic topology. It also summarizes several routing protocols used in MANETs like DSR, DSDV, CGSR, ABR and SSR, which aim to establish and maintain routes between nodes that are moving. Finally, it discusses security and performance issues in MANETs and proposes the dynamic virtual backbone approach to abstract node mobility.
Manet
- 1. Mobile Ad-Hoc Networks(MANET) SEMINAR BY Vinit pareek B.TECH(ECE-8 th sem.) FINAL YEAR(S.B.C.E.T)
- 2. Organization Introduction to Mobile Ad hoc networks (MANETs) Routing in MANETs Virtual Backbone Routing Security Performance measures
- 3. Introducing MANETs Cellular Networks Infrastructure dependent High setup costs Large setup time Reliable MANETs (RFC2051 of IETF) No infrastructure is used Fast setup Flexible and dynamic
- 4. Applications of MANETs Some motivating applications: Casual conferencing low set-up time, cost preferred Battlefield operations/disaster relief infrastructure unavailable Personal area networking devices around the home/office Cellular networks are not preferred.
- 5. Mobile Ad hoc Networks First ad-hoc network was dev. By ARPA called “Packet Radio Networks” had 138 mobile nodes. multi-hop routes between nodes.
- 6. Characteristics of MANETs Dynamic topology links formed and broken with mobility uni-directional links and bi-directional links Constrained resources battery power wireless transmitter range Network partitions A B A B
- 7. Dynamic Source Routing (DSR) Routing is through source routing complete path with each packet Route discovery flooding RREQ till a node replies Route maintainance explicit link breakage notification Mobility of a node can break routes passing through it.
- 8. Route Discovery A route between two nodes is found by sending an Route Request Route Request builds a source route on every path through the network First Route Request to arrive is accepted; target responds on that path and tells initiator what the source route is Source route is used on subsequent data traffic B H I J G F E D A C K Detected Source Route: (A, B, F, J, K)
- 9. Destination Sequenced Distance Vector (DSDV) Modified Distance Vector protocol periodic DV updates High frequency of DV updates topology is dynamic Does not scale well size of DV updates increase high routing overheads
- 10. Clusterhead Gateway Switch Routing (CGSR) A clusterhead is able to control a group of ad-hoc hosts Each node maintains 2 tables: A cluster member table, containing the cluster head for each destination node A DV-routing table, containing the next hop to the destination
- 11. Clusterhead Gateway Switch Routing (CGSR)
- 12. Associativity-Based Routing (ABR) Free from loops, deadlock, and packet duplicates, and defines a new routing metric for ad-hoc mobile networks Hello message exchange periodically b/w neighbours With the temporal stability and the associativity table the nodes are able to classify each neighbor link as stable or unstable.
- 14. Signal Stability Routing (SSR) Based on ABR It selects routes based on signal strength. Can be dynamic or static Advantages: to select strong connection leads to fewer route reconstruction. Drawbacks: long delay since intermediate nodes can’t answer the path (unlike AODV, DSR)
- 15. Security in MANET Access control Kerberos Cryptographyic schemes Packet retransmission Intrusion Detection System(IDS)
- 16. Performance Issues Network size Route acqusition time Connectivity Average no. of data transmitted Fraction of sleeping nodes Routing protocol used
- 17. The Dynamic Virtual Backbone The dynamic virtual backbone is a concept wherein a set of relatively stable routes are formed despite nodes being mobile. a possible way is to abstract mobility through aggregation
- 18. References Wikipedia.org RFC document of IETF. Mobile Computing By Johan Schillar
- 19. THANK YOU ALL