AFSA DSR- ARTIFICIAL FISH SWARM ALGORITHM DYNAMIC SOURCE ROUTING PROTOCOL FOR MANET

Transcription

1 ISSN: SPECIAL ISSUE: Emergng Technologes n Networkng and Securty (ETNS) Prasath et al. ARTICLE OPEN ACCESS AFSA DSR- ARTIFICIAL FISH SWARM ALGORITHM DYNAMIC SOURCE ROUTING PROTOCOL FOR MANET Prasath. N 1*, P. Sengottuvelan 2, B. Vnoth Kumar 3 1 Dept of Computer Scence and Engneerng, KPR Insttute of Engneerng and Technology, Combatore, TN, INDIA 2 Dept of Computer Scence, Peryar Unversty PG Extenson Centre, Dharmapur, TN, INDIA 3 Deptof EEE, Dr.Mahalngam College of Engneerng & Technology, Pollach, TN, INDIA ABSTRACT Ams: Informaton technology s beng extensvely used durng emergences for effcent handlng of data and communcaton. In emergences due to natural dsasters lke earthquakes or tsunams Wreless Ad Hoc Networks provde a relable communcaton lnk when exstng nfrastructure has collapsed. Ad hoc networks do not requre any fxed nfrastructure and networks can be formed on demand and hence can be used n counter terrorsm operatons also. For effcent operaton of Ad hoc network routng plays an mportant role and the routng technque should be capable of adaptng tself to the scenaro under whch t s deployed. Ths work proposed an optmzed Dynamc Source Routng (DSR) protocol for MANET. To locate optmal paths between communcatng nodes, tradtonal DSR algorthm s modfed based on multple objectves and called as Lnk Qualty Load Balanced Dynamc Source Routng (LQLB-DSR). Solutons obtaned usng LQLB-DSR s suboptmal due to dynamc varaton of network parameters. To overcome ths an Artfcal Fsh Swarm Algorthm (AFSA) to acheve deserved Qualty of Servce (QoS) s proposed. Extensve smulatons showthe mproved performance of the proposed routng protocol Publshed on: 18 th August-2016 KEY WORDS Moble Ad-Hoc Networks (MANETs), Dynamc Source Routng (DSR), Lnk qualty, moblty, end to end delay, Artfcal Fsh Swarm Algorthm *Correspondng author: Emal: prasadn.dsr@gmal.com INTRODUCTION MANETs use the dynamc dstrbuted system concept wth many hghly moble devces communcatng through a wreless medum. Every devce has lmted energy and communcates wthout fxed nfrastructure. As each devce/node moves arbtrarly, topology changes frequently and unpredctably. These characterstcs make locaton predcton and relable routng a challenge n MANETs. Each MANET node acts as host and router dynamcally based on jonng of new nodes and ext of current nodes. MANET can also work wth exstng wred local area networks. Key features of MANETs can be lsted nto [1]: All nodes are self-confgurable dynamcally. Every node may move n dfferent drectons and dfferng speeds. They work on constraned bandwdth. A node provdes essental network functonaltes lke routng and mantenance, as there s no fxed nfrastructure. Dstrbuted algorthms are used for organzng, routng and schedulng. Securty s lmted as wreless medum s used for communcaton. Wth avalablty of low cost devces and rugged operatng systems for hand held devces MANET can become the frst lne of communcaton durng natural emergences lke earthquakes, tsunams and manmade emergences such as war and terrorsm [2]. Emergency applcatons of MANET ncludesearch and rescue operatons, Replacement of fxed nfrastructure n case of envronmental dsasters, Fre fghtng. Fgure-1 shows a dsaster communcaton setup usng wreless network. MANET effcency depends on the cooperaton of wreless nodes [3] and effcent routng. Conventonal routng algorthms come under three categores ncludng table drven or proactve algorthms, on demand or reactve algorthms and hybrd routng algorthms. Table drven routng algorthms are based on recently collected nformaton on actve paths stored n each node as a routng table and updated regularly. Perodc updates dentfy Guest Edtor Prof. B. Madhusudhanan 394

