scholarly journals Dynamic Link Failure Detection using Robust Virus Swarm Routing Protocol in Wireless Sensor Network

2019 ◽  
Vol 8 (2) ◽  
pp. 1574-1578

Wireless Sensor Networks (WSN) gets weak due to node failures because of different reasons like intervention and faults that arise in communication. These kind of failures makes the entire network failure or disconnect part of the network leading to link failure. Routing protocols are responsible to find the best route to destination, because link failure minimizes the entire quality of service. Hence, there exist a need to find the preeminent route between source and destination which makes the communication in a efficient manner. Optimization started playing a major role in research, specifically in mining and networking issues. This paper aims to propose a optimization based routing protocol namely robust virus swarm routing protocol in order to effectively detect the link failures to find the alternative path and efficiently utilize the available energy to extend the network lifetime. The proposed protocol works by utilizing the dissemination and infection method followed by virus which defends the host-cell for the survival and progression. This research work uses the benchmark performance metrics to evaluate the proposed protocol against the existing protocols in the simulator NS2. The result shows that the proposed protocol outperforms the existing protocols in terms of all the metrics.

2017 ◽  
Vol 26 (1) ◽  
pp. 17-28
Author(s):  
Mohammed Saad Talib

Energy in Wireless Sensor networks (WSNs) represents an essential factor in designing, controlling and operating the sensor networks. Minimizing the consumed energy in WSNs application is a crucial issue for the network effectiveness and efficiency in terms of lifetime, cost and operation. Number of algorithms and protocols were proposed and implemented to decrease the energy consumption. Principally, WSNs operate with battery-powered sensors. Since Sensor's batteries have not been easily recharge.  Therefore, prediction of the WSN represents a significant concern. Basically, the network failure occurs due to the inefficient sensor's energy. MAC protocols in WSNs achieved low duty-cycle by employing periodic sleep and wakeup. Predictive Wakeup MAC (PW-MAC) protocol was made use of the asynchronous duty cycling. It reduces the consumption of the node energy by allowing the senders to predict the receiver′s wakeup time. The WSN must be applied in an efficient manner to utilize the sensor nodes and their energy to ensure effective network throughput. To ensure energy efficiency the sensors' duty cycles must be adjusted appropriately to meet the network traffic demands. The energy consumed in each node due to its switching between the active and idle states was also estimated. The sensors are assumed to be randomly deployed. This paper aims to improve the randomly deployed network lifetime by scheduling the effects of transmission, reception and sleep states on the energy consumption of the sensor nodes. Results for these states with much performance metrics were also studied and discussed.   


Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1179
Author(s):  
Carolina Del-Valle-Soto ◽  
Carlos Mex-Perera ◽  
Juan Arturo Nolazco-Flores ◽  
Alma Rodríguez ◽  
Julio C. Rosas-Caro ◽  
...  

Wireless Sensor Networks constitute an important part of the Internet of Things, and in a similar way to other wireless technologies, seek competitiveness concerning savings in energy consumption and information availability. These devices (sensors) are typically battery operated and distributed throughout a scenario of particular interest. However, they are prone to interference attacks which we know as jamming. The detection of anomalous behavior in the network is a subject of study where the routing protocol and the nodes increase power consumption, which is detrimental to the network’s performance. In this work, a simple jamming detection algorithm is proposed based on an exhaustive study of performance metrics related to the routing protocol and a significant impact on node energy. With this approach, the proposed algorithm detects areas of affected nodes with minimal energy expenditure. Detection is evaluated for four known cluster-based protocols: PEGASIS, TEEN, LEACH, and HPAR. The experiments analyze the protocols’ performance through the metrics chosen for a jamming detection algorithm. Finally, we conducted real experimentation with the best performing wireless protocols currently used, such as Zigbee and LoRa.


Wireless Sensor Networks (WSNs) are emerging network technology with innumerable applications. But security and energy constraints reduce its successful deployments. The nodes in network are greatly involved in transmissions and other processing operations for maintenance other than establishing or handling a call. Due to limited processing ability, storage capacity and most importantly the available battery power of the nodes, it is required to minimize the transmission power and the amount of data transmitted, for efficient operation. This paper presents a power aware routing protocol designed for wireless sensor networks. The proposed routing protocol is an extended and enhanced version of Dynamic Source Routing protocol. It adds energy awareness to the existing implementation of DSR protocol. Energy metric is considered during route selection process to choose an optimal path in terms of overall energy of the nodes along the path, and “low energy notification” method is used during route maintenance process to increase the lifetime of the bridge nodes to avoid network partitioning. The performance of DSR protocol and Energy Aware DSR (EADSR) protocol are compared through NS2 simulation under different scenarios. In all the cases, it is seen that EADSR protocol out-performs DSR protocol by energy saving in efficient manner


This paper develops a method to detect the failures of wireless links between one sensor nodes to another sensor node in WSN environment. Every node in WSN has certain properties which may vary time to time based on its ability to transfer or receive the packets on it. This property or features are obtained from every node and they are classified using Neural Networks (NN) classifier with predetermined feature set which are belonging to both weak link and good link between nodes in wireless networks. The proposed system performance is analyzed by computing Packet Delivery Ratio (PDR), Link Failure Detection Rate (LFDR) and latency report.


Author(s):  
Geetanjali Rathee ◽  
Hemraj Saini

