The problem of intrusion detection has new solutions, thanks to the widespread use of machine learning in the field of network security, but it still has a few issues at this time. Traditional machine learning techniques to intrusion detection rely on expert experience to choose features, and deep learning approaches have a low detection efficiency. In this paper, an intrusion detection model based on feature selection and improved one-dimensional convolutional neural network was proposed. This model first used the extreme gradient boosting decision tree (XGboost) algorithm to sort the preprocessed data, and then it used comparison to weed out 55 features with a higher contribution. Then, the extracted features were fed into the improved one-dimensional convolutional neural network (I1DCNN), and this network training was used to complete the final classification task. The feature selection and improved one-dimensional convolutional neural network (FS-I1DCNN) intrusion detection model not only solved the traditional machine learning method of relying on expert experience to extract features but also improved the detection efficiency of the model, reduced the training time while reducing the dimension, and increased the overall accuracy. In comparison to the I1DCNN model without feature extraction and the conventional one-dimensional convolutional neural network (1DCNN) model, the experimental results demonstrate that the FS-I1DCNN model’s overall accuracy increases by 0.67% and 2.94%, respectively. Its accuracy, precision, recall, and F1-score were significantly better than those of the other intrusion detection models, including SVM and DBN.
{"title":"An Intrusion Detection Model Based on Feature Selection and Improved One-Dimensional Convolutional Neural Network","authors":"Qingfeng Li, Bo Li, Linzhi Wen","doi":"10.1155/2023/1982173","DOIUrl":"https://doi.org/10.1155/2023/1982173","url":null,"abstract":"The problem of intrusion detection has new solutions, thanks to the widespread use of machine learning in the field of network security, but it still has a few issues at this time. Traditional machine learning techniques to intrusion detection rely on expert experience to choose features, and deep learning approaches have a low detection efficiency. In this paper, an intrusion detection model based on feature selection and improved one-dimensional convolutional neural network was proposed. This model first used the extreme gradient boosting decision tree (XGboost) algorithm to sort the preprocessed data, and then it used comparison to weed out 55 features with a higher contribution. Then, the extracted features were fed into the improved one-dimensional convolutional neural network (I1DCNN), and this network training was used to complete the final classification task. The feature selection and improved one-dimensional convolutional neural network (FS-I1DCNN) intrusion detection model not only solved the traditional machine learning method of relying on expert experience to extract features but also improved the detection efficiency of the model, reduced the training time while reducing the dimension, and increased the overall accuracy. In comparison to the I1DCNN model without feature extraction and the conventional one-dimensional convolutional neural network (1DCNN) model, the experimental results demonstrate that the FS-I1DCNN model’s overall accuracy increases by 0.67% and 2.94%, respectively. Its accuracy, precision, recall, and F1-score were significantly better than those of the other intrusion detection models, including SVM and DBN.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":"43 25","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138952556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Received signal strength- (RSS-) based localization in wireless sensor networks (WSNs) has attracted significant attention due to its advantages of low cost and simple implementation. In practice, RSS measurements may suffer from sensor biases, which deteriorates the localization accuracy. However, most of the existing localization methods are designed for bias-free measurements. In this paper, we propose a convex combination method for RSS localization in the presence of sensor biases. The parameter vector composed of unknown location and sensor biases is estimated simultaneously by using a convex combination of some virtual points. These virtual points form a convex hull, into which the parameter vector falls with large probability. By this, the original nonconvex estimation problem is converted to be convex. Numerical examples demonstrate the superiority of the proposed method in terms of localization accuracy, compared to the existing semidefinite programming (SDP) methods.
{"title":"Convex Combination for Wireless Localization Using Biased RSS Measurements","authors":"Qi Wang, Fei Li, Teng Shao, Chao Xu","doi":"10.1155/2023/8931636","DOIUrl":"https://doi.org/10.1155/2023/8931636","url":null,"abstract":"Received signal strength- (RSS-) based localization in wireless sensor networks (WSNs) has attracted significant attention due to its advantages of low cost and simple implementation. In practice, RSS measurements may suffer from sensor biases, which deteriorates the localization accuracy. However, most of the existing localization methods are designed for bias-free measurements. In this paper, we propose a convex combination method for RSS localization in the presence of sensor biases. The parameter vector composed of unknown location and sensor biases is estimated simultaneously by using a convex combination of some virtual points. These virtual points form a convex hull, into which the parameter vector falls with large probability. By this, the original nonconvex estimation problem is converted to be convex. Numerical examples demonstrate the superiority of the proposed method in terms of localization accuracy, compared to the existing semidefinite programming (SDP) methods.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":"5 9","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139169671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Synchronous positioning and mapping mainly realize the functions of self-positioning and environment map construction for intelligent navigation technology. In order to solve the problems of low positioning accuracy and poor mapping effect of existing SLAM (simultaneous localization and mapping) systems in indoor dynamic environments and to improve the positioning accuracy, timeliness, and robustness of visual SLAM systems in dynamic environments, an improved visual SLAM method is proposed. Aiming at the inconsistency between the direction of dynamic objects and static background optical flow, this method adopts a high-real-time dynamic region mask detection algorithm to eliminate the feature points in the dynamic region mask, remove the camera motion optical flow according to the original feature information, and then cluster the optical flow amplitude of dynamic objects so as to realize the dynamic region mask detection and eliminate the dynamic signpost points combined with the polar geometric constraints. In order to verify the effectiveness of the improved algorithm, the three evaluation indexes of system accuracy, real-time performance, and the amount of drift are analyzed and verified, respectively, on the TUM dataset. The results show that the proposed algorithm not only has good real-time performance but also improves the accuracy of the system and reduces the amount of drift.
{"title":"Research on Visual SLAM Navigation Techniques for Dynamic Environments","authors":"Tongjun Wang, Peijun Zhao","doi":"10.1155/2023/2025844","DOIUrl":"https://doi.org/10.1155/2023/2025844","url":null,"abstract":"Synchronous positioning and mapping mainly realize the functions of self-positioning and environment map construction for intelligent navigation technology. In order to solve the problems of low positioning accuracy and poor mapping effect of existing SLAM (simultaneous localization and mapping) systems in indoor dynamic environments and to improve the positioning accuracy, timeliness, and robustness of visual SLAM systems in dynamic environments, an improved visual SLAM method is proposed. Aiming at the inconsistency between the direction of dynamic objects and static background optical flow, this method adopts a high-real-time dynamic region mask detection algorithm to eliminate the feature points in the dynamic region mask, remove the camera motion optical flow according to the original feature information, and then cluster the optical flow amplitude of dynamic objects so as to realize the dynamic region mask detection and eliminate the dynamic signpost points combined with the polar geometric constraints. In order to verify the effectiveness of the improved algorithm, the three evaluation indexes of system accuracy, real-time performance, and the amount of drift are analyzed and verified, respectively, on the TUM dataset. The results show that the proposed algorithm not only has good real-time performance but also improves the accuracy of the system and reduces the amount of drift.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44570704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Data security and privacy protection are critical challenges that constrain the advancement of edge computing. Similarly, blockchain technology faces constraints in addressing security issues linked with edge computing due to its scalability limitations. To tackle these challenges and promote the development of blockchain technology, this paper presents a scheme that enhances privacy data protection in blockchain smart contracts using edge computing and a master-slave multichain architecture. Firstly, we propose a master-slave multichain architecture based on the traditional single chain and integrate it with a three-layer edge computing structure to address security issues on the edge side. We also design a signature authentication scheme utilizing ECC integrated with blockchain encryption technology. Secondly, we incorporate the role-based access control (RBAC) model with smart contracts to finely divide user privileges, construct an interdomain role-based access control (ID-RBAC) model, and provide detailed access authentication process designs for both within and between domains. Finally, experimental results demonstrate that our proposed scheme can effectively resist various attacks, significantly improve algorithm efficiency, and maintain a system overhead of less than 160 p, with a maximum transaction throughput of nearly 310 tx/s.
{"title":"Improved Private Data Protection Scheme for Blockchain Smart Contracts","authors":"Sheng Hu","doi":"10.1155/2023/5963039","DOIUrl":"https://doi.org/10.1155/2023/5963039","url":null,"abstract":"Data security and privacy protection are critical challenges that constrain the advancement of edge computing. Similarly, blockchain technology faces constraints in addressing security issues linked with edge computing due to its scalability limitations. To tackle these challenges and promote the development of blockchain technology, this paper presents a scheme that enhances privacy data protection in blockchain smart contracts using edge computing and a master-slave multichain architecture. Firstly, we propose a master-slave multichain architecture based on the traditional single chain and integrate it with a three-layer edge computing structure to address security issues on the edge side. We also design a signature authentication scheme utilizing ECC integrated with blockchain encryption technology. Secondly, we incorporate the role-based access control (RBAC) model with smart contracts to finely divide user privileges, construct an interdomain role-based access control (ID-RBAC) model, and provide detailed access authentication process designs for both within and between domains. Finally, experimental results demonstrate that our proposed scheme can effectively resist various attacks, significantly improve algorithm efficiency, and maintain a system overhead of less than 160 p, with a maximum transaction throughput of nearly 310 tx/s.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48241240","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a method to identify the damages in frame structures with slender beams. This method adjusts the parameters of the structure to match the analytical and the measured displacements. The effect of transverse shear deformation on the nodal analytical displacement is analyzed, and the parameter identification of frame structures with slender beams is performed. The results demonstrate that parameter-identification accuracy can be considerably improved by considering the transverse shear deformation in the frame structure with slender beams. The proposed method can accurately identify the damages in frame structures with slender beams using displacement measurements.
{"title":"Parameter Identification of Frame Structures by considering Shear Deformation","authors":"F. Xiao, Weiwei Zhu, Xiangwei Meng, Gang S. Chen","doi":"10.1155/2023/6631716","DOIUrl":"https://doi.org/10.1155/2023/6631716","url":null,"abstract":"This paper presents a method to identify the damages in frame structures with slender beams. This method adjusts the parameters of the structure to match the analytical and the measured displacements. The effect of transverse shear deformation on the nodal analytical displacement is analyzed, and the parameter identification of frame structures with slender beams is performed. The results demonstrate that parameter-identification accuracy can be considerably improved by considering the transverse shear deformation in the frame structure with slender beams. The proposed method can accurately identify the damages in frame structures with slender beams using displacement measurements.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45531819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Chandra Prakash, Anurag Barthwal, S. Avikal, Gyanendra Kumar Singh
Internet of Things abstracts the ability to remotely associate and observe things or objects over the Internet. When it comes to agriculture, this idea has been incorporated to make agriculture-related tasks smart, secure, and automated. Agriculture is vital for economic growth and also for the survival of humans. Farmers living in rural areas of India face a common problem of the theft of equipment like induction motors from small storage houses meant for storing commodities in crop fields. In this study, we present a remote security management framework for monitoring the crop field storage house, known as the farm security alert system (FSAS). FSAS is a small, energy efficient, low cost, and accurate security management system that uses microcontroller-based passive infrared (PIR) sensor and global system for mobile communication (GSM) module to generate an alert to the farm owner if there is an intrusion event at the crop field store. The microcontroller board utilized in the proposed model is the Arduino Uno, and PIR motion sensor is used to recognize the intruder. In addition, FSAS also can be used for monitoring of induction motor by utilizing a similar arrangement of sensors. The sensor signal is transmitted to the cloud whenever the intruder is within the sensing range of the sensor node. Naive Bayes’ prediction model is used to identify the level of encroachment as no (green), mild (yellow), or high (red) threat. The status and the alarms can be received by the farm owners, either on their smartphones as application alerts or as a short message/phone call, at any distance, and independent of whether their cell phones are connected to the Internet.
{"title":"FSAS: An IoT-Based Security System for Crop Field Storage","authors":"Chandra Prakash, Anurag Barthwal, S. Avikal, Gyanendra Kumar Singh","doi":"10.1155/2023/2367167","DOIUrl":"https://doi.org/10.1155/2023/2367167","url":null,"abstract":"Internet of Things abstracts the ability to remotely associate and observe things or objects over the Internet. When it comes to agriculture, this idea has been incorporated to make agriculture-related tasks smart, secure, and automated. Agriculture is vital for economic growth and also for the survival of humans. Farmers living in rural areas of India face a common problem of the theft of equipment like induction motors from small storage houses meant for storing commodities in crop fields. In this study, we present a remote security management framework for monitoring the crop field storage house, known as the farm security alert system (FSAS). FSAS is a small, energy efficient, low cost, and accurate security management system that uses microcontroller-based passive infrared (PIR) sensor and global system for mobile communication (GSM) module to generate an alert to the farm owner if there is an intrusion event at the crop field store. The microcontroller board utilized in the proposed model is the Arduino Uno, and PIR motion sensor is used to recognize the intruder. In addition, FSAS also can be used for monitoring of induction motor by utilizing a similar arrangement of sensors. The sensor signal is transmitted to the cloud whenever the intruder is within the sensing range of the sensor node. Naive Bayes’ prediction model is used to identify the level of encroachment as no (green), mild (yellow), or high (red) threat. The status and the alarms can be received by the farm owners, either on their smartphones as application alerts or as a short message/phone call, at any distance, and independent of whether their cell phones are connected to the Internet.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44391148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Received signal strength- (RSS-) based localization has attracted considerable attention for its low cost and easy implementation. In plenty of existing work, sensor positions, which play an important role in source localization, are usually assumed perfectly known. Unfortunately, they are often subject to uncertainties, which directly leads to effect on localization result. To tackle this problem, we study the RSS-based source localization with sensor position uncertainty. Sensor position uncertainty will be modeled as two types: Gaussian random variable and unknown nonrandom variable. For either of the models, two semidefinite programming (SDP) methods are proposed, i.e., SDP-1 and SDP-2. The SDP-1 method proceeds from the nonconvex problem with respect to the maximum likelihood (ML) estimation and then obtains an SDP problem using proper approximation and relaxation. The SDP-2 method first transfers the sensor position uncertainties to the source position and then obtains an SDP formulation following a similar idea as in SDP-1 method. Numerical examples demonstrate the performance superiority of the proposed methods, compared to some existing methods assuming perfect sensor position information.
{"title":"Source Localization Using RSS Measurements with Sensor Position Uncertainty","authors":"Qi Wang, Xianqing Li","doi":"10.1155/2023/9274297","DOIUrl":"https://doi.org/10.1155/2023/9274297","url":null,"abstract":"Received signal strength- (RSS-) based localization has attracted considerable attention for its low cost and easy implementation. In plenty of existing work, sensor positions, which play an important role in source localization, are usually assumed perfectly known. Unfortunately, they are often subject to uncertainties, which directly leads to effect on localization result. To tackle this problem, we study the RSS-based source localization with sensor position uncertainty. Sensor position uncertainty will be modeled as two types: Gaussian random variable and unknown nonrandom variable. For either of the models, two semidefinite programming (SDP) methods are proposed, i.e., SDP-1 and SDP-2. The SDP-1 method proceeds from the nonconvex problem with respect to the maximum likelihood (ML) estimation and then obtains an SDP problem using proper approximation and relaxation. The SDP-2 method first transfers the sensor position uncertainties to the source position and then obtains an SDP formulation following a similar idea as in SDP-1 method. Numerical examples demonstrate the performance superiority of the proposed methods, compared to some existing methods assuming perfect sensor position information.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42181897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Maintaining good connectivity is a major concern when constructing a robust flying mesh network, known as FlyMesh. In a FlyMesh, multiple unmanned aerial vehicles (UAVs) collaborate to provide continuous network service for mobile devices on the ground. To determine the connectivity probability of the aerial link between two UAVs, the Poisson point process (PPP) is used to describe the spatial distribution of UAVs equipped with omnidirectional antennas. However, the PPP fails to reflect the fact that there is a minimum distance restriction between two neighboring UAVs. In this paper, the β -Ginibre point process ( β -GPP) is adopted to model the spatial distribution of UAVs, with β representing the repulsion between nearby UAVs. Additionally, a large-scale fading method is used to model the route channel between UAVs equipped with directional antennas, allowing the monitoring of the impact of signal interference on network connectivity. Based on the β -GPP model, an analytical expression for the connectivity probability is derived. Numerical tests are conducted to demonstrate the effects of repulsion factor β , UAV intensity ρ , and beamwidth θ on network connectivity. The results indicate that an increase in UAV intensity decreases network connectivity when the repulsion factor β remains constant. These findings provide valuable insights for enhancing the service quality of the FlyMesh.
{"title":"Modeling and Performance Analysis of Flying Mesh Network","authors":"Shenghong Qin, Renhui Xu, Laixian Peng, Xingchen Wei, Xiaohui Wu","doi":"10.1155/2023/8815835","DOIUrl":"https://doi.org/10.1155/2023/8815835","url":null,"abstract":"Maintaining good connectivity is a major concern when constructing a robust flying mesh network, known as FlyMesh. In a FlyMesh, multiple unmanned aerial vehicles (UAVs) collaborate to provide continuous network service for mobile devices on the ground. To determine the connectivity probability of the aerial link between two UAVs, the Poisson point process (PPP) is used to describe the spatial distribution of UAVs equipped with omnidirectional antennas. However, the PPP fails to reflect the fact that there is a minimum distance restriction between two neighboring UAVs. In this paper, the \u0000 \u0000 β\u0000 \u0000 -Ginibre point process (\u0000 \u0000 β\u0000 \u0000 -GPP) is adopted to model the spatial distribution of UAVs, with \u0000 \u0000 β\u0000 \u0000 representing the repulsion between nearby UAVs. Additionally, a large-scale fading method is used to model the route channel between UAVs equipped with directional antennas, allowing the monitoring of the impact of signal interference on network connectivity. Based on the \u0000 \u0000 β\u0000 \u0000 -GPP model, an analytical expression for the connectivity probability is derived. Numerical tests are conducted to demonstrate the effects of repulsion factor \u0000 \u0000 β\u0000 \u0000 , UAV intensity \u0000 \u0000 ρ\u0000 \u0000 , and beamwidth \u0000 \u0000 θ\u0000 \u0000 on network connectivity. The results indicate that an increase in UAV intensity decreases network connectivity when the repulsion factor \u0000 \u0000 β\u0000 \u0000 remains constant. These findings provide valuable insights for enhancing the service quality of the FlyMesh.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45545408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lianhui Jia, Lijie Jiang, Yongliang Wen, Hongchao Wang
Timely and effective feature extraction is the key for fault diagnosis of rolling element bearing (REB). However, fault feature extraction will become very difficult in the early weak fault stage of REB due to the interference of strong background noise. To solve the above difficulty, a two-stage feature extraction method for early weak fault of REB is proposed, which mainly combines feature mode decomposition (FMD) with a blind deconvolution (BD) method. Firstly, based on the impulsiveness and cyclostationary characteristics of the vibration signal of faulty REB, FMD is used to decompose the complex original vibration signal into several modes containing single component. Subsequently, the sparse index (SI) is calculated for each mode, and the mode containing sensitive fault feature is selected for further analysis. Subsequently, apply the deconvolution method on the selected mode for further enhancing the impulsive characteristic. At last, traditional envelope spectrum (ES) analysis is applied on the filtered signal, and satisfactory fault features are extracted. Effectiveness and advantages of the proposed method are verified through experimental and engineering signals of REBs.
{"title":"Weak Fault Feature Extraction for Rolling Element Bearing Based on a Two-Stage Method","authors":"Lianhui Jia, Lijie Jiang, Yongliang Wen, Hongchao Wang","doi":"10.1155/2023/6671730","DOIUrl":"https://doi.org/10.1155/2023/6671730","url":null,"abstract":"Timely and effective feature extraction is the key for fault diagnosis of rolling element bearing (REB). However, fault feature extraction will become very difficult in the early weak fault stage of REB due to the interference of strong background noise. To solve the above difficulty, a two-stage feature extraction method for early weak fault of REB is proposed, which mainly combines feature mode decomposition (FMD) with a blind deconvolution (BD) method. Firstly, based on the impulsiveness and cyclostationary characteristics of the vibration signal of faulty REB, FMD is used to decompose the complex original vibration signal into several modes containing single component. Subsequently, the sparse index (SI) is calculated for each mode, and the mode containing sensitive fault feature is selected for further analysis. Subsequently, apply the deconvolution method on the selected mode for further enhancing the impulsive characteristic. At last, traditional envelope spectrum (ES) analysis is applied on the filtered signal, and satisfactory fault features are extracted. Effectiveness and advantages of the proposed method are verified through experimental and engineering signals of REBs.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":" ","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46179792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wireless rechargeable sensor network (WRSN) uses mobile chargers (MCs) to charge sensor nodes wirelessly to solve the energy problems faced by traditional wireless sensor network. In WRSN, mobile charging schemes with multiple MCs supplementing energy are quite common. How to properly plan the MC’s moving path to reduce the charge energy loss and deploy nodes to improve network coverage rate has become a huge research challenge. In this paper, a collaborative energy optimization algorithm (CEOA) is proposed for multiple chargers based on k-mean++ and node collaborative scheduling. The CEOA combines internal energy optimization and external device power supply, effectively prolongs network lifetime, and improves network coverage rate. It uses the k-mean++ to cluster nodes in the network; then, the nodes in the network are scheduled to sleep based on the confident information coverage (CIC) model. Finally, the CEOA uses a main mobile charger to carry multiple auxiliary mobile chargers to charge all the nodes in the cluster. Simulation results show that the proposed algorithm increases the network lifetime by more than 8 times and the coverage rate by about 20%.
{"title":"Collaborative Energy Optimization of Multiple Chargers Based on Node Collaborative Scheduling","authors":"Minghua Wang, Yingcong Zeng, Jiaqing Li, Yan Wang","doi":"10.1155/2023/5092972","DOIUrl":"https://doi.org/10.1155/2023/5092972","url":null,"abstract":"Wireless rechargeable sensor network (WRSN) uses mobile chargers (MCs) to charge sensor nodes wirelessly to solve the energy problems faced by traditional wireless sensor network. In WRSN, mobile charging schemes with multiple MCs supplementing energy are quite common. How to properly plan the MC’s moving path to reduce the charge energy loss and deploy nodes to improve network coverage rate has become a huge research challenge. In this paper, a collaborative energy optimization algorithm (CEOA) is proposed for multiple chargers based on k-mean++ and node collaborative scheduling. The CEOA combines internal energy optimization and external device power supply, effectively prolongs network lifetime, and improves network coverage rate. It uses the k-mean++ to cluster nodes in the network; then, the nodes in the network are scheduled to sleep based on the confident information coverage (CIC) model. Finally, the CEOA uses a main mobile charger to carry multiple auxiliary mobile chargers to charge all the nodes in the cluster. Simulation results show that the proposed algorithm increases the network lifetime by more than 8 times and the coverage rate by about 20%.","PeriodicalId":50327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":"1 1","pages":""},"PeriodicalIF":2.3,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41511003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：