2 when a path s nvald or establshes a new path. Updatng routng table consumes node s power and wreless medum bandwdth due to addtonal overheads [4]. If updatng nterval s long, then routng table does not have most recent topology change leadng to stale routes. Wreless Routng Protocol (WRP), Destnaton Sequence Vector Routng (DSDV) and Fsheye State Routng (FSR) are proactve routng protocols.demand drven or Ondemand routng algorthms begn route dscovery to send data to destnaton node. When a source node wants to send a packet to a wreless node, source node starts the dscovery process. A path s found and regstered wth agreement between source and destnaton nodes. In ths technque, route dscovery ntroduces delays [5]. Dynamc Source Routng (DSR) and Adhoc On demand Dstance Vector Routng (AODV) are popular reactve routng protocols. Hybrd routng mproves routng by combnng table drven and on demand routng algorthms best features [6,7]. Zone Routng Protocol (ZRP), Zone based Herarchcal Lnk State Routng (ZHLS), and Hybrd Adhoc Routng Protocol (HARP) are examples of hybrd routng protocols. Incdent locaton Dsaster Locaton Injured person.. Patents watng for treatment area Techncal Casualtes operatonal Casualtes treatment area clearng staton command.. Ambulance and other vehcles Hosptal zone Transport zone hosptal Helcopter landng ste Fg. 1: A MANET based command setup durng dsaster Conventonal routng algorthms are not very effcent for MANETs dstrbuted envronment as network topology changes dynamcally and Qualty of Servce (QoS) parameters dffer for dfferent applcatons. Tradtonal routng algorthms try to locate shortest path between source and the destnaton nodes. However, factors lke latency, propagaton path loss, and varable wreless lnk qualty, protecton aganst ntentonal jammng, nterference, fadng, power consumed, relablty, securty and recovery from falure can be used for optmzaton the routes for specfc applcatons. Falng to consder these parameters can degrade network performance and dependablty [8]. Current MANET routng protocols do not consder parameters lke network load along the path, processng capablty of the ntermedate node or the avalable bandwdth durng the route selecton process. To overcome the dsadvantages ths work proposed a Lnk Qualty &Network Load Balanced Dynamc Source Routng s proposed (LQLB-DSR). Snce multple parameters have to be optmzed, the routes dscovered by LQLB-DSR are suboptmal and NP-Complete. To overcome ths aswarm Intellgence technque based on the behavour of Fsh Swarm s proposed. The rest of the work s dvded nto the followng subsectons. Secton 2 dscusses exstng work, secton 3 descrbes the proposed algorthmwth secton 4 dscussng the expermental set up and results obtaned. Secton 5 concludes the paper. RELATED WORKS The performance of varous routng protocols lke DSDV, AODV, and DSR for MANETs was nvestgated and compared by Manckam et al., [9],Shrestha and Tekner [10]& Fan et al., [11]. After nvestgaton, authors conclude that DSDV was sutable when number of nodes are lmted and moblty s low due to storng routng 395

