Documente Academic
Documente Profesional
Documente Cultură
Introduction
What is Ad Hoc Network?
In Latin, ad hoc means "for this," further
meaning "for this purpose only. All nodes are mobile and can be connected dynamically in an arbitrary manner. No default router available. Potentially every node becomes a router: must be able to forward traffic on behalf of others.
DSDV
contd
underlying routing algorithm. Routing is performed over clusterheads and not individual nodes. Requires Table to maintain cluster Membership, in addition to other routing tables. Cluster heads are selected by a Least Cluster Change Algorithm to minimize routing changes
DSDV
DSDV is based on idea of classical Bellman-Ford Routing Algorithm
Each node maintains a routing table listing all available destinations. The attributes of each destination are the next hop, the number of hops to reach to the destination, and a sequence number, which is originated by the destination node.
DSDV
How DSDV addresses the problems? Tagging of distance information:
The destination issues increasing sequence number Other nodes can discard old/duplicate updates
What is on-demand
The routes are created when required The source has to discover a route to the
destination. The source and intermediate nodes have to maintain a route as long as it is used. Routes have to be repaired in case of topology changes.
The source broadcasts a route packet The neighbors in turn broadcast the source RREQ packet till it reaches the destination
destination
RREP Reply packet follows the reverse path of route request packet recorded in broadcast packet
The node discards the packets having been seen
Route Maintenance
If the source node moves, it reinitiates the
route discovery. If intermediate node moves, its upstream node sends a RREP to the source. The source restarts the route discovery.
Route discovery
The source sends a broadcast packet which
contains source address, destination address, request id and path. If a host saw the packet before, discards it. Otherwise, the route looks up its route caches to look for a route to destination, If not find, appends its address into the packet, rebroadcast, If finds a route in its route cache, sends a route reply packet, which is sent to the source by route cache or the route discovery.
source
1
(1,4)
4
destination
(1,2)
(1,3,5)
(1,3,5,6)
The route looks up its route caches to look for a route to destination If not find, appends its address into the packet
Route maintenance
Whenever a node transmits a data packet, a
route reply, or a route error, it must verify that the next hop correctly receives the packet. If not, the node must send a route error to the node responsible for generating this route header The source restart the route discovery
The source broadcasts a QRY packet with height(D)=0, all others NULL (0,0,0,3,a) (-,-,-,-,a) QRY (-,-,-,-,d) (0,0,0,2,d)
d
source
UPD
Dest.
(0,0,0,0,h)
(-,-,-,-,g) (0,0,0,1,g)
f
(-,-,-,-,b) (0,0,0,4,b)
e
(-,,-,-,-e) (0,0,0,3,e)
(0,0,0,2,f) (-,-,-,-,f)
A node receiving a UPD sets its height to one more than UPD Source receives a UPD with less height
(0,0,0,2,d)
d
h c b
Dest.
(0,0,0,0,h)
(0,0,0,4,c)
g
(0,0,0,1,g)
f
(0,0,0,4,b)
e
(0,0,0,2,f) (0,0,0,3,e)
UDP
h c b
Dest.
(0,0,0,0,h)
(0,0,0,4,c)
g
(0,0,0,1,g)
f
(0,0,0,4,b)
e
(0,0,0,2,f) (0,0,0,3,e)
Associativity table
All nodes generate periodic beacons When a neighbor node receives a beacon, it
increases its associativity tick with respect to the sending node in associativity table Associativity ticks are reset when the neighbors of a node or the node itself move out of proximity
Route Discovery
The source broadcast a QRY message Each intermediate node appends its address
and associativity ticks to QRY, The destination can examine the associativity ticks to select route. If the multiple paths have the same overall degree of stability, select the minimum number of hops
Route Erasing
If the the route is no longer desired, the
source may not be aware of any route node changes because partial reconstruction.
Conclusion
Overview
On-Demand Overall complexity Overhead Loop-free Beaconing requirements Multiple route support Routes maintained in Route reconfigurati on methodology Routing metric AODV Medium Low Yes No No Route table Erase route; notify source DSR Medium Medium Yes No Yes Route cache Erase route; notify source TORA High Medium Yes No Yes Route table Link reversal; route repair ABR High High Yes Yes No Route table Localized broadcast query Associativity and shortest path and others SSR High High Yes Yes No Route table Erase route; notify source
Shortest path
Shortest path
Reference
1.
2.
3. 4. 5. 6. 7. 8. 9. 10.
Routing Protocols for Ad Hoc Mobile Wireless Networt by Padmini Misra, ftp://ftp.netlab.ohio-state.edu/pub/jain/courses/cis78899/adhoc_routing/index.html#CBRP A Comparison of On-Demand and Table Driven Routing for Ad-Hoc Wireless Networks, by Jyoti Raju and J.J. Garcia-Luna-Aceves, http://www.soe.ucsc.edu/~jyoti/paper2/ A New Routing Protocol for the Reconfigurable Wireless Networks, Zygmunt J Hass Caching strategies in on-demand routing protocols for wireless ad hoc networks, by Yih-chun hu and Divid B. Johnson, http://monarch.cs.cmu.edu Highly Dynamic Destination-Sequenced Distance-Vector Routing for Mobile Computers, Pravin Bhagwat, Charles E. Perkins Dynamic source routing in ad hoc wireless networks, by David B. Johnson and David A. Maltz, http://www1.ics.uci.edu/~atm/adhoc/paper-collection/johnson-dsr.pdf A Performace Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols, Josh Broch etc An Efficient Routing Protocol for Wireless Netwrok, Shree Murthy etc Temporally-Ordered Routing Algorithm (TORA) Version 1 Funtional Specification, by V. Park, S. Corson, http://www1.ics.uci.edu/~atm/adhoc/papercollection/corson-draft-ietf-manet-tora-spec-00.txt Ad Hoc On Demand Distance Vector (AODV) Routing, by Charles Perkins, http://www1.ics.uci.edu/~atm/adhoc/paper-collection/perkins-draft-ietf-manet-aodv00.txt
Reference (cont.)
7. 8.
An Introduction to Mobile Ad Hoc Network, by Ming Yu Jiang, http://kiki.ee.ntu.edu.tw/mmnet1/adhoc/ Scalable Routing Strategies for Ad hoc Wireless Network, by Atsushi Iwata , Ching-Chuan Chiang etc. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols, by Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, Jorjeta Jetcheva, http://www1.ics.uci.edu/~atm/adhoc/paper-collection/johnsonperformance-comparison-mobicom98.pdf Fisheye State Routing: A Routing Schema for Ad Hoc Wireless Networks, by guangyu Pei, Mario Gerla, Tsi-Wei Chen A review of current Routing protocols for ad-hoc Mobile Wireless Networks, by Elizabeth M. Royer and C-K Toh http://www.cs.ucsb.edu/~vigna/courses/CS595_Fall01/royer99review.pdf CEDAR: a Core-Extraction distributed Ad Hoc Routing Algorithm, Prasun Sinha, Vaduvur Nharghavan, etc Mobile computing today & in the future, by M.J. Fahham and M.K. Hauge. http://www.doc.ic.ac.uk/~nd/surprise_95/journal/vol4/mjf/report.html Performance Comparison of On-demand Routing Protocols in Ad Hoc Network by Sohela Kaniz http://fiddle.visc.vt.edu/courses/ecpe6504wireless/projects_spring2000/pres_kaniz.pdf
9.
10.
11.
12. 13. 14.