QFSRD:OrthogenesisEvolutionBasedGeneticAlgorithmforQosFitnessScopeawareRouteDiscoveryinAd Hoc Networks

Transcription

1 Global Jounal of Compute Scence and Technology: E Netwo, Web & Secuty Volume 5 Issue 3 Veson.0 Yea 205 Type: Double Blnd Pee Revewed Intenatonal Reseach Jounal Publshe: Global Jounals Inc. (USA) Onlne ISSN: & Pnt ISSN: QFSRD: Othogeness Evoluton based Genetc Algothm fo Qos Ftness Scope awae Route Dscovey n Keywods: othogeness evoluton, QOS ftness scope. GJCST-E Classfcaton : C.2.2 By M. L. Rav Chanda & D. P. Chanda Sekha Reddy QFSRD:OthogenessEvolutonBasedGenetcAlgothmfoQosFtnessScopeawaeRouteDscoveyn Stctly as pe the complance and egulatons of: JNTUH, Unvesty, Inda Abstact- Hee n ths pape we devsed a novel othogeness evoluton based GA technque fo QoS ftness scope awae outng n Moble Ad hoc Netwos. The past decade eseach towads oute dscovey stateges fo moble ad hoc netwos s contnung wth magntude speed. Howeve, the maoty of the outng solutons devsed n past ae dealng only wth the optmalty of the data tansmsson. QoS awae hop level connectons n a gven oute ae not suppoted wth the desed fequency. Hence the QoS awae outng n moble ad hoc netwos s gabbng the attenton of many eseaches as ths doman s on the hot edge of the cuent eseach. In egad to ths we devsed an Othogeness evoluton based Genetc algothm fo QoS ftness scope awae oute dscovey n Moble ad hoc netwos. Due to the computatonal complextes of GA and lmts of ad hoc netwo esouces, vey few eseaches devsed GA based QoS optmalty stateges fo oute dscovey n MANETs. The model devsed hee n ths pape s successfully handlng these ssues and emeged as best n ts class of QoS awae oute dscovey stateges. The expemental esults ae explong the scalablty, optmalty and obustness of the poposed model M. L. Rav Chanda & D. P. Chanda Sekha Reddy. Ths s a eseach/evew pape, dstbuted unde the tems of the Ceatve Commons Attbuton-Noncommecal 3.0 Unpoted Lcense pemttng all non-commecal use, dstbuton, and epoducton nany medum, povded the ognal wo s popely cted.

