Ant Colony Based Node Disjoint Hybrid Multi-path Routing for Mobile Ad Hoc Network

Transcription

1 Journal of Computer Scence 4 (2): 80-86, 2008 ISSN Scence Publcatons Ant Colony Based Node Dsjont Hybrd Mult-path Routng for Moble Ad Hoc Network 1 B. Kalaavath, 2 K. Duraswamy 1 Department of Informaton Technology, K.S. Rangasamy College of Technology, KSR Kalv Nagar, Truchengode , Inda 2 Dean, K.S. Rangasamy College of Technology, KSR Kalv Nagar, Truchengode , Inda Abstract: Moble Ad hoc Networks are characterzed by mult-hop wreless lnks, wthout any nfrastructure and frequent node moblty. A class of ant colony based routng protocols has recently ganed attenton because of ther adaptablty to the network changes. AntHocNet s ant colony based hybrd algorthm, whch combnes reactve path setup wth proactve path probng, mantenance and mprovement. Mult-path routng represents a promsng routng method for moble ad hoc network. Mult-path routng acheves load balancng and s more reslent to route falures. Ths research ntroduces node dsjont mult-path property to AntHocNet routng algorthm. A vrtual class room s one that can be establshed by usng moble devces and whose members can be dynamcally added or removed. The mplementaton of vrtual class room for lesson handlng and query dscusson usng moble ad hoc network s analyzed. The data are spread among the N (here N = 3) node dsjont routes from the begnnng of the data transmsson sesson. The performance metrcs, average end-to-end delay, packet delvery rato and load balancng have been analyzed for varous pause tmes. The average end-to-end delay and packet delvery rato have not vared sgnfcantly. Optmal load dstrbuton s acheved by spreadng the load among dfferent node dsjont routes. Keywords: Moble ad hoc network, ant colony optmzaton, personal dgtal assstant, vrtual class room, anthocnet INTRODUCTION A moble ad hoc network s a collecton of moble nodes that can communcate wth each other usng mult-hop wreless lnks wthout utlzng any fxed base staton nfrastructure and centralzed management. Each node n the network acts as both a host and a router. The desgn of an effcent and relable routng protocol n such a network s a challengng ssue. Exstng IP protocols can be classfed ether as proactve or reactve [1]. Proactve protocols attempt to contnuously evaluate all the routes wthn a network-so that when a packet needs to be forwarded, a route s already known and can be mmedately used. It s well known that proactve protocols are not optmal for Moble Ad Hoc Networks (MANET) whch have rapdly changng topologes. In contrast, reactve routng protocols nvoke a route determnaton procedure on-demand only. Thus, f route s needed some sort of global search procedure s used. Ondemand routng protocols n partcular, are wdely developed because they consume much less bandwdth than proactve protocols. Ad hoc On-Demand Dstance Vector (AODV)] and Dynamc Source Routng (DSR) are the two most wdely studed on-demand ad hoc routng protocols. The lmtaton of these protocols s that both of them buld and rely on a unpath route for each data sesson. Whenever there s a lnk break on the actve route, each of the two routng protocols has to nvoke a route dscovery process. Each route dscovery flood s assocated wth sgnfcant latency and overhead. In addton, reactve protocols ntroduce addtonal latency for real-tme traffc. Hybrd routng protocols that use a mx of both proactve and reactve routng technques are proposed to combne the merts of both and overcome ther shortcomngs. In practce, many algorthms are hybrd algorthms [1] (e.g., ZRP- Zone Routng Protocol. HARP-Hybrd Ad Hoc Routng Protocol, AntHocNet [2] ) usng both proactve and reactve components. In ZRP and HARP, each node mantans only routng nformaton for those nodes that are wthn ts zone and ts neghbourng zones. They exhbt proactve behavour wthn a zone and reactve between zones. The route to each destnaton wthn a Correspondng Author: B. Kalaavath, Department of Informaton Technology, K.S. Rangasamy College of Technology, Truchengode , Inda 80

