A Fuzzy Trust Management Mechanism with Dynamic Behavior Monitoring for Wireless Sensor Networks

Traditional wireless sensor networks(WSNs)are typically deployed in remote and hostile environments for information collection.The wireless communication methods adopted by sensor nodes may make the network highly vulnerable to various attacks.Traditional encryption and authentication mechanisms cannot prevent attacks launched by internal malicious nodes.The trust-based security mechanism is usually adopted to solve this problem in WSNs.However,the behavioral evidence used for trust estimation presents some uncertainties due to the open wireless medium and the inexpensive sensor nodes.Moreover,how to efficiently collect behavioral evidences are rarely discussed.To address these issues,in this paper,we present a trust management mechanism based on fuzzy logic and a cloud model.First,a type-II fuzzy logic system is used to preprocess the behavioral evidences and alleviate uncertainty.Then,the cloud model is introduced to estimate the trust values for sensor nodes.Finally,a dynamic behavior monitoring protocol is proposed to provide a balance between energy conservation and safety assurance.Simulation results demonstrate that our trust management mechanism can effectively protect the network from internal malicious attacks while enhancing the energy efficiency of behavior monitoring.

Rao Algorithms-Based Structure Optimization for Heterogeneous Wireless Sensor Networks

The structural optimization of wireless sensor networks is a critical issue because it impacts energy consumption and hence the network’s lifetime.Many studies have been conducted for homogeneous networks,but few have been performed for heterogeneouswireless sensor networks.This paper utilizes Rao algorithms to optimize the structure of heterogeneous wireless sensor networks according to node locations and their initial energies.The proposed algorithms lack algorithm-specific parameters and metaphorical connotations.The proposed algorithms examine the search space based on the relations of the population with the best,worst,and randomly assigned solutions.The proposed algorithms can be evaluated using any routing protocol,however,we have chosen the well-known routing protocols in the literature:Low Energy Adaptive Clustering Hierarchy(LEACH),Power-Efficient Gathering in Sensor Information Systems(PEAGSIS),Partitioned-based Energy-efficient LEACH(PE-LEACH),and the Power-Efficient Gathering in Sensor Information Systems Neural Network(PEAGSIS-NN)recent routing protocol.We compare our optimized method with the Jaya,the Particle Swarm Optimization-based Energy Efficient Clustering(PSO-EEC)protocol,and the hybrid Harmony Search Algorithm and PSO(HSA-PSO)algorithms.The efficiencies of our proposed algorithms are evaluated by conducting experiments in terms of the network lifetime(first dead node,half dead nodes,and last dead node),energy consumption,packets to cluster head,and packets to the base station.The experimental results were compared with those obtained using the Jaya optimization algorithm.The proposed algorithms exhibited the best performance.The proposed approach successfully prolongs the network lifetime by 71% for the PEAGSIS protocol,51% for the LEACH protocol,10% for the PE-LEACH protocol,and 73% for the PEGSIS-NN protocol;Moreover,it enhances other criteria such as energy conservation,fitness convergence,packets to cluster head,and packets to the base station.

Mechanism analysis of regulating Turing instability and Hopf bifurcation of malware propagation in mobile wireless sensor networks

A dynamical model is constructed to depict the spatial-temporal evolution of malware in mobile wireless sensor networks(MWSNs). Based on such a model, we design a hybrid control scheme combining parameter perturbation and state feedback to effectively manipulate the spatiotemporal dynamics of malware propagation. The hybrid control can not only suppress the Turing instability caused by diffusion factor but can also adjust the occurrence of Hopf bifurcation induced by time delay. Numerical simulation results show that the hybrid control strategy can efficiently manipulate the transmission dynamics to achieve our expected desired properties, thus reducing the harm of malware propagation to MWSNs.

Stackelberg Game for Wireless Powered and Backscattering Enabled Sensor Networks

