Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks

Transcription

1 February (1): wwwscencerectcom/scence/ournal/ he Journal of Chna Unverstes of osts an elecommuncatons Improve ant colony-base mult-constrane QoS energy-savng routng an throughput optmzaton n wreless A-hoc networs WANG Ya-l 1 () SONG Me 1 WEI Y-fe 1 WANG Yng-he 2 WANG Xao-un 3 1 School of Electronc Engneerng Beng Unversty of osts an elecommuncaton Beng 1876 Chna 2 Chnese Acaemy of Scence Shangha Insttute of Mcrosystem an Informaton echnology Shangha 25 Chna 3 School of Electronc Engneerng ubln Cty Unversty ubln 9 Irelan Abstract In orer to establsh a route supportng mult-constrane qualty of servce (QoS) ncrease networ throughput an reuce networ energy consumpton an mprove ant colony-base mult-constrane QoS energy-savng routng algorthm (IAMQER) s propose he ant colony algorthm as one of the avalable heurstc algorthm s use to fn the optmal route from source noe to estnaton noe he propose IAMQER algorthm whch s base on the analyss of local noe nformaton such as noe queue length noe forwarng number of ata pacets an noe resual energy balances the relatonshp between the networ throughput an the energy consumpton thus mprovng the performance of networ n mult-constrane QoS routng Smulaton results show that ths IAMQER algorthm can fn the QoS route that reuce average energy consumpton an mproves networ pacet elvery rato uner the en-to-en elay an pacet loss rato constrants Keywors wreless A-hoc networ mult-constrane QoS routng ant colony algorthm energy-savng throughput optmzaton 1 Introucton Wreless A-hoc networs are self-organzng networs wthout statc topology an centralze amnstraton Hence each noe n the wreless A-hoc networs not only can be a possble source noe or estnaton noe of pacet but also can act as a router for other pacets relay ratonal routng protocols cannot be apple to wreless A-hoc networ rectly because wreless A-hoc networs has many unque characterstcs an unavoable constrans such as ynamc topology banwth-lmte unrectonal wreless channel varable-capacty ln an energy-lmte operatons compare wth both wre an cellular networs Moreover wth the fast evelopment of hgh-spee transmsson technque an multmea applcaton QoS guarantee n wreless A-hoc networs has been taen nto account serously QoS s usually efne as a set of Receve ate: Corresponng author: WANG Ya-l E-mal: beyouwyl@163com OI: 1116/S (14) servce requrements whch are expecte to be guarantee whle transportng pacets from source noe to estnaton noe [1] QoS metrcs usually nclues banwth en-to-en elay tter pacet loss rato energy consumpton an so on he QoS metrcs can be ve nto three categores: actve concave an multplcatve Among these QoS metrc banwth an energy consumpton are concave metrc whle en-to-en elay an tter are atve metrcs [2] he essental tas of QoS routng s to fn a feasble path from source noe to estnaton noe whch shoul satsfy QoS constrants [3] However because of the lmte banwth an ynamc topology supportng QoS s a mult-constrane QoS routng problem Conserng the mult-constrane QoS routng s a N-complete problem t s avse to utlze heurstc algorthms to establsh a mult-constrane QoS route an optmze the networ performance ncators Recently there are many heurstc algorthms such as genetc algorthm smulate annealng algorthm artfcal neural networ an so on Ant colony algorthm (ACA) whch was propose by orgo et al [4] nspre by the

2 44 he Journal of Chna Unverstes of osts an elecommuncatons 214 foragng behavor of ant colones s one of bonc algorthms he avantages of ant colony algorthm are strbutng computaton postve feebac an constructve gree heurstc Amng at establshng route savng energy an optmzng the throughput of wreless A-hoc networs uner the mult-constrane QoS conton ths paper proposes an IAMQER Frstly ths paper efnes some parameters an establshes system moel an mathematcal moel n whch the obectve functon s the mum value of path evaluaton functon whch are relate to the networ average energy consumpton the total length of route the en-to-en elay an the pacet loss rato of route Bese two constrans are en-to-en elay an pacet loss rato Seconlyths paper apples IAMQER algorthm to fn the optmal route he algorthm taes noe forwarng capablty noe queue length an noe resual energy nto account for avong networ congeston an balancng the each noe energy consumpton In orer to save networ average energy consumpton the algorthm austs noes transmt power ynamcally accorng to the fferent stance between two noes Fnally ths paper taes performance testng of the algorthm an obtans some parameters such as pacet elvery rato pacet loss rato average en-to-en elay networ average energy consumpton an noe resual energy hs paper s organze as follows: Sect 2 revews bacgroun nformaton an the wors relate to our esgn Sect 3 presents system moel an parameter efnton Sect 4 proposes the IAMQER to optmze networ routng mechansm performance Sect 5 proves some smulaton results an analyss In Sect 6 ths paper summarzes the conclusons 2 Bacgroun an relate wors 21 ACA he basc ea of the ACA s orgnate from the foo searchng behavor of real ants Gven a graph G= V E two noes V are neghbors f there s a ln E K presents the ants set n algorthm When ants epart from the nest to search for foo they wal along the way When an ant reaches an ntersecton t wll ece whch branch roa leang to foo accorng to the probablstc transton rule as shown n Eq (1) he probablstc choce s base by pheromone trals prevously eposte on the graph by other ants At the begnnng of the search proces a constant amount of pheromone (eg 1 E) s assgne to all the eges Once an ant K locates at a noe t uses the pheromone trals to compute the probablty of choosng next noe ; N p z (1) zn ; N where N s the neghborhoo set of noe s the parameter that control the relatve mportance of the pheromone tral Ants move from one noe to another noe usng ths ecson polcy repeately untl they reach the estnaton noe ue to fferences among the ant s path the tme step at whch ants reach the estnaton noe s fferent urng the ants way fnng proces ants epost pheromone on the way whch mars that ants have wale through the route If the ant traverses the ln t eposts an amount of pheromone on ln an changes the pheromone value Atonally artfcal pheromone evaporaton also plays the mportant functon of bounng the mum value achevable by pheromone trals he pheromone evaporaton s nterleave wth the pheromone epost of the ants Hence pheromone trals of all the eges are upate by the followng equaton: 1 + ; E (2) K where 1 s an evaporate factor Fnally more an more ants are attracte by the pheromone trals an n turn renforce the pheromone even more Accorng to these scplnes escrbe above ths behavor of ants can be use to fn out a route that satsfes mult-constrane QoS n A-hoc networs [5] In ths paper the ants represent a set of routes from all source noes to estnaton noes an each noe mantans a probablstc routng table that s also calle pheromone tables Accorng to the probablstc routng table ants choose the next hop noe wth hgher probablty whch s those lns have hgher pheromone values An each ant searches the optmal route raply by applyng the local upatng rule an the global upatng rule Fnally all the ants converge to the global optmal soluton whch s the global optmal route