2 zone s easly establshed wthout delay, whle a route dscovery and route mantenance are requred for every other destnaton. AntHocNet s a hybrd algorthm based on the framework of Ant Colony Optmzaton (ACO). It does not mantan paths to all destnatons at all tmes, but sets up paths when they are needed at the start of a sesson. Ths s done n a reactve path setup phase, where ant agents called reactve forward ants are used. Whle a data sesson s gong on, the paths are probed, mantaned and mproved proactvely usng dfferent ant agents called proactve forward ants. AntHocNet reacts to lnk falures wth ether local repar or by warnng precedng nodes on the paths. Multpath routng conssts of fndng multple routes between a source and destnaton node. Multpath routng protocols can attempt to fnd node dsjont, lnk dsjont or non-dsjont routes. Multple paths can provde load balancng, fault-tolerance and hgher aggregate bandwdth [3]. Ths research ACNDHMR - Ant Colony based Node Dsjont Hybrd Mult-path Routng proposes to ntegrate node dsjont feature nto the AntHocNet to provde load balancng, fault- tolerance and reduce endto-end delay. The basc dea of the ACO s taken from food searchng behavour of real ants. When ants are on the way to search for food, they start from ther nest and walk toward the food. Whle walkng, ants depost a pheromone, whch ants are able to smell, whch helps to mark the route taken. The concentraton of pheromone on a certan path s an ndcaton of ts usage. Wth tme the concentraton of pheromone decreases due to dffuson effects. Ths s mportant because t ntegrates the dynamc property nto the path searchng process. In the next secton the prevous work related ant based routng algorthms are brefly revewed. Then the ACNDHMR s descrbed. In the results and dscussons secton the ACNDHMR performance s compared wth the AntHocNet by means of mplementaton of Vrtual Class Room [4]. Here the data packets are spread among N (N = 3) number of optmal routes. Fnally the result of the work done s summarzed ANT BASED ROUTING PROTOCOLS ACO approaches are nspred by the problem solvng paradgms of ants rather than buldng exact replcas of bologcal ants. In addton, there have been several works that apply to the dea of ant routng. The frst ACO routng algorthms were desgned for wred networks (e.g., AntNet [1] for packet swtched networks and ABC [1] for crcut-swtched networks). These algorthms exhbt a number of nterestng propertes whch are also desrable for MANET routng: they can J. Computer Sc., 4 (2): 80-86, work n a fully dstrbuted way, are hghly adaptve to network and traffc changes, provde mult-path routng and data spreadng. However the fact that they crucally rely on repeated path samplng whch can cause sgnfcant overhead f not dealt wth carefully. There have already been some attempts to desgn ACO routng algorthms for MANETs. Examples are ARA [1], PERA [1], Termte [1] and AntHocNet [2]. However, these algorthms ARA, PERA and Termte loose much of the proactve samplng and exploratory behavour of the orgnal ant-based algorthms. AntHocNet s a hybrd routng algorthm consstng of both reactve and proactve components. When a communcaton sesson s started at a source node s, ths node starts a reactve path setup phase, n whch ant agents called reactve forward ants are spread over the network n order to fnd the destnaton d of the sesson. They follow exstng routng nformaton f avalable and are otherwse broadcast. The frst ant to fnd d becomes a reactve backward ant whch returns to s, settng up entres n the pheromone tables of ntermedate nodes ndcatng a path between s and d. They ndcate n a node the qualty of gong over a certan next hop to reach a certan destnaton. Durng the duraton of a communcaton sesson, the algorthm tres to proactvely mprove the exstng paths. To facltate ths process, nodes nclude pheromone nformaton they have about actve destnatons n ther hello messages. A node s consdered an actve destnaton f data have recently been forwarded to t. Hello messages are short messages broadcast to all neghbors at regular ntervals. The pheromone nformaton forwarded from node to node n hello messages spreads over the network n a process whch s termed as pheromone dffuson, n analogy wth the volatle and dffusve character of ant pheromone n nature. The pheromone dffuson creates a feld ndcatng possble paths to the destnatons. Ths feld, whch s bult up of bootstrapped nformaton, contans potentally unrelable nformaton and t s mportant to verfy t before t can be used safely by data. To ths end, the source node of each communcaton sesson perodcally sends out proactve forward ants durng the course of the sesson, whch follow the dffused pheromone n order to fnd new and better paths. In ths way, the sngle path whch s set up durng the route setup phase s extended to a mesh of multple paths. Data are spread concurrently across these paths, wth a strong preference for the best path. Lnk falures are dealt wth ether by usng local route repar or by warnng precedng nodes on the paths.

