scholarly journals Secure Routing Protocols for Source Node Privacy Protection in Multi-Hop Communication Wireless Networks

Energies ◽  
2020 ◽  
Vol 13 (2) ◽  
pp. 292 ◽  
Author(s):  
Lilian C. Mutalemwa ◽  
Seokjoo Shin
Keyword(s):  
Energy Consumption ◽  
Routing Protocols ◽  
Traffic Analysis ◽  
High Energy ◽  
Secure Routing ◽  
Source Node ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Packet Routing ◽  
Traffic Pattern

Traffic analysis attacks are common in monitoring wireless sensor networks (WSNs). In the attacks, adversaries analyze the traffic pattern to obtain critical information such as the location information of a source node. Fake source packet routing protocols are often used to ensure source location privacy (SLP) protection. The protocols rely on broadcasting fake packets from fake sources concurrently with the transmission of real packets from the real source nodes to obfuscate the adversaries. However, fake source packet routing protocols have demonstrated some performance limitations including high energy consumption, low packet delivery ratio (PDR), and long end-to-end delay (EED). In this study, two existing fake source packet routing protocols are considered. Then two new phantom-based SLP routing protocols are proposed to address the limitations. Each proposed protocol introduces a two-level phantom routing strategy to ensure two adversary confusion phases. When the adversaries perform traffic analysis attacks on the packet routes, they encounter two levels of obfuscation. Simulation results establish that the proposed protocols have superior performance features. The protocols guarantee strong SLP protection throughout the WSN domain with controlled energy consumption, PDR, and EED. Furthermore, the proposed protocols achieve more practical results under varied network configurations.

scholarly journals An Efficient Routing Protocol Based on Stretched Holding Time Difference for Underwater Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (24) ◽  
pp. 5557 ◽  
Author(s):  
Zahid Wadud ◽  
Khadem Ullah ◽  
Abdul Baseer Qazi ◽  
Sadeeq Jan ◽  
Farrukh Aslam Khan ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Routing Protocols ◽  
Acoustic Waves ◽  
Time Difference ◽  
Holding Time ◽  
Source Node ◽  
Delivery Ratio ◽  
Optical Waves ◽  
High Attenuation ◽  
Hidden Terminal

Underwater Wireless Sensors Networks (UWSNs) use acoustic waves as a communication medium because of the high attenuation to radio and optical waves underwater. However, acoustic signals lack propagation speed as compared to radio or optical waves. In addition, the UWSNs also pose various intrinsic challenges, i.e., frequent node mobility with water currents, high error rate, low bandwidth, long delays, and energy scarcity. Various UWSN routing protocols have been proposed to overcome the above-mentioned challenges. Vector-based routing protocols confine the communication within a virtual pipeline for the sake of directionality and define a fixed pipeline radius between the source node and the centerline station. Energy-Scaled and Expanded Vector-Based Forwarding (ESEVBF) protocol limits the number of duplicate packets by expanding the holding time according to the propagation delay, and thus reduces the energy consumption via the remaining energy of Potential Forwarding Nodes (PFNs) at the first hop. The holding time mechanism of ESEVBF is restricted only to the first-hop PFNs of the source node. The protocol fails when there is a void or energy hole at the second hop, affecting the reliability of the system. Our proposed protocol, Extended Energy-Scaled and Expanded Vector-Based Forwarding Protocol (EESEVBF), exploits the holding time mechanism to suppress duplicate packets. Moreover, the proposed protocol tackles the hidden terminal problem due to which a reasonable reduction in duplicate packets initiated by the reproducing nodes occurs. The holding time is calculated based on the following four parameters: (i) the distance from the boundary of the transmission area relative to the PFNs’ inverse energy at the 1st and 2nd hop, (ii) distance from the virtual pipeline, (iii) distance from the source to the PFN at the second hop, and (iv) distance from the first-hop PFN to its destination. Therefore, the proposed protocol stretches the holding time difference based on two hops, resulting in lower energy consumption, decreased end-to-end delay, and increased packet delivery ratio. The simulation results demonstrate that compared to ESEVBF, our proposed protocol EESEVBF experiences 20.2 % lesser delay, approximately 6.66 % more energy efficiency, and a further 11.26 % reduction in generating redundant packets.

Performance Analysis of Energy Efficient Opportunistic Routing Protocols in Wireless Sensor Network

2019 ◽  
Vol 09 ◽  
Author(s):  
Premkumar Chithaluru ◽  
Rajeev Tiwari ◽  
Kamal Kumar
Keyword(s):  
Energy Consumption ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Data Communication ◽  
Opportunistic Routing ◽  
Link Quality ◽  
Delivery Ratio ◽  
Performance Parameters ◽  
Wireless Medium ◽  
Reduce Energy Consumption

