AODV routing protocol performance assessment for wireless sensor network scenarios

2021 ◽  
Vol 10 (03) ◽  
pp. 25292-25301
Author(s):  
Luay Abdulwahid Shihab ◽  
Manhalmohammed Basher
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Transmission Rate ◽  
Base Station ◽  
Wireless Sensor ◽  
Network Nodes ◽  
Reactive Routing ◽  
Aodv Protocol ◽  
Protocol Performance

Emerging WSN applications include a wide selection of traditional situations with many nodes. The messages are propagated through intermediate nodes, in order to ensure correct contact between the network nodes with the base station, so that a path has many connexions. Generally speaking, the nodes on the sensor network are distinguished by their minimal resources, so protocols must be used that not only guarantee connectivity but also conserve the most energy while maintaining scalability. Different protocols for routing wireless sensor networks have been suggested, however, reactive routing algorithms have been shown to be energy efficient and adaptable to wireless sensor networks. In this paper, under the OMNeT + + simulation platform, the performance of the reactive protocol will be tested, evaluating different scripts. In contrast to the supplementary responsive protocols stated in literature, the AODV protocol has been selected for supremacy in performance. The following parameters have been evaluated: the transmission rate of packets, average delays, overhead routing and energy usage. The findings show that AODV decreases its efficiency with the growth in the number of nodes. As a result, its usability limits the network scalability and the outcomes demonstration that the spatial distribution of nodes affects protocol performance. The standardised delivery shows the best outcomes for our particular works.

scholarly journals Analysis of AODV protocol under sinkhole attack in wireless sensor network

2018 ◽  
Vol 7 (2.4) ◽  
pp. 153
Author(s):  
Harkesh Sehrawat ◽  
Yudhvir Singh ◽  
Vikas Siwach
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Attacks ◽  
Aodv Protocol ◽  
The Impact

A Wireless Sensor Network (WSNs) is a collection of number of sensor nodes which are left open in an unsecured environment. Sensor nodes work and communicate together to attain the desired goals. They are placed at the locations where monitoring is otherwise impossible. Wireless Sensor Networks are resource constrained which may be computational power, memory capacity, battery power etc. As Wireless Sensor Networks are implemented in the unattended environment, they are prone to discrete type of security attacks. Because of their limitations these networks are easily targeted by intruders. Sinkhole attack is one of the security attacks which try to disturb the ongoing communication in wireless sensor network. In sinkhole attack, the intruder or the malicious node try to attract the network traffic towards itself, that sensor nodes will pass data packets through this compromised node thereby manipulating messages which sensor nodes are transferring to the base station. In this paper we analyze the impact of Sinkhole attack on AODV protocol under various conditions. We analyzed the impact of Sinkhole attack on AODV protocol with varying number of attacker nodes.  

scholarly journals Searching Algorithm of Dormant Node in Wireless Sensor Networks

2017 ◽  
Vol 13 (05) ◽  
pp. 122 ◽  
Author(s):  
Bo Feng ◽  
Wei Tang ◽  
Guofa Guo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Network ◽  
Delaunay Triangulation ◽  
Base Station ◽  
Wireless Sensor ◽  
Effective Mechanism ◽  
Dormant State ◽  
Important Nodes

In wireless sensor networks, the nodes around the base station have higher energy consumption due to the forwarding task of all the detected data. In order to balance the energy consumption of the nodes around the base station, a reasonable and effective mechanism of node rotation dormancy is put forward. In this way, a large number of redundant nodes in the network are in a dormant state, so as to reduce the load of important nodes around the base station. The problems of the redundant nodes in the sensor network are analyzed, and a new method is proposed to distinguish the redundant nodes based on local Delaunay triangulation and multi node election dormancy mechanism. The experimental results showed that this method could effectively distinguish the redundant nodes in the network; at the same time, through the multi round election mechanism, parts of redundant nodes are made dormant. In summary, they can reduce the network energy consumption on the condition of guaranteeing the original coverage.

scholarly journals A Lightweight Intrusion Detection Method Based on Fuzzy Clustering Algorithm for Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Hongchun Qu ◽  
Libiao Lei ◽  
Xiaoming Tang ◽  
Ping Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Sensor Network ◽  
Clustering Algorithm ◽  
Detection Method ◽  
Base Station ◽  
Simulation Software ◽  
Wireless Sensor ◽  
Sensor Monitoring

For resource-constrained wireless sensor networks (WSNs), designing a lightweight intrusion detection technology has been a hot and difficult issue. In this paper, we proposed a lightweight intrusion detection method that was able to directly map the network status into sensor monitoring data received by base station, so that base station can sense the abnormal changes in the network. Our method is highlighted by the fusion of fuzzy c-means algorithm, one-class SVM, and sliding window procedure to effectively differentiate network attacks from abnormal data. Finally, the proposed method was tested on the wireless sensor network simulation software EXata and in real applications. The results showed that the intrusion detection method in this paper could effectively identify whether the abnormal data came from a network attack or just a noise. In addition, extra energy consumption can be avoided in all sensor monitoring nodes of the sensor network where our method has been deployed.

