Network Life Time Prolonged Routing by Distributed Load Balancing

Transcription

1 Internatonal Journal of Communaton an Networkng System Network Lfe Tme Prolonge Routng by Dstrbute Loa Balanng T.Parameswaran, Dr.C.Palansamy, C. Mara Nany Abstrat Energy aware routng algortms alle Relable Mnmum Energy Cost Routng an Relable Mnmum Energy Routng ( are propose for wreless ao networks. efnes te requrements of ao networks lke energy-effeny, relablty, relablty an prolongng te network lfetme. It onser energy onsumpton an te remanng battery energy of te noes. fns routes mnmzng te total energy requre for en to en paket traversal. an bot ensure relablty usng op by op or en to en paket retransmsson. Energy onsume by proessng elements of transevers, lmte no of transmsson allowe per paket, paket sze, te mpat of aknowlegement paket are onsere n wreless ao network. We use an approxmaton algortm for mnmzng te network ongeston. Inex Terms - Energy-aware routng, battery-aware routng, en-to-en an op-by-op retransmsson, relablty, wreless a o network. I. INTRODUCTION Te ao network ave ome nto exstene n orer to overome te lmtatons of wre network an nfrastruture base network. Te man avantage for usng ao networks are tat tere s no nee to nstall base statons an tey are temporary set up. Ao networks are well sute to free unlense spetrum. It supports nerent salablty wt power ontrol an ooperatve relayng n w ea user ontrbutes of te apaty of network. Tere s no nee of Aess Pont for ommunaton of ata. Ea noe an forwars te paket n te network beause tere s no entral ontrol ea. Te noe as lmte battery power so t s very mportant to use ter energy very effently. In orer to save power te pysal layer transmt power aorng to te stane between te noes. Te man purpose of energy routng protool s to maxmze te network lfetme. Te value of average power an be aqure by ontrol paket. Routes are sovere onserng te energy onsume for ento-en (E2E paket traversal. In orer to ensure relablty of lnks we soul oose a pat w ontans ger battery power of te noe oterwse onser te resual energy of te noe. Qualty of serve an be nrease by fnng relable routes. Te resual energy of te noe s foun to enote weter tat noe an be use for transmsson or not. Altoug fferent algortm are propose for amng relablty, energy-effeny an to nrease te lfetme of te networks (e.g., [3], [9], [2].Ts oes not ensure qualty of lnks to te maxmum level beause f relable pat s osen for transmsson of ata n wreless networks leas to overusng of same noe. Generally energy effent routng s very effetve meansm for reung energy ost n ao networks. II. RELATED WORKS Tere ave been many algortm propose onserng te relablty of noes for eg Expete transmsson ount ETX s alulate to fn relable route w onssts of lnks aqurng less number of retransmsson. Ts meto o not mnmze te energy onsumpton for E2E ata traversal. Conserng ger prorty of noes leas to overusng of same noes so soon t gets expres for eg onser a noe w s near to te estnaton, a noe w s lose to te estnaton wll be frequently use to forwar te paket on bealf of oter noes so soon ts noe wll fall qukly.te next ategory nlues algortm tat fns energyeffent routes. Some of te algortm aresses energy-effeny an relablty but tey o not onser te remanng battery power of te noes to avo overuse of noes (eg,[2],[],[]. Energy effent algortm propose ave a savantage to sover energy effent route, tey o not onser te atual energy onsumpton of te noes (eg, [6],[7]. Tey onser only te output power of te amplfer negletng te energy onsume by proessng elements of transmtter an reevers (eg [],[4]. Many algortms ave been propose by fnng routes onsstng of noes wt a ger level of battery power norer to exten te network lfetme (eg [5],[8].Te major rawbak s tat tey o not onentrate on relablty an energyeffeny. Te routes sovere by tese algortm s neter relable nor energy effent pat leas to more energy onsumpton. III. PROPOSED WORK In our work we ombne te energy effeny, relablty an prolongng te network lfetme for paket traversal n wreless ao networks. Relable mnmum energy ost routng ( onser te energy onsumpton an te remanng battery energy of te noes. Relable mnmum energy routng ( fn routes mnmzng te total energy requre for en to en paket traversal. Bot tese algortm ensure relablty usng op by op or en to en transmsson. MAC layer support HBH Integrate Intellgent Resear (IIR 358

2 Internatonal Journal of Communaton an Networkng System retransmsson to nrease relablty. We aress tree mportant problem of energy effeny. Lmte no of transmsson on energy ost of te routes. Te retransmsson ours after te expraton tmer. Duraton of te tme s long enoug to prevent unneessary retransmsson. 2 Conserng te mpat of aknowlegement paket on energy ost of routes. In HBH system, a lost paket s retransmtte by te sener to ensure lnk level relablty an aknowlegement s transmtte by te reever to te sener. If sener oes not reeve te ACK eter ue to paket or ts ACK lost or orrupte, te sener retransmt te paket. Ts s allowe tll maxmum no of transmsson attempt s reae. 3 Conserng te energy onsumpton of proessng elements. In ts work we onser te energy onsume by te transmsson rut an energy onsume by te power amplfer for ata transmsson over te ar. IV. SYSTEM IMPLEMENTATION A. Creaton of Network formaton Create a set of negbors, represente by a Grap G(W,IE were W s te set of noes (vertes an IE s te lnk (Eges. Noes are assume to be battery powere. C u represents te remanng battery energy of noe n ϵ w. we assume C t = wtout loss of generalty. Te noe s onsere to be ea f te battery energy of a noe falls below tresol C t. Te tresol s spefe su tat targete lnk error s satsfe. p (x s te paket elvery rato PDR of for paket sze x. It s te probablty of error free reepton of paket. Assume tat noes support ajustable transmsson power. P represents transmsson power from noe u to noe v. S(u = {P (u, P 2 (u..p m (u} were s te allowable number of transmsson. It satsfes te targete lnk error probablty. Te ata rate of te pysal lnk oes not ange by ajustng te transmsson power. P(n,n + = {n,n 2, n,n + }were n k s te entfer of k t noe of te pat. n s te soure noe, n + s te estnaton noe. r be te ate rate at te pysal layer n bts. ε (x enote energy onsume for transmttng a per bt of a paket an s enote by Pu, v x u v x Au k, ( ( u r Let A u represents te power requre to run te proessng rut of te transmtter noe u. P be te transmsson power of noe u to noe v. ω (x enote energy onsume for reevng a per bt of a paket Bu u, v ( x x (2 r Let B u be te power requre to run te reever rut of te wreless nterfae. B. Energy-Aware Relable Routng Algortm n HBH System In HBH system, a lost paket s retransmtte agan to ensure lnk level relablty. If te estnaton oes not reeve te aknowlegement ue to paket or ts Ak lost or orrupte te sener retransmt upto Q u tmes. E[n ] s te expete number of tmes u nee to transmt a paket of lengt L E[n ] = - (- p p p p v,u ( L Qu (3 E[m ] s te expete number of Ak of lengt L for a ata paket Qu E[m u, v ] = Pr{ m ( L } L (4 u, v a s te total energy onsume by te transmttng noe u. ε s te energy onsume by u urng a sngle transmsson of a paket. ω s te energy onsume by u urng a sngle reepton of te ACK. a = E[n ] (5 + E[m ] b s te total energy onsume by te reevng noe. ε s te energy onsume by u urng a sngle transmsson of a ACK. ω s te energy onsume by u for reevng a sngle ata paket. b = E[n ] (6 + E[m ] Let C(P(n,n be te expete energy ost to route a ata paket along te pat. Energy ost of a route s alulate usng C(P(n, n [ Rn ( L e, n ( L ] (7 n C. Energy-Aware Relable Routng Algortm n E2E System N p s te expete number of tmes tat a ata paket lengt L s transmtte from soure to estnaton. N p ( L (8 R ( L R' ( L n n e Integrate Intellgent Resear (IIR 359

3 Internatonal Journal of Communaton an Networkng System M p e s te expete number of tmes tat a E2E Ak of lengt L e s transmtte by te estnaton to soure noe. M P ( Le (9 R' n( Le N p an M p e s smlar to E[n ] an E[m ] n ( an (. Expete energy ost of a pat n E2E system urng sngle transmsson from a soure to te estnaton multple by expete number of tmes tat te soure retransmt a paket C( P( n, n NP( L [ Rn ( L en, en ( L ] MP( Le [ R' n ( Le en, n ( Le ] (9 were e,l ϵ {L,L e } s te energy ost of paket transmsson over a lnk n te E2E system. an esrbe te proeure to fn MECP, for w tey requre omplete network topology. Ts s one wt te elp of optmze lnk state routng (OLSR w elp to sare ts vew n network topology. Noes use beons to fn ts negborng noes. & follows te same pattern of Dkstra s algortm n orer to fn te sortest pat between te noes for transferrng ata. We oul also mplement t usng Bellmen-For Algortm. For w we ave to alulate lnk wegt an route ost. Usng lnk qualty estmaton we an fn out te PDR paket elvery rato of te lnk. Expete number of PDR an be etermne by usng SNR- to-pdr profle mappng. For ata transfer n HBH an E2E ACK may be n fferent szes. So ter elvery rato wll ffer. In orer to fn relable paket transmsson to negborng noe P ea noe sen paket to negborng noe to alulate te mnmum transmsson power requre for paket elvery. D. Dstrbute Loa Balanng Loa Balanng s avantageous for nreasng relablty an network trougput. Coose a set of soure routes as a mn-max ongeston multommoty flow problem. Approxmaton Algortm Moel te a o network as a rete grap G = (V, E wt vertes representng te rao noes of te network an eges representng lnks between te rao noes. For two vertes, j V, avng a rete ege (, j E f tere exsts a lnk from to j. For every ommoty n a multommoty flow problem, tere s an assoate supply or eman t ( at ea noe V ; tese must satsfy v t ( for all. Te task s to fn a set x of flows over te eges (, j E su tat ea ommoty s route from te supply noes wt (t ( > to te eman noes (wt t ( <, tat s, t ( x ( j, E j x (, j E Typally te total flow on an ege (, j s lmte by f x u te apaty u of te ege: In applyng te multommoty flow moel to routng, ea ommoty represents one ata stream of traff volume v from te soure s to te estnaton. In ts ase, v = t (s = t ( an t ( = for all oter noes. Wtn tese onstrants x we oose to mnmze te maxmum ongeston f mn max u Many algortms exst for solvng lnear optmzaton problems n te ase wen te wole state of te network s known. In ontrast, esre an optmzaton algortm were te nvual noes ooperate to etermne te optmum wle only passng a reasonable number of messages of reasonable sze. Te approxmaton algortm [2] n as tese propertes. In ts formulaton t s assume tat ea ege as te same apaty u. To obtan flows for w te maxmum ongeston s at most ( + tmes te optmal value, t suffes to run te algortm for teratons, were m s te number of eges. 2 I [4mlog m / ] V. RESULT AND ANALYSIS Let us ompare te performane of an. Network Lfetme[s] Fg 2 Pakets elvery before noe falure Te above fgure learly sows tat an sgnfantly elay te frst noe elay ompare to. Ts sows te ablty of to avo noe beng overuse, w n turn nrease te network lfetme. Integrate Intellgent Resear (IIR 36

4 Internatonal Journal of Communaton an Networkng System Mean Relablty of Routes Fg 3 Average E2E Relablty of Selete Noes Ts fgure sows tat s smlar to to fn more relable routes for ata transmsson. Average Energy Per Paket Joules[J] Fg 4 Energy Consume to Route Paket Te fgure sows tat smlar to, RMCER s able to fn energy effent routes w onsume less amount of energy to route a paket from soure to estnaton. nrease te operatonal lfetme of te network by fnng more relable an energy effent routes. Mean ETX of Roots Fg 5 Average ETX of Selete Notes Te fgure sows ow RMCER s able to fn routes n w aumulate ETX s very lose to te aumulate ETX of routes w are selete by mn ETX. Ts s same n ase of algortm. VI. CONCLUSION an s use to fn relable routes w mnmze energy ost for E2E paket traversal. Energy ost of a route s relate to relablty.e If routes are less relable te probablty of paket retransmsson nreases. Tus larger amount of energy wll be onsume. In battery ost of noes s te expete energy ost of a pat to transfer a paket from soure to estnaton. In te amount of energy onsume by all noes to transfer te paket from soure to estnaton s te antpate energy ost of a pat. We ave analyze te applaton of a lnear programmng approxmaton algortm to strbutvely optmze network banwt n a wreless multop network. REFERENCES [] M. Senel, K. Cntalapu, D. Lal, A. Kesavarzan, an E. Coyle, A Kalman Flter Base Lnk Qualty Estmaton Seme for Wreless Sensor Networks, Pro. IEEE Global Teleomm. Conf. (GlobeCom 7, pp , Nov. 27. [2] Q. Wang, M. Hempstea, an W. Yang, A Realst Power Consumpton Moel for Wreless Sensor Network Deves, Pro. Tr Ann. IEEE Comm. So. Sensor an A Ho Comm. an Networks (SECON 6, pp , Sept. 26. [3] A. Msra an S. Banerjee, MRPC: Maxmzng Network Lfetme for Relable Routng n Wreless Envronments, Pro. IEEE Wreless Comm. an Networkng Conf. (WCNC 2, pp. 8-86, 22. [4] C. Perkns, P. Bagwat: Hgly ynam Destnaton-Sequene Dstane-Vetor routng (DSDV for moble omputers. Proeengs of ACM SIGCOMM, August 994. [5] K. Fall, K. Varaan: Te ns Manual (formerly ns Notes an Doumentaton. Te VINT Projet, A Collaboraton between researers at UC Berkeley, LBL, USC/ISI an Xerox PARC. [6] X.-Y. L, Y. Wang, H. Cen, X. Cu, Y. Wu, an Y. Q, Relable an Energy-Effent Routng for Stat Wreless A Ho Net- works wt Unrelable Lnks, IEEE Trans. Parallel an Dstrbute Systems, vol. 2, no., pp , Ot. 29. [7] A. El Gamal, C. Nar, B. Prabakar, E. Uysal- Bykoglu, an S. Zae. Energy-effent Seulng of Paket Transmssons over Wreless Networks. In Proeengs of IEEE Infoom, June 22 [8] Dnes RatanGautam, SanjeevSarma, SantosSau, Enane Transmsson Power Control Meansm base on RSSI for MANET Internatonal Journal of Computer Applatons ( Volume 28 No., August [9] C. To, Maxmum Battery Lfe Routng to Support Ubqutous Moble Computng n Wreless A Ho Networks, IEEE Comm. Magazne, vol. 39, no. 6, pp , June 2. [] Woesner H, Ebert J-P, Slager M, Wolsz A. Power-Savng Meansms n Emergng Stanars for Wreless LANs: Te MAC Level Perspetve. IEEE Personal Communatons 998; 5(3: 4-48 [] J.-H. Cang an L. Tassulas, Maxmum Lfetme Routng n Wreless Sensor Networks, IEEE/ACM Trans. Networkng, vol. 2, no. 4, pp , Aug. 24. [2] A. Mal an A. Epremes, A strbute routng algortm for supportng onneton-orente Integrate Intellgent Resear (IIR 36

5 Internatonal Journal of Communaton an Networkng System serve n wreless networks wt tme- varyng onnetvty, n Proeengs Tr IEEE Symposum on Computers an Communatons, ISCC 98, Atens, Greee, June 998, pp AUTHOR S PROFILE Parameswaran.T as reeve s B.E egree n Eletrons an Communaton Engneerng from Velalar College of Engneerng an Tenology, Eroe, an M.E egree n Software Engneerng from College of Engneerng Guny, Anna Unversty Cenna n 25 an 28 respetvely. He s urrently pursung s P.D from Anna Unversty, Regonal Centre Combatore. He s urrently workng as Assstant Professor n te Department of Computer Sene an Engneerng, Regonal Centre Anna Unversty, Combatore, Ina. He as publse more tan resear papers n varous journals an onferenes. He as organze 3 natonal level worksops. He s a stuent member of IEEE. Mara Nany. C s pursng M.E Computer Sene an Engneerng n te Department of Computer Sene an Engneerng, Anna Unversty Regonal Centre, Combatore. Se reeve er Baelor of Engneerng Degree n Computer Sene an Engneerng from Arulmgu Meenaks Amman ollege of Engneerng n 22, Anna Unversty Cenna. Her resear nterests are Networkng an Network Seurty. Dr. Palansamy. C as reeve s B.E egree n Eletrons an Communaton Engneerng from Unversty of Maras, Cenna, an M.E egree (Gol Mealst n Communaton Systems from Tagarajar College of Engneerng, Maura, Maura Kamaraj Unversty n 998 an 2 respetvely. He as reeve s P.D from te faulty of Informaton an Communaton Engneerng, Anna Unversty, Cenna n 29. He as more tan 3 years of aaem an resear experene an urrently e ols te post of Professor an Hea of te Department of Informaton Tenology, Bannar Amman Insttute of tenology, Satyamangalam an Tamlnau, Ina. He as publse more tan 3 resear papers n varous journals an onferenes. He as organze more tan worksops an ols 2 fune projets. He s a lfetme member of ISTE. He won Best M.E tess awar at Tagarajar College of Engneerng, Maura an best paper awar ttle, A Neural Network Base Classfaton Moel Usng Fourer an Wavelet Features, Proeengs of tr 2 n Int. Conf. on Cognton an Reognton 28, (ICCR 28, Organze by P. E. S College of Engneerng, Manaya, Kastrnataka, Ina, pp , 28. Hs resear nterests nlue Data mnng, mage proessng an moble networks. Integrate Intellgent Resear (IIR 362