3 detals n nodes. DSR suted moderate sze networks wth moderate traffc, as DSR used source routng and route cache at nodes. AODV provded best packet delvery rato but had hgh end to end delay. An Enhanced Mult-Path DSR algorthm (EMP-DSR) was proposed by Asl et al., [12]. The proposed algorthm used Ant Colony Optmzaton (ACO) to get global nformaton about nodes and ndvdual paths relablty. Smulaton showed that EMP-DSR s overall relablty and end to end delay was hgher than smple Multpath DSR but had addtonal overheads. Rajesh et al., [13] proposed an Artfcal Neural Network (ANN) to secure MANET resources thereby enhancng DSRs performance. When routng, f a legtmate node s erroneously mstaken for a rogue node then QoS deterorates. A new method to optmze route dscovery n DSR routng algorthms was proposed by Hussen [14] usng fuzzy logc. The objectve of optmzaton was to mnmze number of broadcast of RREQ packet, as ths nfluenced overhead sgnfcantly n DSR routng. The author suggested a decson algorthm through a fuzzy logc system where each lnk was assgned a weght when destnaton path was constructed. Weghts were based on the ndvdual lnk s load and qualty. When a node receves a RREQ, only good qualty nodes reply. Smulatons showed decrease n RREQ overhead by 30% compared to tradtonal DSR.An optmzed routng algorthm was proposed by Arafat et al [15] usng ACO. The mult objectve optmzaton problem consdered estmated lnk qualty, delay and energy parameter. An algorthm to detect many dsjont routes from a specfc source to a destnaton node was proposed by PrabhakaraRao et al., [16]. Route lfe was expressed by factors lke Lnk Expraton Tme (LET), Dran Rate (DR) and lnk stablty. Lnk stablty s proportonal to LET and ndrectly proportonal to DR. An optmal path was selected to use bandwdth effcently based on these factors. DSR routng found multple dsjont paths by modfyng RREQ and RREP packets at source node. An effcent algorthm to select multple paths for source destnaton pars based on locaton and bandwdth nformaton and energy parameters was proposed by Shuchta et al., [17] toensures constant, stable, healthy node dsjont paths satsfyng many QOS parameters.a Mult-populaton Frefly Algorthm (MFA) for correlated data routng n Underwater Wreless Sensor Networks (UWSNs) was presented by Xu and Ln [18]. Three knds of frefles were used wth coordnaton rules to mprove adaptablty of buldng, selectng, and optmzng routng path consderng data correlaton and samplng rate n sensor nodes. Dfferent groups of frefles conducted optmzaton ndependently to mprove convergence speed and the proposed algorthm s soluton precson. Routng wth TCP protocol was extensvely studed by Swan et al., [19]. Km et al., [20] proposed a dsaster communcaton network and smulated the performance and showed the usefulness of MANET for telemedcne servces. Kulla et al., [21] proposed data replcaton to support crtcal applcatons n dsaster management. The proposed technque used fuzzy logc and optmzaton technque to mprove the QOS. Lee & Yang [22] proposed an emergency escape system from dsaster area usng ther own moble devces. The proposed system utlzed users' nformaton such as weghted dstances, weghted drectons and revst counts. The soluton was mplemented on a double-layered MANET to reduce traffc and to collaborate wth each otherprovng that the proposed system could be an effectve lfe-savng rescue system.ba et al., [23] proposed an ntegrated communcaton system by composng heterogeneous wreless networks to facltate the rescue teams and vctm people to communcate nsde and outsde the dsaster ste. MATERIALS AND METHODS Based on lterature survey t can be concluded that QOS requrement changes based on the scenaro where the MANET soluton s deployed. To acheve ths multple objectves need to be optmzed as soluton outcome under dfferent scenaro wll be sub optmal. Ths work proposedtwo new technques Lnk Qualty & Load Balanced DSR (LQLB-DSR) and Artfcal Fsh Swarm Algorthm-DSR (AFSA-DSR) whch s optmzaton of the LQLB-DSR. In DSR routesare located when a source node needs to transmt data to a specfc destnaton. Ths s a uncast routng protocol where a node uses cache memory to store route nformaton of a node s recently taken routes. The two DSR routng steps are Route dscovery and Route mantenance. When a source node attempts to send a packet to destnaton node, t checks ts route cache [24, 25]. If route s avalable to destnaton node, then t transmts packet n the avalable path. Or else a route dscovery process s ntated by broadcastng Route Request packets (RREQ).Nodes on recept of RREQ check ts route cache. If routng entry s not n t, the node appends ts own address n RREQ packet and broadcasts t to neghbourng nodes. If RREQ packet reaches destnaton or a node wth routng nformaton to destnaton, t generates a Route Reply (RREP). Reply packet has nodes addresses traversed by the request packet. To mantan routng nformaton, when data lnk layer fnds a lnk falure or dsconnecton, a ROUTE ERROR packet s generated and transmtted from faled pont to source node backward of sent data. So, all ntermedate nodes delete route nformaton va faled lnk. Then source node ntates another route locaton process. DSR benefts nclude route dscovery control overheads reducton as t uses route cache. DSR s lmtaton s large sze of packet header as per length of route due to source routng. 396