3 Issue 1 WANG Ya-l et al / Improve ant colony-base mult-constrane QoS energy-savng routng an Relate wors QoS requrement such as those for multmea applcatons wth banwth an energy constrant has been ntensvely stue recently as an ssue for moble A-hoc networs (MANEs) Noe moblty an wreless rao propertes mae t more ffcult to prove QoS n MANEs than n wre networs he QoS guarantee s a new challenge for MANEs ratonal routng algorthms for MANE such as A-hoc on-eman stance vector routng (AOV) an ynamc source routng protocol (SR) cannot meet ths requrement QoS routng for MANEs can be approxmately classfe nto two man paragms: hop-by-hop an source QoS routngs In the hop-by-hop QoS routng each noe montors ts own local state nformaton an exchanges them to the other noes n the networs hs nformaton wll be use n route selecton process as QoS routng metrc whch s strbute n each ntermeate noe along the path In Ref [6] Ge et al use the heurstc algorthms n the optmze ln state routng (OLSR) protocol to fn the mum banwth path from source to estnaton by mofyng multpont relays (MRs) an route selecton process he QoS optmze ln state routng protocol (QOLSR) [7 8] was propose to allow each noe to select the mum banwth ln However f there are several lns wth the same banwth the mnmum elay ln wll be consere Hence such an algorthm s calle shortest-west path algorthm In Ref [9] the QoS supporte routng protocol base on OLSR an the class base queue (CBQ) n MANEs was propose In orer to mnmze the en-to-en elay for QoS flow ths paper apples CBQ to the OLSR In CBQ t nserts the pacet to the approprate class queue an eces whch class queue s allowe to transmt the pacets QoS routng s also mplemente to select the shortest path satsfyng the banwth requrement for QoS flow In source QoS routng the source noe ntates the request pacet of the ln to the estnaton n orer to collect the local state nformaton store n each noe to consttute the global state nformaton of the networ an then chec the constrane path whether t has enough resource to support the requre applcatons or not Consequently the path wll be selecte whch satsfes the QoS requrements In Ref [1] t propose an A-hoc QoS on-eman routng (AQOR) whch proves en-to-en QoS support base on banwth an en-to-en elay hu the path s avalable n terms of smallest en-to-en elay wth banwth guarantee he aaptve spersty QoS routng (AQR) protocol [11] base on SAFAR [12] fns multple sont paths wth longer-lve connectons base on sgnal strength Route mantenance has been mplemente n orer to recover the new route when the ol route s broen Most of these QoS routng algorthms escrbe above conser only one or two QoS metrcs to fn feasble paths from source to estnaton hey conser one QoS parameter at a tme an f there s a te another QoS metrc wll be trggere However they neglect the other mportant QoS parameters such as tter pacet loss rato relablty an etc Hence they may not be approprate an flexble enough to support all ns of applcaton snce they requre fferent QoS constrants However the problem to fn the feasble path base on multple QoS metrcs s consere to be N-complete herefore many heurstc algorthms have been propose to solve mult-constrane path (MC) an mult-constrane optmal path (MCO) problems n tratonal networ wth statc topology Specally an ant colony optmzaton (ACO) as the one of the heurstc algorthms has been wely use n the mult-constrane QoS routng for MANEs In the past few year there have been numerous ant colony-base QoS routng algorthms n wreless A-hoc networs Emergent A-hoc routng algorthm (EARA) enhance wth QoS (EARA-QoS) [13] uses metrcs from fferent layers to mae routng ecsons But the algorthm only consers the elay constran A QoS enable ant colony base multpath routng (QAMR) [14] consers banwth elay an hop count as the QoS parameters along wth the stablty of noe number of hops an path preference probablty factors for selectng path But the algorthm oes not tae the congeston an throughput nto account at hgher traffc loa An energy-effcent genetc algorthm mechansm to resolve QoS multcast routng problem [15] whch epens only on boune en-to-en elay an mnmum energy cost of the multcast tree Furthermore there have been else numerous routng protocols to prove QoS for MANE for example the AOR [16] the mult-path ynamc source routng protocol (M-SR) [17] the tcet-base probng algorthm (B) [18] an so on AQR s a banwth constrane multple-path on-eman routng protocol for

