Sajal Sarkar

Chinese Remainder Theorem-Based RSA-Threshold Cryptography in MANET Using Verifiable Secret Sharing Scheme

A Mobile Ad hoc Network (MANET) is an infrastructure-less system having no designated access points or routers and it has a dynamic topology. MANETs follow a distributed architecture, in which each node can move randomly in an area of operation. MANETs are vulnerable to various attacks. Security services in these kinds of networks are more complex than in traditional networks. In this paper, we implement a new RSA-Threshold Cryptography-based scheme for MANETs using Verifiable Secret Sharing (VSS) scheme [6]. Threshold Cryptography (TC) provides a promise of securing these networks. The proposed scheme is based on the Chinese Remainder Theorem (CRT) under the consideration of Asmuth-Bloom secret sharing scheme [1]1. To the best of our knowledge, such a work does not exist in MANETs. The proposed scheme is efficient in terms of computational security.

A trust based protocol for energy-efficient routing in self-organized MANETs

Mobile ad-hoc network (MANET) is an energy constraint multi-hop network and its nodes have routing capability with limited battery power. In such a network, establishing a correct and efficient route is a crucial design issue. But a more challenging goal is to provide an energy-efficient multi-hop route between source-destination pair. Thus, the routing protocols should setup an energy-efficient route between source-destination pair considering the energy consumption and residual energy of the nodes. Cooperative transmission, a recent technology, optimizes energy consumption of the nodes in the networks. The trust based routing mechanism is one way to form a cooperation among nodes for establishing an energy-efficient route between source-destination pair. In this paper, we first introduce an energy consumption model to calculate the energy-factor1 of the nodes and then propose a trust based protocol for energy-efficient routing. We also adopt a trust module to track the value of routing metric. Simulation results show that our proposed protocol reduces delay, routing overhead, and increases packet delivery ratio by consuming less energy compared to AODV and DSR, the popular existing routing protocols.

AODV-based technique for quick and secure local recovery from link failures in MANETs

Wireless links in MANET may be broken frequently due to nodal mobility and power failures. Such problems make routing protocols, like AODV, inefficient and unreliable. Presently, these problems are solved using local repairing mechanisms at an intermediate node by creating an alternative route to the destination. But it increases routing overhead and unnecessarily consumes MANET resources. Further, if there are no checks on the selection of nodes while creating an alternative route, there is every possibility that a malicious node may take its place in the path. In this paper, we propose a technique which does a quick local recovery from the link failures and also avoids misbehaving nodes to creep in the path. The combined technique improves performances and also consumes less energy of nodes in MANET. Performance analysis and simulation results show that our proposed technique achieves significant performance improvement over existing AODV-based techniques.

A mobility factor based path selection scheme for Mobile Ad-hoc Networks

In this paper, we propose a mobility factor based path selection scheme in Mobile Ad-hoc Network (MANET). In MANET, Nodal mobility is one of the important issues to determine the potential capacity of ad hoc networks. Various mobility metrics have been proposed in the literature as measurement of topological changes in networks. All such metrics describe the link or path stability to allow adaptive routing in MANET based on predicted link behaviour. We investigate and find that a path can become reliable and the average throughput of the network can increase if we select a route considering the mobility of the network nodes. Our proposed scheme selects the nodes to construct a path based on their mobility. In our work a trust value is generated by a trust module that calculates and compares mobility of the concerned nodes. Simulation results show that our proposed scheme performs better than pure Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocols.

A game theoretic model for stochastic routing in self-organized MANETs

In this paper, we propose a game theoretic model for zero-sum stochastic routing game in presence of the intelligent attackers in mobile ad hoc networks (MANETs). In each and every stage of the game, the source node observes the available multiple paths, the residual bandwidth of the paths, quality of the paths, and the strategy of the attackers from the previous stage of the game. Based on this observation, the source node selects an optimal routing strategy by using minimax-Q learning for secure multihop data flow from source to destination through a attack free path among the multiple paths. The selected optimal routing strategy of multihop data flow maximizes the expected payoff defined as the bandwidth utilization. The proposed technique achieves significant performance gains in terms of bandwidth utilization in MANETs. It also provides a randomized security of multihop data flow by accommodating the stochastic multihop data flow, the system dynamics, and the strategic behaviors of the attackers.