2 QFSRD: Othogeness Evoluton based Genetc Algothm fo Qos Ftness Scope Awae Route Dscovey n M. L. Rav Chanda α & D. P. Chanda Sekha Reddy σ Abstact- Hee n ths pape we devsed a novel othogeness evoluton based GA technque fo QoS ftness scope awae outng n Moble Ad hoc Netwos. The past decade eseach towads oute dscovey stateges fo moble ad hoc netwos s contnung wth magntude speed. Howeve, the maoty of the outng solutons devsed n past ae dealng only wth the optmalty of the data tansmsson. QoS awae hop level connectons n a gven oute ae not suppoted wth the desed fequency. Hence the QoS awae outng n moble ad hoc netwos s gabbng the attenton of many eseaches as ths doman s on the hot edge of the cuent eseach. In egad to ths we devsed an Othogeness evoluton based Genetc algothm fo QoS ftness scope awae oute dscovey n Moble ad hoc netwos. Due to the computatonal complextes of GA and lmts of ad hoc netwo esouces, vey few eseaches devsed GA based QoS optmalty stateges fo oute dscovey n MANETs. The model devsed hee n ths pape s successfully handlng these ssues and emeged as best n ts class of QoS awae oute dscovey stateges. The expemental esults ae explong the scalablty, optmalty and obustness of the poposed model. Keywods: othogeness evoluton, QOS ftness scope. I. Intoducton MANETs ae weless moble that opeate wthout any nfastuctue, can be mplemented quckly and ae flexble to the connectvty and envonment of the taffc and moblty pattens. MANET s unlke a tadtonal weless netwos that have a wed netwo suppotng them fo povdng data sevces to moble uses. The netwo can be setup anywhee fo shang data whee thee s no pe exstng wed netwo. The applcatons of moble Adhoc netwo vay such as, settng up a communcatons netwo n a local aea fo confeences, meetngs, advetsng, e-classes, meda events, fo communcatons used n battlefelds, fo telecommuncaton netwos n taffc contol [5], fo communcaton n dsaste ecovey aeas, etc. In MANET the netwo communcaton s a pee-to-pee weless connectvty between nodes wth ethe a sngle hop between a moble cell Autho α: Assocate Pofesso, ECE Dept., NIET, Hydeabad, Inda. e-mal: mlavgates@gmal.com Autho σ: Pofesso, coodnaton, ECE Dept., JNTUH, Kukatpally, Hydeabad, Inda. e-mal: dpcseddy@gmal.com and a base staton o mult-hop weless tansmsson wthout any base statons. The nodes ae moble and act as hosts as well as outes. A node functons, as a host tansmttng data to othe nodes, as a destnaton node fo ecevng the data and also as a oute fo outng the data to othe nodes. The study n the feld of outng n Moble Ad hoc Netwos has been extensve howeve s mostly based on the best effot data taffc [, 2] that s not actually a Qualty of Sevce. Smla studes based on QoS obectve n we lne netwo outng [3, 4] devsed algothms fo outng that face n MANETs mplementaton poblems due to the netwos dynamc topology and bandwdth constants. The nceasng avalablty and use of moble devces and equement fo weless access of Intenet, televson, VOIP, multmeda audo/vdeo, and especally eal tme audo and vdeo steamng eques these sevces to be mplemented n MANETs wth Qualty of Sevce (QoS) outng. The need fo mplementng MANETs s nceasng paallel to the gowth n access of moble data. The sevce qualty s defned by effcency of the data flow whch can be measued wth a set of constants such as bandwdth, esponse tme of sevce, end-to-end delay, nteuptons, packet loss, etc. In path dscovey the algothms fo outng ty to fnd a path havng sutable QoS specfed esouces whle mnmzng the seach, dstance and taffc poblems. A Moble Adhoc netwo s depcted n the below Fgue. A topology of a weless paths s obtaned fom the Fgue and s depcted n the below Fgue 2. The nodes that ae moble n natue ae epesented by A, B, C, K lettes and the bandwdth avalable wth the weless lnks s epesented adacent to evey edge wth,2,3,4,5,6 numbes. If we eque detemnng a path between souce node A and destnaton node G, the path that s shotest accodng to a geneal technque of path fndng would be A-B-H- G. The selecton of the QoS oute s completely dffeent fom the geneal pactce as cteons such as bandwdth etc ae consdeed as QoS metc. If a path between node A and node G s equed wth mnmum of 4 mbps bandwdth then path that s shotest A-B-H-