Background: Energy Efficient wireless routing has been an area of research particularly to mitigate challenges surrounding performance in category of Wireless Networks. Objectives: The Opportunistic Routing (OR) technique was explored in recent times and exhibits benefits over many existing protocols and can significantly reduce energy consumption during data communication with very limited compromise on performance. Methods : Using broadcasting nature of the wireless medium, OR practices to discourse two foremost issues of variable link quality and unpredictable node agility in constrained WSNs. OR has a potential to reduce delay in order to increase the consistency of data delivery in network. Results : Various OR based routing protocols have shown varying performances. In this paper, a detailed conceptual and experimental analysis is carried out on different protocols that uses OR technique for providing more clear and definitive view on performance parameters like Message Success Rate, Packet Delivery Ratio and Energy Consumption.

Performance study and critical review on energy aware routing protocols in mobile sink based WSNs

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Aparna Ashok Kamble ◽  
Balaji Madhavrao Patil
Keyword(s):  
Wireless Networks ◽  
Energy Consumption ◽  
Routing Protocols ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Optimization Approach ◽  
Performance Study ◽  
Energy Aware ◽  
Energy Aware Routing

Abstract Wireless networks involve spatially extended independent sensor nodes, and it is associated with each other’s to preserve and identify physical and environmental conditions of the particular application. The sensor nodes batteries are equipped with restricted energy for working with an energy source. Consequently, efficient energy consumption is themain important challenge in wireless networks, and it is outfitted witharestricted power storage capacity battery. Therefore, routing protocol with energy efficiency is essential in wireless sensor network (WSN) to offer data transmission and connectivity with less energy consumption. As a result, the routing scheme is the main factor for decreasing energy consumption and the network's lifetime. The energy-aware routing model is mainly devised for WSN with high network performance when transmitting data to a sink node. Hence, in this paper, the effectiveness of energy-aware routing protocols in mobile sink-based WSNs is analyzed and justified. Some energy-aware routing systems in mobile sink-based WSN techniques, such as optimizing low-energy adaptive clustering hierarchy (LEACH) clustering approach, hybrid model using fuzzy logic, and mobile sink. The fuzzy TOPSIS-based cluster head selection (CHS) technique, mobile sink-based energy-efficient CHS model, and hybrid Harris Hawk-Salp Swarm (HH-SS) optimization approach are taken for the simulation process. Additionally, the analytical study is executed using various conditions, like simulation, cluster size, nodes, mobile sink speed, and rounds. Moreover, the performance of existing methods is evaluated using various parameters, namely alive node, residual energy, delay, and packet delivery ratio (PDR).

scholarly journals Energy Efficient Multipath Routing Algorithm for Wireless Multimedia Sensor Network

Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3642 ◽  
Author(s):  
Genta ◽  
K.Lobiyal ◽  
Abawajy
Keyword(s):  
Energy Consumption ◽  
Performance Analysis ◽  
Routing Protocols ◽  
Traffic Accidents ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Cluster Head ◽  
Data Communication ◽  
High Energy ◽  
Wireless Multimedia

Wireless multimedia sensor networks (WMSNs) are capable of collecting multimedia events, such as traffic accidents and wildlife tracking, as well as scalar data. As a result, WMSNs are receiving a great deal of attention both from industry and academic communities. However, multimedia applications tend to generate high volume network traffic, which results in very high energy consumption. As energy is a prime resource in WMSN, an efficient routing algorithm that effectively deals with the dynamic topology of WMSN but also prolongs the lifetime of WMSN is required. To this end, we propose a routing algorithm that combines dynamic cluster formation, cluster head selection, and multipath routing formation for data communication to reduce energy consumption as well as routing overheads. The proposed algorithm uses a genetic algorithm (GA)-based meta-heuristic optimization to dynamically select the best path based on the cost function with the minimum distance and the least energy dissipation. We carried out an extensive performance analysis of the proposed algorithm and compared it with three other routing protocols. The results of the performance analysis showed that the proposed algorithm outperformed the three other routing protocols.

scholarly journals Energy Efficient Cross Layer Based Multi-Hop Clustered Routing Protocol For Wireless Sensor Networks

2019 ◽  
Vol 8 (4) ◽  
pp. 11996-12003
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Protocols ◽  
Cluster Head ◽  
High Energy ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cross Layer ◽  
User Friendly