A secure and energy-efficient stochastic routing protocol for wireless mobile ad-hoc networks

In this paper, we develop a Markov Chain model for stochastic routing in wireless mobile ad hoc networks (MANETs). We show that using stochastic routing technique the average energy efficiency of the network improves considerably. Besides, the protocol will also secure the data flow in the network as the random data forwarding paths from source to destination will make it difficult for an intruder to intercept, hijack, and jam the data. The intruder in this case will have to listen to all possible paths from the source to the destination. Simulation studies show that our proposed protocol achieves significant performance gains in terms of energy consumption, throughput, delay, and security of the data transmission in MANETs.

An Adaptive Protocol for Stable and Energy-Aware Routing in MANETs

Abstract In mobile ad-hoc networks (MANETs), routing protocols are impaired by its nodes’ mobility, misbehaviour, and insufficient battery power. In order to overcome the above-mentioned impairments of routing protocols, in this paper, we propose a multiple routing metrics based stable and energy-aware routing protocol. In route discovery phase, our proposed protocol establishes a stable, secure, and energy-aware route from a source node to a destination node based on the multiple routing metrics derived considering mobility, energy level, and data packet forwarding statistic of mobile nodes. In route maintenance phase, the protocol monitors neighbours of the intermediate nodes so that it may minimally redefine the established route whenever a link gets disrupted or a node reaches a threshold value with regard to its routing metrics. A trust module is also included in the proposed protocol which gives inputs regarding nodes’ trustworthiness so as to keep a path as reliable as possible. Simulation results show that our protocol increases packet delivery ratio and reduces average end-to-end delay and average energy consumption in different MANET scenarios.

A game theoretic framework for stochastic multipath routing in self-organized MANETs

Abstract In this paper we propose a game theoretic framework for stochastic multipath routing in mobile ad hoc networks (MANETs). In a MANET, intelligent and adaptive attackers may try to hijack, jam or intercept data packets traveling from source to destination. In our proposed game, at each stage the source node keeps track of the available multiple paths, the residual bandwidth of the paths and the strategy of the attackers from the information gathered during the previous stage. Based on these observations, the source node selects a path for data communication and switching strategy among the multiple established paths between the source node and the destination node. Accordingly, it selects an optimal routing strategy to send data packets to the destination at each stage of the game. Using minimax-Q learning, the selected routing strategy maximizes the expected sum of per stage discounted payoff, which is the utilization of residual bandwidth between a source–destination pair along with the probability that the path is safe. Performance analysis and numerical results show that our proposed scheme achieves significant performance gains in terms of residual bandwidth utilization, average end-to-end delay, packet delivery ratio, routing overhead and security.

Cyber security password policy for industrial control networks

An enormous growing of Information Technology and its applications in diverse fields enables us to think for digital world wherein cyberspace is being emerged significantly. After land, sea, air and space, cyberspace is the fifth domain where cybercrime, espionage and cyber weapons are on rising day by day. As a result, cyber security is a multi-dimensional concept and a complex issue straddling many disciplines and fields. Development of Information Technology makes possible to automate the industrial control system (ICS) for its efficient and remote operations. The automation in turn makes the industrial control system vulnerable to cyber security threats. Keeping in mind cyber security as a multi-dimensional complex issue, in this paper we have proposed a password policy for industrial control networks (ICNs) to have highest level of security. Our proposed password policy provides a set of guidelines for all involved individuals and associated systems in ICN and ICS ((IC)2NS) with aim ensure security aspects such as authentication, authorization, confidentiality, integrity, availability, non-repudiation and cyber security best practices in (IC)2NS. The password policy covers password creation criteria, minimum required length of password and character sets for password composition. We have also discussed about the purpose, scope, policy exception, review and enforcement of the password policy in (IC)2NS.