4 46 he Journal of Chna Unverstes of osts an elecommuncatons 214 A-hoc networs to support en-to-en QoS he route scovery algorthm s to fn multple sont paths wth longer-lve connecton when each path also specfes assocate networ resource nformaton M-SR s a strbute mult-path ynamc source routng protocol to mprove QoS support wth respect to en-to-en relablty In a sort of eal moel B avances a tcet-base QoS routng protocol whch stuy two sorts of routng problems: elay-constrane least-cost routng an banwthconstrane least-cost routng But all these protocols o not conser the congeston an resual energy of noes to QoS routng Other approaches mae use of geographcal locaton nformaton for routng [19 2] hese prevous wors prmarly apple tratonal approaches to routng n wre networs to the more volatle networ envronment experence n MANEs Whle many optmzatons to these above algorthms exst they stll suffer from lac of effcency an scalablty wth respect to the mult-constrane QoS paper K s efne as the ants set he ant K selects the next hop noe from the current noe at each tme step startng from source noe s S untl reachng the estnaton noe Hence each ant wll obtan the route p from every source noe s S to every estnaton noe consttutng the route set ={ p ss } s 3 System moel an parameter efnton 31 Networ topology an traffc moel In orer to escrbe real A-hoc networs topology correctly ths paper assumes that networ moel s as follows: N noes locate n a LmL m regon ranomly Each noe has the same mum transmt range R he neghbor noe of noe s efne as a noe that s wthn the transmsson range of noe M pars of source noes an estnaton noes are ranomly chosen from noe set V whch form the source noe set S an the estnaton noe set he rao propagaton moel s a free space moel As shown n Fg 1 he A-hoc networ s consere as a connecte an unrecte graph Let GV ( E ) be use to represent the A-hoc networ where V enotes the fnte set of networ noes an E enotes the fnte set of b-rectonal ln N s a set of neghbor noe of noe but not nclung noe an each noe has fferent transmt range wth fferent transmt power If noe s wthn the transmt range of noe there s a b-recton ln e between noe an noe e E Bese the route p from source noe s S to estnaton noe s consttute of the no loop sequence of relay noe ps { } In the IAMQER presente n ths Fg 1 he moel of moble A-hoc networs In aton the traffc moel s escrbe as follows: at every tme step there are B s pacets generate from every source noe s an let R B presents the total pacets ss generate n the networs at each tme step Source noe estnaton noes an all other relay noes can elver as much as C ata pacets towars ther neghbor noes at every tme step Once a pacet arrves at ts estnaton t wll be remove from the networ he queue length of each noe s assume to be lmte an follows the frst n frst out (FIFO) prncple Furthermore an mportant scplne s that a ln between a par of noes cannot be vste more than twce to avo loops Wthout ths rule the throughput of the networ may be very low because that a large number of ata pacets are elvere along the same lns unnecessarly many tme thus ncrease the elay In the traffc moel ths paper efnes all noes as both hosts an routers for generatng an elverng ata pacets 32 arameter efnton In ths paper there are several parameters efne as follows: s

5 Issue 1 WANG Ya-l et al / Improve ant colony-base mult-constrane QoS energy-savng routng an 47 able 1 erformance metrcs name acet elvery rato ps acet loss rato L ps ower levels Route average energy consumpton E ps Networ average energy consumpton E net Noe performance factor Smulaton performance metrcs F ath evaluaton functon V ps Average en-to-en elay Balance rato functon Noe number wth resual energy above 5% 33 A-hoc networs QoS routng moel efnton he rato of the number of ata pacets receve by estnaton noes to the number of ata pacets orgnate at source noes he rato of the number of ata pacets scare by noes to the number of ata pacets orgnate at source he contnuous graes of noe transmt power accorng to the fferent transmsson stance between noes an they are proportonal relatonshp he average energy consumpton by all noe whch s use to transmt ata pacets between all source an estnaton he average energy of all noes consume n networ at the tme when the communcaton termnates A metrc to escrbe congeston status of a noe It s proportonal to noe queue length the number of forware ata pacets an the resual energy of noe A metrc to present the performance of route from source noe to estnaton noe It s relate to the en-to-en elay the pacet loss rato of route the energy consumpton n the route an the total length of route he average elay between the tme step at whch ata pacets are orgnate at the source noes an the tme step at whch these ata pacets reach estnatons he rato of the number of ata pacets receve by estnaton noes to the average en-to-en elay of networ he number of noe wth the resual energy above 5% of ntal energy In ths paper there are two QoS assocate wth each route p from source noe s S to estnaton noe nclung average en-to-en elay an pacet loss rato to be measure he elay of a route p s efne as Eq (3): Bs b t ps b1 p (3) s Bs where B s the total number of pacets generate by source noe s b t s the tme of a pacet b transmtte from source noe s to estnaton noe along the route he pacet loss rato as Eq (4): L of a route p s efne L ps where 1 (4) re ps st ps re s the number of pacet recepton transmtte st along the route p s the total number of pacet generate by source noe s an transmtte along the route p to estnaton noe Bese n orer to measure the performance of route set presente by ant K whch nclues all the path p from source noe s S to estnaton noe ths paper efnes a path evaluaton functon as Eq 5): f f L V ; K C C ; E p l ps s p s ss ss f l ; p p s s ss f L Lr L L ; p p s s ss l Z 1; Z (5) vl ps ; otherwse 1; Z Lr Z vlr ps ; otherwse vl p e p s s L L vlr p e p s s where are postve weghts of L p p V f f E l respectvely whch ncate the relatve mportant of en-to-en elay pacet loss rato average energy consumpton an average path length n the path evaluaton functon he C s the cost metrc parameter whch s proportonal to the average energy consumpton Z Z are an average path length he l an Lr metrc functon Z s the metrc functon of l en-to-en elay If the value of elay can satsfy the elay constran then the value of l Z s 1 otherwse the value s vl vl 1 an the greater the fference between the en-to-en elay of path an the elay constran value the value of v l s smaller Smlarly

