INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL

Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

MultipathDynamicSourceRoutingwithCostandAntColony
OptimizationforMANETS
Sarala.P1,Kalaiselvi.D2
1.Lecturer2.PostgraduatestudentinComputerScienceandEngineering
NandhaEngineeringCollege,Erode,Tamilnadu
saralagokul@yahoo.com

ABSTRACT
The mobile adhoc networks are the infrastructureless networks constructed without
anyfixedinfrastructuresuchasbasestation,tower,redirectionswitchesandrouters.Mobile
adhoc networks are the temporary wireless networks. All the routing information are
managed by the node itself. Mobile adhoc network routing operations are categorized into
two types proactive and reactive routing. The multipath routing mechanisms are used to
discovermultiplepathsunderthenodes.
Multipath dynamic source routing protocol (MPDSR) is usedtodiscover multipath
route under MANET nodes. The MPDSR protocol uses the local link information for the
route discovery process. The MPDSR protocol is enhanced with ant colony optimization
method to provide multipath route information using global link information. EMPDSR
providesQoSfactorssuchasendtoendreliability.Networktraffic,bandwidthandbattery
powerfactorsmakeaninfluenceovertheroutediscoveryprocess.
Costenabledroutediscoveryisoneoftheconsierableroutingmethodthatenablesthe
cost estimation with different metrics. The multipath routing protocols concentrates on the
routediscoverywithendtoendreliabilityfactors.TheEMPDSRprotocolisintegratedwith
fuzzy cost estimiation techniques. Distance, network traffic, bandwidth and battery power
metricsareusedinthefuzzycostenabledmultipathdynamicsourceroutingprotocol.
Keywords:Fuzzynetwork,Antcolonyalgorithm,adhocnetworks,multipathrouting.
1.Introduction
Mobile Ad hoc Networks (MANETs) consisting of a collection of wireless mobile
hosts (called nodes) have received increasing attention recently. Independence from central
network administration, ability to be selfconfigured, selfhealing through continuous
reconfiguration, scalability and flexibility are the distinguished reasons to deploy such
networks [1]. Routing as one of the cornerstones of any network including MANETs, is
needed whenever data packets need to be handed over several nodes to arrive at their
destinations. Routing protocols have to find routes for packet delivery and make sure the
packetsaredeliveredtothecorrectdestinations[7].
In MANETs each node serves as a router to forward packets to other hosts. Since,
nodesarefreetomoverandomlyandorganizethemselvesarbitrarilythenetworkstopology
may change rapidly and unpredictably. Such characteristics allow an ad hoc network to be
established onthefly with builtin fault tolerance and unconstrained connectivity. This
makesroutinginsuchnetworksmorechallenging,especiallywhencertainQualityofService
(QoS)requirementsaretobeguaranteedduringtherouting.OneofthemostimportantQoS
metrics is to provide endtoend reliability. Endtoend reliability is used to reflect the
83

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