3 2 G cannot offe the needed bandwdth and so the possble QoS awae path would be A-B-C-D-E-F-G. Moble Node Sgnal Range Weless Lnk Fgue : An example Manet connectvty Shotest Path QoS satsfed path Fgue 2 : an example of QoS outng n Manet The eseach wo developed tll date fo QoS based outng of Moble Adhoc Netwos ae, QoS models [5, 6], QoS esouce esevaton sgnalng [7], QoS Medum Access Contol (MAC) [8], QoS schedulng [9], and QoS outng [0,, 2, 3, 4]. The complex QoS functonalty nvolved n MANET mplementaton s lmted by avalable esouces and dynamc netwo topology. The flow could be nelastc.e. un o multcast, elastc nvolvng TCP o the QoS may have multple clent equements makng the QoS outng vey dffcult [2, 4] as detemned n pevous eseach. In a dynamc envonment as the nodes ae moble the addton and deleton of nodes makes the ceaton of outng paths vey complcated. To handle the sudden changes affectng the MANET topology and delveng a mult-path QoS outng eques desgnng appoxmated solutons and effcent outng algothms wth vaous technques and the latest technques such as Fuzzy Logc (FL), Atfcal Intellgence (AI), Neual Netwos (NNs), Genetc Algothm (GAs) etc. In ths pape an othogeness GA based QoS ftness scope awae oute selecton stategy fo MANETs called QFSDR s pesented. Ths technque s devsed wth the motvaton ganed fom the eale model called GA based outng method GAMAN [8]. The obectve of the poposed model s, unlke GAMAN and othe benchmang models t should consde many QOS factos along wth othe contextual QoS metcs and also should acheve the optmalty n evoluton complexty. The pefomance of the method s assessed wth smulatons based tests n dffeent netwo topologes. The pape s stuctued as below. Secton 2 shows the confmed contempoay elated wo. The devsed model s exploed n Secton 3. The esults of the smulaton tests ae shown n the Secton 4. The conclusons ae fnally pesented n Secton 5. II. Related Wo In ths secton a evew of the outng technques based on QoS n MANETs ae gven as follows, A QoS-awae outng path dscovey appoach called tcket-based pobng algothm by Nahstedt et al [0] s based on contollng wth a calculated numbe of tckets the total messages flooded n a oute. A message fo pobng compses of mnmum one tcket and a message on aval at a node f t does not contan only one tcket may be dvded nto seveal pobes and outed to othe nodes. In ths way evey chld pobe conssts of tckets subset to ts paent. The pobe cayng the hop-by-hop path o the delay/bandwdth data s used n esevng the esouces based on the QoS equements. The developes of the tcket based algothm have bult the technque on an mpecse model. Unlke we lne netwos, Moble Adhoc netwos ae constantly affected by lnk beakages esultng n the nfomaton tansmtted beng of mpecse type. So fo the tcket-based pobng algothm s based on a plan model of mpecse natue whee the hstoy and cuent (estmated) delay vaatons ae computed to detemne the cuent delay depcted n a ange [delay δ, delay + δ]. Ths algothm apples oute edundancy at vaous levels by ncludng n oute mantenance the technques of pathepang as well as e-outng. Hee n the pocess, a node on detectng a path that s boken notfes the souce node. The souce node then uses the technque of path-epa fo epang the old path usng local econstuctons. The tansmsson s eouted wth a new possble oute whle notfyng the subsequent elease of esouces at the nodes exstng between n the old oute. Hee unlke the technque of e-outng, a completely new path s not found and nstead the appoach attempts to adust to the MANETs dynamc envonment. A outng appoach based on QoS fo Moble Ad hoc netwos of sze n the ange of small and medum called Coe Extacton Dstbuted Ad hoc Routng (CEDAR) []. The CEDAR appoach nvolves 3 man mechansms. Fst, the Coe Extacton mechansm selects a goup of nodes based on the MANETs mnmum domnatng goup o lnks havng lage bandwdth of stable natue, to ceate the coe that manages the nodes local topology and computes the oute based on the equement and the state of local condtons. Next Lnk State Popagaton mechansm dstbutes to all the coe nodes the nfomaton of the bandwdth avalable wth stable lnks. The outng based on QoS s attaned by passng stable lnks elated hghbandwdth nfomaton to dstant nodes n the netwo and by contanng dynamc lnks low bandwdth nfomaton n the aea locally. Fnally n the Route Computaton mechansm, the computaton of the path