6 48 he Journal of Chna Unverstes of osts an elecommuncatons 214 Lr Z s the metrc functon of pacet loss rato If the value of pacet loss rato can satsfy the pacet loss rato constran Z s 1 else the L then the value of Lr value s v v 1 Lr an the greater the fference between the pacet loss rato of path Lr loss rato constran value L an the pacet L the value of v Lr s smaller Accorng to the Eq (5) the value of path evaluaton functon V s proportonal to the cost metrc parameter C an s nversely proportonal to the metrc functon of en-to-en elay loss rato L f an the metrc functon of pacet f Moreover the cost metrc parameter s proportonal to the route average energy consumpton E an the route length l Hence t can erve that the more route average energy consumpton s an the longer route length the value of cost metrc functon s greater an the value of path evaluaton functon s smaller It presents that the route performance n the energy consumpton an route length are worse Smlarly accorng to the expresson of the metrc functon of en-to-en elay l Z an the metrc functon of Z t can also erve that f much pacet loss rato Lr more route meets the elay or pacet loss rate constrant conton the value of the metrc functon f s greater Otherwse f much more route cannot satsfy the en-to-en elay or pacet loss rato constrant furthermore the greater the fference between the en-to-en elay of path an the elay constran value or the greater the fference between the pacet loss rato of path L an the pacet loss rato constran value L are the value of the metrc functon f s smaller In aton as mentone earler each ant wll obtan the route p from every source noe s S to every estnaton noe consttutng the route set { p ss } an each ant n ants set K s presents a route respectvely herefore comparng the value of path evaluaton functon V among route set the mum s the route the value s V An the mnmum s the worst route the value s C worst V An ths paper efnes as the global route set whch has the mum value of the path evaluaton functon In ths paper noe performance factor efne as Eq (6): r unt unt E t F t aq 1 t a2 t a3 1 E where a1 a2 a3 unt are postve weght noe unt queue length at current tme step F whch s (6) Q t s the unt t s the noe unt forwarng pacet number at current tme step E s the ntal energy of noe; E t s the resual energy of noe at current tme step In orer to reflect the nfluence mae by the hstorcal noe local nformaton on the present noe loa factor these two parameters unt Q t an unt t are upate as Eq (7) an Eq (8) at every tme step: unt Q () t (1 ) Q ( t1) Q () t (7) Q unt () t (1 ) ( t1) () t (8) where Q () t s the noe queue length at current tme step Q ( t 1) s the noe queue length at last tme step an Q s the forwarng pacet number of hstory () t s the forwarng pacet number at current tme step ( t 1) s the forwarng pacet number at last tme step an s the forwarng pacet number of hstory an are constant they can be chosen between an 1 he bgger the values are the current status of noe have the bgger proporton n these two unt unt parameters Q t an t In the smulaton two parameters an are set to 7 Hence accorng to the Eq (5) the bgger the values of en-to-en elay pacet loss rato average energy consumpton an length of path are the value of path evaluaton functon s smaller Hence the performance of ths path s worse In aton accorng to the Eq (6) the bgger the values of the noe unt queue length an the noe unt forwarng pacet number are the smaller the resual energy of noe s an the value of noe performance factor s bgger Hence the performance of ths noe s worse whch ncates that ths noe s too busy to have a greater probablty of eath herefore ths paper apples the IAMQER algorthm to fn out a route set p establshe by the ant whch has the mum value of path evaluaton parameter r V

