Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Regional Optimization Dynamic Algorithm for Node Placement in Wireless Sensor Networks.

ABSTRACT: 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.

SUBMITTER: Zhang Y

PROVIDER: S-EPMC7435444 | biostudies-literature | 2020 Jul

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Regional Optimization Dynamic Algorithm for Node Placement in Wireless Sensor Networks.

Zhang Yijie Y Liu Mandan M

Sensors (Basel, Switzerland) 20200729 15

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 modele ...[more]

PMID: 32751235

Similar Datasets

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

Project description:Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

| S-EPMC5539723 | biostudies-other

Algorithm for wireless sensor networks in ginseng field in precision agriculture.

Project description:In the research on energy-efficient networking methods for precision agriculture, a hot topic is the energy issue of sensing nodes for individual wireless sensor networks. The sensing nodes of the wireless sensor network should be enabled to provide better services with limited energy to support wide-range and multi-scenario acquisition and transmission of three-dimensional crop information. Further, the life cycle of the sensing nodes should be maximized under limited energy. The transmission direction and node power consumption are considered, and the forward and high-energy nodes are selected as the preferred cluster heads or data-forwarding nodes. Taking the cropland cultivation of ginseng as the background, we put forward a particle swarm optimization-based networking algorithm for wireless sensor networks with excellent performance. This algorithm can be used for precision agriculture and achieve optimal equipment configuration in a network under limited energy, while ensuring reliable communication in the network. The node scale is configured as 50 to 300 nodes in the range of 500 × 500 m2, and simulated testing is conducted with the LEACH, BCDCP, and ECHERP routing protocols. Compared with the existing LEACH, BCDCP, and ECHERP routing protocols, the proposed networking method can achieve the network lifetime prolongation and mitigate the decreased degree and decreasing trend of the distance between the sensing nodes and center nodes of the sensor network, which results in a longer network life cycle and stronger environment suitability. It is an effective method that improves the sensing node lifetime for a wireless sensor network applied to cropland cultivation of ginseng.

| S-EPMC8820603 | biostudies-literature

Wireless optimization for sensor networks using IoT-based clustering and routing algorithms.

Project description:Wireless sensor networks (WSN) are among the most prominent current technologies. Its popularity has skyrocketed because of its capacity to operate in difficult situations. The WSN market encompasses various industries, including building automation, security networks, healthcare systems, logistics, and military operations. Therefore, increasing the energy efficiency of these networks is of utmost importance. Hierarchical topology, which typically uses a clustering methodology, is one of the most well-known methods for WSN energy optimization. To achieve energy efficiency in WSN, hierarchical topology low-energy adaptive clustering hierarchy (LEACH) was first introduced, and this served as the foundation. However, conventional LEACH has several limitations, which have led to extensive research into improving LEACH's efficacy in its current form. The use of particular algorithms and strategies to enhance the functionality of the conventional LEACH protocol forms the basis of ongoing efforts. Utilizing this enhanced LEACH, performance in terms of throughput and network life may be enhanced by concentrating on elements such as cluster head formation and transmission energy consumption. The enhanced LEACH algorithm demonstrates significant improvements in both throughput and network lifetime compared with conventional LEACH. Through rigorous experimentation, it was found that the enhanced algorithm increases the throughput by 25% on average, which is attributed to its dynamic clustering and optimized routing strategies. Furthermore, the network lifetime is extended by approximately 30%, primarily because of enhanced energy efficiency through adaptive clustering and transmission power control.

| S-EPMC11232628 | biostudies-literature

Wireless Sensor Networks Intrusion Detection Based on SMOTE and the Random Forest Algorithm.

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

Fuzzy-Logic Based Distributed Energy-Efficient Clustering Algorithm for Wireless Sensor Networks.

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

Bioinspired evolutionary algorithm based for improving network coverage in wireless sensor networks.

Project description:Wireless sensor networks (WSNs) include sensor nodes in which each node is able to monitor the physical area and send collected information to the base station for further analysis. The important key of WSNs is detection and coverage of target area which is provided by random deployment. This paper reviews and addresses various area detection and coverage problems in sensor network. This paper organizes many scenarios for applying sensor node movement for improving network coverage based on bioinspired evolutionary algorithm and explains the concern and objective of controlling sensor node coverage. We discuss area coverage and target detection model by evolutionary algorithm.