4 establshes a coe oute fom the souce node doman to the destnaton node doman. Ths data of the coe path s used to detemne teatvely a patal oute n the path that foms the coe fom the souce to the fathest doman node possble n tems of the demanded bandwdth. In the next teaton ths node acts as the souce node. In the stategy of CEDAR, the coe mechansm offes a capable and cost effectve platfom fo outng and the state popagaton guaantees lnk-state nfomaton accessblty to coe nodes wth mnmal expenses. A potocol fo outng gven n [4] s bult on QoS ctea and based on the estmaton of the bandwdth. Ths bandwdth assessment s done by dssemnatng wth Hello messages the nfomaton of the bandwdth. A contast of two dssmla appoaches of bandwdth estmaton s gven hee. When the cteon of bandwdth elease s pmaly essental, the functonalty of the estmaton method based on Hello bandwdth s effcent n compason to the assessment appoach based on Lsten bandwdth. When the cteon of topologes of statc natue usng huge weght factos to mnmze the congeston as well as the ncoect sgnalng of boken outes by lost Hello messages s consdeed the methods Hello and Lsten show good functonalty that s mostly same. When the cteon of moble topology s consdeed Hello stateges functonalty s moe effectve wth espect to end-to-end thoughput wheeas the Lsten stateges functonalty s good wth espect to the packet delvey ato. Genetc Algothm-Based QoS Routng Potocol fo MANETS (GAMAN) [8] fo ad hoc netwos s the most ecent and best of ts knd. The GAMAN s devsed to dentfy optmal outes that ae specfc to two QoS factos called end-to-end delay and max tansmsson success ato. The GAMAN s amed to defne QoS awae optmal outes fo moble ad hoc netwos (MANTETs). Unde the mpact of moblty, the Qualty of Sevce s popotonate to the node connectvty. The GAMAN s based on sngle pont cossove and mutaton and ftness functon s assessng only the endto-end delay and max tansmsson success ato. The GAMAN evolutons ae eltst that mantans best ft oute emans unchanged n futhe evolutons. The expemental esults exploed by the authos concludng that t s optmal and obust fo spase to lowe ange of dense sze netwos. Moeove the ftness assessment s specfc to a patcula QoS facto; hence the oute dscovey s not optmal n egad to othe QoS factos. The eltst model s optmal, but evolutons count s not n contol fo netwos wth nodes havng QoS metc values dstbuton wth hgh skewness [20]. Leonad Baoll, Makoto Ikeda et al., [9] devsed a novel local seach optmzaton stategy, whch s an extenson to the eale wo GAMAN [8] that efeed as E-GAMAN. The devsed seach space educton algothm (SSRA) s manly amed to mnmze the cossove complexty obseved n GAMAN. So that the local seach become much faste, hence the tme taken fo optmal oute selecton wll be low and the GAMAN can fnd a feasble weless path vey fast. But the ssue of consdeng the mpact of QoS factos othe than moblty emans same and the evolutons count s stll not n contol fo netwos wth nodes havng QoS metc values dstbuton wth hgh skewness [20]. In a gst, almost all of these benchmang models ncludng GAMAN [8] ae specfc to one o two QOS factos. The GAMAN s also not confdent when QoS metc values ae dstbuted wth hgh skewness [20]. Hencefoth, hee n ths pape we devsed a novel othogeness genetc algothm fo optmal QoS awae oute selecton fo moble ad hoc netwos. Unlke GAMAN the sad model s equally consdeng all QoS metc values to assess the ftness of the esultant oute. Snce the GA that consdeed s followng othogeness appoach and the statstcal stategy used to fx the need and scope of futhe evolutons, the numbe of evolutons s n contol, whch leads to mnmze the seach space III. Othogeness Evoluton based Genetc Algothm fo qos Ftness Scope awae Route Dscovey Unlke the tadtonal GA, the poposed model s constuctng new geneatons by pogessve evoluton stategy. The pogessve evoluton stategy geneates the chld elements havng moe ftness than one o both of the paent elements. Hence the numbe of evolutons can be lmted. The othe contbuton n devsed model s ftness assessment that consdes the many metcs wth equal poty and the same tme not losng the nfluence of pme QoS metc such as enegy effcency, connectvty o bandwdth avalablty. The QoS ftness scope assessment stategy poposed n ths pape s based on the QoS factos of oute and the eale allocaton mpacts, whch ae descbed below: A oute can be ated best unde a specfc QoS facto, but mght fal to delve the same pefomance unde the consdeaton of multple QoS factos. A oute can be ated dvegently wth espect to ts vaous QoS factos. As an example, a oute can be best wth espect to bandwdth avalablty, but the same oute mght be modeate n tems of packet delvey ato scope, wost n the context of end-toend delay scope. The mpotance of the QoS factos mght vay fom one outng context to othe. Accodng to the mpact of QoS factos of the outes descbed, t s evdent that the best anked oute unde sngle QoS facto s not always the optmal 3