Performance Analysis of Multi-Hop Routing Protocol With Optimized Grid-Based Clustering for Wireless Sensor Network

2020 ◽  
pp. 254-282
Author(s):  
Saloni Dhiman ◽  
Deepti Kakkar ◽  
Gurjot Kaur
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Performance Analysis ◽  
Sensor Network ◽  
Routing Protocol ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Grid Based

Wireless sensor networks (WSNs) consist of several sensor nodes (SNs) that are powered by battery, so their lifetime is limited, which ultimately affects the lifespan and hence performance of the overall networks. Till now many techniques have been developed to solve this problem of WSN. Clustering is among the effective technique used for increasing the network lifespan. In this chapter, analysis of multi-hop routing protocol based on grid clustering with different selection criteria is presented. For analysis, the network is divided into equal-sized grids where each grid corresponds to a cluster and is assigned with a grid head (GH) responsible for collecting data from each SN belonging to respective grid and transferring it to the base station (BS) using multi-hop routing. The performance of the network has been analyzed for different position of BS, different number of grids, and different number of SNs.

scholarly journals User Authentication Techniques for Wireless Sensor Networks : A Survey

2012 ◽  
pp. 82-85
Author(s):  
Shakera Shaikh ◽  
Veena Gulhane
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
User Authentication ◽  
Base Station ◽  
Wireless Sensor ◽  
End User ◽  
Authentication Schemes ◽  
Gathering Data

A wireless sensor network(WSN) consisting of a large number of tiny sensors can be an effective tool for gathering data in diverse kinds of environments. The data collected by each sensor node is communicated to the base station, which forwards the data to the end user. In wireless sensor network data security plays an important role where confidentiality, authentication, integrity, non repudiation are given importance. This paper synthesizes existing user authentication schemes in wireless sensor networks and highlights the challenges in user authentication.

scholarly journals Two Level Intrusion Detection Mechanism For Context and Trust in Wireless Sensor Network

2020 ◽  
Vol 8 (6) ◽  
pp. 65-71
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Intrusion Detection ◽  
Sensor Network ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Trust Evaluation

21st century is considered as the era of communication, and Wireless Sensor Networks (WSN) have assumed an extremely essential job in the correspondence period. A wireless sensor network is defined as a homogeneous or heterogeneous system contains a large number of sensors, namely called nodes used to monitor different environments in cooperatives. WSN is composed of sensor nodes (S.N.), base stations (B.S.), and cluster head (C.H.). The popularity of wireless sensor networks has been increased day by day exponentially because of its wide scope of utilizations. The applications of wireless sensor networks are air traffic control, healthcare systems, home services, military services, industrial & building automation, network communications, VAN, etc. Thus the wide range of applications attracts attackers. To secure from different types of attacks, mainly intruder, intrusion detection based on dynamic state context and hierarchical trust in WSNs (IDSHT) is proposed. The trust evaluation is carried out in hierarchical way. The trust of sensor nodes is evaluated by cluster head (C.H.), whereas the trust of the cluster head is evaluated by a neighbor cluster head or base station. Hence the content trust, honest trust, and interactive trust are put forward by combining direct evaluation and feedback based evaluation in the fixed hop range. In this way, the complexity of trust management is carried in a hierarchical manner, and trust evaluation overhead is minimized.

An Approach to Secure Data Aggregation in Wireless Sensor Networks (WSN) using Asymmetric Homomorphic Encryption (Elliptic Curve Cryptography) Scheme

2017 ◽  
Vol 7 (7) ◽  
pp. 263
Author(s):  
Md Sirajul Huque ◽  
Sk. Bhadar Saheb ◽  
Jayaram Boga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Elliptic Curve ◽  
Sensor Network ◽  
Data Aggregation ◽  
Elliptic Curve Cryptography ◽  
Base Station ◽  
Wireless Sensor ◽  
Secure Data Aggregation ◽  
Secured Data

Wireless sensor networks (WSN) are a collection of autonomous collection of motes. Sensor motes are usually Low computational and low powered. In WSN Sensor motes are used to collect environmental data collection and pass that data to the base station. Data aggregation is a common technique widely used in wireless sensor networks. [2] Data aggregation is the process of collecting the data from multiple sensor nodes by avoiding the redundant data transmission and that collected data has been sent to the base station (BS) in single route. Secured data aggregation deals with Securing aggregated data collected from various sources. Many secured data aggregation algorithms has been proposed by many researchers. Symmetric key based cryptography schemes are not suitable when wireless sensor network grows. Here we are proposing an approach to secured data aggregation in wireless sensor networks using Asymmetric key based Elliptic Curve cryptography technique. Elliptic curve cryptography (ECC) [1] is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. Elliptic Curve Cryptography requires smaller keys compared to non-Elliptic curve cryptography (based on plain Galois fields) to provide equivalent security. The proposed technique of secure data aggregation is used to improve the sensor network lifetime and to reduce the energy consumption during aggregation process.

Presenting the Hybrid Algorithm of Honeybee - Harmony in Clustering and Routing of Wireless Sensor Networks

