Partial preview of the text
Download Routing Algorithm in Ad-Hoc Network(Mobile Computing) and more Lecture notes Mobile Computing in PDF only on Docsity!
one ne a " Jess ne works ith infrag tion can always y Ww) tructur t a © support a base stati “hoe networks, each node must be able a ut some P roblems or difference from wii, monk 20 other nodes which additional routing protocols are defined f eae a8 followa or ad-hoc networks. These 1. Asymmetric Links: In cage i of ad- symmetric that is a link fro ad-hoc networks the links are not m node A t 9, Redundant-Links : In adhocn : etw i i of redundancy but the routing aedthete de seed ‘ue signe i networks are made so as to handle low ‘edunditney and etl they fail-in case of adhoc networks, = 3. Interference: In adhoc networks links come and go depending on the transmission characteristics, one transmission might interfere with another, and nodes might overhear the transmission of other nodes . Thus, it creates the problem of unplanned links between nodes. 4, Dynamic Topology: Since the topology changes very rapidly thus , the snapshots.available are valid for very small time only. In adhoc networks the routing tables must reflect these changes. Routing algorithms for wired networks will either react very slowly or with too many updates for this type of topology. 9.5 ROUTING PROTOCOLS FOR AD HOC NETWORKS This section discusses proposed routing protocols for these ad hoc networks. en Ad hoc routing protocol is a convention or standard that controls how nodes come to agree which way to route packets between computing devices ina mobile ad-hoc network (MANET). ~Inad hoc networks, nodes do not have a priori knowledge of topology of "network around them; they have to discover it: The basic idea is that a new node (optionally) announces its presence and listens to broadcast . announcements from its neighbours. The node learns about new near nodes and ways to reach them, and may announce that it can also = those nodes, As time goes on, each node knows about all other nodes an e them. These routing protocols can be one or more ways how to reach divided into two ete gories based on when and how the routes are discovered. * Pro-active Routing or table-driven Protocols. * Reactive Routing or On-demand routing Protocols. ° Hybrid @ro-Active/Reactive)- oo Scanned by CamScanner 
