Event region detection is the important application for wireless sensor networks(WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment n...Event region detection is the important application for wireless sensor networks(WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance(DFWD) is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.展开更多
In wireless sensor networks, data missing is a common problem due to sensor faults, time synchronization, malicious attacks, and communication malfunctions, which may degrade the network' s performance or lead to ine...In wireless sensor networks, data missing is a common problem due to sensor faults, time synchronization, malicious attacks, and communication malfunctions, which may degrade the network' s performance or lead to inefficient decisions. Therefore, it is necessary to effectively estimate the missing data. A double weighted least squares support vector machines (DWLS-SVM) model for the missing data estimation in wireless sensor networks is proposed in this paper. The algo- rithm first applies the weighted LS-SVM (WLS-SVM) to estimate the missing data on temporal do- main and spatial domain respectively, and then uses the weighted average of these two candidates as the final estimated value. DWLS-SVM considers the possibility of outliers in the dataset and utilizes spatio-temporal dependencies among sensor nodes fully, which makes the estimate more robust and precise. Experimental results on real world dataset demonstrate that the proposed algorithm is outli- er robust and can estimate the missing values accurately.展开更多
As the differences of sensor's precision and some random factors are difficult to control,the actual measurement signals are far from the target signals that affect the reliability and precision of rotating machinery...As the differences of sensor's precision and some random factors are difficult to control,the actual measurement signals are far from the target signals that affect the reliability and precision of rotating machinery fault diagnosis.The traditional signal processing methods,such as classical inference and weighted averaging algorithm usually lack dynamic adaptability that is easy for trends to cause the faults to be misjudged or left out.To enhance the measuring veracity and precision of vibration signal in rotary machine multi-sensor vibration signal fault diagnosis,a novel data level fusion approach is presented on the basis of correlation function analysis to fast determine the weighted value of multi-sensor vibration signals.The approach doesn't require knowing the prior information about sensors,and the weighted value of sensors can be confirmed depending on the correlation measure of real-time data tested in the data level fusion process.It gives greater weighted value to the greater correlation measure of sensor signals,and vice versa.The approach can effectively suppress large errors and even can still fuse data in the case of sensor failures because it takes full advantage of sensor's own-information to determine the weighted value.Moreover,it has good performance of anti-jamming due to the correlation measures between noise and effective signals are usually small.Through the simulation of typical signal collected from multi-sensors,the comparative analysis of dynamic adaptability and fault tolerance between the proposed approach and traditional weighted averaging approach is taken.Finally,the rotor dynamics and integrated fault simulator is taken as an example to verify the feasibility and advantages of the proposed approach,it is shown that the multi-sensor data level fusion based on correlation function weighted approach is better than the traditional weighted average approach with respect to fusion precision and dynamic adaptability.Meantime,the approach is adaptable and easy to use,can be applied to other areas of vibration measurement.展开更多
Binary sensor network(BSN) are becoming more attractive due to the low cost deployment,small size,low energy consumption and simple operation.There are two different ways for target tracking in BSN,the weighted algori...Binary sensor network(BSN) are becoming more attractive due to the low cost deployment,small size,low energy consumption and simple operation.There are two different ways for target tracking in BSN,the weighted algorithms and particle filtering algorithm.The weighted algorithms have good realtime property,however have poor estimation property and some of them does not suit for target’s variable velocity model.The particle filtering algorithm can estimate target's position more accurately with poor realtime property and is not suitable for target’s constant velocity model.In this paper distance weight is adopted to estimate the target’s position,which is different from the existing distance weight in other papers.On the analysis of principle of distance weight (DW),prediction-based distance weighted(PDW) algorithm for target tracking in BSN is proposed.Simulation results proved PDW fits for target's constant and variable velocity models with accurate estimation and good realtime property.展开更多
The underwater wireless sensor network(UWSN) has the features of mobility by drifting,less beacon nodes,longer time for localization and more energy consumption than the terrestrial sensor networks,which makes it more...The underwater wireless sensor network(UWSN) has the features of mobility by drifting,less beacon nodes,longer time for localization and more energy consumption than the terrestrial sensor networks,which makes it more difficult to locate the nodes in marine environment.Aiming at the characteristics of UWSN,a kind of cooperative range-free localization method based on weighted centroid localization(WCL) algorithm for three-dimensional UWSN is proposed.The algorithm assigns the cooperative weights for the beacon nodes according to the received acoustic signal strength,and uses the located unknown nodes as the new beacon nodes to locate the other unknown nodes,so a fast localization can be achieved for the whole sensor networks.Simulation results indicate this method has higher localization accuracy than the centroid localization algorithm,and it needs less beacon nodes and achieves higher rate of effective localization.展开更多
The reasonable measuring of particle weight and effective sampling of particle state are considered as two important aspects to obtain better estimation precision in particle filter.Aiming at the comprehensive treatme...The reasonable measuring of particle weight and effective sampling of particle state are considered as two important aspects to obtain better estimation precision in particle filter.Aiming at the comprehensive treatment of above problems,a novel two-stage prediction and update particle filtering algorithm based on particle weight optimization in multi-sensor observation is proposed.Firstly,combined with the construction of multi-senor observation likelihood function and the weight fusion principle,a new particle weight optimization strategy in multi-sensor observation is presented,and the reliability and stability of particle weight are improved by decreasing weight variance.In addition,according to the prediction and update mechanism of particle filter and unscented Kalman filter,a new realization of particle filter with two-stage prediction and update is given.The filter gain containing the latest observation information is used to directly optimize state estimation in the framework,which avoids a large calculation amount and the lack of universality in proposal distribution optimization way.The theoretical analysis and experimental results show the feasibility and efficiency of the proposed algorithm.展开更多
In this paper,an Adaptive-Weighted Time-Dimensional and Space-Dimensional(AWTDSD) data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving t...In this paper,an Adaptive-Weighted Time-Dimensional and Space-Dimensional(AWTDSD) data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving the accuracy of the data gathered in the network.AWTDSD contains three phases:(1) the time-dimensional aggregation phase for eliminating the data redundancy;(2) the adaptive-weighted aggregation phase for further aggregating the data as well as improving the accuracy of the aggregated data; and(3) the space-dimensional aggregation phase for reducing the size and the amount of the data transmission to the base station.AWTDSD utilizes the correlations between the sensed data for reducing the data transmission and increasing the data accuracy as well.Experimental result shows that AWTDSD can not only save almost a half of the total energy consumption but also greatly increase the accuracy of the data monitored by the sensors in the clustered network.展开更多
In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or...In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or cluster member. This causes the cluster or the whole network to be controlled by the malicious nodes. To offer high level of security, the mobile sensor nodes need to be authenticated. Further, clustering of nodes improves scalability, energy efficient routing and data delivery. In this paper, we propose a cluster based secure dynamic keying technique to authenticate the nodes during mobility. The nodes with high configuration are chosen as cluster heads based on the weight value which is estimated using parameters such as the node degree, average distance, node's average speed, and virtual battery power. The keys are dynamically generated and used for providing security. Even the keys are compromised by the attackers, they are not able to use the previous keys to cheat or disuse the authenticated nodes. In addition, a bidirectional malicious node detection technique is employed which eliminates the malicious node from the network. By simulation, it is proved that the proposed technique provides efficient security with reduced energy consumption during node mobility.展开更多
基金supported by the National Science Foundation for Outstanding Young Scientists (60425310)the Science Foundation for Post-doctoral Scientists of Central South University (2008)
文摘Event region detection is the important application for wireless sensor networks(WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance(DFWD) is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.
基金Supported by Basic Research Foundation of Beijing Institute of Technology (20070542009)
文摘In wireless sensor networks, data missing is a common problem due to sensor faults, time synchronization, malicious attacks, and communication malfunctions, which may degrade the network' s performance or lead to inefficient decisions. Therefore, it is necessary to effectively estimate the missing data. A double weighted least squares support vector machines (DWLS-SVM) model for the missing data estimation in wireless sensor networks is proposed in this paper. The algo- rithm first applies the weighted LS-SVM (WLS-SVM) to estimate the missing data on temporal do- main and spatial domain respectively, and then uses the weighted average of these two candidates as the final estimated value. DWLS-SVM considers the possibility of outliers in the dataset and utilizes spatio-temporal dependencies among sensor nodes fully, which makes the estimate more robust and precise. Experimental results on real world dataset demonstrate that the proposed algorithm is outli- er robust and can estimate the missing values accurately.
基金supported by National Hi-tech Research and Development Program of China (863 Program, Grant No. 2007AA04Z433)Hunan Provincial Natural Science Foundation of China (Grant No. 09JJ8005)Scientific Research Foundation of Graduate School of Beijing University of Chemical and Technology,China (Grant No. 10Me002)
文摘As the differences of sensor's precision and some random factors are difficult to control,the actual measurement signals are far from the target signals that affect the reliability and precision of rotating machinery fault diagnosis.The traditional signal processing methods,such as classical inference and weighted averaging algorithm usually lack dynamic adaptability that is easy for trends to cause the faults to be misjudged or left out.To enhance the measuring veracity and precision of vibration signal in rotary machine multi-sensor vibration signal fault diagnosis,a novel data level fusion approach is presented on the basis of correlation function analysis to fast determine the weighted value of multi-sensor vibration signals.The approach doesn't require knowing the prior information about sensors,and the weighted value of sensors can be confirmed depending on the correlation measure of real-time data tested in the data level fusion process.It gives greater weighted value to the greater correlation measure of sensor signals,and vice versa.The approach can effectively suppress large errors and even can still fuse data in the case of sensor failures because it takes full advantage of sensor's own-information to determine the weighted value.Moreover,it has good performance of anti-jamming due to the correlation measures between noise and effective signals are usually small.Through the simulation of typical signal collected from multi-sensors,the comparative analysis of dynamic adaptability and fault tolerance between the proposed approach and traditional weighted averaging approach is taken.Finally,the rotor dynamics and integrated fault simulator is taken as an example to verify the feasibility and advantages of the proposed approach,it is shown that the multi-sensor data level fusion based on correlation function weighted approach is better than the traditional weighted average approach with respect to fusion precision and dynamic adaptability.Meantime,the approach is adaptable and easy to use,can be applied to other areas of vibration measurement.
基金This work is supported by The National Science Fund for Distinguished Young Scholars (60725105) National Basic Research Program of China (973 Program) (2009CB320404)+5 种基金 Program for Changjiang Scholars and Innovative Research Team in University (IRT0852) The National Natural Science Foundation of China (60972048, 61072068) The Special Fund of State Key Laboratory (ISN01080301) The Major program of National Science and Technology (2009ZX03007- 004) Supported by the 111 Project (B08038) The Key Project of Chinese Ministry of Education (107103).
文摘Binary sensor network(BSN) are becoming more attractive due to the low cost deployment,small size,low energy consumption and simple operation.There are two different ways for target tracking in BSN,the weighted algorithms and particle filtering algorithm.The weighted algorithms have good realtime property,however have poor estimation property and some of them does not suit for target’s variable velocity model.The particle filtering algorithm can estimate target's position more accurately with poor realtime property and is not suitable for target’s constant velocity model.In this paper distance weight is adopted to estimate the target’s position,which is different from the existing distance weight in other papers.On the analysis of principle of distance weight (DW),prediction-based distance weighted(PDW) algorithm for target tracking in BSN is proposed.Simulation results proved PDW fits for target's constant and variable velocity models with accurate estimation and good realtime property.
基金National Nature Science Foundation of China(No.61273068)International Exchanges and Cooperation Projects of Shanghai Science and Technology Committee,China(No.15220721800)
文摘The underwater wireless sensor network(UWSN) has the features of mobility by drifting,less beacon nodes,longer time for localization and more energy consumption than the terrestrial sensor networks,which makes it more difficult to locate the nodes in marine environment.Aiming at the characteristics of UWSN,a kind of cooperative range-free localization method based on weighted centroid localization(WCL) algorithm for three-dimensional UWSN is proposed.The algorithm assigns the cooperative weights for the beacon nodes according to the received acoustic signal strength,and uses the located unknown nodes as the new beacon nodes to locate the other unknown nodes,so a fast localization can be achieved for the whole sensor networks.Simulation results indicate this method has higher localization accuracy than the centroid localization algorithm,and it needs less beacon nodes and achieves higher rate of effective localization.
基金Supported by the National Natural Science Foundations of China(No.61300214,61170243)the Science and Technology Innovation Team Support Plan of Education Department of Henan Province(No.13IRTSTHN021)+2 种基金the Science and Technology Research Key Project of Education Department of Henan Province(No.13A413066)the Basic and Frontier Technology Research Plan of Henan Province(No.132300410148)the Funding Scheme of Young Key Teacher of Henan Province Universities,and the Key Project of Teaching Reform Research of Henan University(No.HDXJJG2013-07)
文摘The reasonable measuring of particle weight and effective sampling of particle state are considered as two important aspects to obtain better estimation precision in particle filter.Aiming at the comprehensive treatment of above problems,a novel two-stage prediction and update particle filtering algorithm based on particle weight optimization in multi-sensor observation is proposed.Firstly,combined with the construction of multi-senor observation likelihood function and the weight fusion principle,a new particle weight optimization strategy in multi-sensor observation is presented,and the reliability and stability of particle weight are improved by decreasing weight variance.In addition,according to the prediction and update mechanism of particle filter and unscented Kalman filter,a new realization of particle filter with two-stage prediction and update is given.The filter gain containing the latest observation information is used to directly optimize state estimation in the framework,which avoids a large calculation amount and the lack of universality in proposal distribution optimization way.The theoretical analysis and experimental results show the feasibility and efficiency of the proposed algorithm.
基金Supported by the Promotive Research Fund for Excellent Young and Middle-aged Scientists of Shandong Province(No.BS2010DX010)the Project of Higher Educational Science and Technology Program of Shandong Province(No.J12LN36)
文摘In this paper,an Adaptive-Weighted Time-Dimensional and Space-Dimensional(AWTDSD) data aggregation algorithm for a clustered sensor network is proposed for prolonging the lifetime of the network as well as improving the accuracy of the data gathered in the network.AWTDSD contains three phases:(1) the time-dimensional aggregation phase for eliminating the data redundancy;(2) the adaptive-weighted aggregation phase for further aggregating the data as well as improving the accuracy of the aggregated data; and(3) the space-dimensional aggregation phase for reducing the size and the amount of the data transmission to the base station.AWTDSD utilizes the correlations between the sensed data for reducing the data transmission and increasing the data accuracy as well.Experimental result shows that AWTDSD can not only save almost a half of the total energy consumption but also greatly increase the accuracy of the data monitored by the sensors in the clustered network.
文摘In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or cluster member. This causes the cluster or the whole network to be controlled by the malicious nodes. To offer high level of security, the mobile sensor nodes need to be authenticated. Further, clustering of nodes improves scalability, energy efficient routing and data delivery. In this paper, we propose a cluster based secure dynamic keying technique to authenticate the nodes during mobility. The nodes with high configuration are chosen as cluster heads based on the weight value which is estimated using parameters such as the node degree, average distance, node's average speed, and virtual battery power. The keys are dynamically generated and used for providing security. Even the keys are compromised by the attackers, they are not able to use the previous keys to cheat or disuse the authenticated nodes. In addition, a bidirectional malicious node detection technique is employed which eliminates the malicious node from the network. By simulation, it is proved that the proposed technique provides efficient security with reduced energy consumption during node mobility.