3 Fg. 1: (a): Node (c): Non-dsjont dsjont; (b): Lnk dsjont and However, the multple routes generated by the AntHocNet are non-dsjont routes. Non-dsjont routes can have nodes and lnks n common. Refer to Fg.1 for examples of the dfferent knds of mult-path routes. Dsjont routes offer certan advantages over nondsjont routes. For nstance, non-dsjont routes may have lower aggregate resources than dsjont routes, because non-dsjont routes share lnks or nodes. In prncple, node dsjont routes offer the most aggregate resources, because nether lnks nor nodes are shared between the paths. Dsjont routes also provde hgher fault-tolerance. When usng non-dsjont routes, a sngle lnk or node falure can cause multple routes to fal. In node or lnk dsjont routes, a lnk falure wll only cause a sngle route to fal. However, wth lnk dsjont routes, a node falure can cause multple routes that share that node to fal. Thus, node dsjont routes offer the hghest degree of fault-tolerance. The man advantage of non-dsjont routes s that they can be more easly dscovered. Because there are no restrctons that requre the routes to be node or lnk dsjont, more non-dsjont routes exst n a gven network than node or lnk dsjont. Because node dsjontedness s a strcter requrement than lnk dsjontedness, node-dsjont routes are the least abundant and are the hardest to fnd. It has been found [10] that n moderately dense networks, there may only exst a small number of node dsjont routes between any two arbtrary nodes, especally as the dstance between the nodes ncreases. Ths s because there may be sparse areas between the two nodes that act as bottlenecks. Gven the trade-offs between usng node dsjont versus non-dsjont routes, node dsjont routes offer a good compromse between the two. In the followng subsecton, some of the proposed mult-path protocols for fndng node dsjont, lnk dsjont and non-dsjont paths are revewed. After a source begns sendng data along multple routes, some or all of the routes may break due to node moblty and/or lnk and node falures. In unpath routng, route mantenance J. Computer Sc., 4 (2): 80-86, must be performed n the presence of route falures. In the case of mult-path routng, route dscovery can be trggered each tme one of the routes fals or only after all the routes fal. Watng for all the routes to fal before performng a route dscovery would result n a delay before new routes are avalable. Ths may degrade the QoS of the applcaton. However, ntatng route dscovery every tme one of the routes fals may ncur hgh overheads. Performng route dscovery when N routes fal, where N s less than the number of paths avalable, may be a compromse between the two optons. Splt Multpath Routng [SMR] proposed n [12] s an on-demand mult-path source routng protocol. SMR s smlar to DSR and s used to construct maxmally dsjont paths. Unlke DSR, ntermedate nodes do not keep a route cache and therefore, do not reply to route requests (RREQ). Ths s to allow the destnaton to receve all the routes so that t can select the maxmally dsjont paths. Maxmally dsjont paths have as few lnks or nodes n common as possble. Duplcate RREQs are not necessarly dscarded. Instead, ntermedate nodes forward RREQs that are receved through a dfferent ncomng lnk and whose hop count s not larger than the prevously receved RREQs. SMR algorthm only selects two routes. However, the algorthm can be extended to select more than two routes. In the algorthm, the destnaton sends a route reply (RREP) for the frst RREQ t receves, whch represents the shortest delay path. The destnaton then wats to receve more RREQs. From the receved RREQs, the path that s maxmally dsjont from the shortest delay path s selected. If more than one maxmally dsjont path exsts, the shortest hop path s selected. If more than one shortest hop path exsts, the path whose RREQ was receved frst s selected. The destnaton then sends an RREP for the selected RREQ. AOMDV [13] s an extenson to the AODV protocol for computng multple loop-free and lnk-dsjont paths. To keep track of multple routes, the routng entres for each destnaton contan a lst of the nexthops along wth the correspondng hop counts. All the next hops have the same sequence number. For each destnaton, a node mantans the advertsed hop count, whch s defned as the maxmum hop count for all the paths. Ths s the hop count used for sendng route advertsements of the destnaton. Each duplcate route advertsement receved by a node defnes an alternate path to the destnaton. To ensure loop freedom, a node only accepts an alternate path to the destnaton f t has a lower hop count than the advertsed hop count for that destnaton. Because the maxmum hop count s used, the advertsed hop count therefore does not change for