5 4 towads ad hoc outng. The oute that pefomed well unde some potzed QoS factos ae always need not be the best ft unde othe potzed QoS factos. In egad to ths the devsed QoS ftness scope awae stategy fnds the best ft oute, whch s based on QoS ftness scope and one o moe potzed QoS factos opted. Ths pocess s labeled as QoS ftness scope evaluaton. Futhe outes ae anked accodng to the QoS ftness scope and wll be used n the same ode to fnalze a oute towads selecton and schedulng. The algothmc exploaton of the model poposed s follows: Input: All possble outes as outes set R Ftness factos: o connectvty (+), bandwdth (+), end-to-end delay (-), eputaton (+), enegy usage(-) and othe metcs f any QoS Ftness Scope ( qfs ) calculaton: o The QoS factos that ae optmal wth hgh values ae consdeed as postve factos o The QoS factos that ae optmal wth low values ae consdeed as negatve factos. o Intally nomalze the QoS factos values such that all ae optmal wth hgh values... o To do that nomalzaton of a negatve facto wll be, hee mv s metc value mv o nomalzaton of postve facto wll be mv o Choose any of the QoS facto as pme facto, whch s accodng to outng context o Extact all node to node connectons as edges avalable fo each nput oute. o Fnd QoS metc values of all these edges o Fnd QoS metc values of oute, whch ae the mean of QoS metc values of all edges found n that oute o Pune outes that ae not ustfyng the pme QoS metc o Rank the est avalable outes fo each QoS facto (hghest nomal fom of the QoS facto value wll be anked best n ode) o Fnd vaance between anks of QoS factos fo each connecton (Ths ndcates the dscepancy of the anks), the dstance of ths vaance value fom gves the neaness of these anks, whch we efe as QoS ftness scope ( qfs ). Othogeness Evoluton o Fnd cossove ponts of each pa of outes, whch ae common nodes n both outes o Fo each cossove pont Intesect these pa of outes at cossove pont and fom new oute such that left pat of the fst oute connected to ght pat of the second oute though the cossove pont, and also fom anothe oute such that connect the ght pat of the fst oute to left pat of the second usng cossove pont. Fnd qfs of these two new outes and vefy that the qfs of the new oute s geate than the qfs of any of the paent, f so accept that, f not dscad that oute. o New outes f any, add to outes set R o Pune the unqualfed outes fom R, whch s based on the pme QoS facto. o Contnue the above Othogeness evoluton pocess fo max evoluton theshold gven. o Vefy the kutoss of the qfs dstbuton among the esultant outes, f kutoss s leptokutc, and then contnue Othogeness evoluton fo next max evoluton count gven. If kutoss s mesokutc o platykutc then stop evolutons and select n numbe of outes fom the esultant outes set R The QoS metcs of each edge between hop level nodes of oute ae consdeed to assess the best ft oute and these metc ae categozed as postve and negatve, whch s based on the value. The metcs wth desed value as hgh efeed as postve metcs and the metcs wth desed value low ae efeed as negatve metcs. The scope of the descbed metcs s assessed aganst the tansmsson of n packets. These metcs ae descbed below. Connectvty (+) = Due to the facto of moblty, the connectvty between the nodes s a senstve metc towads QoS awae Routng. Ths s appostve metc, snce connectvty wth hgh value s desable. Ths metc can be assessed as follows cs( e ) = pct( e ) ct ( e ) n Hee n the above equaton pct( e ) s epesentng the possble lfetme (ths decdes by the nodes moblty decton and speed) of edge e and ctn( e) epesentng the equed connected tme fo n packets tansmsson. Bandwdth compatblty ( + ve metc): Ths facto s also one of the pme QoS factos, snce the suffcent bandwdth s essental to pefom outng wth mnmum guaantee. It comes unde ethe postve. The bandwdth avalable at a oute must be geate than the equed bandwdth of the cuent tansmsson equements. The measung of bandwdth compatblty s as follows: bc( e) = ba( e) b( e) (8)

6 o Hee n the above equaton bc( e ) s ndcatng the bandwdth capacty of edge e, ba( e ) s ndcatng the bandwdth avalable at edge e and the b( e ) s the bandwdth equed at e -to- delay (-) = The elapsed tme of the n packet tansmsson, whch ndcates the postve dffeence between tme taken to tansmt n packets and actual tme expected to tansmt. Ths can be measued as follows: eed ( e ) = ttt( e ) ett( e ) o Hee n above equaton eed( e ) epesents the end to end delay obseved fo n packet tansmssons on edge e, ttt( e ) ndcates the tme taken to tansmt and ett( e ) epesents the expected tme to tansmt. enegy usage(-) : The nodes n ad hoc netwo ae self enegzed, hence the mnmal usage of enegy towads outng s pecous, whch leads the nodes to suvve maxmum lfe tme that helps to maxmze the netwo lfe tme. The enegy usage s negatve facto snce the mnmal values ae desable. Ths can be measued as follows: eu( e ) = fn ( e )* ehz ( e ) o Hee n above equaton eu( e ) enegy used at e, f ( e ) epesents the fequency equed n HZ fo n packets and ehz ( e ) epesents enegy equed n ouls pe hz The QoS ftness of a gven oute s assessed unde the context of multple QoS factos and then anked them based on the selectve pme QOS facto. Ths stategy exploed n followng secton a) Assessng QoS ftness scope Let R be the set of outes such that R = {, 2, 3,... n }, found n oute equest pocess. The set of nodes N such that N = { n, n2, n3,..., n c }, ae the nodes avalable n the scope of taget ad hoc netwo. Each oute { R} can be defned as set of nodes such that { R} = { n s, nh, nh2, nh3,..., nh, nh+,..., nd nh N}. Hee { nh :... m nh N} s the node nvolved to fom the oute between souce node n s and destnaton node n d. Let connectvty scope, bandwdth capacty, end to end delay, enegy usage, and othe such metcs as a set of QoS metcs M = {[ cs( e), bc( e), eed ( e), eu( e)...] =... x} of avalable set of Routes R between souce node n s and destnaton node n d. The QoS facto eu( e ) s taken as pme metc (any QoS metc can be selected as pme metc, whch based on the outng context), whch s usng to ode the outes. These QoS metcs of the outes ae categozed as postve and negatve metcs. If the ncemental values of the metcs ae optmal then those metcs ae efeed as postve metcs and f decement values ae optmal then those metcs ae negatve metcs. Hencefoth the values of negatve and postve metcs should be nomalzed, whch s as follows: Fo each oute [ R] begn Fo each QoS metc { mk() mk M R} of oute Begn mk () = 0 Fo each edge{ e e } Begn Fo each metc [ mk( e) mk( e) M] edge e Begn // hee M epesents values of selected edge of oute If mk( e) s value of +ve metc then mk( e) = mk( e) Else If mk( e) s value of -ve metc then mk( e) = m ( e ) k m () = m () + m ( e ) k k k Fo each QoS metc { mk() mk M R} of oute Begn mk () mk () = // each QoS metc value of each oute, //whch s an aveage of that QoS metc //value obseved at all edges n that oute Then the avalable outes R ae anked by the nomalzed metc scoes { mk() mk M R} fom maxmum to mnmum, such that each oute gets dffeent ank fo dffeent metc mk (). Futhe these anks wll be used as nput to measue the QoS ftness scope qfs. Let Rank set of a oute [ R] s O( ) = { om( ), om2( ), om3 ( ),..., om M ( )} (hee M ndcates the total numbe of metcs) and then QoS 5

