• <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又黄又爽大尺度在线免费看| 大香蕉久久网| 国产乱人偷精品视频| 男人爽女人下面视频在线观看| 深爱激情五月婷婷| 欧美精品人与动牲交sv欧美| 在线播放无遮挡| 少妇人妻精品综合一区二区| 久久久久久久久大av| 三级男女做爰猛烈吃奶摸视频| 亚洲在线观看片| 美女视频免费永久观看网站| 美女cb高潮喷水在线观看| 欧美少妇被猛烈插入视频| 蜜臀久久99精品久久宅男| 黄色一级大片看看| 免费少妇av软件| 欧美3d第一页| 日本欧美国产在线视频| 亚洲经典国产精华液单| 成年av动漫网址| 久久久久国产精品人妻一区二区| 一级毛片电影观看| 精品久久久久久久久亚洲| 99视频精品全部免费 在线| 国产淫语在线视频| 亚洲综合精品二区| 久久久久久伊人网av| av女优亚洲男人天堂| 久久久成人免费电影| av在线观看视频网站免费| 国产真实伦视频高清在线观看| 中文字幕久久专区| av女优亚洲男人天堂| 国产高清有码在线观看视频| 亚洲综合色惰| 身体一侧抽搐| 伦理电影大哥的女人| 青春草视频在线免费观看| 麻豆精品久久久久久蜜桃| 亚洲欧美日韩卡通动漫| 高清av免费在线| 欧美bdsm另类| 成人欧美大片| 免费看日本二区| 18禁在线无遮挡免费观看视频| 精品午夜福利在线看| 黄片wwwwww| 国产成人精品久久久久久| 99re6热这里在线精品视频| 亚洲人成网站在线播| av国产久精品久网站免费入址| 2018国产大陆天天弄谢| 日韩中字成人| 我的老师免费观看完整版| 色网站视频免费| 特级一级黄色大片| 在线观看一区二区三区激情| 亚洲国产成人一精品久久久| 色婷婷久久久亚洲欧美| 嫩草影院新地址| 国产精品三级大全| 少妇人妻久久综合中文| 亚洲精品日韩在线中文字幕| 黄色一级大片看看| 国产伦在线观看视频一区| 精品视频人人做人人爽| 成人二区视频| 国产片特级美女逼逼视频| av国产精品久久久久影院| 欧美精品国产亚洲| 日韩中字成人| 亚洲一区二区三区欧美精品 | av在线亚洲专区| 特大巨黑吊av在线直播| 久久久色成人| 深爱激情五月婷婷| 国产一区二区亚洲精品在线观看| 久久久久久伊人网av| 国产精品无大码| 在线观看av片永久免费下载| 日日摸夜夜添夜夜添av毛片| 国产久久久一区二区三区| 老司机影院成人| 欧美性感艳星| 精品久久久久久电影网| 一级毛片黄色毛片免费观看视频| 一级爰片在线观看| 美女视频免费永久观看网站| 在线 av 中文字幕| 91在线精品国自产拍蜜月| 成人国产av品久久久| 免费看不卡的av| 免费黄网站久久成人精品| 天堂俺去俺来也www色官网| 午夜亚洲福利在线播放| 国产男人的电影天堂91| 街头女战士在线观看网站| 国内精品美女久久久久久| 日韩国内少妇激情av| 夜夜爽夜夜爽视频| 男女那种视频在线观看| 热re99久久精品国产66热6| 简卡轻食公司| 国模一区二区三区四区视频| 午夜免费鲁丝| 大片电影免费在线观看免费| 亚洲怡红院男人天堂| 午夜福利在线观看免费完整高清在| 白带黄色成豆腐渣| 日韩国内少妇激情av| 欧美人与善性xxx| 国产欧美日韩精品一区二区| 国产久久久一区二区三区| 久久久久国产精品人妻一区二区| 热99国产精品久久久久久7| 欧美激情在线99| av一本久久久久| 久久人人爽人人爽人人片va| 在线观看一区二区三区| 亚洲成人精品中文字幕电影| 国内精品美女久久久久久| 色网站视频免费| 日本熟妇午夜| 成人午夜精彩视频在线观看| 精品人妻一区二区三区麻豆| 精品一区二区免费观看| 国产亚洲5aaaaa淫片| 三级国产精品欧美在线观看| 美女被艹到高潮喷水动态| 国产在线一区二区三区精| 水蜜桃什么品种好| 亚洲精品影视一区二区三区av| 亚洲综合色惰| 99久久精品热视频| 少妇人妻一区二区三区视频| 男女边摸边吃奶| 国内少妇人妻偷人精品xxx网站| 岛国毛片在线播放| 在线精品无人区一区二区三 | 三级国产精品片| 久久精品夜色国产| 性色av一级| 久久精品久久久久久久性| 国产淫片久久久久久久久| 国内精品宾馆在线| 99久久精品国产国产毛片| videossex国产| 欧美zozozo另类| 亚洲色图综合在线观看| 国产综合精华液| 一级毛片久久久久久久久女| 久久综合国产亚洲精品| 啦啦啦在线观看免费高清www| 菩萨蛮人人尽说江南好唐韦庄| 汤姆久久久久久久影院中文字幕| 在线看a的网站| 亚洲av中文av极速乱| 男女边摸边吃奶| 免费看a级黄色片| 两个人的视频大全免费| 久久久精品免费免费高清| 99热全是精品| 亚洲国产最新在线播放| 亚洲精品影视一区二区三区av| 在线观看美女被高潮喷水网站| 一本色道久久久久久精品综合| 草草在线视频免费看| 国产伦精品一区二区三区视频9| 午夜福利在线在线| 黄片wwwwww| 最新中文字幕久久久久| 一本—道久久a久久精品蜜桃钙片 精品乱码久久久久久99久播 | 国内揄拍国产精品人妻在线| 精华霜和精华液先用哪个| 一区二区三区精品91| 久久国产乱子免费精品| 久久99精品国语久久久| 街头女战士在线观看网站| 亚洲精品日韩av片在线观看| 搡女人真爽免费视频火全软件| 3wmmmm亚洲av在线观看| 成人毛片60女人毛片免费| 高清午夜精品一区二区三区| 精品熟女少妇av免费看| 国产女主播在线喷水免费视频网站| 精品熟女少妇av免费看| 日本黄大片高清| 国产免费福利视频在线观看| 麻豆久久精品国产亚洲av| h日本视频在线播放| 国产男女超爽视频在线观看| 国产高清不卡午夜福利| 女人久久www免费人成看片| av天堂中文字幕网| 日韩,欧美,国产一区二区三区| 国产伦在线观看视频一区| 一级爰片在线观看| 丝袜喷水一区| 免费黄频网站在线观看国产| 久久精品国产亚洲av天美| 老女人水多毛片| 久久精品熟女亚洲av麻豆精品| 少妇的逼水好多| 国产精品不卡视频一区二区| 中国美白少妇内射xxxbb| 日韩,欧美,国产一区二区三区| 三级经典国产精品| 日本免费在线观看一区| 麻豆久久精品国产亚洲av| 国内少妇人妻偷人精品xxx网站| 男女啪啪激烈高潮av片| 2021天堂中文幕一二区在线观| 久久99蜜桃精品久久| 草草在线视频免费看| 大片电影免费在线观看免费| 我要看日韩黄色一级片| 少妇裸体淫交视频免费看高清| 国产免费一区二区三区四区乱码| 亚洲欧美中文字幕日韩二区| 特级一级黄色大片| 波多野结衣巨乳人妻| 久久久欧美国产精品| 十八禁网站网址无遮挡 | 男人爽女人下面视频在线观看| 自拍偷自拍亚洲精品老妇| 久久97久久精品| 精品熟女少妇av免费看| 天天一区二区日本电影三级| 麻豆成人av视频| 99re6热这里在线精品视频| 久久鲁丝午夜福利片| 国产伦在线观看视频一区| 国产在线男女| 久久久欧美国产精品| 日韩成人伦理影院| 亚洲在久久综合| 波野结衣二区三区在线| h日本视频在线播放| 国产精品久久久久久久电影| 国产成人精品久久久久久| 国产永久视频网站| 街头女战士在线观看网站| 看非洲黑人一级黄片| 日日啪夜夜撸| 日韩精品有码人妻一区| 国产精品三级大全| 亚洲,一卡二卡三卡| 男插女下体视频免费在线播放| 狂野欧美激情性bbbbbb| 香蕉精品网在线| 国产精品麻豆人妻色哟哟久久| 在线播放无遮挡| 成年女人看的毛片在线观看| 国产精品偷伦视频观看了| 国产精品一及| 美女xxoo啪啪120秒动态图| 能在线免费看毛片的网站| 成年免费大片在线观看| 国产色爽女视频免费观看| 人妻一区二区av| 身体一侧抽搐| 哪个播放器可以免费观看大片| 亚洲av福利一区| 国产黄片视频在线免费观看| 日韩亚洲欧美综合| 女人被狂操c到高潮| 亚洲av成人精品一区久久| 80岁老熟妇乱子伦牲交| 日韩国内少妇激情av| 交换朋友夫妻互换小说| 看非洲黑人一级黄片| 欧美国产精品一级二级三级 | 精品99又大又爽又粗少妇毛片| 尤物成人国产欧美一区二区三区| 久久久欧美国产精品| 一级毛片黄色毛片免费观看视频| 自拍偷自拍亚洲精品老妇| 亚洲精品乱久久久久久| 国产精品久久久久久av不卡| 国产精品99久久99久久久不卡 | 在线观看av片永久免费下载| 少妇被粗大猛烈的视频| 听说在线观看完整版免费高清| 亚洲国产色片| 尤物成人国产欧美一区二区三区| 国产精品99久久久久久久久| 1000部很黄的大片| av免费在线看不卡| 少妇猛男粗大的猛烈进出视频 | 久久久久久九九精品二区国产| 中国三级夫妇交换| 久久韩国三级中文字幕| 免费看av在线观看网站| 另类亚洲欧美激情| 在线看a的网站| 中国三级夫妇交换| 男男h啪啪无遮挡| 香蕉精品网在线| av在线亚洲专区| 91午夜精品亚洲一区二区三区| 亚洲精品色激情综合| 欧美激情在线99| 成人二区视频| 久久久久久久久久成人| 男人舔奶头视频| 国产成人精品婷婷| 久久久久九九精品影院| 九九爱精品视频在线观看| 国产精品不卡视频一区二区| 国内少妇人妻偷人精品xxx网站| 亚洲av.av天堂| 国产精品久久久久久av不卡| 少妇熟女欧美另类| 男女无遮挡免费网站观看| 亚洲经典国产精华液单| 日本午夜av视频| 观看美女的网站| 啦啦啦啦在线视频资源| 国产精品国产av在线观看| 寂寞人妻少妇视频99o| 亚洲av男天堂| 亚洲婷婷狠狠爱综合网| 深夜a级毛片| 亚洲精品国产成人久久av| 水蜜桃什么品种好| av专区在线播放| 两个人的视频大全免费| 一本色道久久久久久精品综合| 欧美zozozo另类| 久久久久久久国产电影| 国产欧美亚洲国产| 亚洲精品日韩av片在线观看| 美女xxoo啪啪120秒动态图| 久久精品国产亚洲网站| 国产在线男女| 国产高清不卡午夜福利| eeuss影院久久| 一区二区三区四区激情视频| a级毛色黄片| 成人一区二区视频在线观看| 插逼视频在线观看| 免费av毛片视频| 欧美xxxx黑人xx丫x性爽| 亚洲天堂国产精品一区在线| .国产精品久久| 视频区图区小说| av在线播放精品| 超碰97精品在线观看| 免费看不卡的av| 肉色欧美久久久久久久蜜桃 | 免费看日本二区| 国产伦在线观看视频一区| 亚洲一区二区三区欧美精品 | 久久久久久久久久久丰满| 国产白丝娇喘喷水9色精品| eeuss影院久久| 亚洲精品久久午夜乱码| 成人鲁丝片一二三区免费| 人妻制服诱惑在线中文字幕| 视频区图区小说| 亚洲国产精品成人综合色| 欧美 日韩 精品 国产| 少妇高潮的动态图| eeuss影院久久| av国产精品久久久久影院| 晚上一个人看的免费电影| 人人妻人人爽人人添夜夜欢视频 | 少妇的逼好多水| 少妇 在线观看| 中国美白少妇内射xxxbb| av免费观看日本| 黄色怎么调成土黄色| 中文字幕亚洲精品专区| 免费av不卡在线播放| 国产亚洲91精品色在线| 亚洲精品国产av成人精品| 久久久久久久亚洲中文字幕| 亚洲欧美一区二区三区黑人 | 大片电影免费在线观看免费| 中文乱码字字幕精品一区二区三区| 亚洲av中文字字幕乱码综合| 蜜臀久久99精品久久宅男| 午夜亚洲福利在线播放| 极品教师在线视频| 欧美激情国产日韩精品一区| 看非洲黑人一级黄片| 六月丁香七月| 国产色爽女视频免费观看| 欧美精品一区二区大全| 国产视频首页在线观看| 女人被狂操c到高潮| 大香蕉久久网| 菩萨蛮人人尽说江南好唐韦庄| 精品久久久精品久久久| 成人美女网站在线观看视频| 日韩一本色道免费dvd| 久久综合国产亚洲精品| 18禁动态无遮挡网站| 国产有黄有色有爽视频| 一级片'在线观看视频| 国产老妇伦熟女老妇高清| 精品久久久久久久人妻蜜臀av| av在线观看视频网站免费| 欧美激情在线99| 午夜精品一区二区三区免费看| 永久网站在线| 搡老乐熟女国产| 久热久热在线精品观看| 三级男女做爰猛烈吃奶摸视频| 一级毛片 在线播放| 亚洲国产色片| 尾随美女入室| 最新中文字幕久久久久| 一区二区三区免费毛片| 国产成人精品一,二区| 日韩av不卡免费在线播放| 美女xxoo啪啪120秒动态图| 国产v大片淫在线免费观看| 一个人看的www免费观看视频| 日韩三级伦理在线观看| 国产中年淑女户外野战色| 久久鲁丝午夜福利片| 免费av毛片视频| 国产 精品1| 亚洲欧美成人精品一区二区| 成人毛片a级毛片在线播放| 在线观看国产h片| 亚洲av不卡在线观看| 插逼视频在线观看| 久久久久久久午夜电影| 免费看av在线观看网站| 黄色日韩在线| 精品久久久久久久久av| 99热这里只有是精品在线观看| 色综合色国产| xxx大片免费视频| 在线免费观看不下载黄p国产| 搞女人的毛片| 久久久久久伊人网av| 最近2019中文字幕mv第一页| 亚洲欧美日韩东京热| 少妇人妻久久综合中文| 简卡轻食公司| 国产欧美亚洲国产| 在线观看三级黄色| 国产精品久久久久久精品古装| 亚洲成人av在线免费| a级毛片免费高清观看在线播放| 国产v大片淫在线免费观看| 在线天堂最新版资源| 美女xxoo啪啪120秒动态图| 亚洲美女搞黄在线观看| 男女啪啪激烈高潮av片| 国产黄片视频在线免费观看| 男人舔奶头视频| 久久99热这里只频精品6学生| 真实男女啪啪啪动态图| 午夜福利在线在线| 97热精品久久久久久| 另类亚洲欧美激情| 最新中文字幕久久久久| 少妇 在线观看| 亚洲精品日本国产第一区| 久久久色成人| 一个人看视频在线观看www免费| 自拍欧美九色日韩亚洲蝌蚪91 | 亚洲精品久久久久久婷婷小说| 久久6这里有精品| 免费少妇av软件| 欧美亚洲 丝袜 人妻 在线| 性色avwww在线观看| 人妻一区二区av| 亚洲国产欧美在线一区| 国产精品伦人一区二区| 男的添女的下面高潮视频| 91久久精品国产一区二区成人| 日韩一区二区视频免费看| 又大又黄又爽视频免费| 国产黄色视频一区二区在线观看| 久久鲁丝午夜福利片| 我的女老师完整版在线观看| 午夜老司机福利剧场| 内地一区二区视频在线| 真实男女啪啪啪动态图| 成人午夜精彩视频在线观看| 网址你懂的国产日韩在线| 深夜a级毛片| 国产亚洲91精品色在线| 免费黄色在线免费观看| 18+在线观看网站| 久久久久久伊人网av| 久热久热在线精品观看| 国产黄色免费在线视频| 久久久色成人| 国产男女超爽视频在线观看| 国产男女内射视频| 国产亚洲av片在线观看秒播厂| 亚洲自拍偷在线| 水蜜桃什么品种好| 成年女人看的毛片在线观看| 天天躁日日操中文字幕| 搞女人的毛片| 国产高清国产精品国产三级 | 日日啪夜夜爽| 亚洲激情五月婷婷啪啪| 国产视频首页在线观看| 2022亚洲国产成人精品| 久久久久九九精品影院| 少妇高潮的动态图| 一级二级三级毛片免费看| 欧美潮喷喷水| 亚洲一级一片aⅴ在线观看| 91精品国产九色| 亚洲激情五月婷婷啪啪| 亚洲四区av| 夫妻性生交免费视频一级片| 久久人人爽av亚洲精品天堂 | 观看免费一级毛片| 只有这里有精品99| 国产淫片久久久久久久久| 九九在线视频观看精品| 国产成人免费无遮挡视频| 国产伦理片在线播放av一区| 国产国拍精品亚洲av在线观看| 别揉我奶头 嗯啊视频| 国产精品国产三级专区第一集| 色婷婷久久久亚洲欧美| 精品国产一区二区三区久久久樱花 | 五月天丁香电影| 免费大片黄手机在线观看| 激情五月婷婷亚洲| 青春草视频在线免费观看| 国产精品秋霞免费鲁丝片| 三级国产精品片| 欧美精品人与动牲交sv欧美| 高清欧美精品videossex| 老司机影院毛片| 亚洲欧美日韩卡通动漫| 在线播放无遮挡| 国产国拍精品亚洲av在线观看| 精品人妻一区二区三区麻豆| 精品国产乱码久久久久久小说| 青春草国产在线视频| 在线看a的网站| 97热精品久久久久久| 伊人久久精品亚洲午夜| 欧美另类一区| 国产日韩欧美在线精品| www.色视频.com| 欧美高清性xxxxhd video| 欧美日韩视频精品一区| 亚洲欧美日韩另类电影网站 | 啦啦啦啦在线视频资源| 中文天堂在线官网| 日本一二三区视频观看| 色综合色国产| 久久97久久精品| 久久精品国产亚洲av涩爱| 激情 狠狠 欧美| 国产免费又黄又爽又色| 七月丁香在线播放| 国产乱人偷精品视频| 草草在线视频免费看| 成人鲁丝片一二三区免费| 亚洲av国产av综合av卡| 下体分泌物呈黄色| 在线看a的网站| 一本久久精品| 欧美三级亚洲精品| 亚洲国产最新在线播放| 国产男女超爽视频在线观看| 六月丁香七月| 免费av不卡在线播放| 好男人视频免费观看在线| 人人妻人人澡人人爽人人夜夜| av卡一久久| 三级男女做爰猛烈吃奶摸视频| 一级毛片我不卡| 国产高清不卡午夜福利| 六月丁香七月| 大陆偷拍与自拍| 插阴视频在线观看视频| 插逼视频在线观看| 插阴视频在线观看视频| 全区人妻精品视频| 日本欧美国产在线视频| 欧美xxⅹ黑人| 国内精品宾馆在线| 三级国产精品欧美在线观看| 日韩成人伦理影院| 91久久精品国产一区二区三区| 久久久精品免费免费高清| av又黄又爽大尺度在线免费看| 日韩视频在线欧美| 国产成人精品婷婷| 国产探花在线观看一区二区| 2018国产大陆天天弄谢| 久久这里有精品视频免费| 夫妻午夜视频| 熟女av电影| 在线观看美女被高潮喷水网站| 人人妻人人爽人人添夜夜欢视频 | 少妇熟女欧美另类| 国产黄频视频在线观看| 久热久热在线精品观看| 亚洲欧洲国产日韩| 九九爱精品视频在线观看| 我的女老师完整版在线观看| 精品久久久噜噜| 国国产精品蜜臀av免费| 久久亚洲国产成人精品v| 最近中文字幕高清免费大全6|