4 PROPOSED LQLB MECHANISM In the proposed technque Lnk Qualty (LQ) and Network Load (NL) s measured and the path wth hgh LQ and low NL s selected. Lnk qualty (LQ) vares n a wreless medum compared to wred medum due to nose generated by outsde source, dstance between nodes beng hgher leadng to hgher packet loss. LQ can be evaluated based on the type of antenna n the node, the power capablty of the antenna and can be computed by 2 Pr Txp Rg T g 2 (4 d) where Pr receved power, Tx R T g g p Power used for transmsson, Gan of antenna at recever, Gan of antenna at transmtter wavelength, d ds tan ce between two nodes. The equaton evaluates lnk qualty based on receved sgnal strength descrptve whch s based ondstance and moblty for a gven tme perod[26].two more wreless lnk qualty metrcs, Hop Count metrc for the entre route andper-hop Round Trp Tme (RTT) s also measured. In many scenaros the traffc n the MANET s hgh n certan regons of the network leadng to load balancng problems [27] leadng to congeston, buffer overflow and packet drop. Effectvely the channel s affected due to the low bandwdth typcally avalable n MANETs[28]. In such scenaros the routng algorthms may not stablze. Fgure 2 shows how nodes can be affected by excessve traffc flow. It can be noted that node 4 faces congeston as t handles traffc from node 2,3,7,6 and 1. The overall data carred by each node for duraton are computed. Route s selected based on the three parameters stated. Durng route dscovery process, the source node broadcasts Route Request (RREQ) packet wth a LQLB query n packet header. Each node updates the LQLB once t receve the RREQ based on the sequence number concept of DSR. The LBLQ collects the total packet generated by each node and the number of packets t has receved for a gven duraton and ths represents the load balancng parameter dentfyng the weakest node. LQ dentfes the weakest lnk n the route. LQLB feld s added n each routng table entry and ths gets updated when [29]: The receved sequence number s hgher than sequence number stored n the routng table. The sequence numbers are equal, but the hop count n the new RREQ s lower than the hop count stored n the routng table. The sequence numbers are equal, the LQLB n the routng table s smaller than the pre-defned LQLB value n the routng table s hgher than current value. The varous routes are ranked and the best route selected. The rankng s based on the QOS parameter selected. c r, g, f, =1 n R =(w/h)+(1-w) (P +(D +D )) where c r g f R s the route qualty P s the normalzed Lnk qualty of node H s the hop count D s the normalzed packet generated by node D s the normalzed packet forwarded by node w s a constant between 0 and 1. Here w=

5 Fg. 2: Network Load Route Selecton Mechansm The protocol decdes whether partcular route should be elmnated at the routng layer nstead of makng the decson at the lnk layer and flterng out all routng traffc over the bad lnks and reducng the chance of selectng a bad route. In DSR lnk falure s detected by regularly usng hello packets. If the neghbour does not respond to the hello packet sent by a node then the Route Error (RERR) s ntated so that source rentates the route dscovery process. Ths leads to hgh routng overhead and to overcome ths dsadvantage, the proposed system montors the lnk qualty and the source node starts the new route detecton process before the current lnk s broke. Proposed AFSA - DSR The proposed LQLB algorthm measures multple parameters leadng to suboptmal solutons. Also the deal value of the weght cannot be found. To fnd an optmal soluton varous swarm ntellgence technques have been proposed n lterature. Artfcal Fsh Swarm Algorthm (AFSA ) mmcs the behavour of fsh swarms preyng and has been found to converge very fast [30]. The search starts wth random solutons mapped to each fsh. Ftness s evaluated and the fsh follow process s ntated and fsh follows another fsh wth better soluton. If the soluton s suboptmal, the swarmng process s ntated usng steps. If the desred soluton s not met, preyng process s ntated. Ths process s contnued tll the desred threshold or termnaton crtera s met. The pseudocode of AFSA s gven n fgure 3. Start AFSA :: Intalze(); whle ter mn aton crtera not met do swtch (:: evaluate _ AF ()) case 1: case 2 : default : end swtch :: move _ AF(); :: AF _ follow (); :: AF _ swarm (); :: AF _ prey (); Obtan _ best _ soluton (); end whle Fg.3: Pseudo code of Artfcal Fsh Swarm Algorthm 398