probabilityofsendingdatasuccessfullyfromthesourcenodetothedestinationnodewithina
timewindow.
Endtoend path reliability is the product of the link availabilities along the path,
assumingthelinkavailabilitiesareindependent.Thecalculationoflinkavailabilityisbased
on the currents node movement. The words availability and reliability will be used
interchangeably throughout the paper. Usually required endtoend reliability for routing is
satisfiedthroughapplyingmultipathscheme.Takingthisschemeintoconsideration,theend
toendreliabilityis1 PkK(1k),wherekisthereliabilityofapath,andKisthesetofall
paths to be considered in the reliability calculation. Endtoend reliability guarantees that
thereisanactivepathbetweentwomobilenodeswithinatimeinterval.
Inthispaper,ourmajorcontributiongoestowardssupportingthereliabilityasaQoS
metricthroughmultipathrouting.ManyresearcheshavebeendonetoimproveQoSinmulti
pathroutingalgorithmsforMANETs[2][10][11].However,onlyfewofthemhavefocused
on reliability metric. The mostrelated work toours is MultiPath Dynamic Source Routing
(MPDSR),whichisbasedonDynamicSourceRouting(DSR)protocol.
MPDSRseekstocomputeasetofunicastroutesthatcansatisfyaminimumendto
end reliability requirement. It then maintains this requirement throughout the lifetime of
transmission.However,theroutediscoveryinMPDSRreliesonlyonlocallinkavailability
information at each intermediate node to perform the route request message forwarding,
withoutusinganyglobalinformation.Selectingareliablelinkinanintermediatenodesolely
basedonlocalinformationmaynotnecessarilyleadtofindingasatisfactoryreliableendto
endpath.
The problem originates from the fact that there is no global endtoend reliability
related information available for each node. To alleviate the aforementioned problem and
provide the global reliability related information for each node, in this paper an Enhanced
MultiPathDynamicSourceRoutingalgorithmcalledEMPDSRhasbeendeveloped.Tothis
end, we have applied an Ant Colony Optimization (ACO) based approach called AntNet,a
lightweight optimization method. Generally ACO algorithms utilize ants, which are mobile
agentsthatarecapableofsolvingvariousoptimizationproblemssuchasnetworkroutingand
congestionproblems[5].
2.Preliminaries
Thefundamentalconceptsandapproacheswhichourproposedmethodisbasedupon
areintroducedtothenecessaryextent.FirstMPDSRmethodthenabriefintroductionofAnt
ColonyOptimizationandAntNetaregiven.
2.1.MPDSR
MPDSR or MultiPath Dynamic Source Routing introduced, tries to find multiple
disjoint paths from a given source to a destination while guaranteeing that these paths
altogethercansatisfyagivenendtoendreliabilityP u where0<Pu 1.MPDSRachieves
route discovery by determining the number of paths to be discovered (m0) and the lowest
reliability(Plower)thateachofthem0 pathsmusthavesothatthePu reliabilitycanbesatisfied.
Once,obtainingtheappropriatevaluesfortheparametersatthesourcenode,thesourcenode
sendsm0RouteRequest(RREQ)messagestosearchforfeasiblepaths.Eachofthe RREQ
messagescontainsusefulinformationsuchas,thepathithastraversedtillthen(pathVector),
84

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

pathVectors corresponding accumulated reliability namely Pacc and Plower. When an

intermediatenodereceivesanRREQmessage,itinvestigateswhether Pacc Plower ornot.If
thisinequalityfails,themessageisdiscarded.Otherwise,itappendsitselftopathVectorand
calculatesthenew Pacc andfinallyforwardsatmostm0 copiesofthemodifiedmessagetoits
neighbors.Afterawhile,thedestinationnodecollectssomeoftheRREQmessages.Fromthe
pathVectors stored inside RREQ messages, the destination node uses a path selection
algorithm topick the set ofdisjoint paths that can satisfy Pu. Twopaths aredisjoint if they
just share common source and destination nodes, but do not share common intermediate
nodes. Then, the destination node responds to the source by sending Route Reply (RREP)
messages through the selected paths. Thereafter, the source node commences sending the
packetsthroughthesepaths.
2.2.AntColonyOptimization(ACO)
ACO,afamousswarmintelligenceapproach,hastakenitsinspirationfromthesocial
behaviors ofreal world ants.Mostoften real ants are wandering stochastically around their
nests to forage (Search for food). Upon finding food, they return back to their nests and
simultaneously deposit pheromone trails along the paths. Since ants tend to follow the
pheromonetrails, they more likelybiased towards such paths,and as a resultthey may not
keep on traveling quite randomly. Therefore, they likely move through these paths and
reinforcetheexistentpheromone.Thiskindofindirectcommunicationiscalledstigmergy[4]
inthebiologyandentomologyliteratures.Overtime,however,thepheromonetrailstartsto
evaporate, thus reducing its attractive strength. Analogously, ACO [4], one of the stateof
the art paradigms in designing metaheuristic algorithms for combinatorial optimization
problems,utilizesartificialmobileagents namelyantswhicharecapableofsolving various
kinds of routing and congestion problems. At regular intervals from every network node
severalantsarelaunchedtowardthedestinationnodetodiscoverthefeasiblelowcostpathto
thatnode.EachantinACOconsiderstwoparameterstoselectitsnexthop.Thefirstoneis
theamountofpheromonedepositedonthepathtothenext node,andtheotherisakindof
heuristicparametersuchasthequeuelengthassociatedwiththelink.
AntNetasanACOapproachtoadaptivelearningofroutingtablesincommunication
networks. Each node k in the network stores some data structures within itself which are
responsibleforkeepinglocaltrafficstatistics,androutingtable.Localtrafficstatisticsdefines
asimpleparametricstatisticalmodelfortrafficdistributionoverthenetworkasseenbynode
k.Infact,itexplainstheamountoftrafficflowstowardseachpossibledestination.Routing
table,foreachpossibledestinationdandforeachnoden,storesaprobabilityvaluePnd which
expressesthe desirability of selecting n as the next node when the destination node isd. In
factitshowsamountofpheromonedepositedonthelink(k,n).Whenanantatnodekheads
toward a destination node d, it selects the next neighbor node n with the probability Pnd
wherewehave:
Pnd =Pnd + a ln/1+ a (|Nk|1)(1)
Here
ln =1 q n/ S|Nk|n=1 qn
(2)
Where |Nk | is the number of the neighbors of node k, qn is the length of the queue
associated with the link connecting k to n and a is the weight of the importance of the
heuristic function with respect to pheromone deposit. When an ant reaches the destination
node, this node can now evaluate the goodness of the path.Thisgoodness can bedefined
according to an applications requirement [8]. AntNet itself uses the ants trip time and the
85

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