7 Issue 1 WANG Ya-l et al / Improve ant colony-base mult-constrane QoS energy-savng routng an 49 amng for ncreasng networ throughput reucng networ energy consumpton an mprovng QoS routng 34 roblem formulaton As escrbe above ths paper presents a multconstrane QoS energy-savng routng an throughput optmzaton algorthm base on the mprove ACA whch s use to solve mathematcal moel of optmzaton problem whch s efne as Eq (9): arg V K st (9) K s S ps L L K s S ps where Eq (5) V s the path evaluaton functon an efne as p s the route set establshe by ant K p s the route from source noe s S to every estnaton noe establshe by the ant whch consttutes the route set { p ss } s the global route set s an L are the en-to-en elay an the pacet loss rato of route respectvely an L are the elay constran value an the pacet loss rato constran 4 IAMQER algorthm 41 Rules of IAMQER algorthm 1) he state transton rule In the IAMQER algorthm the ant K selects the noe whch has the mum transfer probablty as the next hop from the current noe at each tme step he transfer probablty p s calculate as below: t ( t) ; qq n N p t t t (1) ; q q nn z t z t zn q FN count E (11) N where t s the pheromone ntensty of the ln connectng noe an noe ; () t s a heurstc functon that s efne as the vsblty of ln between noe an noe N s the set of neghbor noe of noe but not nclung noe ; an are parameters that control the relatve mportance of tral versus vsblty q s a ranom number unformly strbute n 1 q s a ynamc parameters that ncreases graually wth ncreasng n the number of teratons accorng to Eq (11) q etermnes the relatve mportance of explotaton versus exploraton At the begnnng the smaller the value of q the algorthm s more lely to search possble solutons an avos fallng nto the local optmal soluton prematurely However at the en the bgger the value of q the algorthm s more lely to converge to a global optmal soluton In the Eq (11) E an F are constant parameter an the value of them are 2 an 7 usually N count s the number of teratons an N s the mum number of teratons In ths algorthm of the paper heurstc functon () t s efne as below: 1 () t F (12) where F s the performance factor of noe s the stance between noe an noe an s proportonal constant s a loss constant between 2 an 5 that epens on the wreless meum 2) he local upatng rule After an ant move from noe to the noe the pheromone ntensty on the selecte ln t s upate locally accorng to Eq (13) Local pheromone upate mechansm can expan the search range of feasble solutons an n ths way ants can mae better use of ther pheromone tral nformaton Wthout local upatng all ants wll only search n a narrow neghborhoo of the optmal prevous route t1 1 t (13) where 1 s the local pheromone ecay parameter s the ntal value of the pheromone 3) he global upatng rule Once all ants have fnshe searchng for a set of routes from source noe to estnaton noe one tme the global upatng of the pheromone taes place Frstly the path evaluaton functon V whch contans values of all paths between source noe s S an estnaton noe belongng to the route set p s calculate hen

8 5 he Journal of Chna Unverstes of osts an elecommuncatons 214 the pheromone ntensty of ln t s upate globally accorng to Eqs (14) an (15) t1 1 t t (14) t a 4 ; V (15) ; others 1 s the global pheromone ecay where parameter; a 4 s constant for rewarng the pheromone presents the global route set nclung all paths p from all source noes to estnaton noes s the ncrement of the pheromone ntensty of ln whch s proportonal to the mum value of path evaluaton functon belongs to global V f ln route Accorng to Eqs (14) an (15) the pheromone trals of the route offer ncentve ntens to prove a greater amount of pheromone to the path so t can gue other ants to move towar the soluton It s a postve feebac proces whch can accelerate the convergence spee greatly 42 he steps of IAMQER algorthm he steps of IAMQER algorthm are elaborate as follows: Step 1 Intalzaton: set the total number of networ noesthe total number of ant the mum value of a noe queue length the mum number of teratons N an reset the number of teratons N count Intalze the pheromone ntensty of each ln wth the noe ntal energy wth E an the noe ntal power level between noe an noe wth Bese generate source noe set S an estnaton noe set ranomly Ant K s generate at source noes s S an establshes route set nclung route p between every source an estnaton noes va path traversal of all source an estnaton par whch s { p ss } s Step 2 Establsh the networ topology agram accorng to the characterstcs of the real A-hoc networs As the result get the networ aacency matrx A an the noe neghbor set N Calculate the noe egree wth the networ aacency matrx Step 3 Each ant chooses the next hop noe accorng to the transfer probablty p efne n the state transton rule an aust the noe power level ynamcally n accorance wth the stance between noe an noe At the same tme each ant fns the next hop begnnng from source noe s untl reach the estnaton noe an obtans the route p Step 4 When an ant choose ts next hop noe successfully the pheromone ensty on the ln wll be mofe base on the local upatng rule Repeat Step 3 an Step 4 untl the ant establshes the route set { p ss } s Step 5 When each ant obtans a route set between pars of source noes an estnaton noes successfully calculate the path evaluaton functon V p of every route set nclung the metrc functon of en-to-en elay f an the metrc functon of pacet loss rato p s L f of route set the energy consumpton E an the total length l of path p Meanwhle p s calculate a noe performance factor F wth the noe unt queue length Q unt the noe unt forwarng pacet unt r number an the resual energy E of noe hen fn the mum value of path evaluaton functon V s an the global route set Step 6 Accorng to the global pheromone ensty upatng rule upate the pheromone ensty of the ln belongng to the global route set Step 7 If the termnaton conton Ncount N s met fnsh the process; otherwse N count plus one an return to Step 3 5 Smulaton results an analyss In ths secton we evaluate the performance of IAMQER algorthm through smulaton an compare t wth the shortest route base on stra algorthm an a purely on eman MANE routng protocol AOV s enhance to prove QoS calle NQoS AOV [21] whch consers the en-to-en elay banwth an the noe-par connectvty QoS nex We conser the A-hoc networs of 1 noes ranomly locate n a 1 m 1 m regon; each noe has the mum transmt range of 25 m he ntal unt energy of every