2019 ◽  
Vol 9 (3) ◽  
pp. 357-371
Author(s):  
Mohammad Sedighimanesh ◽  
Hesam Zandhesami ◽  
Ali Sedighimanesh
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Network Lifetime ◽  
Cluster Head ◽  
Rechargeable Batteries ◽  
Base Station ◽  
Wireless Sensor

Background: Wireless sensor networks are considered as one of the 21st century's most important technologies. Sensors in wireless sensor networks usually have limited and sometimes non-rechargeable batteries, which they are supposed to be preserved for months or even years. That's why the energy consumption in these networks is of a great importance. Objective: One way to improve energy consumption in a wireless sensor network is to use clustering. In clustered networks, one node is known as the cluster head and other nodes as normal members, which normal nodes send the collected data to the cluster head, and the cluster head sends the information to the base station either by a single step or by multiple steps. Method: Using clustering simplifies resource management and increases scalability, reliability, and the network lifetime. Although the cluster formation involves a time- overhead and how to choose the cluster head is another problem, but its advantages are more than its disadvantages. : The primary aim of this study is to offer a solution to reduce energy consumption in the sensor network. In this study, during the selection of cluster heads, Honeybee Algorithm is used and also for routing, Harmonic Search Algorithm is used. In this paper, the simulation is performed by using MATLAB software and the proposed method is compared with the Low Energy Adaptive Clustering Hierarchy (LEACH) and the multi-objective fuzzy clustering algorithm (MOFCA). Result and Conclusion: By simulations of this study, we conclude that this research has remarkably increased the network lifetime with respect to EECS, LEACH, and MOFCA algorithms. In view of the energy constraints of the wireless sensor network and the non-rechargeable batteries in most cases, providing such solutions and using metaheuristic algorithms can result in a significant reduction in energy consumption and, consequently, increase in the network lifetime.

Enhanced Auxiliary Cluster Head Selection Routing Algorithm in Wireless Sensor Networks

2019 ◽  
Vol 12 ◽  
Author(s):  
Gaurav Kumar Nigam ◽  
Chetna Dabas
Keyword(s):  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Cluster Head ◽  
Base Station ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Head Selection

Background & Objective: Wireless sensor networks are made up of huge amount of less powered small sensor nodes that can audit the surroundings, collect meaningful data, and send it base station. Various energy management plans that pursue to lengthen the endurance of overall network has been proposed over the years, but energy conservation remains the major challenge as the sensor nodes have finite battery and low computational capabilities. Cluster based routing is the most fitting system to help for burden adjusting, adaptation to internal failure, and solid correspondence to draw out execution parameters of wireless sensor network. Low energy adaptive clustering hierarchy is an efficient clustering based hierarchical protocol that is used to enhance the lifetime of sensor nodes in wireless sensor network. It has some basic flaws that need to be overwhelmed in order to reduce the energy utilization and inflating the nodes lifetime. Methods : In this paper, an effective auxiliary cluster head selection is used to propose a new enhanced GC-LEACH algorithm in order to minimize the energy utilization and prolonged the lifespan of wireless sensor network. Results & Conclusion: Simulation is performed in NS-2 and the outcomes show that the GC-LEACH outperforms conventional LEACH and its existing versions in the context of frequent cluster head rotation in various rounds, number of data packets collected at base station, as well as reduces the energy consumption 14% - 19% and prolongs the system lifetime 8% - 15%.

scholarly journals An Enhanced Source Location Privacy based on Data Dissemination in Wireless Sensor Networks (DeLP)

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2050 ◽  
Author(s):  
Naveed Jan ◽  
Ali Al-Bayatti ◽  
Naseer Alalwan ◽  
Ahmed Alzahrani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Location Privacy ◽  
Source Location ◽  
Base Station ◽  
Source Node ◽  
Wireless Sensor ◽  
Packet Delivery ◽  
Safety Period

Wireless Sensor Network is a network of large number of nodes with limited power and computational capabilities. It has the potential of event monitoring in unattended locations where there is a chance of unauthorized access. The work that is presented here identifies and addresses the problem of eavesdropping in the exposed environment of the sensor network, which makes it easy for the adversary to trace the packets to find the originator source node, hence compromising the contextual privacy. Our scheme provides an enhanced three-level security system for source location privacy. The base station is at the center of square grid of four quadrants and it is surrounded by a ring of flooding nodes, which act as a first step in confusing the adversary. The fake node is deployed in the opposite quadrant of actual source and start reporting base station. The selection of phantom node using our algorithm in another quadrant provides the third level of confusion. The results show that Dissemination in Wireless Sensor Networks (DeLP) has reduced the energy utilization by 50% percent, increased the safety period by 26%, while providing a six times more packet delivery ratio along with a further 15% decrease in the packet delivery delay as compared to the tree-based scheme. It also provides 334% more safety period than the phantom routing, while it lags behind in other parameters due to the simplicity of phantom scheme. This work illustrates the privacy protection of the source node and the designed procedure may be useful in designing more robust algorithms for location privacy.

Sign in / Sign up

Export Citation Format

Share Document