With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower latency.However,a large amount of data generated...With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower latency.However,a large amount of data generated from monitoring and long-distance transmission places a heavy burden on sensor nodes with the limited battery power.For this,we investigate an unmanned aerial vehicles assisted mobile wireless sensor network(UAV-assisted WSN)to prolong the network lifetime in this paper.Specifically,we use UAVs to assist the WSN in collecting data.In the current UAV-assisted WSN,the clustering and routing schemes are determined sequentially.However,such a separate consideration might not maximize the lifetime of the whole WSN due to the mutual coupling of clustering and routing.To efficiently prolong the lifetime of the WSN,we propose an integrated clustering and routing scheme that jointly optimizes the clustering and routing together.In the whole network space,it is intractable to efficiently obtain the optimal integrated clustering and routing scheme.Therefore,we propose the Monte-Las search strategy based on Monte Carlo and Las Vegas ideas,which can generate the chain matrix to guide the algorithm to find the solution faster.Unnecessary point-to-point collection leads to long collection paths,so a triangle optimization strategy is then proposed that finds a compromise path to shorten the collection path based on the geometric distribution and energy of sensor nodes.To avoid the coverage hole caused by the death of sensor nodes,the deployment of mobile sensor nodes and the preventive mechanism design are indispensable.An emergency data transmission mechanism is further proposed to reduce the latency of collecting the latency-sensitive data due to the absence of UAVs.Compared with the existing schemes,the proposed scheme can prolong the lifetime of the UAVassisted WSN at least by 360%,and shorten the collection path of UAVs by 56.24%.展开更多
Large-scale wireless sensor networks(WSNs)play a critical role in monitoring dangerous scenarios and responding to medical emergencies.However,the inherent instability and error-prone nature of wireless links present ...Large-scale wireless sensor networks(WSNs)play a critical role in monitoring dangerous scenarios and responding to medical emergencies.However,the inherent instability and error-prone nature of wireless links present significant challenges,necessitating efficient data collection and reliable transmission services.This paper addresses the limitations of existing data transmission and recovery protocols by proposing a systematic end-to-end design tailored for medical event-driven cluster-based large-scale WSNs.The primary goal is to enhance the reliability of data collection and transmission services,ensuring a comprehensive and practical approach.Our approach focuses on refining the hop-count-based routing scheme to achieve fairness in forwarding reliability.Additionally,it emphasizes reliable data collection within clusters and establishes robust data transmission over multiple hops.These systematic improvements are designed to optimize the overall performance of the WSN in real-world scenarios.Simulation results of the proposed protocol validate its exceptional performance compared to other prominent data transmission schemes.The evaluation spans varying sensor densities,wireless channel conditions,and packet transmission rates,showcasing the protocol’s superiority in ensuring reliable and efficient data transfer.Our systematic end-to-end design successfully addresses the challenges posed by the instability of wireless links in large-scaleWSNs.By prioritizing fairness,reliability,and efficiency,the proposed protocol demonstrates its efficacy in enhancing data collection and transmission services,thereby offering a valuable contribution to the field of medical event-drivenWSNs.展开更多
Wireless Sensor Network(WSN)consists of a group of limited energy source sensors that are installed in a particular region to collect data from the environment.Designing the energy-efficient data collection methods in...Wireless Sensor Network(WSN)consists of a group of limited energy source sensors that are installed in a particular region to collect data from the environment.Designing the energy-efficient data collection methods in largescale wireless sensor networks is considered to be a difficult area in the research.Sensor node clustering is a popular approach for WSN.Moreover,the sensor nodes are grouped to form clusters in a cluster-based WSN environment.The battery performance of the sensor nodes is likewise constrained.As a result,the energy efficiency of WSNs is critical.In specific,the energy usage is influenced by the loads on the sensor node as well as it ranges from the Base Station(BS).Therefore,energy efficiency and load balancing are very essential in WSN.In the proposed method,a novel Grey Wolf Improved Particle Swarm Optimization with Tabu Search Techniques(GW-IPSO-TS)was used.The selection of Cluster Heads(CHs)and routing path of every CH from the base station is enhanced by the proposed method.It provides the best routing path and increases the lifetime and energy efficiency of the network.End-to-end delay and packet loss rate have also been improved.The proposed GW-IPSO-TS method enhances the evaluation of alive nodes,dead nodes,network survival index,convergence rate,and standard deviation of sensor nodes.Compared to the existing algorithms,the proposed method outperforms better and improves the lifetime of the network.展开更多
Wireless sensor networks(WSNs)encompass a massive set of sensor nodes,which are self-configurable,inexpensive,and compact.The sensor nodes undergo random deployment in the target area and transmit data to base station ...Wireless sensor networks(WSNs)encompass a massive set of sensor nodes,which are self-configurable,inexpensive,and compact.The sensor nodes undergo random deployment in the target area and transmit data to base station using inbuilt transceiver.For reducing energy consumption and lengthen lifetime of WSN,multihop routing protocols can be designed.This study develops an improved rat swarm optimization based energy aware multi-hop routing(IRSO-EAMHR)protocol for WSN.An important intention of the IRSO-EAMHR method is for determining optimal routes to base station(BS)in the clustered WSN.Primarily,a weighted clustering process is performed to group the nodes into clusters and select cluster heads(CHs).Next,the IRSO-EAMHR approach derives afitness function containing three input parameters(residual energy,dis-tance,and node degree)for routing process.The IRSO technique was designed by the integration of Levy movement concepts into the traditional RSO algorithm.The experimental result analysis of the IRSO-EAMHR technique is carried out and the outcomes are examined in various aspects.The simulation outcomes demonstrate the promising performance of the IRSO-EAMHR technique over the recent state of art approaches.展开更多
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.展开更多
In recent scenario of Wireless Sensor Networks(WSNs),there are many application developed for handling sensitive and private data such as military information,surveillance data,tracking,etc.Hence,the sensor nodes of W...In recent scenario of Wireless Sensor Networks(WSNs),there are many application developed for handling sensitive and private data such as military information,surveillance data,tracking,etc.Hence,the sensor nodes of WSNs are distributed in an intimidating region,which is non-rigid to attacks.The recent research domains of WSN deal with models to handle the WSN communications against malicious attacks and threats.In traditional models,the solution has been made for defending the networks,only to specific attacks.However,in real-time applications,the kind of attack that is launched by the adversary is not known.Additionally,on developing a security mechanism for WSN,the resource constraints of sensor nodes are also to be considered.With that note,this paper presents an Enhanced Security Model with Improved Defensive Routing Mechanism(IDRM)for defending the sensor network from various attacks.Moreover,for efficient model design,the work includes the part of feature evaluation of some general attacks of WSNs.The IDRM also includes determination of optimal secure paths and Node security for secure routing operations.The performance of the proposed model is evaluated with respect to several factors;it is found that the model has achieved better security levels and is efficient than other existing models in WSN communications.It is proven that the proposed IDRM produces 74%of PDR in average and a minimized packet drop of 38%when comparing with the existing works.展开更多
Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vi...Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vital element of IoT paradigm since its inception and has developed into one of the chosen platforms for deploying many smart city application regions such as disaster management,intelligent transportation,home automation,smart buildings,and other such IoT-based application.The routing approaches were extremely-utilized energy efficient approaches with an initial drive that is,for balancing the energy amongst sensor nodes.The clustering and routing procedures assumed that Non-Polynomial(NP)hard problems but bio-simulated approaches are utilized to a recognized time for resolving such problems.With this motivation,this paper presents a new blockchain with Enhanced Hunger Games Search based Route Planning(BCEHGS-RP)scheme for IoT assisted WSN.The presented BCEHGS-RP model majorly employs BC technology for secure communication in the IoT supportedWSN environment.In addition,an effective multihop route planning approach was designed by the use of EHGS technique.The proposed EHGS technique is derived from the concept of Hill Climbing strategy(HCS)and HGS algorithm.Moreover,a fitness function with two parameters namely residual energy(RE)and intercluster distance to elect optimal routes.The performance validation of the BCEHGS-RP model is experimented with under diverse number of nodes.Extensive experimental outcomes highlighted the better performance of the BCEHGS-RP technique on recent approaches.展开更多
Energy conservation has become a significant consideration in wireless sensor networks(WSN).In the sensor network,the sensor nodes have internal batteries,and as a result,they expire after a certain period.As a result,...Energy conservation has become a significant consideration in wireless sensor networks(WSN).In the sensor network,the sensor nodes have internal batteries,and as a result,they expire after a certain period.As a result,expanding the life duration of sensing devices by improving data depletion in an effective and sustainable energy-efficient way remains a challenge.Also,the clustering strategy employs to enhance or extend the life cycle of WSNs.We identify the supervisory head node(SH)or cluster head(CH)in every grouping considered the feasible strategy for power-saving route discovery in the clustering model,which diminishes the communication overhead in the WSN.However,the critical issue was determining the best SH for ensuring timely communication services.Our secure and energy concise route revamp technology(SECRET)protocol involves selecting an energy-concise cluster head(ECH)and route revamping to optimize navigation.The sensors transmit information over the ECH,which delivers the information to the base station via the determined optimal path using our strategy for effective data transmission.We modeled our methods to accom-plish power-efficient multi-hop routing.Furthermore,protected navigation helps to preserve energy when routing.The suggested solution improves energy savings,packet delivery ratio(PDR),route latency(RL),network lifetime(NL),and scalability.展开更多
Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in t...Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in the routing function.This article introduces Enhanced Metaheuristics with Trust Aware Secure Route Selection Protocol(EMTA-SRSP)for WSN.The presented EMTA-SRSP technique majorly involves the optimal selection of routes in WSN.To accomplish this,the EMTA-SRSP technique involves the design of an oppositional Aquila optimization algorithm to choose safe routes for data communication.For the clustering process,the nodes with maximum residual energy will be considered cluster heads(CHs).In addition,the OAOA technique gets executed to choose optimal routes based on objective functions with multiple parameters such as energy,distance,and trust degree.The experimental validation of the EMTA-SRSP technique is tested,and the results exhibited a better performance of the EMTA-SRSP technique over other approaches.展开更多
The Wireless Sensor Network(WSN)is a network of Sensor Nodes(SN)which adopt radio signals for communication amongst themselves.There is an increase in the prominence of WSN adaptability to emerging applications like t...The Wireless Sensor Network(WSN)is a network of Sensor Nodes(SN)which adopt radio signals for communication amongst themselves.There is an increase in the prominence of WSN adaptability to emerging applications like the Internet of Things(IoT)and Cyber-Physical Systems(CPS).Data secur-ity,detection of faults,management of energy,collection and distribution of data,network protocol,network coverage,mobility of nodes,and network heterogene-ity are some of the issues confronted by WSNs.There is not much published information on issues related to node mobility and management of energy at the time of aggregation of data.Towards the goal of boosting the mobility-based WSNs’network performance and energy,data aggregation protocols such as the presently-used Mobility Low-Energy Adaptive Clustering Hierarchy(LEACH-M)and Energy Efficient Heterogeneous Clustered(EEHC)scheme have been exam-ined in this work.A novel Artificial Bee Colony(ABC)algorithm is proposed in this work for effective election of CHs and multipath routing in WSNs so as to enable effective data transfer to the Base Station(BS)with least energy utilization.There is avoidance of the local optima problem at the time of solution space search in this proposed technique.Experimentations have been conducted on a large WSN network that has issues with mobility of nodes.展开更多
Energy efficient routing is one of the major thrust areas in Wireless Sensor Communication Networks (WSCNs) and it attracts most of the researchers by its valuable applications and various challenges. Wireless sensor ...Energy efficient routing is one of the major thrust areas in Wireless Sensor Communication Networks (WSCNs) and it attracts most of the researchers by its valuable applications and various challenges. Wireless sensor networks contain several nodes in its terrain region. Reducing the energy consumption over the WSCN has its significance since the nodes are battery powered. Various research methodologies were proposed by researchers in this area. One of the bio-inspired computing paradigms named Cuckoo search algorithm is used in this research work for finding the energy efficient path and routing is performed. Several performance metrics are taken into account for determining the performance of the proposed routing protocol such as throughput, packet delivery ratio, energy consumption and delay. Simulation is performed using NS2 and the results shows that the proposed routing protocol is better in terms of average throughput, and average energy consumption.展开更多
Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource...Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.展开更多
Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called ...Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called DCRCL (Dynamic Clustering Routing Considering Load). This algorithm is comprised of three phases including cluster head (CH) selection, cluster setup and inter-cluster routing. First, the CHs are selected based on residual energy and node load. Then the non-CH nodes choose a cluster by comparing the cost function of its neighbor CHs. At last, each CH communicates with base station by using multi-hop communication. The simulation results show that comparing with the existing one, the techniques life cycle and date volume of the network are increased by 30.7 percent and 29.8 percent respectively by using the proposed algorithm DCRCL.展开更多
One of the most important issues of wireless sensor networks is how to transfer information from the network nodes to a base station and choose the best possible path for this purpose. Choosing the best path can be ba...One of the most important issues of wireless sensor networks is how to transfer information from the network nodes to a base station and choose the best possible path for this purpose. Choosing the best path can be based on different factors such as energy consumption, response time, delay, and data transfer accuracy. Increasing the network lifetime is the most challenging problem. One of the latest energy-aware routing methods is to use the harmony search algorithm in the small-scale sensor networks. The aim of this study is to introduce the harmony search algorithm as a successful metaheuristic algorithm for wireless sensor network routing in order to increase the lifetime of such networks. This study is intended to improve the objective function for energy efficiency in the harmony search algorithm to establish balance between the network energy consumption and path length control. Therefore, it is necessary to choose the initial energy of each node randomly from a certain range as the path energy consumption should be low to choose a path which can consider the residual energy. In other words, a path should be chosen to establish balance between the network energy consumption and the minimum residual energy. The simulation results indicate that the proposed objective function provides a longer lifetime by 26.12% compared with EEHSBR.展开更多
To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomple...To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.展开更多
With the increasing deployment of wireless sensordevices and networks,security becomes a criticalchallenge for sensor networks.In this paper,a schemeusing data mining is proposed for routing anomalydetection in wirele...With the increasing deployment of wireless sensordevices and networks,security becomes a criticalchallenge for sensor networks.In this paper,a schemeusing data mining is proposed for routing anomalydetection in wireless sensor networks.The schemeuses the Apriori algorithm to extract traffic patternsfrom both routing table and network traffic packetsand subsequently the K-means cluster algorithmadaptively generates a detection model.Through thecombination of these two algorithms,routing attackscan be detected effectively and automatically.Themain advantage of the proposed approach is that it isable to detect new attacks that have not previouslybeen seen.Moreover,the proposed detection schemeis based on no priori knowledge and then can beapplied to a wide range of different sensor networksfor a variety of routing attacks.展开更多
Wireless Sensor Network(WSN)comprises a massive number of arbitrarily placed sensor nodes that are linked wirelessly to monitor the physical parameters from the target region.As the nodes in WSN operate on inbuilt bat...Wireless Sensor Network(WSN)comprises a massive number of arbitrarily placed sensor nodes that are linked wirelessly to monitor the physical parameters from the target region.As the nodes in WSN operate on inbuilt batteries,the energy depletion occurs after certain rounds of operation and thereby results in reduced network lifetime.To enhance energy efficiency and network longevity,clustering and routing techniques are commonly employed in WSN.This paper presents a novel black widow optimization(BWO)with improved ant colony optimization(IACO)algorithm(BWO-IACO)for cluster based routing in WSN.The proposed BWO-IACO algorithm involves BWO based clustering process to elect an optimal set of cluster heads(CHs).The BWO algorithm derives a fitness function(FF)using five input parameters like residual energy(RE),inter-cluster distance,intra-cluster distance,node degree(ND),and node centrality.In addition,IACO based routing process is involved for route selection in inter-cluster communication.The IACO algorithm incorporates the concepts of traditional ACO algorithm with krill herd algorithm(KHA).The IACO algorithm utilizes the energy factor to elect an optimal set of routes to BS in the network.The integration of BWO based clustering and IACO based routing techniques considerably helps to improve energy efficiency and network lifetime.The presented BWO-IACO algorithm has been simulated using MATLAB and the results are examined under varying aspects.A wide range of comparative analysis makes sure the betterment of the BWO-IACO algorithm over all the other compared techniques.展开更多
Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is sc...Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.展开更多
A prediction-aided routing algorithm based on ant colony optimization mode (PRACO) to achieve energy-aware data-gathering routing structure in wireless sensor networks (WSN) is presented. We adopt autoregressive m...A prediction-aided routing algorithm based on ant colony optimization mode (PRACO) to achieve energy-aware data-gathering routing structure in wireless sensor networks (WSN) is presented. We adopt autoregressive moving average model (ARMA) to predict dynamic tendency in data traffic and deduce the construction of load factor, which can help to reveal the future energy status of sensor in WSN. By checking the load factor in heuristic factor and guided by novel pheromone updating rule, multi-agent, i. e. , artificial ants, can adaptively foresee the local energy state of networks and the corresponding actions could be taken to enhance the energy efficiency in routing construction. Compared with some classic energy-saving routing schemes, the simulation results show that the proposed routing building scheme can ① effectively reinforce the robustness of routing structure by mining the temporal associability and introducing multi-agent optimization to balance the total energy cost for data transmission, ② minimize the total communication consumption, and ③prolong the lifetime of networks.展开更多
基金supported in part by National Natural Science Foundation of China under Grants 62122069, 62071431, 62072490 and 62301490in part by Science and Technology Development Fund of Macao SAR, China under Grant 0158/2022/A+2 种基金in part by the Guangdong Basic and Applied Basic Research Foundation (2022A1515011287)in part by MYRG202000107-IOTSCin part by FDCT SKL-IOTSC (UM)-2021-2023
文摘With the development of the Internet of Things(IoT),it requires better performance from wireless sensor networks(WSNs),such as larger coverage,longer lifetime,and lower latency.However,a large amount of data generated from monitoring and long-distance transmission places a heavy burden on sensor nodes with the limited battery power.For this,we investigate an unmanned aerial vehicles assisted mobile wireless sensor network(UAV-assisted WSN)to prolong the network lifetime in this paper.Specifically,we use UAVs to assist the WSN in collecting data.In the current UAV-assisted WSN,the clustering and routing schemes are determined sequentially.However,such a separate consideration might not maximize the lifetime of the whole WSN due to the mutual coupling of clustering and routing.To efficiently prolong the lifetime of the WSN,we propose an integrated clustering and routing scheme that jointly optimizes the clustering and routing together.In the whole network space,it is intractable to efficiently obtain the optimal integrated clustering and routing scheme.Therefore,we propose the Monte-Las search strategy based on Monte Carlo and Las Vegas ideas,which can generate the chain matrix to guide the algorithm to find the solution faster.Unnecessary point-to-point collection leads to long collection paths,so a triangle optimization strategy is then proposed that finds a compromise path to shorten the collection path based on the geometric distribution and energy of sensor nodes.To avoid the coverage hole caused by the death of sensor nodes,the deployment of mobile sensor nodes and the preventive mechanism design are indispensable.An emergency data transmission mechanism is further proposed to reduce the latency of collecting the latency-sensitive data due to the absence of UAVs.Compared with the existing schemes,the proposed scheme can prolong the lifetime of the UAVassisted WSN at least by 360%,and shorten the collection path of UAVs by 56.24%.
文摘Large-scale wireless sensor networks(WSNs)play a critical role in monitoring dangerous scenarios and responding to medical emergencies.However,the inherent instability and error-prone nature of wireless links present significant challenges,necessitating efficient data collection and reliable transmission services.This paper addresses the limitations of existing data transmission and recovery protocols by proposing a systematic end-to-end design tailored for medical event-driven cluster-based large-scale WSNs.The primary goal is to enhance the reliability of data collection and transmission services,ensuring a comprehensive and practical approach.Our approach focuses on refining the hop-count-based routing scheme to achieve fairness in forwarding reliability.Additionally,it emphasizes reliable data collection within clusters and establishes robust data transmission over multiple hops.These systematic improvements are designed to optimize the overall performance of the WSN in real-world scenarios.Simulation results of the proposed protocol validate its exceptional performance compared to other prominent data transmission schemes.The evaluation spans varying sensor densities,wireless channel conditions,and packet transmission rates,showcasing the protocol’s superiority in ensuring reliable and efficient data transfer.Our systematic end-to-end design successfully addresses the challenges posed by the instability of wireless links in large-scaleWSNs.By prioritizing fairness,reliability,and efficiency,the proposed protocol demonstrates its efficacy in enhancing data collection and transmission services,thereby offering a valuable contribution to the field of medical event-drivenWSNs.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Larg Groups project Under Grant Number(71/43)Princess Nourah bint Abdulrahman University Researchers Supporting Project Number(PNURSP2022R238)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code:22UQU4340237DSR20.
文摘Wireless Sensor Network(WSN)consists of a group of limited energy source sensors that are installed in a particular region to collect data from the environment.Designing the energy-efficient data collection methods in largescale wireless sensor networks is considered to be a difficult area in the research.Sensor node clustering is a popular approach for WSN.Moreover,the sensor nodes are grouped to form clusters in a cluster-based WSN environment.The battery performance of the sensor nodes is likewise constrained.As a result,the energy efficiency of WSNs is critical.In specific,the energy usage is influenced by the loads on the sensor node as well as it ranges from the Base Station(BS).Therefore,energy efficiency and load balancing are very essential in WSN.In the proposed method,a novel Grey Wolf Improved Particle Swarm Optimization with Tabu Search Techniques(GW-IPSO-TS)was used.The selection of Cluster Heads(CHs)and routing path of every CH from the base station is enhanced by the proposed method.It provides the best routing path and increases the lifetime and energy efficiency of the network.End-to-end delay and packet loss rate have also been improved.The proposed GW-IPSO-TS method enhances the evaluation of alive nodes,dead nodes,network survival index,convergence rate,and standard deviation of sensor nodes.Compared to the existing algorithms,the proposed method outperforms better and improves the lifetime of the network.
文摘Wireless sensor networks(WSNs)encompass a massive set of sensor nodes,which are self-configurable,inexpensive,and compact.The sensor nodes undergo random deployment in the target area and transmit data to base station using inbuilt transceiver.For reducing energy consumption and lengthen lifetime of WSN,multihop routing protocols can be designed.This study develops an improved rat swarm optimization based energy aware multi-hop routing(IRSO-EAMHR)protocol for WSN.An important intention of the IRSO-EAMHR method is for determining optimal routes to base station(BS)in the clustered WSN.Primarily,a weighted clustering process is performed to group the nodes into clusters and select cluster heads(CHs).Next,the IRSO-EAMHR approach derives afitness function containing three input parameters(residual energy,dis-tance,and node degree)for routing process.The IRSO technique was designed by the integration of Levy movement concepts into the traditional RSO algorithm.The experimental result analysis of the IRSO-EAMHR technique is carried out and the outcomes are examined in various aspects.The simulation outcomes demonstrate the promising performance of the IRSO-EAMHR technique over the recent state of art approaches.
文摘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.
文摘In recent scenario of Wireless Sensor Networks(WSNs),there are many application developed for handling sensitive and private data such as military information,surveillance data,tracking,etc.Hence,the sensor nodes of WSNs are distributed in an intimidating region,which is non-rigid to attacks.The recent research domains of WSN deal with models to handle the WSN communications against malicious attacks and threats.In traditional models,the solution has been made for defending the networks,only to specific attacks.However,in real-time applications,the kind of attack that is launched by the adversary is not known.Additionally,on developing a security mechanism for WSN,the resource constraints of sensor nodes are also to be considered.With that note,this paper presents an Enhanced Security Model with Improved Defensive Routing Mechanism(IDRM)for defending the sensor network from various attacks.Moreover,for efficient model design,the work includes the part of feature evaluation of some general attacks of WSNs.The IDRM also includes determination of optimal secure paths and Node security for secure routing operations.The performance of the proposed model is evaluated with respect to several factors;it is found that the model has achieved better security levels and is efficient than other existing models in WSN communications.It is proven that the proposed IDRM produces 74%of PDR in average and a minimized packet drop of 38%when comparing with the existing works.
基金Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R237)Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code:(22UQU4310373DSR30).
文摘Recently,Internet of Things(IoT)has been developed into a field of research and it purposes at linking many sensors enabling devices mostly to data collection and track applications.Wireless sensor network(WSN)is a vital element of IoT paradigm since its inception and has developed into one of the chosen platforms for deploying many smart city application regions such as disaster management,intelligent transportation,home automation,smart buildings,and other such IoT-based application.The routing approaches were extremely-utilized energy efficient approaches with an initial drive that is,for balancing the energy amongst sensor nodes.The clustering and routing procedures assumed that Non-Polynomial(NP)hard problems but bio-simulated approaches are utilized to a recognized time for resolving such problems.With this motivation,this paper presents a new blockchain with Enhanced Hunger Games Search based Route Planning(BCEHGS-RP)scheme for IoT assisted WSN.The presented BCEHGS-RP model majorly employs BC technology for secure communication in the IoT supportedWSN environment.In addition,an effective multihop route planning approach was designed by the use of EHGS technique.The proposed EHGS technique is derived from the concept of Hill Climbing strategy(HCS)and HGS algorithm.Moreover,a fitness function with two parameters namely residual energy(RE)and intercluster distance to elect optimal routes.The performance validation of the BCEHGS-RP model is experimented with under diverse number of nodes.Extensive experimental outcomes highlighted the better performance of the BCEHGS-RP technique on recent approaches.
文摘Energy conservation has become a significant consideration in wireless sensor networks(WSN).In the sensor network,the sensor nodes have internal batteries,and as a result,they expire after a certain period.As a result,expanding the life duration of sensing devices by improving data depletion in an effective and sustainable energy-efficient way remains a challenge.Also,the clustering strategy employs to enhance or extend the life cycle of WSNs.We identify the supervisory head node(SH)or cluster head(CH)in every grouping considered the feasible strategy for power-saving route discovery in the clustering model,which diminishes the communication overhead in the WSN.However,the critical issue was determining the best SH for ensuring timely communication services.Our secure and energy concise route revamp technology(SECRET)protocol involves selecting an energy-concise cluster head(ECH)and route revamping to optimize navigation.The sensors transmit information over the ECH,which delivers the information to the base station via the determined optimal path using our strategy for effective data transmission.We modeled our methods to accom-plish power-efficient multi-hop routing.Furthermore,protected navigation helps to preserve energy when routing.The suggested solution improves energy savings,packet delivery ratio(PDR),route latency(RL),network lifetime(NL),and scalability.
基金This research was supported by the Universiti Sains Malaysia(USM)and the Ministry of Higher Education Malaysia through Fundamental Research GrantScheme(FRGS-Grant No:FRGS/1/2020/TK0/USM/02/1).
文摘Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in the routing function.This article introduces Enhanced Metaheuristics with Trust Aware Secure Route Selection Protocol(EMTA-SRSP)for WSN.The presented EMTA-SRSP technique majorly involves the optimal selection of routes in WSN.To accomplish this,the EMTA-SRSP technique involves the design of an oppositional Aquila optimization algorithm to choose safe routes for data communication.For the clustering process,the nodes with maximum residual energy will be considered cluster heads(CHs).In addition,the OAOA technique gets executed to choose optimal routes based on objective functions with multiple parameters such as energy,distance,and trust degree.The experimental validation of the EMTA-SRSP technique is tested,and the results exhibited a better performance of the EMTA-SRSP technique over other approaches.
文摘The Wireless Sensor Network(WSN)is a network of Sensor Nodes(SN)which adopt radio signals for communication amongst themselves.There is an increase in the prominence of WSN adaptability to emerging applications like the Internet of Things(IoT)and Cyber-Physical Systems(CPS).Data secur-ity,detection of faults,management of energy,collection and distribution of data,network protocol,network coverage,mobility of nodes,and network heterogene-ity are some of the issues confronted by WSNs.There is not much published information on issues related to node mobility and management of energy at the time of aggregation of data.Towards the goal of boosting the mobility-based WSNs’network performance and energy,data aggregation protocols such as the presently-used Mobility Low-Energy Adaptive Clustering Hierarchy(LEACH-M)and Energy Efficient Heterogeneous Clustered(EEHC)scheme have been exam-ined in this work.A novel Artificial Bee Colony(ABC)algorithm is proposed in this work for effective election of CHs and multipath routing in WSNs so as to enable effective data transfer to the Base Station(BS)with least energy utilization.There is avoidance of the local optima problem at the time of solution space search in this proposed technique.Experimentations have been conducted on a large WSN network that has issues with mobility of nodes.
文摘Energy efficient routing is one of the major thrust areas in Wireless Sensor Communication Networks (WSCNs) and it attracts most of the researchers by its valuable applications and various challenges. Wireless sensor networks contain several nodes in its terrain region. Reducing the energy consumption over the WSCN has its significance since the nodes are battery powered. Various research methodologies were proposed by researchers in this area. One of the bio-inspired computing paradigms named Cuckoo search algorithm is used in this research work for finding the energy efficient path and routing is performed. Several performance metrics are taken into account for determining the performance of the proposed routing protocol such as throughput, packet delivery ratio, energy consumption and delay. Simulation is performed using NS2 and the results shows that the proposed routing protocol is better in terms of average throughput, and average energy consumption.
文摘Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.
文摘Aiming at the problem that node load is rarely considered in existing clustering routing algorithm for Wireless Sensor Networks (WSNs), a dynamic clustering routing algorithm for WSN is presented in this paper called DCRCL (Dynamic Clustering Routing Considering Load). This algorithm is comprised of three phases including cluster head (CH) selection, cluster setup and inter-cluster routing. First, the CHs are selected based on residual energy and node load. Then the non-CH nodes choose a cluster by comparing the cost function of its neighbor CHs. At last, each CH communicates with base station by using multi-hop communication. The simulation results show that comparing with the existing one, the techniques life cycle and date volume of the network are increased by 30.7 percent and 29.8 percent respectively by using the proposed algorithm DCRCL.
文摘One of the most important issues of wireless sensor networks is how to transfer information from the network nodes to a base station and choose the best possible path for this purpose. Choosing the best path can be based on different factors such as energy consumption, response time, delay, and data transfer accuracy. Increasing the network lifetime is the most challenging problem. One of the latest energy-aware routing methods is to use the harmony search algorithm in the small-scale sensor networks. The aim of this study is to introduce the harmony search algorithm as a successful metaheuristic algorithm for wireless sensor network routing in order to increase the lifetime of such networks. This study is intended to improve the objective function for energy efficiency in the harmony search algorithm to establish balance between the network energy consumption and path length control. Therefore, it is necessary to choose the initial energy of each node randomly from a certain range as the path energy consumption should be low to choose a path which can consider the residual energy. In other words, a path should be chosen to establish balance between the network energy consumption and the minimum residual energy. The simulation results indicate that the proposed objective function provides a longer lifetime by 26.12% compared with EEHSBR.
基金supported by the National Natural Science Fundation of China (60974082 60874085)+2 种基金the Fundamental Research Funds for the Central Universities (K50510700004)the Technology Plan Projects of Guangdong Province (20110401)the Team Project of Hanshan Normal University (LT201001)
文摘To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.
基金the supports of the National Natural Science Foundation of China (60403027) the projects of science and research plan of Hubei provincial department of education (2003A011)the Natural Science Foundation Of Hubei Province of China (2005ABA243).
文摘With the increasing deployment of wireless sensordevices and networks,security becomes a criticalchallenge for sensor networks.In this paper,a schemeusing data mining is proposed for routing anomalydetection in wireless sensor networks.The schemeuses the Apriori algorithm to extract traffic patternsfrom both routing table and network traffic packetsand subsequently the K-means cluster algorithmadaptively generates a detection model.Through thecombination of these two algorithms,routing attackscan be detected effectively and automatically.Themain advantage of the proposed approach is that it isable to detect new attacks that have not previouslybeen seen.Moreover,the proposed detection schemeis based on no priori knowledge and then can beapplied to a wide range of different sensor networksfor a variety of routing attacks.
文摘Wireless Sensor Network(WSN)comprises a massive number of arbitrarily placed sensor nodes that are linked wirelessly to monitor the physical parameters from the target region.As the nodes in WSN operate on inbuilt batteries,the energy depletion occurs after certain rounds of operation and thereby results in reduced network lifetime.To enhance energy efficiency and network longevity,clustering and routing techniques are commonly employed in WSN.This paper presents a novel black widow optimization(BWO)with improved ant colony optimization(IACO)algorithm(BWO-IACO)for cluster based routing in WSN.The proposed BWO-IACO algorithm involves BWO based clustering process to elect an optimal set of cluster heads(CHs).The BWO algorithm derives a fitness function(FF)using five input parameters like residual energy(RE),inter-cluster distance,intra-cluster distance,node degree(ND),and node centrality.In addition,IACO based routing process is involved for route selection in inter-cluster communication.The IACO algorithm incorporates the concepts of traditional ACO algorithm with krill herd algorithm(KHA).The IACO algorithm utilizes the energy factor to elect an optimal set of routes to BS in the network.The integration of BWO based clustering and IACO based routing techniques considerably helps to improve energy efficiency and network lifetime.The presented BWO-IACO algorithm has been simulated using MATLAB and the results are examined under varying aspects.A wide range of comparative analysis makes sure the betterment of the BWO-IACO algorithm over all the other compared techniques.
文摘Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.
基金Financial support for this work,provided by the National Natural Science Foundation of China(No.50904070)the Science and Technology Foundation of China University of Mining & Technology (Nos.2007A046 and 2008A042)the Joint Production and Research Innovation Project of Jiangsu Province (No.BY2009114)
基金Supported by the National Natural Science Foundation of China(60802005,60965002,50803016)Science Foundation forthe Excellent Youth Scholars at East China University of Science and Technology(YH0157127)Undergraduate Innovational Experimentation Program in ECUST(X1033)
文摘A prediction-aided routing algorithm based on ant colony optimization mode (PRACO) to achieve energy-aware data-gathering routing structure in wireless sensor networks (WSN) is presented. We adopt autoregressive moving average model (ARMA) to predict dynamic tendency in data traffic and deduce the construction of load factor, which can help to reveal the future energy status of sensor in WSN. By checking the load factor in heuristic factor and guided by novel pheromone updating rule, multi-agent, i. e. , artificial ants, can adaptively foresee the local energy state of networks and the corresponding actions could be taken to enhance the energy efficiency in routing construction. Compared with some classic energy-saving routing schemes, the simulation results show that the proposed routing building scheme can ① effectively reinforce the robustness of routing structure by mining the temporal associability and introducing multi-agent optimization to balance the total energy cost for data transmission, ② minimize the total communication consumption, and ③prolong the lifetime of networks.