9 Issue 1 WANG Ya-l et al / Improve ant colony-base mult-constrane QoS energy-savng routng an 51 noe s 1 he unt energy consumpton of senng the ata pacet at each tme step s proportonal to the stance he mum noe queue length s set to 2 an choose 5 pars of source noes an estnaton noes ranomly from 1 noes In the smulaton we assume that the total number of ants s 1 the mum number of teratons s 15 an the ntal pheromone ensty s 1 In ths algorthm assume an 7 he noe capacty C that s the number of ata pacets a noe can forwar to other noes each tme step s assume to be a constant In ths paper we set C to be 1 an the total tme steps are assume to be 25 he smulaton result whch llustrate the comparsons between our scheme an the shortest route are shown as follows: 1) acet elvery number analyss Fg 2 ncates the pacet elvery number of three routng algorthms for the case the number of ata pacets generate n the networ at each tme step s vare from 1 to 25 respectvely the mum transmsson capacty state 2) acet elvery rato an pacet loss rato analyss Fgs 3 an 4 ncate the pacet elvery rato an pacet loss rato of three routng algorthms for the case when the number of ata pacets generate n the networ at each tme step R s vare from 1 to 25 respectvely For all the approache there s a ecrease n pacet elvery rato an ncrease n pacet loss rato when the R ncreases he results ncate that there s an mprovement n pacet elvery rato an pacet loss rato usng IAMQER compare wth the other two routng algorthms Fg 3 acet elvery rato comparson uner fferent pacet generaton rates Fg 2 acet elvery number comparson uner fferent pacet generaton rates As shown n Fg 2 at the begnnng the pacets elvery number of three route algorthms ncreases wth the networs pacet generaton rate R ncreasng But the overall tren of pacets elvery number of the IAMQER s bgger than the stra an NQoS AOV he ey contrbuton to ths mprovement s that IAMQER consers the noe queue length that the IAMQER can avo more ata pacets s elete ue to the ata pacets number excees the noe queue length hu the IAMQER can mprove the number of ata pacets receve by estnaton successfully However when the pacet generaton rate ncreases to a certan value the pacets elvery number s unchange that networ s Fg 4 acet loss rato comparson uner fferent pacet generaton rates As shown n Fg 3 pacet elvery rato of the IAMQER s hgher than the stra an NQoS AOV he ey contrbuton to ths sgnfcant mprovement n pacet elvery rato s the fact that IAMQER consers the noe forwarng pacet capacty an the noe queue length that the noe performance factor has been ntrouce whereas the shortest route an NQoS AOV have not ue to these factor IAMQER algorthm can reuce the local congeston Smlarly ths scheme also brngs mprovement n pacet loss rato As shown n Fg 4 the pacet loss rato of the IAMQER s lesser than the

10 52 he Journal of Chna Unverstes of osts an elecommuncatons 214 shortest route an NQoS AOV Beses of the noe performance factor ths paper efnes the path evaluaton functon V whch consers the pacet loss rato to p measure the performance of route set p so that selectng a route wth mnmal pacet loss rato to forwar ata pacets by means of the postve feebac of ant colony algorthm whch can reuce networ pacet loss rato 3) Average en-to-en elay an balance rato functon analyss Fg 5 splays the average en-to-en elay of three route algorthms an Fg 6 splays the balance rato functon of these routng algorthms wth varyng number of ata pacets generate rate n the networ at each tme step Fg 5 Average en-to-en elay comparson uner fferent pacet generaton rates stra an NQoS AOV as shown n Fg 6 that the pacet elvery number s more bgger uner the unt en-to-en elay of the IAMQER an the IAMQER has mprovement n the pacets elvery capacty hs s ue to the fact that IAMQER focuses on fnng a route that can balance the pacets elvery number an average en-to-en elay by means of the path evaluaton functon V conserng the pacets elvery rato an the average p route length to measure the performance of route set an the postve feebac of ant colony algorthm but the shortest route an NQoS AOV only conser the route length an elay whch leas the number of ata pacets n some noes to be beyon the noe forwarng pacet capacty so that ecreases the pacets elvery number an leas to the poor effcency of pacets receve successfully On the one han selectng a route wth mnmal elay to forwar ata can reuce networ elay le the stra an NQoS AOV algorthm On the other han IAMQER algorthm ntrouces the noe loa factor an the path congeston factor nclung the noe forwarng pacet capacty an the noe queue length whch can ecrease the local congeston an avo noe loa mbalance that lea to elay ncrease hese mply that IAMQER can be balance between pacets elvery number an average en-to-en elay 4) Average energy consumpton an noe number wth resual energy above 5% analyss Fgs 7 an 8 show the average energy consumpton of three routng algorthms at fferent number of ata pacets generate n the networ at each tme step an the number of noe wth resual energy above 5% of ntal energy n the networ respectvely p Fg 6 Balance rato functon comparson uner fferent pacet generaton rates From the result although the average en-to-en elay n the IAMQER algorthm s bgger than the stra an NQoS AOV as ncrease n the number ata pacets generate n the networ there s an obvous ncrease n the balance rato functon of the three route algorthms an the functon value of the IAMQER s bgger than the Fg 7 Networ average energy consumpton comparson uner fferent pacet generaton rates

