scholarly journals Underwater Routing Protocols: Analysis of Intrepid Link Selection Mechanism, Challenges and Strategies

2020 ◽  
Author(s):  
Shahzad Ashraf ◽  
Tauqeer Ahmed
Keyword(s):  
Routing Protocol ◽  
Base Station ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Destination Node ◽  
Delivery Ratio ◽  
Communication Link ◽  
Routing Mechanism ◽  
Pollution Detection ◽  
Terrestrial Network

Abstract The sensor nodes deployed in underwater environment has different routing mechanism in contrast to the terrestrial network. Getting underwater data on pollution detection, control of the ecosystem, marine mining, catastrophe avoidance and strategic surveillance thereby demands smooth packet transmission from dynamic nodes to base station encounters numerous challenges, out of which selecting best communication link between source and destination node is a key phenomenon of Underwater sensor network. The meticulous research has been conducted to search out the best link selection mythology of bodacious underwater routing protocol EnOR, SURS‐PES and USPF. The performance has been evaluated through NS2 simulation for packet delivery ratio, end-to-end delay, network lifespan and network energy consumption.

scholarly journals Energy Efficient Secured Ring Based Clustering Protocol for WSN

2019 ◽  
Vol 9 (2) ◽  
pp. 336-339
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Optimal Path ◽  
Base Station ◽  
Sensor Nodes ◽  
Natural Phenomenon ◽  
Delivery Ratio ◽  
Clustering Protocol ◽  
Autonomous Nodes ◽  
Energy Efficient Clustering

WSN is a gathering of small autonomous nodes that are used to function the Natural Phenomenon. The sensed events are transmitted to the base station for processing the system. Given the Resource Constrained Nature of WSN, Optimizing the energy during Routing process is a major concern. In this Paper, a Novel Ring Based Clustering Routing Protocol(RBCRP) is proposed, where it can provides the energy efficient clustering to sensor nodes. By doing so the sensor nodes it reduces number of retransmission of data items. Moreover, the proposed protocol provides efficient Routing, where it discovers the optimal path. The proposed protocol is implemented in NS3 simulator. The simulator results justifies that, proposed protocol improves Energy efficiency, Reduces delay and Increases packet delivery Ratio. Simulate Results faster viability of the proposed Scheme

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

scholarly journals Security Techniques for Wormhole Attack in Wireless Sensor Networks

2018 ◽  
Vol 7 (2.23) ◽  
pp. 59 ◽  
Author(s):  
Surinder Singh ◽  
Hardeep Singh Saini
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Base Station ◽  
Packet Transmission ◽  
Wireless Sensor ◽  
Security Threat ◽  
Wormhole Attack ◽  
Protocol Security ◽  
Routing Mechanism ◽  
Packet Drop

The wireless sensor network has group of sensors which can sense the data and route this data to base station. As there is no physical connection between sensor and base station the important data can be routed without wires. The broadcast nature of wireless sensor network makes it prone to security threat to the valuable data. The attacker node can detect the data by creating their own data aggregation and routing mechanism .The number of attacks can be possible on the network layer. Out of these attacks wormhole is one of the major attack which can change the routing method of the whole wireless sensor network. In this attack,the attacker node can control the packet transmission of whole network and route it to the tunnel of nodes. The major drawback of this attack is to increase the packet drop and disturbing the routing mechanism. A number of security techniques are developed by the researcher to reduce the packet drop ratio and secure the routing mechanism of the network. Out of all thesetechniquesfew related to packet drop ratio are discussed in this paper. TheLightweight countermeasure for the wormhole attack (LITEWORP) based on Dynamic Source routing (DSR) protocol security technique,Delay Per Hop Indication (Delphi) based on AODV(Avoidance Routing Protocol) Protocol security technique and MOBIWORP based on DSRprotocol security technique reduce the packet loss percentage 40%,43% and 35% respectively.   

scholarly journals Geographic-based Routing in Smart Grid’s Neighbor Area Networks

2014 ◽  
Vol 3 (3-4) ◽  
Author(s):  
Quang-Dung Ho ◽  
Gowdemy Rajalingham ◽  
Tho Le-Ngoc
Keyword(s):  
Demand Response ◽  
Routing Protocol ◽  
Information Exchange ◽  
Ieee 802.15.4 ◽  
Packet Transmission ◽  
Delivery Ratio ◽  
Area Network ◽  
Smart Meter ◽  
Smart Grid Communications ◽  
Wireless Mesh