Wireless Sensor network becomes an essential part of Internet of things paradigm due their scalability, ease of deployment and user-friendly interface. However, certain issues like high energy consumption, low network lifetime and optimum quality of service requirement force researchers to develop new routing protocols. In WSNs, the routing protocols are utilized to obtain paths having high quality links and high residual energy nodes for forwarding data towards the sink. Clustering provide the better solution to the WSN challenges by creating access points in the form of cluster head (CH). However, CH must tolerate additional burden for coordinating network activities. After considering these issues, the proposed work designs a moth flame optimization (MFO) based Cross Layer Clustering Optimal (MFO-CLCO) algorithm to consequently optimize the network energy, network lifetime, network delay and network throughput. Multi-hop wireless communication between cluster heads (CHs) and base station (BS) is employed along with MFO to attain optimum path cost. The simulation results demonstrate that the proposed scheme outperforms existing schemes in terms of energy consumption, network lifetime, delay and throughput.

scholarly journals An Empirical Critique of On-Demand Routing Protocols against Rushing Attack in MANET

2015 ◽  
Vol 5 (5) ◽  
pp. 1102 ◽  
Author(s):  
S. Ashok Kumar ◽  
E. Suresh Babu ◽  
C. Nagaraju ◽  
A. Peda Gopi
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Ad Hoc Routing ◽  
On Demand ◽  
Secure Routing Protocols ◽  
Demand Routing ◽  
Hostile Environments ◽  
Centralized System

<div><table cellspacing="0" cellpadding="0" align="left"><tbody><tr><td align="left" valign="top"><p>Over the last decade, researchers had  proposed numerous  mobile ad hoc routing protocols for which are operate in an on-demand way, as standard on-demand routing protocols such as AODV, DSR and TORA, etc., have been shown to often have faster reaction time and  lower overhead than proactive protocols. However, the openness of the routing environment and the absence of centralized system and infrastructure make them exposed to security attacks in large extent.  In particular, one such kind of attacks is rushing attack, which is mostly hard to detect due to their inherited properties, that alters the network statistics radically. In this paper, we modeled a rushing attack which is a powerful attack that exploits the weaknesses of the secure routing protocols. Moreover, to know the weakness and strength of these protocols, it is necessary to test their performance in hostile environments. Subsequently, the performance is measured with the various metrics, some ot them are average throughput, packet delivery ratio, average end-to-end delay and etc., to compare and evaluate their performance.</p></td></tr></tbody></table></div>

scholarly journals Identifying and Improving the Malicious Behavior of Rushing and Blackhole Attacks using Proposed IDSAODV Protocol

2019 ◽  
Vol 8 (3) ◽  
pp. 6554-6562
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Secure Routing ◽  
Wireless Ad Hoc Network ◽  
Delivery Ratio ◽  
End To End Delay ◽  
Aodv Routing Protocol

Wireless Ad hoc Network is established by a collection of mobile nodes without any fixed infrastructure, where each node plays a role of the router. There are not any centralize control to handle the routing process of network, due to the dynamic tropology and infrastructure less network the network is vulnerable to various kinds of attacks. Therefore, numerous proactive, reactive and hybrid routing protocols have been recommended, among which one of the well-known a protocol is AODV due to its high-performance gain. This research work contributes towards mitigating network layer attacks on routing protocols in Wireless Ad hoc Networks. Problem and it's security issues because its consequences and existing mechanisms for detection and prevention with the context of AODV protocol is a challenge in Wireless Ad hoc Network, particularly in MANET and Sensor network. We present an AODV based secure routing algorithm for detection and prevention of different network layer attacks such as blackhole and rushing attacks. We use different types of security parameters like node sequence numbers, hop count, trust value, path value, acknowledge time, the threshold value and ALERT packet message to design a secure algorithm for AODV routing protocol. It shows enactment evaluation of AODV with the enhanced secure routing algorithm and existing routing algorithm through simulations which will confirm the effectiveness and accuracy of the algorithm by considering performance metrics like throughput, packet delivery ratio and end to end delay. Using network simulator NS-2.35 the experimental results have been shown an improvement in throughput, packet delivery ratio (PDR), and end to end delay using IDSAODV and results are compared with normal AODV routing protocol for blackhole and rushing attacks. The comparative results have been also shown with proposed IDSAODV and existing method

scholarly journals C2S2-LOOP: Circular Chessboard-Based Secure Source Location Privacy Model Using ECC-ALO in WSN

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Naveed Jan ◽  
Sarmadullah Khan ◽  
Ali H. Al-Bayatti ◽  
Madini O. Alassafi ◽  
Ahmed S. Alfakeeh ◽  
...  
Keyword(s):  
Energy Consumption ◽  
Network Topology ◽  
Location Privacy ◽  
High Energy ◽  
Source Location ◽  
Source Node ◽  
Key Generation ◽  
Source Location Privacy ◽  
Privacy Model ◽  
Safety Period