parameters of the local statistical model. Quantifying the goodness value, the destination
nodecreatesabackwardant.Thebackwardanttakestheexactpathbythecorrespondingant,
butintheoppositedirection,anddepositsanamountofpheromoneonitspathtothesource
node.Thisamountiscommensuratewiththegoodnessofthispath.
3RelatedWork
Ondemand routing protocols generally perform well for wireless adhoc networks,
sincethefloodingofrouterequestmessagesisonlyperformedwhenarouteisneeded,rather
thanperiodicallyasinproactiveroutingprotocols.Thedegreeoffloodingisfurtherreduced
byusingmultipathroutingprotocols,whichhavebeenproposedtodiscovermultiplepaths
for data transmission. Such protocols can be considered as a hybrid of proactive and on
demandrouting, becauseroutediscovery is invokedondemand while route maintenance is
done on a proactive basis. Examples of such multipath protocols include Temporally
OrderedRoutingAlgorithm(TORA)[9]andSplitMultipathRouting(SMR)[6].InTORA,
thesourcenodeconstructsmultipleroutesbyfloodingaquerymessagefollowedbyasetof
updatemessages.However,TORAdoesnothaveanymechanismstoevaluatethequalityof
thesemultiplepathsandthisleadstoitspoorperformance.MPDSRovercomesthisproblem
byselectivelychoosingmorereliablepathsandbyprovidingsoft guaranteesontheendto
endreliability.SMR[6]extendsDSRinthewaythatthedestinationcandiscovertwopaths
for each route request, in which one is the shortest path, and the other is the maximum
disjointpath.Thereisnoexplicitenforcementofdisjointpathsandthisdiffersfromourwork,
becauseouralgorithmenforcestheuseofdisjointpathsinitsroutediscoveryinordertouse
thedefinitionofpathreliabilitytoprovideendtoendreliableservice.
Previous work in QoS routing for adhoc wireless networks focuses on guarantees
withrespecttobandwidth,costanddelay.Oneofsuchroutingprotocolsistheticketbased
QoS routing protocol [3]. It considers two kinds of routing criteria: the delayconstrained
leastcostroutingandthebandwidthconstraintleastcostrouting.Itusesticketbasedprobing
tocontrolthenumberofroutequeriesandtofindmultipathinparallel.Incomparison,our
MPDSR considers the dynamic nature of network topology as well as the importance to
offer continuous network connection in certain mission critical applications. Thus, the
objective of our protocol is to improve the level of service by providing guarantee with
respect to endtoend reliability, and to probabilistically guarantee the required connection
lifetime. In addition, ourMPDSRdiffers in the way of searching multiple paths theroute
discovery in our protocol relies only on local link availability information at each
intermediate node to perform the route request (RREQ) message forwarding, without
resortingtoanyglobalinformationaswasusedin[3].
4.EMPDSR
4.1.Motivation
MPDSRtriestocomputeasetofunicastroutesthatcansatisfyaminimumendto
end reliability requirement. It then maintains this requirement throughout the lifetime of
transmission.MPDSRisfedwithjustlocalinformationfordiscovery ofroutes.Followinga
highreliablelink,whichconnectsthecurrentnodetooneofitsneighbors,cannotguarantee
an endtoend reliable path, since the selected neighbor may not have good reliable links
towards destination node. As a result the obtained path may not have the endtoend

86

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