7 6 ftness scope ( qfs ) of each oute can be measued as follows. = O( ) k = µ O( ) [ om ( ) om ( ) O( )] k k O ( ) // the above equaton epesents the aveage of the anks obtaned fo dffeent metcs of oute ( ) 2 O ( µ ( ) [ mk( ) mk( ) O( )]) k O = qfs( ) = O ( ) The above equaton s deved fom the pocess of calculatng vaance between gven numbe of attbute values. Subtactng vaance obseved, fom gves ftness scope. Hee n above equaton, µ O ( ) epesents the mean of the all anks of dffeent QoS metcs of the oute. Then these outes wll be odeed based on the pme QoS metc. Among the odeed outes, the best outes n egad to pme QoS facto wll be selected, The evoluton appoach od false //oute dscovey pocess completon state opt φ //optmal oute set; ec = 0 ect = 0 //epesents maxmum evolutons theshold Whle (!od ) Begn nr φ Fo each oute fnd cossove ponts Begn Fo each oute { ( R } Begn nr Othogeness _ Evoluton (, ) R nr //addng new outes to R ec ec + If( ec ect )Begn and then they wll be odeed fom maxmum to mnmum of the qfs value. a) Exploaton of Othogeness Genetc Evoluton fo QoS Ftness Scope Awae Route Selecton The devsed othogeness GA pefoms pogessve evoluton pocess. In the context of optmal QoS awae oute dscovey, these pogessve evolutons wll be appled on set possble outes R found between souce and destnaton nodes. The numbe of evolutons s ntally lmted to max evoluton count gven, futhe, the kutoss [20] of the qfs dstbuton acoss the outes n esultant R s assessed. () If the kutoss of the qfs dstbuton s mesokutc (kutoss s equal to 3), whch ndcates that the vaaton of qfs dstbuton s eflectng modeate then the futhe evolutons contnues by adustng the max evoluton count to half of ts cuent value. () If dstbuton s eflectng leptokutc, whch ndcates the vaaton of the qfs dstbuton s hgh then the futhe evolutons contnues fo max evoluton count numbe of tmes. If dstbuton s platykutc, whch ndcates that the qfs dstbuton s wth neglgble vaaton, hence stop futhe evolutons. //pogessve evoluton, leadng to the development of a mpoved fom, as can be seen though successve geneatons R = puner( R ) ks = fnd_kutoss_of_qfs_dstbuton( R )//s fndng the kutoss state of the ftness dstbuton acoss the evolutons If ( ks = 3&& ect > ) Begn //mesokutc ect ect = 2 ec = 0 //contnues evolutons fo futhe ect tmes

8 Else f ( ks > 3 ) Begn//leptokutc ec = 0 Else f( ks 3 ) Begn //platykutc od tue Othogeness_evoluton(, ) BEGIN φ //s a set outes fomed fom cossove of, Fo each node { nhk nhk } Begn cop φ Fo each node { nhl nhl } Begn If ( nhk nhl ) Begn cop n hk Fo each { cp cp cop} Begn qfs = 0 z = φ Intesect at coss pont cp and fom and Intesect at coss pont cp and fom and Fom oute as If ( qfs( k ) Fom oute as > qfs Begn qfs = qfs( k ) z = k k // s left pat of coss pont cp n oute, // s ght pat of coss pont cp n oute // s left pat of coss pont cp n oute, // s ght pat of coss pont cp n oute φ cp φ cp //fomng oute by connectng left pat of and ght pat of //fomng oute by connectng left pat of and ght pat of 7