This paper investigates a wireless powered and backscattering enabled sensor network based on the non-linear energy harvesting model, where the power beacon(PB) delivers energy signals to wireless sensors to enable their passive backscattering and active transmission to the access point(AP). We propose an efficient time scheduling scheme for network performance enhancement, based on which each sensor can always harvest energy from the PB over the entire block except its time slots allocated for passive and active information delivery. Considering the PB and wireless sensors are from two selfish service providers, we use the Stackelberg game to model the energy interaction among them. To address the non-convexity of the leader-level problem, we propose to decompose the original problem into two subproblems and solve them iteratively in an alternating manner. Specifically, the successive convex approximation, semi-definite relaxation(SDR) and variable substitution techniques are applied to find a nearoptimal solution. To evaluate the performance loss caused by the interaction between two providers, we further investigate the social welfare maximization problem. Numerical results demonstrate that compared to the benchmark schemes, the proposed scheme can achieve up to 35.4% and 38.7% utility gain for the leader and the follower, respectively.

A Practical Approach for Missing Wireless Sensor Networks Data Recovery

In wireless sensor networks(WSNs),the performance of related applications is highly dependent on the quality of data collected.Unfortunately,missing data is almost inevitable in the process of data acquisition and transmission.Existing methods often rely on prior information such as low-rank characteristics or spatiotemporal correlation when recovering missing WSNs data.However,in realistic application scenarios,it is very difficult to obtain these prior information from incomplete data sets.Therefore,we aim to recover the missing WSNs data effectively while getting rid of the perplexity of prior information.By designing the corresponding measurement matrix that can capture the position of missing data and sparse representation matrix,a compressive sensing(CS)based missing data recovery model is established.Then,we design a comparison standard to select the best sparse representation basis and introduce average cross-correlation to examine the rationality of the established model.Furthermore,an improved fast matching pursuit algorithm is proposed to solve the model.Simulation results show that the proposed method can effectively recover the missing WSNs data.

Reliable Data Collection Model and Transmission Framework in Large-Scale Wireless Medical Sensor Networks

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.

Actor-Critic-Based UAV-Assisted Data Collection in the Wireless Sensor Network

Wireless Sensor Network(WSN)is widely utilized in large-scale distributed unmanned detection scenarios due to its low cost and flexible installation.However,WSN data collection encounters challenges in scenarios lacking communication infrastructure.Unmanned aerial vehicle(UAV)offers a novel solution for WSN data collection,leveraging their high mobility.In this paper,we present an efficient UAV-assisted data collection algorithm aimed at minimizing the overall power consumption of the WSN.Firstly,a two-layer UAV-assisted data collection model is introduced,including the ground and aerial layers.The ground layer senses the environmental data by the cluster members(CMs),and the CMs transmit the data to the cluster heads(CHs),which forward the collected data to the UAVs.The aerial network layer consists of multiple UAVs that collect,store,and forward data from the CHs to the data center for analysis.Secondly,an improved clustering algorithm based on K-Means++is proposed to optimize the number and locations of CHs.Moreover,an Actor-Critic based algorithm is introduced to optimize the UAV deployment and the association with CHs.Finally,simulation results verify the effectiveness of the proposed algorithms.

Integrated Clustering and Routing Design and Triangle Path Optimization for UAV-Assisted Wireless Sensor Networks

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%.

Resource Allocation for IRS Assistedmm Wave Wireless Powered Sensor Networks with User Cooperation

In this paper,we investigate IRS-aided user cooperation(UC)scheme in millimeter wave(mmWave)wirelesspowered sensor networks(WPSN),where two single-antenna users are wireless powered in the wireless energy transfer(WET)phase first and then cooperatively transmit information to a hybrid access point(AP)in the wireless information transmission(WIT)phase,following which the IRS is deployed to enhance the system performance of theWET andWIT.We maximized the weighted sum-rate problem by jointly optimizing the transmit time slots,power allocations,and the phase shifts of the IRS.Due to the non-convexity of the original problem,a semidefinite programming relaxation-based approach is proposed to convert the formulated problem to a convex optimization framework,which can obtain the optimal global solution.Simulation results demonstrate that the weighted sum throughput of the proposed UC scheme outperforms the non-UC scheme whether equipped with IRS or not.

A Review and Analysis of Localization Techniques in Underwater Wireless Sensor Networks