Secure routing is considered as one of a key challenge in mesh networks because of its dynamic and broadcasting nature. The broadcasting nature of mesh environment invites number of security vulnerabilities to come and affect the network metrics drastically. Further, any node/link failure of a routed path may reduce the performance of the entire network. A number of secure routing protocols have been proposed by different researchers but enhancement of a single network parameter (i.e. security) may affect another performance metrics significantly i.e. throughput, end to end delay, packet delivery ratio etc. In order to ensure secure routing with improved network metrics, a Secure Buffer based Routing Protocol i.e. SBRP is proposed which ensures better network performance with increased level of security. SBRP protocol uses buffers at alternate positions to fasten re-routing mechanism during node/link failure and ensures the security using AES encryption. Further the protocol is analyzed against mAODV protocol in both static and dynamic environment in terms of security, packet delivery ratio, end to end delay and network throughput.


2011 ◽  
Vol 403-408 ◽  
pp. 1696-1699
Author(s):  
Cai Xia Li ◽  
Nai Bo Wang ◽  
Qi Ying Cao ◽  
Hong Gang Liu ◽  
Xin Hua Zhou

Nodes self-localization and routing are two main research issues in wireless sensor networks. There are quite a few publications about sensor network localization or routing protocols, but seldom person combines them in their research work. In this paper, we combine a novel TOA location technique and a new centralized energy-efficient routing protocol. The performance of the combination is then simulated by software. Simulation results show that the routing based on the positions got by our location algorithm is as good as the routing based on true positions and can afford most application demands.


In MANET usually nodes interact with each other either directly or by relaying nodes depending on whether nodes present are in vicinity of each other or not respectively. There are different routing protocols which work on the principle either of demand or not. AODV is a reactive routing protocol which performs on the strategy of shortest hop in its vicinity. Sometimes there is a route failure in network then some message is sent to the node if reply is not received with in time frame then for sure path is broken. So it is wastage of time and energy of all the participating nodes. Main reason behind the node failure is the sustaining energy of the participating nodes in the communication. Since nodes which have very less energy gets consumed when these try to send either data or reply to and from the nodes. Sometimes a node has minimum energy to send data. As soon as it sends data it is switched off and does not send delivery successful reply to the originating network. So in this case network thinks path is broken so message is again sent to another path. So here it again there is loss of energy of other communicating node and also wastage of time to send data to nodes. In this research work, an energy and time efficient approach will be proposed which will save time as well as energy of remaining nodes which further utilizes all the known linked paths simultaneously for transmitting data with the help of AODV routing protocol. Different simulation parameters are used to check the accuracy of approach. Simulation is performed on NS-3. There will be 50 to 100 nodes in the topology. Performance metrics like throughput, energy deviation, packet lost, packet delivery ratio and other will be used for performance checking with respect to standard AODV routing protocol. This research work provides the improvements to the existing algorithms of communication among network nodes in mobile ad-hoc networks (MANET) to obtain better results.


Author(s):  
Baranidharan V. ◽  
Sivaradje G. ◽  
Kiruthiga Varadharajan ◽  
Vignesh S.

The most adverse characteristics of underwater wireless sensor network (UWSN) communications are high propagation delay, high error rate, very low bandwidth, and limited available energy. The energy resources replacement is also more expensive. The proposed clustering-based geographic- opportunistic routing with adjustment of depth-based topology control for communication recovery of void regions (C- GEDAR). The cluster-based GEDAR routes the packet to the surface of sonobuoys with the help of clusters. The void sensor node recovery algorithm is used to recover the void nodes to calculate their new depth. The proposed routing protocol is to be simulated and its performances are evaluated by using an Aquasim simulator. The simulated result shows that C-GEDAR performs better average energy consumption, good packet delivery ratio (PDR) and less end-to-end delay.


Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4309 ◽  
Author(s):  
Tariq Ali ◽  
Muhammad Irfan ◽  
Ahmad Shaf ◽  
Abdullah Saeed Alwadie ◽  
Ahthasham Sajid ◽  
...  

Nowadays, there is a growing trend in smart cities. Therefore, the Internet of Things (IoT) enabled Underwater and Wireless Sensor Networks (I-UWSN) are mostly used for monitoring and exploring the environment with the help of smart technology, such as smart cities. The acoustic medium is used in underwater communication and radio frequency is mostly used for wireless sensor networks to make communication more reliable. Therefore, some challenging tasks still exist in I-UWSN, i.e., selection of multiple nodes’ reliable paths towards the sink nodes; and efficient topology of the network. In this research, the novel routing protocol, namely Time Based Reliable Link (TBRL), for dynamic topology is proposed to support smart city. TBRL works in three phases. In the first phase, it discovers the topology of each node in network area using a topology discovery algorithm. In the second phase, the reliability of each established link has been determined while using two nodes reliable model for a smart environment. This reliability model reduces the chances of horizontal and higher depth level communication between nodes and selects next reliable forwarders. In the third phase, all paths are examined and the most reliable path is selected to send data packets. TBRL is simulated with the help of a network simulator tool (NS-2 AquaSim). The TBRL is compared with other well known routing protocols, i.e., Depth Based Routing (DBR) and Reliable Energy-efficient Routing Protocol (R-ERP2R), to check the performance in terms of end to end delay, packet delivery ratio, and energy consumption of a network. Furthermore, the reliability of TBRL is compared with 2H-ACK and 3H-RM. The simulation results proved that TBRL performs approximately 15% better as compared to DBR and 10% better as compared to R-ERP2R in terms of aforementioned performance metrics.


Sign in / Sign up

Export Citation Format

Share Document