Sensor networks provide means to link people with real world by processing data in real time collected from real-world and routing the query results to the right people. Application examples include continuous monitor...Sensor networks provide means to link people with real world by processing data in real time collected from real-world and routing the query results to the right people. Application examples include continuous monitoring of environment, building infrastructures and human health. Many researchers view the sensor networks as databases, and the monitoring tasks are performed as subscriptions, queries, and alert. However, this point is not precise. First, databases can only deal with well-formed data types, with well-defined schema for their interpretation, while the raw data collected by the sensor networks, in most cases, do not fit to this requirement. Second, sensor networks have to deal with very dynamic targets, environment and resources, while databases are more static. In order to fill this gap between sensor networks and databases, we propose a novel approach, referred to as 'spatiotemporal data stream segmentation', or 'stream segmentation' for short, to address the dynamic nature and deal with 'raw' data of sensor networks. Stream segmentation is defined using Bayesian Networks in the context of sensor networks, and two application examples are given to demonstrate the usefulness of the approach.展开更多
Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic ...Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.展开更多
Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these netw...Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these networks continue to grow in scale and complexity,the need for energy-efficient,scalable,and robust communication protocols becomes more critical than ever.Metaheuristic algorithms have shown significant promise in addressing these challenges,offering flexible and effective solutions for optimizing WSN performance.Among them,the Grey Wolf Optimizer(GWO)algorithm has attracted growing attention due to its simplicity,fast convergence,and strong global search capabilities.Accordingly,this survey provides an in-depth review of the applications of GWO and its variants for clustering,multi-hop routing,and hybrid cluster-based routing in WSNs.We categorize and analyze the existing GWO-based approaches across these key network optimization tasks,discussing the different problem formulations,decision variables,objective functions,and performance metrics used.In doing so,we examine standard GWO,multi-objective GWO,and hybrid GWO models that incorporate other computational intelligence techniques.Each method is evaluated based on how effectively it addresses the core constraints of WSNs,including energy consumption,communication overhead,and network lifetime.Finally,this survey outlines existing gaps in the literature and proposes potential future research directions aimed at enhancing the effectiveness and real-world applicability of GWO-based techniques for WSN clustering and routing.Our goal is to provide researchers and practitioners with a clear,structured understanding of the current state of GWO in WSNs and inspire further innovation in this evolving field.展开更多
Multisensor data fusion （MDF） is an emerging technology to fuse data from multiple sensors in order to make a more accurate estimation of the environment through measurement and detection. Applications of MDF cross ...Multisensor data fusion （MDF） is an emerging technology to fuse data from multiple sensors in order to make a more accurate estimation of the environment through measurement and detection. Applications of MDF cross a wide spectrum in military and civilian areas. With the rapid evolution of computers and the proliferation of micro-mechanical/electrical systems sensors, the utilization of MDF is being popularized in research and applications. This paper focuses on application of MDF for high quality data analysis and processing in measurement and instrumentation. A practical, general data fusion scheme was established on the basis of feature extraction and merge of data from multiple sensors. This scheme integrates artificial neural networks for high performance pattern recognition. A number of successful applications in areas of NDI （Non-Destructive Inspection） corrosion detection, food quality and safety characterization, and precision agriculture are described and discussed in order to motivate new applications in these or other areas. This paper gives an overall picture of using the MDF method to increase the accuracy of data analysis and processing in measurement and instrumentation in different areas of applications.展开更多
An algorithm is presented for fusion of tracks created by radar and IR sensor which have different dimensional measurement data. It’s assumed that these sensors are asynchronous and the measurement data are transmitt...An algorithm is presented for fusion of tracks created by radar and IR sensor which have different dimensional measurement data. It’s assumed that these sensors are asynchronous and the measurement data are transmitted to a central station at different rates. By means of the technique of time matching, two sets of asynchronous data are fused and then the filter is updated according to the fused information. The results show that the accuracy of the filter effect has been improved.展开更多
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.展开更多
In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification probl...In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification problem of moving vehicles in wireless sensor networks using acoustic signals emitted from vehicles. Three algorithms including wavelet decomposition, weighted k-nearest-neighbor and Dempster-Shafer theory are combined in this paper. Finally, we use real world experimental data to validate the classification methods. The result shows that wavelet based feature extraction method can extract stable features from acoustic signals. By fusion with Dempster's rule, the classification performance is improved.展开更多
This paper deals with the problem of designing robust sequential covariance intersection(SCI)fusion Kalman filter for the clustering multi-agent sensor network system with measurement delays and uncertain noise varian...This paper deals with the problem of designing robust sequential covariance intersection(SCI)fusion Kalman filter for the clustering multi-agent sensor network system with measurement delays and uncertain noise variances.The sensor network is partitioned into clusters by the nearest neighbor rule.Using the minimax robust estimation principle,based on the worst-case conservative sensor network system with conservative upper bounds of noise variances,and applying the unbiased linear minimum variance(ULMV)optimal estimation rule,we present the two-layer SCI fusion robust steady-state Kalman filter which can reduce communication and computation burdens and save energy sources,and guarantee that the actual filtering error variances have a less-conservative upper-bound.A Lyapunov equation method for robustness analysis is proposed,by which the robustness of the local and fused Kalman filters is proved.The concept of the robust accuracy is presented and the robust accuracy relations of the local and fused robust Kalman filters are proved.It is proved that the robust accuracy of the global SCI fuser is higher than those of the local SCI fusers and the robust accuracies of all SCI fusers are higher than that of each local robust Kalman filter.A simulation example for a tracking system verifies the robustness and robust accuracy relations.展开更多
Wireless sensor networks(WSNs)consist of a great deal of sensor nodes with limited power,computation,storage,sensing and communication capabilities.Data aggregation is a very important technique,which is designed to s...Wireless sensor networks(WSNs)consist of a great deal of sensor nodes with limited power,computation,storage,sensing and communication capabilities.Data aggregation is a very important technique,which is designed to substantially reduce the communication overhead and energy expenditure of sensor node during the process of data collection in a WSNs.However,privacy-preservation is more challenging especially in data aggregation,where the aggregators need to perform some aggregation operations on sensing data it received.We present a state-of-the art survey of privacy-preserving data aggregation in WSNs.At first,we classify the existing privacy-preserving data aggregation schemes into different categories by the core privacy-preserving techniques used in each scheme.And then compare and contrast different algorithms on the basis of performance measures such as the privacy protection ability,communication consumption,power consumption and data accuracy etc.Furthermore,based on the existing work,we also discuss a number of open issues which may intrigue the interest of researchers for future work.展开更多
Wireless Sensor Networks(WSNs) has become a popular research topic due to its resource constraints. Energy consumption and transmission delay is crucial requirement to be handled to enhance the popularity of WSNs. In ...Wireless Sensor Networks(WSNs) has become a popular research topic due to its resource constraints. Energy consumption and transmission delay is crucial requirement to be handled to enhance the popularity of WSNs. In order to overcome these issues, we have proposed an Efficient Packet Scheduling Technique for Data Merging in WSNs. Packet scheduling is done by using three levels of priority queue and to reduce the transmission delay. Real-time data packets are placed in high priority queue and Non real-time data packets based on local or remote data are placed on other queues. In this paper, we have used Time Division Multiple Access(TDMA) scheme to efficiently determine the priority of the packet at each level and transmit the data packets from lower level to higher level through intermediate nodes. To reduce the number of transmission, efficient data merge technique is used to merge the data packet in intermediate nodes which has same destination node. Data merge utilize the maximum packet size by appending the merged packets with received packets till the maximum packet size or maximum waiting time is reached. Real-time data packets are directly forwarded to the next node without applying data merge. The performance is evaluated under various metrics like packet delivery ratio, packet drop, energy consumption and delay based on changing the number of nodes and transmission rate. Our results show significant reduction in various performance metrics.展开更多
For rechargeable wireless sensor networks,limited energy storage capacity,dynamic energy supply,low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanentl...For rechargeable wireless sensor networks,limited energy storage capacity,dynamic energy supply,low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario.Therefore,before data delivery,a sensor has to update its waking schedule continuously and share them to its neighbors,which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets.In this work,we propose the maximum data generation rate routing protocol based on data flow controlling technology.For a sensor,it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors.Hence,the energy consumption for time synchronization,location information and waking schedule shared will be reduced significantly.The saving energy can be used for improving data collection rate.Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.展开更多
Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime,...Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.展开更多
In order to maximize the value of information(VoI)of collected data in unmanned aerial vehicle(UAV)-aided wireless sensor networks(WSNs),a UAV trajectory planning algorithm named maximum VoI first and successive conve...In order to maximize the value of information(VoI)of collected data in unmanned aerial vehicle(UAV)-aided wireless sensor networks(WSNs),a UAV trajectory planning algorithm named maximum VoI first and successive convex approximation(MVF-SCA)is proposed.First,the Rician channel model is adopted in the system and sensor nodes(SNs)are divided into key nodes and common nodes.Secondly,the data collection problem is formulated as a mixed integer non-linear program(MINLP)problem.The problem is divided into two sub-problems according to the different types of SNs to seek a sub-optimal solution with a low complexity.Finally,the MVF-SCA algorithm for UAV trajectory planning is proposed,which can not only be used for daily data collection in the target area,but also collect time-sensitive abnormal data in time when the exception occurs.Simulation results show that,compared with the existing classic traveling salesman problem(TSP)algorithm and greedy path planning algorithm,the VoI collected by the proposed algorithm can be improved by about 15%to 30%.展开更多
A great challenge faced by wireless sensor networks(WSNs) is to reduce energy consumption of sensor nodes. Fortunately, the data gathering via random sensing can save energy of sensor nodes. Nevertheless, its randomne...A great challenge faced by wireless sensor networks(WSNs) is to reduce energy consumption of sensor nodes. Fortunately, the data gathering via random sensing can save energy of sensor nodes. Nevertheless, its randomness and density usually result in difficult implementations, high computation complexity and large storage spaces in practical settings. So the deterministic sparse sensing matrices are desired in some situations. However,it is difficult to guarantee the performance of deterministic sensing matrix by the acknowledged metrics. In this paper, we construct a class of deterministic sparse sensing matrices with statistical versions of restricted isometry property(St RIP) via regular low density parity check(RLDPC) matrices. The key idea of our construction is to achieve small mutual coherence of the matrices by confining the column weights of RLDPC matrices such that St RIP is satisfied. Besides, we prove that the constructed sensing matrices have the same scale of measurement numbers as the dense measurements. We also propose a data gathering method based on RLDPC matrix. Experimental results verify that the constructed sensing matrices have better reconstruction performance, compared to the Gaussian, Bernoulli, and CSLDPC matrices. And we also verify that the data gathering via RLDPC matrix can reduce energy consumption of WSNs.展开更多
Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggreg...Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.展开更多
Recently,the application of Wireless Sensor Networks(WSNs)has been increasing rapidly.It requires privacy preserving data aggregation protocols to secure the data from compromises.Preserving privacy of the sensor data...Recently,the application of Wireless Sensor Networks(WSNs)has been increasing rapidly.It requires privacy preserving data aggregation protocols to secure the data from compromises.Preserving privacy of the sensor data is a challenging task.This paper presents a non-linear regression-based data aggregation protocol for preserving privacy of the sensor data.The proposed protocol uses non-linear regression functions to represent the sensor data collected from the sensor nodes.Instead of sending the complete data to the cluster head,the sensor nodes only send the coefficients of the non-linear function.This will reduce the communication overhead of the network.The data aggregation is performed on the masked coefficients and the sink node is able to retrieve the approximated results over the aggregated data.The analysis of experiment results shows that the proposed protocol is able to minimize communication overhead,enhance data aggregation accuracy,and preserve data privacy.展开更多
Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering pr...Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.展开更多
HashQuery,a Hash-area-based data dissemination protocol,was designed in wireless sensor networks. Using a Hash function which uses time as the key,both mobile sinks and sensors can determine the same Hash area. The se...HashQuery,a Hash-area-based data dissemination protocol,was designed in wireless sensor networks. Using a Hash function which uses time as the key,both mobile sinks and sensors can determine the same Hash area. The sensors can send the information about the events that they monitor to the Hash area and the mobile sinks need only to query that area instead of flooding among the whole network,and thus much energy can be saved. In addition,the location of the Hash area changes over time so as to balance the energy consumption in the whole network. Theoretical analysis shows that the proposed protocol can be energy-efficient and simulation studies further show that when there are 5 sources and 5 sinks in the network,it can save at least 50% energy compared with the existing two-tier data dissemination(TTDD) protocol,especially in large-scale wireless sensor networks.展开更多
With the increasing demand for marine exploration, underwater acoustic sensor networks (UASNs) are prone to have the characteristics of large-scale, long term monitoring, and high data traffic load. Underwater media a...With the increasing demand for marine exploration, underwater acoustic sensor networks (UASNs) are prone to have the characteristics of large-scale, long term monitoring, and high data traffic load. Underwater media access control (MAC) protocols, which allow multiple users to share the common medium fairly and efficiently, are essential for the performance of UASNs. However, the design of MAC protocols is confronted with the challenges of spatial unfairness, data eruption, and low energy efficiency. In this paper, we propose a novel data concurrent transmission (DCT) MAC protocol, which is able to exploit long propagation delay and conduct concurrent transmission. Specifically, we present the theoretical performance analysis of the proposed MAC protocol in detail and give an analytical solution of the success concurrent transmission probability between nodes. In addition, simulation results are provided to demonstrate that our proposed protocol is appropriate for UASNs and can significantly improve the performance in terms of network throughput and energy consumption. Finally, we give some typical future applications of UASNs and discuss the demands on MAC protocol design.展开更多
A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in ...A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in a coordinated way. Employing clustering techniques in such networks can achieve balanced energy consumption of member nodes and prolong the network lifetimes.In classical clustering techniques, clustering and in-cluster data routes are usually separated into independent operations. Although separate considerations of these two issues simplify the system design, it is often the non-optimal lifetime expectancy for wireless sensor networks. This paper proposes an integral framework that integrates these two correlated items in an interactive entirety. For that,we develop the clustering problems using nonlinear programming. Evolution process of clustering is provided in simulations. Results show that our joint-design proposal reaches the near optimal match between member nodes and cluster heads.展开更多
文摘Sensor networks provide means to link people with real world by processing data in real time collected from real-world and routing the query results to the right people. Application examples include continuous monitoring of environment, building infrastructures and human health. Many researchers view the sensor networks as databases, and the monitoring tasks are performed as subscriptions, queries, and alert. However, this point is not precise. First, databases can only deal with well-formed data types, with well-defined schema for their interpretation, while the raw data collected by the sensor networks, in most cases, do not fit to this requirement. Second, sensor networks have to deal with very dynamic targets, environment and resources, while databases are more static. In order to fill this gap between sensor networks and databases, we propose a novel approach, referred to as 'spatiotemporal data stream segmentation', or 'stream segmentation' for short, to address the dynamic nature and deal with 'raw' data of sensor networks. Stream segmentation is defined using Bayesian Networks in the context of sensor networks, and two application examples are given to demonstrate the usefulness of the approach.
基金supported by the National Natural Science Foundation of China under Grant Nos.U21A20464,62066005Innovation Project of Guangxi Graduate Education under Grant No.YCSW2024313.
文摘Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.
文摘Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these networks continue to grow in scale and complexity,the need for energy-efficient,scalable,and robust communication protocols becomes more critical than ever.Metaheuristic algorithms have shown significant promise in addressing these challenges,offering flexible and effective solutions for optimizing WSN performance.Among them,the Grey Wolf Optimizer(GWO)algorithm has attracted growing attention due to its simplicity,fast convergence,and strong global search capabilities.Accordingly,this survey provides an in-depth review of the applications of GWO and its variants for clustering,multi-hop routing,and hybrid cluster-based routing in WSNs.We categorize and analyze the existing GWO-based approaches across these key network optimization tasks,discussing the different problem formulations,decision variables,objective functions,and performance metrics used.In doing so,we examine standard GWO,multi-objective GWO,and hybrid GWO models that incorporate other computational intelligence techniques.Each method is evaluated based on how effectively it addresses the core constraints of WSNs,including energy consumption,communication overhead,and network lifetime.Finally,this survey outlines existing gaps in the literature and proposes potential future research directions aimed at enhancing the effectiveness and real-world applicability of GWO-based techniques for WSN clustering and routing.Our goal is to provide researchers and practitioners with a clear,structured understanding of the current state of GWO in WSNs and inspire further innovation in this evolving field.
文摘Multisensor data fusion （MDF） is an emerging technology to fuse data from multiple sensors in order to make a more accurate estimation of the environment through measurement and detection. Applications of MDF cross a wide spectrum in military and civilian areas. With the rapid evolution of computers and the proliferation of micro-mechanical/electrical systems sensors, the utilization of MDF is being popularized in research and applications. This paper focuses on application of MDF for high quality data analysis and processing in measurement and instrumentation. A practical, general data fusion scheme was established on the basis of feature extraction and merge of data from multiple sensors. This scheme integrates artificial neural networks for high performance pattern recognition. A number of successful applications in areas of NDI （Non-Destructive Inspection） corrosion detection, food quality and safety characterization, and precision agriculture are described and discussed in order to motivate new applications in these or other areas. This paper gives an overall picture of using the MDF method to increase the accuracy of data analysis and processing in measurement and instrumentation in different areas of applications.
基金ScientificResearchFoundationfortheReturnedOverseaChineseScholars State EducationMinistry
文摘An algorithm is presented for fusion of tracks created by radar and IR sensor which have different dimensional measurement data. It’s assumed that these sensors are asynchronous and the measurement data are transmitted to a central station at different rates. By means of the technique of time matching, two sets of asynchronous data are fused and then the filter is updated according to the fused information. The results show that the accuracy of the filter effect has been improved.
基金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 in part by Science & Technology Department of Shanghai (05dz15004)
文摘In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification problem of moving vehicles in wireless sensor networks using acoustic signals emitted from vehicles. Three algorithms including wavelet decomposition, weighted k-nearest-neighbor and Dempster-Shafer theory are combined in this paper. Finally, we use real world experimental data to validate the classification methods. The result shows that wavelet based feature extraction method can extract stable features from acoustic signals. By fusion with Dempster's rule, the classification performance is improved.
基金Supported by National Natural Science Foundation of China(60874063)Innovation and Scientific Research Foundation of Graduate Student of Heilongjiang Province(YJSCX2012-263HLJ)
文摘This paper deals with the problem of designing robust sequential covariance intersection(SCI)fusion Kalman filter for the clustering multi-agent sensor network system with measurement delays and uncertain noise variances.The sensor network is partitioned into clusters by the nearest neighbor rule.Using the minimax robust estimation principle,based on the worst-case conservative sensor network system with conservative upper bounds of noise variances,and applying the unbiased linear minimum variance(ULMV)optimal estimation rule,we present the two-layer SCI fusion robust steady-state Kalman filter which can reduce communication and computation burdens and save energy sources,and guarantee that the actual filtering error variances have a less-conservative upper-bound.A Lyapunov equation method for robustness analysis is proposed,by which the robustness of the local and fused Kalman filters is proved.The concept of the robust accuracy is presented and the robust accuracy relations of the local and fused robust Kalman filters are proved.It is proved that the robust accuracy of the global SCI fuser is higher than those of the local SCI fusers and the robust accuracies of all SCI fusers are higher than that of each local robust Kalman filter.A simulation example for a tracking system verifies the robustness and robust accuracy relations.
基金supported in part by the National Natural Science Foundation of China(No.61272084,61202004)the Natural Science Foundation of Jiangsu Province(No.BK20130096)the Project of Natural Science Research of Jiangsu University(No.14KJB520031,No.11KJA520002)
文摘Wireless sensor networks(WSNs)consist of a great deal of sensor nodes with limited power,computation,storage,sensing and communication capabilities.Data aggregation is a very important technique,which is designed to substantially reduce the communication overhead and energy expenditure of sensor node during the process of data collection in a WSNs.However,privacy-preservation is more challenging especially in data aggregation,where the aggregators need to perform some aggregation operations on sensing data it received.We present a state-of-the art survey of privacy-preserving data aggregation in WSNs.At first,we classify the existing privacy-preserving data aggregation schemes into different categories by the core privacy-preserving techniques used in each scheme.And then compare and contrast different algorithms on the basis of performance measures such as the privacy protection ability,communication consumption,power consumption and data accuracy etc.Furthermore,based on the existing work,we also discuss a number of open issues which may intrigue the interest of researchers for future work.
文摘Wireless Sensor Networks(WSNs) has become a popular research topic due to its resource constraints. Energy consumption and transmission delay is crucial requirement to be handled to enhance the popularity of WSNs. In order to overcome these issues, we have proposed an Efficient Packet Scheduling Technique for Data Merging in WSNs. Packet scheduling is done by using three levels of priority queue and to reduce the transmission delay. Real-time data packets are placed in high priority queue and Non real-time data packets based on local or remote data are placed on other queues. In this paper, we have used Time Division Multiple Access(TDMA) scheme to efficiently determine the priority of the packet at each level and transmit the data packets from lower level to higher level through intermediate nodes. To reduce the number of transmission, efficient data merge technique is used to merge the data packet in intermediate nodes which has same destination node. Data merge utilize the maximum packet size by appending the merged packets with received packets till the maximum packet size or maximum waiting time is reached. Real-time data packets are directly forwarded to the next node without applying data merge. The performance is evaluated under various metrics like packet delivery ratio, packet drop, energy consumption and delay based on changing the number of nodes and transmission rate. Our results show significant reduction in various performance metrics.
基金This work was supported by The National Natural Science Fund of China(Grant No.31670554)The Natural Science Foundation of Jiangsu Province of China(Grant No.BK20161527)+1 种基金We also received three Projects Funded by The Project funded by China Postdoctoral Science Foundation(Grant Nos.2018T110505,2017M611828)The Priority Academic Program Development(PAPD)of Jiangsu Higher Education Institutions.The authors wish to express their appreciation to the reviewers for their helpful suggestions which greatly improved the presentation of this paper.
文摘For rechargeable wireless sensor networks,limited energy storage capacity,dynamic energy supply,low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario.Therefore,before data delivery,a sensor has to update its waking schedule continuously and share them to its neighbors,which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets.In this work,we propose the maximum data generation rate routing protocol based on data flow controlling technology.For a sensor,it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors.Hence,the energy consumption for time synchronization,location information and waking schedule shared will be reduced significantly.The saving energy can be used for improving data collection rate.Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.
基金supported by the NSC under Grant No.NSC-101-2221-E-239-032 and NSC-102-2221-E-239-020
文摘Sensor nodes in a wireless sensor network （WSN） are typically powered by batteries, thus the energy is constrained. It is our design goal to efficiently utilize the energy of each sensor node to extend its lifetime, so as to prolong the lifetime of the whole WSN. In this paper, we propose a path-based data aggregation scheme （PBDAS） for grid-based wireless sensor networks. In order to extend the lifetime of a WSN, we construct a grid infrastructure by partitioning the whole sensor field into a grid of cells. Each cell has a head responsible for aggregating its own data with the data sensed by the others in the same cell and then transmitting out. In order to efficiently and rapidly transmit the data to the base station （BS）, we link each cell head to form a chain. Each cell head on the chain takes turn becoming the chain leader responsible for transmitting data to the BS. Aggregated data moves from head to head along the chain, and finally the chain leader transmits to the BS. In PBDAS, only the cell heads need to transmit data toward the BS. Therefore, the data transmissions to the BS substantially decrease. Besides, the cell heads and chain leader are designated in turn according to the energy level so that the energy depletion of nodes is evenly distributed. Simulation results show that the proposed PBDAS extends the lifetime of sensor nodes, so as to make the lifetime of the whole network longer.
基金The National Key R&D Program of China(No.2018YFB1500800)the Specialized Development Foundation for the Achievement Transformation of Jiangsu Province(No.BA2019025)+1 种基金Pre-Research Fund of Science and Technology on Near-Surface Detection Laboratory(No.6142414190405)the Open Project of the Key Laboratory of Wireless Sensor Network&Communication of Shanghai Institute of Microsystem and Information Technology,Chinese Academy of Sciences(No.20190907).
文摘In order to maximize the value of information(VoI)of collected data in unmanned aerial vehicle(UAV)-aided wireless sensor networks(WSNs),a UAV trajectory planning algorithm named maximum VoI first and successive convex approximation(MVF-SCA)is proposed.First,the Rician channel model is adopted in the system and sensor nodes(SNs)are divided into key nodes and common nodes.Secondly,the data collection problem is formulated as a mixed integer non-linear program(MINLP)problem.The problem is divided into two sub-problems according to the different types of SNs to seek a sub-optimal solution with a low complexity.Finally,the MVF-SCA algorithm for UAV trajectory planning is proposed,which can not only be used for daily data collection in the target area,but also collect time-sensitive abnormal data in time when the exception occurs.Simulation results show that,compared with the existing classic traveling salesman problem(TSP)algorithm and greedy path planning algorithm,the VoI collected by the proposed algorithm can be improved by about 15%to 30%.
基金supported by the National Natural Science Foundation of China(61307121)ABRP of Datong(2017127)the Ph.D.’s Initiated Research Projects of Datong University(2013-B-17,2015-B-05)
文摘A great challenge faced by wireless sensor networks(WSNs) is to reduce energy consumption of sensor nodes. Fortunately, the data gathering via random sensing can save energy of sensor nodes. Nevertheless, its randomness and density usually result in difficult implementations, high computation complexity and large storage spaces in practical settings. So the deterministic sparse sensing matrices are desired in some situations. However,it is difficult to guarantee the performance of deterministic sensing matrix by the acknowledged metrics. In this paper, we construct a class of deterministic sparse sensing matrices with statistical versions of restricted isometry property(St RIP) via regular low density parity check(RLDPC) matrices. The key idea of our construction is to achieve small mutual coherence of the matrices by confining the column weights of RLDPC matrices such that St RIP is satisfied. Besides, we prove that the constructed sensing matrices have the same scale of measurement numbers as the dense measurements. We also propose a data gathering method based on RLDPC matrix. Experimental results verify that the constructed sensing matrices have better reconstruction performance, compared to the Gaussian, Bernoulli, and CSLDPC matrices. And we also verify that the data gathering via RLDPC matrix can reduce energy consumption of WSNs.
基金Support by the National High Technology Research and Development Program of China(No.2012AA120802)the National Natural Science Foundation of China(No.61302074)+1 种基金Specialized Research Fund for the Doctoral Program of Higher Education(No.20122301120004)Natural Science Foundation of Heilongjiang Province(No.QC2013C061)
文摘Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.
文摘Recently,the application of Wireless Sensor Networks(WSNs)has been increasing rapidly.It requires privacy preserving data aggregation protocols to secure the data from compromises.Preserving privacy of the sensor data is a challenging task.This paper presents a non-linear regression-based data aggregation protocol for preserving privacy of the sensor data.The proposed protocol uses non-linear regression functions to represent the sensor data collected from the sensor nodes.Instead of sending the complete data to the cluster head,the sensor nodes only send the coefficients of the non-linear function.This will reduce the communication overhead of the network.The data aggregation is performed on the masked coefficients and the sink node is able to retrieve the approximated results over the aggregated data.The analysis of experiment results shows that the proposed protocol is able to minimize communication overhead,enhance data aggregation accuracy,and preserve data privacy.
基金Projects(61173169,61103203)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0798)supported by the Program for New Century Excellent Talents in University of ChinaProject supported by the Post-doctoral Program and the Freedom Explore Program of Central South University,China
文摘Energy-efficient data gathering in multi-hop wireless sensor networks was studied,considering that different node produces different amounts of data in realistic environments.A novel dominating set based clustering protocol (DSCP) was proposed to solve the data gathering problem in this scenario.In DSCP,a node evaluates the potential lifetime of the network (from its local point of view) assuming that it acts as the cluster head,and claims to be a tentative cluster head if it maximizes the potential lifetime.When evaluating the potential lifetime of the network,a node considers not only its remaining energy,but also other factors including its traffic load,the number of its neighbors,and the traffic loads of its neighbors.A tentative cluster head becomes a final cluster head with a probability inversely proportional to the number of tentative cluster heads that cover its neighbors.The protocol can terminate in O(n/lg n) steps,and its total message complexity is O(n2/lg n).Simulation results show that DSCP can effectively prolong the lifetime of the network in multi-hop networks with unbalanced traffic load.Compared with EECT,the network lifetime is prolonged by 56.6% in average.
基金Project(07JJ1010) supported by Hunan Provincial Natural Science Foundation of ChinaProjects(2006AA01Z202, 2006AA01Z199) supported by the National High-Tech Research and Development Program of China+2 种基金Project(7002102) supported by the City University of Hong Kong, Strategic Research Grant (SRG)Project(IRT-0661) supported by the Program for Changjiang Scholars and Innovative Research Team in UniversityProject(NCET-06-0686) supported by the Program for New Century Excellent Talents in University
文摘HashQuery,a Hash-area-based data dissemination protocol,was designed in wireless sensor networks. Using a Hash function which uses time as the key,both mobile sinks and sensors can determine the same Hash area. The sensors can send the information about the events that they monitor to the Hash area and the mobile sinks need only to query that area instead of flooding among the whole network,and thus much energy can be saved. In addition,the location of the Hash area changes over time so as to balance the energy consumption in the whole network. Theoretical analysis shows that the proposed protocol can be energy-efficient and simulation studies further show that when there are 5 sources and 5 sinks in the network,it can save at least 50% energy compared with the existing two-tier data dissemination(TTDD) protocol,especially in large-scale wireless sensor networks.
基金supported in part by the National Natural Science Foundation of China under Grant 62171405in part by the National Science Fund for Distinguished Young Scholars under Grant 62225114
文摘With the increasing demand for marine exploration, underwater acoustic sensor networks (UASNs) are prone to have the characteristics of large-scale, long term monitoring, and high data traffic load. Underwater media access control (MAC) protocols, which allow multiple users to share the common medium fairly and efficiently, are essential for the performance of UASNs. However, the design of MAC protocols is confronted with the challenges of spatial unfairness, data eruption, and low energy efficiency. In this paper, we propose a novel data concurrent transmission (DCT) MAC protocol, which is able to exploit long propagation delay and conduct concurrent transmission. Specifically, we present the theoretical performance analysis of the proposed MAC protocol in detail and give an analytical solution of the success concurrent transmission probability between nodes. In addition, simulation results are provided to demonstrate that our proposed protocol is appropriate for UASNs and can significantly improve the performance in terms of network throughput and energy consumption. Finally, we give some typical future applications of UASNs and discuss the demands on MAC protocol design.
基金supported by National Natural Science Foundation of China(Nos.61304131 and 61402147)Grant of China Scholarship Council(No.201608130174)+2 种基金Natural Science Foundation of Hebei Province(Nos.F2016402054 and F2014402075)the Scientific Research Plan Projects of Hebei Education Department(Nos.BJ2014019,ZD2015087 and QN2015046)the Research Program of Talent Cultivation Project in Hebei Province(No.A2016002023)
文摘A heterogeneous wireless sensor network comprises a number of inexpensive energy constrained wireless sensor nodes which collect data from the sensing environment and transmit them toward the improved cluster head in a coordinated way. Employing clustering techniques in such networks can achieve balanced energy consumption of member nodes and prolong the network lifetimes.In classical clustering techniques, clustering and in-cluster data routes are usually separated into independent operations. Although separate considerations of these two issues simplify the system design, it is often the non-optimal lifetime expectancy for wireless sensor networks. This paper proposes an integral framework that integrates these two correlated items in an interactive entirety. For that,we develop the clustering problems using nonlinear programming. Evolution process of clustering is provided in simulations. Results show that our joint-design proposal reaches the near optimal match between member nodes and cluster heads.