11 Issue 1 WANG Ya-l et al / Improve ant colony-base mult-constrane QoS energy-savng routng an 53 Fg 8 Noes wth more than half resual energy uner fferent pacet generaton rates As ncrease of the networ pacets generaton rate three route algorthms show sgnfcant rse n networ average energy consumpton he results n Fg 7 ncate that the networ average energy consumpton of IAMQER s lesser than that of the shortest route an NQoS AOV n the same crcumstances In aton the results n Fg 8 ncate that the number of noe wth resual energy above 5% of ntal energy of IAMQER s more than that of the other two route algorthms at the same pacet generaton rate hs s because IAMQER taes noe resual energy nto account when fnng routes an consers the noe forwarng pacet capacty an the noe queue length to avo eath of hot noes untmely thus balancng the energy consumpton of each noe Bese the shortest route an NQoS AOV o not tae measures to networ energy consumpton an ust uses the efault mum power to transmt ata whch wll consume more energy Some noes of burenng heavy flow excessvely consume ther energy thus the corresponng resual energy s less ue to uneven energy consumpton However IAMQER consume less energy because of usng the effectve power aust scheme Accorng to the fferent stance between two noe noes aust the power to transmt ata pacets ynamcally on the bass of power level By ths way IAMQER can gan 923%~263% energy savngs than the stra an NQoS AOV thus prolongng the hot noes lfetme hese results show that IAMQER can save the networ energy consumpton an prolong route lfe 6 Conclusons hs paper presents an mprove IAMQER whch can establsh a route supportng mult-constrane QoS ncrease networ throughput an reuce networ energy consumpton by means of ant colony algorthm erformance evaluaton usng Matlab smulator comparson wth the shortest route algorthm an NQoS AOV shows that the mportance of conserng the noe forwarng pacet capacty the noe queue length an the noe resual energy n route establshng process an the transmt power austng scheme n ata pacets forwar In aton ths paper efnes a path evaluaton functon to evaluate the performance of routes an uses teraton an postve feebac of ant colony algorthm to establsh a route whch can better mae use of local nformaton Smulaton results show that IAMQER algorthm propose by ths paper can not only reuce networ energy consumpton thus prolongng the hot noe lfetme but also mprove pacet elvery rato sgnfcantly n two constrants of average en-to-en elay an pacet loss rato thus ncreasng networ throughput For future wor we wll focus on the mplementaton to mprove the algorthm Our further nvestgatons nclue experments wth hgh networ loa an more complete networ topology Bese other factors can mprove routng performance to satsfy more networ requrement wll also be consere n our routng algorthm Acnowlegements hs wor was supporte by the Natonal Natural Scence Founaton of Chna (611117) the Beng Hgher Eucaton Young Elte eacher roect References 1 Chen L Henzelman W B A survey of routng protocols that support QoS n moble A-hoc networs IEEE Networ 27 21(6): Karm M eng Challenges for qualty of servce (QoS) n moble A-hoc networs (MANEs) roceengs of the IEEE 1th Annual Wreless an Mcrowave echnology Conference (WAMICON 9) Apr Clearwater FL USA scataway NJ USA: IEEE 29: 5p 3 Zhang B Mouftah H QoS routng for wreless A-hoc networs: problem algorthm an protocols IEEE Communcatons Magazne 25 43(1): orgo M Gambarella L M Ant colony system: a cooperatve learnng approach to the travelng salesman problem IEEE ransactons on Evolutonary Computaton (1): orgo M Brattar M Stutzle Ant colony optmzaton IEEE Computatonal Intellgence Magazne 26 1(4): Ge Y Kunz Lamont L et al Qualty of servce routng n A-hoc networs usng OLSR roceengs of the 36th Annual Hawa Internatonal Conference on System Scences (HICSS 3) Jan Bg Islan HI USA Los Alamto CA USA: IEEE Computer Socety 23: 9p o p 59