Neighbor area network (NAN), also known as smart meter communication network, is one of the most important segments of smart grid communications network (SGCN). This paper studies the performance of greedy perimeter stateless routing (GPSR), a representative implementation of geographic-based routing class, in the NAN scenario and investigates the feasibility of this routing protocol in supporting SG applications. Specifically, packet transmission delay and reliability of GPSR in an IEEE 802.15.4-based wireless mesh NAN with practical system parameters are measured by simulations. The results show that, at the data rate required for conventional SG applications including smart metering, real-time pricing and demand response, the delay can always be maintained below 70 ms (in 95th-percentile perspective) while packet delivery ratio is higher than 90%. However, due to that fact that more advanced applications that require information exchange at higher rates and more stringent delays are emerging in SG, the performance of GPSR in NAN scenarios using radio technologies that can support higher loads and/or larger network scales needs to be studied.

scholarly journals An Energy Efficient Secure Data Aggregation in Wireless Sensor Networks

2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Aggregated Data

Abstract In Wireless sensor network, the major issues are security and energy consumption. There may be several numbers of malicious nodes present in sensor networks. Several techniques have been proposed by the researchers to identify these malicious nodes. WSNs contain many sensor nodes that sense their environment and also transmit their data via multi-hop communication schemes to the base station. These sensor nodes provides power supply using battery and the energy consumption of these batteries must be low. Securing the data is to avoid attacks on these nodes and data communication. The aggregation of data helps to minimize the amount of messages transmitted within the network and thus reduces overall network energy consumption. Moreover, the base station may distinguish the encrypted and aggregated data based on the encryption keys during the decryption of the aggregated data. In this paper, two aspects of the problem is concerned, we investigate the efficiency of data aggregation: first, how to develop cluster-based routing algorithms to achieve the lowest energy consumption for aggregating data, and second, security issues in wsn. By using Network simulator2 (NS2) this scheme is simulated. In the proposed scheme, energy consumption, packet delivery ratio and throughput is analyzed. The proposed clustering, routing, and protection protocol based on the MCSDA algorithm shows significant improvement over the state-of - the-art protocol.

scholarly journals APSSR: Adaptive Packet Size Selection Based Routing Protocol for Underwater Acoustic Sensor Networks

2021 ◽  
Vol 10 (3) ◽  
pp. 2313-2323
Keyword(s):  
Sensor Networks ◽  
Routing Protocol ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Data Delivery ◽  
Acoustic Sensor ◽  
Packet Size ◽  
Underwater Acoustic Sensor Networks ◽  
Acoustic Sensor Networks ◽  
Selection Of

Underwater Acoustic Sensor Networks offer very promising solutions to monitor the aqueous environments. Due to the distinctive characteristics of UASNs, it is very challenging to design a routing protocol that can achieve maximum data delivery ratio in the network. The main challenge is the communication medium (acoustic links) that is subject to temporary attenuation and high bit error rate (BER), which limits the throughput efficiency of the Network. Besides this, another major issue is the continuous movement of nodes due to water currents and the availability of limited resources. Due to nodes mobility distance among sensor nodes and consequently, BER varies, which have a direct impact on packet size, hence, leads to high packet loss and low data delivery ratio. To achieve a high data delivery ratio, the selection of optimal packet size is of utmost importance. Consequently, the selection of next-hop forwarding node based on optimal packet size is needed. Therefore, in this paper, we propose an adaptive routing protocol named Adaptive Packet Size Selection Based Routing (APSSR) Protocol for UASNs. APSSR determines the optimal packet size adaptively based on both varying distances between sensor nodes and BER and selects the next hop based on optimal packet size and BER. The simulation results show greater network performance in terms of Network Lifetime, Data Reception Ratio at Sink node, Average Network Delay, Packet Reception Ratio, and Packets Drop Ratio

Communication Trust and Energy-Aware Routing Protocol for WSN Using D-S Theory

2021 ◽  
Vol 13 (4) ◽  
pp. 24-36
Author(s):  
Srinivasan Palanisamy ◽  
Sankar S. ◽  
Ramasubbareddy Somula ◽  
Ganesh Gopal Deverajan
Keyword(s):  
Routing Protocol ◽  
Data Transfer ◽  
Trust Model ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Battery Life ◽  
Delivery Ratio ◽  
Energy Aware ◽  
Decision Making System ◽  
Trust Models

