In this paper,the energy conservation in the ununiform clustered network field is proposed.The fundamental reason behind the methodology is that in the process of CH election,nodes Competition Radius(CR)task is based ...In this paper,the energy conservation in the ununiform clustered network field is proposed.The fundamental reason behind the methodology is that in the process of CH election,nodes Competition Radius(CR)task is based on not just the space between nodes and their Residual Energy(RE),which is utilized in Energy-Aware Distributed Unequal Clustering(EADUC)protocol but also a third-degree factor,i.e.,the nearby multi-hop node count.In contrast,a third-factor nearby nodes count is also used.This surrounding data is taken into account in the clustering feature to increase the network’s life span.The proposed method,known as Energy Conscious Scattered Asymmetric Clustering(ECSAC),self-controls the nodes’energy utilization for equal allotment and un-equal delivery.Besides,extra attention is agreed to energy consumption in the communication process by applying a timeslot-based backtracking algorithm for increasing the network’s lifetime.The proposed methodology reduces the clustering overhead and node communication energy consumption to extend the network’s lifetime.Our suggested method’s results are investigated against the classical techniques using the lifetime of the network,RE,alive hop count and energy consumption during transmission as the performance metric.展开更多
Wireless Sensor Networks(WSN)play a vital role in several real-time applications ranging from military to civilian.Despite the benefits of WSN,energy efficiency becomes a major part of the challenging issue in WSN,whi...Wireless Sensor Networks(WSN)play a vital role in several real-time applications ranging from military to civilian.Despite the benefits of WSN,energy efficiency becomes a major part of the challenging issue in WSN,which necessitate proper load balancing amongst the clusters and serves a wider monitoring region.The clustering technique for WSN has several benefits:lower delay,higher energy efficiency,and collision avoidance.But clustering protocol has several challenges.In a large-scale network,cluster-based protocols mainly adapt multi-hop routing to save energy,leading to hot spot problems.A hot spot problem becomes a problem where a cluster node nearer to the base station(BS)tends to drain the energy much quicker than other nodes because of the need to implement more transmission.This article introduces a Jumping Spider Optimization Based Unequal Clustering Protocol for Mitigating Hotspot Problems(JSOUCP-MHP)in WSN.The JSO algorithm is stimulated by the characteristics of spiders naturally and mathematically modelled the hunting mechanism such as search,persecution,and jumping skills to attack prey.The presented JSOUCPMHP technique mainly resolves the hot spot issue for maximizing the network lifespan.The JSOUCP-MHP technique elects a proper set of cluster heads(CHs)using average residual energy(RE)to attain this.In addition,the JSOUCP-MHP technique determines the cluster sizes based on two measures,i.e.,RE and distance to BS(DBS),showing the novelty of the work.The proposed JSOUCP-MHP technique is examined under several experiments to ensure its supremacy.The comparison study shows the significance of the JSOUCPMHP technique over other models.展开更多
Recently,energy harvesting wireless sensor networks(EHWSN)have increased significant attention among research communities.By harvesting energy from the neighboring environment,the sensors in EHWSN resolve the energy c...Recently,energy harvesting wireless sensor networks(EHWSN)have increased significant attention among research communities.By harvesting energy from the neighboring environment,the sensors in EHWSN resolve the energy constraint problem and offers lengthened network lifetime.Clustering is one of the proficient ways for accomplishing even improved lifetime in EHWSN.The clustering process intends to appropriately elect the cluster heads(CHs)and construct clusters.Though several models are available in the literature,it is still needed to accomplish energy efficiency and security in EHWSN.In this view,this study develops a novel Chaotic Rider Optimization Based Clustering Protocol for Secure Energy Harvesting Wireless Sensor Networks(CROC-SEHWSN)model.The presented CROC-SEHWSN model aims to accomplish energy efficiency by clustering the node in EHWSN.The CROC-SEHWSN model is based on the integration of chaotic concepts with traditional rider optimization(RO)algorithm.Besides,the CROC-SEHWSN model derives a fitness function(FF)involving seven distinct parameters connected to WSN.To accomplish security,trust factor and link quality metrics are considered in the FF.The design of RO algorithm for secure clustering process shows the novelty of the work.In order to demonstrate the enhanced performance of the CROC-SEHWSN approach,a wide range of simulations are carried out and the outcomes are inspected in distinct aspects.The experimental outcome demonstrated the superior performance of the CROC-SEHWSN technique on the recent approaches with maximum network lifetime of 387.40 and 393.30 s under two scenarios.展开更多
Wireless sensor network(WSN)includes a set of self-organizing and homogenous nodes employed for data collection and tracking applications.It comprises a massive set of nodes with restricted energy and processing abili...Wireless sensor network(WSN)includes a set of self-organizing and homogenous nodes employed for data collection and tracking applications.It comprises a massive set of nodes with restricted energy and processing abilities.Energy dissipation is a major concern involved in the design of WSN.Clustering and routing protocols are considered effective ways to reduce the quantity of energy dissipation using metaheuristic algorithms.In order to design an energy aware cluster-based route planning scheme,this study introduces a novel Honey Badger Based Clustering with African Vulture Optimization based Routing(HBAC-AVOR)protocol for WSN.The presented HBAC-AVOR model mainly aims to cluster the nodes in WSN effectually and organize the routes in an energy-efficient way.The presented HBAC-AVOR model follows a two stage process.At the initial stage,the HBAC technique is exploited to choose an opti-mal set of cluster heads(CHs)utilizing afitness function involving many input parameters.Next,the AVOR approach was executed for determining the optimal routes to BS and thereby lengthens the lifetime of WSN.A detailed simulation analysis was executed to highlight the increased outcomes of the HBAC-AVOR protocol.On comparing with existing techniques,the HBAC-AVOR model has outperformed existing techniques with maximum lifetime.展开更多
Recently,wireless sensor networks(WSNs)find their applicability in several real-time applications such as disaster management,military,surveillance,healthcare,etc.The utilization of WSNs in the disaster monitoring pro...Recently,wireless sensor networks(WSNs)find their applicability in several real-time applications such as disaster management,military,surveillance,healthcare,etc.The utilization of WSNs in the disaster monitoring process has gained significant attention among research communities and governments.Real-time monitoring of disaster areas using WSN is a challenging process due to the energy-limited sensor nodes.Therefore,the clustering process can be utilized to improve the energy utilization of the nodes and thereby improve the overall functioning of the network.In this aspect,this study proposes a novel Lens-Oppositional Wild Goose Optimization based Energy Aware Clustering(LOWGO-EAC)scheme for WSN-assisted real-time disaster management.The major intention of the LOWGO-EAC scheme is to perform effective data collection and transmission processes in disaster regions.To achieve this,the LOWGOEAC technique derives a novel LOWGO algorithm by the integration of the lens oppositional-based learning(LOBL)concept with the traditional WGO algorithm to improve the convergence rate.In addition,the LOWGO-EAC technique derives a fitness function involving three input parameters like residual energy(RE),distance to the base station(BS)(DBS),and node degree(ND).The proposed LOWGO-EAC technique can accomplish improved energy efficiency and lifetime of WSNs in real-time disaster management scenarios.The experimental validation of the LOWGO-EAC model is carried out and the comparative study reported the enhanced performance of the LOWGO-EAC model over the recent approaches.展开更多
Cognitive radio wireless sensor networks(CRWSN)can be defined as a promising technology for developing bandwidth-limited applications.CRWSN is widely utilized by future Internet of Things(IoT)applications.Since a prom...Cognitive radio wireless sensor networks(CRWSN)can be defined as a promising technology for developing bandwidth-limited applications.CRWSN is widely utilized by future Internet of Things(IoT)applications.Since a promising technology,Cognitive Radio(CR)can be modelled to alleviate the spectrum scarcity issue.Generally,CRWSN has cognitive radioenabled sensor nodes(SNs),which are energy limited.Hierarchical clusterrelated techniques for overall network management can be suitable for the scalability and stability of the network.This paper focuses on designing the Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering(MDMO-EAC)Scheme for CRWSN.The MDMO-EAC technique mainly intends to group the nodes into clusters in the CRWSN.Besides,theMDMOEAC algorithm is based on the dwarf mongoose optimization(DMO)algorithm design with oppositional-based learning(OBL)concept for the clustering process,showing the novelty of the work.In addition,the presented MDMO-EAC algorithm computed a multi-objective function for improved network efficiency.The presented model is validated using a comprehensive range of experiments,and the outcomes were scrutinized in varying measures.The comparison study stated the improvements of the MDMO-EAC method over other recent approaches.展开更多
This paper proposes a distributed dynamic k-medoid clustering algorithm for wireless sensor networks (WSNs), DDKCAWSN. Different from node-clustering algorithms and protocols for WSNs, the algorithm focuses on clust...This paper proposes a distributed dynamic k-medoid clustering algorithm for wireless sensor networks (WSNs), DDKCAWSN. Different from node-clustering algorithms and protocols for WSNs, the algorithm focuses on clustering data in the network. By sending the sink clustered data instead of practical ones, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. Moreover, the algorithm improves the accuracy of the clustered data dynamically by updating the clusters periodically such as each day. Simulation results demonstrate the effectiveness of our approach for different metrics.展开更多
In wireless sensor networks(WSNs) with single sink,the nodes close to the sink consume their energy too fast due to transferring a large number of data packages,resulting in the "energy hole" problem.Deployi...In wireless sensor networks(WSNs) with single sink,the nodes close to the sink consume their energy too fast due to transferring a large number of data packages,resulting in the "energy hole" problem.Deploying multiple sink nodes in WSNs is an effective strategy to solve this problem.A multi-sink deployment strategy based on improved particle swarm clustering optimization(IPSCO) algorithm for WSNs is proposed in this paper.The IPSCO algorithm is a combination of the improved particle swarm optimization(PSO) algorithm and K-means clustering algorithm.According to the sink nodes number K,the IPSCO algorithm divides the sensor nodes in the whole network area into K clusters based on the distance between them,making the total within-class scatter to minimum,and outputs the center of each cluster.Then,multiple sink nodes in the center of each cluster can be deployed,to achieve the effects of partition network reasonably and deploy multi-sink nodes optimally.The simulation results show that the deployment strategy can prolong the network lifetime.展开更多
Recently,Wireless sensor networks(WSNs)have become very popular research topics which are applied to many applications.They provide pervasive computing services and techniques in various potential applications for the...Recently,Wireless sensor networks(WSNs)have become very popular research topics which are applied to many applications.They provide pervasive computing services and techniques in various potential applications for the Internet of Things(IoT).An Asynchronous Clustering and Mobile Data Gathering based on Timer Mechanism(ACMDGTM)algorithm is proposed which would mitigate the problem of“hot spots”among sensors to enhance the lifetime of networks.The clustering process takes sensors’location and residual energy into consideration to elect suitable cluster heads.Furthermore,one mobile sink node is employed to access cluster heads in accordance with the data overflow time and moving time from cluster heads to itself.Related experimental results display that the presented method can avoid long distance communicate between sensor nodes.Furthermore,this algorithm reduces energy consumption effectively and improves package delivery rate.展开更多
How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks(HWSN).In this paper, a clustering-tree topology co...How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks(HWSN).In this paper, a clustering-tree topology control algorithm based on the energy forecast(CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round(the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function(including the energy, link quality and packet loss rate) and their distance.The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several noncluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy(LEACH), energy dissipation forecast and clustering management(EDFCM) and efficient and dynamic clustering scheme(EDCS)protocols, CTEF has longer network lifetime and receives more data packets at base station.展开更多
A common and critical operation for wireless sensor networks is data gathering. The efficient clustering of a sensor network that can save energy and improve coverage efficiency is an important requirement for many up...A common and critical operation for wireless sensor networks is data gathering. The efficient clustering of a sensor network that can save energy and improve coverage efficiency is an important requirement for many upper layer network functions. This study concentrates on how to form clusters with high uniformity while prolonging the network lifetime. A novel clustering scheme named power- and coverage- aware clustering (PCC) is proposed, which can adaptively select cluster heads according to a hybrid of the nodesI residual energy and loyalty degree. Additionally, the PCC scheme is independent of node distribution or density, and it is free of node hardware limitations, such as self-locating capability and time synchronization. Experiment results show that the scheme performs well in terms of cluster size (and its standard deviation), number of nodes alive over time, total energy consumption, etc.展开更多
In this paper, an energy efficient clustering algorithm based on neighbors (EECABN) for wireless sensor networks is proposed. In the algorithm, an optimized weight of nodes is introduced to determine the priority of...In this paper, an energy efficient clustering algorithm based on neighbors (EECABN) for wireless sensor networks is proposed. In the algorithm, an optimized weight of nodes is introduced to determine the priority of clustering procedure. As improvement, the weight is a measurement of energy and degree as usual, and even associates with distance from neighbors, distance to the sink node, and other factors. To prevent the low energy nodes being exhausted with energy, the strong nodes should have more opportunities to act as cluster heads during the clustering procedure. The simulation results show that the algorithm can effectively prolong whole the network lifetime. Especially at the early stage that some nodes in the network begin to die, the process can be postponed by using the algorithm.展开更多
Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. Th...Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. The protocol improves the way of the nodes distribution at random. The terminal nodes which have not been a two-level cluster head in the cluster can compete with the principle of equivalent possibility, and on the basis of the rest energy of nodes the two-level cluster head is selected at last. The single hop within the cluster and single hop or multiple hops between clusters are used. Simulation experiment results show that the performance of the two-level linear clustering protocol applied to the Hexi corridor agricultural field is superior to that of the LEACH protocol in the survival time of network nodes, the ratio of success, and the remaining energy of network nodes.展开更多
In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to a...In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes' transmission power in two-tiered hi- erarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated in- formation to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs' transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs' transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node's degree, average node's power radius and network lifetime, respectively.展开更多
In wireless sensor networks, data missing is a common problem due to sensor faults, time synchronization, malicious attacks, and communication malfunctions, which may degrade the network' s performance or lead to ine...In wireless sensor networks, data missing is a common problem due to sensor faults, time synchronization, malicious attacks, and communication malfunctions, which may degrade the network' s performance or lead to inefficient decisions. Therefore, it is necessary to effectively estimate the missing data. A double weighted least squares support vector machines (DWLS-SVM) model for the missing data estimation in wireless sensor networks is proposed in this paper. The algo- rithm first applies the weighted LS-SVM (WLS-SVM) to estimate the missing data on temporal do- main and spatial domain respectively, and then uses the weighted average of these two candidates as the final estimated value. DWLS-SVM considers the possibility of outliers in the dataset and utilizes spatio-temporal dependencies among sensor nodes fully, which makes the estimate more robust and precise. Experimental results on real world dataset demonstrate that the proposed algorithm is outli- er robust and can estimate the missing values accurately.展开更多
Random distribution of sensor nodes in large scale network leads redundant nodes in the application field. Sensor nodes are with irreplaceable battery in nature, which drains the energy due to repeated collection...Random distribution of sensor nodes in large scale network leads redundant nodes in the application field. Sensor nodes are with irreplaceable battery in nature, which drains the energy due to repeated collection of data and decreases network lifetime. Scheduling algorithms are the one way of addressing this issue. In proposed method, an optimized sleep scheduling used to enhance the network lifetime. While using the scheduling algorithm, the target coverage and data collection must be maintained throughout the network. In-network, aggregation method also used to remove the unwanted information in the collected data in level. Modified clustering algorithm highlights three cluster heads in each cluster which are separated by minimum distance between them. The simulation results show the 20% improvement in network lifetime, 25% improvement in throughput and 30% improvement in end to end delay.展开更多
Event region detection is the important application for wireless sensor networks(WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment n...Event region detection is the important application for wireless sensor networks(WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance(DFWD) is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.展开更多
Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is base...Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is based on wireless sensor networks(WSNs). In this paper, we propose a coverage-aware unequal clustering protocol with load separation(CUCPLS) for data gathering of AAL applications based on WSNs. Firstly, the coverage overlap factor for nodes is introduced that accounts for the degree of target nodes covered. In addition, to balance the intra-cluster and inter-cluster energy consumptions, different competition radiuses of CHs are computed theoretically in different rings, and smaller clusters are formed near the sink. Moreover, two CHs are selected in each cluster for load separation to alleviate the substantial energy consumption difference between a single CH and its member nodes. Furthermore, a backoff waiting time is adopted during the selection of the two CHs to reduce the number of control messages employed. Simulation results demonstrate that the CUCPLS not only can achieve better coverage performance, but also balance the energy consumption of a network and prolong network lifetime.展开更多
Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requireme...Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.展开更多
This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and accor...This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and according to recent studies, cluster formation is an appropriate solution for their achievement. To transmit aggregated data to the Base Station (BS), logical nodes called Cluster Heads (CHs) are required to relay data from the fixed-range sensing nodes located in the ground to high altitude aircraft. This study investigates the Genetic Algorithm (GA) as a dynamic technique to find optimum states. It is a simple framework that includes a proposed mathematical formula, which increasing in coverage is benchmarked against lifetime. Finally, the implementation of the proposed algorithm indicates a better efficiency compared to other simulated works.展开更多
文摘In this paper,the energy conservation in the ununiform clustered network field is proposed.The fundamental reason behind the methodology is that in the process of CH election,nodes Competition Radius(CR)task is based on not just the space between nodes and their Residual Energy(RE),which is utilized in Energy-Aware Distributed Unequal Clustering(EADUC)protocol but also a third-degree factor,i.e.,the nearby multi-hop node count.In contrast,a third-factor nearby nodes count is also used.This surrounding data is taken into account in the clustering feature to increase the network’s life span.The proposed method,known as Energy Conscious Scattered Asymmetric Clustering(ECSAC),self-controls the nodes’energy utilization for equal allotment and un-equal delivery.Besides,extra attention is agreed to energy consumption in the communication process by applying a timeslot-based backtracking algorithm for increasing the network’s lifetime.The proposed methodology reduces the clustering overhead and node communication energy consumption to extend the network’s lifetime.Our suggested method’s results are investigated against the classical techniques using the lifetime of the network,RE,alive hop count and energy consumption during transmission as the performance metric.
基金This research was supported by the MSIT(Ministry of Science and ICT)Korea,under the ICAN(ICT Challenge and Advanced Network of HRD)program(IITP-2022-2020-0-01832)supervised by the IITP(Institute of Information&Communications Technology Planning&Evaluation)and the Korea Technology and Information Promotion Agency(TIPA)for SMEs grant funded by the Korea government(Ministry of SMEs and Startups)(No.S3271954)and the Soonchunhyang University Research Fund。
文摘Wireless Sensor Networks(WSN)play a vital role in several real-time applications ranging from military to civilian.Despite the benefits of WSN,energy efficiency becomes a major part of the challenging issue in WSN,which necessitate proper load balancing amongst the clusters and serves a wider monitoring region.The clustering technique for WSN has several benefits:lower delay,higher energy efficiency,and collision avoidance.But clustering protocol has several challenges.In a large-scale network,cluster-based protocols mainly adapt multi-hop routing to save energy,leading to hot spot problems.A hot spot problem becomes a problem where a cluster node nearer to the base station(BS)tends to drain the energy much quicker than other nodes because of the need to implement more transmission.This article introduces a Jumping Spider Optimization Based Unequal Clustering Protocol for Mitigating Hotspot Problems(JSOUCP-MHP)in WSN.The JSO algorithm is stimulated by the characteristics of spiders naturally and mathematically modelled the hunting mechanism such as search,persecution,and jumping skills to attack prey.The presented JSOUCPMHP technique mainly resolves the hot spot issue for maximizing the network lifespan.The JSOUCP-MHP technique elects a proper set of cluster heads(CHs)using average residual energy(RE)to attain this.In addition,the JSOUCP-MHP technique determines the cluster sizes based on two measures,i.e.,RE and distance to BS(DBS),showing the novelty of the work.The proposed JSOUCP-MHP technique is examined under several experiments to ensure its supremacy.The comparison study shows the significance of the JSOUCPMHP technique over other models.
基金This research was supported by the Deanship of Scientific Research Project(RGP.2/162/43)King Khalid University,Kingdom of Saudi Arabia.
文摘Recently,energy harvesting wireless sensor networks(EHWSN)have increased significant attention among research communities.By harvesting energy from the neighboring environment,the sensors in EHWSN resolve the energy constraint problem and offers lengthened network lifetime.Clustering is one of the proficient ways for accomplishing even improved lifetime in EHWSN.The clustering process intends to appropriately elect the cluster heads(CHs)and construct clusters.Though several models are available in the literature,it is still needed to accomplish energy efficiency and security in EHWSN.In this view,this study develops a novel Chaotic Rider Optimization Based Clustering Protocol for Secure Energy Harvesting Wireless Sensor Networks(CROC-SEHWSN)model.The presented CROC-SEHWSN model aims to accomplish energy efficiency by clustering the node in EHWSN.The CROC-SEHWSN model is based on the integration of chaotic concepts with traditional rider optimization(RO)algorithm.Besides,the CROC-SEHWSN model derives a fitness function(FF)involving seven distinct parameters connected to WSN.To accomplish security,trust factor and link quality metrics are considered in the FF.The design of RO algorithm for secure clustering process shows the novelty of the work.In order to demonstrate the enhanced performance of the CROC-SEHWSN approach,a wide range of simulations are carried out and the outcomes are inspected in distinct aspects.The experimental outcome demonstrated the superior performance of the CROC-SEHWSN technique on the recent approaches with maximum network lifetime of 387.40 and 393.30 s under two scenarios.
文摘Wireless sensor network(WSN)includes a set of self-organizing and homogenous nodes employed for data collection and tracking applications.It comprises a massive set of nodes with restricted energy and processing abilities.Energy dissipation is a major concern involved in the design of WSN.Clustering and routing protocols are considered effective ways to reduce the quantity of energy dissipation using metaheuristic algorithms.In order to design an energy aware cluster-based route planning scheme,this study introduces a novel Honey Badger Based Clustering with African Vulture Optimization based Routing(HBAC-AVOR)protocol for WSN.The presented HBAC-AVOR model mainly aims to cluster the nodes in WSN effectually and organize the routes in an energy-efficient way.The presented HBAC-AVOR model follows a two stage process.At the initial stage,the HBAC technique is exploited to choose an opti-mal set of cluster heads(CHs)utilizing afitness function involving many input parameters.Next,the AVOR approach was executed for determining the optimal routes to BS and thereby lengthens the lifetime of WSN.A detailed simulation analysis was executed to highlight the increased outcomes of the HBAC-AVOR protocol.On comparing with existing techniques,the HBAC-AVOR model has outperformed existing techniques with maximum lifetime.
基金This research is funded by the Deanship of Scientific Research at Umm Al-Qura University,Grant Code:22UQU4281755DSR01。
文摘Recently,wireless sensor networks(WSNs)find their applicability in several real-time applications such as disaster management,military,surveillance,healthcare,etc.The utilization of WSNs in the disaster monitoring process has gained significant attention among research communities and governments.Real-time monitoring of disaster areas using WSN is a challenging process due to the energy-limited sensor nodes.Therefore,the clustering process can be utilized to improve the energy utilization of the nodes and thereby improve the overall functioning of the network.In this aspect,this study proposes a novel Lens-Oppositional Wild Goose Optimization based Energy Aware Clustering(LOWGO-EAC)scheme for WSN-assisted real-time disaster management.The major intention of the LOWGO-EAC scheme is to perform effective data collection and transmission processes in disaster regions.To achieve this,the LOWGOEAC technique derives a novel LOWGO algorithm by the integration of the lens oppositional-based learning(LOBL)concept with the traditional WGO algorithm to improve the convergence rate.In addition,the LOWGO-EAC technique derives a fitness function involving three input parameters like residual energy(RE),distance to the base station(BS)(DBS),and node degree(ND).The proposed LOWGO-EAC technique can accomplish improved energy efficiency and lifetime of WSNs in real-time disaster management scenarios.The experimental validation of the LOWGO-EAC model is carried out and the comparative study reported the enhanced performance of the LOWGO-EAC model over the recent approaches.
基金This research work was funded by Institutional Fund Projects under grant no.(IFPIP:14-611-1443)Therefore,the authors gratefully acknowledge technical and financial support provided by the Ministry of Education and Deanship of Scientific Research(DSR),King Abdulaziz University(KAU),Jeddah,Saudi Arabia.
文摘Cognitive radio wireless sensor networks(CRWSN)can be defined as a promising technology for developing bandwidth-limited applications.CRWSN is widely utilized by future Internet of Things(IoT)applications.Since a promising technology,Cognitive Radio(CR)can be modelled to alleviate the spectrum scarcity issue.Generally,CRWSN has cognitive radioenabled sensor nodes(SNs),which are energy limited.Hierarchical clusterrelated techniques for overall network management can be suitable for the scalability and stability of the network.This paper focuses on designing the Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering(MDMO-EAC)Scheme for CRWSN.The MDMO-EAC technique mainly intends to group the nodes into clusters in the CRWSN.Besides,theMDMOEAC algorithm is based on the dwarf mongoose optimization(DMO)algorithm design with oppositional-based learning(OBL)concept for the clustering process,showing the novelty of the work.In addition,the presented MDMO-EAC algorithm computed a multi-objective function for improved network efficiency.The presented model is validated using a comprehensive range of experiments,and the outcomes were scrutinized in varying measures.The comparison study stated the improvements of the MDMO-EAC method over other recent approaches.
基金the National Natural Science Foundation of China (60472047)
文摘This paper proposes a distributed dynamic k-medoid clustering algorithm for wireless sensor networks (WSNs), DDKCAWSN. Different from node-clustering algorithms and protocols for WSNs, the algorithm focuses on clustering data in the network. By sending the sink clustered data instead of practical ones, the algorithm can greatly reduce the size and the time of data communication, and further save the energy of the nodes in the network and prolong the system lifetime. Moreover, the algorithm improves the accuracy of the clustered data dynamically by updating the clusters periodically such as each day. Simulation results demonstrate the effectiveness of our approach for different metrics.
基金the Key Project of the National Natural Science Foundation of China(No.61134009)National Natural Science Foundations of China(Nos.61473077,61473078)+4 种基金Program for Changjiang Scholars from the Ministry of Education,ChinaSpecialized Research Fund for Shanghai Leading Talents,ChinaProject of the Shanghai Committee of Science and Technology,China(No.13JC1407500)Innovation Program of Shanghai Municipal Education Commission,China(No.14ZZ067)the Fundamental Research Funds for the Central Universities,China(No.15D110423)
文摘In wireless sensor networks(WSNs) with single sink,the nodes close to the sink consume their energy too fast due to transferring a large number of data packages,resulting in the "energy hole" problem.Deploying multiple sink nodes in WSNs is an effective strategy to solve this problem.A multi-sink deployment strategy based on improved particle swarm clustering optimization(IPSCO) algorithm for WSNs is proposed in this paper.The IPSCO algorithm is a combination of the improved particle swarm optimization(PSO) algorithm and K-means clustering algorithm.According to the sink nodes number K,the IPSCO algorithm divides the sensor nodes in the whole network area into K clusters based on the distance between them,making the total within-class scatter to minimum,and outputs the center of each cluster.Then,multiple sink nodes in the center of each cluster can be deployed,to achieve the effects of partition network reasonably and deploy multi-sink nodes optimally.The simulation results show that the deployment strategy can prolong the network lifetime.
基金This work is supported by the National Natural Science Foundation of China(61772454,61811530332,61811540410,U1836208).
文摘Recently,Wireless sensor networks(WSNs)have become very popular research topics which are applied to many applications.They provide pervasive computing services and techniques in various potential applications for the Internet of Things(IoT).An Asynchronous Clustering and Mobile Data Gathering based on Timer Mechanism(ACMDGTM)algorithm is proposed which would mitigate the problem of“hot spots”among sensors to enhance the lifetime of networks.The clustering process takes sensors’location and residual energy into consideration to elect suitable cluster heads.Furthermore,one mobile sink node is employed to access cluster heads in accordance with the data overflow time and moving time from cluster heads to itself.Related experimental results display that the presented method can avoid long distance communicate between sensor nodes.Furthermore,this algorithm reduces energy consumption effectively and improves package delivery rate.
基金supported by National Natural Science Foundation of China(61304256)Zhejiang Provincial Natural Science Foundation of China(LQ13F030013)+4 种基金Project of the Education Department of Zhejiang Province(Y201327006)Young Researchers Foundation of Zhejiang Provincial Top Key Academic Discipline of Mechanical Engineering and Zhejiang Sci-Tech University Key Laboratory(ZSTUME01B15)New Century 151 Talent Project of Zhejiang Province521 Talent Project of Zhejiang Sci-Tech UniversityYoung and Middle-aged Talents Foundation of Zhejiang Provincial Top Key Academic Discipline of Mechanical Engineering
文摘How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks(HWSN).In this paper, a clustering-tree topology control algorithm based on the energy forecast(CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round(the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function(including the energy, link quality and packet loss rate) and their distance.The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several noncluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy(LEACH), energy dissipation forecast and clustering management(EDFCM) and efficient and dynamic clustering scheme(EDCS)protocols, CTEF has longer network lifetime and receives more data packets at base station.
基金supported by National Basic Research Program of China (No. 2010CB731800)National Natural Science Foundation of China (No. 60934003)Educational Foundation of Hebei Province (No. 2008147)
文摘A common and critical operation for wireless sensor networks is data gathering. The efficient clustering of a sensor network that can save energy and improve coverage efficiency is an important requirement for many upper layer network functions. This study concentrates on how to form clusters with high uniformity while prolonging the network lifetime. A novel clustering scheme named power- and coverage- aware clustering (PCC) is proposed, which can adaptively select cluster heads according to a hybrid of the nodesI residual energy and loyalty degree. Additionally, the PCC scheme is independent of node distribution or density, and it is free of node hardware limitations, such as self-locating capability and time synchronization. Experiment results show that the scheme performs well in terms of cluster size (and its standard deviation), number of nodes alive over time, total energy consumption, etc.
基金Project supported by the Shanghai Leading Academic Discipline Project (Grant No.S30108)
文摘In this paper, an energy efficient clustering algorithm based on neighbors (EECABN) for wireless sensor networks is proposed. In the algorithm, an optimized weight of nodes is introduced to determine the priority of clustering procedure. As improvement, the weight is a measurement of energy and degree as usual, and even associates with distance from neighbors, distance to the sink node, and other factors. To prevent the low energy nodes being exhausted with energy, the strong nodes should have more opportunities to act as cluster heads during the clustering procedure. The simulation results show that the algorithm can effectively prolong whole the network lifetime. Especially at the early stage that some nodes in the network begin to die, the process can be postponed by using the algorithm.
基金supported by the Foundation Projects in Gansu Province Department of Education under Grant No.2015A-163
文摘Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. The protocol improves the way of the nodes distribution at random. The terminal nodes which have not been a two-level cluster head in the cluster can compete with the principle of equivalent possibility, and on the basis of the rest energy of nodes the two-level cluster head is selected at last. The single hop within the cluster and single hop or multiple hops between clusters are used. Simulation experiment results show that the performance of the two-level linear clustering protocol applied to the Hexi corridor agricultural field is superior to that of the LEACH protocol in the survival time of network nodes, the ratio of success, and the remaining energy of network nodes.
文摘In this paper, we propose a novel clustering topology control algorithm named Minimum Spanning Tree (MST)-based Clustering Topology Control (MCTC) for Wireless Sensor Networks (WSNs), which uses a hybrid approach to adjust sensor nodes' transmission power in two-tiered hi- erarchical WSNs. MCTC algorithm employs a one-hop Maximum Energy & Minimum Distance (MEMD) clustering algorithm to decide clustering status. Each cluster exchanges information between its own Cluster Members (CMs) locally and then deliveries information to the Cluster Head (CH). Moreover, CHs exchange information between CH and CH and afterwards transmits aggregated in- formation to the base station finally. The intra-cluster topology control scheme uses MST to decide CMs' transmission radius, similarly, the inter-cluster topology control scheme applies MST to decide CHs' transmission radius. Since the intra-cluster topology control is a full distributed approach and the inter-cluster topology control is a pure centralized approach performed by the base station, therefore, MCTC algorithm belongs to one kind of hybrid clustering topology control algorithms and can obtain scalability topology and strong connectivity guarantees simultaneously. As a result, the network topology will be reduced by MCTC algorithm so that network energy efficiency will be improved. The simulation results verify that MCTC outperforms traditional topology control schemes such as LMST, DRNG and MEMD at the aspects of average node's degree, average node's power radius and network lifetime, respectively.
基金Supported by Basic Research Foundation of Beijing Institute of Technology (20070542009)
文摘In wireless sensor networks, data missing is a common problem due to sensor faults, time synchronization, malicious attacks, and communication malfunctions, which may degrade the network' s performance or lead to inefficient decisions. Therefore, it is necessary to effectively estimate the missing data. A double weighted least squares support vector machines (DWLS-SVM) model for the missing data estimation in wireless sensor networks is proposed in this paper. The algo- rithm first applies the weighted LS-SVM (WLS-SVM) to estimate the missing data on temporal do- main and spatial domain respectively, and then uses the weighted average of these two candidates as the final estimated value. DWLS-SVM considers the possibility of outliers in the dataset and utilizes spatio-temporal dependencies among sensor nodes fully, which makes the estimate more robust and precise. Experimental results on real world dataset demonstrate that the proposed algorithm is outli- er robust and can estimate the missing values accurately.
文摘Random distribution of sensor nodes in large scale network leads redundant nodes in the application field. Sensor nodes are with irreplaceable battery in nature, which drains the energy due to repeated collection of data and decreases network lifetime. Scheduling algorithms are the one way of addressing this issue. In proposed method, an optimized sleep scheduling used to enhance the network lifetime. While using the scheduling algorithm, the target coverage and data collection must be maintained throughout the network. In-network, aggregation method also used to remove the unwanted information in the collected data in level. Modified clustering algorithm highlights three cluster heads in each cluster which are separated by minimum distance between them. The simulation results show the 20% improvement in network lifetime, 25% improvement in throughput and 30% improvement in end to end delay.
基金supported by the National Science Foundation for Outstanding Young Scientists (60425310)the Science Foundation for Post-doctoral Scientists of Central South University (2008)
文摘Event region detection is the important application for wireless sensor networks(WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance(DFWD) is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.
基金supported by the National Nature Science Foundation of China (61170169, 61170168)
文摘Ambient Assisted Living(AAL) is becoming an important research field. Many technologies have emerged related with pervasive computing vision, which can give support for AAL. One of the most reliable approaches is based on wireless sensor networks(WSNs). In this paper, we propose a coverage-aware unequal clustering protocol with load separation(CUCPLS) for data gathering of AAL applications based on WSNs. Firstly, the coverage overlap factor for nodes is introduced that accounts for the degree of target nodes covered. In addition, to balance the intra-cluster and inter-cluster energy consumptions, different competition radiuses of CHs are computed theoretically in different rings, and smaller clusters are formed near the sink. Moreover, two CHs are selected in each cluster for load separation to alleviate the substantial energy consumption difference between a single CH and its member nodes. Furthermore, a backoff waiting time is adopted during the selection of the two CHs to reduce the number of control messages employed. Simulation results demonstrate that the CUCPLS not only can achieve better coverage performance, but also balance the energy consumption of a network and prolong network lifetime.
文摘Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.
文摘This paper examines the optimization of the lifetime and energy consumption of Wireless Sensor Networks (WSNs). These two competing objectives have a deep influence over the service qualification of networks and according to recent studies, cluster formation is an appropriate solution for their achievement. To transmit aggregated data to the Base Station (BS), logical nodes called Cluster Heads (CHs) are required to relay data from the fixed-range sensing nodes located in the ground to high altitude aircraft. This study investigates the Genetic Algorithm (GA) as a dynamic technique to find optimum states. It is a simple framework that includes a proposed mathematical formula, which increasing in coverage is benchmarked against lifetime. Finally, the implementation of the proposed algorithm indicates a better efficiency compared to other simulated works.