scholarly journals An Equilibrium Strategy-Based Routing Optimization Algorithm for Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3477 ◽  
Author(s):  
Liangrui Tang ◽  
Zhilin Lu ◽  
Jinqi Cai ◽  
Jiangyu Yan
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Equilibrium Strategy ◽  
Term Operation ◽  
Link Cost ◽  
Transmission Energy Consumption

In energy-constrained wireless sensor networks (WSNs), the design of an energy-efficient smart strategy is a key to extend the network lifetime, but the unbalance of energy consumption and node load severely restrict the long-term operation of the network. To address these issues, a novel routing algorithm which considers both energy saving and load balancing is proposed in this paper. First of all, the transmission energy consumption, node residual energy and path hops are considered to create the link cost, and then a minimum routing graph is generated based on the link cost. Finally, in order to ensure the balance of traffic and residual energy of each node in the network, an “edge-cutting” strategy is proposed to optimize the minimum routing graph and turn it into a minimum routing tree. The simulation results show that, the proposed algorithm not only can balance the network load and prolong the lifetime of network, but meet the needs of delay and packet loss rate.

scholarly journals Load-balanced routing algorithm based on cluster heads optimization for wireless sensor networks

2018 ◽  
Vol 232 ◽  
pp. 04050
Author(s):  
Yong-wen Du ◽  
Zhang-min Wang ◽  
Gang Cai ◽  
Jun-hui Gong
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads

In order to solve the problem of unbalanced load consumption of nodes for wireless sensor networks (WSNs), this paper proposes a load-balanced routing algorithm based on cluster heads optimization for wireless sensor network. The proposed algorithm first applies first-order wireless transmission model to calculate the optimal number of clusters, then calculate nodes competitiveness rating by fuzzy algorithm considering the residual energy of node and distance from the node to base station, cluster head selection uses unequal clustering algorithm according to the competitiveness of nodes. By node competitiveness and energy management mechanism which cooperate with each other to select the best cluster heads. Use connected optimization between clusters to search multi-hop paths base station for reducing energy consumption of node, and consider transmission energy consumption, residual energy, transmission distance and other factors. The experimental results show that the proposed algorithm compared with LEACH and UCDP algorithm, can balance loading and effectively extend the life cycle of wireless sensor network.

An Energy-Balance Based Distributed Topology Control Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 490-495 ◽  
pp. 1392-1396 ◽  
Author(s):  
Chu Hang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Topology Control ◽  
Control Algorithm ◽  
Path Loss ◽  
Network Connectivity ◽  
Premature Death ◽  
Residual Energy ◽  
Wireless Sensor

Topology control is an efficient approach which can reduce energy consumption for wireless sensor networks, and the current algorithms mostly focus on reducing the nodes’ energy consumption by power adjusting, but pay little attention to balance energy consumption of the whole network, which results in premature death of many nodes. Thus, a distributed topology control algorithm based on path-loss and residual energy (PRTC) is designed in this paper. This algorithm not only maintains the least loss links between nodes but also balances the energy consumption of the network. The simulation results show that the topology constructed by PRTC can preserve network connectivity as well as extend the lifetime of the network and provide good performance of energy consumption.

scholarly journals An Efficient Anonymous Communication Scheme to Protect the Privacy of the Source Node Location in the Internet of Things

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Fengyin Li ◽  
Pei Ren ◽  
Guoyu Yang ◽  
Yuhong Sun ◽  
Yilei Wang ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Location Privacy ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Source Node ◽  
Wireless Sensor ◽  
Anonymous Communication ◽  
Privacy Leakage ◽  
Communication Scheme

Advances in machine learning (ML) in recent years have enabled a dizzying array of applications such as data analytics, autonomous systems, and security diagnostics. As an important part of the Internet of Things (IoT), wireless sensor networks (WSNs) have been widely used in military, transportation, medical, and household fields. However, in the applications of wireless sensor networks, the adversary can infer the location of a source node and an event by backtracking attacks and traffic analysis. The location privacy leakage of a source node has become one of the most urgent problems to be solved in wireless sensor networks. To solve the problem of source location privacy leakage, in this paper, we first propose a proxy source node selection mechanism by constructing the candidate region. Secondly, based on the residual energy of the node, we propose a shortest routing algorithm to achieve better forwarding efficiency. Finally, by combining the proposed proxy source node selection mechanism with the proposed shortest routing algorithm based on the residual energy, we further propose a new, anonymous communication scheme. Meanwhile, the performance analysis indicates that the anonymous communication scheme can effectively protect the location privacy of the source nodes and reduce the network overhead.

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.

A Novel Energy-Balanced Dynamic Routing Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 681 ◽  
pp. 235-238
Author(s):  
Xin Xin Zhou ◽  
Yan Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Dynamic Routing ◽  
Residual Energy ◽  
Wireless Sensor ◽  
The Novel ◽  
Balance Energy ◽  
Transfer Tasks

Wireless sensor networks (WSNs) is taking an increasing role in our lives. Because the energy of the sensors is limited how to efficiently use the energy to prolong the lifecycle of the sensor networks is very important. In this paper, a novel energy-balanced dynamic routing algorithm based on ACO is proposed. The novel routing algorithm can dynamically choose routing according to the residual energy of the sensors and the sensors with more power is taken more data transfer tasks. The simulation results show that the proposed routing algorithm can effectively balance energy consumption and prolong the lifecycle of the networks.

scholarly journals Novel Energy-Efficient Data Gathering Scheme Exploiting Spatial-Temporal Correlation for Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Ying Zhou ◽  
Lihua Yang ◽  
Longxiang Yang ◽  
Meng Ni
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Data Gathering ◽  
Temporal Correlation ◽  
Wireless Sensor ◽  
Selection Scheme ◽  
Efficient Data ◽  
Transmission Energy Consumption

A novel energy-efficient data gathering scheme that exploits spatial-temporal correlation is proposed for clustered wireless sensor networks in this paper. In the proposed method, dual prediction is used in the intracluster transmission to reduce the temporal redundancy, and hybrid compressed sensing is employed in the intercluster transmission to reduce the spatial redundancy. Moreover, an error threshold selection scheme is presented for the prediction model by optimizing the relationship between the energy consumption and the recovery accuracy, which makes the proposed method well suitable for different application environments. In addition, the transmission energy consumption is derived to verify the efficiency of the proposed method. Simulation results show that the proposed method has higher energy efficiency compared with the existing schemes, and the sink can recover measurements with reasonable accuracy by using the proposed method.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

Sign in / Sign up

Export Citation Format

Share Document