In recent years,there has been a rapid growth in Underwater Wireless Sensor Networks(UWSNs).The focus of research in this area is now on solving the problems associated with large-scale UWSN.One of the major issues in such a network is the localization of underwater nodes.Localization is required for tracking objects and detecting the target.It is also considered tagging of data where sensed contents are not found of any use without localization.This is useless for application until the position of sensed content is confirmed.This article’s major goal is to review and analyze underwater node localization to solve the localization issues in UWSN.The present paper describes various existing localization schemes and broadly categorizes these schemes as Centralized and Distributed localization schemes underwater.Also,a detailed subdivision of these localization schemes is given.Further,these localization schemes are compared from different perspectives.The detailed analysis of these schemes in terms of certain performance metrics has been discussed in this paper.At the end,the paper addresses several future directions for potential research in improving localization problems of UWSN.

Heterogeneous Fault-Tolerant Aggregate Signcryption with Equality Test for Vehicular Sensor Networks

The vehicular sensor network (VSN) is an important part of intelligent transportation, which is used for real-timedetection and operation control of vehicles and real-time transmission of data and information. In the environmentofVSN, massive private data generated by vehicles are transmitted in open channels and used by other vehicle users,so it is crucial to maintain high transmission efficiency and high confidentiality of data. To deal with this problem, inthis paper, we propose a heterogeneous fault-tolerant aggregate signcryption scheme with an equality test (HFTASET).The scheme combines fault-tolerant and aggregate signcryption,whichnot onlymakes up for the deficiency oflow security of aggregate signature, but alsomakes up for the deficiency that aggregate signcryption cannot tolerateinvalid signature. The scheme supports one verification pass when all signcryptions are valid, and it supportsunbounded aggregation when the total number of signcryptions grows dynamically. In addition, this schemesupports heterogeneous equality test, and realizes the access control of private data in different cryptographicenvironments, so as to achieve flexibility in the application of our scheme and realize the function of quick searchof plaintext or ciphertext. Then, the security of HFTAS-ET is demonstrated by strict theoretical analysis. Finally, weconduct strict and standardized experimental operation and performance evaluation, which shows that the schemehas better performance.

Sensor Network Structure Recognition Based on P-law

A sensor graph network is a sensor network model organized according to graph network structure.Structural unit and signal propagation of core nodes are the basic characteristics of sensor graph networks.In sensor networks,network structure recognition is the basis for accurate identification and effective prediction and control of node states.Aiming at the problems of difficult global structure identification and poor interpretability in complex sensor graph networks,based on the characteristics of sensor networks,a method is proposed to firstly unitize the graph network structure and then expand the unit based on the signal transmission path of the core node.This method which builds on unit patulousness and core node signal propagation(called p-law)can rapidly and effectively achieve the global structure identification of a sensor graph network.Different from the traditional graph network structure recognition algorithms such as modularity maximization and spectral clustering,the proposed method reveals the natural evolution process and law of graph network subgroup generation.Experimental results confirm the effectiveness,accuracy and rationality of the proposed method and suggest that our method can be a new approach for graph network global structure recognition.

PSAP-WSN:A Provably Secure Authentication Protocol for 5G-Based Wireless Sensor Networks

Nowadays,the widespread application of 5G has promoted rapid development in different areas,particularly in the Internet of Things(IoT),where 5G provides the advantages of higher data transfer rate,lower latency,and widespread connections.Wireless sensor networks(WSNs),which comprise various sensors,are crucial components of IoT.The main functions of WSN include providing users with real-time monitoring information,deploying regional information collection,and synchronizing with the Internet.Security in WSNs is becoming increasingly essential because of the across-the-board nature of wireless technology in many fields.Recently,Yu et al.proposed a user authentication protocol forWSN.However,their design is vulnerable to sensor capture and temporary information disclosure attacks.Thus,in this study,an improved protocol called PSAP-WSNis proposed.The security of PSAP-WSN is demonstrated by employing the ROR model,BAN logic,and ProVerif tool for the analysis.The experimental evaluation shows that our design is more efficient and suitable forWSN environments.

Blockchain Driven Metaheuristic Route Planning in Secure Wireless Sensor Networks

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.