4 the same sequence number. When a route advertsement s receved for a destnaton wth a greater sequence number, the next-hop lst and advertsed hop count are rentalzed. AOMDV can be used to fnd node-dsjont or lnk-dsjont routes. To fnd node-dsjont routes, each node does not mmedately reject duplcate RREQs. Each RREQ arrvng va a dfferent neghbor of the source defnes a node-dsjont path. Ths s because nodes cannot broadcast duplcate RREQs, so any two RREQs arrvng at an ntermedate node va a dfferent neghbor of the source could not have traversed the same node. In an attempt to get multple lnk-dsjont routes, the destnaton reples to duplcate RREQs regardless of ther frst hop. To ensure lnkdsjontness n the frst hop of the RREP, the destnaton only reples to RREQs arrvng va unque neghbors. After the frst hop, the RREPs follow the reverse paths, whch are node-dsjont and thus lnk-dsjont. The trajectores of each RREP may ntersect at an ntermedate node, but each takes a dfferent reverse path to the source to ensure lnk-dsjontness. AODVM [14] s an extenson to AODV for fndng multple node dsjont paths. Intermedate nodes are not allowed to send a route reply drectly to the source. Also, duplcate RREQ packets are not dscarded by ntermedate nodes. Instead, all receved RREQ packets are recorded n an RREQ table at the ntermedate nodes. The destnaton sends an RREP for all the receved RREQ packets. An ntermedate node forwards a receved RREP packet to the neghbor n the RREQ table that s along the shortest path to the source. To ensure that nodes do not partcpate n more than one route, whenever a node overhears one of ts neghbors broadcastng an RREP packet, t deletes that neghbor from ts RREQ table. Because a node cannot partcpate n more than one route, the dscovered routes must be node-dsjont. ACNDHMR s desgned wth three components [3] route dscovery, route mantenance and traffc allocaton and they are dscussed n the followng subsectons. Route dscovery: When a source node s starts a communcaton sesson wth a destnaton node d, t broadcasts a reactve forward ant. At each node, the forward ant s broadcasted, provded t s not a duplcate. The duplcate forward ants are gnored by the ntermedate nodes, whch avods loop and results n certan number of node dsjont routes at the destnaton. The destnaton d receves all the ncomng forward ants and mantans ther route n a table. Each forward ant keeps a lst of the nodes t has vsted. Upon arrval at the destnaton d, t s converted nto a backward ant, whch travels back to the source J. Computer Sc., 4 (2): 80-86, retracng the path. At each ntermedate node, comng from neghbor n, the ant updates the entry Τ nd whch s the pheromone value ndcatng the estmated goodness of gong from over neghbour n to reach the destnaton d, n the 's pheromone table. The way the entry s updated depends on the path qualty metrcs used to defne pheromone varables. For nstance, f the pheromone s expressed usng the number of hops as a measure of goodness, at each hop the backward ant ncrements an nternal hop counter and uses the nverse of ths value to locally assgn the value τ d whch s used to update the pheromone varable Τ nd nd Τ = γτ nd γ was set to 0.7 n the experments. + ( 1 γ) τ γ [ 0,1] d as follows, Route mantenance: Durng the course of a communcaton sesson, source node s perodcally sends out proactve forward ants to update the nformaton about currently used paths and try to fnd new and better paths. However, the receved proactve forward ant s paths are compared wth the already stored paths by the destnaton d for achevng node dsjontness. The destnaton d sends proactve backward ants only for the ants wth the dsjont paths and others are gnored. The proactve ants follow pheromone and update pheromone tables n the same way as reactve forward ants. Such contnuous proactve samplng of paths s the typcal mode of operaton n ACO routng algorthms. Traffc allocaton: Once the source node has selected a set of paths to the destnaton, t can begn sendng data to the destnaton along the paths. The traffc allocaton strategy used deals wth how the data s dstrbuted amongst the paths. The choce of allocaton granularty s mportant n traffc allocaton. The allocaton [7] granularty specfes the smallest unt of nformaton allocated to each path. For nstance, a per-connecton granularty would allocate all traffc for one connecton to a sngle path. A per-packet granularty would dstrbute the packets from multple connectons amongst the paths. A per-packet granularty results n the best performance. Ths s because t allows for fner control over the network resources. It s dffcult to evenly dstrbute traffc amongst the paths n the perconnecton case, because all the connectons experence dfferent traffc rates. If a round-robn traffc allocaton approach s used, however, a per-packet granularty may result n packets arrvng out-of-order at the

