scholarly journals Multiparameter Fusion Decision Routing Algorithm for Energy-Constrained Wireless Sensor Networks

2020 ◽  
Vol 10 (8) ◽  
pp. 2747
Author(s):  
Jiangyu Yan ◽  
Jinqi Cai ◽  
Zhilin Lu ◽  
Liangrui Tang ◽  
Runze Wu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selection Strategy ◽  
Equilibrium Degree ◽  
Energy Equilibrium ◽  
Energy Constrained ◽  
Network Status

For energy-limited wireless sensor networks (WSNs), we propose a multiparameter fusion decision routing (MPFDR) algorithm in this study. This algorithm gives a comprehensive account of the residual energy and forward distance, single-hop transmission ratio, cache queue, and energy equilibrium degree. It calculates the routing evaluation parameters of the forward neighbors, realizing a multidirectional reflection of the network status. Simultaneously, combined with the defined routing selection strategy based on the parameter contribution degree and fuzzy contribution degree, the fusion contribution degree of each forward neighbor is obtained. Then, the node with the most considerable fusion contribution degree is selected as the next hop. Finally, the performance of the MPFDR algorithm is simulated and compared with other algorithms. Simulation results indicate that our algorithm has good congestion control ability in energy-limited wireless sensor networks and can significantly reduce the packet loss rate and average hops.

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.

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.

A Energy-Aware QoS Routing Protocol for Wireless Sensor Networks

2013 ◽  
Vol 373-375 ◽  
pp. 323-328
Author(s):  
Long Gao ◽  
La Yuan Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Qos Routing ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Multiple Paths ◽  
Qos Routing Algorithm

As the different QoS requirements of different businesses in wireless sensor networks, we proposed a QoS routing algorithm-EAQoS. The algorithm built multiple paths to sink node by recording the minimum hops of neighbors to sink. Then data was sent by the path that satisfied its QoS requirements and had enough residual energy. According to the comparisons with the SAR routing algorithm, this algorithm has obvious advantages in providing different services and prolonging the lifetime of network.

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.

PSO-Based Trust QoS Routing Algorithm for Wireless Sensor Networks

2013 ◽  
Vol 401-403 ◽  
pp. 1751-1755
Author(s):  
Jun Wei Wang ◽  
Yong Tao Wei
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Qos Routing ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Trust Value ◽  
Network Utilization ◽  
Qos Routing Algorithm

The existing routing algorithm of Wireless Sensor Networks (WSNs) pays more attention to the energy efficient. However, Quality of Service (QoS) supported and the validity of packet transmission unveil additional challenges. Based on the Particle Swarm Optimization (PSO), this paper presents a trust QoS routing algorithm for WSNs. Hierarchical structure is adopted and the trust value of the node is constructed with the direct trust value and the indirect trust value. In addition, delivery delay and packet loss are considered as main QoS metrics. Finally, under the optimization ability of PSO, the proposed algorithm tries to find the route with maximum residual energy and reliability in order to maximize network utilization as well as meets QoS constraints. Compared to typical routing algorithms in sensor networks, this new algorithm has better performance.

scholarly journals Energy proficient clustering technique for lifetime enhancement of cognitive radio–based heterogeneous wireless sensor network

2018 ◽  
Vol 14 (3) ◽  
pp. 155014771876759 ◽  
Author(s):  
Venkatasubramanian Srividhya ◽  
Thangavelu Shankar
Keyword(s):  
Wireless Sensor Networks ◽  
Cognitive Radio ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Network ◽  
Communication Approach

Utilizing the available spectrum in a more optimized manner and selecting a proper routing technique for transferring the data, without any data collision, from the sensor node to the base station play a major role in any network for increasing their network lifetime. Cognitive radio techniques play a major role to achieve the same, and when combined with wireless sensor networks the above-said requirements can be greatly accomplished. In this article, a novel energy-efficient distance-based clustering and routing algorithm using multi-hop communication approach is proposed. Based on distance, the given heterogeneous cognitive radio–based wireless sensor networks are divided into regions and are allocated with a unique spectrum. Dynamic clustering through distance calculation and routing of data through multi-hop communication is done. The simulation results illustrate that the proposed algorithm has improved energy efficiency and is more stable. The first node death and 80% node death illustrate the improved scalability. Also, the increased throughput aids in maintaining the residual energy of the network, which further solves the problem of load balancing among nodes. All the above results combined with half node death analysis show that the proposed algorithm also has an improved network lifetime.

Distributed Lifetime Optimized Routing Algorithm for Wireless Sensor Networks

2010 ◽  
Vol 40-41 ◽  
pp. 448-452 ◽  
Author(s):  
You Rong Chen ◽  
Li Yu ◽  
Qi Fen Dong ◽  
Zhen Hong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cost Effective ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Sink Node ◽  
Simulation Results ◽  
Routing Tree

The network hub nodes consumed excessive energy and failed prematurely, thus it reduced the network lifetime. In order to solve the problem, distributed lifetime optimized routing algorithm (DLOR) for wireless sensor networks was proposed. Energy for transmitting data and neighbor node residual energy were considered comprehensively. Then new weight function was introduced and distributed asynchronous Bellman-Ford algorithm was also used to construct the shortest routing tree. Finally, data were gathered along the shortest routing tree to sink node. Simulation results show that DLOR algorithm can extend network lifetime and enable cost-effective energy consumption. Under certain conditions, DLOR algorithm outperforms PEDAP, GreedyDijkstra, LET, Ratio-w and Sum-w algorithms.

Research on Routing Algorithm Based on Ant Colony Optimization for Wireless Sensor Networks

2015 ◽  
Vol 713-715 ◽  
pp. 1423-1426 ◽  
Author(s):  
Dong Ya Chen ◽  
Chang Mao Zhang ◽  
Guang Ye Li ◽  
Tao Tian
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Punishment Mechanism ◽  
Rewards And Punishment

Routing algorithm based on ant colony optimization for wireless sensor networks has the ant colony algorithm characteristics of self-organization, the positive feedback and the parallelism, which has good performance in constructing the optimal routing. In this paper, the distance for stimulating factor is improved, the communication distance is introduced and the pheromone update methods having the rewards and punishment mechanism are adopted, which can make better use of residual energy for wireless sensor networks nodes, prolong life of network and guarantee the effect of the optimization algorithm.

Sign in / Sign up

Export Citation Format

Share Document