9 8 END f ( qfs( k ) > qfs Begn qfs = qfs( k ) z = k k z Fo each new oute { } Begn If ( qfs() < qfs( )& qfs() < qfs( ) ) Then delete fom Kutoss_of_qfs_dstbuton( R ) BEGIN Fnd mean of the qfs of all outes n R END ( QFS) R = µ = qfs( ) R Hee n the above equaton µ ( QFS) s the mean of qfs dstbuton ove all outes n R Fnd standad devaton (squae oot of vaance R = σ QFS = ( qfs( ) µ ( QFS)) R Hee n the above equaton Fnd kutoss of the qfs dstbuton acoss the outes n R In egad to ths, fst fnd the 4 th moment of the qfs dstbuton m4 = R = ( qfs( ) µ ( QFS)) R 4 2 σ QFS standad devaton of qfs dstbuton acoss the outes n R Hee n the above equaton m4 epesent the fouth moment of the qfs dstbuton m4 gr ( ) = σ QFS Hee n the above equaton grs ( ) epesentng the kutoss of the qfs dstbuton acoss the outes Retun gr ( ) IV. Empcal Analyss and Results Exploaton The empcal analyss was done by a smulated moble ad hoc netwo envonment, whch s buld by usng NS2 to vsualze and TCL to contol The netwo envonment buld on the smulaton s consdeng the andomzed node placement wth andom waypont moblty. The opted QoS metc values obseved at hop level edges on an event of tme was andomly dstbuted unde the context of poson dstbuton. The smulaton envonment was bounded to the paametes

10 exploed n table. The smulaton was opted to AODV stategy to dscove the possble outes between gven souce and destnaton nodes. Futhe to obtan the QoS ftness scope awae outes fom the dscoveed outes was done by usng the expesson language called R. The expements wee done on smulated netwo envonment wth dvegent count of nodes ange fom 50 (spase) to 250 (dense). In othe dmenson the expements wee done unde nodes wth dvegent moblty speeds. Table : Netwo constants fo smulaton envonment The ange of Nodes 50 to 250 The ange of moblty speed 0.5m to 3m/sec Communcaton Stategy MAC 802. DCF Netwo Occupancy 000 X 500 m2 Node tansmsson fequency scope 00 mete Packet type CBR & FTP Node Moblty Stategy Random way pont Smulaton Tme 00, 300 Sec The esults obseved fom expements ndcatng that the poposed Othogeness GA fo QoS ftness scope awae oute dscovey (QFSRD) s scalable and obust that compaed to GAMAN [8] and E-GAMAN [9]. The completon evoluton completon tme s consdeably low and scalable (see fgue 3), the evoluton complexty obseved at poposed QFSRD scalable and stable (see fgue 4). The skewness obseved fo QoS ftness dstbuton ove top n (hee n expements n = 0 ) esultant outes fom the QFSRD s low and optmal (see fgue 5). Fgue 4 : The completon tme obseved fo evolutons unde GAMAN,E_GAMAN and QFSRD Fgue 5 : The computatonal complexty obseved fo evolutons unde GAMAN, E-GAMAN and QFSRD Fgue 5 : Ftness dstbuton ove best n esultant outes fom GAMAN, E-GAMAN and QFSRD V. Concluson Othogeness based Genetc algothm has been devsed hee n ths pape, whch s n the context of QoS ftness scope awae oute dscovey fo moble ad hoc netwos. The lmts obseved n eale GA based QoS awae outng dscovey stateges called GAMAN [8] and E-GAMAN [9], motvated us to devse ths Othogeness based Genetc Algothm fo QoS ftness scope awae oute dscovey. Unlke these two models[8][9], the devse model s assessng the ftness of the oute by consdeng all QoS factos along wth pme QoS metcs such as connectvty, bandwdth. The pogessve evoluton stategy of othogeness appoach s anothe key contbuton of the poposed model. Ths pogessve evoluton mnmzes the numbe of evolutons compaed to the tadtonal GA wth eltst (best ft eman unchanged) stategy. The mao contbuton ths pape s the QoS ftness scope assessment stategy, unlke any exstng benchmang stateges that consdes a specfc QoS metc, the devsed ftness scope assessment model consdes many QoS factos along wth pme QoS metcs that ae elated to the outng context. In the best ou knowledge, 9

11 0 the ftness scope assessng and pogessve evoluton stateges ae used fst n the class of QoS awae outes dscovey. The expemental esults concludng the magnfed scalablty, optmalty and obustness of the poposed model that compaed othe benchmang stateges called GAMAN and E-GAMAN. Ths wo s nspng us fo futhe eseach. One futue decton of eseach would be fndng hybd soft-computng stateges fo QoS awae oute dscovey. Refeences Réféences Refeencas. C. E. Pens. Ad Hoc Netwong, Addson-Wesley, E. M. Roye, C. K. Toh. A Revew of Cuent Routng Potocols fo Ad Hoc Moble Weless Netwos, IEEE Pesonal Communcatons, Vol. 6, No. 2, 46 55, Apl S. Chen, K. Nahstedts. An Ovevew of Qualty of Sevce Routng fo Next-Geneaton HghSpeed Netwos: Poblems and Solutons, IEEE Netwo, Specal Issue on Tansmsson and Dstbuton of Dgtal Vdeo, Vol. 2, No. 6, 64 79, W. C. Lee, M. G. Hluchy, and P. A. Humblet. Routng Subect to Qualty of Sevces Constants n Integated Communcatons Netwos, IEEE Netwo, Vol. 9, No. 4, 46 55, H. Xao, W. K. G. Seah, A. Lo, K. C. Chua. A Flexble Qualty of Sevce Model fo Moble Ad-Hoc Netwos, Poc. of IEEE VTC2000, Tokyo, Vol., , May G. S. Ahn, A. T. Campbell, A. Vees, L. H. Sun. Suppotng Sevce Dffeentaton fo RealTme and Best-Effot Taffc n Stateless Weless Ad Hoc Netwos (SWAN), IEEE Tansactons on Moble Computng, Vol., No. 3, , S. B. Lee, G. S. Ahn, X. Zhang, A. T. Campbell. INSIGIA: An IP-Based Qualty of Sevce Famewo fo Moble, Jounal of Paallel and Dstbuted Computng, Vol. 60, No. 4, , Apl K. Chen, S. H. Shah, K. Nahstedts. Coss-Laye Desgn fo Data Accessblty n Moble Ad Hoc Netwos, Weless Pesonal Communcatons, Specal Issue on Multmeda Netwo Potocols and Enablng Rado Technologes, Vol. 2, No., 49 76, H. L. Chao, W. Lao. Fa Schedulng wth QoS Suppot n Weless, IEEE Tansactons on Weless Communcatons, Vol. 3, No. 6, , S. Chen, K. Nahstedt. Dstbuted Qualty-of- Sevce Routng n Ad-Hoc Netwos, IEEE Jounal on Selected Aeas n Communcatons, Vol. 7, No. 8, 8, R. Svakuma, P. Snha, V. Bhaghavan. CEDAR: a Coe-Extacton Dstbuted Ad-Hoc Routng Algothm, IEEE Jounal of Selected Aeas n Communcatons, Vol. 7, No. 8, , K. Wu, J. Hams. QoS Suppot n Moble Ad Hoc Netwos, Cossng Boundaes an ntedscplnay ounal, Vol., No., 92 06, Fall J. A. Stne, G. de Vecana. A Paadgm of Qualtyof-Sevce n Weless Usng Synchonous Sgnalng and Node States, IEEE Jounal on Selected Aeas n Communcatons, Vol. 22, No. 7, 30 32, L. Chen, W. B. Henzelman. QoS-Awae Routng Based on Bandwdth Estmaton fo Moble Ad Hoc Netwos, IEEE Jounal on Selected Aeas n Communcatons, Vol. 23, No. 3, , Specal Issue on Computatonal Intellgence n Telecommuncaton Netwos, Compute Communcatons, Vol. 25, No. 6, L. Baoll, A. Koyama, T. Suganuma, N. Shato. GAMAN: A GA Based QoS Routng Method fo Moble Ad-hoc Netwos, Jounal of Inteconnecton Netwos (JOIN), Vol. 4, No. 3, , D. E. Goldbegs. Genetc Algothms n Seach, Optmzaton, and Machne Leanng, Addson- Wesley, Baoll L, Koyama A, Suganuma T, Shato N. GAMAN: a GA based QoS outng method fo moble Ad-Hoc netwos. Jounal of Inteconnecton Netwos 2003;4(3): Leonad Baoll, Makoto Ikeda, Guseppe De Maco, Aan Dues, Ako Koyama and Jo Iwashge; "A Seach Space Reducton Algothm fo Impovng the Pefomance of a GA-based QoS Routng Method n Ad-Hoc Netwos"; Intenatonal Jounal of Dstbuted Senso Netwos, Taylo & Fancs Goup, LLC, ISSN: pnt/ onlne, 3: 4 57, 2007; DOI: 0.080/