Secure Routing Algorithm Research Articles

A secure and energy efficient ant routing algorithm

In Mobile Ad hoc Networks (MANETs), setting up an ideal and proficient route linking the conveying bodies is the essential objective of the routing protocols. But any assault during the routing stage may upset the communication, paralyzing the whole network. So, providing security in routing for a protected communication between nodes has become a prime concern. In the present study, we propose a Secure Energy Efficient Ant Routing Algorithm (SEEARA) based on Ant Colony Optimization (ACO) algorithm and cryptographic primitives that exercises on power control and secure routing between a pair of network nodes and increases the performance and longevity of the network. Also, it can be realized during simulation studies that SEEARA shows a better solution in comparison with the previously proposed routing protocols.

Joint Energy-Saving Scheduling and Secure Routing for Critical Event Reporting in Wireless Sensor Networks

With the growing concerns about energy saving and security problems in wireless sensor networks (WSNs), we investigated a joint energy saving scheduling and secure routing algorithm for critical event reporting in WSN. When a critical event has been detected, the notification must be safely sent to the sink node through the uplink transmission, and the sink node needs to broadcast the alarm messages to the whole network through the downlink transmission. In the uplink, a joint power allocation and secure routing strategy (JPASR) has been proposed to maximize the routing secure connection probability (RSCP) under the constraint of power. Meanwhile, combined with the level-by-level sleeping scheduling method, the energy-saving and secure uplink transmission can be guaranteed. In the downlink, an energy-first multi-point relays set selection mechanism (EFMSS) is designed to choose the backbone nodes to broadcast messages, and the backbone nodes are waken up by the same level-by-level sleeping scheduling method as the uplink transmission. With the two-step procedure, the critical events are appropriately dealt with and the responses are broadcast to the whole network. Extensive simulations results demonstrate that the energy saving and security performances of the proposed method are superior to the existing ones.

DESR: Differential evolutionary secure routing protocol for mobile ad-hoc networks

Mobile ad-hoc network is an infrastructure-less spontaneously formed wireless environment that is deployed without any centralised unit. All the nodes in this kind of network are assumed to be trustworthy but in the real scenario, a few can be malicious and, therefore, secure and reliable route for data transmission is always a matter of question. This paper presents effective routing solution for mobile ad-hoc networks with differential evolution. The proposed algorithm is termed as Differential Evolution Secure Routing protocol for mobile ad-hoc networks (DESR) with an effective fitness function. The component metrics for the fitness function are the trust factor, residual battery power, and node stability which intend to select most promising routes through the proposed DESR algorithm. The simulation is carried out in various scenarios to evaluate the performance of the differential evolutionary secure routing algorithm with packet delivery ratio, average end-to-end delay, and throughput. Results are compared with two algorithms PSO and TSR.

QoS Aware Trust Based Routing Algorithm for Wireless Sensor Networks

In Wireless Sensor Network (WSN), the lifetime optimization based on minimal energy consumption and security are the crucial issues for the effective design of protocols to perform multi-hop secure routing. In order to address these issues, we propose a new routing protocol called Secured Quality of Service (QoS) aware Energy Efficient Routing Protocol in this paper which is designed based on trust and energy modelling for enhancing the security of WSN and also to optimize the energy utilization. In this proposed work, the trust modelling uses an authentication technique with a key based security mechanism for providing trust scores. Moreover, three types of trust scores namely direct, indirect and overall trust scores are calculated in this work for enhancing the security of communication. In addition, a cluster based secure routing algorithm is proposed in this work in which the cluster head has been selected based on QoS metrics and trust scores to perform cluster based secure routing. Finally, the final path has been selected based on path-trust, energy and hop count to efficiently carry out the secure routing process. The proposed work has been assessed by simulations carried out using NS2 simulator. The simulation results demonstrate that the proposed algorithm provides better performance in terms of increase in packet delivery ratio, network life time and security. Moreover, it provides reduction in delay and energy consumption when the proposed secure routing algorithm is compared to the other related secure routing algorithms.

Identifying and Improving the Malicious Behavior of Rushing and Blackhole Attacks using Proposed IDSAODV 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.

Development of Optimized and Secure Routing Algorithm Using AODV, ACO and LSB Steganography for Mobile Ad-Hoc Network

Development of Optimized and Secure Routing Algorithm Using AODV, ACO and LSB Steganography for Mobile Ad-Hoc Network