5 destnaton. Packet reorderng s an ssue that needs to be dealt wth n mult-path routng, possbly at the transport layer. Nodes n ACNDHMR forward data stochastcally accordng to the pheromone values. In order to explot a maxmum number of the avalable routes, route optmalty should be consdered n such a way to transmt more packets on the most optmal routes, thereby dspersng data load over a maxmum number of nodes. The number of node dsjont routes N (here N = 3) s assgned. Data are spread based upon the probablty of that route. Lnk Falures: Nodes can detect lnk falures (e.g., a neghbor has moved away) when uncast transmssons (of data packets or ants) fal, or when expected hello messages were not receved. When a neghbor s assumed to have dsappeared, t removes the neghbor from ts neghbor lst and all the assocated entres from ts routng table. If the event was a faled transmsson of a control packet, the node broadcasts a lnk falure notfcaton message. All ts neghbors receve the notfcaton and update ther pheromone table. If the number of node dsjont route N becomes 1 or 0, the route fndng process s rentated. RESULTS AND DISCUSSION The above mentoned algorthm s mplemented to form a Vrtual Class Room (VCR). A vrtual classroom [4] s one that can be mmedately establshed and whose members can be dynamcally added or removed; the group structure of the members can be reorganzed dynamcally. Fgure 2 llustrates such an dea. The ad hoc classroom can support urgent and tmely learnng actvtes, thus mprovng learnng effectveness. For example [9], a teacher may establsh a vrtual classroom from hs resdence, students located around can take the opportunty to form an ad hoc group to mprove the teachng learnng process at any tme usng IEEE802.11g. VCR based on ad hoc network has been constructed [8] as shown n Fg. 2. The network has been formed wth 30 PDA nodes. Each node n the network s assgned wth statc IP address. The software components used for development are Mcrosoft Vsual Studo C#.Net 2005, Wndows Moble 5.0 Pocket PC SDK, Mcrosoft ActveSync Verson 4.2 and Mcrosoft.Net Compact Framework 2005 and XML technology. The XML technology was used for provdng descrpton and representaton of data and control packets. The applcaton allows the user to ntate a query sesson wth the peer or to lesson handlng. The lesson J. Computer Sc., 4 (2): 80-86, Hostel 3 50 m 70 m 30 m Hostel 2 10 m Staff resdence 10 m Hostel 1 Fg.2: A scenaro of VCR usng MANET fle can nclude multmeda data lke mage, audo and vdeo. Whenever a student (who s source of the communcaton sesson) wants to dscuss any topc wth another student or wth a staff (who s the destnaton of the communcaton sesson), he can ntate a query sesson by selectng the destnaton from the member lst dsplayed. To support transfer any type of fle, UUEncode (Unx to Unx Encode) s used to convert the fle contents nto ASCII characters, whch can be transmtted over the network. At the destnaton sde UUDecode s used to get back the orgnal contents of the fle. Fgure 3 depcts the average end-to-end delay of AntHocNet and ACNDHMR for dfferent pause tmes. It s larger for low pause tme n whch the nodes are hghly moble and t s smaller for hgh pause tmes. The drop n delay for hgh pause tme s due to proactve path mprovements, whch s based on path delay. Fgure 4 shows the packet delvery rato of AntHocNet and ACNDHMR for dfferent pause tmes. The drop n delvery rato for the hghest pause tmes s due to connectvty ssues. The nodes can become dsconnected from the network for a certan tme. For the hghest pause tmes, these perods of lost connectvty, n whch no packets can be delvered, can be long. Fgure 5 depcts the standard devaton (SD) of the routng load. The SD of the routng load n ACNDHMR s observed to be low compared to AntHocNet especally when the moblty s more (when the pause tme s less). Ths s because wth hgh moblty, lnk breaks are common whch leads to local route repar or

