NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK

Transcription

1 NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK Prasana kumar. S 1, Deepak.N 2, Tajudeen. H 3, Sakthsundaram. G 4 1,2,3,4Student, Department of Electroncs and Communcaton, Adhparasakth Engneerng College, Melmaruvathur,Tamlnadu, Inda *** Abstract -Wreless Sensor Network contans a tremendous number of mnor gadgets called sensor nodes that are spread n a physcal doman for gatherng requred data. Wth the ncorporaton of data detectng, calculaton, and wreless correspondence, the sensor nodes can detect physcal status, handle the sensed data, and report them to the snk node or Base Staton (BS). In ths project, we focus on the ssue of certfcate authorty to solate malware attacker and ncrease the network lfetme. Mostly, HWNs have hgh packet loss due to congeston and network dsconnectvty. Ths can be removed by mplementng proper routng strategy. Thereby, t has establshed effcent path n whch hgh amount of packets can be transferred between two moble clents. Even though, t provdes bulk data transmsson, t s unable to protect the data from malcous attacks. Snce HWNs follow mult hop routng mechansm, thereby, there s a chance to recover the data. The avalable routng protocol s effectvely applcable only to exstng networks such as WSNs, MANETs, VANETs and metropoltan MANETs but not for HWNs tll now. Therefore, the present study seeks to explore both securty and effcent load aware routng protocols. Such protocols have extended network connectvty to wde coverage and also lmted malcous attacks by adaptng trust based securty system. The congeston s completely removed from HWNs. Flexble and protectve communcaton lnks are acheved by usng the effcent load aware routng protocol. Key Words: Clusterng, energy balance, network lfetme, node deployment, wreless sensor network. 1. INTRODUCTION Today, Wreless Network technology plays a tremendous role to sustan suffcent data transfer at the tme of emergency and safety applcatons. The nfrastructure based ad-hoc network provdes proper gateway between the moble users and other terrestral networks (e.g., IEEE based W-F networks) for data communcaton. Such network s normally referred as Hybrd Wreless Networks (HWNs) whch take advantage of flexble network connectvty to wder coverage range [1]. But, t s dffcult to operate and coordnate among many Base Statons (BS)/Access Ponts (AP) whch are rregularly set throughout the networks. As a result, the performance effcency of such network has suffered very much due to loss of characterstc parameters and thereby, t leads to affect the overall Qualty of Servces (QoS) of the network [2]. Hence, t has brought out a hot research topc to develop new strategy of routng protocols whch provde a promse solutonto HWNs n the aspect of QoS. That s, t has mproved the bulk data transmsson and mnmzed the traffc congeston between source nodes and destnaton nodesof HWNs sgnfcantly. 1.1 Motvaton Mostly, HWNs have hgh packet loss due to congeston and network dsconnectvty. Ths can be removed by mplementng proper routng strategy. Thereby, t has establshed effcent path n whch hgh amount of packets can be transferred between two moble clents. Even though, t provdes bulk data transmsson, t s unable to protect the data from malcous attacks. Snce HWNs follow mult hop routng mechansm, thereby, there s a chance to recover the data. The avalable routng protocol s effectvely applcable only to exstng networks such as WSNs, MANETs, VANETs and metropoltan MANETs but not for HWNs tll now. Therefore, the present study seeks to explore both securty and effcent load aware routng protocols. Such protocols have extended network connectvty to wde coverage and also lmted malcous attacks by adaptng trust based securty system. The congeston s completely removed from HWNs. Flexble and protectve communcaton lnks are acheved by usng the effcent load aware routng protocol. 1.2 Objectve The focus of ths research work s to enhance QoS performance effcency of HWNs by adaptng effcent load and securty aware routng protocols: To develop a Fuzzy based Moblty and Energy Aware QOS Routng protocol (FMEAQRP) andto mprove the QOS of the HWNs. The best nodes and the shortest path n the network wll be dentfed by proposng a unfed algorthm namely Mult Objectve Evolutonary algorthm based on decomposton combned wth Djkstra (MOEAD/D). These algorthms help for fast packet delvery as well as for fndng the shortest path. 2019, IRJET Impact Factor value: ISO 9001:2008 Certfed Journal Page 2498

