scholarly journals Using the Cuckoo Optimization Algorithm to Solve the Point Coverage Problem with Moving Targets in Wireless Sensor Networks

2021 ◽  
Author(s):  
Fen He ◽  
Zhihao Peng ◽  
Seyedsaeid Mirkamali
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Fitness Function ◽  
High Energy ◽  
Wireless Sensor ◽  
Second Phase ◽  
Coverage Problem ◽  
Cuckoo Optimization Algorithm

Abstract Wireless Sensor Networks (WSNs) have been used in many sectors in recent years. Easy deployment and low prices are the main reasons for using WSN. On the other hand, power source limitations and unstructured overlay networks are the major concerns in these kinds of networks. Region coverage is one of the problems that should be solved smartly in order to maximize the productivity of the network. Appropriate sensor selection and efficient energy usage are essential in region coverage. Pointwise coverage is a well-known version of the coverage problem. Since this is an NP-complete problem, many approaches have already been designed to solve it. The main shortcoming in previous works is the short network lifetime due to high energy consumption. In this paper, an enhanced method has been proposed based on the Cuckoo Optimization Algorithm (COA). By means of an adjusted version of the cuckoo search and a heuristic fitness function, it has been possible to expand the lifespan of the network. The proposed algorithm is composed of three phases: the first phase is setting up, the second phase is the selection, and the third phase is stable status. Simulation results show that the proposed method in comparison with recent works has achieved a sensible optimization in energy consumption, lifetime, and coverage quality.

scholarly journals Cluster Routing Algorithm for Ring Based Wireless Sensor Network Using Particle Swarm And Lion Swarm Optimization

2021 ◽  
Author(s):  
Huangshui Hu ◽  
Yuxin Guo ◽  
Jinfeng Zhang ◽  
Chunhua Yin ◽  
Dong Gao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Hot Spot ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Particle Swarm ◽  
Relay Node ◽  
Wireless Sensor ◽  
Swarm Optimization

Abstract In order to solve the problem of hot spot caused by uneven energy consumption of nodes in Wireless Sensor Networks (WSNs) and reduce the network energy consumption, a novel cluster routing algorithm called CRPL for ring based wireless sensor networks using Particle Swarm Optimization (PSO) and Lion Swarm Optimization (LSO) is proposed in this paper. In CRPL, the optimal cluster head (CH) of each ring are selected by using LSO whose fitness function is composed of energy,number of neighbor nodes, number of cluster heads and distance. Moreover, PSO with a multi-objective fitness function considering distance, energy and cluster size is used to find the next hop relay node in the process of data transmission, and the optimal routing paths are obtained, so as to alleviate the hot spot problem as well as decrease the energy consumption in the routing process. The simulation results show that, compared with some existing optimization algorithms, CRPL has better effects in balancing the energy consumption of the network and prolonging the life cycle of the network.

scholarly journals Oppo-Flood: An Energy-Efficient Data Dissemination Protocol for Asynchronous Duty-Cycled Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Hyeonsang Cho ◽  
Jungmin So
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Dissemination ◽  
High Energy ◽  
Wireless Sensor ◽  
Neighboring Node ◽  
Duty Cycling ◽  
Opportunistic Forwarding ◽  
Efficient Data

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments.

scholarly journals Solving Point Coverage Problem in Wireless Sensor Networks Using Whale Optimization Algorithm

2021 ◽  
Author(s):  
Mahnaz Toloueiashtian ◽  
Mehdi Golsorkhtabaramiri ◽  
Seyed Yaser Bozorgi Rad
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimization Algorithm ◽  
Energy Use ◽  
Whale Optimization Algorithm ◽  
Wireless Sensor ◽  
Dynamic Power Management ◽  
Coverage Problem ◽  
Whale Optimization ◽  
Point Coverage

Todays, dynamic power management methods that decrease the energy use of sensor networks after their design and deployment are of paramount importance. In Wireless Sensor Networks (WSN), coverage and detection quality are one aspect of service quality and power consumption reduction aspect. The aim of the coverage problem is to monitor at least one node at each point in the targeted area and is divided into three categories: border, area, and point coverage. In point coverage, which is our interest, the problem is to cover specific points of the environment scattered on the surface of the environment; their position is decided on and called the goal. In this paper, a new metaheuristic algorithm based on Whale Optimization Algorithm (WOA) is proposed. The proposed algorithm tries to find the Best Solution (BS) based on three operations exploration, spiral attack, and siege attack. Several scenarios, including medium, hard and complex problems, are designed to evaluate the proposed technique, and it is compared to Genetic Algorithm (GA) and Ant Colony Optimization (ACO) based on time complexity criteria in providing a suitable coverage, network lifetime, energy consumption. The simulation results show that the proposed algorithm performs better than the compared ones in most scenarios.