Two Variants of Secure Routing Algorithms in Mobile Ad Hoc Network

Background and Objective: Two different variants of secure routing algorithms are proposed in the present work. In both the variants a stable route is established between source and destination. Methods: The selected route is associated with the nodes having sufficient energy to establish the route and to transmit the data packets, minimum velocity to reduce the frequency of link failure, maximum distance from the source node to reduce the number of hops in the selected route, minimum number of neighbors to reduce the routing overhead. Each variant has two phases. In the first phase it is assumed that the selected route has no attackers. The first phase is made more realistic in the second phase by considering the presence of attacker in the selected route. In the first variant a node associated with the selected route overhears the transmission of the next forwarder node to detect an attacker node in the routing path. But a node may fail to overhear its next hop in presence of hidden node, due to limited overhear range etc. Such problem is eliminated in the second variant. In the second variant each node associated with the selected route searches its data packet buffer for the reception of the next data packet from its predecessor node associated with the same route and suspects the predecessor node as an attacker in case the next data packet is not found in the buffer. The performance of both the variants is compared on the basis of packet delivery ratio, throughput and average end-to-end delay. Results: The throughput and packet delivery ratio are higher in the second variant than the first variant whereas the average end-to-end delay is less in the second variant than the first variant. Conclusion: Moreover both the variants outperform the existing schemes in terms of packet delivery ratio, throughput and average end-to-end delay.

Elliptic key cryptography with Beta Gamma functions for secure routing in wireless sensor networks

The security of data communicated through wireless networks is a challenging issue due to the presence of malicious and unauthenticated users whose intention is either to disrupt the communication or to know context of the data communicated to perform data theft and prevent the communication made by genuine users. To address this problem, a new secure routing algorithm with a novel encryption scheme is proposed in this paper using the cyclic group based Elliptic curve cryptography in which an encryption key is formed from the points taken from the Beta and Gamma functions in the elliptic key cryptography. For this purpose, the elliptic key is encrypted using the proposed encryption and decryption schemes. Further, it is proved that the proposed model decreases the computational complexity and increases the security, when it is compared to the other signature schemes. This scheme has been tested both analytically and using computer implementation of the proposed secure routing algorithm for wireless sensor networks. It is proved that this proposed scheme is more reliable in providing security than the existing algorithms. The cyclic group used in this work makes the number of elements to be from a finite set of integers and hence the computational complexity is reduced and finite. The experiments have been carried out using Python coding and by transmitting different number of words through the wireless network. It is found that overall complexity for encryption and communication is less in this proposed algorithm than the existing Elliptic Curve Cryptography algorithm.

A Matrix-Based Pair-Wise Key Establishment for Secure and Energy Efficient WSN-Assisted IoT

The Internet of Things (IoT) is getting the reputation as one of the most optimistic networking paradigms that is reducing the gap between the cyber world and physical world. Most of the participating nodes in IoT network are sensors, which are limited in terms of resource such as energy, computation power, memory and so on. In IoT network, nodes communicate with each other via wireless medium, which makes the IoT network vulnerable to many security threats including eavesdropping. The IoT network is deployed in a large area and work on 24/7 hours, so an energy efficient scheme is one of the major issues in IoT. To achieve secure and energy efficient network, this article contributes: (1) A hierarchical topology for IoT network deployment; (2) symmetric matrix-based pair-wise key generation for secure communication; (3) A secure and energy efficient secure routing algorithm for the proposed model.

A trusted fuzzy based stable and secure routing algorithm for effective communication in mobile adhoc networks

Mobile Ad-hoc Networks have distinct characteristics namely lack of centralized control and management, severe resource constraints in terms of energy level of nodes, computing power, frequent mobility and frequent change of topology. This dynamic nature of mobile adhoc networks lead to additional overhead in the provision of secured and stable routing. In order to address these issues, we propose a new integrated approach for secure routing approach in this paper which is made of two new algorithms called as the Trust based Next Forwarding Node Selection algorithm and Fuzzy Based Stable and Secure Routing algorithm that makes use of the trust based node selection procedure for providing efficient routing performance. The main contribution of this newly proposed node selection procedure is that this technique uses trust values to isolate the malicious nodes from the routing process in order to enhance the security. Hence, this proposed stable and secured routing technique performs reliable routing by selecting only trusted nodes with high residual energy and link stability. Another contribution of this work is the development of a Fuzzy Inference System which is used to handle uncertainty in the selection of trusted nodes and to identify the stable routes by performing qualitative analysis on trust values and link properties. From the implementation and testing carried out in this research work, it has been observed and proved that this proposed secured routing algorithm is capable of increasing the network performance in terms of improved packet delivery ratio, reduction in delay as well as false positive rate when compared with related secure routing algorithms.

