Bioinspired evolutionary algorithm based for improving network coverage in wireless sensor networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Abbasi M
PROVIDER: S-EPMC3943197 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:With the wide application of wireless sensor networks in military and environmental monitoring, security issues have become increasingly prominent. Data exchanged over wireless sensor networks is vulnerable to malicious attacks due to the lack of physical defense equipment. Therefore, corresponding schemes of intrusion detection are urgently needed to defend against such attacks. Considering the serious class imbalance of the intrusion dataset, this paper proposes a method of using the synthetic minority oversampling technique (SMOTE) to balance the dataset and then uses the random forest algorithm to train the classifier for intrusion detection. The simulations are conducted on a benchmark intrusion dataset, and the accuracy of the random forest algorithm has reached 92.39%, which is higher than other comparison algorithms. After oversampling the minority samples, the accuracy of the random forest combined with the SMOTE has increased to 92.57%. This shows that the proposed algorithm provides an effective solution to solve the problem of class imbalance and improves the performance of intrusion detection.
| S-EPMC6339008 | biostudies-literature
Project description:Due to the high-energy efficiency and scalability, the clustering routing algorithm has been widely used in wireless sensor networks (WSNs). In order to gather information more efficiently, each sensor node transmits data to its Cluster Head (CH) to which it belongs, by multi-hop communication. However, the multi-hop communication in the cluster brings the problem of excessive energy consumption of the relay nodes which are closer to the CH. These nodes' energy will be consumed more quickly than the farther nodes, which brings the negative influence on load balance for the whole networks. Therefore, we propose an energy-efficient distributed clustering algorithm based on fuzzy approach with non-uniform distribution (EEDCF). During CHs' election, we take nodes' energies, nodes' degree and neighbor nodes' residual energies into consideration as the input parameters. In addition, we take advantage of Takagi, Sugeno and Kang (TSK) fuzzy model instead of traditional method as our inference system to guarantee the quantitative analysis more reasonable. In our scheme, each sensor node calculates the probability of being as CH with the help of fuzzy inference system in a distributed way. The experimental results indicate EEDCF algorithm is better than some current representative methods in aspects of data transmission, energy consumption and lifetime of networks.
| S-EPMC5539863 | biostudies-other
Project description:Limited energy resources of sensor nodes in Wireless Sensor Networks (WSNs) make energy consumption the most significant problem in practice. This paper proposes a novel, dynamic, self-organizing Hesitant Fuzzy Entropy-based Opportunistic Clustering and data fusion Scheme (HFECS) in order to overcome the energy consumption and network lifetime bottlenecks. The asynchronous working-sleeping cycle of sensor nodes could be exploited to make an opportunistic connection between sensor nodes in heterogeneous clustering. HFECS incorporates two levels of hierarchy in the network and energy heterogeneity is characterized using three levels of energy in sensor nodes. HFECS gathers local sensory data from sensor nodes and utilizes multi-attribute decision modeling and the entropy weight coefficient method for cluster formation and the cluster head election procedure. After cluster formation, HFECS uses the same techniques for performing data fusion at the first hierarchical level to reduce the redundant information flow from the first-second hierarchical levels, which can lead to an improvement in energy consumption, better utilization of bandwidth and extension of network lifetime. Our simulation results reveal that HFECS outperforms the existing benchmark schemes of heterogeneous clustering for larger network sizes in terms of half-life period, stability period, average residual energy, network lifetime, and packet delivery ratio.
| S-EPMC7038969 | biostudies-literature
Project description:Node placement is one of the basic problems in a Wireless Sensor Network (WSN). During the operation of a WSN, sensor nodes may fail or die suddenly, which may lead to a coverage hole. To solve this problem, the node placement needs to be re-optimized. The dimensions of node placement optimization are high because of the large node number. In view of this defect, a regional optimization dynamic algorithm is put forward. In this paper, the regional optimization problem of node placement is modeled, and a regional optimization dynamic algorithm with a mixed strategy for node placement (MRDA) is proposed. Simulation experiments are carried out for the proposed algorithm and other comparison algorithms. Results of experiments show that the proposed algorithm can greatly reduce the dimensions and narrow the search range, with a significant improvement in the search performance and convergence speed.
| S-EPMC7435444 | biostudies-literature
Project description:Sensor nodes perform missions based on the effectual invariable coverage of events, and it is commonly guaranteed by the determinate deployment for sensor nodes who deviate from the optimum site frequently. To reach the optimal coverage effect with the lowest costs is a primary goal of wireless sensor networks. In this paper, by splicing the sensing area optimally with cellular grids, the best deployment location for sensors and the required minimum number of them are revealed. The optimization problem of coverage rate and energy consumption is converted into a task assignment problem, and a dynamic partition algorithm for cellular grids is also proposed to improve the coverage effect when the number of sensors is variable. Furthermore, on the basis of solving the multi-objective problem of reducing and balancing the energy cost of sensors, the vampire bat optimizer is improved by introducing virtual bats and virtual preys, and finally solves the asymmetric assignment problem once the number of cellular grids is not equal to that of sensors. Simulation results indicate that the residual energy of sensors during redeployment is balanced notably by our strategy when compared to three other popular coverage-enhancement algorithms. Additionally, the total energy cost of sensor nodes and coverage rate can be optimized, and it also has a superior robustness when the number of nodes changes.
| S-EPMC7038011 | biostudies-literature
Project description:Sensor devices in wireless sensor networks are vulnerable to faults during their operation in unmonitored and hazardous environments. Though various methods have been proposed by researchers to detect sensor faults, only very few research studies have reported on capturing the dynamics of the inherent states in sensor data during fault occurrence. The continuous density hidden Markov model (CDHMM) is proposed in this research to determine the dynamics of the state transitions due to fault occurrence, while neural networks are utilized to classify the faults based on the state transition probability density generated by the CDHMM. Therefore, this paper focuses on the fault detection and classification using the hybridization of CDHMM and various neural networks (NNs), namely the learning vector quantization, probabilistic neural network, adaptive probabilistic neural network, and radial basis function. The hybrid models of each NN are used for the classification of sensor faults, namely bias, drift, random, and spike. The proposed methods are evaluated using four performance metrics which includes detection accuracy, false positive rate, F1-score, and the Matthews correlation coefficient. The simulation results show that the learning vector quantization NN classifier outperforms the detection accuracy rate when compared to the other classifiers. In addition, an ensemble NN framework based on the hybrid CDHMM classifier is built with majority voting scheme for decision making and classification. The results of the hybrid CDHMM ensemble classifiers clearly indicates the efficacy of the proposed scheme in capturing the dynamics of change of statesm which is the vital aspect in determining rapidly-evolving instant faults that occur in wireless sensor networks.
| S-EPMC7038388 | biostudies-literature
Project description:Wireless sensor networks (WSNs) have emerged as a promising solution for various applications due to their low cost and easy deployment. Typically, their limited power capability, i.e., battery powered, make WSNs encounter the challenge of extension of network lifetime. Many hierarchical protocols show better ability of energy efficiency in the literature. Besides, data reduction based on the correlation of sensed readings can efficiently reduce the amount of required transmissions. Therefore, we use a sub-clustering procedure based on spatial data correlation to further separate the hierarchical (clustered) architecture of a WSN. The proposed algorithm (2TC-cor) is composed of two procedures: the prediction model construction procedure and the sub-clustering procedure. The energy conservation benefits by the reduced transmissions, which are dependent on the prediction model. Also, the energy can be further conserved because of the representative mechanism of sub-clustering. As presented by simulation results, it shows that 2TC-cor can effectively conserve energy and monitor accurately the environment within an acceptable level.
| S-EPMC4279565 | biostudies-other
Project description:Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing.
| S-EPMC4327090 | biostudies-other
Project description:The Global Positioning System (GPS) is unable to provide precise localization services indoors, which has led to wireless sensor network (WSN) localization technology becoming a hot research issue in the field of indoor location. At present, the ranging technology of wireless sensor networks based on received signal strength has been extensively used in indoor positioning. However, wireless signals have serious multipath effects in indoor environments. In order to reduce the adverse influence of multipath effects on distance estimation between nodes, a multi-channel ranging localization algorithm based on signal diversity is herein proposed. In real indoor environments, the parameters used for multi-channel localization algorithms are generally unknown or time-varying. In order to increase the positioning accuracy of the multi-channel location algorithm in a multipath environment, we propose an optimal multi-channel trilateration positioning algorithm (OMCT) by establishing a novel multi-objective evolutionary model. The presented algorithm utilizes a three-edge constraint to prevent the traditional multi-channel localization algorithm falling into local optima. The results of a large number of practical experiments and numerical simulations show that no matter how the channel number and multipath number change, the positioning error of our presented algorithm is always smaller compared with that of the state-of-the-art algorithm.
| S-EPMC7146489 | biostudies-literature
Project description:This paper presents a leader-based approach to routing in Mobile Wireless Sensor Networks (MWSN). Using local information from neighbour nodes, a leader election mechanism maintains a spanning tree in order to provide the necessary adaptations for efficient routing upon the connectivity changes resulting from the mobility of sensors or sink nodes. We present two protocols following the leader election approach, which have been implemented using Castalia and OMNeT++. The protocols have been evaluated, besides other reference MWSN routing protocols, to analyse the impact of network size and node velocity on performance, which has demonstrated the validity of our approach.
| S-EPMC5539741 | biostudies-other