Escolar Documentos
Profissional Documentos
Cultura Documentos
(MNW-883-2K11)
RAHUL KUMAR
(MNW-893-2K11)
Network) (MANET)
(Ad hoc networks are defined as the category of wireless networks that utilize multi hop radio relaying and are capable of operating without the support of ant fix Infrastructure)
network Network topology changes frequently and unpredictably No centralized administration or standard support services Host functions as router also.
Applications
Personal area networking cell phone, laptop, ear phone, wrist watch Military environments soldiers, tanks, planes Civilian environments taxi cab network meeting rooms sports stadiums boats, small aircraft Emergency operations search-and-rescue policing and fire fighting
Many Variations
Fully Symmetric Environment all nodes have identical capabilities and responsibilities Asymmetric Capabilities transmission ranges and radios may differ battery life at different nodes may differ
head)
Security
Energy Management Addressing and service discovery Scalability
Exposed Terminal
Throughput Access delay Fairness Adaptive data rate control
Routing
Mobility
Bandwidth
Error prone and shared channel Location dependent contention Quick route reconfiguration Loop free routing Minimum control overhead
Multicasting
Efficiency
Efficient group management Security
Security
Denial Service
Resource Consumption
Energy Depletion Buffer Flow
Dynamic topology link failure/repair due to mobility Distributed Environment Bandwidth constrained Energy constrained
by the source node When a node requires a route to a destination, it initiates a route discovery process Route is maintained until destination becomes unreachable, or source no longer is interested in destination.
routing information to every other node in the network. Tables need to be consistent and up-to-date view of the network. Updates propagate through the network
Basic Routing Protocol Based on Bellman ford routing algorithm with some
improvement
number of
Incremental update
Example of DSDV
As Routing Table Before Change
Destination A B C D E F Next Hop A B C D D D Distance 0 1 1 1 2 2 Sequence Number S205_A S334_B S198_C S567_D S767_E S45_F
B
C D E F
D
C D D D
3
1 1 2 2
S424_B
S297_C S687_D S868_E S164_F
Uses DSDV as an underlying protocol and Least Cluster Change (LCC) clustering algorithm 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
Disadvantages:
Too frequent cluster head selection can be an overhead and
cluster nodes and Gateway can be a bottleneck Increase the path length Gateway conflicts
shortest path used Eliminates the Count-to-infinity problem and converges faster Neighbor connectivity via periodic Hello messages Update messages sent upon detecting a change in neighbor link
(Destination Identifier, Distance iDj , Predecessor Pj ,the successor Sj), link cost table (Cost, Update Period) Processing Updates and creating Route Table
k as the predecessor For a destination j, a neighbor p is selected as the successor if p->j does not include i, and is the shortest path to j
29
Z
S B A H K I N C E [S,E] F M L
J
[S,C] G D
Node H receives packet RREQ from two neighbors: potential for collision
30
Z
S B A H I [S,C,G] K N C E F [S,E,F] M L
J
G D
Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once
31
Z
S B A H K I [S,C,G,K] N C E F [S,E,F,J] M L
J
G D
32
Nodes J and K both broadcast RREQ to node D Since nodes J and K are hidden from each other, their transmissions may collide
Z
S B A H K I N C E F [S,E,F,J,M] M L
J
G D
Node D does not forward RREQ, because node D is the intended target of the route discovery
33
34
Z
S B A H K I N C E RREP [S,E,F,J,D] F M L
J
G D
in the RREP
When node S sends a data packet to D, the entire route
DATA [S,E,F,J,D]
S B A H K I C E F M
J
G D N
another route from its local cache, if such a route to D exists in its cache. Otherwise, node S initiates route discovery by sending a route request
Node X on receiving a Route Request for some node D can
RERR [J-D]
S B A H K I C E F M
J
G D N
J sends a route error to S along route J-F-E-S when its attempt to forward the data packet S (with route SEFJD) on J-D fails
Nodes hearing RERR update their route cache to remove link J-D 42
from local cache, or replied from cache by other nodes), before finding a good route
An illustration of the adverse impact on TCP will be
tables at the nodes, so that data packets do not have to contain routes
AODV retains the desirable feature of DSR that routes are
AODV
Route Requests (RREQ) are forwarded in a manner similar
to DSR
When a node re-broadcasts a Route Request, it sets up a
Z
S B A H K I N C E F M L
J
G D
Z
S B A H K I N C E F M L
J
G D
Z
S B A H K I N C E F M L
J
G D
Z
S B A H K I N C E F M L
J
G D
Node C receives RREQ from G and H, but does not forward it again, because node C has already forwarded RREQ once
49
Z
S B A H K I N C E F M L
J
G D
50
Z
S B A H K I N C E F M L
J
G D
Node D does not forward RREQ, because node D is the intended target of the RREQ
51
Z
S B A H K I N C E F M L
J
G D
Route Reply (RREP) provided that it knows a more recent path than the one previously known to sender S
To determine whether the path known to an intermediate node is
when using AODV not as high as DSR A new Route Request by node S for a destination is assigned a higher destination sequence number. An intermediate node which knows a route, but with a smaller sequence number, 53 cannot send Route Reply
Z
S B A H K I N C E F M L
J
G D
Forward links are setup when RREP travels along the reverse path
54
Z
S B A H K I N C E F M L
J
G D
Timeouts
A routing table entry maintaining a reverse path is
back
A routing table entry maintaining a forward path is
entry, that entry will be deleted from the routing table (even if the route may actually still be valid)
56
Route Error
When node X is unable to forward packet P (from node S
cached at node X
The incremented sequence number N is included in the
RERR
When node S receives the RERR, it initiates a new route
destination sequence number N, node D will set its sequence number to N, unless it is already larger than N
58
link failure
Alternatively, failure to receive several MAC-level
59
B E
Assume that A does not know about failure of link C-D because
RERR sent by C is lost Now C performs a route discovery for D. Node A receives the RREQ (say, via path C-E-A) Node A will reply since A knows a route to D via node B Results in a loop (for instance, C-E-A-B-C )
60
Loop C-E-A-B-C
61
Summary: AODV
Routes need not be included in packet headers Nodes maintain routing tables containing entries only for
node
DSR may maintain several routes for a single destination
62
Assigns a reference level (height) to each node Adjust reference level to restore routes on link failure
important Query, Update, Clear packets used for creating, maintaining and erasing routes
Creating Routes
QRY UPD QRY UPD
A
QRY UPD C
B
UPD E
UPD QRY D
G (DEST)
Route Maintenance
UPD
A
UPD C
B
E
UPD
D
X
F H
G (DEST)
Performance Analysis
Simulation Environment
Network Simulator, 50 nodes in a 1500x300m rectangular flat
grid Random waypoint mobility (Average 10 m/sec) Constant bit rate traffic (UDP)
Address resolution : ARP implementation in BSD Unix Medium Access Control : IEEE 802.11 Physical Layer model : combines both free space and two
ray ground reflection model Protocols studied : DSDV(SQ), AODV-LL, DSR, TORA
Performance Analysis
Metrics
Packet Delivery Ratio : Ratio of number of packets
generated by CBR sources to that received by CBR sinks at destination Routing Overhead : number of routing packets sent; each transmission counts as one transmission Path Optimality : Difference between length of actual path took and the length of the shortest path
for DSR, AODV Stale route entries in DSDV cause drops Short lived loops in TORA as part of link reversal All protocols perform well when there is low node mobility +
propagating RREQs in DSR TORA Sum of mobility dependant, independent overhead for TORA Congestive collapse Nearly constant for DSDV due to periodic updates
than AODV except at high mobility Smaller packets in AODV, may be more expensive in terms of media access, power and network utilization
Path Optimality
DSDV, DSR use routes
close to optimal TORA not designed to find shortest path TORA, AODV use paths close to optimum when node mobility is low
References
D. Baker, M. S. Corson, P. Sass, and S. Ramanatham, \Flat vs. Hierarchical Network
Control Architecture," ARO/DARPA Workshop on Mobile Ad-Hoc Networking, http://www.isr.umd.edu/Courses/Workshops/MANET/program.html, March 1997. J. Broch, D. B. Johnson, D. A. Maltz, \The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks," IETF Internet Draft draft-ietf-manet-dsr-01.txt, December 1998 (Work in Progress). C.-C. Chiang, M. Gerla, and L. Zhang, \Adaptive Shared Tree Multicast in Mobile Wireless Networks," Proceedings of GLOBECOM '98, pp. 1817{1822, November 1998. C.-C. Chiang, H.K.Wu, W. Liu, and M. Gerla, \Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel," Proceedings of IEEE SICON'97, pp. 197{211, April 1997. M. S. Corson and A. Ephremides, \A Distributed Routing Algorithm for Mobile Wireless Networks," ACM/Baltzer Wireless Networks Jouornal, Vol. 1, No. 1, pp. 61{81, February 1995. R. Dube, C. D. Rais, K.-Y. Wang, and S.K. Tripathi, \Signal Stability based Adaptive Routing
THANK YOU
ANY QUERY???