Reliable Shortest Paths in Wireless Sensor Networks: Refocusing on Link Failure Scenarios from Applications

2014 ◽  
Author(s):  
Md Zakirul Alam Bhuiyan ◽  
Guojun Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Paths ◽  
Wireless Sensor ◽  
Link Failure

scholarly journals Routing Protocols for Energy Efficiency in WSNs: A review

2021 ◽  
pp. 29-33
Author(s):  
Dheyab Salman Ibrahim ◽  
Abd Ali Hussein ◽  
Fadhil Kadhem Zaidan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Minimum Energy ◽  
Shortest Paths ◽  
Network Routing ◽  
Wireless Sensor ◽  
Maximum Lifespan ◽  
Data Routing ◽  
Minimum Energy Consumption

Wireless sensor networks (WSNs) is a significant part of networking area. They are cheap, efficient, and small, they are become more and more important for several applications. However, with the widespread use of applications that rely on wireless sensor networks, they continue to suffer from limitations such as data routing and security. WSNs can be used for several applications. Nodes of Sensor work on batteries. It is impossible to charge or replace the battery in some applications. For that purpose, optimal use of node’s energy is a key issue in the network. Routing is a significant challenge to extend the lifespan of network. Several protocols are implemented in WSNs. In this study, a survey on clustering techniques, present a characteristic and requirements routing design of WSNs. Result of this study shows how to solve some of these problems. WSN routing protocols have to ensure shortest paths, minimum energy consumption, less delay and maximum lifespan of network.

scholarly journals SALP Swarm Optimization Approach for Maximization The Lifetime of Wireless Sensor Network

2021 ◽  
Vol 1 (2) ◽  
pp. 16-20
Author(s):  
Mohammed M. Ahmed*
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Minimum Spanning Tree ◽  
Fitness Function ◽  
Shortest Paths ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Optimization Approach ◽  
Sink Node ◽  
Swarm Optimization

In recent years, the maximization of a lifetime for wireless sensor networks is considered an important area for researchers. The wireless sensor networks (WSNs) contain two types of sensors that called sensor nodes and sink nodes which sensor node send information to the central node (sink node) that collected its data. Choosing the best location of sink node considered the critical problem that faces the lifetime of wireless sensor networks. In this paper, we propose a method that choosing best location of a sink node by applying Salp Swarm Algorithm (SSA) after determining sink node location we create transmission paths between the sink node and rest of nodes using Prim's minimum spanning tree to choose shortest paths. Accordingly, for fitness function that used to decrease energy consumption for a network. Simulation results clarify that our proposed algorithm that solves localization of sink node presents the best results for prolonging the network's lifetime compared to Cat Swarm Optimization algorithm (CSA) and Particle Swarm Optimization (PSO).

Geographic Dijkstra-Based Multicast Algorithm for Wireless Sensor Networks

2012 ◽  
Vol 17 (1-2) ◽  
pp. 33-46
Author(s):  
Bartosz Musznicki ◽  
Mikołaj Tomczak ◽  
Piotr Zwierzykowski
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Multicast Routing ◽  
Shortest Paths ◽  
Careful Consideration ◽  
Wireless Sensor ◽  
Local Optimum ◽  
Bandwidth Utilization ◽  
Radio Communication

Abstract. Limited resources in Wireless Sensor Networks (WSNs) are the key concern that needs to be given a careful consideration when studying virtually any aspect of a sensor network. Therefore, energy demands and radio bandwidth utilization should be addressed, especially in one-to-many communication. It is evident that a need for centralized networkwide topology knowledge can jeopardize scarce energy resources of a sensor network. Thus, localized geographic multicast relies solely on locally available information about the position of current node, other nodes within the radio range and the location of destination group members. Greedy multicast routing procedures often transport messages along paths that may be far from being optimal. Therefore, Dijkstrabased Localized Energy-Efficient Multicast Algorithm (DLEMA) is presented, described with pseudocode, and discussed. DLEMA focuses on discovering energy shortest paths leading through nodes that provide the maximum geographical advance towards desired destinations. Local routes are followed owing to the use of a source routing technique. Additionally, the algorithm takes advantage of the broadcast nature of omnidirectional radio communication and utilizes perimeter routing to find a solution for local optimum situations. The analysis of the simulation results confirms interesting characteristics of the proposed algorithm