Source location privacy (SLP) is a serious issue in wireless sensor networks (WSN) since Eavesdroppers tries to determine the source location. Hunting Animals in Forest is considered as an example for SLP. Many conventional schemes have been proposed for SLP in WSN, namely, Random Walk Routing, and Fake Messages Transmission, which cause critical issues (less safety period, packet delivery latency, and high energy consumption). Furthermore, the security analysis is not properly investigated in any previous work. In this paper, we propose a new model called the circular chessboard-based secure source location privacy model (C2S2-LOOP) with the following tasks: key generation, network topology management (clustering), intercluster routing (travel plan), and data packets encryption. All sensor nodes are deployed in a circular chessboard (Circular Field) and the key generation ( P U K , S E K ) is invoked using elliptic curve cryptography (ECC) with Ant Lion Optimization algorithm, which mitigate the issues of conventional ECC. Then, the network topology is managed using clustering where residual energy of the nodes is used for Cluster Head (CH) selection. Intercluster routing is implemented using packet traversing using clockwise and anticlockwise directions, which are mainly concerned with establishing a secure route between the source to the destination node. To ensure data security, we present the Chaotic Artificial Neural Network (C-ANN) in which encryption is executed. Assume that CH near to the source node has a high trust value, then it traverses (clock-wise) real packets towards sink node and similarly in the left side region (anticlockwise), fake packets are transmitted. Network simulations (OMNeT++) are evaluated and compared with the previous approaches, and finally, our proposed scheme concludes that it maintains not only source node location privacy (large safety period) and also reduces energy consumption by more than 40% and latency by more than 35%.

scholarly journals Analysis of Human-Land Coupled Bearing Capacity of Qiangtang Meadow in Northern Tibet Based on Fuzzy Clustering Algorithm

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
ShiBao Li
Keyword(s):  
Energy Consumption ◽  
Bearing Capacity ◽  
Fuzzy Clustering ◽  
Clustering Algorithm ◽  
High Energy ◽  
Geographic Information ◽  
Superior Performance ◽  
Capacity Analysis ◽  
Northern Tibet ◽  
Fuzzy Clustering Algorithm

Aiming to address the problems of high energy consumption, low efficiency, low correlation between the analyzed and actual results, and poor rationality of research indexes in current methods of analysis of human-land coupled bearing capacity of meadows, a novel method of human-land coupled bearing capacity analysis of Qiangtang meadow in northern Tibet, based on fuzzy clustering algorithm, is proposed. Basic geographic information data in Tibet were acquired, the collected data images were registered by ENVI4.2 software, and the collected data were vectorized by ArcGIS 9.3 software to construct a basic geographic information database in Tibet. Based on the frequency domain processing algorithm, the geographic information image was suppressed by noise and filtered by using a high-pass filter to realize the geographic information data processing in the study area. The human-land coupled bearing capacity analysis of Qiangtang meadow in northern Tibet was evaluated through fuzzy clustering, bearing capacity evaluation, and bearing capacity calculation under the sharing of closure. The experimental results showed that the average running energy consumption of the method was 81 J, and 97% of the analyzed results were consistent with the actual situation. These results indicate that the operation efficiency of the method is high, and the rationality coefficient of the research index is large. The proposed method has superior performance and feasibility.

scholarly journals A Study on Improving Secure Routing Performance Using Trust Model in MANET

2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Hwanseok Yang
Keyword(s):  
Data Transmission ◽  
Cluster Structure ◽  
Reliability Evaluation ◽  
Trust Model ◽  
Key Exchange ◽  
Secure Routing ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Secure Data ◽  
Secure Data Transmission

MANET is utilized in many fields because of its advantage in quickly establishing networks. The network will perform well if mobile nodes trust each other and act cooperatively. However, dynamic topology characteristics and frequent connection failures by the movement of nodes make routing difficult and cause vulnerability to be easily exposed. Therefore, the routing provided in the MANET should have security features that can reduce the damage to various attacks. For this, in this paper, it is proposed for a trust evaluation method of nodes using cluster structure and a secure data transmission technique through key exchange without CA. The proposed technique adopted a hierarchical structure to enhance the efficiency of the reliability evaluation of nodes. The reliability measurement reflects the quality of packets as well as the number of packets and the measured reliability is maintained by the trust management node. The integrity of the data transmission is improved through key exchange without CA between the nodes. In order to increase the efficiency of routing, anomaly nodes are detected by DSN checking of nodes that generate excessive traffic on the path when data is transmitted. The proposed technique in this paper can maintain stably the network performance even in the presence of malicious nodes because it ensures reliability evaluation for nodes and the path setting between nodes and secure data transmission. The superior performance of the proposed trust-based model security routing technique was confirmed through comparative experiments for packet delivery ratio, end-to-end delay time, the number of control packets, network throughput, and average path length.

Sign in / Sign up

Export Citation Format

Share Document