satisfactory reliability. To mitigate this problem, we have used AntNet running silently in
backgroundtoprovidetherequiredglobalinformationforMPDSR.
4.2.Ants'ContributiontoEMPDSR
EMPDSRusesamodifiedversionofAntNettopopulateitsownroutingtable.The
mostsignificantchangemadetoAntNetgoestowardsthewaythegoodnessvalueisobtained.
Inour approach, we haveused endtoendreliability as the goodness parameter. A forward
ant starts the trip to the destination node, then it arrives at an intermediate node, where it
needs to update its Pacc field, by multiplying Pacc with the link availability of the link the
forward ant has just traversed. This process continues until the ant eventually reaches its
destinationnode.Asaresult, Pacc atthedestination
is the endtoend traversed path reliability. Using Pacc and trip time (T) obtained from the
forwardantthepathsgoodnessiscalculatedfromequation3:
PathGoodness=c1(Pacc)+c2(Wbest/T)
(3)
Inequation (3), Wbest is the best trip time experienced by the forward ants traveling
towardthedestinationoverthelastobservationwindow.Themaximumsizeofthewindowis
settoaconstant,forthesakeofsimplicity.Thecoefficientc1 andc2 weighttheimportanceof
eachterm.Inthecurrentimplementationofthealgorithmc1 =0:6andc2 =04.Thefirstterm
istheendtoendpathreliability.Thesecondtermimpliesthegoodnessoftheroundtriptime
(T)relativetorecentbesttriptime(Wbest).Thefirsttermisthemostimportantone,whilethe
second term alleviates the stagnation problem [4], by conducting some of the ants to less
reliablebutlesscongestedorshorterpaths.Stagnationoccurswhenantsareattractedbyone
optimalpathwhichwillleadthispathtobeheavilycongested.Aftertheforwardantreaches
the destination node, the destination node generates a backward ant, transfers the entire
forwardantsmemorytoit.Thebackwardanttakesthesamepathasthatofitscorresponding
forward ant, but in the opposite direction. The backward ant updates the routing table at
intermediate nodes for all the entries related to the forward ants destination node. In this
update the related probabilities will be increased by a value proportional to both path
goodnessandthepreviousvalueoftheprobability(Pnd)throughequation4.
Pnd =Pnd +PathGoodness (1 Pnd)
(4)
Launching several ants at regular intervals at different nodes, the whole process
silentlyrunsinthebackgroundallthetimeandupdatesroutingtables.
4.3.PathDiscovery
Upon receiving a connection request from an application with a certain reliability
criterion (Pu), the source node initiates the PathDiscovery algorithm with the given Pu
(illustratedinAlgorithm1).PathDiscoveryprocessneedstodeterminem0 (numberofpaths),
Plower(theminimumreliabilitythateachofthe m0 pathsrequirestoguaranteePu),andt w
(the time window that thisendtoendreliability holds within). Plower is calculated from the
givenPu andm0 throughequation5:

Plower =1m0 1 Pu
(5)
InPathDiscovery,twissettotheconstanttwMax (here100seconds),theupperbound
of the time window. m0 is initiated to 1 from which Plower is calculated (line 8). Then,

87

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