An Energy Aware Trust Based Secure Routing Algorithm for Effective Communication in Wireless Sensor Networks

Security is an important phenomena for energy conservation in wireless sensor networks (WSN). Moreover, the management of trust in the WSN is a challenging task since trust is used when collaboration is critical to achieve reliable communication. In a military application using WSN, it is often necessary to communicate secret information such as military operation urgently. However, the existing routing algorithms do not consider security in the routing process. Moreover, since security is an important aspect in WSN, it is necessary to consider the security aspects in routing algorithms. Different approaches for providing security are trust management, intrusion detection, firewalls and key management are considered in the literature. Among them, trust management can provide enhanced security when it is compared with other security methods. Therefore, a new secure routing algorithm called energy aware trust based secure routing algorithm is proposed in this paper where the trust score evaluation is used to detect the malicious users effectively in WSN and spatio-temporal constraints are used with decision tree algorithm for selecting the best route. From the experiments conducted, it is proved that the proposed trust based routing algorithm achieves significant performance improvement over the existing schemes in terms of security, energy efficiency and packet delivery ratio.

Secure Routing for Multihop Ad Hoc Networks With Inhomogeneous Eavesdropper Clusters

This paper studies finding the secure path according to the secrecy connectivity probability (SCP) in the multihop ad hoc networks in the presence of inhomogeneous eavesdropper clusters. We consider both random and fixed eavesdropper clusters, where the former case assumes that there is no knowledge of the locations of the clusters and the latter case assumes that the locations of the clusters can be estimated accurately. First, we derive the end-to-end SCP to characterize the secrecy performance of a given path in a general multihop wireless network with half-duplex randomize-and-forward relaying. Then, we consider a full-duplex scheme at the legitimate receiver, which receives the useful information while broadcasting a jamming signal to the potential eavesdroppers to further enhance the secrecy connectivity. Then, a novel secure routing algorithm that can provide the maximum SCP for any legitimate transmitter/receiver pair in a distributed manner is proposed. The theoretical analysis is verified by Monte Carlo simulation results. The results show that our secure routing algorithm provides similar results compared to an exhaustive search. For the random eavesdropper cluster case, the optimal route is independent of the knowledge of the cluster, which is the same as the homogeneous eavesdropper case. However, for the case where eavesdropper clusters are fixed and their locations are known a priori , the optimal path selection depends on the radii and locations of the eavesdropper clusters and the average number of eavesdroppers in each cluster.

Advanced Secured Routing Algorithm of Vehicular Ad-Hoc Network

Advances in wireless communication have opened up significant avenues wherein vehicles can themselves communicate with other vehicles and roadside infrastructure strategically placed at critical se...

A survery on platform of secured routing algorithm

This paper describes the characteristics and techniques of Ad Hoc network. Ad Hoc networks are temporary network, set anywhere with-out any need of external infrastructure like wires. The essential premise of this paper is to exchange confidential message over wireless medium without route break and unauthorized eavesdroppers. In recent years, the research of routing protocol for AdHoc network has caused public concern widely. The multi hopping routing protocol has failed to meet the needs of network topology and route restructure. It must also consider the bandwidth and high error rate. The new routing protocol suitable for solving these problems in Ad Hoc network is AODV.

A secured routing algorithm against black hole attack for better intelligent transportation system in vehicular ad hoc network

The societal costs accompanying the developments are usually related to traffic congestion and accidents. The condition can be enhanced by providing timely information on traffic conditions using vehicular ad-hoc networks. vehicular ah hoc network (VANET), which is an essential technology in the realization of intelligent transportation system (ITS), has key challenges such as infrequent link connection duration and high packet drop ratio. In this paper, an algorithm is proposed which provides security against attacks on routing protocols and better network connectivity. In this algorithm, attacker node or the chain of attacker node can be identified, and IPs of these attacker nodes are blacklisted which implies if any RREP (route reply packet)come from the blacklisted node then that RREP will be discarded. The proposed algorithm is implemented using NCTUns network simulator and comparison of leading VANET protocols ad hoc on-demand distance vector (AODV), B-AODV (AODV with black hole attack) with the proposed secured algorithm is done. Extensive simulation scenarios are considered, and final results show that proposed algorithm has 40% higher throughput in comparison to AODV protocol, which makes it more efficient in a dense vehicular environment having V2V communication. Also, the proposed algorithm has 10% lower packet drop and a lesser number of collisions which renders it more reliable for the vehicle vehicle (V2V) environment. It proves that proposed secured routing algorithm performs better than standard AODV in the presence of malicious nodes causing black hole attack.

A Secure Routing Algorithm for Hierarchical Cluster-tree WSN Based on Energy Aware Mechanism

Routing algorithm based on hierarchical cluster-tree topology is comparatively ordinary and easy to expand, yet it lacks consideration in best energy consuming structure in WSN network and the route security problems. This paper exploits energy aware mechanism to make sensible choices of relay node in communication rout, decreasing the hops of data transmitting, saving the energy and prolonging the life time of WSN. On basis of the algorithm, the security problem of net data leakage and missing caused by hostile intrusion is improved with cryptography and authentication. Simulation results show that the algorithm owns advantage over traditional ones based on hierarchical cluster tree topology on aspects of survivability, transmit hopss and network robustness.

SRDPV: secure route discovery and privacy-preserving verification in MANETs

In the routing discovery phase of the Mobile Ad hoc Networks (MANETs), the source node tries to find a fast and secure path to transmit data. However, the adversaries attempt to get the rights of routing during this phase ,then the networks can easily be paralyzed during the data transmission phase. During the routing discovery phase, finding a good path is already a challenge and verifying the security of the established path without revealing any privacy of the nodes adds a new dimension to the problem. In this paper, we present SRDPV, an approach that helps the source find the benign destination dynamically and conducts privacy-preserving verification of the path. Our approach first finds the benign destination. Then, it spreads the verification tasks across multiple nodes and verifies the log entries without revealing private data of the nodes. Unlike the traditional debugging system to detect the faults or misbehaviors of the nodes after the attacks, SRDPV can guarantee the source to avoid transmitting data through malicious nodes at the beginning and perform the verification without introducing a third party. We demonstrate the effectiveness of the approach by applying SRDPV in two scenarios: resisting the collaborative black-hole attack of the AODV protocol and detecting injected malicious intermediated routers which commit active and passive attacks in MANETs. We compared our approach with the existing secure routing algorithms and the results show that our approach can detect the malicious nodes, and the overhead of SRDPV is moderate.

Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

Abstract The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

A Trust and Fuzzy Cluster Based Dynamic Secure Routing Algorithm for Mobile Ad Hoc Networks

Security in communication is an important and challenging issue in the recent years. In the past, many secure routing algorithms have been proposed to provide energy efficiency and security in Mobile Ad hoc Networks. However due to the increase in attackers and new types of attacks, the existing secure routing techniques are challenged by malicious users. In order to handle these problems, a new trust and fuzzy cluster based dynamic secure routing algorithm is proposed in this paper for enhancing energy efficiency and security. For this purpose, a new trust model which uses historical trust, neighbor trust and behavioral trust is proposed in this work for isolating the malicious nodes in the routing process. Moreover, the fuzzy clustering technique proposed in this paper provides energy efficiency by applying cluster head based routing, cluster head rotation and fuzzy decision making. The fuzzy rules also help to handle the uncertainty occurring due to the movement of nodes in the network. From the experiments conducted in this work, it is proved that the proposed algorithm enhances the security of communication which in turn increases the packet delivery ratio and reduces the delay.

A Quality of Service Routing Algorithm in Wireless Sensor Networks

An Quality of Service(QOS) secure routing algorithm based on ant colony optimization is put forward to solve a variety of security problems in wireless sensor networks. The algorithm combines the ant colony optimization algorithm with the credit evaluation mechanism, and introduces the node 's credit as the control factor to obtain better security performance. The algorithm first cuts the network topology according to the QOS requirements, kicks out the nodes that do not meet the QOS requirements, and then quickly converges the route to the optimal route according to the ant colony optimization method. Finally, the security analysis of the algorithm is carried out from various aspects of network layer attack. The experimental results show that the algorithm has very good performance in wireless sensor networks. As a result, it is concluded that it can be widely applied in wireless sensor networks.