2 2. PROPOSED METHODOLOGY 2.1 Fuzzy Based Moblty and Energy Aware Qos Routng Protocol (FMEAQRP) The packet schedulng s an essental process requred to transfer data from source to destnaton node n the wreless network. Therefore, t s dffcult to access ts base staton. Anyhow, ths problem can be rectfed by mplementng HWNs. However, t faces some ssues lke network dsconnectvty, energy neffcency whenever varyng load and changng node poston occur respectvely. In order to overcome ths ssue the fuzzy based moblty and energy aware QoS routng protocol s proposed n ths study. Accordng to ths, rankng scheme s prepared by evaluatng the network parameters such as load, space utlty, resdual energy, lnk expry tme and sgnal strength at recever sde. The rankng s allotted to each ndvdual node from the estmated network parameters valued namely hgh, medum and low. The node s assgned wth hgh rankng, f the partcular node satsfes 4 out of 5 parameters under consderaton. Smlarly, node wth medum and low rankng s assgned accordng to the satsfacton of network parameter (3/5) and (2/5) respectvely. The rules are estmated on the bass of network parameters such as load, space utlty, resdual energy, lnk expry tme and sgnal strength at recever sde. In FMEAQRP, the varyng load s categorzed nto four groups whch are gven as: () Hard Deadlne wth large packet sze, () Hard Deadlne wth small packet sze, () Soft Deadlne wth large packet sze and (v) Soft Deadlne wth small packet sze. Therefore, Schedulng Probablty (SP) s revsed and t provdes proper selecton of forwardng node depends on the category of the packet. The forwardng node strategy of proposed FMEAQRPs tabulated as follows: Fuzzy decson rules are made by fuzzfyng the nput parameters and the schedulng s assessed based on the outcome of the rule. The fuzzy rules are defned as order based nterference whch s gven as follows: Step 1: The crsp nput s converted nto approprate lngustc parametrc varable and each one can be mapped wth ts correspondng fuzzy set rules. Ths process s referred as Fuzzfcaton. Step 2: The antecedents of the fuzzy rules accept the fuzzfer nputs whch are taken and then appled to the subsequent carred out by Trangular and Trapezodal membershp functons. Ths process s referred as Rule evaluaton. Step 3: The fuzzy rule s defned from fuzzy parametrc varable (.e. nput and output lngustc terms).the outputs of all rules are aggregated n ths step. Step 4: Agan convert lngustc parametrc varable nto crsp nput. It s called as Defuzzfcaton. That s, nput s obtanedas the aggregate output fuzzy set and correspondng output s offered as a sngle crsp number. S. No Table -1: Assgnment of Forwardng Nodes Deadlne Packet Sze 1. Hard Large 2. Hard Small 3. Soft Large 4. Soft Small Forwardng Node Assgnment Hgh schedulng Medum Schedulng Low Schedulng Medum Schedulng The performance of the FMEAQRP s evaluated through network parameters such as packet delvery rato, packet drop rato, packet delay and throughput. The hgh throughput rato s mantaned effectvely even under varyng load and node poston. However, t fals to protect the data from malcous attacks. Ths wll be overcome by adaptng secured packet data transmsson. 2.2 Securty Aware Routng Protocol for Hybrd Wreless Networks (SARP-HWNs) There s a presence of malcous attack durng bulk data transmsson. Ths has happened, because of the large number of hybrd nodes and possble routng paths. It s very dffcult to coordnate and select best routng from avalable number of possble routng paths. Due to dfferent scenaro, schedulng property of the FMEAQRP changes accordngly. So, there s a chance to get lnk falure and more traffc congeston takes place n the selected routng path. Ths wll lead to malcous attack created n the HWNs. It can be resolved by proposed SARP-HWNs routng protocol Intutonstc Fuzzy TOPSIS (IFT) nference model. It s an effcent model to detect the trusty ndvdual nodes by means of packet delvery rato, resdual energy of sender/recever; mult-hop overhead and throughput whch are computed by usng the dfferent node/route attrbutes. Ths estmated parametrc value s gven as nput to the IFT nterference model n whch Mult Crtera Decson Matrx (MCDM) s generated. ` D A 1 S1 11 S 2 21 S m m1 A m2 A n n 2n mn 2019, IRJET Impact Factor value: ISO 9001:2008 Certfed Journal Page 2499

3 3. RESULT AND DISCUSSION In ths secton, result outcomes and QoS performance of the proposed algorthm for HWNs are dscussed. The result and dscusson has been gven n the followng orders. 1: Fuzzy based Moblty and Energy Aware QOS Routng protocol (FMEAQRP) s mplemented to mprove the Qualty of Servce (QoS) for HWNs. To acheve ths,. The proper rankng methodology s assgned to each node based upon the dstance between neghbor s nodes. Based on ths, low, medum and hgh rankng scheme s gven to each node.. Then, the schedulng property s appled to dentfy the best routers whch establshe deffectve data transmsson after mnmze the traffc congeston among data packets. Because of node separatons, the throughput s dmnshed by the ncrement node speed n the outcome. Besdes, n comparson to QOD, the FMEAQRP has 25% hgher throughput when nodes are ncreased. Fgure 2(a) shows the plot between delay vs varyng packet sze from Bytes for both FMEAQRP and QOD protocols respectvely. Fgure 1: Demonstrate the metrc executon for FMEAQRP and QOD Protocolby varyngmoble node speed. 2: The network lfetme, energy effcency and secured data transmsson are enhanced along wth mprovement of Qualty of Servce (QoS) based on Securty Aware Routng Protocol for Hybrd Wreless Networks (SARP-HWNs).. It has hgh capablty of preventng malcous attacks and t takes quck recovery tme to establsh new routng path once connectvty falure known.. It Contans Mult crtera decson makng (MCDM) algorthm model whch provdes m number of best possble solutons gven out for n number of predefned attrbutes. Chart (a): Speed Vs Delay 3.1 Performance Evaluaton of FMEAQRP algorthms The expermental set up conssts of dfferent packet sze (250, 500, 750and 1000bytes) and unque zone sze of 1200m X 1200 m 3 area for 50 sec. The smulaton part s carred out by NS2 smulator. The FMEAQRP protocol tested and analyzed wth help of network parameters such as Constant Bt Rate (CBR) and end to end packet delay, packet drop and throughput rato.fgure1(a-d) shows the graphcal representaton of the FMEAQRP protocol outcomes wth respect to dfferent moble node speed whch s gvenas 1, 2, 3, 4, 5 and 10m/s respectvely. In Fgure 1(a) shows the comparatve analyses of the moble speed (1-5m/s) wth respect to delay for FMEAQRP and QOD protocols respectvely. When compared wth QOD, FMEAQRP has 30% less delay. Ths s because of hard date packets through the hgh sendng nodes. The delvery rato and packet drop of FMEAQRP and QOD protocols are evaluated and compared by varyng the moble speed whch s clearly gven n Fgure1 (b) and (c).when compared wth QOD, FMEAQRP has 39% hgher delvery rato and 19% lesser packet drop. Ths s because of nodes are selected on the bass of nterface qualty n FMEAQRP. In Fgure1 (d) shows the consequence of throughput acqured for FMEAQRP and QOD protocols on changng the moble speed. Chart (b): Speed Vs Delver rato Chart (c): Speed Vs Packet drop 2019, IRJET Impact Factor value: ISO 9001:2008 Certfed Journal Page 2500

4 Chart (d): Speed Vs Throughput Fgure 2: Show the metrcs performance for FMEAQRP and QOD protocol byvaryng Packet sze. Chart (b): Packet sze Vs Delver rato Chart (c): Packet sze Vs Packet drop Chart (a): Packet sze Vs Delay It s observed that the delay occurred whenever the packet sze of node ncreases. When compared wth QOD, FMEAQRP provdes 25% less delay. In Fgure 2 (b) and (c) the sgnfcance of delvery rato and packet drop s noted by changng the packet sze for FMEAQRP and QOD protocols respectvely. It shows that the quantty of packets transmtted s less, the packet drops decrease and the delvery rato ncreases. When compared to QOD, FMEAQRP has 41% hgher delvery rato and 13% lesser packet drop as sendng nodes wth better connecton qualty. The result of throughput obtaned for FMEAQRP and QOD protocols by ncreasng the packet sze gven n Fgure 2(d). The fgure descrbes the Increment packet sze n the outcome by ncrementng the throughput. When compared to QOD, FMEAQRP has 28% hgher throughput wth better connecton qualty. Chart (d): Packet sze Vs Throughput 3.2 Performance Evaluaton of SARP-HWNs algorthms The network lfetme, energy effcency and secured data transmsson are enhanced along wth mprovement of Qualty of Servce (QoS) based on SARP-HWNs algorthm. It uses Mult crtera decson makng (MCDM) algorthm model whch provdes m number of best possble soluton gven out for n number of predefned attrbutes. Hence, t provdes maxmum network lfetme. The performance of proposed SARP-HWN s analyzed by usng three parameters (packet loss rato, network lfetme and end-to-end delay). The smulaton setup consst of the followng crteron such as varyng speed of node by constant multply of 10 m/s and 2019, IRJET Impact Factor value: ISO 9001:2008 Certfed Journal Page 2501

5 network sze ( ).Fgure 3(a) shows the plot of packet loss rato wth respect to number of nodes and ts varyng speed. It s clearly observed that the packet loss rato decreases as the number of nodes and ts speed change respectvely. Hence, t s concluded that the packet loss rato of the SARP-HWNs s better than POLITIC routng protocol due to mnmum packet loss rato. Fgure 3(b) shows the plot of end to end delay wth respect to number of nodes and ts varyng speed. It s clearly observed that the packet delay s reduced when number of nodes and ts speed change rapdly. Therefore, t s concluded that the end to end delay of the SARP-HWNs s acheved through reasonable good qualty servce n the aspects of packet delay as compared wth POLITIC routng protocol. Fgure 3(c) shows the plot of routng cost wth respect to number of nodes and ts varyng speed. It s clearly observed that the routng cost s mnmzed due to optmum set of best paths whch are dentfed wth help of Mult crtera decson makng (MCDM) algorthm model whch provdes m number of best possble soluton gven out for n number of predefned attrbutes. Hence, t leads to have mnmum routng cost. Due to ths, the routng cost of the SARP-HWNs provdes hgh performance effcency when compared wth POLITIC routng protocol. Fgure 3: Comparatve analyss of SARP-HWN wth POLITIC routng protocol Chart (c): Routng cost Fgure 3(d) shows the plot of throughput rato wth respect to number of nodes and ts varyng speed. It s clearly observed that the number of packets/frames ncreases, as the number of nodes and ts speed change respectvely. Hence, t s concluded that the throughput rato of the SARP- HWNs s larger than POLITIC routng protocol due to avalablty of multple set of best possble routng paths. Fgure 3(e) shows the plot of jtter wth respect to number of nodes and ts varyng speed. It s clearly nferred that the delay dfference of the two successve packet transmssons s mproved when the number of nodes and ts speed change respectvely., t leads to have optmum energy consumpton that takes place at every ndvdual node n the network. It s clearly gven n Fgure 3(f) whch shows the plot of energy consumpton wth respect to smulaton tme. Chart (a): Packet loss Chart (d): Throughput Chart (b): End to end delvery Chart (e): Jtter 2019, IRJET Impact Factor value: ISO 9001:2008 Certfed Journal Page 2502

6 [2] Zhao, Ganln, and Qlan Lang. "On the uplnk outage throughput capacty of hybrd wreless networks wth massve MIMO" Ad Hoc Networks, DOI: /J.adhoc ,Vol.58, pp.62-49, [3] Zhang, Baoju, et al. "On the downlnk throughput capacty of hybrd wreless networks wth MIMO." IEEE Access Vol.5, pp , CONCLUSION Chart (f): Energy consumpton In ths research work, attempt has been made to acqure a new strategy of routng protocols whch provdes a promsng soluton to HWNs n the aspect of QoS. Frst, the fuzzy based moblty and energy aware QoS routng protocol s proposed to enhance the packet schedulng strategy by whch proper data transfer s obtaned between moble nodes. Thereby, hgh throughput rato s acheved even under varable load and node poston respectvely. However, lnk falure and traffc congeston nduced malcous attack n the HWNs. It can be resolved by proposed SARP-HWNs routng protocol, Intutonstc Fuzzy Topss (IFT) nference model. It ncludes both Mult Crtera Decson Matrx (MCDM) and Gravtatonal Search Algorthm (GSA). The MCDM dentfy best routng paths after evaluated trust values from node/routng attrbutes. At each tme nstant, GSA selects one effcent best routng path from possble set of routng paths for packet data transmsson. Agan, the large number of nodes avalable n the effcent best routng path suffer energy conservaton problem. It forms weghted normalzed decson metrc by takng three extra crtera such as Level of enrollment (total number of actve best nodes), Level of non-partcpaton (total number of passve best node) and Intutonstc fle (ftness weghted value). It provdes mnmum number of nodes whch nduce mnmum 20% mprovement n Delvery Rato and 20% reducton n delay and effcent shortest routng path. On the whole, the performance evaluaton parameter of QoS of HWNs s mproved as compared to other load aware routng protocols. In future, the hybrd wreless networks wll be mplemented for mult-dscplnary applcatons, where proposed protocols are analyzed under the real tme scenaros by adaptng dfferent testng technques. [4] L, Ze, and HayngShen. "A QoS-orented dstrbuted routng protocol for hybrd wreless networks." IEEE Transactons on moble computng Vol.13, No.3, pp , [5] Akkarajtsakul, Khajonpong, EkramHossan, and DustNyato. "Cooperatve packet delvery n hybrd wreless moble networks: A coaltonal game approach." IEEE Transactons on Moble Computng Vol.12, No.5, pp , 2013 [6] Cha, Yuan, Wenxao Sh, and Tanhe Sh. "Load-aware cooperatve hybrd routng protocol n hybrd wreless mesh networks" AEU-Internatonal Journal of Electroncs and Communcatons, Vol.74, pp , [7] Lu, Ka, et al. "Cooperatve data schedulng n hybrd vehcular ad hoc networks: VANET as a software defned network." IEEE/ACM Transactons on Networkng (TON), Vol.24, No.3, pp , 2016 [8] Robnson, Y. Harold, et al. "Energy aware clusterng scheme n wreless sensor network usng neuro-fuzzy approach." Wreless Personal Communcatons Vol.95, No.2, pp , [9] Deepa, C., and B. Latha. "HHSRP: a cluster based hybrd herarchcal secure routng protocol for wreless sensor networks." Cluster Computng, pp.1-17, [10]Jamaesha, S. Syed, and S. Bhavan. "A secure and effcent cluster based locaton aware routng protocol n MANET."ClusterComputng, DOI: REFERENCES [1] Shen, Hayng, Ze L, and Le Yu. "A P2P-based marketguded dstrbuted routng mechansm for hghthroughput hybrd wreless networks" IEEE Transactons on moble computng Vol.14, No.2, pp , , IRJET Impact Factor value: ISO 9001:2008 Certfed Journal Page 2503