A zeroing neurodynamics‐based location method for nodes in underwater acoustic sensor network

Zeroing neurodynamics methodology,which dedicates to finding equilibrium points of equations,has been proven to be a powerful tool in the online solving of problems with considerable complexity.In this paper,a method for underwater acoustic sensor network(UASN)localisation is proposed based on zeroing neurodynamics methodology to preferably locate moving underwater nodes.A zeroing neurodynamics model specifically designed for UASN localisation is constructed with rigorous theoretical analyses of its effectiveness.The proposed zeroing neurodynamics model is compatible with some localisation algorithms,which can be utilised to eliminate error in non‐ideal situations,thus further improving its effectiveness.Finally,the effectiveness and compatibility of the proposed zeroing neurodynamics model are substantiated by examples and computer simulations.

Metaheuristic Secure Clustering Scheme for Energy Harvesting Wireless Sensor Networks

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.

Self-Triggered Consensus Filtering over Asynchronous Communication Sensor Networks

In this paper,a self-triggered consensus filtering is developed for a class of discrete-time distributed filtering systems.Different from existing event-triggered filtering,the self-triggered one does not require to continuously judge the trigger condition at each sampling instant and can save computational burden while achieving good state estimation.The triggering policy is presented for pre-computing the next execution time for measurements according to the filter’s own data and the latest released data of its neighbors at the current time.However,a challenging problem is that data will be asynchronously transmitted within the filtering network because each node self-triggers independently.Therefore,a co-design of the self-triggered policy and asynchronous distributed filter is developed to ensure consensus of the state estimates.Finally,a numerical example is given to illustrate the effectiveness of the consensus filtering approach.

Secure and Energy Concise Route Revamp Technique in Wireless Sensor Networks

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.

Application of Zero-Watermarking for Medical Image in Intelligent Sensor Network Security

The field of healthcare is considered to be the most promising application of intelligent sensor networks.However,the security and privacy protection ofmedical images collected by intelligent sensor networks is a hot problem that has attracted more and more attention.Fortunately,digital watermarking provides an effective method to solve this problem.In order to improve the robustness of the medical image watermarking scheme,in this paper,we propose a novel zero-watermarking algorithm with the integer wavelet transform(IWT),Schur decomposition and image block energy.Specifically,we first use IWT to extract low-frequency information and divide them into non-overlapping blocks,then we decompose the sub-blocks by Schur decomposition.After that,the feature matrix is constructed according to the relationship between the image block energy and the whole image energy.At the same time,we encrypt watermarking with the logistic chaotic position scrambling.Finally,the zero-watermarking is obtained by XOR operation with the encrypted watermarking.Three indexes of peak signal-to-noise ratio,normalization coefficient(NC)and the bit error rate(BER)are used to evaluate the robustness of the algorithm.According to the experimental results,most of the NC values are around 0.9 under various attacks,while the BER values are very close to 0.These experimental results show that the proposed algorithm is more robust than the existing zero-watermarking methods,which indicates it is more suitable for medical image privacy and security protection.

Packet Scheduling in Rechargeable Wireless Sensor Networks under SINR Model

Two packet scheduling algorithms for rechargeable sensor networks are proposed based on the signal to interference plus noise ratio model.They allocate different transmission slots to conflicting packets and overcome the challenges caused by the fact that the channel state changes quickly and is uncontrollable.The first algorithm proposes a prioritybased framework for packet scheduling in rechargeable sensor networks.Every packet is assigned a priority related to the transmission delay and the remaining energy of rechargeable batteries,and the packets with higher priority are scheduled first.The second algorithm mainly focuses on the energy efficiency of batteries.The priorities are related to the transmission distance of packets,and the packets with short transmission distance are scheduled first.The sensors are equipped with low-capacity rechargeable batteries,and the harvest-store-use model is used.We consider imperfect batteries.That is,the battery capacity is limited,and battery energy leaks over time.The energy harvesting rate,energy retention rate and transmission power are known.Extensive simulation results indicate that the battery capacity has little effect on the packet scheduling delay.Therefore,the algorithms proposed in this paper are very suitable for wireless sensor networks with low-capacity batteries.