procedure iterates through all links associated with the neighbors of the source node and
checks iftherearem0 numberoflinkswithatleast Plower reliability(lines913).Basically,
the procedure tries to find the minimum number of links which altogether can satisfy Pu.
Thereisalsoamaximumthreshold(mmax)fornumberofdisjointpathstobediscovered(line
5). Thus, if m0 violates m max or the number of neighbors (L), the process will need to
decreasetw duetothefactthatlinkscanbemorereliableintheshortertimewindow(line31).
However,itispreferrednottohavesmallertimewindows,sincesourcenodeisrequiredto
sendroutecheckmessagestovalidatewhethertheendtoendreliabilitycanstillsatisfyPu or
not. This validation incurs extra overhead especially when it is done at short intervals
periodically.Therefore,aminimumthresholdisadoptedfortw calledtwMin (here20seconds),
ifthealgorithmfailsfortheminimumthresholdthenitisafailurefortheapplicationrequest
(line 30). Otherwise, the source node will send RREQ messages to the m0 highest reliable
links.Thehighestreliablelinksaretheoneswhohavethehighestvalueinantgeneratedtable
fortherequestedenddestination(lines1428).NotethatMPDSRslinkselectionrelieson
localinformation,whereasEMPDSRutilizesthemoreglobalandconsequentlyworthwhile
informationaboutthenetworkstatusprovidedbyants.
Upon receiving an RREQ message, each intermediate node runs
HandleRREQMessage Algorithm (illustrated in Algorithm 2). In this algorithm, the
intermediate node first checks whether it is the destination itself or not. If not then the
HandleRREQMessage algorithm will try toforward the RREQ towards the destination. An
intermediate node only forwards m0 number of the same RREQ messages, and the same
RREQs will be discarded. This is accomplished via the bookkeeping variable
numOfForwardedMsg(lines12).Inordertokeeptherequiredreliabilitycriterionalongthe
path,theRREQcontainsareliability field Pacc thatkeeps
reliabilityvaluefromsourcetothecurrentnode.Eachtimeitpassesalink,itmultiplies Pacc
withthelinksassociatedreliabilityithasjusttraversed(line4).Theprocedurethencalculates
Li(tw)accordingtotheequation6(line5).Li(tw)= Plower / Pacc
(6)
Withthecurrent Pacc,Li(tw)istheminimumreliabilitythattherestofpathmusthold
inordertokeeptheendtoendpathreliabilitygreaterthanorequaltoPu.Then,thehighest
reliablelinksretrievedfromantpopulatedtable,whichalsosatisfytheLi(tw),arepickedand
the RREQ messages are forwarded to them (lines 817). To avoid loops, the selected
neighborsmustnotbevisitedbefore(lines910).
Algorithm1PathDiscovery(Pu)
1:tw =twMax
2:whiletw twMin do
3:setA As,1(tw),...,As,t(tw)
4:m0 =0
5:whilem0 Landm0 mmax do
6:path=0
7:m0 =m0 +1
8: Plower =1 m01 Pu
9:for "neighborj setAdo
10:ifAs,j (tw) Plower then
11:path=path+1

88

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

12:endif
13:endfor
14:ifpath m0 then
15: Pend_to_end ={(n1,v1),..,(nn,vn)}
{wherethelistissortedaccordingtovi}
16:rreq=newRREQ(m0,Plower,tw)
17:n=numberOfNeighborsofsourcenode
18:numRREQMsg=0
19:fori=1toi=ndo
20:ifAs(tw) Plower then
21:Send(RREQPendToend[i].neighbor)
22:numRREQMsg++
23:ifnumRREQMsg=m0 then
24:returnsuccess
25:endif
26:endif
27:endfor
28:endif
29:endwhile
30:returnerror
31:tw =0.9 tw
32:endwhile
When the destination node receives the first RREQ, it triggers a timer to somehow
limitthetimethatshouldwaitforthesameconsecutiveRREQs.Themorethetimelimit,the
greater number of RREQs are received at the destination. On the other hand, higher time
limits increase path discovery delay. Thus, it is better to set the time limit according to
networksize.Assoonasthetimertimeouts,thedestinationnodelaunchesitspathselection
algorithm.EachoftheRREQmessagescontainsapathwithatleast Plower reliability.Then,
the destination node selects a setof these paths,so that these selectedpaths (TraceSet) can
collectively satisfy Pu. To attain this, it sorts all the available paths regarding to their
reliability in descending order, and names this sorted paths CandidateSet. Path selection
algorithmintrinsicallyisperformedrecursively.Ateachstep,thealgorithmpicksanewpath
from CandidateSet and tries to add it to the TraceSet upon condition that the new path is
disjoint with respect to the previously added paths in TraceSet. Then, the algorithm
recursivelyinvokesitselfandattemptstoaddfurtherpaths.Ifnoneofthepathsremainingin
the CandidateSet were eligible to be included in TraceSet, the algorithm removes the
previouslyaddedpathsfromTraceSet,andbacktrackstolookforotherpossiblepathsfrom
CandidateSet.Thewholeprocedurecontinues
untileitherthealgorithmfindsanadequatenumberofpathstosatisfydesiredreliability,or
exitswithnoachievement.
AlgorithmtohandleRREQMessage(RREQ)
1:ifnumOfForwardedMsg[RREQ]>m0 then
2:
return
3:endif

89

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

4: Pacc = Pacc Aj,i(tw)