scholarly journals Low-Energy Secure Routing Protocol for WSNs Based on Multiobjective Ant Colony Optimization Algorithm

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Xueli Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Ant Colony Optimization Algorithm

As one of the three pillars of information technology, wireless sensor networks (WSNs) have been widely used in environmental detection, healthcare, military surveillance, industrial data sampling, and many other fields due to their unparalleled advantages in deployment cost, network power consumption, and versatility. The advent of the 5G standard and the era of Industry 4.0 have brought new opportunities for the development of wireless sensor networks. However, due to the limited power capacity of the sensor nodes themselves, the harsh deployment environment will bring a great difficulty to the energy replenishment of the sensor nodes, so the energy limitation problem has become a major factor limiting its further development; how to improve the energy utilization efficiency of WSNs has become an urgent problem in the scientific and industrial communities. Based on this, this paper researches the routing technology of wireless sensor networks, from the perspective of improving network security, and reducing network energy consumption, based on the study of ant colony optimization algorithm, further studies the node trust evaluation mechanism, and carries out the following research work: (1) study the energy consumption model of wireless sensor networks; (2) basic ant colony algorithm improvement; (3) multiobjective ant colony algorithm based on wireless sensor routing algorithm optimization. In this study, the NS2 network simulator is used as a simulation tool to verify the performance of the research algorithm. Compared with existing routing algorithms, the simulation results show that the multiobjective ant colony optimization algorithm has better performance in evaluation indexes such as life cycle, node energy consumption, node survival time, and stability compared with the traditional algorithm and the dual cluster head ant colony optimization algorithm.

Improving the performance of hierarchical wireless sensor networks using the metaheuristic algorithms: efficient cluster head selection

Sensor Review ◽  
2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Farzad Kiani ◽  
Amir Seyyedabbasi ◽  
Sajjad Nematzadeh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Fitness Function ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Second Phase ◽  
Content Type

Purpose Efficient resource utilization in wireless sensor networks is an important issue. Clustering structure has an important effect on the efficient use of energy, which is one of the most critical resources. However, it is extremely vital to choose efficient and suitable cluster head (CH) elements in these structures to harness their benefits. Selecting appropriate CHs and finding optimal coefficients for each parameter of a relevant fitness function in CHs election is a non-deterministic polynomial-time (NP-hard) problem that requires additional processing. Therefore, the purpose of this paper is to propose efficient solutions to achieve the main goal by addressing the related issues. Design/methodology/approach This paper draws inspiration from three metaheuristic-based algorithms; gray wolf optimizer (GWO), incremental GWO and expanded GWO. These methods perform various complex processes very efficiently and much faster. They consist of cluster setup and data transmission phases. The first phase focuses on clusters formation and CHs election, and the second phase tries to find routes for data transmission. The CH selection is obtained using a new fitness function. This function focuses on four parameters, i.e. energy of each node, energy of its neighbors, number of neighbors and its distance from the base station. Findings The results obtained from the proposed methods have been compared with HEEL, EESTDC, iABC and NR-LEACH algorithms and are found to be successful using various analysis parameters. Particularly, I-HEELEx-GWO method has provided the best results. Originality/value This paper proposes three new methods to elect optimal CH that prolong the networks lifetime, save energy, improve overhead along with packet delivery ratio.

scholarly journals Reliable Link Level Routing Algorithm in Pipeline Monitoring Using Implicit Acknowledgements

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 968
Author(s):  
Carlos Egas Acosta. ◽  
Felipe Gil-Castiñeira ◽  
Enrique Costa-Montenegro ◽  
Jorge Sá Silva
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Explicit Knowledge ◽  
Routing Algorithm ◽  
Linear Structure ◽  
High Energy ◽  
Wireless Sensor ◽  
Tree Topologies ◽  
End To End

End-to-end reliability for Wireless Sensor Network communications is usually provided by upper stack layers. Furthermore, most of the studies have been related to star, mesh, and tree topologies. However, they rarely consider the requirements of the multi-hop linear wireless sensor networks, with thousands of nodes, which are universally used for monitoring applications. Therefore, they are characterized by long delays and high energy consumption. In this paper, we propose an energy efficient link level routing algorithm that provides end-to-end reliability into multi-hop wireless sensor networks with a linear structure. The algorithm uses implicit acknowledgement to provide reliability and connectivity with energy efficiency, low latency, and fault tolerance in linear wireless sensor networks. The proposal is validated through tests with real hardware. The energy consumption and the delay are also mathematically modeled and analyzed. The test results show that our algorithm decreases the energy consumption and minimizes the delays when compared with other proposals that also apply the explicit knowledge technique and routing protocols with explicit confirmations, maintaining the same characteristics in terms of reliability and connectivity.