12 Issue 1 U Xu-uan et al / LB-AGR: level-base aaptve geo-routng for unerwater sensor networ 59 acoustc sensor networs IEEE ransactons on Wreless Communcaton 21 9(9): Huang C J Wang Y W Lao H H A power-effcent routng protocol for unerwater wreless sensor networs Apple Soft Computng (2): Zhou Z engt Z Cu J H et al Hanlng trple hen termnal problems for mult-channel MAC n long-elay unerwater sensor networs roceengs of the 29th Annual Jont Conference of the IEEE Computer an Communcatons (INFOCOM 1) Mar San ego CA USA scataway NJ USA: IEEE 21: 5p 5 Zhou Z Cu J H Energy effcent mult-path communcaton for tme-crtcal applcatons n unerwater sensor networs roceengs of the 9th ACM Internatonal Symposum on Moble A Hoc Networng an Computng (MOBIHOC 8) May Hong Kong Chna New Yor NY USA: ACM 28: Guo Z Colombo G Wang B et al Aaptve routng n unerwater elay/srupton tolerant sensor networs roceengs of the 5th Annual Conference on Wreless on eman Networ Systems an Servces (WONS 8) Jan Garmsch-artenrchen Germany scataway NJ USA: IEEE 28: u X J An ntegrate metho of attac etecton on MAC layer n MANE Journal of Harbn Engneerng Unversty (1): (n Chnese) 8 Intanagonwwat C Govnan R Estrn recte ffuson: a scalable an robust communcaton paragm for sensor networs roceengs of the 6th Annual Internatonal Conference on Moble Computng an Networng (MOBICOM ) Aug Boston MA USA New Yor NY USA: ACM 2: Xe Cu J H Lao L VBF: vector-base forwarng protocol for unerwater sensor networs roceengs of the 5th Internatonal IFI-C6 Conference on Networng echnologe Servce an rotocols; erformance of Computer an Communcaton Networs; Moble an Wreless Communcatons Systems (NEWORKING 6) May Combra ortugal Berln Germany: Sprnger-Verlag 26: Yan H Sh ZJ Cu J H BR: epth-base routng for unerwater sensor networs roceengs of the 7th Internatonal IFI-C6 Networng Conference on A Hoc an Sensor Networ Wreless Networ Next Generaton Internet (NEWORKING 8) May Sngapore Berln Germany: Sprnger-Verlag 28: u X J Lan S L Lu F et al Mcro-AN networ protocol archtecture an smulaton mplementaton elomna ( 4): u X J Huang K J Lu F et al Mcro-AN: a novel networ protocol archtecture for unerwater sensor networ Apple Mechancs an Materal /34/35/36: Nculescu Nath B V base postonng n a hoc networs Journal of elecommuncaton System 23 22(1/2/3/4): Bahr A Cooperatve localzaton for autonomous unerwater vehcles h ssertaton Cambrge/Woos Hole MA USA: MI/WHOI 29 (Etor: ZHANG Yng) From p 53 7 Bas H Agha K A QOLSR mult-path routng for moble A-hoc networs base on multple metrcs: banwth an elay roceengs of the 59th Vehcular echnology Conference (VC-Sprng 4): Vol 4 May Mlan Italy scataway NJ USA: IEEE 24: Bas H Mauaretto A Agha K A et al Optmal path selecton n a ln state QoS routng protocol roceengs of the 59th Vehcular echnology Conference (VC-Sprng 4): Vol 4 May Mlan Italy scataway NJ USA: IEEE 24: Bouhalfa L Mnet Monnet S QoS support n a MANE base on OLSR an CBQ roceengs of the 6th Internatonal Conference on Networng (ICN 7) Apr 2228 Martnque France scataway NJ USA: IEEE 27: 2 1 Xue Q Ganz A A-hoc on-eman routng (AQOR) n moble A-hoc networs Journal of arallel an strbute Computng 23 63(2): Hwang Y Varshney An aaptve QoS routng protocol wth spersty for a-hoc networs roceengs of the 36th Annual Hawa Internatonal Conference on System Scences (HICSS 3) Jan Bg Islan HI USA Los Alamto CA USA: IEEE Computer Socety 23: 1p 12 Hwang Y Lee H Varshney K An aaptve routng protocol for a-hoc networs usng multple sont path roceengs of the 53r Vehcular echnology Conference (VC-Sprng 1): Vol 3 Mar Rhoe Greece scataway NJ USA: IEEE 21: Lu Z Kwatowsa M Z Constantnou C A bologcally nspre QoS routng algorthm for moble A-hoc networs roceengs of the 19th Internatonal Conference on Avance Informaton Networng an Applcatons (AINA 5): Vol 1 Mar ape Chna scataway NJ USA: IEEE 25: Krshna V Sartha V Veha G et al Qualty-of-servce-enable ant colony-base multpath routng for moble A-hoc networs IE Communcaton 212 6(1): Lu Zhu J Genetc algorthm for energy-effcent QoS multcast routng IEEE Communcatons Letter (1): Hwang Y Varchney An aaptve QoS routng protocol wth spersty for a-hoc networs roceengs of the 36th Annual Hawa Internatonal Conference on System Scences (HICSS 3) Jan Bg Islan HI USA Los Alamto CA USA: IEEE Computer Socety 23: 1p 17 Leung R Lu J L oon E et al M-SR: A QoS-aware mul-path ynamc source routng protocol for wreless a-hoc networs roceengs of the 26th Annual IEEE Conference on Local Computer Networs (LCN 1) Nov ampa FL USA scataway NJ USA: IEEE 21: Chen S G Klara N strbute qualty-of-servce routng n A-hoc networs IEEE Journal on Selecte Areas n Communcaton (8): Ahn H Seo Y Km J et al Mult-metrc geo-routng protocol for tactcal A-hoc networs roceengs of the 213 Internatonal Conference on Informaton Networng (ICOIN 13) Jan Bango halan scataway NJ USA: IEEE 213: Cager F Curran K Santos J et al A survey of geographcal routng n wreless A-hoc networs IEEE Communcatons Surveys & utoral (2): Ahter A Sanguanotchaorn Mofe AOV for mult-constrane QoS routng an performance optmzaton n MANE roceengs of the 7th Internatonal Conference on Electrcal Engneerng/Electroncs Computer elecommuncatons an Informaton echnology (ECI-CON 1) May Chang Ma halan scataway NJ USA: IEEE 21: (Etor: WANG Xu-yng)