• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Two-Tier Clustering with Routing Protocol for IoT Assisted WSN

    2022-08-24 03:29:44ArokiarajJovithMahanteshMathapatiSundarrajanGnanasankaranSeifedineKadryMaythamMeqdadandShabnamMohamedAslam
    Computers Materials&Continua 2022年5期

    A.Arokiaraj Jovith,Mahantesh Mathapati,M.Sundarrajan,N.Gnanasankaran,Seifedine Kadry,Maytham N.Meqdad and Shabnam Mohamed Aslam

    1Department of Networking and Communications College of Engineering and Technology,SRM Institute of Science and Technology,Kattankulathur,603203,India

    2Department of Computer Science and Engineering,Rajarajeswari College of Engineering,Bengaluru,560074,India

    3Department of Computer Science and Engineering,K.Ramakrishnan College of Engineering,Tiruchirappalli,621112,India

    4Department of Computer Science,Thiagarajar College,Madurai,625019,India

    5Department of Applied Data Science,Noroff University College,Kristiansand,Norway

    6Al-Mustaqbal University College,Hillah,Iraq

    7Department of Information Technology,College of Computing and Information Sciences,Majmaah University,Al Majmaah,11952,Saudi Arabia

    Abstract:In recent times,Internet of Things(IoT)has become a hot research topic and it aims at interlinking several sensor-enabled devices mainly for data gathering and tracking applications.Wireless Sensor Network (WSN) is an important component in IoT paradigm since its inception and has become the most preferred platform to deploy several smart city application areas like home automation, smart buildings, intelligent transportation, disaster management,and other such IoT-based applications.Clustering methods are widely-employed energy efficient techniques with a primary purpose i.e., to balance the energy among sensor nodes.Clustering and routing processes are considered as Non-Polynomial(NP)hard problems whereas bio-inspired techniques have been employed for a known time to resolve such problems.The current research paper designs an Energy Efficient Two-Tier Clustering with Multi-hop Routing Protocol (EETTC-MRP) for IoT networks.The presented EETTC-MRP technique operates on different stages namely, tentative Cluster Head (CH) selection, final CH selection, and routing.In first stage of the proposed EETTC-MRP technique, a type II fuzzy logic-based tentative CH(T2FL-TCH)selection is used.Subsequently,Quantum Group Teaching Optimization Algorithm-based Final CH selection(QGTOA-FCH)technique is deployed to derive an optimum group of CHs in the network.Besides, Political Optimizer based Multihop Routing (PO-MHR) technique is also employed to derive an optimal selection of routes between CHs in the network.In order to validate the efficacy of EETTC-MRP method,a series of experiments was conducted and the outcomes were examined under distinct measures.The experimental analysis infers that the proposed EETTC-MRP technique is superior to other methods under different measures.

    Keywords:Wireless networks;internet of things;energy efficiency;clustering;multi-hop routing;metaheuristics

    1 Introduction

    In the recent years,the field of microelectronics has become highly advanced which led to research and development of resource-constraint devices,small nodes,and low-cost wireless sensors.Wireless Sensor Networks(WSNs)play a vital role in several WSN-enabled IoT applications[1].WSN-enabled IoT devices have been applied in a wide range of domains such as industrial wireless network,smart parking system, border security monitoring, animal monitoring system, and healthcare observing scheme[2].Actuation,Radio Frequency Identification(RFID),Sensor Nodes(SN),and other such devices are integrated to create WSN-enabled IoT networks so as to achieve few general objectives.The nodes that form a part of WSN-enabled IoT make the physical objects aware about real-time features in the positioned networks like monitoring,hearing,triggering and feeling an event with co-ordination of another device[3].The data collected from sensors is then transferred to Base Station(BS)through routing protocol.Almost all the devices that form a part of WSN-enabled IoT network operates on constrained non-rechargeable energy sources like battery.In general,WSN-enabled IoT applications are positioned in dense and rugged environments,and it can be complex to add/exchange the energy source from sensors.Hence, effective energy management is a major problem in WSN-enabled IoT devices[4].Fig.1 illustrates the structure of WSN.

    Figure 1:Structure of WSN

    WSN-enabled IoT network is positioned at a wide range compared to WSNs.Further,the number of nodes(mainly resource constraints)is larger than WSN networks[5].Therefore,conventional WSN approaches may not be efficient for scalable WSN-enabled IoT networks.In order to overcome the issues pertaining to network lifetime and scalability,several authors adapted cluster-based hierarchical architecture[6].The main objective in cluster-based routing protocol is the selection of effective Cluster Head(CH)and organization of residual nodes in the cluster.The node,within the clusters,transmits the data to CH.Here,CHs have a responsibility towards the aggregated data of local Cluster Members(CM)and it transmits the collected data to BS or nearby CH towards the BS.This further constrains the CHs which results in additional energy depletion than average node [7].The CH, closer to BS,consumes their energy quickly than other nodes since it performs as Relay Node (RN) for data aggregation,transmitted with distant CH.

    In all cases,WSN BS should generate an aggregate value for end users.It is possible to increase the level of data transmission by decreasing vitality utilization and broadcast overhead[8].The network could be appropriate in slight gathering to assist the collection of data called clusters.In data gathering,clustering could be deliberated as a partition of hub on the principles of scheme.Hence, clustering has become an attractive option to enhance the lifespan of network.There have been substantial metrics proposed earlier to evaluate the performance of a sensor organization[9].The flexibility of the controlled systems and energy efficiency must be grouped together.The networks should be allotted with more portions based on the requirement to increase the border of the network.Member node is used here which acts as a substitute hub to send and detect the collected data to CH[10].

    In Nalluri et al.[11], a hybrid protocol named EECAO protocol was presented to increase the efficiency of sensor networks in WSN-enabled IoT environment.Hybrid protocols include different clustering features like channel consistency,cognitive sensor throughput,energy cost for CH selection and a newly dispersed clustering method developed for self-organizing the positioned SN.Tandon et al.[12]proposed BiHCLR protocols to achieve energy preservation and effective routing in WSN-enabled IoT.At first,the positioned sensors are organized through a network based on network-based routing approach.Next, in order to assist the energy preservation in BiHCLR, FL algorithm is executed to select the CH for each cell in the network.At last, hybrid and biologically-inspired algorithms are employed in the selection of routing paths.The hybrid approach integrates SSO and moth search methods.In Mydhili et al.[13], the new MSPK++ clustering approach, using balanced clustering,was presented.The approach was further enhanced with the help of ML algorithm which is applicable for WSN on IoT environments.

    Chouhan et al.[14] introduced multipath routing protocols with the presented optimization approach i.e.,TSGWO approach in IoT-enabled WSN networks.Using multi-path routing protocols,a multi-path is developed by multi-path source nodes to many destinations.Initially,the node in IoTenabled WSN network is inspired together and execute the CH election through FGSA approach.Further,multipath routing processes are made based on the presented TSGWO approach,where the routing path is elected, by taking the fitness variables into account, such as trust factors and QoS parameters.Shukla et al.[15] presented SEEP algorithm to leverage multihop hierarchical routing system to minimize the utilization of power.In order to attain energy-effective and scalable networks,SEEP applies a multitier-based clustering architecture.The network areas in SEEP are separated into different areas using the presented sub-region division algorithms.Each area is separated into specific amount of clusters(sub-regions).The amount of clusters gets improved toward the BS,while the area widths get minimized.Multi-hop routing and clustering are classical techniques used for improving energy efficacy of the network.Instead of letting all the nodes in the network to directly transmit the data to BS, they are collected at distinct clusters.Depending on certain benchmarks, CH nodes are elected in all the clusters.The CH nodes would collect the data from other CM nodes and then transmits the processing data to BS through multiple hops with another CH node.There are two-fold benefits present in this system.Initially,the CH nodes can compress the data gathered from CMs to decrease the pointless redundancy.Next, energy efficacy gets considerably enhanced by letting each node from the network send for adjacent CH nodes and restraining multi-hop transmission to CH node.

    The current research paper designs an Energy Efficient Two-Tier Clustering with Multi-hop Routing Protocol(EETTC-MRP)for IoT networks.The presented EETTC-MRP technique operates on different stages namely, tentative Cluster Head (CH) selection, final CH selection, and routing.The proposed EETTC-MRP technique uses type II fuzzy logic-based tentative CH (T2FL-TCH)selection in its first stage.Subsequently, Quantum Group Teaching Optimization Algorithm-based Final CH selection (QGTOA-FCH) technique is used to derive an optimum set of CHs from the network.Besides,the Political Optimizer-based Multihop Routing(PO-MHR)technique is employed to perform an optimal selection of routes between CHs in the network.A widespread experimental analysis was conducted and the outcomes were inspected under different evaluation parameters.

    2 The Proposed Model

    In this study, a new EETTC-MRP technique is designed to achieve energy efficiency in IoTassisted WSN.The proposed EETTC-MRP technique encompasses three major processes namely,T2FL-TCH, QGTOA-FCH, and PO-MHR.The working mechanisms of these three modules are given in subsequent sections.

    2.1 System Model

    WSN has several SNs and BS.The sensor network possesses the following properties[16].

    ·Every node is heterogeneous.The nodes are arbitrarily allocated with sensor domain.

    ·All the nodes have unique ID and it could not be transferred after it is utilized.

    ·BS tend to exist outside the network too.

    ·BS is a constant power supply and it has no energy constraint.

    ·Node and BS are static and considered to be inactive.

    ·The communication amongst SNs takes place via multi-hop symmetric communication.

    ·SNs are connected with GPS devices and are location-aware.

    2.2 Design of T2FL-TCH Technique

    At this stage, the TCHs in IoT-assisted WSN can be proficiently chosen with the help of T2FL technique.T2FL generates effective outcomes over T1FL method.Three fuzzy input variables are considered to select the tentative CH.The three input variables are nothing but three Membership Functions(MF)each.The fuzzy set signifies three input variables,for instance,residual battery power,Distance to BS(DBS),and concentration.The linguistic variables for fuzzy sets are less,medium,and high while in case of Triangular MF (TMF), it is regarded as less, medium, and high.The 3rdfuzzy input variable has been concentrated heavily,which implies that several sensor nodes exist in specific locality.The degree of MF is demonstrated numerically compared to all other MFs.

    Rule Base and Inference Engine

    In this method, 27 rules are utilized based on fuzzy inference approach.Here, the rules for the procedure are discussed.X,Y,Z and C are considered here while X refers to residual battery power,Y implies DBS, Z demonstrates concentration, and C signifies the Confidence Factor (CF).The CF value that exists in CH is computed with the help of Mamdani’s Fuzzy rule, assuming three input parameters such as residual battery power,DBS,and concentration.T1FL technique has four components such as fuzzifier,fuzzy inference engine,fuzzy rules,and defuzzifier.There are four steps required to complete the procedure [17].Here, T1FL is utilized to handle the uncertainty levels to any extent,but not entirely as Type-1 fuzzy sets(T1FS)since the latter is certain about the outcomes.Conversely,Type-2 Fuzzy Logic(T2FL)approach has been helpful in circumstances when it turns out to be complex to determine a particular numeric MF and there is measurement uncertainty.The idea is to implement T2FL on WSN that is used for selecting an effectual CH.So,the load is allocated evenly amongst the SN.T2FL is considered by higher MF as well as inferior MF.These two functions are demonstrated(everyone)by T1FS MF.The interval between these two functions signifies the Footprint Of Uncertainty(FOU)that is employed for characterizing T2FL set.Assume that FOU is written asf.Iff°[0, 1], andf→0, then MF is regarded as T1FL.Whenf→0 to 1, next T2FL becomes a varied range of FOU amongst[0,1].However,the formation of rules is similar to T1FL.Hence,it is written as follows.

    The rules are resultant from the equation provided in Eq.(2):

    2.3 Design of QGTOA-FCH Technique

    Once the TCHs are elected,QGTOA technique is applied to select FCHs.A new GTOA approach is employed based on the inspiration from a group teaching method.The acquaintance of entire class(c)could be enhanced,i.e.,fundamental concept behind the presented method i.e.,GTOA can be used to enhance the outcomes.In order to execute GTOA algorithm for the optimization method,an easy group teaching method is proposed according to the rules given below.

    a.The only variance among students is their ability to acquire knowledge.The greatest challenge for a teacher is to formulate the teaching plans that suits the needs of learners who have different knowledge acquisition capacity.

    b.The aim of a qualified teacher is to show more interest upon the student with poor capacity of acquiring knowledge.

    c.Through self-learning, or interaction with fellow students, students are able to develop their knowledge in their free time.

    d.To enhance the knowledge of students,decent teacher allocation methods are very useful.

    Ability Grouping

    In order to represent the knowledge of entire class, standard distribution functions have been employed which are expressed in Eq.(3).

    In whichχrepresents the value,where standard distribution functions are needed.μdenotes the mean and Δ signifies the SD.In GTOA algorithm, each student is separated into two groups [18].Outstanding group is a group of students who have optimum capacity for grasping knowledge,while the groups with poor capacity of grasping knowledge is known as average group.

    Teacher Phase

    In this stage,students learn about the teacher,i.e.,the 2ndrule is determined before.In GTOA,the teacher generates distinct plans for outstanding group and average group.

    Teacher phase I:

    The teachers focus more on developing the knowledge of entire class,owing to good capability of the students in terms of knowledge acquisition.The students who belong to outstanding group possess high possibility of increasing their knowledge acquisition skills as shown in Eq.(4).

    Here, the number of students is denoted byN,Xjdenotes the knowledge of every student,Tindicates the knowledge of teacher andMsignifies the mean group knowledge.The teacher factor is denoted byF,Xteacher-jdenotes the knowledge of studentjwho is taught by the teacher.Arbitrariness is presented asbwhereascdenotes the interval between zero and one.

    Teacher phase II:

    According to the 2ndrule, the teachers shed more focus upon average group owing to weak acceptance knowledge capability of the students.The average,of the students combined together,who could attain knowledge is shown in Eq.(7).

    Here,drepresents arbitrariness in the range of zero and one.Eq.(8)addresses the problems for which a student could not gain knowledge from the teacher stage.

    Student Phase

    In free time,student could attain knowledge through self-learning,or interaction with classmates.This is expressed arithmetically in Eq.(9).The student stage is linked with 3rdrule by adding the student phases,I&II.

    Here,e&gcorrespond to two ransom numbers in the range of zero and one,represents the knowledge of studenti,anddenotes the knowledge of studentjwho learns from the teacher.If students could not attain knowledge in this stage,then they can be tackled in Eq.(10).

    Teacher Allocation Phase

    To enhance the knowledge of students,a decent teacher allocation approach is important,which can be determined as 4thrule.The top three students are elected stimulated by the hunting behaviors of grey wolves as shown in Eq.(11).

    Here,,andindicate top three best students,correspondingly.

    QGTOA technique is derived based on the concept of Quantum Computing(QC)to improve the performance of GTOA.QC is a new variety of computing process that accepts the approaches associated with quantum theory as quantum entanglement,quantum measurement,and state superposition.Qubit is an essential unit of QC.The two fundamental conditions|0〉and|1〉denote the qubit which is expressed as linear combination of these two fundamental situations as follows

    |α|2implies the probabilities of detecting state|0〉,|β|2refers to the probabilities of noticing state|1〉,where|α|2+|β|2= 1.The quantum has been established ofnqubits.According to the nature of quantum superposition, every quantum has 2nfeasible values.A n-qubits quantum is referred to as follows.

    The quantum gates have altered the condition of qubits like rotation gate,NOT gate,Hadamard gate, etc.The rotation gate [19] is described as a mutation operator for making quanta approach as the optimum solution and at last,the global optimal solutions are defined.

    The rotation gate is determined as follows.

    △θd= △×S (αd,βd),△θdsignifies the rotation angle of qubit,where △andS(αd,βd)denote size as well as way of rotation correspondingly.

    During energy utilization, cluster development plays an important role.This work utilizes QGTOA clustering technique for the formation of clusters.The cluster count (k) is evaluated with the formula given below.

    wherenimplies the amount of SNs,Drefers to the dimension of network field,and average distance of every SN to BS is represented byxBS.

    By utilizing Euclidean distance,the distance between the SNs to all cluster centers is determined based on the formula given below.

    whereXn2CCrepresents the distance of node to cluster center,Xjimplies the co-ordinate of SNj,andXCCrefers to the co-ordinate of cluster centers.

    2.4 Design of PO-MHR Technique

    During routing process, PO-MHR technique is used to derive an optimal set of routes to BS.PO algorithm is stimulated by western political optimization method that includes two features.The initial assumptions are as follows;each citizen tries to improve their goodwill to win the election and every party attempts to attain additional seats in the parliament.PO has six stages namely, party switching,election campaign,parliamentary affairs,interparty election,constituency allocation,and party formation[20].Fig.2 illustrates the flowchart of PO technique.

    The overall population could be separated tonpolitical party,as given in Eq.(17).

    Each party includesnparty members as shown in Eq.(18).

    Every party member inducesddimension as given as Eq.(19).

    Every solution could be an election candidate.Assume annelectoral district as denoted in Eq.(20).

    Suppose there isnmember in every constituency,as given in Eq.(21).

    Figure 2:Flowchart of PO

    The party leaders are determined as the member using an optimal fitness in a party can be demonstrated as Eq.(22).

    Each party leader could be shown in Eq.(23).

    The winner of the distinct constituencies is known as Member of Parliament, as expressed in Eq.(24)

    During election campaign phase, Eqs.(25) and (26) are used to update the location of possible solutions.

    In order to create a balance between exploitation and exploration, party switching is adapted.An adaptive variableλis employed, i.e., to dramatically reduce from 1 to 0 during whole iterative process.Every candidate is elected based on the likelihood,λand is replaced by the worst member of an arbitrarily elected party,as expressed in Eq.(27).

    During election phase,a constituency announces winner as expressed in Eq.(28).

    In this stage,the accessible paths between BS and CH nodes are initiated as primary population for the optimization algorithm.At first,one of the CHs is deliberated as transmitter and another CH is deliberated as intermediate sink/path.Hence,in this initialization stage,each potential path between CH and sink is expressed as follows(29).

    Whereas,‘Sol’indicates the primary population set,‘Pi’represents the ithpath between sink and CH,‘N’denotes the overall amount of paths.The paths include overall energy and distance.

    Let ‘RE’be the residual energy of node in the path and ‘DIST’means the overall distance of the path.The SD for remaining energy(σRE) is employed to measure the quality of uniform load distributions between sensors as follows(30).

    Now,

    In which,‘n’denotes the overall number of nodes present in the path and‘E(nodej)’signifies the remaining energy of ithnode in the path.Next, the distance between transmitter CH and the sink is computed by the amount of Euclidean distance among every CH in the path and is expressed through Eq.(32).

    Here,‘CHi(x)’and‘CHi(y)’characterize x&y coordinates of ithCH in the path correspondingly.Therefore, the initial objective of the presented optimization is to reduce the energy consumption as expressed in (31).The next objective is to decrease the path distance which is expressed in (32).Therefore,these two variables of each path are initiated as the primary population.

    In this stage, the fitness of each solution or path between the sink and CH is computed.The main goal of optimization is to discover the path with short distance and less power utilization.Therefore,the objective function consists of distance of each path and energy consumed.FF is equated as minimalization function and is a product of distance and energy as shown in Eq.(33).

    Here,‘Fi’denotes the fitness of ithpopulation,‘REi’represents the energy needed in ithpopulation and‘DISTi’indicates the overall distance of ithpopulation/path.

    3 Performance Validation

    The performance of the proposed EETTC-MRP approach with respect to ARE under varying node counts was validated and the results are shown in Tab.1 and Fig.3.The outcomes exhibit that EETTC-MRP method attained the maximal ARE under all node counts over other techniques.For instance,with 1000 nodes,EETTC-MRP method gained a superior ARE of 1 J,whereas other methods such as MOPSO, GWO-CR, EABC-CR, and GSO-MRP achieved minimum ARE values such as 0.94, 0.95, 0.95, and 0.93 J respectively.Likewise, with 4000 nodes, EETTC-MRP method attained an increased ARE of 0.86 J, whereas MOPSO, GWO-CR, EABC-CR, and GSO-MRP techniques gained lesser ARE values such as 0.63,0.71,0.75,and 0.84 J respectively.In the meantime,with 6000 nodes,the proposed EETTC-MRP approach attained a high ARE of 0.70 J,whereas other techniques such as MOPSO,GWO-CR,EABC-CR,and GSO-MRP methods obtained low ARE values such as 0.23,0.29,0.39,and 0.45 J respectively.Simultaneously,at 7000 nodes,the presented EETTC-MRP technique attained a high ARE of 0.52 J,whereas MOPSO,GWO-CR,EABC-CR,and GSO-MRP techniques obtained the least ARE values such as 0.00,0.25,0.35,and 0.40 J correspondingly.Finally,with 8000 nodes,EETTC-MRP method obtained a superior ARE value of 0.36 J,whereas MOPSO,GWO-CR,EABC-CR,and GSO-MRP approaches reached minimal ARE values such as 0.00,0.00,0.24,and 0.31 J respectively.

    Table 1:Comparative analysis of EETTC-MRP algorithm against other methods in terms of average residual energy

    Tab.2 and Fig.4 provide the results for ETE delay analysis of the proposed EETTC-MRP technique against existing techniques.The results demonstrate that the presented EETTC-MRP technique accomplished superior performance with least ETE delay under several nodes.For instance,under 100 nodes, the proposed EETTC-MRP technique resulted in a reduced ETE delay of 70 ms,while MOPSO, GWO-CR, EABC-CR, and GSO-MRP techniques attained high ETE delay times such as 115, 107, 90, and 77 ms respectively.Also, under 400 nodes, the presented EETTC-MRP approach achieved a less ETE delay of 98 ms, while other techniques such as MOPSO, GWOCR, EABC-CR, and GSO-MRP achieved high ETE delay time such as 140, 135, 127, and 110 ms correspondingly.Besides,under 600 nodes,EETTC-MRP model caused a minimal ETE delay of 117 ms,while MOPSO,GWO-CR,EABC-CR,and GSO-MRP techniques achieved improved ETE delay times such as 165, 155, 143, and 125 ms correspondingly.Additionally, under 800 nodes, EETTCMRP method accomplished a less ETE delay of 125 ms,while MOPSO,GWO-CR,EABC-CR,and GSO-MRP techniques obtained maximal ETE delay of 185,177,165,and 135 ms correspondingly.

    Figure 3:Average residual energy analysis of EETTC-MRP algorithm

    Table 2:Results of the analysis of EETTC-MRP algorithm in terms of end-to-end delay

    Tab.3 and Fig.5 offer the results of PLR analysis of the proposed EETTC-MRP approach against existing techniques.The results confirm that the presented EETTC-MRP method outperformed other methods by achieving maximum performance with less PLR under different nodes.For instance,under 100 nodes, EETTC-MRP method achieved a low PLR of 0.04, but MOPSO, GWO-CR,EABC-CR,and GSO-MRP techniques obtained high PLR values such as 0.18,0.13,0.11,and 0.08 correspondingly.Followed by, under 400 nodes, EETTC-MRP algorithm accomplished a less PLR of 0.07, but other techniques such as MOPSO, GWO-CR, EABC-CR, and GSO-MRP techniques gained high PLR values such as 0.25,0.18,0.18,and 0.13 respectively.In addition,under 600 nodes,the proposed EETTC-MRP technique achieved a low PLR of 0.08,but the presented MOPSO,GWO-CR,EABC-CR, and GSO-MRP techniques attained high PLR values such as 0.30, 0.24, 0.21, and 0.15 respectively.Furthermore, under 800 nodes, the EETTC-MRP approach accomplished a minimum PLR of 0.08 whereas the existing techniques such as MOPSO,GWO-CR,EABC-CR,and GSO-MRP attained high PLR values such as 0.33,0.28,0.25,and 0.17 correspondingly.

    Figure 4:Average delay analysis of EETTC-MRP algorithm

    Table 3:Results of the analysis of EETTC-MRP algorithm in terms of packet loss rate

    The performance of the proposed EETTC-MRP technique,in terms of PDR,under different node count is shown in Tab.4.The results depict that the presented EETTC-MRP technique achieved a high PDR under all node counts compared to other methods.For instance,with 100 nodes,the EETTCMRP technique attained an increased PDR of 0.96, whereas other techniques such as MOPSO,GWO-CR,EABC-CR,and GSO-MRP obtained low PDR values such as 0.82,0.87,0.89,and 0.92 respectively.In line with this,with 400 nodes,EETTC-MRP model reached a maximum PDR of 0.93,whereas MOPSO,GWO-CR,EABC-CR,and GSO-MRP methodologies gained less PDR values such as 0.75,0.82,0.82,and 0.87 correspondingly.Meanwhile,with 600 nodes,the EETTC-MRP method attained high PDR of 0.92, whereas other techniques such as MOPSO, GWO-CR, EABC-CR, and GSO-MRP gained less PDR values such as 0.70,0.76,0.79,and 0.85 respectively.Concurrently,with 800 nodes,EETTC-MRP model accomplished an improved PDR of 0.92,whereas MOPSO,GWOCR,EABC-CR,and GSO-MRP techniques obtained the least PDR values such as 0.67,0.72,0.75,and 0.83 correspondingly.Simultaneously,with 1000 nodes,the EETTC-MRP technique attained an enhanced PDR of 0.87,whereas MOPSO,GWO-CR,EABC-CR,and GSO-MRP algorithms achieved the least PDR values such as 0.66,0.67,0.71,and 0.80 respectively.

    Figure 5:Packet loss rate analysis of EETTC-MRP algorithm

    Table 4:Comparative PDR analysis of EETTC-MRP technique under varying node counts

    The results of NLT analysis for the presented EETTC-MRP technique in terms of FND,HND,and LND are shown in Tab.5 and Fig.6.The outcomes infer that the proposed EETTC-MRP technique gained the maximum NLT over other techniques.For instance, EETTC-MRP technique offered a lengthened FND of 2211 rounds, whereas MOPSO, GWO-CR, EABC-CR, and GSOMRP techniques attained the least FND values such as 668,963,1301,and 1932 rounds respectively.Moreover,EETTC-MRP approach presented a lengthened HND of 6277 rounds,whereas MOPSO,GWO-CR,EABC-CR,and GSO-MRP methods reached less HND values such as 4199,4623,5237,and 5707 rounds correspondingly.Furthermore,the presented EETTC-MRP algorithm accomplished a lengthened LND of 9386 rounds,whereas MOPSO,GWO-CR,EABC-CR,and GSO-MRP methodologies achieved minimal LND values such as 6828, 7603, 8218, and 8412 rounds correspondingly.From the detailed results of the analysis, it has been established that the proposed EETTC-MRP technique is superior in terms of energy efficiency and NLT in IoT-assisted WSN.

    Table 5:Network lifetime analysis interms of FND,HND,and LND

    Figure 6:Network lifetime analysis of EETTC-MRP algorithm

    4 Conclusion

    In this study, a new EETTC-MRP technique is designed to achieve energy efficiency in IoTassisted WSN.The proposed EETTC-MRP technique encompasses three major processes namely,T2FL-TCH, QGTOA-FCH, and PO-MHR.The use of T2FL for the selection of TCH helps in the appropriate selection of an optimal candidate CHs for final selection.In addition,the design of PO-MHR technique assists in deriving an optimal set of routes to BS, in such a way, to minimize energy consumption.A widespread experimental analysis was conducted and the outcomes were inspected under different evaluation parameters.The experimental results showcase the supremacy of EETTC-MRP technique over other techniques with a lengthened LND of 9386 rounds.In future,the performance of EETTC-MRP technique can be improved by including data aggregation design and MAC scheduling approaches.

    Funding Statement:Shabnam Mohamed Aslam would like to thank the Deanship of Scientific Research at Majmaah University for supporting this work under Project No.R-2021-242.

    Conflicts of Interest:The authors declare that they have no conflicts of interest to report regarding the present study.

    婷婷丁香在线五月| 精品亚洲成国产av| www.999成人在线观看| 交换朋友夫妻互换小说| 国产男人的电影天堂91| 免费不卡黄色视频| av在线播放精品| 一二三四在线观看免费中文在| 亚洲伊人色综图| 国产91精品成人一区二区三区 | 亚洲成人国产一区在线观看 | 久久久精品区二区三区| 少妇被粗大的猛进出69影院| 成年美女黄网站色视频大全免费| 操出白浆在线播放| av国产精品久久久久影院| 一级黄片播放器| 日本欧美视频一区| 国产免费福利视频在线观看| 91麻豆av在线| 久久久久网色| 久久国产精品男人的天堂亚洲| 亚洲av日韩精品久久久久久密 | 国产精品99久久99久久久不卡| 在线观看人妻少妇| 欧美激情高清一区二区三区| 亚洲成国产人片在线观看| 国产成人a∨麻豆精品| 亚洲精品国产区一区二| 国产欧美日韩精品亚洲av| 男女边摸边吃奶| 婷婷丁香在线五月| 亚洲精品一卡2卡三卡4卡5卡 | 久久精品熟女亚洲av麻豆精品| 国产一区二区激情短视频 | 黑人欧美特级aaaaaa片| 亚洲中文字幕日韩| 亚洲国产精品999| 色精品久久人妻99蜜桃| 黑人猛操日本美女一级片| 99国产精品一区二区三区| 国产亚洲精品第一综合不卡| 你懂的网址亚洲精品在线观看| 精品一区二区三区四区五区乱码 | kizo精华| 国产精品 国内视频| 国产精品人妻久久久影院| 欧美日韩国产mv在线观看视频| 中文字幕制服av| 亚洲精品美女久久久久99蜜臀 | 好男人电影高清在线观看| 日韩,欧美,国产一区二区三区| 亚洲av国产av综合av卡| 在线观看国产h片| 一级黄片播放器| 久久毛片免费看一区二区三区| 亚洲一码二码三码区别大吗| 欧美国产精品一级二级三级| 国产亚洲av高清不卡| 久久久精品免费免费高清| 中文字幕另类日韩欧美亚洲嫩草| 亚洲精品乱久久久久久| 手机成人av网站| 国产又爽黄色视频| 久久久久久久久久久久大奶| 两个人看的免费小视频| 亚洲国产欧美日韩在线播放| videosex国产| 少妇的丰满在线观看| 一本久久精品| 国产免费又黄又爽又色| 久久免费观看电影| 黄色a级毛片大全视频| 丰满饥渴人妻一区二区三| 亚洲精品一二三| 又大又爽又粗| 精品少妇久久久久久888优播| 亚洲五月色婷婷综合| 天天影视国产精品| 最新的欧美精品一区二区| 国产高清国产精品国产三级| 国产精品国产三级国产专区5o| 国产欧美日韩一区二区三 | 精品国产乱码久久久久久小说| 亚洲 欧美一区二区三区| 每晚都被弄得嗷嗷叫到高潮| 精品久久久久久久毛片微露脸 | 国产精品欧美亚洲77777| 丝袜脚勾引网站| 日韩精品免费视频一区二区三区| 免费人妻精品一区二区三区视频| 一区二区三区四区激情视频| 自线自在国产av| 久久国产精品大桥未久av| 日本wwww免费看| 99久久综合免费| 精品人妻1区二区| 国产精品九九99| 操出白浆在线播放| 老司机深夜福利视频在线观看 | 天堂中文最新版在线下载| 国产精品亚洲av一区麻豆| 中文字幕精品免费在线观看视频| 在线观看一区二区三区激情| 又大又爽又粗| 在线观看免费高清a一片| 国产深夜福利视频在线观看| 亚洲国产精品一区二区三区在线| 欧美少妇被猛烈插入视频| 一二三四在线观看免费中文在| 久久天堂一区二区三区四区| bbb黄色大片| 亚洲欧美一区二区三区久久| 精品视频人人做人人爽| 成人黄色视频免费在线看| 婷婷丁香在线五月| 97人妻天天添夜夜摸| 亚洲人成网站在线观看播放| 中文字幕人妻熟女乱码| 一本大道久久a久久精品| 丝袜喷水一区| 亚洲人成电影观看| 久久精品国产综合久久久| av在线老鸭窝| 男女免费视频国产| 欧美日韩视频高清一区二区三区二| 亚洲国产欧美日韩在线播放| 亚洲欧美一区二区三区黑人| 人人澡人人妻人| 亚洲国产成人一精品久久久| 亚洲国产精品一区二区三区在线| 丁香六月欧美| 天天躁狠狠躁夜夜躁狠狠躁| 久久免费观看电影| 一级毛片女人18水好多 | 18在线观看网站| 男女边吃奶边做爰视频| 国产精品国产三级国产专区5o| 精品人妻一区二区三区麻豆| 美女高潮到喷水免费观看| 欧美亚洲 丝袜 人妻 在线| 国产精品秋霞免费鲁丝片| 国产一区二区在线观看av| 久久久精品国产亚洲av高清涩受| 国产一区二区在线观看av| 十分钟在线观看高清视频www| 国产亚洲午夜精品一区二区久久| 好男人视频免费观看在线| 国产黄色视频一区二区在线观看| 亚洲国产欧美日韩在线播放| 欧美变态另类bdsm刘玥| 成在线人永久免费视频| 欧美日韩成人在线一区二区| 色综合欧美亚洲国产小说| 午夜日韩欧美国产| 性色av一级| 精品一品国产午夜福利视频| 欧美xxⅹ黑人| 操美女的视频在线观看| 无限看片的www在线观看| 成年动漫av网址| 只有这里有精品99| 丰满少妇做爰视频| 欧美老熟妇乱子伦牲交| 一本—道久久a久久精品蜜桃钙片| av国产精品久久久久影院| 999久久久国产精品视频| 久久人妻福利社区极品人妻图片 | 久久久欧美国产精品| 69精品国产乱码久久久| 精品福利观看| 99re6热这里在线精品视频| 老司机午夜十八禁免费视频| 久久人人爽人人片av| 九草在线视频观看| 国产片内射在线| 午夜精品国产一区二区电影| 老鸭窝网址在线观看| 9色porny在线观看| 日韩视频在线欧美| 免费在线观看黄色视频的| 老司机深夜福利视频在线观看 | 一区二区三区精品91| 中文字幕av电影在线播放| 国产亚洲av片在线观看秒播厂| 精品福利永久在线观看| 黄色毛片三级朝国网站| 午夜免费观看性视频| 亚洲美女黄色视频免费看| 9191精品国产免费久久| 久久天堂一区二区三区四区| 国产成人av教育| 老司机亚洲免费影院| 国产91精品成人一区二区三区 | 日本av免费视频播放| 国产免费一区二区三区四区乱码| 亚洲第一青青草原| 可以免费在线观看a视频的电影网站| 亚洲欧美日韩另类电影网站| 久久精品人人爽人人爽视色| 国产亚洲午夜精品一区二区久久| 国产日韩欧美亚洲二区| 男人操女人黄网站| 欧美日韩av久久| 久久精品国产亚洲av涩爱| av片东京热男人的天堂| 老司机靠b影院| 中文字幕人妻丝袜制服| 9色porny在线观看| 成年动漫av网址| av福利片在线| 亚洲熟女毛片儿| 叶爱在线成人免费视频播放| 青青草视频在线视频观看| 国产日韩欧美亚洲二区| 国产精品偷伦视频观看了| 一区二区三区乱码不卡18| 1024香蕉在线观看| 自拍欧美九色日韩亚洲蝌蚪91| 天堂俺去俺来也www色官网| 最近中文字幕2019免费版| 国产片内射在线| 亚洲国产精品国产精品| 日本色播在线视频| 亚洲专区国产一区二区| 亚洲欧美一区二区三区黑人| 亚洲国产欧美网| 国产午夜精品一二区理论片| e午夜精品久久久久久久| 亚洲中文字幕日韩| 满18在线观看网站| 天天躁日日躁夜夜躁夜夜| 亚洲成人国产一区在线观看 | 国产精品国产av在线观看| 18禁黄网站禁片午夜丰满| 国产精品一区二区精品视频观看| 欧美激情高清一区二区三区| 国产1区2区3区精品| 久久精品熟女亚洲av麻豆精品| 日韩伦理黄色片| 午夜激情av网站| 久久精品人人爽人人爽视色| 高潮久久久久久久久久久不卡| 一个人免费看片子| 午夜老司机福利片| 欧美日韩黄片免| 国产成人精品久久久久久| 日日夜夜操网爽| 两个人免费观看高清视频| 亚洲欧美成人综合另类久久久| 欧美精品亚洲一区二区| 午夜福利在线免费观看网站| 一区二区三区四区激情视频| 国产伦理片在线播放av一区| 男女边吃奶边做爰视频| 久久国产精品男人的天堂亚洲| 99精品久久久久人妻精品| 日韩 亚洲 欧美在线| 天天添夜夜摸| 精品少妇久久久久久888优播| 男女无遮挡免费网站观看| 亚洲欧洲国产日韩| 免费看av在线观看网站| 这个男人来自地球电影免费观看| 久久久久网色| 久久人妻熟女aⅴ| 久久99热这里只频精品6学生| 男人添女人高潮全过程视频| 日韩大片免费观看网站| 久久久久久久国产电影| 青草久久国产| 亚洲中文字幕日韩| 母亲3免费完整高清在线观看| 男男h啪啪无遮挡| 亚洲国产精品999| 美女扒开内裤让男人捅视频| 巨乳人妻的诱惑在线观看| 最黄视频免费看| 国产在线一区二区三区精| 久久天躁狠狠躁夜夜2o2o | 日韩大码丰满熟妇| 狂野欧美激情性bbbbbb| 男女免费视频国产| 我要看黄色一级片免费的| 国产在线视频一区二区| 黑人欧美特级aaaaaa片| 国产一卡二卡三卡精品| 国产精品免费大片| 国产真人三级小视频在线观看| 操出白浆在线播放| 飞空精品影院首页| 成人手机av| 99国产精品一区二区三区| 久久久国产精品麻豆| 亚洲情色 制服丝袜| 青春草视频在线免费观看| 国产成人av教育| 久久久久久免费高清国产稀缺| 日本a在线网址| 免费看不卡的av| 久久99一区二区三区| 国产成人91sexporn| 日本欧美国产在线视频| 久久亚洲精品不卡| 日韩人妻精品一区2区三区| 精品第一国产精品| 男人舔女人的私密视频| 精品国产乱码久久久久久男人| 欧美日韩亚洲国产一区二区在线观看 | 在线观看免费视频网站a站| 久久性视频一级片| 中文字幕高清在线视频| 青春草视频在线免费观看| 久久久久精品人妻al黑| 国产精品欧美亚洲77777| 一个人免费看片子| 国产成人欧美在线观看 | 一边亲一边摸免费视频| 日本91视频免费播放| 亚洲欧美精品自产自拍| 啦啦啦视频在线资源免费观看| 免费在线观看完整版高清| 成人三级做爰电影| 亚洲欧美色中文字幕在线| 制服诱惑二区| 在现免费观看毛片| 久久国产精品大桥未久av| 国产av国产精品国产| 无遮挡黄片免费观看| 母亲3免费完整高清在线观看| 老司机深夜福利视频在线观看 | 免费不卡黄色视频| 亚洲少妇的诱惑av| 桃花免费在线播放| 成人国产一区最新在线观看 | 国产野战对白在线观看| bbb黄色大片| 每晚都被弄得嗷嗷叫到高潮| 别揉我奶头~嗯~啊~动态视频 | 亚洲国产精品999| 欧美少妇被猛烈插入视频| 亚洲国产看品久久| 亚洲国产中文字幕在线视频| 精品视频人人做人人爽| 日本猛色少妇xxxxx猛交久久| 国产成人系列免费观看| 婷婷丁香在线五月| avwww免费| av网站在线播放免费| 国产成人系列免费观看| 91麻豆av在线| 久久精品熟女亚洲av麻豆精品| 成年女人毛片免费观看观看9 | 成人黄色视频免费在线看| 一区二区三区激情视频| 香蕉国产在线看| 丰满饥渴人妻一区二区三| 又大又爽又粗| 久久精品久久久久久久性| 天堂中文最新版在线下载| 王馨瑶露胸无遮挡在线观看| 99国产综合亚洲精品| 国产免费一区二区三区四区乱码| 性高湖久久久久久久久免费观看| 精品高清国产在线一区| 欧美日韩综合久久久久久| 啦啦啦在线免费观看视频4| 国产在线视频一区二区| 校园人妻丝袜中文字幕| 国产欧美亚洲国产| 热re99久久国产66热| 九草在线视频观看| 国产成人精品久久二区二区免费| 夫妻性生交免费视频一级片| 国产在视频线精品| 欧美xxⅹ黑人| 欧美日韩精品网址| 汤姆久久久久久久影院中文字幕| 妹子高潮喷水视频| 久9热在线精品视频| 亚洲国产欧美日韩在线播放| 黄色片一级片一级黄色片| 亚洲专区中文字幕在线| 精品一区二区三区四区五区乱码 | 久久九九热精品免费| 国产视频一区二区在线看| 国产黄色免费在线视频| 国产视频一区二区在线看| 18在线观看网站| 亚洲三区欧美一区| 久9热在线精品视频| 女人被躁到高潮嗷嗷叫费观| 久久久精品国产亚洲av高清涩受| 亚洲成人免费av在线播放| 日韩一卡2卡3卡4卡2021年| 97在线人人人人妻| 桃花免费在线播放| 日韩 欧美 亚洲 中文字幕| 大片电影免费在线观看免费| 考比视频在线观看| 国产一区二区 视频在线| 18禁国产床啪视频网站| 高清av免费在线| 男人舔女人的私密视频| 久久性视频一级片| 亚洲精品一卡2卡三卡4卡5卡 | 午夜免费男女啪啪视频观看| 国产一区亚洲一区在线观看| 久久久久久久国产电影| 国产精品成人在线| 亚洲欧美一区二区三区国产| 国产伦人伦偷精品视频| 亚洲中文日韩欧美视频| 十八禁网站网址无遮挡| 久久久精品94久久精品| 国产免费又黄又爽又色| e午夜精品久久久久久久| 亚洲精品中文字幕在线视频| 国产黄色免费在线视频| a级毛片黄视频| 久久女婷五月综合色啪小说| 91老司机精品| 国产午夜精品一二区理论片| 国产男人的电影天堂91| av天堂在线播放| 欧美亚洲 丝袜 人妻 在线| 亚洲自偷自拍图片 自拍| 亚洲精品美女久久av网站| 男女边吃奶边做爰视频| 国产一区有黄有色的免费视频| 国产色视频综合| 一边摸一边抽搐一进一出视频| 视频区欧美日本亚洲| 制服人妻中文乱码| 国产主播在线观看一区二区 | 老熟女久久久| 婷婷色综合大香蕉| 亚洲中文字幕日韩| a级毛片在线看网站| 一级毛片我不卡| 国产精品一区二区精品视频观看| 一级,二级,三级黄色视频| 亚洲五月色婷婷综合| 久久性视频一级片| 亚洲 国产 在线| 亚洲免费av在线视频| 国产亚洲av片在线观看秒播厂| xxx大片免费视频| 美女中出高潮动态图| svipshipincom国产片| 热99久久久久精品小说推荐| 免费在线观看日本一区| 欧美日韩综合久久久久久| 日本欧美国产在线视频| 亚洲av国产av综合av卡| 少妇粗大呻吟视频| 极品人妻少妇av视频| 国产精品久久久av美女十八| 国产男女内射视频| 亚洲国产精品999| 日日爽夜夜爽网站| 国产精品av久久久久免费| 欧美性长视频在线观看| 婷婷色麻豆天堂久久| 亚洲精品在线美女| 国产成人av教育| 丝袜喷水一区| 伦理电影免费视频| www.av在线官网国产| 咕卡用的链子| 亚洲国产欧美一区二区综合| 国产视频一区二区在线看| 欧美人与性动交α欧美精品济南到| av线在线观看网站| 亚洲精品国产一区二区精华液| 18禁国产床啪视频网站| 男男h啪啪无遮挡| 天堂中文最新版在线下载| 亚洲欧美精品综合一区二区三区| 超色免费av| 18禁观看日本| 精品人妻一区二区三区麻豆| 只有这里有精品99| 日韩制服丝袜自拍偷拍| 各种免费的搞黄视频| 欧美黑人精品巨大| 国产成人av激情在线播放| 亚洲成色77777| www日本在线高清视频| 一级片免费观看大全| 国产无遮挡羞羞视频在线观看| 精品国产一区二区久久| 久久精品熟女亚洲av麻豆精品| 久久热在线av| 亚洲av电影在线进入| 久久精品亚洲熟妇少妇任你| 婷婷色麻豆天堂久久| 午夜精品国产一区二区电影| 18禁裸乳无遮挡动漫免费视频| 欧美黑人精品巨大| 国精品久久久久久国模美| 精品国产乱码久久久久久男人| 亚洲欧美精品综合一区二区三区| 一区在线观看完整版| 国产野战对白在线观看| 国产人伦9x9x在线观看| 亚洲成色77777| 亚洲一区中文字幕在线| 亚洲美女黄色视频免费看| 十八禁高潮呻吟视频| 欧美中文综合在线视频| 成年人免费黄色播放视频| 精品久久久精品久久久| 亚洲av国产av综合av卡| 自线自在国产av| 又粗又硬又长又爽又黄的视频| 欧美黄色片欧美黄色片| 精品久久久精品久久久| 国产成人影院久久av| 久久人人97超碰香蕉20202| 中文精品一卡2卡3卡4更新| 久久天堂一区二区三区四区| 99国产精品99久久久久| 欧美在线一区亚洲| 久久久久久人人人人人| 狂野欧美激情性xxxx| 国产一卡二卡三卡精品| 99九九在线精品视频| 日韩av不卡免费在线播放| 亚洲精品国产av蜜桃| 成人三级做爰电影| 国产欧美日韩精品亚洲av| 又黄又粗又硬又大视频| 亚洲av国产av综合av卡| av天堂在线播放| av一本久久久久| 久久久国产精品麻豆| 精品福利观看| 视频区图区小说| 午夜福利乱码中文字幕| 久久国产亚洲av麻豆专区| 永久免费av网站大全| 亚洲精品中文字幕在线视频| 亚洲成国产人片在线观看| 亚洲国产精品999| 精品久久久精品久久久| 免费人妻精品一区二区三区视频| 精品人妻1区二区| 亚洲精品国产色婷婷电影| 国产av国产精品国产| 男女免费视频国产| 晚上一个人看的免费电影| 日韩制服骚丝袜av| 免费黄频网站在线观看国产| 最新的欧美精品一区二区| 国产免费一区二区三区四区乱码| 男女无遮挡免费网站观看| 亚洲国产精品一区二区三区在线| 捣出白浆h1v1| 国产一区亚洲一区在线观看| 秋霞在线观看毛片| 国产精品九九99| 亚洲精品国产色婷婷电影| 欧美国产精品va在线观看不卡| 日韩精品免费视频一区二区三区| 精品国产乱码久久久久久小说| 国产精品99久久99久久久不卡| 99国产综合亚洲精品| 欧美另类一区| 丁香六月天网| 久久九九热精品免费| 水蜜桃什么品种好| 国产有黄有色有爽视频| 中国国产av一级| 午夜免费观看性视频| 久久久精品94久久精品| 免费看不卡的av| 亚洲欧美日韩高清在线视频 | 久久青草综合色| 亚洲男人天堂网一区| 中国国产av一级| 欧美激情 高清一区二区三区| 中文字幕最新亚洲高清| 宅男免费午夜| 人人妻人人添人人爽欧美一区卜| 国产精品国产av在线观看| 国产成人啪精品午夜网站| av欧美777| 欧美另类一区| 午夜福利,免费看| 亚洲精品久久午夜乱码| 在线天堂中文资源库| 精品少妇内射三级| 中文字幕人妻丝袜制服| 在线 av 中文字幕| 亚洲av欧美aⅴ国产| 国产亚洲av高清不卡| 日本色播在线视频| 久久精品国产a三级三级三级| 久久久久久亚洲精品国产蜜桃av| 天天躁狠狠躁夜夜躁狠狠躁| 欧美日韩亚洲国产一区二区在线观看 | 中文字幕高清在线视频| 美女脱内裤让男人舔精品视频| 日本欧美国产在线视频| 只有这里有精品99| 国产xxxxx性猛交| 丝袜美足系列| 大香蕉久久成人网| 搡老岳熟女国产| 国产1区2区3区精品| 免费高清在线观看视频在线观看| tube8黄色片| 在线观看免费高清a一片| 久久99精品国语久久久|