scholarly journals Mathematical Modeling and Simulation of Wireless Sensor Network Coverage Problem

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jianxia Guo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Heterogeneous Network ◽  
Base Station ◽  
Wireless Sensor ◽  
Selection Strategy ◽  
Hop Count ◽  
Heterogeneous Wireless Sensor Networks ◽  
Simulation Results

The research on wireless sensor networks has achieved a lot in recent years and some of the results have been put into practical applications, but with the increasing demand and requirements for wireless sensor networks, many old and new problems need to be solved urgently. In this paper, a data topology optimization algorithm based on local tree reconstruction for heterogeneous wireless sensor networks is proposed for data transmission in wireless sensor networks that are easily affected by external instabilities. This heterogeneous network can accomplish better data transmission; firstly, the nodes are divided into different layers according to the hop count of nodes in the network, and a certain proportion of relay nodes are selected for different layer nodes; then, different initial energy is set for different layer nodes, and since the data packets of different nodes have different sizes, the corresponding data aggregation coefficients are used in this paper according to the actual data requirements of the network during data transmission; finally, the topology of the tree is dynamically updated in real time during the operation of the network to extend the lifetime of the nodes. The simulation results verify that the proposed heterogeneous network topology evolution algorithm effectively extends the network lifetime and improves the utilization of nodes. This paper establishes a modified least-squares target localization model to achieve accurate 3D localization of targets in real scenes and proposes an optimal base station node selection strategy based on spectral clustering using the location distribution information of base station nodes in space. The simulation results show that the error of the terminal 3D coordinates calculated by the proposed algorithm is smaller than the real coordinates, and the error is smaller than other existing algorithms with the same simulation data.

scholarly journals Routing Algorithm with Uneven Clustering for Energy Heterogeneous Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Ying Zhang ◽  
Wei Xiong ◽  
Dezhi Han ◽  
Wei Chen ◽  
Jun Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Networks ◽  
Transmission Stage ◽  
Simulation Results

Aiming at the “hotspots” problem in energy heterogeneous wireless sensor networks, a routing algorithm of heterogeneous sensor network with multilevel energies based on uneven clustering is proposed. In this algorithm, the energy heterogeneity of the nodes is fully reflected in the mechanism of cluster-heads’ election. It optimizes the competition radius of the cluster-heads according to the residual energy of the nodes. This kind of uneven clustering prolongs the lifetime of the cluster-heads with lower residual energies or near the sink nodes. In data transmission stage, the hybrid multihop transmission mode is adopted, and the next-hop routing election fully takes account of the factors of residual energies and the distances among the nodes. The simulation results show that the introduction of an uneven clustering mechanism and the optimization of competition radius of the cluster-heads significantly prolonged the lifetime of the network and improved the efficiency of data transmission.

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

scholarly journals An Enhanced Heterogeneous Gateway-Based Energy-Aware Multi-hop Routing Protocol for Wireless Sensor Networks

2022 ◽  
Author(s):  
Fuseini Jibreel ◽  
Emmanuel Tuyishimire ◽  
I M Daabo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Base Station ◽  
Communication Strategy ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Routing Scheme

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.

scholarly journals Implementation of Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks

2021 ◽  
pp. 664-670
Author(s):  
Manoshri A. Ghawade ◽  
Dr. Sheetal S. Dhande
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Practical Interest ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Networks ◽  
Multiple Sensor ◽  
Simulation Results ◽  
Multiple Sensing

Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. In this paper, we consider this issue according to heterogeneous WSN models. Furthermore, we consider two sensing detection models: single-sensing detection and multiple-sensing detection... Our simulation results show the advantage of multiple sensor heterogeneous WSNs.

scholarly journals A Method for Energy Balance and Data Transmission Optimal Routing in Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (13) ◽  
pp. 3017 ◽  
Author(s):  
Xuesong Liu ◽  
Jie Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Energy Distribution ◽  
Data Transmission ◽  
Line Length ◽  
Wireless Sensor ◽  
Hop Count ◽  
Transmission Distance

Wireless sensor networks are widely used in many fields. Nodes in the network are typically powered by batteries. Because the energy consumption of wireless communication is related to the transmission distance, the energy consumption of nodes in different locations is different, resulting in uneven energy distribution of nodes. In some special applications, all nodes are required to work at the same time, and the uneven energy distribution makes the effective working time of the system subject to the node with the largest energy consumption. The commonly used clustering protocol can play a role in balancing energy consumption, but it does not achieve optimal energy consumption. This paper proposes to use the power supply line to connect the nodes to fully balance the energy. The connection scheme with the shortest power line length is also proposed. On the basis of energy balance, the method of transmitting data with the best hop count is proposed, which fully reduces the power consumption of the data transmission. The simulation results show that the proposed method can effectively reduce the energy consumption and prolong the lifetime of wireless sensor networks.

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 AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Farzad Kiani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Data Transmission ◽  
Search Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Second Phase

Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase), the sensors are placed into virtual layers. The second phase (data transmission) is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

scholarly journals Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Oday Jerew ◽  
Nizar Al Bassam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Saving ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hop Count ◽  
Tour Length ◽  
Mobile Base

Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.

Optimization of energy-efficient dynamic task assignment for wireless sensor networks based on particle swarm algorithm

2021 ◽  
pp. 1-11
Author(s):  
Shu Zhang ◽  
Jianhua Chen
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Path Planning ◽  
Data Transmission ◽  
Energy Efficient ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Task

This paper provides an in-depth analysis of the optimization of energy-efficient dynamic task allocation in wireless sensor networks through an improved particle swarm optimization algorithm, and introduces the idea of software-defined networking into wireless sensor network to propose a software-defined wireless sensor network non-uniform cluster routing protocol. The protocol decouples the data layer from the control layer, and the base station performs the cluster head election, network clustering, and routing control operations. The base station optimizes the cluster head election process by electing cluster head nodes using an improved particle cluster algorithm. Based on the elected cluster head nodes, the base station calculates their corresponding contention radius and plans the data transmission path. The results of the calculation are sent to the corresponding nodes for cluster creation and data transmission. The simulation results fully show that the use of this protocol can achieve the purpose of significantly extending the service life of the network. This paper comprehensively analyses the whole process of mobile charging of UAVs under improved conditions and proposes a path planning algorithm. The multi-level weighted charging path planning proposed in this paper considers both fairness and timeliness. Finally, the paper verifies the effectiveness of the algorithm.

Sign in / Sign up

Export Citation Format

Share Document