5:Li(tw)= Plower/ Pacc
6:n=numoftheneighborsoftheintermediatenode
7:Pend_to_end ={(n1,v1),,(nn,vn)}
{wherethelistissortedaccording tovi}
8:fork=1tondo
9:
ifPend_to_end[k].neighbor pathVectorthen
10: continue
11: endif
12: ifAi,k(tw) Lk(tw)then
13:
numOfForwardedMsg[RREQ]++
14:
forward(RREQ,Pendtoend[k].neighbor)
15: return
16: endif
17:endfor
5.FuzzyCostEstimationonEMPDSR
The proposed system improves the EMPDSR protocol with cost based route
discovery scheme. The fuzzy logic techniques are used for the cost estimation. Bandwidth
andtrafficfactorsareusedintheroutediscoveryprocess.Theproposedsystemimprovesthe
endtoend reliability. Multi path route discovery is designed in the system. Cost factor is
used for route discovery process. Dynamic source routing protocol is used in the system.
Alternate route is selected in node failure state. The system is divided into three major
modules.TheyareRoutediscovery,RoutemaintenanceandCostestimation.
5.1RouteDiscovery
Theroutediscoverymoduleisdevelopedtofindoutpathbetween givensourceand
destination nodes.The route requestispassed toall nodes. The neighbor list updatedusing
routereply.Thesystemproducesmultiplepathsforthesourcetodestinationnode.
5.2RouteMaintenance
Theroutemaintenancemoduleisdesignedtoperformrouteupdateprocess.Thenode
failure and node mobility are monitored in the route maintenance process. The path is
updated with respect to current network status. The system maintains active path for data
transmission.
5.3CostEstimation
Thesystemusesthecostfactorforrouteselectionprocess.Thefuzzylogictechnique
isusedforcostestimationprocess.Bandwidth,traffic,nodecountandbatterypowerfactors
areusedincostestimation.Thesystemimprovesthereliabilityusingmultiplepaths.

90

INTERNATIONALJOURNALOFAPPLIEDENGINEERINGRESEARCH,DINDIGUL
Volume1,No1,2010
Copyright2010AllrightsreservedIntegratedPublishingAssociation
RESEARCHARTICLEISSN09764259

6.Conclusions

Multipathroutingsupportsendtoendreliability.TheEnhancedMultiPathDynamic
Source Routing (EMPDSR) is improved with fuzzy cost mechanism. The bandwidth and
traffic factors are included in the routediscoveryprocess.The systemprovides user choice
based route discovery process. Cost based route estimation. High reliability. Multipath
routing.Globaloptimizedroutediscovery.

7.References
1.

Breed.G,"Wirelessadhocnetworks:Basicconcepts.InHighFrequencyElectronics",
pages4446,2007.
2.
Chen.Y.S,Tseng.Y.C,Sheu.J.P,andKuo.P.H."Anondemand,linkstate,multipath
QoSroutinginawirelessmobileadhocnetwork".InEuropeanWireless,2002.
3.
Chen.S and Nahrstedt. K "Distributed Quality of Service Routing in Ad Hoc
Networks".IEEEJournalonSelectedAreasinCommunications,17(8),August1999.
4.
Dorigo.MandStutzle.T"AntColonyOptimization".MITPress,2004.
5.
Ehsan Khosrowshahi Asl, Morteza Damanafshan, Maghsoud Abbaspour Majid
Noorhosseini,KamranShekoufandeh"EMPDSR:AnEnhancedMultiPathDynamicSource
Routing Algorithm for MANETs Based on Ant Colony Optimization" 2009 Third Asia
InternationalConferenceonModelling&SimulationIEEE.
6.
Lee. S and Gerla.M "Split Multipath Routing with Maximally Disjoint paths in Ad
HocNetworks".InTechnicalReportinUniversityofCalifornia,2000.
7.
Mueller.S,Tsang.R.P,andGhosal.D. "Multipath routing inmobileadhocnetworks:
Issuesandchallenges".InMASCOTSTutorials,pages209234,2003.
8.
OMNeT++.http://www.omnetpp.org/,January2009.
9.
Park.VandCorson.S"Temporalyorderedroutingalgorithm".InternetDraft,August
1998.
10.
Tsirigos.A and Haas.Z "Multipath routing in the presence of frequent topological
changes".IEEECommunicationsMagazine,39(11),2001.
11.
Valera.A.C, Seah.W.K.G, and Rao.S.V. "Cooperative packet caching and shortest
multipathroutinginmobileadhocnetworks".InINFOCOM.IEEEComputerSociety,2003.

91