| S-EPMC3943197 | biostudies-other

An efficient distributed algorithm for constructing spanning trees in wireless sensor networks.

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

Adaptive management of energy consumption, reliability and delay of wireless sensor node: Application to IEEE 802.15.4 wireless sensor node.

Project description:Designing a Wireless Sensor Network (WSN) to achieve a high Quality of Service (QoS) (network performance and durability) is a challenging problem. We address it by focusing on the performance of the 802.15.4 communication protocol because the IEEE 802.15.4 Standard is actually considered as one of the reference technologies in WSNs. In this paper, we propose to control the sustainable use of resources (i.e., energy consumption, reliability and timely packet transmission) of a wireless sensor node equipped with photovoltaic cells by an adaptive tuning not only of the MAC (Medium Access Control) parameters but also of the sampling frequency of the node. To do this, we use one of the existing control approaches, namely the viability theory, which aims to preserve the functions and the controls of a dynamic system in a set of desirable states. So, an analytical model, describing the evolution over time of nodal resources, is derived and used by a viability algorithm for the adaptive tuning of the IEEE 802.15.4 MAC protocol. The simulation analysis shows that our solution allows ensuring indefinitely, in the absence of hardware failure, the operations (lifetime duration, reliability and timely packet transmission) of an 802.15.4 WSN and one can temporarily increase the sampling frequency of the node beyond the regular sampling one. This latter brings advantages for agricultural and environmental applications such as precision agriculture, flood or fire prevention. Main results show that our current approach enable to send more information when critical events occur without the node runs out of energy. Finally, we argue that our approach is generic and can be applied to other types of WSN.

| S-EPMC5325272 | biostudies-literature

An energy efficient simultaneous-node repositioning algorithm for mobile sensor networks.

Project description:Recently, wireless sensor network (WSN) applications have seen an increase in interest. In search and rescue, battlefield reconnaissance, and some other such applications, so that a survey of the area of interest can be made collectively, a set of mobile nodes is deployed. Keeping the network nodes connected is vital for WSNs to be effective. The provision of connectivity can be made at the time of startup and can be maintained by carefully coordinating the nodes when they move. However, if a node suddenly fails, the network could be partitioned to cause communication problems. Recently, several methods that use the relocation of nodes for connectivity restoration have been proposed. However, these methods have the tendency to not consider the potential coverage loss in some locations. This paper addresses the concerns of both connectivity and coverage in an integrated way so that this gap can be filled. A novel algorithm for simultaneous-node repositioning is introduced. In this approach, each neighbour of the failed node, one by one, moves in for a certain amount of time to take the place of the failed node, after which it returns to its original location in the network. The effectiveness of this algorithm has been verified by the simulation results.

| S-EPMC4134831 | biostudies-other

An Adaptive, Discrete Space Oriented Wolf Pack Optimization Algorithm for a Movable Wireless Sensor Network.

Project description:Recently, many related algorithms have been proposed to find an efficient wireless sensor network with good sustainability, a stable connection, and a high covering rate. To further improve the coverage rate of movable wireless sensor networks under the condition of guaranteed connectivity, this paper proposes an adaptive, discrete space oriented wolf pack optimization algorithm for a movable wireless sensor network (DSO-WPOA). Firstly, a strategy of adaptive expansion based on a minimum overlapping full-coverage model is designed to achieve minimum overlap and no-gap coverage for the monitoring area. Moreover, the adaptive shrinking grid search wolf pack optimization algorithm (ASGS-CWOA) is improved to optimize the movable wireless sensor network, which is a discrete space oriented problem. This improvement includes the usage of a target-node probability matrix and the design of an adaptive step size method, both of which work together to enhance the convergence speed and global optimization ability of the algorithm. Theoretical research and experimental results indicate that compared with the coverage algorithm based on particle swarm optimization (PSO-WSN) and classical virtual force algorithm, the newly proposed algorithm possesses the best coverage rate, better stability, acceptable performance in terms of time, advantages in energy savings, and no gaps.

| S-EPMC6806117 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data