Wireless sensor networks (WSN) deployed in open environments make nodes prone to various security attacks due to their resource constrained nature. The compromised nodes are used to mislead the sensed data and disrupt communication, which can affect the entire decision-making system based on the sensed data. It is also possible to drain the sensor nodes energy and reduce the battery life of the networks. Trust models are the preferred mechanism to secure WSN. In this paper, the authors present communication trust and energy aware (CTEA) routing protocol that make use of the proposed trust model to mitigate the effects of badmouth and energy drain attacks. They use Dempster theory to compute communication trust and also consider the energy metric, to establish the route for data transfer. The simulation result shows that the proposed trust model increases the packet delivery ratio, residual energy, and network lifetime by mitigating the nodes misbehaviour in presence of energy drain and bad mouth attacks.

scholarly journals A Heuristic Algorithm of Cooperative Agents Communication for Enhanced GAF Routing Protocol in WSNs

2019 ◽  
Vol 2019 ◽  
pp. 1-14
Author(s):  
Hanane Aznaoui ◽  
Said Raghay ◽  
Youssef Ouakrim ◽  
Layla Aziz
Keyword(s):  
Routing Protocol ◽  
Physical Environment ◽  
Optimal Path ◽  
Heuristic Method ◽  
Base Station ◽  
Sensor Nodes ◽  
Environmental Research ◽  
Important Data ◽  
Area Of Interest ◽  
Cooperative Agents

Rapid progress in technologies has led to the development of small sensor nodes. A wireless sensor network (WSN) is an interconnected collection of a large number of these small sensor nodes that is used to monitor and record the physical environment. WSNs have applications in diverse scenarios. They play an important role in tracking and monitoring in different domains, such as environmental research, military, and health care. In most of these applications, the WSN is composed of a large number of nodes deployed in an area of interest, and not all nodes are directly connected to the base station (BS). In some cases, batteries of nodes cannot be recharged or changed. For that, the most solution required to overcome these problems is to optimize energy consumed during communication. Data transmission in networks is maintained by routing protocols, which are responsible for discovering the required paths. This paper presents an improvement of the Geographic Adaptive Fidelity (GAF) routing protocol created on a smart actives node selection. The routing process works on cooperative agents communication where another node is activated in the same grid if the data collected are considered as important data, and a heuristic method is used to find an optimal path in terms of energy to transmit data collected until reaching the BS. Simulation results prove that the cooperative agents GAF (CAGAF) routing protocol proposed is more efficient compared to the basic version in terms of considering important data, energy consumed, and dead nodes.

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 Maximization of Lifetime of Wireless Sensor Network with Sensitive Power Dynamic Protocol

2018 ◽  
Vol 7 (3.12) ◽  
pp. 380
Author(s):  
Manish Bhardwaj ◽  
Anil Ahlawat ◽  
Nidhi Bansal
Keyword(s):  
Routing Protocol ◽  
Steering System ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Power Efficient ◽  
Data Packets ◽  
And Performance ◽  
Energy Balanced Routing ◽  
Power Balancing

A vitality effective protocol configuration is a key testing issue in a network of Wireless Sensor. A portion of the few existing vitality effective protocols plots dependably forward the bundles through the base vitality based ideal course to the sink to limit vitality utilization. It causes a disturbed dispersion of remaining vitality between sensor nodes, which prompts partitioning of the network. The prime objective of this method is to pass the data packets to destination node through the vitality denser range within Sensor Networks Lifetime. The current procedure Energy Balanced Routing Protocol (EBRP) neglects to accomplish Throughput, Delay part, keeping in mind the end goal to enhance the Network Lifetime and Performance so the proficient steering convention is required with the abilities of both the Power Efficient and Power Balancing. To resolve this problem, this manuscript proposed Impediment Sensitive Power Unbiased Dynamic Routing Protocol (ISPUDRP). The proposed steering system accomplishes as far as End-to-End Delay, Throughput and Lifetime of network. This manuscript shows that proposed calculation accomplishes better execution performance than the current strategies.   

Sign in / Sign up

Export Citation Format

Share Document