scholarly journals An Energy Efficient Sink Location Service for Continuous Objects in Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7282
Author(s):  
Cheonyong Kim ◽  
Sangdae Kim ◽  
Hyunchong Cho ◽  
Sangha Kim ◽  
Seungmin Oh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Base Station ◽  
Wireless Sensor ◽  
Second Phase ◽  
Location Service ◽  
Continuous Object ◽  
Mobile Worker ◽  
Sink Location

In wireless sensor networks (WSNs), detection and report of continuous object, such as forest fire and toxic gas leakage, is one of the major applications. In large-scale continuous object tracking in WSNs, there might be many source nodes simultaneously, detecting the continuous object. Each nodes reports its data to both a base station and mobile workers in the industry field. For communication between the source nodes and a mobile worker, sink location service is needed to continuously notify the location of the mobile worker. But, as the application has a large number of sources, it causes a waste of energy consumption. To address this issue, in this paper, we propose a two-phase sink location service scheme. In the first phase, the proposed scheme constructs a virtual grid structure for merging the source nodes. Then, the proposed scheme aggregates the merging points from an originated merging point as the second phase. Simulation results show that the proposed scheme is superior to other schemes in terms of energy consumption.

scholarly journals DV-Hop Node Location Algorithm Based on GSO in Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Ling Song ◽  
Liqin Zhao ◽  
Jin Ye
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Least Square Method ◽  
High Energy ◽  
Least Square ◽  
Wireless Sensor ◽  
Linear Solution ◽  
Node Location ◽  
Location Algorithm

Node location is one of the most important problems to be solved in practical application of WSN. As a typical location algorithm without ranging, DV-Hop is widely used in node localization of wireless sensor networks. However, in the third phase of DV-Hop, a least square method is used to solve the nonlinear equations. Using this method to locate the unknown nodes will produce large coordinate errors, poor stability of positioning accuracy, low location coverage, and high energy consumption. An improved localization algorithm based on hybrid chaotic strategy (MGDV-Hop) is proposed in this paper. Firstly, a glowworm swarm optimization of hybrid chaotic strategy based on chaotic mutation and chaotic inertial weight updating (MC-GSO) is proposed. The MC-GSO algorithm is used to control the moving distance of each firefly by chaos mutation and chaotic inertial weight when the firefly falls into a local optimum. The experimental results show that MC-GSO has better convergence and higher accuracy and avoids the premature convergence. Then, MC-GSO is used to replace the least square method in estimating node coordinates to solve the problem that the localization accuracy of the DV-Hop algorithm is not high. By establishing the error fitness function, the linear solution of coordinates is transformed into a two-dimensional combinatorial optimization problem. The simulation results and analysis confirm that the improved algorithm (MGDV-Hop) reduces the average location error, increases the location coverage, and decreases and balances the energy consumption as compared to DV-Hop and the location algorithm based on classical GSO (GSDV-Hop).

scholarly journals An Energy Efficient Routing Protocol Based on Layers and Unequal Clusters in Underwater Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Fang Zhu ◽  
Junfang Wei
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
High Energy ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Routing ◽  
Unequal Cluster

Underwater Wireless Sensor Networks (UWSNs) have drawn tremendous attentions from all fields because of their wide application. Underwater wireless sensor networks are similar to terrestrial Wireless Sensor Networks (WSNs), however, due to different working environment and communication medium, UWSNs have many unique characteristics such as high bit error rate, long end-to-end delay and low bandwidth. These characteristics of UWSNs lead to many problems such as retransmission, high energy consumption and low reliability. To solve these problems, many routing protocols for UWSNs are proposed. In this paper, a localization-free routing protocol, named energy efficient routing protocol based on layers and unequal clusters (EERBLC) is proposed. EERBLC protocol consists of three phases: layer and unequal cluster formation, transmission routing, maintenance and update of clusters. In the first phase, the monitoring area under the water is divided into layers, the nodes in the same layer are clustered. For balancing energy of the whole network and avoiding the “hotspot” problem, a novel unequal clustering method based on layers for UWSNs is proposed, in which a new calculation method of unequal cluster size is presented. Meanwhile, a new cluster head selection mechanism based on energy balance and degree is given. In the transmission phase, EERBLC protocol proposes a novel next forwarder selection method based on the forwarding ratio and the residual energy. In the third phase, Intra and inter cluster updating method is presented. The simulation results show that the EERBLC can effectively balance the energy consumption, prolong the network lifetime, and increase the amount of data transmission compared with DBR and EEDBR protocols.

Sign in / Sign up

Export Citation Format

Share Document