6 Artfcal Fsh (AF) model s represented by preyng nature of fsh, free move of ndvdual fsh, swarmng of fshes to fnd better food and follow behavour. AF searches the problem space by those behavours. AFSA uses random search algorthm usng varable current AF poston, step, vsual (vsblty doman), try-number (maxmum attempts for fndng better postons n vsual), and crowd factor δ (0<δ<1) [31]. For our soluton space AF=Artfcal fsh = (n,s ),=1,2,3...n the number of objectves (x,y ) s the node poston at tme t The dstance between two fshes s computed usng Eucldean dstance Vsual :Maxmum transmsson dstance between of node Step : The maxmum step taken s twce the transmsson dstance ` Durng preyng mode the behavour of fsh s gven by xj x x step f y j y prey( X ) x x Here rand s random functon wth range [0,1]. In the swarmng phase the behavor of the swarm s gven by j x (2rand 1). step else In the follow phase the behavor s gven by xj x yc X step f y swarm( X ) x j x nf prey( X ) else follow( X ) x x y max max X step f y xmax x nf prey( X ) else The three steps mentoned ensures both global and local search and the search drecton followng the best food source. RESULTS Ffteen runs were carred out for DSR, proposed LQLB-DSR and AFSA-DSR. The communcaton and network parameters used n the experment s shown n Table 1. Table 1 Summary of Results 399

7 Parameters Value Data Rate Fxed at 2 Mbps Transmt Power 50 mw Packet Recepton-Power Threshold -95 dbm RTS Threshold None Path Loss Exponent 3.8 Route tme out 4 second Allowed hello loss 2 Hello nterval Unform (1,1.15) second Dscrete Event Smulatons were carred out for 1200 seconds and the average values computed. Table 2 shows the mean ftness and the best ftness obtaned by AFSA-DSR. Table 2 Ftness across 15 runs wth standard devaton Mean ftness AFSA-DSR Best ftness AFSA-DSR 1000 sq m ± sqm ± sqm ± It can be observed from table 1 that the proposed algorthm performs consstently under multple smulaton scenaros provng the stablty of the proposed technque. Fgure 4 shows the Packet Delvery Rato (PDR). Fg. 4: Packet delvery rato From fgure 4 t s observed that the average PDR of the proposed AFSA-DSR mproves by % and %, when compared to the LQLB-DSRand tradtonal DSR routng. Fgure 5 shows the end to end delay. 400

8 Fg. 5: End to end delay From fgure 5 t s observed that the average end to end delay of the AFSA-DSR reduces by % and % respectvely, when compared to the Tradtonal DSR and LQLB- DSR routng for the smulated MANET respectvely. It can also be seen that LQLB-DSR performance mproves substantally over tradtonal DSR. From fgure 6 t s observed that the average number of hops to the destnaton n the LQLB-DSR ncreases by 16 % when compared to DSR. Fg. 6: Number of hops to destnaton Ths s due to the suboptmal solutons generated based on pure computaton. Ths s overcome by AFSA-DSR as t balances not only the network load but also avods the sub optmal soluton. However the number of hops s hgher than DSR wthout affectng the network QOS. CONCLUSION Ths work nvestgated performance of DSR and proposed two algorthm LQLB- DSR and AFSA-DSR to mprove the Qualty of Servce adaptvely for dfferent applcaton scenaros. Fsh Swarm was chosen due to ts faster convergence and easer computaton. Smulatons were conducted by varyng the network sze and 15 runs were conducted for each scenaro. Numercal results show that throughput of AFSA DSR ncreases PDRby an average of 31% than tradtonal DSR. End to end delay and retransmsson attempts decreased consderably whch s statstcally sgnfcant. The number of hops to destnatons ncreased n both versons of modfed DSR compared to tradtonal DSR whch may requre further nvestgaton 401

9 CONFLICT OF INTEREST The authors declare no conflct of nterests. ACKNOWLEDGEMENT None FINANCIAL DISCLOSURE None. REFERENCES [1] [2] Bhmarao, L., & Uma, S. Dsaster Area Communcaton Usng Neghbor coverage n MANET. [3] Du, X., & Zhao, Z. (2010). A Group Key Agree Management Scheme for MANET. Internatonal Journal of Nonlnear Scence, 10(1), [4] Maro, G. and H. Xaoyan, Fsheye State Routng Protocol draft-etf-manet-fsr-03.txt 55 th IETF Meetng n Altanta, GA [5] Samr, R., D. Perkns, C.E Elzabeth and M. Royer,2000. Performance comparson of two on demand routng protocols for ad hoc network. In Proceedngs INFOCOM, Tel Avv, Israel. [6] Ashwn K. Pandey and Hrosh Fujnok, Study of MANET routng protocols by GlomoSm smulator, Internatonal Journal of Network Management, Volume 15, Issue 6, Pages: ,November, [7] Davd B. Johnson Davd A. and Maltz Josh Broch. DSR: The Dynamc Source Routng Protocol for Mult-Hop Wreless Ad Hoc Networks. [8] Saleh Al K.Al-Omar, and Putra Sumar, An Overvew of Moble Adhoc Networks for the Exstng Protocols and the Applcatons, Internatonal Journal of Applcatons of graph theory n wreless ad hoc networks and sensor networks, Vol 2, No 1, March [9] P. Manckam, T. Guru Baskar, M.Grja, and Dr.D.Manmegala, PERFORMANCE COMPARISONS OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS, Internatonal Journal of Wreless & Moble Networks (IJWMN) Vol. 3, No. 1, February [10] Shrestha A and Tekner F, On MANET routng protocols for Moblty and Scalablty, IEEE Internatonal Conference on Parallel and Dstrbuted Computng, Applcaton and Technologes, pages , December [11] Fan Ya Qn, Fan Wen Yong and Wang Ln Zhu, OPNET based Network of MANET Routng Protocols- DSR routng Smulaton, IEEE Internatonal Conference on Informaton Engneerng, Volume 4, August 2010, pp [12] Asl E. K, Damanafskan. M, Abbaspour and Noorhossen. M, MANETs based Ant Colony Optmzaton, Thrd Internatonal Conference on Modelng and Smulaton, [13] Rajesh Garg, YogeshChaba, and R.B.Patel, Improvng the Performance of Dynamc Source Routng Protocol by Optmzaton of Neural Networks, IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 4, No 3, July [14] Mamoun Hussen, A Proposed Route Selecton Technque n DSR Routng Protocol for MANET, Internatonal Journal of Engneerng & Technology IJET- IJENS Vol: 11 No: 02, [15] Arafat S.M. Qaed& T. Dev, Lnk Qualty, Delay And Energy Aware Routng Protocol (Lqdearp) For Moble Ad Hoc Networks, Internatonal Journal of Computer & Communcaton Technology ISSN (PRINT): , Volume-4, Issue-1, [16] S.PrabhakaraRao, Dr.E.Nagabhooshanam, and S.RameshBabu, Qualty of Servce Routng n Moble Ad hoc Networks Usng Node Moblty and Energy Depleton Parameters, Internatonal Journal of Network Securty & Its Applcatons (IJNSA), Vol.5, No.3, May [17] Dr. ShuchtaUpadhayaya And Charu Gandh Qualty Of Servce Routng Inmoble Ad Hoc Networks Usng Locaton And Energy Parameters Internatonal Journal Of Wreless & Moble Networks (IJWMN), Vol 1, No 2, November 2009,Pp [18] Mng Xu, and Guangzhong Lu, A Multpopulaton Frefly Algorthm for Correlated Data Routng n Underwater Wreless Sensor Networks, Hndaw Publshng Corporaton Internatonal Journal of Dstrbuted Sensor Networks Volume 2013, [19] Tanmaya Swan, and Prasant Kumar Pattnak, Effect of Routng Protocols over renovated Congeston Control Mechansms In Sngle-Hop Wreless, Journal of Theoretcal and Appled Informaton Technology, Volume 59, Number 1, January [20] Km, J. C., Km, D. Y., Jung, S. M., Lee, M. H., Km, K. S., Lee, C. K.,... &Yoo, S. K. (2009, September). Implementaton and performance evaluaton of moble ad hoc network for emergency telemedcne system n dsaster areas. InEngneerng n Medcne and Bology Socety, EMBC Annual Internatonal Conference of the IEEE (pp ). IEEE. [21] Kulla, E., Spaho, E., Xhafa, F., Baroll, L., & Takzawa, M. (2012, November). Usng data replcaton for mprovng QoS n MANETS. In Proceedngs of the 2012 Seventh Internatonal Conference on Broadband, Wreless Computng, Communcaton and Applcatons (pp ). IEEE Computer Socety. [22] Lee, J. S., & Yang, S. B. (2010, December). An effectve emergency escape system wth servce-orented archtecture n a double-layered MANET. InServce-Orented Computng and Applcatons (SOCA), 2010 IEEE Internatonal Conference on (pp. 1-8). IEEE. [23] Ba, Y., Du, W., Ma, Z., Shen, C., Zhou, Y., & Chen, B. (2010, June). Emergency communcaton system by heterogeneous wreless networkng. InWreless Communcatons, Networkng and Informaton Securty 402

10 (WCNIS), 2010 IEEE Internatonal Conference on (pp ). IEEE. [24].Johnson, The Dynamc Source Routng Protocol (DSR), RFC4728, Feb [25] Yh-Chun Hu and Davd B. Johnson Cachng Strateges n On-Demand Routng Protocols for Wreless Ad hoc Networks, ACM [26] Balaj, V., & Durasamy, V. (2012). Improved Aodv Based On Lnk Qualty Metrcs. Internatonal Journal of Advances n Engneerng & Technology, Vol. 5, Issue 1, pp [27] Bland, N., & Verma, H. K. (2012). Comparatve Analyss of Reactve and Proactve Routng Protocols n MANETs Usng Throughput, Delay and Network Load. Internatonal Journal of Advanced and Innovatve Research, 1(1). [28] Al, S., & Al, A. (2009). Performance analyss of AODV, DSR and OLSR n MANET. In Proceedngs on Seventh Internatonal Conference on Wreless Systems (p. 34). [29] Tsa, H. M., Wstpongphan, N., &Tonguz, O. K. (2006, January). Lnk-qualty aware ad hoc on-demand dstance vector routng protocol. In Wreless Pervasve Computng, st Internatonal Symposum on (pp. 6-pp). IEEE. [30] Romooz, M., Vahdpour, S. M., &Babae, H. (2009, December). Improvement of Connectvty n Moble Ad Hoc Networks by Addng Statc Nodes Based on a Realstc Moblty Model. In Machne Vson, ICMV'09. Second Internatonal Conference on (pp ). IEEE. [31] Sngh, A., & Deep, K. (2015, January). How Improvements n Glowworm Swarm Optmzaton Can Solve Real-Lfe Problems. In Proceedngs of Fourth Internatonal Conference on Soft Computng for Problem Solvng (pp ). Sprnger Inda. **DISCLAIMER: Ths publshed verson s uncorrected proof; plagarsms and references are not checked by IIOABJ; the artcle s publshed as provded by author and checked/revewed by guest edtor. 403