scholarly journals Cross-Layer Support for Energy Efficient Routing in Wireless Sensor Networks

2009 ◽  
Vol 2009 ◽  
pp. 1-9 ◽  
Author(s):  
N. Chilamkurti ◽  
S. Zeadally ◽  
A. Vasilakos ◽  
V. Sharma
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Packet Loss ◽  
Optimization Techniques ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Cross Layer ◽  
Link Failure ◽  
Energy Efficient Routing

The Dynamic Source Routing (DSR) algorithm computes a new route when packet loss occurs. DSR does not have an in-built mechanism to determine whether the packet loss was the result of congestion or node failure causing DSR to compute a new route. This leads to inefficient energy utilization when DSR is used in wireless sensor networks. In this work, we exploit cross-layer optimization techniques that extend DSR to improve its routing energy efficiency by minimizing the frequency of recomputed routes. Our proposed approach enables DSR to initiate a route discovery only when link failure occurs. We conducted extensive simulations to evaluate the performance of our proposed cross-layer DSR routing protocol. The simulation results obtained with our extended DSR routing protocol show that the frequency with which new routes are recomputed is 50% lower compared with the traditional DSR protocol. This improvement is attributed to the fact that, with our proposed cross-layer DSR, we distinguish between congestion and link failure conditions, and new routes are recalculated only for the latter.

A Cross-Layer Predictive and Preemptive Routing Protocol for Underwater Wireless Sensor Networks Using the Lagrange Interpolation

2021 ◽  
Vol 10 (2) ◽  
pp. 78-99
Author(s):  
Manel Baba Ahmed ◽  
Moussa Ali Cherif ◽  
Sofiane Boukli Hacene
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Lagrange Interpolation ◽  
Interpolation Method ◽  
Wireless Sensor ◽  
Cross Layer ◽  
Link Failure ◽  
Network Simulator ◽  
Underwater Wireless Sensor Networks ◽  
Simulation Performance

Underwater wireless sensor networks have become enabling technology for the seawater exploration. Since they raise numerous challenges and problems such as their limited battery and bandwidth, energy-constraint, 3D deployment, and temporary losses of connectivity or link failure, in this paper, a predictive and preemptive cross-layer protocol CLPP-VBF is proposed based on the vector-based forwarding protocol (VBF) for UWSNs, aimed to predict a future loss of connectivity or link failure problems using the Lagrange interpolation method, avoiding unnecessary transmission and rediscovering another new forwarder node in order to guarantee the data packets transmission reliability. The approach is a cooperation between the medium access layer (MAC) and network layer. The study has been implemented and evaluated using the well-known NS2 network simulator with an extension Aqua-sim; the simulation performance shows the merit of CLPP-VBF against VBF in term of delivered packets, average end-to-end delay, and energy consumption.

scholarly journals DETECTING WORMHOLE ATTACKS IN WIRELESS SENSOR NETWORKS

2021 ◽  
Author(s):  
Zhukabayeva T.K., Mardenov E.M.,PhD
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Shortest Paths ◽  
Attack Detection ◽  
Wireless Sensor ◽  
Detection Methods ◽  
Wormhole Attack ◽  
Wormhole Attacks ◽  
Control Devices ◽  
And Control

Wireless sensor networks (WSN), consisting of wireless sensors and control devices and methods of self-organization using intelligent algorithms, demonstrate broad prospects. WSNs are subject to numerous types of threats and attacks. One of which is a wormhole attack. This article provides an overview of wormhole attack detection methods in WSN, as well as a new optimized method for detecting this attack. The detection method is based on the removal of the edges of the wormhole and causes significant changes in the length of the shortest paths between network nodes.The accuracy of the proposed algorithm is not affected by the number of wormholes

Sign in / Sign up

Export Citation Format

Share Document