6 Average end-to-end packet delay (seconds) ACNDHMR Moblty (Pause Tme n Seconds) J. Computer Sc., 4 (2): 80-86, 2008 AntHocNet Fg. 3: Average End-to-End packet delay for varous pause tmes Packet Delvery Rato ACNDHMR AntHocNet Moblty (Pause Tme n Seconds) Fg. 4: Packet delvery rato for varous pause tmes Standard Devaton of routng load ACNDHMR AntHocNet Moblty (Pause Tme n seconds) Fg. 5: Standard devaton of routng load for varous pause tmes lnk falure notfcaton to the source nodes along the path. Upon lnk break, AntHocNet needs to ntate new 85 route request and ths adds sgnfcantly to the routng overhead. The low SD of ACNDHMR shows that every node n the network has almost equal routng overhead. Ths ncreases the mean tme to falure of the nodes and the stablty of the network. CONCLUSION In ths research, the Ant Colony based Node Dsjont Hybrd Mult-path Routng Protocol has been presented. ACNDHMR s a hybrd routng protocol that establshes multple node dsjont routes between a source destnaton par and swtches between the routes based on a heurstc. Ths heurstc takes the current network condtons (lke hop count, propagaton delay, queung delay and node dsjontness) nto consderaton. Provdng multple paths s useful n ad hoc networks because when one of the routes s dsconnected, the source can smply use other avalable routes wthout performng the route dscovery process agan. The expermental results ndcate that ACNDHMR outperforms AntHocNet because multple routes provde robustness to moblty. The performance dfference becomes evdent snce the load s dstrbuted evenly to all the nodes, whch help n network stablty. ACKNOWLEDGEMENTS We would lke to acknowledge All Inda Councl for Techncal Educaton, Inda for provdng the grant to support ths project under Research Promoton Scheme. Grant number s 8023/RID/BOR/RPS- 79/ REFERENCES 1. Changln Lu and Jorg Kaser, Techncal Report. A Survey of Moble Ad Hoc Network Protocols, Unversty of Magdebur, Germany. 2. Gann D Caro, Frederck Ducatelle and Luca Mara Gambardella, AntHocNet: An adaptve nature-nspred algorthm for routng n moble ad hoc networks. Eur. Trans. Telecommun., 16: Stephen Muller, Rose P. Tsang and Dpak Ghosal, Invted research n Lecture Notes n Computer Scence, Multpath Routng n Moble Ad Hoc Networks: Issues and Challenges. 4. B.Kalaavath and Dr.K.Duraswamy, Implementaton of Ant Colony based Hybrd Mult-path Routng Algorthm for Vrtual Class Room usng Moble Ad Hoc Network, GESTS Internatonal Transactons on Computer Scence and Engneerng, Volume 43, Number 1,2007, pp:

7 J. Computer Sc., 4 (2): 80-86, Ducatelle F., G. D Caro and L.M. Gambardella, An analyss of the dfferent components of the Anthocnet routng algorthm. Proceedngs of the 50th Internatonal Workshop on Ant Colony Optmzaton and Swarm Intellgence (ANTS 2006), August 25, 2006Brussels, Belgum, pp: do: / Anand Prabhu Subramanan, Janan Vasudevan P. Narayanasamy and A.J. Anto Multpath Power Senstve Routng Protocol for Moble Ad Hoc Networks. Lecture Notes n Computer Scence, Sprnger, Wreless On-Demand Network Systems (WONS 2004), pp: Paul Barom Jeon and George Kesds, Pheromone-aded robust multpath and multprorty routng n wreless MANETs. Proceedngs of the 2nd ACM Internatonal Workshop on Performance Evaluaton of Wreless Ad Hoc, Sensor and Ubqutous Networks, pp: do: Jn-Hee Cho, M.S. Report. Desgn, Implementaton and Analyss of Wreless Ad Hoc Messenger, Vrgna Polytechnc Insttute and State Unversty. 9. Anna Trfonova, Moble Learnng-Revew of the Lterature, Techncal Report, Unversty of Tento, Italy. 10. Georgos Parssds, Vncent Lenders, Martn May, and Bernhard Plattener,. Mult-path Routng Protocols n Wreless Moble Ad Hoc Networks: A Quanttatve Comparson. Proceedngs of 6 th Internatonal Conference on Next Generaton Teletraffc and Wred/Wreless Advanced Networkng NEW2AN 2006, St.Petersburg, Russa, pp: Arstotels Tsrgos and Zygmunt J. Haas, Analyss of multpath routng-part I: The effect on the packet delvery rato. IEEE Trans. Wreless Commun., 3: Lee, S.-J. Gerla, M. Splt Multpath Routng wth Maxmally Dsjont paths n Ad Hoc Networks. Proceedngs of the Internatonal Conference on Communcatons 2001, volume 3, pp: Marna, M.K., Das, S. R. On-Demand Multpath Dstance Vector Routng n Ad Hoc Networks. Proceedngs of IEEE Internatonal Conference on Network Protocols (ICNP), pp: Ye, Z., S.V. Krshnamurthy, S.K. Trpath, A framework for relable routng n moble ad hoc networks. Twenty-Second Annual Jont Conference of the IEEE Computer and Communcatons Socetes, IEEE, March-3 Aprl 2003 IEEE Computer Socety, Washngton, DC., USA. pp: