Ditipriya Sinha

A CRT based Encryption Methodology for Secure Communication in MANET

MANETs are well known for their flexibility and ease of communication. The communication is purely based on trust, without any need of authentication. This often leads to insecure communication, causing information tampering. The traditional means of security are not sufficient to safeguard against the inherent dangers of MANET. Researchers around the world are working in this issue. The preferred mode of securing data is through encryption. The process of encryption however is complex enough to increase the computational overhead. This paper proposes a secure encryption strategy using Chinese Remainder Theorem for shielding data from unauthorized access. The paper also includes a comparison of proposed method with existing methods General Terms CRT based key generation and secure route detection for secure communication.

MALBACO - a new Multi-Agent Load Balanced Ant Colony Optimization algorithm for MANETs

Mobile ad hoc networks do not have any fixed topology. Routing in such network is very challenging and difficult due to the mobility of the nodes. Ant colony optimization is an efficient optimization technique used to find the optimum shortest route in the adhoc network. This paper describes a new routing algorithm for MANETs using Ant Colony Optimization technique. Special attention has been given to the load balancing and congestion control in network. Simulation work is presently being undertaken to evaluate the performance of the model.

Clar: A Novel Cluster Oriented Agent Based Routing Protocol for Manet

Abstract In this paper we propose a novel algorithm CLAR to build an agent based routing protocol using ACO technique in cluster based mobile ad-hoc networks. Clustering makes possible hierarchical routing in which paths are recorded between cluster-heads instead of nodes. This reduces routing overheads. Presence of an unstable and non-reliable cluster-head degrades the performance of the network since cluster-heads of the network take active role in routing messages between a source destination pair. The proposed algorithm chooses the most reliable and stable node as cluster-head depending on four criteria i.e.: stability, battery power, degree, and trust value of the node. It also uses a multiagent based routing algorithm to generate load balanced routes between source and destination in cluster-based network. Performance of CLAR is compared with other existing efficient algorithms such as AODV, CBRP, Wu & Li’s Algorithm, dominating set based clustering algorithms, agent-based algorithms named as SACO and MALBACO. Simulation results prove that the proposed protocol combines merits of both clustering approach and agent based approach and provides efficient packet delivery even in the presence of high load in the network

A Novel Distributed Clustered Approach towards Building an Agent Based Routing Topology for MANET

The problem of routing is a complex one in case of mobile ad hoc networks due to the dynamic topology. Clusterization is an efficient means of increasing the efficiency of a MANET. A study of several clustering algorithms has lead to the observation that stable, secure cluster head selection increases lifespan and security of the network. The current state of art also relies heavily on ant colony optimization technique for finding the optimum shortest route in case of MANET. This paper proposes an agent based routing protocol for routing packets in a cluster based MANET. The algorithm is proposed to work in a distributed manner, using the concept of dominating set of mobile nodes. The selection of cluster head is determined on the basis of parameters such as connectivity, stability and residual battery power.

LCRACO - A new load and congestion controlled routing based on ant colony optimization

Designing efficient, cost-effective routing solutions for the infrastructure-less MANETs remains a daunting task till date. A proven optimization technique, the Ant colony optimization has been used in this paper to find the optimum in terms of the shortest route in a MANET. Special attention has been given to the load balancing and congestion control in the network. The simulated performance graphs show an improved congestion control for the proposed routing protocol.

CBSRP: Cluster based secure routing protocol

A Mobile Ad hoc Network (MANET) is temporary, transient and infrastructure less. This kind of network plays inevitable role in the different domains of wireless communication such as remote areas, disaster areas and military activities. Routing overheads, integrity, authenticity and secure data transmissions are some of the challenges of MANETs. Proposed CBSRP is a cluster based approach to decrease the routing overheads and concerns on secure data transmission applying Shamirs secret sharing method. For message encryption and decryption the proposed protocol uses RSA-CRT algorithm. Simulation results, evaluate that the performance of CBSRP is more stable compared to other existing routing protocols, even in the presence of malicious nodes.

RSRP: A Robust Secure Routing Protocol in MANET

Abstract In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs). This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR), secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

SRCHS - A Stable Reliable Cluster Head Selection Protocol

A distributed and adaptive clustering algorithm is proposed in this paper. A distributed algorithm is based on dominating set. Dominating set is used for selection of cluster head and gateway nodes. The quality of cluster head is calculated based on connectivity, stability and residual battery power. Clustering is a method to build and maintain hierarchical addresses in mobile adhoc networks. Here, several clustering algorithms are surveyed concentrating on those that are based on graph domination. Long term service as cluster head depletes their energy, causing them to drop out of the network. Stable, secure cluster head selection increases lifespan and security of the network. This technique maintains cluster structure as stable as possible.

Comparative Performance Analysis of AESCRT Using NS2

MANETs are normally used in applications which are highly confidential in nature, such as defense, disaster management, etc. Secure data transmission is one of the challenging issues in MANET. Secret sharing has been one of the popular techniques for implementing security in MANETs. The existing logics for securing the packet delivery seem to involve too many control signal interchanges. This paper discusses the performance of a multiple agent based secured routing scheme to detect secure routes with minimum load on the network. The Chinese remainder theorem is used in generating the secure key by the source node. Source node shares the secure key among all probable routes using multiple agents. The three phased approach is aimed to increase the overall performance in the network. Performance metrics which are used to evaluate the performance of AESCRT are delivery rate, load, malicious nodes and packet dropped. Simulation analysis shows that performance of AESCRT give better result compared to other existing routing protocols.